pith. sign in

arxiv: 1110.6140 · v1 · pith:XM4YO4N3new · submitted 2011-10-27 · 🧮 math.LO · cs.LO

Incomputability of Simply Connected Planar Continua

classification 🧮 math.LO cs.LO
keywords co-ccomputabledendritetherecontinuaincludeplanarconnected
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.