Publication Date
8-2017
Abstract
The known 1970 solution to the 10th Hilbert problem says that no algorithm is possible that would decide whether a given Diophantine equation has a solution. In set terms, this means that not all Diophantine sets are decidable. In a posting to the Foundations of Mathematica mailing list, Timothy Y. Chow asked for possible formal justification for his impression that most Diophantine equations are not decidable. One such possible justification is presented in this paper.
Comments
Technical Report: UTEP-CS-17-77
Published in International Mathematical Forum, 2017, Vol. 12, No. 16, pp. 803-806.