Computing links and accessing arcs

Mathematical Logic Quarterly 59 (1-2):101-107 (2013)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-03

Downloads
26 (#574,431)

6 months
7 (#339,156)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Effective Borel measurability and reducibility of functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.

Add more references