Martin Davis

Martin Davis
Born 1928 (age 8889)
New York City
Nationality American
Institutions New York University
Alma mater Princeton University
Thesis On the Theory of Recursive Unsolvability (1950)
Doctoral advisor Alonzo Church
Doctoral students John Denes, Robert Di Paola, Thomas Emerson, Ronald Fechter, Richard Gostanian, Keith Harrow, Barry Jacobs, William Gewirtz, Jean-Pierre Keller, Moshe Koppel, David Linfield, Donald W. Loveland, Eugenio Omodeo, Donald Perlis, Alberto Policriti, Richard Rosenberg, Edward Schwartz, Ron Sigal, Eric Wagner, Martin Zuckerman
Known for Davis–Putnam algorithm
DPLL algorithm
work on Hilbert's tenth problem
Notable awards Chauvenet Prize (1975)

Martin David Davis (born 1928) is an American mathematician, known for his work on Hilbert's tenth problem.[1][2]

Biography

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.[1][2]

He received his Ph.D. from Princeton University in 1950, where his advisor was Alonzo Church.[1][2][3] He is Professor Emeritus at New York University.

Contributions

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.

Awards and honors

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 writlng related to his work on Hilbert's tenth problem.[2][4] He became a fellow of the American Academy of Arts and Sciences in 1982,[2] and in 2012, he was selected as one of the inaugural fellows of the American Mathematical Society.[5]

Selected publications

Books
Review of Engines of logic: Wallace, Richard S., Mathematicians who forget the mistakes of history: a review of Engines of Logic by Martin Davis, ALICE A.I. Foundation. 
Hardcover edition published as : The Universal Computer 
Articles

See also

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.