Computable metrization
From MaRDI portal
Publication:5307607
DOI10.1002/MALQ.200710009zbMATH Open1121.03084OpenAlexW4255817314MaRDI QIDQ5307607FDOQ5307607
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
Recommendations
Metric spaces, metrizability (54E35) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)
Cites Work
Cited In (16)
- A polynomial time computable metric between points sets
- How incomputable is the separable Hahn-Banach theorem?
- Computable Riesz representation for locally compact Hausdorff spaces
- Reducibility of computable metrics on the real line
- 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)
- Title not available (Why is that?)
- Computably regular topological spaces
- On computable metrization
- Characterizing the continuous degrees
- Computable de Finetti measures
- 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)
