Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy

Theoretical Computer Science

Volumn 210, Issue 1, 1999, Pages 21-71

  Bournez, Olivier ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Computability; Derivative systems; Hybrid systems; Hyper arithmetical hierarchy; Piecewise constant

Indexed keywords

EID: 0002260412     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00096-6     Document Type: Article

References (16)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.M. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, The algorithmic analysis of hybrid systems, Theoret. Comput. Sci. 138 (1995) 3-34.
2. E. Asarin, O. Maler, On some relations between dynamical systems and transition systems, Proc. ICALP, Lecture Notes in Computer Science, vol 820, Springer, Berlin, 1994, pp. 59-72.
3. E. Asarin, O. Maler, Achilles and the Tortoise climbing up the arithmetical hierarchy, Proc. FSTTCS, Lecture Notes in Computer Science, vol. 1026, Springer, Berlin, 1995, pp. 471-483.
4. E. Asarin, O. Maler, A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoret. Comput. Sci. 138 (1995) 33-65.
5. L. Blum, M. Shub, 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 (1) (1989) 1-46.
6. O. Bournez, Achilles and the tortoise climbing up the hyperarithmetical hierarchy, Technical Report, LIP ENS-Lyon, 1997.
7. O. Bournez, Some bounds on the computational power of piecewise constant derivative systems, Proc. ICALP'97, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 143-153.
8. O. Bournez, Some bounds on the computational power of purely rational piecewise constant derivative systems, Technical Report, LIP ENS-Lyon, 1997.
9. O. Bournez, M. Cosnard, On the computational power of hybrid and dynamical systems, Theoret. Comput. Sci. 168 (2) (1996) 417-459.
10. M.S. Branicky, Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoret. Comput. Sci. 138 (1995) 67-100.
11. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory Languages and Computation, Addison-Wesley, Reading, MA, 1979.
12. P. Koiran, Computing over the reals with addition and order, Theoret. Comput. Sci. 133 (1994) 35-47.
13. K. Meer, C. Michaux, A survey on real structural complexity theory, Bull. Belg. Math. Soc. - Simon Stevin, to be published.
14. C. Moore, Recursion theory on the reals and continuous-time computation, Theoret. Comput. Sci. 162 (1996) 23-44.
15. P. Odifreddi, Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, vol. 125, Elsevier, Amsterdam, 1992.
16. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.