Douglas Cenzer

activity

20102024

most citedSub-computable Boundedness Randomness

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing math.LOShow all

2 papers · 1 filter

math.LO2024

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.…

math.LO2016

The random members of a $Π_{1}^{0}$ class

Douglas Cenzer, Christopher P. Porter

We examine several notions of randomness for elements in a given $Π_{1}^{0}$ class $P$ . Such an effectively closed subset $P$ of $2^{ω}$ may be viewed as the set of i…

Generically Computable Linear Orderings

The random members of a Π10​ class

The random members of a $Π_{1}^{0}$ class