Mathematics – Logic
Scientific paper
2011-10-27
Mathematics
Logic
25 pages
Scientific paper
Le Roux and Ziegler asked whether every simply connected compact nonempty planar co-c.e. closed set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a contractible planar co-c.e. dendroid without computable points. We also provide several pathological examples of tree-like co-c.e. continua fulfilling certain global incomputability properties: there is a computable dendrite which does not *-include a co-c.e. tree; there is a co-c.e. dendrite which does not *-include a computable dendrite; there is a computable dendroid which does not *-include a co-c.e. dendrite. Here, a continuum A *-includes a member of a class P of continua if, for every positive real, A includes a P-continuum B such that the Hausdorff distance between A and B is smaller than the real.
No associations
LandOfFree
Incomputability of Simply Connected Planar Continua does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Incomputability of Simply Connected Planar Continua, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incomputability of Simply Connected Planar Continua will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-376495