Computability · 2012 · 24 citations · 11 references
Natural SciencesComputer ScienceMathematicsComputational GeometrySet TheoryTopologyCombinatorial Set TheoryComputability TheoryComputational TopologyContinuum TheoryHausdorff DistanceTree-like ContinuaUndecidability
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 wit
11
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
Computability on subsets of metric spaces
Vasco Brattka, Gero Presser · Theoretical Computer Science · 2003 · 163 citations
Stephen G. Simpson · Bulletin of Symbolic Logic · 2005 · 73 citations