8 citations · 11 across the 14 of their papers we have counts for
15 papers
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 probability of a computable output from a random oracle
George Barmpalias, Douglas Cenzer, Christopher P. Porter
Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation.…
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…