L. Blum, M. Shub-&-steve, and . Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (N.S.), vol.21, issue.1, pp.1-46, 1989.

V. Brattka, G. Gherardi-&-arno, and P. , Weihrauch Complexity in Computable Analysis, 2017.

, Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces, 2013.

A. Pauly and &. Matthew-de-brecht, Non-deterministic Computation and the Jayne Rogers Theorem, Electronic Proceedings in Theoretical Computer Science 143. DCM, 2012.

A. Pauly-&-florian and . Steinberg, Comparing Representations for Function Spaces in Computable, Analysis. Theory of Computing Systems, vol.62, issue.3, pp.557-582, 2018.

M. Pour-el-&-ian and . Richards, Computability in analysis and physics. Perspectives in Mathematical Logic, 1989.

K. Weihrauch, Computable analysis, Texts in Theoretical Computer Science. An EATCS Series, 2000.

N. Zhong, Recursively enumerable subsets of R q in two computing models, Theoretical Computer Science, vol.197, pp.79-94, 1998.