Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-06T21:00:27.133Z Has data issue: false hasContentIssue false

Reductions of Hilbert's tenth problem

Published online by Cambridge University Press:  12 March 2014

Martin Davis
Affiliation:
Rennselaer Polytechnic Institute, Hartford Graduate Division andPrinceton University
Hilary Putnam
Affiliation:
Rennselaer Polytechnic Institute, Hartford Graduate Division andPrinceton University

Extract

Hilbert's tenth problem is to find an algorithm for determining whether or not a diophantine equation possesses solutions. A diophantine predicate (of positive integers) is defined to be one of the form

where P is a polynomial with integral coefficients (positive, negative, or zero). Previous work has considered the variables as ranging over nonnegative integers; but we shall find it more useful here to restrict the range to positive integers, no essential change being thereby introduced. It is clear that the recursive unsolvability of Hilbert's tenth problem would follow if one could show that some non-recursive predicate were diophantine. In particular, it would suffice to show that every recursively enumerable predicate is diophantine. Actually, it would suffice to prove far less.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1958

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

[1]Davis, Martin, Arithmetical problems and recursively enumerable predicates, this Journal, vol. 18 (1953), pp. 3341.Google Scholar
[2]Gödel, Kurt, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I, Monatshefte für Mathematik und Physik, vol. 38 (1931), pp. 173198.CrossRefGoogle Scholar
[3]Robinson, Julia, Existential definability in arithmetic, Transactions of the American Mathematical Society, vol. 72 (1952), pp. 437449.CrossRefGoogle Scholar
[4]Robinson, R. M., Arithmetical representation of recursively enumerable sets, this Journal, vol. 21 (1956), pp. 162186.Google Scholar