2000 character limit reached
Computing links and accessing arcs (1110.5657v3)
Published 25 Oct 2011 in math.LO, cs.CG, and math.GN
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.
Collections
Sign up for free to add this paper to one or more collections.
