[. Bournez, M. L. Campagnolo, and S. Daniel, The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation, Lecture Notes in Computer Science, vol.3959, pp.631-643, 2006.
DOI : 10.1007/11750321_60

URL : https://hal.archives-ouvertes.fr/inria-00102946

S. Michael and ?. Branicky, Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoretical Computer Science, vol.138, issue.1, pp.67-100, 1995.

L. Blum, M. Shub, S. Smale, and ?. , On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines, Bulletin of the American Mathematical Society, vol.21, issue.1, pp.1-46, 1989.
DOI : 10.1090/S0273-0979-1989-15750-9

L. Manuel, Campagnolo ? « Computational complexity of real valued recursive functions and analog circuits, Thèse de doctorat, 2001.

L. Manuel, C. Campagnolo, and ?. Moore, Upper and lower bounds on continuous-time computation, 2nd International Conference on Unconventional Models of Computation -UMC'2K (I. Antoniou, C. Calude et M. Dinneen, pp.135-153, 2001.

L. Manuel and . Campagnolo, Cristopher Moore et José Félix Costa ? « An analog characterization of the subrecursive functions, 4th Conference on Real Numbers and Computers (P. Kornerup, pp.91-109, 2000.

?. and «. Iteration, inequalities, and differentiability in analog computers, Journal of Complexity, vol.16, issue.4, pp.642-660, 2000.

L. Manuel, Campagnolo et Kerry Ojakian ? « The methods of approximation and lifting in real computation, Third International Conference on Computability and Complexity in Analysis, 2006.

[. Collins, H. Jan, G. J. Alur, and . Pappas, Observability of Piecewise-Affine Hybrid Systems, Lecture Notes in Computer Science, vol.2993, pp.265-279, 2004.
DOI : 10.1007/978-3-540-24743-2_18

S. B. Cooper, B. Löwe, and L. Torenvliet, Abstract geometrical computation : Turing-computing ability and undecidability, CiE Lecture Notes in Computer Science, vol.3526, pp.106-116, 2005.

S. Daniel and . Graça, José Félix Costa ? « Analog computers and recursive functions over the reals », Journal of Complexity, vol.19, issue.5, pp.644-664, 2003.

S. Daniel, . Graça, and L. Manuel, Campagnolo et Jorge Buescu ? « Robust simulations of Turing machines with analytic maps and flows, CiE Lecture Notes in Computer Science, vol.3526, pp.169-179, 2005.

S. Daniel and ?. Graça, Some recent developments on Shannon's General Purpose Analog Computer, Mathematical Logic Quarterly, vol.50, issue.4-5, pp.473-485, 2004.

A. Grzegorczyk and ?. , On the definitions of computable real continuous functions, Fundamenta Mathematicae, vol.44, issue.1, pp.61-71, 1957.
DOI : 10.4064/fm-44-1-61-71

S. Daniel, N. Graça, J. Zhong, and ?. Buescu, The ordinary differential equation defined by a computable function whose maximal interval of existence is non-computable, 7th Conference on Real Numbers and Computers (RNC 7), 2006.

L. Mark, Hogarth ? « Does general relativity allow an observer to view an eternity in a finite time ?, Foundations of Physics Letters, vol.5, pp.173-181, 1992.

A. Kawamura, ?. «v, L. Brattka, K. Staiger, and . Weihrauch, Type-2 Computability and Moore's Recursive Functions, 6th Workshop on Computability and Complexity in Analysis Electronic Notes in Theoretical Computer Science, pp.83-95, 2004.
DOI : 10.1016/j.entcs.2004.06.036

[. Koiran, C. Moore, and ?. , 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

J. Lelong-ferrand and J. , MarieArnaudì es ? Cours de mathématiques , tome 2 : analyse, Dunod, LR87] Leonard Lipshitz et Lee A. Rubel ? « A differentially algebraic replacement theorem, and analog computability Proceedings of the American Mathematical Society 99, pp.367-372, 1974.

M. Minsky and ?. Computation, Finite and infinite machines [Moo96] Cristopher Moore ? « Recursion theory on the reals and continuous-time computation, Theoretical Computer Science, vol.162, issue.1, pp.23-44, 1967.

[. Th, Müller ? « Subpolynomial complexity classes of real functions and real numbers, International Colloquium on Automata, Languages and Programming (ICALP 86) (L. Kott, pp.284-293, 1986.

J. Myhill and ?. , A recursive function, defined on a compact interval and having a continuous derivative that is not recursive., The Michigan Mathematical Journal, vol.18, issue.2, pp.97-98, 1971.
DOI : 10.1307/mmj/1029000631

B. Marian, Pour-El ? « Abstract computability and its relations to the general purpose analog computer », Transactions of the, pp.1-28, 1974.

B. Marian, Pour-El et J. Ian Richards ? Computability in analysis and physics, 1989.

E. Harvey, Rose ? Subrecursion : Functions and hierarchies, 1984.

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

T. Hava, Siegelmann ? Neural networks and analog computation : Beyond the turing limit, 1999.

D. Warren and ?. Smith, Church's thesis meets the N-body problem, Applied Mathematics and Computation, vol.178, issue.1, pp.154-183, 2006.

T. Hava, . Siegelmann, and D. Eduardo, Sontag ? « Analog computation via neural networks », Theoretical Computer Science, vol.131, issue.2, pp.331-360, 1994.

W. Thomson, Lord Kelvin) ? « On an instrument for calculating the integral of the product of two given functions, Proceedings of the Royal Society of London, pp.1876-266

[. Weihrauch, N. Zhong, and ?. , Beyond the First Main Theorem ??? When Is the Solution of a Linear Cauchy Problem Computable?, Lecture Notes in Computer Science, vol.3959, pp.783-792, 2006.
DOI : 10.1007/11750321_75