Wesley Calvert

Orcid: 0000-0002-1355-2694

According to our database1, Wesley Calvert authored at least 29 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
In Memory of Martin Davis.
CoRR, 2024

2023
Structural Highness Notions.
J. Symb. Log., 2023

Normality, Relativization, and Randomness.
CoRR, 2023

Generically Computable Abelian Groups.
Proceedings of the Unconventional Computation and Natural Computation, 2023

2022
Densely computable structures.
J. Log. Comput., 2022

Interpreting a field in its Heisenberg Group.
J. Symb. Log., 2022

Generically and coarsely computable isomorphisms.
Comput., 2022

2018
Strong jump inversion.
J. Log. Comput., 2018

2015
Genericity and UD-random reals.
J. Log. Anal., 2015

PAC learning, VC dimension, and the arithmetic hierarchy.
Arch. Math. Log., 2015

2014
Turing Degrees of Isomorphism Types of Geometric Objects.
Comput., 2014

2013
Formalization of Generalized Constraint Language: A Crucial Prelude to Computing With Words.
IEEE Trans. Cybern., 2013

Review of universal semantic communication by B. Juba.
SIGACT News, 2013

2012
Review of process algebra: equational theories of communicating processes by J. C. M. Baeten, T. Basten, and M. A. Reniers.
SIGACT News, 2012

2011
Metric structures and probabilistic computation.
Theor. Comput. Sci., 2011

The Distance Function on a Computable Graph
CoRR, 2011

Noncomputable functions in the Blum-Shub-Smale model
Log. Methods Comput. Sci., 2011

2010
Computability of julia sets by Mark Braverman and Michael Yampolsky, Publisher: Springer, 2009.
SIGACT News, 2010

The Cardinality of an Oracle in Blum-Shub-Smale Computation
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009
Effective categoricity of Abelian p-groups.
Ann. Pure Appl. Log., 2009

Categoricity of computable infinitary theories.
Arch. Math. Log., 2009

Real Computable Manifolds and Homotopy Groups.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008
Infinitary Queries in Spatial Databases
CoRR, 2008

2007
Index sets for classes of high rank structures.
J. Symb. Log., 2007

2006
Computable trees of Scott rank ω<sub>1</sub><sup>CK</sup>, and computable approximation.
J. Symb. Log., 2006

Classification from a Computable Viewpoint.
Bull. Symb. Log., 2006

Effective categoricity of equivalence structures.
Ann. Pure Appl. Log., 2006

2005
The isomorphism problem for computable Abelian <i>p</i>-groups of bounded length.
J. Symb. Log., 2005

2004
The isomorphism problem for classes of computable fields.
Arch. Math. Log., 2004


  Loading...