An application of recursive function theory to Hilbert's tenth problem. It is proved that if a particular exhibited diophantine equation has no nontrivial solutions, then all recursively enumerable sets are diophantine. Hence, if the exhibited diophantine equation has no nontrivial solutions, then Hilbert's tenth problem is recursively unsolvable. The methods used can be readily adapted to obtain various other hypotheses about which demonstrations can be made similar to the one given in this study. It has not yet been proved that the "one equation to rule them all" has no nontrivial solution, but so far the search for counterexamples has been fruitless.
This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.