Martin Davis | |
---|---|
![]() Davis in 1996 | |
Born | Martin David Davis March 8, 1928 New York City, U.S. |
Died | January 1, 2023 Berkeley, California, U.S. | (aged 94)
Alma mater | City College of New York (AB) Princeton University (PhD) |
Known for | |
Spouse |
Virginia Whiteford Palmer
(m. 1951) |
Awards | Chauvenet Prize (1975) |
Scientific career | |
Institutions | |
Thesis | On the Theory of Recursive Unsolvability (1950) |
Doctoral advisor | Alonzo Church |
Doctoral students |
Martin David Davis (March 8, 1928 – 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.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search