关于强迫折返的可计算曲线.pdfVIP

Studies in Logic, Vol. 5, No. 3 (2012): 11–23 PII: 1674-3202(2012)-03-0011-13 On the Forced Retracing Computable Curves Xizhong Zheng School of Science, Jiangsu University Department of Computer Science and Mathematics, Arcadia University zhengx@arcadia.edu David Abdul-Malak Department of Industrial Engineering, University of Pittsburgh DTA10@pitt.edu Megan Gillespie Department of Computer Science and Mathematics, Arcadia University mgillespie@arcadia.edu Abstract. A planar curve can be defined as the image of the unit interval under a continuous function which is so-called parametrization of the curve. The curves parameterized by injective continuous functions are called simple. If a curve has a computable parametrization, then it is called computable. Surprisingly, Gu, Lutz and Mayordomo show in [4] that there exists a computable simple curve which does not have any injective computable parametrization. That is, the computable parametrization of this curve must retrace the curve. In this paper, we first introduce different classes of computable curves according to the number of retracing allowed in a computable parametrization, then we show an infinite proper hierarchy of these classes. Therefore, the retracing number allowed in the computable parametrization can be used to measure the complexity of a computable curve. 1 Introduction Curves are important mathematical models for recording the particle motion. They are defined in mathematics as the images of the closed unit interval or unit circle under continuous functions. These continuous function