8 citations · 11 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
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…
Random numbers as probabilities of machine behaviour
George Barmpalias, Douglas Cenzer, Christopher P. Porter
A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect…