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. ,
, Weihrauch Complexity in Computable Analysis, 2017.
, Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces, 2013.
Non-deterministic Computation and the Jayne Rogers Theorem, Electronic Proceedings in Theoretical Computer Science 143. DCM, 2012. ,
Comparing Representations for Function Spaces in Computable, Analysis. Theory of Computing Systems, vol.62, issue.3, pp.557-582, 2018. ,
, Computability in analysis and physics. Perspectives in Mathematical Logic, 1989.
Computable analysis, Texts in Theoretical Computer Science. An EATCS Series, 2000. ,
Recursively enumerable subsets of R q in two computing models, Theoretical Computer Science, vol.197, pp.79-94, 1998. ,