Wesley Calvert

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computability in infinite Galois theory and algorithmically random algebraic fields
Journal of the London Mathematical Society. Second Series
2024-11-20Paper
Generically Computable abelian groups
Unconventional Computation and Natural Computation
2024-01-12Paper
STRUCTURAL HIGHNESS NOTIONS
Journal of Symbolic Logic
2023-12-22Paper
Normality, Relativization, and Randomness2023-12-15Paper
Computability in infinite Galois theory and algorithmically random algebraic fields2023-12-07Paper
Generically and coarsely computable isomorphisms
Computability
2023-01-12Paper
Densely computable structures
Journal Of Logic And Computation
2022-09-08Paper
INTERPRETING A FIELD IN ITS HEISENBERG GROUP
Journal of Symbolic Logic
2022-08-29Paper
The cardinality of an oracle in Blum-Shub-Smale computation2021-02-16Paper
Interpreting a field in its Heisenberg group
(available as arXiv preprint)
2020-06-21Paper
Generically Computable Equivalence Structures and Isomorphisms2018-08-08Paper
Approximating functions and measuring distance on a graph
Proceedings of the 12th Asian Logic Conference
2017-05-31Paper
Some results on \(\mathbb{R}\)-computable structures
(available as arXiv preprint)
2016-01-27Paper
PAC learning, VC dimension, and the arithmetic hierarchy
Archive for Mathematical Logic
2015-11-18Paper
Genericity and UD-random reals
Journal of Logic and Analysis
2015-08-27Paper
Turing degrees of isomorphism types of geometric objects
Computability
2015-02-24Paper
Degeneration and orbits of tuples and subgroups in an Abelian group.
Journal of Group Theory
2013-08-16Paper
The Distance Function on a Computable Graph2011-11-10Paper
Metric structures and probabilistic computation
Theoretical Computer Science
2011-06-06Paper
Noncomputable functions in the Blum-Shub-Smale model
Logical Methods in Computer Science
2011-05-26Paper
Real Computable Manifolds and Homotopy Groups
Lecture Notes in Computer Science
2009-10-22Paper
Effective categoricity of abelian \(p\)-groups
Annals of Pure and Applied Logic
2009-06-10Paper
Categoricity of computable infinitary theories
Archive for Mathematical Logic
2009-03-17Paper
Index sets of computable structures
Algebra and Logic
2008-12-18Paper
Effective completeness for real computation2008-07-22Paper
Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$2008-03-22Paper
Three notions of effective computation on $\mathbb{R}$2008-03-20Paper
Index sets for classes of high rank structures
Journal of Symbolic Logic
2008-02-25Paper
Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes2007-07-30Paper
Turing degrees of isomorphism types of algebraic objects
Journal of the London Mathematical Society
2007-07-23Paper
Classification from a Computable Viewpoint
The Bulletin of Symbolic Logic
2007-04-05Paper
Effective categoricity of equivalence structures
Annals of Pure and Applied Logic
2006-08-16Paper
Comparing Classes of Finite Structures
Algebra and Logic
2006-07-18Paper
Computable trees of Scott rank ω1CK, and computable approximation
Journal of Symbolic Logic
2006-07-05Paper
The isomorphism problem for computable Abelian p-groups of bounded length
Journal of Symbolic Logic
2006-02-08Paper
The isomorphism problem for classes of computable fields
Archive for Mathematical Logic
2004-12-16Paper
In Memory of Martin Davis
(available as arXiv preprint)
N/APaper
Generically Computable Linear Orderings
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Wesley Calvert