Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
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.
Keywordsc.e. sets c.e. reals bounded c.e. reals Ershov’s Hierarchy
Unable to display preview. Download preview PDF.
- 1.Cooper, B.S.: Degrees of Unsolvability. Ph.D thesis, Leicester University, Leicester, England (1971)Google Scholar
- 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.Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg, Monograph to be publishedGoogle Scholar
- 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
- 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
- 12.Zheng, X.: Classification of the computably approximable real numbers. Theory of Computing Systems (to appear)Google Scholar
- 14.Zheng, X.: Computability Theory of Real Numbers. Habilitation’s thesis, BTU Cottbus, Germany (February 2005)Google Scholar