OASIcs.CCA.2009.2268.pdf
- Filesize: 277 kB
- 11 pages
Document
Effective Dispersion in Computable Metric Spaces
Author
-
Part of:
Volume:
6th International Conference on Computability and Complexity in Analysis (CCA'09) (CCA 2009)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-11-25
Cite AsGet BibTex
Zvonko Iljazovic. Effective Dispersion in Computable Metric Spaces. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 161-172, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/OASIcs.CCA.2009.2268
https://doi.org/10.4230/OASIcs.CCA.2009.2268
Abstract
We investigate the relationship between computable metric spaces $(X,d,\alpha )$ and $(X,d,\beta ),$ where $(X,d)$ is a given metric space. In the case of Euclidean space, $\alpha $ and $\beta $ are equivalent up to isometry, which does not hold in general. We introduce the notion of effectively dispersed metric space. This notion is essential in the proof of the main result of this paper: $(X,d,\alpha )$ is effectively totally bounded if and only if $(X,d,\beta )$ is effectively totally bounded, i.e. the property that a computable metric space is effectively totally bounded (and in particular effectively compact) depends only on the underlying metric space.
Keywords
- Computable metric space
- effective separating sequence
- computability structure
- effectively totally bounded computable metric space
- effectively disp
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads