On relative computability for curves
Number Theory
2007-05-23 v1 Logic
Abstract
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.
Keywords
Cite
@article{arxiv.math/0502224,
title = {On relative computability for curves},
author = {Minhyong Kim},
journal= {arXiv preprint arXiv:math/0502224},
year = {2007}
}
Comments
Lecture at the mid-west model theory meeting, December, 2004