Pages that link to "Item:Q1292398"
From MaRDI portal
The following pages link to Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398):
Displaying 46 items.
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Computable neighbourhoods of points in semicomputable manifolds (Q508833) (← links)
- Curves that must be retraced (Q550254) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- Effective versions of local connectivity properties (Q692887) (← links)
- Computability in linear algebra (Q703545) (← links)
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- On the computational complexity of the Riemann mapping (Q942023) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Computable invariance (Q1274805) (← links)
- Recursive quasi-metric spaces. (Q1427771) (← links)
- Computability on subsets of metric spaces. (Q1427773) (← links)
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. (Q1607287) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Foundation of a computable solid modelling. (Q1607293) (← links)
- Semicomputable manifolds in computable topological spaces (Q1704608) (← links)
- Generated quasi-metric hyper and function spaces. (Q1868863) (← links)
- The rate of convergence of the walk on spheres algorithm (Q1938493) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Computability of products of chainable continua (Q2035483) (← links)
- Dense computability structures (Q2041062) (← links)
- Effective compactness and orbits of points under the isometry group (Q2105085) (← links)
- Computability of pseudo-cubes (Q2187274) (← links)
- Computable subcontinua of semicomputable chainable Hausdorff continua (Q2235769) (← links)
- Chainable and circularly chainable semicomputable sets in computable topological spaces (Q2274137) (← links)
- Computability of probability measures and Martin-Löf randomness over metric spaces (Q2389335) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- On the computational content of the Lawson topology (Q2500493) (← links)
- Continuity and computability of reachable sets (Q2566008) (← links)
- Computing boundary extensions of conformal maps (Q2827277) (← links)
- A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (Q2891310) (← links)
- Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Points on Computable Curves of Computable Lengths (Q3182970) (← links)
- Towards Computability over Effectively Enumerable Topological Spaces (Q4918009) (← links)
- On the Continuity of Effective Multifunctions (Q4918021) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)
- Effectivity on Continuous Functions in Topological Spaces (Q4918040) (← links)
- On Computable Metrization (Q4921450) (← links)
- Computability of graphs (Q5112388) (← links)
- MAXIMAL COMPUTABILITY STRUCTURES (Q5283447) (← links)
- When series of computable functions with varying domains are computable (Q5396227) (← links)
- Computable approximations of a chainable continuum with a computable endpoint (Q6139238) (← links)
