C. Moore, Unpredictability and undecidability in dynamical systems, Physical Review Letters, vol.64, issue.20, pp.2354-2357, 1990.
DOI : 10.1103/PhysRevLett.64.2354

M. S. Branicky, Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoretical Computer Science, vol.138, issue.1, pp.67-100, 1995.
DOI : 10.1016/0304-3975(94)00147-B

E. Asarin and O. Maler, Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy, Journal of Computer and System Sciences, vol.57, issue.3, pp.389-398, 1998.
DOI : 10.1006/jcss.1998.1601

O. Bournez, Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy, Theoretical Computer Science, vol.210, issue.1, pp.21-71, 1999.
DOI : 10.1016/S0304-3975(98)00096-6

P. Koiran and C. Moore, Closed-form analytic maps in one and two dimensions can simulate universal turing machines, Theoretical Computer Science, vol.210, issue.1, pp.217-223, 1999.
DOI : 10.1016/S0304-3975(98)00117-0

D. S. Graça, M. L. Campagnolo, and J. Buescu, Computability with polynomial differential equations, Advances in Applied Mathematics, vol.40, issue.3, pp.330-349, 2008.
DOI : 10.1016/j.aam.2007.02.003

T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, What's Decidable about Hybrid Automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.
DOI : 10.1006/jcss.1998.1581
URL : http://doi.org/10.1006/jcss.1998.1581

E. Asarin, O. Maler, and A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoretical Computer Science, vol.138, issue.1, pp.35-65, 1995.
DOI : 10.1016/0304-3975(94)00228-B

E. Asarin and A. Bouajjani, Perturbed Turing machines and hybrid systems, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.269-278, 2001.
DOI : 10.1109/LICS.2001.932503
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.3070

M. Fränzle, Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States, Computer Science Logic (CSL'99), pp.126-140, 1999.
DOI : 10.1007/3-540-48168-0_10

R. Alur and D. L. Dill, Automata for modeling real-time systems, Automata , Languages and Programming, 17th International Colloquium, pp.322-335, 1990.
DOI : 10.1007/BFb0032042

T. A. Henzinger and J. Raskin, Robust Undecidability of Timed and Hybrid Systems, Proc. Hybrid Systems: Computation and Control, Third International Workshop, pp.145-159, 2000.
DOI : 10.1007/3-540-46430-1_15

E. Asarin and P. Collins, Noisy Turing Machines, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, 2005.
DOI : 10.1007/11523468_83
URL : https://hal.archives-ouvertes.fr/hal-00157585

W. Maass and E. Sontag, Analog Neural Nets with Gaussian or Other Common Noise Distributions Cannot Recognize Arbitrary Regular Languages, Neural Computation, vol.39, issue.1, pp.771-782, 1999.
DOI : 10.1016/S0019-9958(63)90290-0

H. T. Siegelmann and E. D. Sontag, On the Computational Power of Neural Nets, Journal of Computer and System Sciences, vol.50, issue.1, pp.132-150, 1995.
DOI : 10.1006/jcss.1995.1013

H. T. Siegelmann and E. D. Sontag, Analog computation via neural networks, Theoretical Computer Science, vol.131, issue.2, pp.331-360, 1994.
DOI : 10.1016/0304-3975(94)90178-3
URL : http://doi.org/10.1016/0304-3975(94)90178-3

J. Guckenheimer and P. Holmes, Nonlinear Oscillations, Dynamical Systems, and Bifurcation of Vector Fields, 1983.

K. Weihrauch, Computable Analysis: an Introduction, 2000.

O. Bournez, D. S. Graça, and E. Hainry, Robust Computations with Dynamical Systems, Proc. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), pp.198-208, 2010.
DOI : 10.1007/978-3-642-15155-2_19
URL : https://hal.archives-ouvertes.fr/inria-00522029

P. Collins and J. Lygeros, Computability of finite-time reachable sets for hybrid systems, Proceedings of the 44th IEEE Conference on Decision and Control, pp.4688-4693, 2005.
DOI : 10.1109/CDC.2005.1582902

P. Collins, Semantics and Computability of the Evolution of Hybrid Systems, SIAM Journal on Control and Optimization, vol.49, issue.2, pp.890-925, 2011.
DOI : 10.1137/080716955

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (Ser, pp.2-42, 1936.

A. Grzegorczyk, On the definitions of computable real continuous functions, Fund, Math, vol.44, pp.61-71, 1957.

D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles III, C. R. Acad. Sci. Paris, vol.241, pp.151-153, 1955.

D. S. Graça, M. L. Campagnolo, and J. Buescu, Robust simulations of Turing machines with analytic maps and flows, CiE 2005: New Computational Paradigms, pp.169-179, 2005.

D. Graça, N. Zhong, and J. Buescu, Computability, noncomputability and undecidability of maximal intervals of IVPs, Transactions of the American Mathematical Society, vol.361, issue.06, pp.2913-2927, 2009.
DOI : 10.1090/S0002-9947-09-04929-0

A. Puri, Dynamical properties of timed automata, Proc. Formal Techniques in Real-Time and Fault- Tolerant Systems, 5th International Symposium, FTRTFT'98, pp.210-227, 1998.
DOI : 10.1007/BFb0055349

A. Puri, V. Borkar, and P. Varaiya, Epsilon-approximation of differential inclusions, Proc. of the 34th IEEE Conference on Decision and Control, pp.2892-2897, 1995.

P. Collins, Continuity and computability of reachable sets, Theoretical Computer Science, vol.341, issue.1-3, pp.162-195, 2005.
DOI : 10.1016/j.tcs.2005.05.001

P. Collins and D. S. Graça, Effective computability of solutions of differential inclusions ? the ten thousand monkeys approach, Journal of Universal Computer Science, vol.15, issue.6, pp.1162-1185, 2009.

C. Moore, Finite-dimensional analog computers: Flows, maps, and recurrent neural networks, 1st International Conference on Unconventional Models of Computation -UMC'98, pp.59-71, 1998.