Computing links and accessing arcs
classification
🧮 math.LO
cs.CGmath.GN
keywords
arcsaccessinglinksboundarycompactcomponentscomputablecomputably
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.