Randomness and the linear degrees of computability

  title={Randomness and the linear degrees of computability},
  author={Andrew E. M. Lewis and George Barmpalias},
  journal={Ann. Pure Appl. Logic},
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤` β, previously denoted α ≤sw β) then β ≤T α. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no `-complete ∆2 real. Upon realizing that quasi-maximality does not characterize the random reals—there exist reals which are not random but which are of quasi-maximal `-degree—it is then natural to ask whether maximality could provide… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references

There is no SW-complete c.e. real

J. Symb. Log. • 2004
View 4 Excerpts
Highly Influenced

Randomness and reducibility

View 3 Excerpts
Highly Influenced

Random reals and Lipschitz continuity

Mathematical Structures in Computer Science • 2006
View 2 Excerpts

A characterisation of c . e . random reals . Theoret

D. Hirschfeldt, G. LaForte
Algorithmic Information Theory • 2002


R. Downey, D. Hirschfeldt, A. Nies
computability, and density SIAM Journal of Computation, Vol. 31 No. 4, pp. 1169–1183 • 2002

Classical recursion theory

P. Odifreddi
Amsterdam Oxford: North-Holand, • 1989

Similar Papers

Loading similar papers…