EUVIMEDScopri EUVIMED
Crossref

Incomputability of Simply Connected Planar Continua

Takayuki Kihara

Computability · 2012

DOI: 10.3233/com-12012 ↗

At a glance

Journal article in Computability, 2012. Written by Takayuki Kihara. Cited 16 times so far (Crossref).

AbstractDati bibliograficiCiteRelated studies

Abstract (original language)

Le Roux and Ziegler asked whether every simply connected compact nonempty planar $\Pi^0_1$ set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a planar $\Pi^0_1$ dendroid without computable points. We also provide several pathological examples of tree-like $\Pi^0_1$ continua fulfilling certain global incomputability properties: there is a computable dendrite which does not *-include a $\Pi^0_1$ tree; there is a $\Pi^0_1$ dendrite which does not *-include a computable dendrite; there is a computable dendroid which does not *-include a $\Pi^0_1$ dendrite. Here, a continuum A *-includes a member of a class $\mathcal{P}$ of continua if, for every positive real ε, A includes a continuum $B \in \mathcal{P}$ such that the Hausdorff distance between A and B is smaller than ε.

Cite

APA

Kihara, T. (2012). Incomputability of Simply Connected Planar Continua. Computability. https://doi.org/10.3233/com-12012

Vancouver

Kihara T. Incomputability of Simply Connected Planar Continua. Computability. 2012. doi:10.3233/com-12012

BibTeX
@article{Kihara2012,
  author = {Kihara, Takayuki},
  title = {Incomputability of Simply Connected Planar Continua},
  journal = {Computability},
  year = {2012},
  doi = {10.3233/com-12012}
}
Start for free →