Computability structures on metric spaces
The authors extend a concept of computability structure on Banach spaces, introduced by \textit{M. B. Pour-El} and \textit{J. I. Richards} [Computability in analysis and physics (1989; Zbl 0678.03027)], to metric spaces. By their definition, the computability structure of a metric space \(\langle X,d\rangle\) is a set \({\mathcal S}\) of sequences from \(X\) which satisfies three axioms M1, M2, and M3 given as follows. Axiom M1: If \(\{x_m\}\in{\mathcal S}\) and \(\{y_n\}\in{\mathcal S}\), then \(\{d(x_m,y_n)\}\) forms a double sequence of computable reals. Axiom M2: If \(\{x_m\}\in{\mathcal S}\), then \(\{x_{\Phi(m)}\} \in {\mathcal S}\) for any recursive function \(\Phi\). Axiom M3: If \(\{x_{mn}\}\in {\mathcal S}\), \(\{x_n\}\subset X\), and \(\{x_{mn}\}\) converges to \(\{x_n\}\) as \(n\to \infty\), effectively in \(m\) and \(n\), then \(\{x_n\}\in {\mathcal S}\). Several results, which are parallel to those obtained by Pour-El and Richards, such as the effective density lemma and the stability lemma, are presented. The effectivized versions of some basic results on metric spaces are studied as well. For the entire collection see [Zbl 0892.00029].
- Effective properties of sets and functions in metric spaces with computability structure
- Dense computability structures
- Isometries and computability structures
- Effective dispersion in computable metric spaces
- COMPUTABLY COMPACT METRIC SPACES
- scientific article; zbMATH DE number 1344955
- scientific article; zbMATH DE number 908753
- Computability on subsets of metric spaces.
- Computability and continuity in metric partial algebras equipped with computability structures
- On computable metrization
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- An effective Riemann Mapping Theorem
- From axiomatics to intrinsic characterization: some open problems in computable analysis
- Effective properties of sets and functions in metric spaces with computability structure
- On an ad hoc computability structure in a Hilbert space
- On the computability of Walsh functions.
- Interpolation functor and computability.
- Computability of a function with jumps: Effective uniformity and limiting recursion
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Dense computability structures
- Computable reducibility of metrics on the reals
- Isometries and computability structures
- Computability and continuity in metric partial algebras equipped with computability structures
- Computational Models of Certain Hyperspaces of Quasi-metric Spaces
- Effective Fine‐convergence of Walsh‐Fourier series
- scientific article; zbMATH DE number 1344955 (Why is no real title available?)
- scientific article; zbMATH DE number 1507232 (Why is no real title available?)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Computability on Regular Subsets of Euclidean Space
- scientific article; zbMATH DE number 800363 (Why is no real title available?)
- scientific article; zbMATH DE number 908753 (Why is no real title available?)
- Integral of two-dimensional Fine-computable functions
- Integral of Fine computable functions and Walsh Fourier series
- On computable metrization
- Computability of Subsets of Metric Spaces
- Maximal computability structures
- Computably Isometric Spaces
- Borel Complexity of Topological Operations on Computable Metric Spaces
- On the complexity of the theory of a computably presented metric structure
- COMPUTABLY COMPACT METRIC SPACES
- Computably and punctually universal spaces
- A non-computable c.e. closed subset of \([0, 1]\)
- A semilattice of degrees of computable metrics
This page was built for publication: Computability structures on metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217607)
