On the continued fraction representation of computable real numbers
Theoretical Computer Science
Complexity theory of real functions
Complexity theory of real functions
A note on best fractions of a computable real number
Journal of Complexity
Primitive Recursiveness of Real Numbers under Different Representations
Electronic Notes in Theoretical Computer Science (ENTCS)
A computability theory of real numbers
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 5.23 |
We study, in this paper, the relationship among the classes of logarithmic-space computable real numbers under different representations. We consider logarithmic-space computable real numbers under the Cauchy function representation, the general left cut representation, the standard left cut representation, and the binary expansion representation. It is shown that the relationship among these classes of real numbers depends on the relationship between the discrete complexity classes P"1 and L"1, the classes of tally sets in P and L, respectively. First, if P"1=L"1, then the relationship among the four classes of logarithmic-space computable real numbers is the same as that among these classes of polynomial-time computable real numbers. On the other hand, if P"1L"1, then we get different relationships from those among classes of polynomial-time computable real numbers. For instance, while the classes of polynomial-time computable real numbers under the general left cut and the Cauchy function representations are equivalent, we show, under the assumption of P"1L"1, that the class of logarithmic-space computable real numbers under the general left cut representation properly contains the class of logarithmic-space computable real numbers under the Cauchy function representation. In addition, if P"1L"1, then the two classes of logarithmic-space computable real numbers under the standard left cut and the Cauchy function representations are incomparable.