Publication | Closed Access
The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness
19
Citations
16
References
2010
Year
Turing MachineEngineeringEntropyEffective RandomnessComputational ComplexityProbabilistic ComputationProbability TheoryComputer ScienceDiscrete MathematicsRandomized AlgorithmKolmogorov ComplexityStatisticsPa Turing DegreeHalting ProblemComputability Theory
Abstract We prove a number of results in effective randomness, using methods in which Π 1 0 classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.
| Year | Citations | |
|---|---|---|
Page 1
Page 1