Computing links and accessing arcs
Logic
2012-12-04 v3 Computational Geometry
General Topology
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.
Cite
@article{arxiv.1110.5657,
title = {Computing links and accessing arcs},
author = {Timothy H. McNicholl},
journal= {arXiv preprint arXiv:1110.5657},
year = {2012}
}