Wesley Calvert

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 8

Top Topics

Geometric Objects

Subgraph Isomorphism

Top Venues

J. Log. Comput.

Publications

Wesley Calvert, Valentina S. Harizanov, Eugenio G. Omodeo, Alberto Policriti, Alexandra Shlapentokh
In Memory of Martin Davis. CoRR (2024)
Wesley Calvert, Emma Grunner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
Normality, Relativization, and Randomness. CoRR (2023)
Wesley Calvert, Johanna N. Y. Franklin, Dan Turetsky
Structural Highness Notions. J. Symb. Log. 88 (4) (2023)
Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov
Generically Computable Abelian Groups. UCNC (2023)
Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina S. Harizanov, Julia F. Knight, Russell G. Miller, Andrey S. Morozov, Alexandra A. Soskova, Rose Weisshaar
Interpreting a field in its Heisenberg Group. J. Symb. Log. 87 (3) (2022)
Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov
Generically and coarsely computable isomorphisms. Comput. 11 (3-4) (2022)
Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov
Densely computable structures. J. Log. Comput. 32 (3) (2022)
Wesley Calvert, Andrey N. Frolov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Alexandra A. Soskova, Stefan V. Vatev
Strong jump inversion. J. Log. Comput. 28 (7) (2018)
Wesley Calvert, Johanna N. Y. Franklin
Genericity and UD-random reals. J. Log. Anal. 7 (2015)
Wesley Calvert
PAC learning, VC dimension, and the arithmetic hierarchy. Arch. Math. Log. 54 (7-8) (2015)
Wesley Calvert, Valentina S. Harizanov, Alexandra Shlapentokh
Turing Degrees of Isomorphism Types of Geometric Objects. Comput. 3 (2) (2014)
Wesley Calvert
PAC Learning, VC Dimension, and the Arithmetic Hierarchy. CoRR (2014)
Elham Sahebkar Khorasani, Shahram Rahimi, Wesley Calvert
Formalization of Generalized Constraint Language: A Crucial Prelude to Computing With Words. IEEE Trans. Cybern. 43 (1) (2013)
Wesley Calvert
Review of universal semantic communication by B. Juba. SIGACT News 44 (3) (2013)
Wesley Calvert
Review of process algebra: equational theories of communicating processes by J. C. M. Baeten, T. Basten, and M. A. Reniers. SIGACT News 43 (2) (2012)
Wesley Calvert, Ken Kramer, Russell G. Miller
Noncomputable functions in the Blum-Shub-Smale model Log. Methods Comput. Sci. 7 (2) (2011)
Wesley Calvert, Russell G. Miller, Jennifer Chubb Reimann
The Distance Function on a Computable Graph CoRR (2011)
Wesley Calvert
Metric structures and probabilistic computation. Theor. Comput. Sci. 412 (25) (2011)
Wesley Calvert, Ken Kramer, Russell G. Miller
The Cardinality of an Oracle in Blum-Shub-Smale Computation CCA (2010)
Wesley Calvert
Computability of julia sets by Mark Braverman and Michael Yampolsky, Publisher: Springer, 2009. SIGACT News 41 (1) (2010)
Wesley Calvert, Russell G. Miller
Real Computable Manifolds and Homotopy Groups. UC (2009)
Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar
Categoricity of computable infinitary theories. Arch. Math. Log. 48 (1) (2009)
Wesley Calvert, Douglas A. Cenzer, Valentina S. Harizanov, Andrei S. Morozov
Effective categoricity of Abelian p-groups. Ann. Pure Appl. Log. 159 (1-2) (2009)
Wesley Calvert, John E. Porter
Infinitary Queries in Spatial Databases CoRR (2008)
Wesley Calvert
Metric Structures and Probabilistic Computation CoRR (2008)
Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko
Index sets for classes of high rank structures. J. Symb. Log. 72 (4) (2007)
Wesley Calvert, Julia F. Knight, Jessica Millar
, and computable approximation. J. Symb. Log. 71 (1) (2006)
Wesley Calvert, Julia F. Knight
Classification from a Computable Viewpoint. Bull. Symb. Log. 12 (2) (2006)
Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov
Effective categoricity of equivalence structures. Ann. Pure Appl. Log. 141 (1-2) (2006)
Wesley Calvert
-groups of bounded length. J. Symb. Log. 70 (1) (2005)
Wesley Calvert
The isomorphism problem for classes of computable fields. Arch. Math. Log. 43 (3) (2004)