Presentations of computably enumerable reals

This publication has 14 references indexed in Scilit:

• COMPUTABILITY, DEFINABILITY AND ALGEBRAIC STRUCTURES
  Published by World Scientific Pub Co Pte Ltd ,2003
• Degree-Theoretic Aspects of Computably Enumerable Reals
  Published by Cambridge University Press (CUP) ,1999
• Relatively recursive reals and real functions
  Theoretical Computer Science, 1999
• Classifications of degree classes associated with r.e. subspaces
  Annals of Pure and Applied Logic, 1989
• On the continued fraction representation of computable real numbers
  Theoretical Computer Science, 1986
• An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
  Transactions of the American Mathematical Society, 1984
• Recursively enumerable generic sets
  The Journal of Symbolic Logic, 1982
• Computational complexity of real functions
  Theoretical Computer Science, 1982
• A Theory of Program Size Formally Identical to Information Theory
  Journal of the ACM, 1975
• The definition of random sequences
  Information and Control, 1966