On relative computability for curves

Simple item page
dc.creatorKim, Minhyong
dc.date2005-02-10
dc.date.accessioned2026-07-07T05:16:53Z
dc.date.available2026-07-07T05:16:53Z
dc.descriptionWe 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.
dc.descriptionLecture at the mid-west model theory meeting, December, 2004
dc.identifierhttps://arxiv.org/abs/math/0502224
dc.identifierhttp://arxiv.org/abs/math/0502224
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74152
dc.subjectNumber Theory
dc.subjectLogic
dc.subject11D99
dc.titleOn relative computability for curves
dc.typetext

Files

Collections

arXiv