arXiv · math/0502224
On relative computability for curves
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Minhyong Kim. 2005-02-10. On relative computability for curves. https://arxiv.org/abs/math/0502224
Cite the original work for its findings. Save a collection to share your selection of sources.