Computability on subsets of Euclidean space. I: Closed and compact subsets

DOI10.1016/S0304-3975(98)00284-9zbMath0916.68042OpenAlexW2077769760MaRDI QIDQ1292398

Vasco Brattka, Weihrauch, Klaus

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00284-9

zbMATH Keywords

recursive setscomputable analysisrepresentations of hyperspaces

Mathematics Subject Classification ID

Related Items (60)

MAXIMAL COMPUTABILITY STRUCTURES ⋮ A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ Points on Computable Curves of Computable Lengths ⋮ Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ Computability of pseudo-cubes ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ The rate of convergence of the walk on spheres algorithm ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Dimensions of Points in Self-similar Fractals ⋮ Computability of graphs ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Semicomputable manifolds in computable topological spaces ⋮ On the complexity of computing the Hausdorff distance ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ Recursive quasi-metric spaces. ⋮ Computability on subsets of metric spaces. ⋮ Computability and the morphological complexity of some dynamics on continuous domains ⋮ When series of computable functions with varying domains are computable ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ On the computational complexity of the Riemann mapping ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Effectivity and effective continuity of multifunctions ⋮ A Comparison of Certain Representations of Regularly Closed Sets ⋮ A Natural Weak Limit Space with Admissible Representation which is not a Limit Space ⋮ Algorithmic randomness and Fourier analysis ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ On the Continuity of Effective Multifunctions ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Effectivity on Continuous Functions in Topological Spaces ⋮ Effective versions of local connectivity properties ⋮ On Computable Metrization ⋮ On the topological aspects of the theory of represented spaces ⋮ Computability in linear algebra ⋮ Curves that must be retraced ⋮ The computational complexity of distance functions of two-dimensional domains ⋮ Chainable and circularly chainable semicomputable sets in computable topological spaces ⋮ On the computational content of the Lawson topology ⋮ Computability of products of chainable continua ⋮ On computably locally compact Hausdorff spaces ⋮ Dense computability structures ⋮ A computable version of Banach's inverse mapping theorem ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Multi-Resolution Cellular Automata for Real Computation ⋮ Computing boundary extensions of conformal maps ⋮ Computable invariance ⋮ Continuity and computability of reachable sets ⋮ Uniqueness in Planar Endogenous Business Cycle Theories ⋮ Effective compactness and orbits of points under the isometry group ⋮ Computability of Subsets of Metric Spaces ⋮ Computable Complex Analysis ⋮ Weihrauch Complexity in Computable Analysis ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. ⋮ Effectively closed sets and graphs of computable real functions. ⋮ Foundation of a computable solid modelling. ⋮ Generated quasi-metric hyper and function spaces. ⋮ Three concepts of decidability for general subsets of uncountable spaces

Cites Work

• Sets, complements and boundaries
• Type 2 recursion theory
• Theory of representations
• Compactness in constructive analysis revisited
• Representations of the real numbers and of the open subsets of the set of real numbers
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Computational complexity of real functions
• \(\delta\)-uniform BSS machines
• Computable invariance
• Classical recursion theory. Vol. II
• Recursive characterization of computable real-valued functions and relations
• Computability on computable metric spaces
• Computable functionals
• Berechenbare Reelle Funktionen
• Located sets and reverse mathematics
• Examples of semicomputable sets of real and complex numbers
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computational Complexity of Two-Dimensional Regions
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Computability in Analysis and Physics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 Euclidean space. I: Closed and compact subsets