Computability on subsets of Euclidean space. I: Closed and compact subsets
From MaRDI portal
Publication:1292398
Recommendations
Cites work
- scientific article; zbMATH DE number 3113502 (Why is no real title available?)
- scientific article; zbMATH DE number 3129325 (Why is no real title available?)
- scientific article; zbMATH DE number 3131932 (Why is no real title available?)
- scientific article; zbMATH DE number 3952751 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4039896 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 3697101 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1222088 (Why is no real title available?)
- scientific article; zbMATH DE number 1222111 (Why is no real title available?)
- scientific article; zbMATH DE number 490143 (Why is no real title available?)
- scientific article; zbMATH DE number 503387 (Why is no real title available?)
- scientific article; zbMATH DE number 1499089 (Why is no real title available?)
- scientific article; zbMATH DE number 943183 (Why is no real title available?)
- scientific article; zbMATH DE number 3805536 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Berechenbare Reelle Funktionen
- Classical recursion theory. Vol. II
- Compactness in constructive analysis revisited
- Computability in analysis and physics
- Computability on computable metric spaces
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- Computable functionals
- Computable invariance
- Computational Complexity of Two-Dimensional Regions
- Computational complexity of real functions
- Examples of semicomputable sets of real and complex numbers
- Located sets and reverse mathematics
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Recursive characterization of computable real-valued functions and relations
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- Representations of the real numbers and of the open subsets of the set of real numbers
- Sets, complements and boundaries
- The computable multi-functions on multi-represented sets are closed under programming
- Theory of representations
- Type 2 recursion theory
- \(\delta\)-uniform BSS machines
Cited in
(69)- Computability of Subsets of Metric Spaces
- Closed sets and operators thereon: representations, computability and complexity
- Effective aspects of Hausdorff and Fourier dimension
- When series of computable functions with varying domains are computable
- Effectivity on continuous functions in topological spaces
- A comparison of certain representations of regularly closed sets
- Computability on Subsets of Locally Compact Spaces
- Computable approximations of a chainable continuum with a computable endpoint
- Singular coverings and non-uniform notions of closed set computability
- Computability of sets in Euclidean space
- Computability and the morphological complexity of some dynamics on continuous domains
- The computational complexity of distance functions of two-dimensional domains
- A computable version of Banach's inverse mapping theorem
- Dense computability structures
- Computability of graphs
- Algorithmic randomness and Fourier analysis
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Uniqueness in planar endogenous business cycle theories
- Effectivity and effective continuity of multifunctions
- Effectively closed sets and graphs of computable real functions.
- Singular coverings and non‐uniform notions of closed set computability
- Continuity and computability of reachable sets
- Points on Computable Curves of Computable Lengths
- Elementary computable topology
- Curves that must be retraced
- Computability on subsets of metric spaces.
- Towards computability over effectively enumerable topological spaces
- On computably locally compact Hausdorff spaces
- Computability in linear algebra
- Computable invariance
- Computability of products of chainable continua
- Generated quasi-metric hyper and function spaces.
- Computing boundary extensions of conformal maps
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- Multi-resolution cellular automata for real computation
- Computable operators on regular sets
- Effectiveness for embedded spheres and balls
- Computable complex analysis
- On computable metrization
- Connected choice and the Brouwer fixed point theorem
- Dimension spectra of random subfractals of self-similar fractals
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Three concepts of decidability for general subsets of uncountable spaces
- The rate of convergence of the walk on spheres algorithm
- On the complexity of computing the Hausdorff distance
- On the continuity of effective multifunctions
- On the computational content of the Lawson topology
- Computability of pseudo-cubes
- On the computational complexity of the Riemann mapping
- Computability on Regular Subsets of Euclidean Space
- Dimensions of Points in Self-similar Fractals
- On the topological aspects of the theory of represented spaces
- Computability of convex sets
- Effective versions of local connectivity properties
- Effective compactness and orbits of points under the isometry group
- Maximal computability structures
- Effective Choice and Boundedness Principles in Computable Analysis
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Approximate decidability in euclidean spaces
- Computable neighbourhoods of points in semicomputable manifolds
- Foundation of a computable solid modelling.
- A natural weak limit space with admissible representation which is not a limit space
- Semicomputable manifolds in computable topological spaces
- A computability challenge: asymptotic bounds for error-correcting codes
- Computable subcontinua of semicomputable chainable Hausdorff continua
- Recursive quasi-metric spaces.
- Weihrauch Complexity in Computable Analysis
- Computable elements and functions in effectively enumerable topological 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)
