Computable metrics above the standard real metric
From MaRDI portal
Publication:2033336
DOI10.33048/SEMI.2021.18.027OpenAlexW3200093975MaRDI QIDQ2033336FDOQ2033336
Authors: R. A. Kornev
Publication date: 17 June 2021
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2021.18.027
Recommendations
computable analysiscomputable metric spacerepresentation of real numbersCauchy representationreducibility of representations
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational complexity of real functions
- Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
- Theory of representations
- Degrees of unsolvability of continuous functions
- Reducibility of computable metrics on the real line
- Computably Isometric Spaces
Cited In (3)
This page was built for publication: Computable metrics above the standard real metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033336)