Computably enumerable reals and uniformly presentable ideals

Mathematical Logic Quarterly

Volumn 48, Issue SUPPL. 1, 2002, Pages 29-40

  Downey, Rod ^a   Terwijn, Sebastiaan A ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b VU UNIVERSITY MEDICAL CENTER   (Netherlands)

Author keywords

C.e. reals; Presentations; wtt degrees; 30 ideals

Indexed keywords

EID: 0036436250     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/1521-3870(200210)48:1+<29::aid-malq29>3.0.co;2-o     Document Type: Article

References (18)

1. Ambos-Spies, K., A. Nies, and R.A. Shore, The theory of the recursively enumerable weak truth-table degrees is undecidable. Journal of Symbolic Logic 57 (1992), 864-874.
2. Calude, C., Information Theory and Randomness, an Algorithmic Perspective. Springer-Verlag, Berlin, 1994.
3. Calude, C., R. Coles, P. Hertling, and B. Khoussainov, Degree-theoretic aspects of computably enumerable reals. In: Models and Computability (Cooper and Truss, eds.), Cambridge University Press, 1999.
4. Calude, C., P. Hertling, B. Khoussainov, and Y. Wang, Recursively enumerable reals and Chaitin's Ω numbers. In: STACS '98, Springer Lecture Notes in Computer Science 1373, 1998, pp. 596-606.
5. Calude, C. and A. Nies, Chaitin's Ω numbers and strong reducibilities. Journal of Universal Computer Science 11(3) (1997), 1162-1166.
6. Chaitin, G., A theory of program size formally identical to information theory. Journal of the ACM 22 (1975), 329-340.
7. Downey, R., and G. Laforte, On presentations of computably enumerable reals. Theor. Comput. Sci. 284(2) (2002), 539-555.
8. Downey, R.G., and J.B. Remmel, Classification of degree classes associated with r.e. subspaces. Ann. Pure and Appl. Logic 42 (1989), 105-125.
9. Ko, Ker-I, On the continued fraction representation of computable real numbers. Theor. Comput. Sci. A 47 (1986), 299-313.
10. Li, M. and P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications. 2nd edition, Springer-Verlag, 1997.
11. Martin-Löf, P., The definition of random sequences. Information and Control 9 (1966), 602-619.
12. Odifreddi, P.G., Classical Recursion Theory, Vol. II. North-Holland, 1999.
13. Pour-El, M. and I. Richards, Computability in Analysis and Physics. Springer-Verlag, Berlin, 1989.
14. Soare, R., Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 140 (1969), 271-294.
15. Soare, R., Recursively enumerable sets and degrees. Springer, 1987.
16. Turing, A., On computable numbers, with an application to the Entscheidungsproblem. Proc. Amer. Math. Soc. 43 (1937), 544-546.
17. Weihrauch, K., Computability. Springer-Verlag, 1987.
18. Wu, G., Prefix-free languages and initial segments of computably enumerable degrees. In: Computing and Combinatorics (J. Wang, ed.), Springer Lecture Notes in Computer Science 2108, 2001, pp. 576-585.