Lowness properties and approximations of the jump

Electronic Notes in Theoretical Computer Science

Volumn 143, Issue SPEC. ISS., 2006, Pages 45-57

  Figueira, Santiago ^a   Nies, André ^b   Stephan, Frank ^c  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

r.e.; K triviality; Kolmogorov complexity; Lowness; Traceability

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; NUMBER THEORY;

Ω-R.E.; K-TRIVIALITY; KOLMOGOROV COMPLEXITY; LOWNESS; TRACEABILITY;

APPROXIMATION THEORY;

EID: 29344473545     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.05.025     Document Type: Conference Paper

References (12)

1. K. Ambos-Spies, C. Jockusch, and R. Shore An algebraic decomposition of the recursively enumerable degrees and classes equal to the promptly simple degrees Transactions of the American Mathematical Society 281 1984 109 128
2. M. Bickford and F. Mills, Lowness properties of r.e. sets, Manuscript, UW Madison, 1982
3. C. Calude, P. Hertling, B. Khoussainov, and Y. Wang Recursively enumerable reals and Chaitin's Ω number STACS 1998 Lecture Notes in Computer Science 1373 1998 596 606
4. G. Chaitin A theory of program size formally identical to information theory Journal of the Association for Computing Machinery 22 1975 329 340
5. R. Downey, D. Hirschfeldt, A. Nies, and F. Stephan Trivial reals Proceedings of the 7th and 8th Asian Logic Conferences 2003 World Scientific River Edge, NJ 103 131
6. B. Kjos-Hanssen, W. Merkle and F. Stephan, Kolmogorov complexity and the Recursion theorem, Manuscript, 2005
7. J. Mohrherr A refinement of low n and high n for the r.e. degrees Z. Math. Logik Grundlag. Math. 32 1 1986 5 12
8. A. Nies, Lowness properties and randomness, to appear in Advances in Math.
9. A. Nies, Reals which compute little, CDMTCS Research Report 202, Dec. 2002
10. P.G. Odifreddi Classical recursion theory Volume 1 1989 North-Holland Amsterdam Classical recursion theory Volume 2 1999 Elsevier Amsterdam
11. R. Soare Recursively enumerable sets and degrees 1987 Springer Heidelberg
12. S. Terwijn, and D. Zambella Algorithmic randomness and lowness J. Symbolic Logic 66 2001 1199 1205