Computable metrization

DOI10.1002/MALQ.200710009MaRDI QIDQ5307607zbMATH OpenOpenAlexFDO

Authors Tanja Grubba, Klaus Weihrauch, Matthias Schröder

Publication date 17 September 2007

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200710009

zbMATH Keywords

computable analysiscomputable metric spacecomputable embeddingTTEcomputable metrization

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)

Recommendations

• On computable metrization
• Computably regular topological spaces
• scientific article; zbMATH DE number 1746049
• Computably Isometric Spaces
• Cocompactness and quasi-uniformizability of completely metrizable spaces.

Cited in

(16)

• A polynomial time computable metric between points sets
• How incomputable is the separable Hahn-Banach theorem?
• Reducibility of computable metrics on the real line
• Computable Riesz representation for locally compact Hausdorff spaces
• On a metric generalization of the \(tt\)-degrees and effective dimension theory
• Algorithmic randomness over general spaces
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• scientific article; zbMATH DE number 1746047 (Why is no real title available?)
• Computably regular topological spaces
• On computable metrization
• Computable de Finetti measures
• Characterizing the continuous degrees
• Computable exchangeable sequences have computable de Finetti measures
• Towards the Effective Descriptive Set Theory
• Computably Isometric Spaces
• Computability theory. Abstracts from the workshop held January 7--13, 2018

This page was built for publication: Computable metrization

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