| Martin Davis | |
| Birth Name: | Martin David Davis |
| Birth Date: | 8 March 1928 |
| Birth Place: | New York City, U.S. |
| Death Place: | Berkeley, California, U.S. |
| Alma Mater: | City College of New York (AB) Princeton University (PhD) |
| Thesis Title: | On the Theory of Recursive Unsolvability |
| Thesis1 Url: | and |
| Thesis2 Url: | ) -->https://www.proquest.com/docview/304373195 |
| Thesis Year: | 1950 |
| Doctoral Advisor: | Alonzo Church |
| Awards: | Chauvenet Prize (1975) |
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.
Davis's parents were Jewish immigrants to the United States from Łódź, Poland, and married after they met again in New York City. Davis was born in New York City on March 8, 1928. He grew up in the Bronx, where his parents encouraged him to obtain a full education.[1] He graduated from the prestigious Bronx High School of Science in 1944 and went on to receive his bachelor's degree in mathematics from City College in 1948 and his PhD from Princeton University in 1950.[2] His doctoral dissertation, entitled On the Theory of Recursive Unsolvability, was supervised by American mathematician and computer scientist Alonzo Church.
During a research instructorship at the University of Illinois at Urbana-Champaign in the early 1950s, he joined the Control Systems Lab and became one of the early programmers of the ORDVAC. He later worked at Bell Labs and the RAND Corporation before joining New York University.[1] During his time at the NYU, he helped set up the university's computer science department. He retired from NYU in 1996.[1] He was later a member of visiting faculty at University of California, Berkeley.[3]
Davis first worked on Hilbert's tenth problem during his PhD dissertation, working with Alonzo Church. The theorem, as posed by the German mathematician David Hilbert, asks a question: given a Diophantine equation, is there an algorithm that can decide if the equation is solvable?[1] Davis's dissertation put forward a conjecture that the problem was unsolvable. In the 1950s and 1960s, Davis, along with American mathematicians Hilary Putnam and Julia Robinson, made progress toward solving this conjecture. The proof of the conjecture was finally completed in 1970 with the work of Russian mathematician Yuri Matiyasevich. This resulted in the MRDP or the DPRM theorem, named for Davis, Putnam, Robinson, and Matiyasevich.[1] Describing the problem, Davis had earlier mentioned that he found the problem "irresistibly seductive" when he was an undergraduate and later had progressively become his "lifelong obsession".[4]
Davis collaborated with Putnam, George Logemann, and Donald W. Loveland in 1961 to introduce the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which was a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e., for solving the CNF-SAT problem.[5] The algorithm was a refinement of the earlier Davis–Putnam algorithm, which was a resolution-based procedure developed by Davis and Putnam in 1960.[6] [7] The algorithm is foundational in the architecture of fast Boolean satisfiability solvers.[4]
In addition to his work on computability theory, Davis also made significant contributions to the fields of computational complexity and mathematical logic.[1] [4] [8] Davis was also known for his model of Post–Turing machines.
In 1974, Davis won the Lester R. Ford Award for his expository writing related to his work on Hilbert's tenth problem,[9] and in 1975 he won the Leroy P. Steele Prize and the Chauvenet Prize (with Reuben Hersh).[10] He became a fellow of the American Academy of Arts and Sciences in 1982, and in 2013, he was selected as one of the inaugural fellows of the American Mathematical Society.[11]
Davis's 1958 book Computability and Unsolvability is considered a classic in theoretical computer science, while his 2000 book The Universal Computer traces the evolution and history of computing starting including works of Gottfried Wilhelm Leibniz and Alan Turing.[1] His book The Undecidable, the first edition of which was published in 1965, was a collection of unsolvable problems and computable functions.[4]
Davis was married to Virginia Whiteford Palmer, a textile artist. The couple met during their time in the Urbana–Champaign area and subsequently married in 1951.[12] They had two children. The couple lived in Berkeley, California, after his retirement.[1]
Davis died on January 1, 2023, at age 94.[13] His wife died the same day several hours later.[14]
Books
Articles