Proof or recursive unsolvability of Hilbert's tenth problem

  title={Proof or recursive unsolvability of Hilbert's tenth problem},
  author={James P. Jones and Yu. V. Matijasevi{\vc}},
  journal={American Mathematical Monthly},
(1991). Proof of Recursive Unsolvability of Hilbert's Tenth Problem. The American Mathematical Monthly: Vol. 98, No. 8, pp. 689-709. 
Hilbert's Tenth Problem and Paradigms of Computation
This is a survey of a century long history of interplay between Hilbert's tenth problem (about solvability of Diophantine equations) and different notions and ideas from the Computability Theory.
Martin Davis and Hilbert's Tenth Problem
  • Y. Matiyasevich
  • Mathematics
    Martin Davis on Computability, Computational Logic, and Mathematical Foundations
  • 2016
The paper presents the history of the negative solution of Hilbert’s tenth problem , the role played in it by Martin Davis, consequent modifications of the original proof of DPRM-theorem, its
Computation Paradigms in Light of Hilbert's Tenth Problem
In the year 1900, the prominent German mathematician D. Hilbert delivered to the Second International Congress of Mathematicians (held in Paris) his famous lecture titled Mathematische Probleme [41].
On the converse of Wolstenholme's Theorem
The problem of distinguishing prime numbers from composite numbers (. . .) is known to be one of the most important and useful in arithmetic. (. . .) The dignity of the science itself seems to
On Certain Divisibility Property of Polynomials
We review the definition of D-rings introduced by H. Gunji & D. L. MacQuillan. We provide an alternative characterization for such rings that allows us to give an elementary proof of that a ring of
Information-Theoretic Incompleteness
  • G. Chaitin
  • Mathematics, Computer Science
    World Scientific Series in Computer Science
  • 1992
We propose an improved definition of the complexity of a formal axiomatic system: this is now taken to be the minimum size of a self-delimiting program for enumerating the set of theorems of the
On a Strange Recursion of Golomb
It is shown that, to the contrary, there are many increasing solutions for eachk, and it is indicated explicitly how to construct them.


Theory of Recursive Functions and Effective Computability
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
An unsolvable problem in number theory
  • H. Putnam
  • Mathematics
    Journal of Symbolic Logic
  • 1960
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
On non-computable functions
The construction of non-computable functions used in this paper is based on the principle that a finite, non-empty set of non-negative integers has a largest element. Also, this principle is used
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
The main results of this paper show that the same notions of computability can be realized within the highly restricted monogenic formal systems called by Post the "Tag" systems, and within a peculiarly restricted variant of Turing machine which has two tapes, but can neither write on nor erase these tapes.
Existence and feasibility in arithmetic
  • R. Parikh
  • Philosophy
    Journal of Symbolic Logic
  • 1971
“From two integers k, l one passes immediately to kl; this process leads in a few steps to numbers which are far larger than any occurring in experience, e.g., 67(257729). Intuitionism, like ordinary
Computability of Recursive Functions
One half of this equivalence, that all functions computable by any finite, discrete, deterministic device supplied with unlimited storage are partial recursive, is relatively straightforward 3 once the elements of recursive function theory have been established.
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
A new, simple proof of the theorem of M. Davis, Putnam and Robinson, which states that every recursively enumerable relation A is exponential diophantine, is given, where a 1 …, a n, x 1 , …, x m range over natural numbers and R and S are functions built up from these variables and natural number constants.
An Informal Arithmetical Approach to Computability and Computation
In 1936 A. M. Turing published his analysis of the notion of effective computability. Very roughly speaking, its object was to distinguish between numbers defined by existential statements and those
Universal diophantine equation
Matijasevic's theorem implies the existence of a diophantine equation U such that for all x and v, x ∈ W v is also recursively enumerable, and the nonexistence of such an algorithm follows immediately from theexistence of r.e. nonrecursive sets.