Computably Isometric Spaces
From MaRDI portal
Recommendations
- Isometries and computability structures
- COMPUTABLY COMPACT METRIC SPACES
- scientific article; zbMATH DE number 1222111
- Computability on computable metric spaces
- Computability of Subsets of Metric Spaces
- Computations in isometry groups of finite metric spaces
- Computable metrization
- scientific article; zbMATH DE number 4111326
- Computability of sets in Euclidean space
- Computability on Regular Subsets of Euclidean Space
Cited in
(52)- Reducibility of computable metrics on the real line
- Computable metrics above the standard real metric
- Dense computability structures
- Oracle computability of conditional expectations onto subfactors
- Enumerating classes of effective quasi-Polish spaces
- Effective compactness and orbits of points under the isometry group
- Computable analysis and classification problems
- Degrees of non-computability of homeomorphism types of Polish spaces
- Computable reducibility of metrics on the reals
- Universality for left-computably enumerable metric spaces
- Analytic computable structure theory and \(L^p\)-spaces. II
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Computable structures and operations on the space of continuous functions
- Isometries and computability structures
- A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
- scientific article; zbMATH DE number 17703 (Why is no real title available?)
- Uniform procedures in uncountable structures
- Analytic computable structure theory and L^p spaces
- Computable topological groups and Pontryagin duality
- Effectively closed subgroups of the infinite symmetric group
- On computable metrization
- Computability of Subsets of Metric Spaces
- Degrees of and lowness for isometric isomorphism
- Computing the exponent of a Lebesgue space
- Maximal computability structures
- Computable metrization
- The classification problem for compact computable metric spaces
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- Computability of Polish spaces up to homeomorphism
- On the complexity of the theory of a computably presented metric structure
- Generalized effective completeness for continuous logic
- Computable Stone spaces
- COMPUTABLY COMPACT METRIC SPACES
- Computably and punctually universal spaces
- Computable presentations of C*-algebras
- Quasi-isometric reductions between infinite strings
- Represented spaces of represented spaces
- Evaluative presentations
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- On the group of computable automorphisms of the linear order of the reals
- Quasi-isometric reductions between infinite strings
- Degree spectra of homeomorphism type of compact Polish spaces
- Computable type and computably categorical spaces
- Computable \(K\)-theory for \(\text{C}^*\)-algebras: UHF algebras
- A semilattice of degrees of computable metrics
- New degree spectra of Polish spaces
This page was built for publication: Computably Isometric Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407041)
