2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.LO2016
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…
cs.LO2014★ 2 cited
Sub-computable Boundedness Randomness
Sam Buss, Douglas Cenzer, Jeffrey B. Remmel
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versi…
cs.LO2010★ 1 cited
Effective Capacity and Randomness of Closed Sets
Douglas Cenzer, Paul Brodhead
We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by…