Points on Computable Curves of Computable Lengths

  • Robert Rettinger
  • Xizhong Zheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5734)

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].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brattka, V., Weihrauch, K.: Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219, 65–93 (1999)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Braverman, M., Cook, S.: Computing over real numbers: Foundation for scientific computing. Notics of AMS 53(3), 318–329 (2006)MATHGoogle Scholar
  3. 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. 4.
    Gu, X., Lutz, J.H., Mayordomo, E.: Curves that must be retraced (preprint, 2008)Google Scholar
  5. 5.
    Jordan, C.: Cours d’analyse de l’Ecole Polytechnique. Publications mathématiques d’Orsay (1882)Google Scholar
  6. 6.
    Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston (1991)CrossRefMATHGoogle Scholar
  7. 7.
    Ko, K.-I.: A polynomial-time computable curve whose interior has a nonrecursive measure. Theoretical Computer Science 145, 241–270 (1995)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)CrossRefMATHGoogle Scholar
  9. 9.
    Rettinger, R., Zheng, X.: On the computability of rectifiable simple curve (in preparation, 2009)Google Scholar
  10. 10.
    Weihrauch, K.: Computable Analysis, An Introduction. Springer, Heidelberg (2000)CrossRefMATHGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Zhong, N., Weihrauch, K.: Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen (September 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Robert Rettinger
    • 1
  • Xizhong Zheng
    • 2
    • 3
  1. 1.Lehrgebiet Algorithmen und KomplexitätFernUniversität HagenHagenGermany
  2. 2.Department of Computer Science and MathematicsArcadia UniversityGlensideUSA
  3. 3.Department of MathematicsJiangsu UniversityZhenjiangChina

Personalised recommendations