Journal of Symbolic Logic · 2008 · 29 citations · 13 references
ComputingComputer ScienceMathematicsDiscrete MathematicsNumber TheoryTheory Of ComputationComputability TheoryRandomized ComputationTuring Degrees
Abstract We say that A ≤ LR B if every B -random number is A -random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumerable degrees) and their relationship with the Turing degrees. Among other results we show that whenever ∝ is not GL 2 the LR degree of ∝ bounds degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees.
13
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
T. G. McLaughlin, Gerald E. Sacks · American Mathematical Monthly · 1965 · 217 citations
Lowness properties and randomness
André Nies · Advances in Mathematics · 2004 · 198 citations
R. L. Goodstein · Journal of the London Mathematical Society · 1964 · 136 citations
Yu. L. Ershov · Algebra and Logic · 1968 · 131 citations