Complexity theory of real functions
Complexity theory of real functions
Computability on computable metric spaces
Theoretical Computer Science
Theoretical Computer Science - Special issue on real numbers and computers
Effective domain representations of H (X), the space of compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Effective properties of sets and functions in metric spaces with computability structure
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
Theoretical Computer Science
Computable analysis: an introduction
Computable analysis: an introduction
Topological properties of real number representations
Theoretical Computer Science
Theoretical Computer Science
Random Numbers and an Incomplete Immune Recursive Set
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Admissible Representations of Limit Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Theoretical Computer Science - Topology in computer science
Random Numbers and an Incomplete Immune Recursive Set
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Inversion Problem for Computable Linear Operators
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical Computer Science - Topology in computer science
Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
Continuity and computability of reachable sets
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
On Computable Compact Operators on Banach Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Effectivity on Continuous Functions in Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Borel Complexity of Topological Operations on Computable Metric Spaces
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Effective Computation for Nonlinear Systems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces
Electronic Notes in Theoretical Computer Science (ENTCS)
How Incomputable is the Separable Hahn-Banach Theorem?
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Computability over Effectively Enumerable Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Continuity of Effective Multifunctions
Electronic Notes in Theoretical Computer Science (ENTCS)
On computably locally compact hausdorff spaces
Mathematical Structures in Computer Science
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
An Application of Martin-Löf Randomness to Effective Probability Theory
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On the Borel Complexity of Hahn-Banach Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective Dini's Theorem on Effectively Compact Metric Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability on subsets of locally compact spaces
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Learning figures with the hausdorff metric by fractals
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An analysis of the lemmas of urysohn and urysohn-tietze according to effective borel measurability
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A computable version of dini's theorem for topological spaces
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
A computability challenge: asymptotic bounds for error-correcting codes
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
A hierarchy of immunity and density for sets of reals
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Compactness and the effectivity of uniformization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Hi-index | 0.00 |
The notions "recursively enumerable" and "recursive" are the basic notions of effectivity in classical recursion theory. In computable analysis, these notions are generalized to closed subsets of Euclidean space using their metric distance functions. We study a further generalization of these concepts to subsets of computable metric spaces. It appears that different characterizations, which coincide in case of Euclidean space, lead to different notions in the general case. However, under certain additional conditions, such as completeness and effective local compactness, the situation is similar to the Euclidean case. We present all results in the framework of "Type-2 Theory of Effectivity" which allows to express effectivity properties in a very uniform way: instead of comparing properties of single subsets, we compare corresponding representations of the hyperspace of closed subsets. Such representations do not only induce a concept of computability for single subsets, but they even yield a concept of computability for operations on hyperspaces, such as union, intersection, etc. We complete our investigation by studying the special situation of compact subsets.