Proof of Recursive Unsolvability of Hilbert's Tenth Problem

DOI10.2307/2324421MaRDI QIDQ3986352zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

recursive unsolvability of Hilbert's tenth problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99) Undecidability and degrees of sets of sentences (03D35) Decidability (number-theoretic aspects) (11U05)

Recommendations

• scientific article; zbMATH DE number 1261118
• Martin Davis and Hilbert's tenth problem
• scientific article; zbMATH DE number 3880670
• scientific article; zbMATH DE number 4085632

Cited in

(16)

• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• Iterative arrays with finite inter-cell communication
• Diophantine representation of the decimal expansions of \(e\) and \(\pi \)
• Information-theoretic incompleteness
• A direct method for simulating partial recursive functions by Diophantine equations
• scientific article; zbMATH DE number 3880670 (Why is no real title available?)
• Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
• scientific article; zbMATH DE number 4085632 (Why is no real title available?)
• Pell equations and exponentiation in fragments of arithmetic
• Martin Davis and Hilbert's tenth problem
• An open formalism against incompleteness
• Questions of decidability and undecidability in Number Theory
• LISP program-size complexity. II
• An exact correspondence of linear problems and randomizing linear algorithms
• Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
• Formulation of linear problems and solution by a universal machine

This page was built for publication: Proof of Recursive Unsolvability of Hilbert's Tenth Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986352)