M. W. Hirsch, S. Smale, and R. Devaney, Differential Equations, Dynamical Systems, and an Introduction to Chaos, 2003.

J. D. Murray, Mathematical Biology, Biomathematics, vol.19, 1993.

E. N. Lorenz, Deterministic Nonperiodic Flow, Journal of the Atmospheric Sciences, vol.20, issue.2, pp.130-141, 1963.
DOI : 10.1175/1520-0469(1963)020<0130:DNF>2.0.CO;2

D. S. Graça, M. L. Campagnolo, and J. Buescu, Robust simulations of Turing machines with analytic maps and flows, LNCS, vol.3526, pp.169-179, 2005.

M. Mignotte, Suites récurrentes linéaires In: Séminaire Delange-Pisot-Poitou. Théorie des nombres, pp.14-15, 1974.

J. Berstel and M. Mignotte, Deux propri??t??s d??cidables des suites r??currentes lin??aires, Bulletin de la Soci&#233;t&#233; math&#233;matique de France, vol.79, pp.175-184, 1976.
DOI : 10.24033/bsmf.1823

V. Halava, T. Harju, M. Hirvensalo, and J. Karhumäki, Skolem's problem -on the border between decidability and undecidability, Computer Science, 2005.

V. Blondel and N. Portier, The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear algebra and its Applications, pp.351-352, 2002.

O. Bournez, Complexité algorithmique des systèmes dynamiques continus et hybrides, 1999.

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 G. Schneider, Widening the Boundary between Decidable and Undecidable Hybrid Systems*, LNCS, vol.2421, pp.193-208, 2002.
DOI : 10.1007/3-540-45694-5_14

E. Asarin, G. Schneider, and S. Yovine, On the Decidability of the Reachability Problem for Planar Differential Inclusions, LNCS, vol.2034, pp.89-104, 2001.
DOI : 10.1007/3-540-45351-2_11

V. Blondel and J. N. Tsitsiklis, A survey of computational complexity results in systems and control, Automatica, vol.36, issue.9, pp.1249-1274, 2000.
DOI : 10.1016/S0005-1098(00)00050-9

R. Kannan and R. J. Lipton, Polynomial-time algorithm for the orbit problem, Journal of the ACM, vol.33, issue.4, pp.808-821, 1986.
DOI : 10.1145/6490.6496

M. W. Hirsch and S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra, 1974.

M. Mignotte, An inequality about factors of polynomials, Mathematics of Computation, vol.28, issue.128, pp.1153-1157, 1974.
DOI : 10.1090/S0025-5718-1974-0354624-3

A. Bostan, Algorithmique efficace pour des opérations de base en calcul formel, p.polytechnique, 2003.

J. V. Brawley and L. Carlitz, Irreducibles and the composed product for polynomials over a finite field, Discrete Mathematics, vol.65, issue.2, pp.115-139, 1987.
DOI : 10.1016/0012-365X(87)90135-X

A. Baker, Transcendental Number Theory, 1990.
DOI : 10.1017/CBO9780511565977

A. O. Gelfond, Transcendental and Algebraic Numbers, 2003.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

H. Cohen, A Course in Computational Algebraic Number Theory, 1993.
DOI : 10.1007/978-3-662-02945-9