Work

On relative computability for curves

Year: 2005
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W1609863693
Cites: 1
Cited by: 6
Related to: 10