]. H. Férée, W. Gomaa, and M. Hoyrup, On the Query Complexity of Real Functionals , proceedings of the Twenty-Eighth Annual ACM, IEEE Symposium on Logic in Computer Science LICS 2013, pp.103-112, 2013.

A. Turing, On Computable Numbers, With an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, vol.2, pp.230-265, 1936.

A. Grzegorczyk, Computable functionals, Fundamenta Mathematicae, vol.42, pp.168-202, 1955.

D. Lacombe, Extension de la Notion de Fonction Récursive aux Fonctions d'une ou Plusieurs Variables Réelles III, Comptes Rendus de l, Académie des sciences Paris, vol.241, pp.151-153, 1955.

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

V. Brattka, P. Hertling, and K. Weihrauch, A Tutorial on Computable Analysis, New Computational Paradigms, pp.425-491, 2008.
DOI : 10.1007/978-0-387-68546-5_18

K. 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

K. Weihrauch, Computational complexity on computable metric spaces, MLQ, vol.49, issue.1, pp.3-21, 2003.
DOI : 10.1002/malq.200310001

M. Schröder, Spaces allowing Type-2 Complexity Theory revisited, MLQ, vol.50, issue.45, pp.443-459, 2004.
DOI : 10.1002/malq.200310111

A. Kawamura, Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete, computational complexity, vol.19, issue.2, pp.305-332, 2010.
DOI : 10.1007/s00037-010-0286-0

URL : http://arxiv.org/abs/1004.4622

A. Kawamura, H. Ota, C. Rösnick, and M. Ziegler, Computational complexity of smooth differential equations, MFCS, pp.2012-578

M. Townsend, Complexity for type-$2$ relations., Notre Dame Journal of Formal Logic, vol.31, issue.2, pp.241-262, 1990.
DOI : 10.1305/ndjfl/1093635419

A. Farjudian, On the Kolmogorov Complexity of Continuous Real Functions, Lecture Notes in Computer Science, vol.221, issue.2, pp.81-91, 2011.
DOI : 10.1016/j.entcs.2008.12.014

K. Ko, The maximum value problem and NP real numbers, Journal of Computer and System Sciences, vol.24, issue.1, pp.15-35, 1982.
DOI : 10.1016/0022-0000(82)90053-8

H. Friedman, The computational complexity of maximization and integration , Advances in Math, pp.80-98, 1984.

W. Rudin, Functional analysis, International Series in Pure and Applied Mathematics, 1991.

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, 1998.
DOI : 10.1007/978-1-4612-0701-6