8 citations · 29 across the 22 of their papers we have counts for
Showing 2011 · math.LOShow all
3 papers · 2 filters
math.LO2011
Computing links and accessing arcs
Timothy H. McNicholl
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-acces…
math.LO2011
The power of backtracking and the confinement of length
Timothy H. McNicholl
We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve wit…
math.LO2011★ 8 cited
Effective local connectivity properties
Dale Daniel, Timothy H. McNicholl
We investigate, and prove equivalent, effective versions of local connectivity and uniformly local arcwise connectivity for connected and computably compact subspaces of Euclidean…