Infinite limits and R-recursive functions

Acta Cybernetica

Volumn 16, Issue 1, 2003, Pages 83-91

  Mycka, Jerzy ^a  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

Real recursive function; Theory of computation

Indexed keywords

EID: 0038457366     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989), 1-46.
2. V. Brattka, Recursive characterization of computable real-valued functions and relations, Th. Comp. Sc. 162 (1996) 45-77. (Pubitemid 126411998)
3. K. Gödel, Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I, Monatsh. Math. Phys. 38 (1931), 173-198.
4. A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957), 61-71.
5. C. Moore, Recursion theory on the reals and continuous-time computation, Th. Comp. Sc., 162 (1996) 23-44 (Pubitemid 126411997)
6. P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, (1989).
7. L. A. Rubel, The extended analog computer, Adv. in Appl. Math. 14 (1993) 39-50.
8. J. R. Shoenfield, On degrees of unsolvability, Ann. Math. 69 (1959), 644-653.
9. A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 42 (1936-37), 230-265.