L. Blum, M. Shub, and S. Smale, 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

O. Bournez, M. L. Campagnolo, D. S. Graça, and E. Hainry, Polynomial differential equations compute all real computable functions on computable compact intervals, Journal of Complexity, vol.23, issue.3, pp.317-335, 2007.
DOI : 10.1016/j.jco.2006.12.005
URL : https://hal.archives-ouvertes.fr/inria-00102947

T. Chadzelek and G. Hotz, Analytic machines, Theoretical Computer Science, vol.219, issue.1-2, pp.151-167, 1999.
DOI : 10.1016/S0304-3975(98)00287-4
URL : http://doi.org/10.1016/s0304-3975(98)00287-4

J. Durand-lose, Abstract geometrical computation 1: Embedding black hole computations with rational numbers, Fund. Inf, vol.74, issue.4, pp.491-510, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00079720

J. Durand-lose, Abstract Geometrical Computation and the Linear??Blum, Shub and Smale Model, Computation and Logic in the Real World, 3rd Conf. Computability in Europe (CiE '07), number 4497 in LNCS, pp.238-247, 2007.
DOI : 10.1007/978-3-540-73001-9_25
URL : https://hal.archives-ouvertes.fr/hal-00144173

J. Durand-lose, Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model, Logic and Theory of Algorithms, 4th Conf. Computability in Europe (CiE '08) (abstracts and extended abstracts of unpublished papers), pp.107-116, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00448746

J. Durand-lose, Abstract geometrical computation 3: black holes for classical and analog computing, Natural Computing, vol.59, issue.4, pp.455-572, 2009.
DOI : 10.1007/s11047-009-9117-0
URL : https://hal.archives-ouvertes.fr/hal-00447966

J. Durand-lose, Abstract Geometrical Computation and Computable Analysis, International Conference on Unconventional Computation number 5715 in LNCS, pp.158-167, 2009.
DOI : 10.1007/978-3-642-03745-0_20
URL : https://hal.archives-ouvertes.fr/hal-00447965

J. Durand-lose, Abstract geometrical computation 4: Small Turing universal signal machines, Theoretical Computer Science, vol.412, issue.1-2, 2010.
DOI : 10.1016/j.tcs.2010.07.013
URL : https://hal.archives-ouvertes.fr/hal-00504876

G. Etesi and I. Németi, Non-Turing computations via Malament-Hogarth spacetimes, International Journal of Theoretical Physics, vol.41, issue.2, pp.341-370, 2002.
DOI : 10.1023/A:1014019225365

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

M. L. Hogarth, Non-Turing Computers and Non-Turing Computability, Biennial Meeting of the Philosophy of Science Association, pp.126-138, 1994.
DOI : 10.1086/psaprocbienmeetp.1994.1.193018

K. Ko, Computational Complexity of Real Functions. Birkhäuser, 1991. A. M. Turing. On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, issue.2, pp.230-265, 1936.

K. Weihrauch, Introduction to computable analysis. Texts in Theoretical computer science, 2000.

M. Ziegler, (Short) Survey of Real Hypercomputation, Computation and Logic in the Real World, 3rd Conf. Computability in Europe, CiE '07, pp.809-824
DOI : 10.1007/978-3-540-73001-9_86