Computability
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Complexity theory of real functions
Complexity theory of real functions
Computability on computable metric spaces
Theoretical Computer Science
Computable banach spaces via domain theory
Theoretical Computer Science - Special issue on computability and complexity in analysis
On approximate and algebraic computability over the real numbers
Theoretical Computer Science - Special issue on computability and complexity in analysis
On the time complexity of partial real functions
Journal of Complexity
The Wave Propagator Is Turing Computable
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Standard Representations of Effective Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Hi-index | 5.23 |
Based on standard notions of classical recursion theory, a natural model of approximate computability for partial functions between effective metric spaces is presented. It generalizes the Ko-Friedman approach to computability of real functions by means of oracle Turing machines, follows the main ideas of Weihrauch's type 2 theory of effectivity, but it avoids the explicit use of representations. The topological arithmetical hierarchy is introduced and shown to be strict if the underlying space contains an effectively discrete sequence. The domains of computable functions are exactly the Π2-sets of this hierarchy if the space admits a finitary stratification. Finally, this framework is used to investigate and characterize the standard representations of the real numbers. They are just those functions from the name space onto the reals which have both computable extensions and inversions that are computable as relations.