Polynomial differential equations compute all real computable functions on computable compact intervals

Journal of Complexity

Volumn 23, Issue 3, 2007, Pages 317-335

  Bournez, Olivier ^a,b   Campagnolo, Manuel L ^c,d   Graça, Daniel S ^d,e   Hainry, Emmanuel ^b,f  

^a INRIA   (France)

^b LORIA   (France)

^c INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

^d INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

^e UNIVERSITY OF ALGARVE   (Portugal)

^f UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Analog computation; Church Turing thesis; Computable analysis; Differential equations; General Purpose Analog Computer

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DIFFERENTIAL EQUATIONS; FUNCTIONS; MATHEMATICAL MODELS;

COMPUTABLE FUNCTIONS; DIGITAL COMPUTATION; GAMMA FUNCTION; SHANNON'S GENERAL PURPOSE ANALOG COMPUTER (GPAC);

POLYNOMIALS;

EID: 34249708417     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2006.12.005     Document Type: Article

References (22)

1. Arnold V.I. Ordinary Differential Equations (1978), MIT Press, Cambridge, MA
2. Blum L., Shub M., and Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21 1 (1989) 1-46
3. Bournez O., and Hainry E. Recursive analysis characterized as a class of real recursive functions. Fund. Inform. 74 4 (2006) 409-433
4. Bush V. The differential analyzer, A new machine for solving differential equations. J. Franklin Inst. 212 (1931) 447-488
5. Graça D.S. Some recent developments on Shannon's general purpose analog computer. Math. Log. Quart. 50 4-5 (2004) 473-485
6. D.S. Graça, M.L. Campagnolo, J. Buescu, Robust simulations of Turing machines with analytic maps and flows, in: S.B. Cooper, B. Löwe, L. Torenvliet (Eds.), CiE 2005: New Computational Paradigms, Lecture Notes on Computer Science, vol. 3526, Springer, Berlin, 2005, pp. 169-179.
7. D.S. Graça, M.L. Campagnolo, J. Buescu, Computability with polynomial differential equations, Adv. Appl. Math., to appear.
8. Graça D.S., and Costa J.F. Analog computers and recursive functions over the reals. J. Complexity 19 5 (2003) 644-664
9. D. Graça, N. Zhong, J. Buescu, Maximal intervals of computable IVPs are not necessarily computable, Trans. Am. Math. Soc., to appear.
10. Grzegorczyk A. On the definitions of computable real continuous functions. Fund. Math. 44 (1957) 61-71
11. Ko K.-I. Computational Complexity of Real Functions (1991), Birkhäuser, Basel
12. Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles III. C. R. Acad. Sci. Paris 241 (1955) 151-153
13. Lipshitz L., and Rubel L.A. A differentially algebraic replacement theorem, and analog computability. Proc. Am. Math. Soc. 99 2 (1987) 367-372
14. Moore C. Recursion theory on the reals and continuous-time computation. Theor. Comput. Sci. 162 (1996) 23-44
15. Mycka J., and Costa J.F. Real recursive functions and their hierarchy. J. Complexity 20 6 (2004) 835-857
16. Pour-El M.B. Abstract computability and its relations to the general purpose analog computer. Trans. Am. Math. Soc. 199 (1974) 1-28
17. Pour-El M.B., and Richards J.I. Computability in Analysis and Physics (1989), Springer, Berlin
18. Rubel L.A. A survey of transcendentally transcendental functions. Amer. Math. Monthly 96 9 (1989) 777-788
19. Shannon C.E. Mathematical theory of the differential analyzer. J. Math. Phys. 20 (1941) 337-354
20. Siegelmann H.T. Neural Networks and Analog Computation: Beyond the Turing Limit (1999), Birkhäuser, Basel
21. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 2 42 (1936) 230-265
22. Weihrauch K. Computable Analysis: An Introduction (2000), Springer, Berlin