8 citations · 11 across the 14 of their papers we have counts for
9 papers · 1 filter
sp-Homogeneous Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +2
We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enu…
Generically Computable Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +1
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the hierarchy. We focus on linear orderings.…
Randomness extraction in computability theory
Douglas Cenzer, Christopher P. Porter
In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measur…
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…
The random members of a class
Douglas Cenzer, Christopher P. Porter
We examine several notions of randomness for elements in a given class . Such an effectively closed subset of may be viewed as the set of i…
Computability and Categoricity of Weakly Ultrahomogeneous Structures
Francis Adams, Douglas Cenzer
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is categorical. A structure A…