License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2268
URN: urn:nbn:de:0030-drops-22685
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2268/
Go to the corresponding OASIcs Volume Portal

Iljazovic, Zvonko
Contributed Papers

Effective Dispersion in Computable Metric Spaces

pdf-format:
Iljazovic.2268.pdf (0.3 MB)

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.

BibTeX - Entry

@InProceedings{iljazovic:OASIcs:2009:2268,
  author =	{Zvonko Iljazovic},
  title =	{{Effective Dispersion in Computable Metric Spaces}},
  booktitle =	{6th International Conference on Computability and Complexity in Analysis (CCA'09)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-12-5},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{11},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2268},
  URN =		{urn:nbn:de:0030-drops-22685},
  doi =		{10.4230/OASIcs.CCA.2009.2268},
  annote =	{Keywords: Computable metric space, effective separating sequence, computability structure, effectively totally bounded computable metric space, effectively disp}
}

Keywords: Computable metric space, effective separating sequence, computability structure, effectively totally bounded computable metric space, effectively disp
Collection: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue Date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI