Iteration, Inequalities, and Differentiability in Analog Computers

Journal of Complexity

Volumn 16, Issue 4, 2000, Pages 642-660

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

^a UNIVERSITY OF LISBON   (Portugal)

^b SANTA FE INSTITUTE   (United States)

Author keywords

Analog computation; recursion theory; iteration; differentially algebraic functions; primitive recursive functions

Indexed keywords

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

References (33)

1. Babakhanian A. Exponentials in differentially algebraic extension fields. Duke Math. J. 40:1973;455-458.
2. Blum L., Shub M., Smale S. 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.
3. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, Berlin/New York.
4. Bournez O. Achilles and the tortoise climbing up the hyper-arithmetical hierarchy. Theoret. Comput. Sc. 210:1999;21-71.
5. Bowles M. D. U. S. technological enthusiasm and the British technological skepticism in the age of the analog brain. IEEE Ann. History Comput. 18:1996;5-15.
6. Branicky M. S. Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoret. Comput. Sc. 138:1995;67-100.
7. Grzegorczyk A. On the definition of computable real continuous functions. Fund. Math. 44:1957;61-71.
8. Hale J., Koçak H. Dynamics and Bifurcations. 1991;Springer-Verlag, Berlin/New York.
9. Hayman W. K. The growth of solutions of algebraic differential equations. Rend. Mat. Acc. Lincei. 7:1996;67-73.
10. Koiran P., Cosnard M., Garzon M. Computability with low-dimensional dynamical systems. Theoret. Comput. Sc. 132:1994;113-128.
11. Koiran P., Moore C. Closed-form analytic maps in one or two dimensions can simulate Turning machines. Theoret. Comput. Sc. 210:1999;217-223.
12. Lipshitz L., Rubel L. A. A differentially algebraic replacement theorem, and analog computation. Proc. Amer. Math. Soc. 99:1987;367-372.
13. Meer K. Real number models under various sets of operations. J. Complexity. 9:1993;366-372.
14. Moore C. Unpredictability and undecidability in dynamical systems. Phys. Rev. Lett. 64:1990;2354-2357.
15. Moore C. Recursion theory on the reals and continuous-time computation. Theoret. Comput. Sc. 162:1996;23-44.
16. Moore C. Dynamical recognizers: real-time language recognition by analog computers. Theoret. Comput. Sc. 201:1998;99-136.
17. Odifreddi P. Classical Recursion Theory. 1989;Elsevier, Amsterdam.
18. Orponen P. A survey of continuous-time computation theory. Du D.-Z., Ko K.-I. Advances in Algorithms, Languages, and Complexity. 1997;209-224 Kluwer Academic, Dordrecht.
19. Orponen P. On the computational power of continuous time neural networks. Proc. SOFSEM '97, the 24th Seminar on Current Trends in Theory and Practice of Informatics. Lecture Notes in Computer Science. 1997;Springer-Verlag, Berlin/New York. p. 86-103.
20. Ostrowski A. Zum Hölderschen Satz über Γ(x). Math. Annal. 94:1925;248-251.
21. Pour-El M. B. Abstract computability and its relation to the general purpose analog computer. Trans. Amer. Math. Soc. 199:1974;1-28.
22. Pour-El M. B., Richards J. I. Computability in Analysis and Physics. 1989;Springer-Verlag, Berlin/New York.
23. Rubel L. A. Some mathematical limitations of the general-purpose analog computer. Adv. Appl. Math. 9:1988;22-34.
24. Rubel L. A. Digital simulation of analog computation and Church's thesis. J. Symbolic Logic. 54:1989;1011-1017.
25. Rubel L. A. A survey of transcendentally transcendental functions. Amer. Math. Monthly. 96:1989;777-788.
26. Rubel L. A. The extended analog computer. Adv. Appl. Math. 14:1993;39-50.
27. Shannon C. Mathematical theory of the differential analyser. J. Math. Phys. MIT. 20:1941;337-354.
28. Siegelmann H., Sontag E. D. Analog computation via neural networks. Theoret. Comput. Sc. 131:1994;331-360.
29. Siegelmann H. Neural Networks and Analog Computation: Beyond the Turning Limit. 1998;Birkhäuser, Basel.
30. Siegelmann H. T., Fishman S. Analog computation with dynamical systems. Physica D. 120:1998;241-235.
31. Thomson W. On a instrument for calculating the integral of the product of two given functions. Proc. Royal Soc. London. 24:1876;266-268.
32. Vergis A., Steiglitz K., Dickinson B. The complexity of analog computation. Math. Comput. Simulation. 28:1986;91-113.
33. Wang Y., Sontag E. D. Algebraic differential equations and rational control systems. SIAM J. Control Optim. 30:1992;1126-1149.