Computability on subsets of metric spaces.
From MaRDI portal
Publication:1427773
DOI10.1016/S0304-3975(02)00693-XzbMath1071.03027MaRDI QIDQ1427773
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Computable analysisComputable metric spacesRecursive subsetsRecursively enumerable subsetsRepresentations of hyperspaces
Hyperspaces in general topology (54B20) Metric spaces, metrizability (54E35) Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45)
Related Items
Rohlin properties for $\mathbb{Z}^{d}$ actions on the Cantor set ⋮ MAXIMAL COMPUTABILITY STRUCTURES ⋮ A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ On the uniform computational content of the Baire category theorem ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ Computability and Analysis, a Historical Approach ⋮ Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ Computability of pseudo-cubes ⋮ Realizing semicomputable simplices by computable dynamical systems ⋮ Effective Riemann mappings of multiply connected domains and Riemann surfaces ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Computability of graphs ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Closed choice and a uniform low basis theorem ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Semicomputable manifolds in computable topological spaces ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Warsaw discs and semicomputability ⋮ Recursive quasi-metric spaces. ⋮ How constructive is constructing measures? ⋮ Borel complexity and computability of the Hahn-Banach theorem ⋮ Computability and the morphological complexity of some dynamics on continuous domains ⋮ Computability of the Solutions to Navier-Stokes Equations via Effective Approximation ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Computing with continuous objects: a uniform co-inductive approach ⋮ COMPUTABLE SEMANTICS FOR CTL* ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS ⋮ Effectivity and effective continuity of multifunctions ⋮ A Natural Weak Limit Space with Admissible Representation which is not a Limit Space ⋮ Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ Complexity of Blowup Problems ⋮ On the Continuity of Effective Multifunctions ⋮ Effectivity on Continuous Functions in Topological Spaces ⋮ Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus ⋮ An Application of Martin-Löf Randomness to Effective Probability Theory ⋮ On Computable Metrization ⋮ On Computable Compact Operators on Banach Spaces ⋮ On the topological aspects of the theory of represented spaces ⋮ Positive predicate structures for continuous data ⋮ Chainable and circularly chainable semicomputable sets in computable topological spaces ⋮ Unnamed Item ⋮ Co-c.e. sets with disconnected complements ⋮ Computability of products of chainable continua ⋮ On computably locally compact Hausdorff spaces ⋮ Dense computability structures ⋮ A computable version of Banach's inverse mapping theorem ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Computable analysis with applications to dynamic systems ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ Computable de Finetti measures ⋮ On the computability of the set of automorphisms of the unit square ⋮ Uniform test of algorithmic randomness over a general space ⋮ Continuity and computability of reachable sets ⋮ Unnamed Item ⋮ On envelopes and backward approximations ⋮ Effective compactness and orbits of points under the isometry group ⋮ Probabilistic computability and choice ⋮ Computability of Subsets of Metric Spaces ⋮ Admissibly Represented Spaces and Qcb-Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Generated quasi-metric hyper and function spaces.
Cites Work
- Computable invariance
- Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Effective properties of sets and functions in metric spaces with computability structure
- Classical recursion theory. Vol. II
- Recursive quasi-metric spaces.
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- Topological properties of real number representations.
- Extended admissibility.
- Computability on computable metric spaces
- On the definitions of computable real continuous functions
- On effective topological spaces
- Located sets and reverse mathematics
- Approaches to Effective Semi‐Continuity of Real Functions
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computability on subsets of metric spaces.
