Computing links and accessing arcs

DOI10.1002/malq.201200026zbMath1275.03135arXiv1110.5657OpenAlexW2963036126MaRDI QIDQ4915223

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

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

Related Items (3)

Carathéodory’s Theorem and moduli of local connectivity ⋮ Computing boundary extensions of conformal maps ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curves that must be retraced
• Effective versions of local connectivity properties
• An effective Carathéodory theorem
• Computing space-filling curves
• Effective Borel measurability and reducibility of functions
• Plottable Real Number Functions and the Computable Graph Theorem
• Effectiveness for Embedded Spheres and Balls

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