Degrees of Weakly Computable Reals

This paper studies the degrees of weakly computable reals. It is shown that certain types of limit-recursive reals are Turing incomparable to all weakly computable reals except the recursive and complete ones. Furthermore, it is shown that an r.e. Turing degree is array-recursive iff every real in it is weakly computable.

[1]  C. Yates.  Recursively Enumerable Degrees and the Degrees Less Than 0(1) , 1967 .

[2]  G. Chaitin.  A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.

[3]  C. Jockusch.  Simple Proofs of Some Theorems on High Degrees of Unsolvability , 1977, Canadian Journal of Mathematics.

[4]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[5]  P. Odifreddi.  Classical recursion theory , 1989 .

[6]  Michael Stob,et al.  Array nonrecursive sets and multiple permitting arguments , 1990 .

[7]  R. Downey,et al.  Array nonrecursive degrees and genericity , 1996 .

[8]  S. Cooper,et al.  Computability, enumerability, unsolvability: directions in recursion theory , 1996 .

[9]  S. Ishmukhametov.  Weak recursive degrees and a problem of Spector , 1999 .

[10]  Klaus Weihrauch,et al.  Weakly Computable Real Numbers , 2000, J. Complex..

[11]  Antonín Kucera,et al.  Randomness and Recursive Enumerability , 2001, SIAM J. Comput..

[12]  André Nies,et al.  Trivial Reals , 2002, CCA.

[13]  A. Nies.  Lowness Properties of Reals and Randomness , 2002 .

[14]  Qiu Yu Hui,et al.  Proceedings of the 7th and 8th Asian Logic Conferences , 2003 .

[15]  Guohua Wu,et al.  Degrees of d. c. e. reals , 2004, Math. Log. Q..

[16]  André Nies,et al.  Relativizing Chaitin's Halting Probability , 2005, J. Math. Log..

[17]  A. Nies.  Lowness properties and randomness , 2005 .

[18]  Guohua Wu.  Jump operator and Yates degrees , 2006, J. Symb. Log..