2011/10/25 by Timothy H. McNicholl, McNicholl, Timothy H.
Computer Science · Mathematics · #03F60 #30C20 #30C30 #30C85 #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #General Topology (math.GN) #Logic (math.LO) #cs.CG #math.GN #math.LO #msc:03F60 #msc:30C20 #msc:30C30 #msc:30C85
paper · pdf · doi:10.48550/arxiv.1110.5657
arxiv created 2012/09/05 · arxiv updated 2012/12/04
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.