Computably enumerable sets in the Solovay and the strong weak truth table degrees

Lecture Notes in Computer Science

Volumn 3526, Issue , 2005, Pages 8-17

  Barmpalias, George ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; SET THEORY;

COMPUTABILITY THEORY; DIFFERENTIAL GEOMETRY; SOLOVAY DEGREES; TRUTH TABLE DEGREES;

COMPUTER SCIENCE;

EID: 26444568238     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494645_2     Document Type: Conference Paper

References (8)

1. R. Downey; D. Hirschfeldt; G. LaForte, Randomness and reducibility. Journal of Computer and System Sciences 68 (2004) 96-114
2. R. Downey; D. Hirschfeldt; G. LaForte, Randomness and reducibility. Mathematical foundations of computer science, 2001, 316-327, Lecture Notes in Comput. Sci., 2136, Springer, Berlin, 2001.
3. R. Downey, D. Hirschfeldt and A. Nies, Randomness, computability, and density SIAM Journal of Computation, Vol. 31 No. 4, pp. 1169-1183 (2002)
4. R. Downey, Some Recent Progress in Algorithmic Randomness. Preprint, 2004.
5. P. Odifreddi, 'Classical recursion theory' Amsterdam Oxford: North-Holand, 1989
6. L. Yu and D. Ding, There is no SW-complete c.e. real, to appear in J. Symb. Logic.
7. R. Soare, Computability Theory and Differential Geometry, to appear in the Bulletin of Symbolic Logic.
8. R. Soare, Recursively enumerable sets and degrees, Berlin London: Springer-Verlag, 1987.