Proof of Recursive Unsolvability of Hilbert's Tenth Problem

DOI10.2307/2324421zbMATH Open0746.03006OpenAlexW2034614286MaRDI QIDQ3986352FDOQ3986352

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

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

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)

Cited In (16)

• Martin Davis and Hilbert's tenth problem
• Title not available (Why is that?)
• Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• Information-theoretic incompleteness
• Diophantine representation of the decimal expansions of \(e\) and \(\pi \)
• LISP program-size complexity. II
• An exact correspondence of linear problems and randomizing linear algorithms
• Title not available (Why is that?)
• A direct method for simulating partial recursive functions by Diophantine equations
• Iterative arrays with finite inter-cell communication
• 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
• An open formalism against incompleteness
• Pell equations and exponentiation in fragments of arithmetic

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)