Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?
From MaRDI portal
Publication:2843817
DOI10.3233/FI-2013-854zbMath1288.11116arXiv0901.2093MaRDI QIDQ2843817
Publication date: 26 August 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.2093
Davis-Putnam-Robinson-Matiyasevich theorem; Matiyasevich's conjecture on finite-fold Diophantine representations
11U05: Decidability (number-theoretic aspects)
Related Items