scientific article

zbMath0553.03024MaRDI QIDQ3346295

Martin Davis

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hilbert's tenth problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Thue and Post systems, etc. (03D03) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55) Diophantine equations (11D99) Computability and recursion theory (03Dxx)

Related Items (11)

Dynamical system where proving chaos is equivalent to proving Fermat's conjecture ⋮ A direct method for simulating partial recursive functions by Diophantine equations ⋮ The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes ⋮ On the expressiveness of choice quantification ⋮ Computable processes and bisimulation equivalence ⋮ DIAGONALIZATION EXHIBITED IN THE LIAR PARADOX, RUSSELL’S PARADOX AND GÖDEL’S INCOMPLETENESS THEOREM ⋮ From undecidability of non-triviality and finiteness to undecidability of learnability ⋮ Taking the Pirahã seriously ⋮ A survey of computational complexity results in systems and control ⋮ The mathematical universe ⋮ Quantum principles and mathematical computability

This page was built for publication: