Proof of Recursive Unsolvability of Hilbert's Tenth Problem
From MaRDI portal
Publication:3986352
DOI10.2307/2324421zbMath0746.03006OpenAlexW2034614286MaRDI QIDQ3986352
No author found.
Publication date: 27 June 1992
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2324421
Decidability (number-theoretic aspects) (11U05) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99)
Related Items
A direct method for simulating partial recursive functions by Diophantine equations, Formulation of linear problems and solution by a universal machine, Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets, Questions of decidability and undecidability in Number Theory, Pell equations and exponentiation in fragments of arithmetic, Unnamed Item, Two conjectures on the arithmetic in ℝ and ℂ, Martin Davis and Hilbert’s Tenth Problem, Information-theoretic incompleteness, LISP program-size complexity. II, An open formalism against incompleteness, Iterative arrays with finite inter-cell communication, An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms
