An analog characterization of elementarily computable functions over the real numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 269-280

  Bournez, Olivier ^a   Hainry, Emmanuel ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; TURING MACHINES;

ANALOG MODELS; BASIC FUNCTIONS; COMPUTABLE FUNCTIONS; HIGHER-ORDER; LINEAR INTEGRATION; REAL NUMBER; RECURSIVE ANALYSIS;

COMPUTABILITY AND DECIDABILITY;

EID: 33645602913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_25     Document Type: Article

References (30)

1. V. I. Arnold. Ordinary Differential Equations. MIT Press, 1978.
2. E. Asarin and A. Bouajjani. Perturbed Turing machines and hybrid systems. In Logic in computer science, pages 269-278, 2001.
3. E. Asarin and O. Maler. Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences, 57(3):389-398, dec 1998.
4. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.
5. O. Bournez. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. Theoretical Computer Science, 210(1):21-71, 6 1999.
6. O. Bournez. Complexité algorithmique des systèmes dynamiques continus et hybrides. PhD thesis, École Normale Supérieure de Lyon, janvier 1999.
7. M. Bowles. United States technological enthusiasm and the british technological skepticism in the age of the analog brain. In IEEE Annals of the History of Computing, volume 4, pages 5-15, 1996.
8. M. Campagnolo, C. Moore, and J. F. Costa. An analog characterization of the Grzegorczyk hierarchy. Journal of Complexity, 18(4):977-1000, 2002.
9. M. L. Campagnolo. Computational complexity of real valued recursive functions and analog circuits. PhD thesis, Universidade Técnica de Lisboa, 2001.
10. G. Etesi and I. Németi. Non-Turing computations via Malament-Hogarth space-times. International Journal Theoretical Physics, 41:341-370, 2002.
11. D. Graça and J. F. Costa. Analog computers and recursive functions over the reals. Journal of Complexity, 19:644-664, 2003.
12. A. Grzegorczyk. Computable functionals. Fundamenta Mathematicae, 42:168-202, 1955.
13. T. Henzinger and J.-F. Raskin. Robust undecidability of timed and hybrid systems. Hybrid systems: computation and control; second international workshop, hscc'99, berg en dal, the netherlands, march 29-31, 1999; proceedings, 1569, 1999.
14. M. L. Hogarth. Does general relativity allow an observer to view an eternity in a finite time? Foundations of physics letters, 5:173-181, 1992.
15. D. Lacombe. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles III. Comptes rendus de l'Académie des Sciences Paris, 241:151-153, 1955.
16. L. Lipshitz and L. A. rubel. A differentially algebraic replacement theorem, and analog computability. Proceedings of the American Mathematical Society, 99(2):367-372, February 1987.
17. C. Moore. Recursion theory on the reals and continuous-time computation. Theoretical Computer Science, 162(1):23-44, 5 1996.
18. J. Mycka. Infinite limits and R-recursive functions. Acta Cybernetica, 16:83-91, 2003.
19. J. Mycka. μ-recursion and infinite limits. Theoretical Computer Science, 302:123-133, 2003.
20. P. Odifreddi. Classical recursion theory II. North-Holland, 1999.
21. T. Ord. Hypercomputation: computing more than the Turing machine. Technical report, University of Melbourne, September 2002. available at http://www.arxiv.org/abs/math.lo/0209332.
22. P. Orponen. Algorithms, languages and complexity, chapter A survey of continuous-time computational theory, pages 209-224. Kluwer Academic Publishers, 1997.
23. M. B. Pour-El. Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers). Transactions of the American Mathematical Society, 199:1-28, 1974.
24. H. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, 1984.
25. C. E. Shannon. Mathematical theory of the differential analyser. Journal of Mathematics and Physics MIT, 20:337-354, 1941.
26. H. Siegelmann. Neural networks and analog computation - beyond the Turing limit. Birkauser, 1998.
27. W. Thomson. On an instrument for calculating the integral of the product of two given functions. In Proceedings of the royal society of London, number 24, pages 266-276, 1876.
28. A. Turing. On computable numbers, with an application to the "Entschei-dungs-problem". In Proceedings of the london mathematical society, volume 2, pages 230-265, 1936.
29. K. Weihrauch. Computable Analysis. Springer, 2000.
30. Q. Zhou. Subclasses of computable real valued functions. Lecture Notes in Computer Science, 1276:156-165, 1997.