Curves That Must Be Retraced

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every positive integer n, there is some positive-length subcurve of GAMMA that f retraces at least n times. In contrast, every computable curve of finite length that does not intersect itself has a constant-speed (hence non-retracing) parametrization that is computable relative to the halting problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Curves That Must Be Retraced does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Curves That Must Be Retraced, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Curves That Must Be Retraced will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-352287

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.