Abstract
One usually defines the notion of a computable real number by using recursive functions. However, there is a simple way due to A. Mostowski to characterize the computable real numbers by using only primitive recursive functions.We prove Mostowski’s result differently and apply it to get other simple characterizations of this kind. For instance, a real number is shown to be computable if and only if it belongs to all members of some primitive recursive sequence of nested intervals with rational end points and with lengths arbitrarily closely approaching 0.
Acknowledgments
The author thanks an anonymous referee for many appropriate and useful suggestions. An immense debt of gratitude is owed also to George Barmpalias - he attracted the authors attention to the fact that some essential results of the paper follow immediately from a theorem in Mostowski’s paper [2].
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.
Similar content being viewed by others
References
Kalmár, L. A simple example of an unsolvable arithmetical problem. Matematikai és Fizikai Lapok 50 (1943) 1–23 (in Hungarian).
Mostowski, A. A lemma concerning recursive functions and its applications. Bull. Acad. Polon. Sci. Cl. III 1 (1953) 277–280.
Odifreddi, P. Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers. North-Holland, Amsterdam/New York/Oxford/Tokyo 1989.
Rice, H. G. Recursive real numbers. Proc. of the Amer. Math. Soc. 5 (1954) 784–791.
Rogers, H. Jr. Theory of Recursive Functions and Effective Computability.McGraw-Hill Book Company, New York/St. Louis/San Francisco/Toronto/London/Sydney 1967.
Skolem, T. A theorem on recursively enumerable sets. In: Abstr. of Short Comm. Int. Congress Math., 1962, Stockholm, p. 11.
Skordev, D. On a class of primitive recursive functions. Annuaire de l’Univ. de Sofia, Fac. de Math. 60 (1965/66) 105–111 (in Russian).
Skordev, D. A characterization of the computable real numbers by means of primitive recursive functions. In: Computability and Complexity in Analysis (ed. J. Blanck, V. Brattka, P. Hertling, K. Weihrauch), Informatik Berichte 272:9 (2000), Fernuniversität-Gesamthochschule in Hagen, pp. 389–394.
Uspensky, V.A. Lectures on Computable Functions. Fizmatgiz, Moscow 1960 (in Russian).
Weihrauch, K. Computable Analysis. An Introduction. Springer-Verlag, Berlin/Heidelberg 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skordev, D. (2001). Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-45335-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42197-9
Online ISBN: 978-3-540-45335-2
eBook Packages: Springer Book Archive