Submitted:
27 September 2017
Posted:
27 September 2017
You are already at the latest version
Abstract
We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine equations which have at most finitely many solutions in positive integers is not recursively enumerable, (3) the set of all Diophantine equations which have at most finitely many integer solutions is not recursively enumerable, (4) analogous theorems hold for Diophantine equations D(x1, …, xp) = 0, where p ∈ N\{0} and for every i ∈ {1, …, p} the polynomial D(x1, …, xp) involves a monomial M with a non-zero coefficient such that xi divides M, (5) the set of all Diophantine equations which have at most k variables (where k ≥ 9) and at most finitely many solutions in non-negative integers is not recursively enumerable.
Keywords:
Davis-Putnan Robinson-Matiyasevich theorem
; Diophantine equation which has at most finitely many solutions in non-negative integers
; Diophantine equation which has at most finitely many solutions in positive integers
; Diophantine equation which has at most finitely many integer solutions
; Hilbert’s Tenth Problem
; Matiyasevich’s theorem
; recursively enumerable set
; Smoryński’s theorem
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
