Isometries and Computability Structures
Isometries and Computability Structures
复制标题
等轴测和可计算结构
DOI:
10.3217/jucs-016-18-2569
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
Zvonko Iljazović
中科院分区:
文献类型:
--
作者:
Zvonko Iljazović
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 and we use it in the proof of the following result: if (X, d, alpha) is effectively totally bounded, then (X, d, beta) is also effectively totally bounded. This means that the property that a computable metric space is effectively totally bounded (and in particular effectively compact) depends only on the underlying metric space. In the final section of this paper we examine compact metric spaces (X, d) such that there are only finitely many isometries X->X. We prove that in this case a stronger result holds than the previous one: if (X, d, alpha) is effectively totally bounded, then alpha and beta are equivalent. Hence if (X, d, alpha) is effectively totally bounded, then (X, d) has a unique computability structure.