Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals

  • Xizhong Zheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4598)

Abstract

The computable enumerability (c.e., for short) is one of the most important notion in computability theory and is regarded as the first weakening of the computability. In this paper, we explore further possible weakening of computable enumerability. By restricting numbers of possible big jumps in an increasing computable sequence of rational numbers which converges to a c.e. real number we introduce the notion of h-bounded c.e. reals and then shown that it leads naturally to an Ershov-style hierarchy of c.e. reals. However, the similar idea does not work for c.e. sets. We show that there is a computability gap between computable reals and the reals of c.e. binary expansions.

Keywords

c.e. sets c.e. reals bounded c.e. reals Ershov’s Hierarchy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cooper, B.S.: Degrees of Unsolvability. Ph.D thesis, Leicester University, Leicester, England (1971)Google Scholar
  2. 2.
    Downey, R.G.: Some computability-theoretic aspects of reals and randomness. In: The Notre Dame lectures. Assoc. Symbol. Logic. Lect. Notes Log., vol. 18, pp. 97–147. Urbana, IL (2005)Google Scholar
  3. 3.
    Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg, Monograph to be publishedGoogle Scholar
  4. 4.
    Ershov, Y.L.: A certain hierarchy of sets. i, ii, iii. (Russian). Algebra i Logika. 7(1), 47–73 (1968), 7(4), 15–47 (1968), 9, 34–51 (1970)Google Scholar
  5. 5.
    Gold, E.M.: Limiting recursion. J. Symbolic Logic 30, 28–48 (1965)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. J. Symbolic Logic 30, 49–57 (1965)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Rettinger, R., Zheng, X.: A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complexity 22(6), 818–826 (2006)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Soare, R.I.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math. 31, 215–231 (1969)MATHMathSciNetGoogle Scholar
  9. 9.
    Soare, R.I.: Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 140, 271–294 (1969)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Soare, R.I.: Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)Google Scholar
  11. 11.
    Weihrauch, K.: Computable Analysis, An Introduction. Springer, Heidelberg (2000)MATHGoogle Scholar
  12. 12.
    Zheng, X.: Classification of the computably approximable real numbers. Theory of Computing Systems (to appear)Google Scholar
  13. 13.
    Zheng, X.: Recursive approximability of real numbers. Mathematical Logic Quarterly 48(Suppl. 1), 131–156 (2002)MATHGoogle Scholar
  14. 14.
    Zheng, X.: Computability Theory of Real Numbers. Habilitation’s thesis, BTU Cottbus, Germany (February 2005)Google Scholar
  15. 15.
    Zheng, X., Rettinger, R.: Weak computability and representation of reals. Mathematical Logic Quarterly 50(4/5), 431–442 (2004)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xizhong Zheng
    • 1
    • 2
  1. 1.Department of Computer Science, Jiangsu University, Zhenjiang 212013China
  2. 2.Theoretische Informatik, BTU Cottbus, D-03044 CottbusGermany

Personalised recommendations