On the continued fraction representation of computable real numbers (Q1096627)

It is well known that each real number x has a unique representation by a continued fraction with integer terms. Using this representation, one can define a computable real number to be one whose continued fraction representation is computable. Furthermore, the computational complexity of a real number can be defined based on the complexity of computing its continued fraction representation. This paper discusses this complexity measure for computable real numbers and compares it with other complexity measures based on the Cauchy sequence representation and the Dedekind cut representation. It was argued that the representation by continued fractions is not an adequate one for the purpose of recursive analysis or complexity theory of analysis. One of the reasons is that addition on this representation is inefficient. The other is that computable real functions defined with this representation could be non-continuous. A correction of this paper has been published [see below (Zbl 0634.03063)].