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

DOI10.1016/S0304-3975(98)00284-9zbMATH Open0916.68042OpenAlexW2077769760MaRDI QIDQ1292398FDOQ1292398

Authors: Vasco Brattka, Klaus Weihrauch 

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

Recommendations

• Computability on subsets of metric spaces.
• Computability on Subsets of Locally Compact Spaces
• Closed sets and operators thereon: representations, computability and complexity
• Computability on Regular Subsets of Euclidean Space

zbMATH Keywords

computable analysisrecursive setsrepresentations of hyperspaces

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• Computational complexity of real functions
• Computational Complexity of Two-Dimensional Regions
• Title not available (Why is that?)
• Computable functionals
• Computable invariance
• Located sets and reverse mathematics
• The computable multi-functions on multi-represented sets are closed under programming
• Title not available (Why is that?)
• Computability in Analysis and Physics
• Compactness in constructive analysis revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of representations
• Computability on computable metric spaces
• Sets, complements and boundaries
• 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
• Recursive characterization of computable real-valued functions and relations
• Type 2 recursion theory
• Title not available (Why is that?)
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Berechenbare Reelle Funktionen
• Title not available (Why is that?)
• \(\delta\)-uniform BSS machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Examples of semicomputable sets of real and complex numbers
• Title not available (Why is that?)

Cited In (66)

• Computable Complex Analysis
• Dimension spectra of random subfractals of self-similar fractals
• Effectivity on continuous functions in topological spaces
• Effective compactness and orbits of points under the isometry group
• Algorithmic randomness and Fourier analysis
• On the topological aspects of the theory of represented spaces
• Effective versions of local connectivity properties
• A natural weak limit space with admissible representation which is not a limit space
• Computable elements and functions in effectively enumerable topological spaces
• Uniqueness in Planar Endogenous Business Cycle Theories
• Effectiveness for embedded spheres and balls
• Curves that must be retraced
• The computational complexity of distance functions of two-dimensional domains
• Continuity and computability of reachable sets
• Computability in linear algebra
• Computable invariance
• On the computational content of the Lawson topology
• Elementary computable topology
• Computability on subsets of metric spaces.
• Computable operators on regular sets
• Generated quasi-metric hyper and function spaces.
• A computable version of Banach's inverse mapping theorem
• Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
• MAXIMAL COMPUTABILITY STRUCTURES
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Computability of products of chainable continua
• Computability of pseudo-cubes
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• On the continuity of effective multifunctions
• Towards computability over effectively enumerable topological spaces
• On computable metrization
• Computability on Regular Subsets of Euclidean Space
• On computably locally compact Hausdorff spaces
• Computing boundary extensions of conformal maps
• Dimensions of Points in Self-similar Fractals
• Effective Choice and Boundedness Principles in Computable Analysis
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Approximate decidability in euclidean spaces
• Weihrauch Complexity in Computable Analysis
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Singular coverings and non‐uniform notions of closed set computability
• Points on Computable Curves of Computable Lengths
• Connected choice and the Brouwer fixed point theorem
• Computability and the morphological complexity of some dynamics on continuous domains
• Dense computability structures
• A computability challenge: asymptotic bounds for error-correcting codes
• Computable neighbourhoods of points in semicomputable manifolds
• Semicomputable manifolds in computable topological spaces
• On the computational complexity of the Riemann mapping
• Foundation of a computable solid modelling.
• Effectivity and effective continuity of multifunctions
• Multi-resolution cellular automata for real computation
• The rate of convergence of the walk on spheres algorithm
• Computability of graphs
• Effectively closed sets and graphs of computable real functions.
• Three concepts of decidability for general subsets of uncountable spaces
• On the complexity of computing the Hausdorff distance
• Recursive quasi-metric spaces.
• Computable approximations of a chainable continuum with a computable endpoint
• When series of computable functions with varying domains are computable
• Computability of Subsets of Metric Spaces
• Singular coverings and non-uniform notions of closed set computability
• A comparison of certain representations of regularly closed sets
• Effective aspects of Hausdorff and Fourier dimension
• Computability on Subsets of Locally Compact Spaces

This page was built for publication: Computability on subsets of Euclidean space. I: Closed and compact subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292398)