Incomputability of Simply Connected Planar Continua

DOI10.3233/COM-12012zbMath1277.03044arXiv1110.6140OpenAlexW2963097465MaRDI QIDQ4904463

Takayuki Kihara

Publication date: 30 January 2013

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

dendritescomputable analysisdendroidseffectively closed setstype-two theory of effectivity

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Related Items (15)

Computability of pseudo-cubes ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Computability of graphs ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ Semicomputable manifolds in computable topological spaces ⋮ Warsaw discs and semicomputability ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ On the algebraic structure of Weihrauch degrees ⋮ Chainable and circularly chainable semicomputable sets in computable topological spaces ⋮ Co-c.e. sets with disconnected complements ⋮ Computability of products of chainable continua ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of Subsets of Metric Spaces

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