Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Martin Davis (mathematician)

Theory of Computation

Martin Davis was an American mathematician and computer scientist who worked in computability theory and mathematical logic, living from 1928 until 2023. His work on Hilbert's tenth problem led to the MRDP theorem, which settled that no general algorithm decides whether a polynomial equation has integer solutions. He also advanced the Post-Turing model of computation and co-developed the Davis-Putnam-Logemann-Loveland algorithm, a backtracking search procedure that became foundational for Boolean satisfiability solvers. His honors include the Leroy P. Steele Prize and the Chauvenet Prize, the latter shared with Reuben Hersh, and the Lester R. Ford Award, and he was a fellow of the American Academy of Arts and Sciences and of the American Mathematical Society.

Martin Davis (mathematician)
Filter Results1 entry
Connections

Credited

Source Davis-Putnam algorithm (Wikipedia)

Invented By

Source Davis-Putnam algorithm (Wikipedia)
Source DPLL algorithm (Wikipedia)
Sources
Martin Davis (mathematician) (Wikipedia)
DPLL algorithm (Wikipedia)
Invented By: DPLL algorithm, Lead paragraph
Quote, Invented By: DPLL algorithm, Lead paragraph
It was introduced in 1961 by Martin Davis, George Logemann and Donald W. Loveland
View the Source
Davis-Putnam algorithm (Wikipedia)
  • Invented By: Davis-Putnam algorithm, Lead
    the Davis-Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula
  • Credited: Davis-Putnam algorithm, Lead
    the Davis-Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.