Effective versions of local connectivity properties

DOI10.1007/s00224-011-9364-1zbMath1309.03023arXiv1106.3318OpenAlexW1768911329MaRDI QIDQ692887

Dale Daniel, Timothy H. McNicholl

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

Peano continuacomputable topologyeffective local connectivity

Mathematics Subject Classification ID

Continua and generalizations (54F15) Constructive and recursive analysis (03F60) Connected and locally connected spaces (general aspects) (54D05)

Related Items

Carathéodory’s Theorem and moduli of local connectivity, The power of backtracking and the confinement of length, Computing links and accessing arcs, An effective Carathéodory theorem, Computing space-filling curves, Computing boundary extensions of conformal maps, Computable Complex Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• Plottable Real Number Functions and the Computable Graph Theorem
• Effectiveness for Embedded Spheres and Balls