An analog characterization of the Grzegorczyk hierarchy

Journal of Complexity

Volumn 18, Issue 4, 2002, Pages 977-1000

  Campagnolo, Manuel Lameiras ^a   Moore, Cristopher ^b,c,d   Costa, José Félix ^a  

^a UNIVERSITY OF LISBON   (Portugal)

^b SANTA FE INSTITUTE   (United States)

^c University of New Mexico   (United States)

^d UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

Analog computation; Differential equations; Dynamical systems; Elementary functions; Grzegorczyk hierarchy; Primitive recursive functions; Recursion theory; Subrecursive functions

Indexed keywords

EID: 0036889222     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2002.0655     Document Type: Article

References (36)

1. V. I. Arnold, "Equations Différentielles Ordinaires," 5 ed., Mir, Moscow, 1996.
2. O. Bournez, Achilles and the tortoise climbing up the hyper-arithmetical hierarchy, Theoret. Comput. Sci. 210 No. 1 (1999), 21-71.
3. M. D. Bowles, U.S. technological enthusiasm and the British technological skepticism in the age of the analog brain, IEEE Ann. History Comput. 18 No. 4 (1996), 5-15.
4. M. S. Branicky, Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoret. Comput. Sci. 138 No. 1 (1995), 67-100.
5. L. Blum, M. Shub, and 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.
6. P. Clote, Computational models and function algebras, in "Handbook of Computability Theory" (E. R. Griffor, Ed.), pp. 589-681, Elsevier, Amsterdam, 1999.
7. M. L. Campagnolo, C. Moore, and J. F. Costa, Iteration inequalities, and differentiability in analog computers, J. Complexity 16 No. 4 (2000), 642-660.
8. N. J. Cutland, "Computability: An Introduction to Recursive Function Theory," Cambridge Univ. Press, Cambridge, UK, 1980.
9. J. S. Gakwaya, "Extensions de la Hiérarchie de Grzegorczyk dans le modele de calculabilité de Blum, Shub and Smale," Ph.D. thesis, Université de Mons-Hainaut, 1999.
10. A. Grzegorczyk, Some classes of recursive functions, "Rosprawy Matematyzne, Vol. 4, Mathematical Institute of the Polish Academy of Sciences, Poland, 1953.
11. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955), 168-202.
12. A. Grzegorczyk, On the definition of computable real continuous functions, Fund Math. 44 (1957), 61-71.
13. P. Hartman, "Ordinary Differential Equations," 2nd ed., Birkhauser, Basel, 1982.
14. R. A. Horn and C. J. Johnson, "Matrix Analysis," Cambridge Univ. Press, Cambridge, UK, 1985.
15. W. G. Handley and S. S. Wainer, Complexity of primitive recursion, in "Computational Logic" (U. Berger, and H. Schwichtenberg, Eds.) Vol. 165, pp. 273-300, Springer-Verlag, Berlin, 1999.
16. L. Kalmár, Egyzzerü példa eldönthetetlen aritmetikai problémára, Mat. Fiz. Lapok 50 (1943), 1-23.
17. W. Thomson (Lord Kelvin), On an instrument for calculating the integral of the product of two given functions, Proc. Roy. Soc. London 24 (1876), 266-268.
18. K.-I. Ko, "Complexity Theory of Real Functions," Birkhauser, Basel, 1991.
19. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, C. R. Acad. Sci. Paris 240 (1955), 2478-2480.
20. L. Lipshitz and L. A. Rubel, A differentially algebraic replacement theorem, and analog computation, Proc. A. M. S. 99 No. 2 (1987), 367-372.
21. K. Meer, Real number models under various sets of operations, J. Complexity 9 (1993), 366-372.
22. C. Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990), 2354-2357.
23. C. Moore, Recursion theory on the reals and continuous-time computation, Theoret. Comput. Sci. 162 (1996), 23-44.
24. C. Moore, Dynamical recognizers: real-time language recognition by analog computers, Theoret. Comput. Sci. 201 (1998), 99-136.
25. P. Odifreddi, "Classical Recursion Theory II" Elsevier, Amsterdam, 2000.
26. P. Orponen, On the computational power of continuous time neural networks, in "Proceedings SOFSEM'97, the 24th Seminar on Current Trends in Theory and Practice of Informatics," Lecture Notes in Computer Science, pp. 86-103, Springer-Verlag, Berlin, 1997.
27. P. Orponen, A survey of continuous-time computation theory, in "Advances in Algorithms, Languages, and Complexity" (D.-Z. Du and K.-I Ko, Eds.), pp. 209-224, Kluwer Academic Publishers, Dordrecht, 1997.
28. M. B. Pour-El, Abstract computability and its relation to the general purpose analog computer, Trans. Amer. Math. Soc. 199 (1974), 1-28.
29. M. B. Pour-El and J. I. Richards, "Computability in Analysis and Physics," Springer-Verlag, Berlin, 1989.
30. H. E. Rose, "Subrecursion: Functions and Hierarchies," Clarendon Press, Oxford, 1984.
31. H. T. Siegelmann and S. Fishman, Analog computation with dynamical systems, Physica D 120 (1998), 214-235.
32. C. Shannon, Mathematical theory of the differential analyser, J. Math. Phys. 20 (1941),337-354.
33. H. T. Siegelmann, "Neural Networks and Analog Computation: Beyond the Turing Limit," Birkhauser, Basel, 1999.
34. A. Vergis, K. Steiglitz, and B. Dickinson, The complexity of analog computation, Math. Comput. Simulation 28 (1986), 91-113.
35. K. Weihrauch, "Computable Analysis," Springer, Berlin, 2000.
36. Q. Zhou, Subclasses of computable real functions, Lecture Notes in Comput. Sci. 1276 (1997), 156-165.