Real recursive functions and their heirarchy

Journal of Complexity

Volumn 20, Issue 6, 2004, Pages 835-857

  Mycka, Jerzy ^a   Costa, José Félix ^b  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Analog computation; General purpose analog computer; Recursive functions over the reals

Indexed keywords

ANALOG COMPUTERS; BESSEL FUNCTIONS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; GENERAL PURPOSE COMPUTERS; MATHEMATICAL MODELS;

ANALOG COMPUTATION; GENERAL PURPOSE ANALOG COMPUTER; RECURSIVE FUNCTIONS-OVER-THE REALS;

RECURSIVE FUNCTIONS;

EID: 10244239347     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jco.2004.06.001     Document Type: Article

References (24)

1. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, Berlin, 1998.
2. P. Boldi, S. Vigna, Equality is a jump, Theoret. Comput. Sci. 219 (1-2) (1999) 49-64.
3. M.L. Campagnolo, The complexity of real recursive functions, C.S. Calude, M.J. Dinneen, F. Peper (Eds.), Unconventional Models of Computation, UNIC 2002, Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, 2002, pp. 1-14.
4. M.L. Campagnolo, C. Moore, J.F. Costa, Iteration, inequalities, and differentiability in analog computers, J. Complexity 16 (4) (2000) 642-660.
5. M.L. Campagnolo, C. Moore, J.F. Costa, An analog characterization of the Grzegorczyk hierarchy, J. Complexity 18 (4) (2002) 977-1000.
6. B.J. Copeland, Even Turing machines can compute uncomputable functions, in: C.S. Calude, J. Casti, M.J. Dinneen (Eds.), Unconventional Models of Computation, Springer, Berlin, 1998.
7. L.D. Kudryavtsev, Encyclopaedia of Mathematics, Upper and lower bounds, Kluwer Academic Publishers, Dordrecht, 1993.
8. D. Graça, J.F. Costa, Analog computers and recursive functions over the reals, J. Complexity 19 (2003) 644-664.
9. G. Etesi, I. Nemeti, Non-Turing computations via Malament Hogarth space-times, Internal. J. Theoret. Phys. 41(2002)341-370.
10. S.K. Kleene, Arithmetical predicates and quantifiers, Trans. Amer. Math. Soc. 79 (1955) 312-340.
11. P. Koiran, C. Moore, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, Theoret. Comput. Sci. 210 (1) (1999) 217-223.
12. L. Lipshitz, L.A. Rubel, A differentially algebraic replacement theorem, and analog computation, Proc. Amer. Math. Soc. 99 (2) (1987) 367-372.
13. C. Moore, Recursion theory on the reals and continuous-time computation, Theoret. Comput. Sci. 162 (1996) 23-44.
14. J. Mycka, μ-recursion and infinite limits, Theoret. Comput. Sci. 302 (2003) 123-133.
15. P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, 1989.
16. R. Penrose, The Emperor's New Mind, Oxford University Press, Oxford, 1989.
17. M.B. Pour-El, Abstract computability and its relations to the general purpose analog computer, Trans. Amer. Math. Soc. 199 (1974) 1-28.
18. S. Puchta, On the role ofmathernatics and mathematical knowledge in the invention of Vannevar Bush's early analog computers, IEEE Ann. History Comput. 18 (4) (1996) 49-59.
19. Y. Rogozhin, Small universal Turing machines. Universal machines and computations, Theoret. Comput. Sci. 168 (2) (1996) 215-240.
20. L.A. Rubel, Some mathematical limitations of the general-purpose analog computer, Adv. Appl. Math. 9 (1988) 22-34.
21. L.A. Rubel, The extended analog computer, Adv. Appl. Math. 14 (1993) 39-50.
22. C. Shannon, Mathematical theory of the differential analyzer, J. Math. Phys. MIT 20 (1941) 337-354.
23. F. Tipler, The Physics of Immortality: Modem Cosmology, God and the Resurrection of the Dead, Anchor, 1997.
24. Z. Xia, The existence of noncollision singularities in Newtonian systems, Ann. Math. 135 (3) (1992) 411-468.