C. E. Shannon, Mathematical Theory of the Differential Analyzer, Journal of Mathematics and Physics, vol.XXII, issue.1-4, pp.337-354, 1941.
DOI : 10.1002/sapm1941201337

V. Bush, The differential analyzer. A new machine for solving differential equations, Journal of the Franklin Institute, vol.212, issue.4, pp.447-488, 1931.
DOI : 10.1016/S0016-0032(31)90616-9

D. S. Graça and J. F. Costa, Analog computers and recursive functions over the reals, Journal of Complexity, vol.19, issue.5, pp.644-664, 2003.
DOI : 10.1016/S0885-064X(03)00034-7

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

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.

M. B. Pour-el and J. I. Richards, A computable ordinary differential equation which possesses no computable solution, Annals of Mathematical Logic, vol.17, issue.1-2, pp.61-90, 1979.
DOI : 10.1016/0003-4843(79)90021-4

J. P. Demailly, Analyse Numérique et Equations Différentielles, 1991.

W. D. Smith, Church???s thesis meets the N-body problem, Applied Mathematics and Computation, vol.178, issue.1, pp.154-183, 2006.
DOI : 10.1016/j.amc.2005.09.077

L. Perko, Differential Equations and Dynamical Systems, 2001.

K. Ruohonen, AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS, International Journal of Foundations of Computer Science, vol.07, issue.02, pp.151-160, 1996.
DOI : 10.1142/S0129054196000129

K. I. Ko and A. Kawamura, Lipschitz continuous ordinary differential equations are polynomial-space complete, 24th Annual IEEE Conference on Computational Complexity, pp.149-160, 1991.

N. Müller and B. Moiske, Solving initial value problems in polynomial time, Proc. 22 JAIIO -PANEL '93, Part 2, pp.283-293, 1993.

N. T. Müller and M. V. Korovina, Making big steps in trajectories, Electronic Proceedings in Theoretical Computer Science, vol.24, pp.106-119, 2010.
DOI : 10.4204/EPTCS.24.15

G. Birkhoff and G. C. Rota, Ordinary Differential Equations, 1989.

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.

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

M. B. Pour-el and J. I. Richards, Computability in Analysis and Physics, 1989.

K. I. Ko and H. Friedman, Computational complexity of real functions, Theoretical Computer Science, vol.20, issue.3, pp.323-352, 1982.
DOI : 10.1016/S0304-3975(82)80003-0

N. Müller, Uniform computational complexity of Taylor series, 14th International Colloquium on Automata, Languages and Programming, pp.435-444, 1987.
DOI : 10.1007/3-540-18088-5_37

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