Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T02:21:46.159Z Has data issue: false hasContentIssue false

An unsolvable problem in number theory

Published online by Cambridge University Press:  12 March 2014

Hilary Putnam*
Affiliation:
Princeton University

Extract

This paper presents several results whose common element is their connection with Hubert's tenth problem.1 The one that seems most striking (perhaps because it can be stated with a minimum of technical apparatus) is this: there does not exist an algorithm for determining whether or not a polynomial (in n variables) represents every integer.2

In addition, the present paper (i) gives a simple characterization of the diophantine sets (of positive, non-negative, and arbitrary integers), and (ii) gives a rigorous proof of Myhill's theorem [6] that there is no decision method for statements of the form

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1960

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.)

Article purchase

Temporarily unavailable