Computability with polynomial differential equations

Advances in Applied Mathematics

Volumn 40, Issue 3, 2008, Pages 330-349

  Graça, Daniel S ^a,b   Campagnolo, Manuel L ^b,c   Buescu, Jorge ^d,e  

^a UNIVERSITY OF ALGARVE   (Portugal)

^b INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

^c INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

^d UNIVERSITY OF LISBON   (Portugal)

^e INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INITIAL VALUE PROBLEMS; POLYNOMIALS; TURING MACHINES;

BOUNDED NOISE; POLYNOMIAL DIFFERENTIAL EQUATIONS; UNIVERSAL TURING MACHINES;

DIFFERENTIAL EQUATIONS;

EID: 40749124093     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1016/j.aam.2007.02.003     Document Type: Article

References (34)

1. Atkinson K.E. An Introduction to Numerical Analysis. second ed. (1989), Wiley
2. Branicky M.S. Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoret. Comput. Sci. 138 1 (1995) 67-100
3. Campagnolo M.L. The complexity of real recursive functions. In: Calude C.S., Dinneen M.J., and Peper F. (Eds). Unconventional Models of Computation (UMC'02). Lecture Notes Comput. Sci. vol. 2509 (2002), Springer 1-14
4. M.L. Campagnolo, Computational complexity of real valued recursive functions and analog circuits, PhD thesis, Instituto Superior Técnico/Universidade Técnica de Lisboa, 2002
5. Campagnolo M.L., Moore C., and Costa J.F. Iteration, inequalities, and differentiability in analog computers. J. Complexity 16 4 (2000) 642-660
6. Campagnolo M.L., Moore C., and Costa J.F. An analog characterization of the Grzegorczyk hierarchy. J. Complexity 18 4 (2002) 977-1000
7. Casey M. The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Comput. 8 (1996) 1135-1178
8. Casey M. Correction to proof that recurrent neural networks can robustly recognize only regular languages. Neural Comput. 10 (1998) 1067-1069
9. Coddington E.A., and Levinson N. Theory of Ordinary Differential Equations (1955), McGraw-Hill
10. Graça D.S., and Costa J.F. Analog computers and recursive functions over the reals. J. Complexity 19 5 (2003) 644-664
11. Graça D.S., Campagnolo M.L., and Buescu J. Robust simulations of Turing machines with analytic maps and flows. In: Cooper S.B., Löwe B., and Torenvliet L. (Eds). CiE 2005: New Computational Paradigms. Lecture Notes Comput. Sci. vol. 3526 (2005), Springer 169-179
12. D. Graça, N. Zhong, J. Buescu, Computability, noncomputability and undecidability of maximal intervals of IVPs, Trans. Amer. Math. Soc., in press
13. Guckenheimer J., and Holmes P. Nonlinear Oscillations, Dynamical Systems, and Bifurcation of Vector Fields (1983), Springer
14. Hirsch M.W., and Smale S. Differential Equations, Dynamical Systems, and Linear Algebra (1974), Academic Press
15. Hubbard J.H., and West B.H. Differential Equations: A Dynamical Systems Approach-Higher-Dimensional Systems (1995), Springer
16. Koiran P. A family of universal recurrent networks. Theoret. Comput. Sci. 168 2 (1996) 473-480
17. Koiran P., and Moore C. Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Theoret. Comput. Sci. 210 1 (1999) 217-223
18. Koiran P., Cosnard M., and Garzon M. Computability with low-dimensional dynamical systems. Theoret. Comput. Sci. 132 (1994) 113-128
19. Lefshetz S. Differential Equations: Geometric Theory. second ed. (1965), Interscience
20. Maass W., and Orponen P. On the effect of analog noise in discrete-time analog computations. Neural Comput. 10 5 (1998) 1071-1095
21. Moore C. Unpredictability and undecidability in dynamical systems. Phys. Rev. Lett. 64 20 (1990) 2354-2357
22. Moore C. Finite-dimensional analog computers: Flows, maps, and recurrent neural networks. In: Calude C., Casti J., and Dinneen M. (Eds). 1st International Conference on Unconventional Models of Computation-UMC'98 (1998), Springer 59-71
23. Mycka J., and Costa J.F. Real recursive functions and their hierarchy. J. Complexity 20 6 (2004) 835-857
24. Pour-El M.B. Abstract computability and its relations to the general purpose analog computer. Trans. Amer. Math. Soc. 199 (1974) 1-28
25. Pour-El M.B., and Richards J.I. The wave equation with computable initial data such that its unique solution is not computable. Adv. Math. 39 (1981) 215-239
26. Pour-El M.B., and Zhong N. The wave equation with computable initial data whose unique solution is nowhere computable. MLQ Math. Log. Q. 43 (1997) 499-509
27. Ritt J.F. Integration in Finite Terms (1948), Columbia Univ. Press
28. Rosenlicht M. Integration in finite terms. Amer. Math. Monthly 79 9 (1972) 963-972
29. Rubel L.A., and Singer F. A differentially algebraic elimination theorem with application to analog computability in the calculus of variations. Proc. Amer. Math. Soc. 94 4 (1985) 653-658
30. Shannon C.E. Mathematical theory of the differential analyzer. J. Math. Phys. MIT 20 (1941) 337-354
31. Siegelmann H.T. Neural Networks and Analog Computation: Beyond the Turing Limit (1999), Birkhäuser
32. Siegelmann H.T., and Sontag E.D. On the computational power of neural networks. J. Comput. System Sci. 50 1 (1995) 132-150
33. Viana M. Dynamical systems: Moving into the next century. In: Engquist B., and Schmid W. (Eds). Mathematics Unlimited-2001 and Beyond (2001), Springer 1167-1178
34. Weihrauch K., and Zhong N. Is wave propagation computable or can wave computers beat the Turing machine?. Proc. London Math. Soc. 85 3 (2002) 312-332