9 citations · 19 across the 22 of their papers we have counts for
22 papers
Normality, Relativization, and Randomness
Wesley Calvert, Emma Grunner, Elvira Mayordomo +2
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized…
Interpreting a field in its Heisenberg group
Rachael Alvir, Wesley Calvert, Grant Goodman +6
We improve on and generalize a 1960 result of Maltsev. For a field , we denote by the Heisenberg group with entries in . Maltsev showed that there is a copy of def…
Strong Jump Inversion
W. Calvert, A. Frolov, V. Harizanov +4
We say that a structure admits \emph{strong jump inversion} provided that for every oracle , if computes for some $\mathcal{C}\cong\mathcal{…
Generically Computable Equivalence Structures and Isomorphisms
Wesley Calvert, Douglas Cenzer, Valentina Harizanov
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence struc…
PAC Learning, VC Dimension, and the Arithmetic Hierarchy
Wesley Calvert
We compute that the index set of PAC-learnable concept classes is -complete within the set of indices for all concept classes of a reasonable form. All concept classes c…
Degeneration and orbits of tuples and subgroups in an Abelian group
Wesley Calvert, Kunal Dutta, Amritanshu Prasad
A tuple (or subgroup) in a group is said to degenerate to another if the latter is an endomorphic image of the former. In a countable reduced abelian group, it is shown that if tup…