The power of backtracking and the confinement of length

McNicholl, Timothy

doi:10.1090/S0002-9939-2012-11385-1

The power of backtracking and the confinement of length
HTML articles powered by AMS MathViewer

by Timothy H. McNicholl PDF

Proc. Amer. Math. Soc. 141 (2013), 1041-1053 Request permission

Abstract:

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 with computable length that does not belong to any computable arc.

References

George S. Boolos, John P. Burgess, and Richard C. Jeffrey, Computability and logic, 4th ed., Cambridge University Press, Cambridge, 2002. MR 1898463, DOI 10.1017/CBO9781139164931
Vasco Brattka, Plottable real number functions and the computable graph theorem, SIAM J. Comput. 38 (2008), no. 1, 303–328. MR 2399529, DOI 10.1137/060658023
S. Barry Cooper, Computability theory, Chapman & Hall/CRC, Boca Raton, FL, 2004. MR 2017461
P. J. Couch, B. D. Daniel, and Timothy H. McNicholl, Computing space-filling curves, Theory Comput. Syst. 50 (2012), no. 2, 370–386. MR 2875304, DOI 10.1007/s00224-010-9306-3
B.D. Daniel and T.H. McNicholl, Effective local connectivity properties, Theory of Computing Systems 50 (2012), no. 4, 621–640.
Rodney G. Downey and Denis R. Hirschfeldt, Algorithmic randomness and complexity, Theory and Applications of Computability, Springer, New York, 2010. MR 2732288, DOI 10.1007/978-0-387-68441-3
Kenneth Falconer, Fractal geometry, 2nd ed., John Wiley & Sons, Inc., Hoboken, NJ, 2003. Mathematical foundations and applications. MR 2118797, DOI 10.1002/0470013850
Michael R. Garey and David S. Johnson, Computers and intractability, A Series of Books in the Mathematical Sciences, W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness. MR 519066
X. Gu, J. Lutz, and E. Mayordomo, Points on computable curves, Proceedings of the Forty-Seventh Annual IEEE Symposium on Foundations of Computer Science (Berkeley, CA), IEEE Computer Society Press, October 2006, pp. 469–474.
Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo, Curves that must be retraced, Inform. and Comput. 209 (2011), no. 6, 992–1006. MR 2817185, DOI 10.1016/j.ic.2011.01.004
John G. Hocking and Gail S. Young, Topology, 2nd ed., Dover Publications, Inc., New York, 1988. MR 1016814
Peter W. Jones, Rectifiable sets and the traveling salesman problem, Invent. Math. 102 (1990), no. 1, 1–15. MR 1069238, DOI 10.1007/BF01233418
Ker-I Ko, A polynomial-time computable curve whose interior has a nonrecursive measure, Theoret. Comput. Sci. 145 (1995), no. 1-2, 241–270. MR 1339482, DOI 10.1016/0304-3975(94)00154-B
Jack H. Lutz, The dimensions of individual strings and sequences, Inform. and Comput. 187 (2003), no. 1, 49–79. MR 2018734, DOI 10.1016/S0890-5401(03)00187-1
Jack H. Lutz, Effective fractal dimensions, MLQ Math. Log. Q. 51 (2005), no. 1, 62–72. MR 2099385, DOI 10.1002/malq.200310127
Joseph S. Miller, Degrees of unsolvability of continuous functions, J. Symbolic Logic 69 (2004), no. 2, 555–584. MR 2058189, DOI 10.2178/jsl/1082418543
R. L. Moore and J. R. Kline, On the most general plane closed point-set through which it is possible to pass a simple continuous arc, Ann. of Math. (2) 20 (1919), no. 3, 218–223. MR 1502556, DOI 10.2307/1967872
Kate Okikiolu, Characterization of subsets of rectifiable curves in $\textbf {R}^n$, J. London Math. Soc. (2) 46 (1992), no. 2, 336–348. MR 1182488, DOI 10.1112/jlms/s2-46.2.336
Hans Sagan, Space-filling curves, Universitext, Springer-Verlag, New York, 1994. MR 1299533, DOI 10.1007/978-1-4612-0871-6
Robert I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987. A study of computable functions and computably generated sets. MR 882921, DOI 10.1007/978-3-662-02460-7
Klaus Weihrauch, Computable analysis, Texts in Theoretical Computer Science. An EATCS Series, Springer-Verlag, Berlin, 2000. An introduction. MR 1795407, DOI 10.1007/978-3-642-56999-9