Presentations of computably enumerable reals

Theoretical Computer Science

Volumn 284, Issue 2, 2002, Pages 539-555

  Downey, Rodney G ^a   LaForte, Geoffrey L ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

Computably enumerable; Kraft Chaitin; Presentation; Real

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; NUMBER THEORY; PROBABILITY; THEOREM PROVING;

ALGORITHMIC INFORMATION THEORY;

COMPUTATIONAL METHODS;

EID: 0037189782     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00110-4     Document Type: Article

References (25)

1. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
2. Degree-theoretic aspects of computably enumerable reals
3. Recursively enumerable reals and Chaitin's Ω number
4. Chaitin's Ω numbers and strong reducibilities
5. A theory of program size formally identical to information theory
6. Computability, definability, and algebraic structures
7. Classification of degree classes associated with r.e. subspaces
8. Relatively recursive reals and real functions
9. On the continued fraction representation of computable real numbers
10. On the computational complexity of real functions
11. Recursively enumerable generic sets
12. The definition of random sequences
13. From axiomatics to intrinsic characterization, some open problems in computable analysis
14. Recursive real numbers
15. Recursion theory and Dedekind cuts
16. Cohesive sets and recursively enumerable Dedekind cuts
17. On computable numbers with an application to the Entscheidungsproblem
18. Arithmetical hierarchy of real numbers