Characterization of the computable real numbers by means of primitive recursive functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2064, Issue , 2001, Pages 296-309

  Skordev, Dimiter ^a  

^a UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

COMPUTABLE REAL NUMBERS; END POINTS; NESTED INTERVALS; REAL NUMBER; RECURSIVE SEQUENCES;

RECURSIVE FUNCTIONS;

EID: 0011698011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45335-0_17     Document Type: Conference Paper

References (10)

1. Kalmár, L. A simple example of an unsolvable arithmetical problem. Matematikai és Fizikai Lapok 50 (1943) 1-23 (in Hungarian).
2. Mostowski, A. A lemma concerning recursive functions and its applications. Bull. Acad. Polon. Sci. Cl. III 1 (1953) 277-280.
3. Odifreddi, P. Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers. North-Holland, Amsterdam/New York/Oxford/Tokyo 1989.
4. Rice, H. G. Recursive real numbers. Proc. of the Amer. Math. Soc. 5 (1954) 784-791.
5. Rogers, H. Jr. Theory of Recursive Functions and Effective Computability.McGraw-Hill Book Company, New York/St. Louis/San Francisco/Toronto/London/Sydney 1967.
6. Skolem, T. A theorem on recursively enumerable sets. In: Abstr. of Short Comm. Int. Congress Math., 1962, Stockholm, p. 11.
7. Skordev, D. On a class of primitive recursive functions. Annuaire de l’Univ. de Soá, Fac. de Math. 60 (1965/66) 105-111 (in Russian).
8. 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.
9. Uspensky, V.A. Lectures on Computable Functions. Fizmatgiz, Moscow 1960 (in Russian).
10. Weihrauch, K. Computable Analysis. An Introduction. Springer-Verlag, Berlin/Heidelberg 2000