A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Number of Solutions of Diophantine Equations
1972
Proceedings of the American Mathematical Society
For any nontrivial set of cardinal numbers ^x0, it is shown that there is no algorithm for testing whether or not the number of positive integer solutions of a given polynomial Diophantine equation belongs to the set.
doi:10.2307/2037646
fatcat:hjb2ga2kzjgsdduurohhng2zxe