Points on Computable Curves of Computable Lengths
A computable plane curve is defined as the image of a computable real function from a closed interval to the real plane. As it is showed by Ko  that the length of a computable curve is not necessarily computable, even if the length is finite. Therefore, the set of the computable curves of computable lengths is different from the set of the computable curves of finite lengths. In this paper we show further that the points covered by these two sets of curves are different as well. More precisely, we construct a computable curve K of a finite length and a point z on the curve K such that the point z does not belong to any computable curve of computable length. This gives also a positive answer to an open question of Gu, Lutz and Mayordomo in .
Unable to display preview. Download preview PDF.
- 3.Gu, X., Lutz, J.H., Mayordomo, E.: Points on computable curves. In: Proceedings of FOCS 2006, pp. 469–474. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
- 4.Gu, X., Lutz, J.H., Mayordomo, E.: Curves that must be retraced (preprint, 2008)Google Scholar
- 5.Jordan, C.: Cours d’analyse de l’Ecole Polytechnique. Publications mathématiques d’Orsay (1882)Google Scholar
- 9.Rettinger, R., Zheng, X.: On the computability of rectifiable simple curve (in preparation, 2009)Google Scholar
- 12.Zhong, N., Weihrauch, K.: Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen (September 2000)Google Scholar