Computing links and accessing arcs

TL;DR

This paper explores the conditions under which accessing arcs and links between boundary components in multiply connected domains can be computed, and demonstrates the existence of computable points on certain arcs that are not accessible.

Contribution

It provides new sufficient conditions for computing accessing arcs and links in complex domains, and shows that some computable points may still be inaccessible.

Findings

Established conditions for computing accessing arcs in multiply connected domains.

Proved the existence of computable points on arcs that are not accessible.

Highlighted limitations in computability related to boundary access in complex domains.

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.