|Alma mater||Princeton University|
|Known for||Davis–Putnam algorithm|
work on Hilbert's tenth problem
|Awards||Chauvenet Prize (1975)|
|Institutions||New York University|
|Thesis||On the Theory of Recursive Unsolvability (1950)|
|Doctoral advisor||Alonzo Church|
|Doctoral students||Moshe Koppel, Donald W. Loveland|
Davis's parents were Jewish immigrants to the US from Łódź, Poland, and married after they met again in New York City. Davis grew up in the Bronx, where his parents encouraged him to obtain a full education.
He received his Ph.D. from Princeton University in 1950, where his advisor was 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 is Professor Emeritus at New York University.
Davis is the co-inventor of the Davis–Putnam algorithm and the DPLL algorithms. He is also known for his model of Post–Turing machines, and his work on Hilbert's tenth problem leading to the MRDP theorem.
In 1975, Davis won the Leroy P. Steele Prize, the Chauvenet Prize (with Reuben Hersh), and in 1974 the Lester R. Ford Award for his expository writing related to his work on Hilbert's tenth problem. He became a fellow of the American Academy of Arts and Sciences in 1982, and in 2012, he was selected as one of the inaugural fellows of the American Mathematical Society.
|Wikimedia Commons has media related to Martin Davis.|