On relative computability for curves

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Lecture at the mid-west model theory meeting, December, 2004

Scientific paper

We discuss a rational version of a conjecture of Matiyasevich, Davis, and
Putnam on the relative decidability of the finiteness problem for Diophantine
equations with respect to the existence problem. We formulate a suspicion that
for rational solutions, the finiteness problem should be relatively decidable
in contrast to the M-D-P conjecture for integer solutions.

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

On relative computability for curves 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 On relative computability for curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On relative computability for curves will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-54903

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