Martin Davis
Massachusetts Institute of Technology · 5 works · 259 citations · h-index 3
Top works
- A Computing Procedure for Quantification Theory
- Computability and Unsolvability.
- A machine program for theorem-proving
- Computability and Unsolvability.
- The Decision Problem for Exponential Diophantine Equations
- Hilbert's Tenth Problem is Unsolvable
- The mathematics of non-monotonic reasoning
- Hilbert's Tenth Problem.
- Eliminating the irrelevant from mechanical proofs
- Applied Nonstandard Analysis
- Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solution
- Eliminating the Irrelevant from Mechanical Proofs
- M. L. Minsky. Size and structure of universal Turing machines using Tag systems. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 229–238.
- Arithmetical problems and recursively enumerable predicates
- Introduction to the Theory of Finite Automata
- The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
- Pseudo-oracles for non-testable programs
- The universal computer: the road from Leibniz to Turing
- Obvious logical inferences
- A Note on Universal Turing Machines