Bounded computable enumerability and hierarchy of computably enumerable reals

Authors:
Xizhong Zheng
Affiliations:
Department of Computer Science, Jiangsu University, Zhenjiang, China and Theoretische Informatik, BTU Cottbus, Cottbus, Germany
Venue:
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Year:
2007

Citing 5
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Computable analysis: an introduction

Computable analysis: an introduction
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm
A hierarchy of Turing degrees of divergence bounded computable real numbers

Journal of Complexity
Classification of Computably Approximable Real Numbers

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

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.