Abstract
Abstract
A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a
$\mathbf {0}'$
-computable low
$_3$
compact Polish space which is not homeomorphic to a computable one, and that, for any natural number
$n\geq 2$
, there exists a Polish space
$X_n$
such that exactly the high
$_{n}$
-degrees are required to present the homeomorphism type of
$X_n$
. Along the way we investigate the computable aspects of Čech homology groups. We also show that no compact Polish space has a least presentation with respect to Turing reducibility.
Publisher
Cambridge University Press (CUP)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献