Incomputability of Simply Connected Planar Continua

DOI10.3233/COM-12012zbMATH Open1277.03044arXiv1110.6140OpenAlexW2963097465MaRDI QIDQ4904463FDOQ4904463

Authors: Takayuki Kihara 

Publication date: 30 January 2013

Published in: Computability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1110.6140

Recommendations

• scientific article; zbMATH DE number 4190690
• scientific article; zbMATH DE number 2110060
• Characterizing indecomposable plane continua from their complements
• Non-separating subcontinua of planar continua
• Compact disconnected planes, inverse limits and homomorphisms
• On connectedness and discontinuity of invariant sets
• scientific article; zbMATH DE number 17053
• On irreducibility and indecomposability of continua
• scientific article; zbMATH DE number 219646
• scientific article; zbMATH DE number 1551747

zbMATH Keywords

computable analysisdendritesdendroidseffectively closed setstype-two theory of effectivity

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Cited In (19)

• Computable approximations of a chainable continuum with a computable endpoint
• Computability of Subsets of Metric Spaces
• Title not available (Why is that?)
• Classes of Polish spaces under effective Borel isomorphism
• Co-c.e. sets with disconnected complements
• Borel-piecewise continuous reducibility for uniformization problems
• Computability of products of chainable continua
• Computability of pseudo-cubes
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Characterizing indecomposable plane continua from their complements
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Connected choice and the Brouwer fixed point theorem
• Computable neighbourhoods of points in semicomputable manifolds
• Semicomputable manifolds in computable topological spaces
• Computable planar curves intersect in a computable point
• On the algebraic structure of Weihrauch degrees
• Warsaw discs and semicomputability
• Computability of graphs
• Computing links and accessing arcs

This page was built for publication: Incomputability of Simply Connected Planar Continua

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904463)