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.
This work is supported by DFG (446 CHV 113/240/0-1) and NSFC (10420130638).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooper, B.S.: Degrees of Unsolvability. Ph.D thesis, Leicester University, Leicester, England (1971)
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)
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg, Monograph to be published
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)
Gold, E.M.: Limiting recursion. J. Symbolic Logic 30, 28–48 (1965)
Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. J. Symbolic Logic 30, 49–57 (1965)
Rettinger, R., Zheng, X.: A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complexity 22(6), 818–826 (2006)
Soare, R.I.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math. 31, 215–231 (1969)
Soare, R.I.: Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 140, 271–294 (1969)
Soare, R.I.: Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)
Weihrauch, K.: Computable Analysis, An Introduction. Springer, Heidelberg (2000)
Zheng, X.: Classification of the computably approximable real numbers. Theory of Computing Systems (to appear)
Zheng, X.: Recursive approximability of real numbers. Mathematical Logic Quarterly 48(Suppl. 1), 131–156 (2002)
Zheng, X.: Computability Theory of Real Numbers. Habilitation’s thesis, BTU Cottbus, Germany (February 2005)
Zheng, X., Rettinger, R.: Weak computability and representation of reals. Mathematical Logic Quarterly 50(4/5), 431–442 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, X. (2007). Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)