Computable metrization

DOI10.1002/MALQ.200710009zbMath1121.03084OpenAlexW4255817314MaRDI QIDQ5307607

Weihrauch, Klaus, Tanja Grubba, 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) Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)

Related Items (10)

Towards the Effective Descriptive Set Theory ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ Computable Riesz Representation for Locally Compact Hausdorff Spaces ⋮ Computable Exchangeable Sequences Have Computable de Finetti Measures ⋮ Algorithmic randomness over general spaces ⋮ Characterizing the continuous degrees ⋮ ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY ⋮ Computable de Finetti measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable metrization