Abstract
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 [7] 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 [4].
This work is supported by DFG (446 CHV 113/266/0-1) and NSFC (10420130638).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brattka, V., Weihrauch, K.: Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219, 65–93 (1999)
Braverman, M., Cook, S.: Computing over real numbers: Foundation for scientific computing. Notics of AMS 53(3), 318–329 (2006)
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)
Gu, X., Lutz, J.H., Mayordomo, E.: Curves that must be retraced (preprint, 2008)
Jordan, C.: Cours d’analyse de l’Ecole Polytechnique. Publications mathématiques d’Orsay (1882)
Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston (1991)
Ko, K.-I.: A polynomial-time computable curve whose interior has a nonrecursive measure. Theoretical Computer Science 145, 241–270 (1995)
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)
Rettinger, R., Zheng, X.: On the computability of rectifiable simple curve (in preparation, 2009)
Weihrauch, K.: Computable Analysis, An Introduction. Springer, Heidelberg (2000)
Weihrauch, K., Zheng, X.: Computability on continuous, lower semi-continuous and upper semi-continuous real functions. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 166–175. Springer, Heidelberg (1997)
Zhong, N., Weihrauch, K.: Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen (September 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rettinger, R., Zheng, X. (2009). Points on Computable Curves of Computable Lengths. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)