Computing links and accessing arcs

DOI10.1002/MALQ.201200026MaRDI QIDQ4915223zbMATH OpenOpenAlexFDO

Authors Timothy H. McNicholl

Publication date 9 April 2013

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

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

zbMATH Keywords

computable topologyeffective local connectivity

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65) Constructive and recursive analysis (03F60) Conformal mappings of special domains (30C20) Schwarz-Christoffel-type mappings (30C30) Capacity and harmonic measure in the complex plane (30C85)

Abstract: Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated.

Recommendations

• The power of backtracking and the confinement of length
• Computable intersection points
• Incomputability of Simply Connected Planar Continua
• Computable planar curves intersect in a computable point
• Points on Computable Curves of Computable Lengths

Cites work

• An effective Carathéodory theorem
• Computing space-filling curves
• Curves that must be retraced
• Effective Borel measurability and reducibility of functions
• Effective versions of local connectivity properties
• Effectiveness for embedded spheres and balls
• scientific article; zbMATH DE number 51509 (Why is no real title available?)
• scientific article; zbMATH DE number 3544865 (Why is no real title available?)
• scientific article; zbMATH DE number 2174317 (Why is no real title available?)
• scientific article; zbMATH DE number 770106 (Why is no real title available?)
• Plottable Real Number Functions and the Computable Graph Theorem

Cited in

(5)

• Computing boundary extensions of conformal maps
• Carathéodory's theorem and moduli of local connectivity
• The power of backtracking and the confinement of length
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• Computable planar curves intersect in a computable point

This page was built for publication: Computing links and accessing arcs

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