Proof of Recursive Unsolvability of Hilbert's Tenth Problem
From MaRDI portal
Recommendations
Cited in
(17)- Information-theoretic incompleteness
- LISP program-size complexity. II
- 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
- Pell equations and exponentiation in fragments of arithmetic
- Iterative arrays with finite inter-cell communication
- Diophantine representation of the decimal expansions of e and
- Martin Davis and Hilbert's tenth problem
- scientific article; zbMATH DE number 3880670 (Why is no real title available?)
- Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
- scientific article; zbMATH DE number 4085632 (Why is no real title available?)
- Questions of decidability and undecidability in Number Theory
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- An exact correspondence of linear problems and randomizing linear algorithms
- An open formalism against incompleteness
- Reduction systems and degree bounds for integration
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)
