The Philosopher
Martin Davis
The face
The background
- Nationality:
- American
- Schools:
- Post–Turing model
- Period:
- 20th century
The synopsis
Martin David Davis (born March 8, 1928, died January 1, 2023) was an American mathematician and computer scientist who contributed to the fields of computability theory and mathematical logic. His work on Hilbert's tenth problem led to the MRDP theorem. He also advanced the Post–Turing model and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which is foundational for Boolean satisfiability solvers. Davis won the Leroy P. Steele Prize, the Chauvenet Prize (with Reuben Hersh), and the Lester R. Ford Award. He was a fellow of the American Academy of Arts and Sciences and a fellow of the American Mathematical Society.
The works
Computability and Unsolvability
Applied nonstandard analysis
Computability, complexity, and languages: fundamentals of theoretical computer science
The Universal Computer: The Road from Leibniz to Turing
The Undecidable: Basic papers on undecidable propositions, unsolvable problems and computable functions
Hilbert's Tenth Problem is Unsolvable
Is Mathematical Insight Algorithmic?
Seventy Years of Computer Science