Computing links and accessing arcs

Date
2013-02-01
Authors
McNicholl, Timothy
McNicholl, Timothy
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Computer Science
Organizational Unit
Mathematics
Organizational Unit
Journal Issue
Series
Abstract

Sufficient conditions are given for the computation of an arc that accesses a point on the boundary of an open subset of the plane from a point within the set. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated.

Description
<p>This is the pre-peer reviewed version of the following article: McNicholl, Timothy H. "Computing links and accessing arcs." <em>Mathematical Logic Quarterly</em> 59, no. 1‐2 (2013): 101-107., which has been published in final form at doi:<a href="http://dx.doi.org/10.1002/malq.201200026" target="_blank">10.1002/malq.201200026</a>. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving."</p>
Keywords
Computable topology, effective local connectivity
Citation
Collections