Martin Davis

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
Martin Davis
Martin Davis.jpg
Born 1928 (age 93–94)
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, 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]


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 adviser was Alonzo Church.[1][3] 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.

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

  • Davis, Martin (1977). Applied nonstandard analysis. New York: Wiley. ISBN 9780471198970.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  • Davis, Martin; Weyuker, Elaine J.; Sigal, Ron (1994). Computability, complexity, and languages: fundamentals of theoretical computer science (2nd ed.). Boston: Academic Press, Harcourt, Brace. ISBN 9780122063824.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  • Davis, Martin (2000). Engines of logic: mathematicians and the origin of the computer. New York: Norton. ISBN 9780393322293.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
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.CS1 maint: ref=harv (link)<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
Hardcover edition published as : The Universal Computer<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  • Davis, Martin (1995), "Is mathematical insight algorithmic", Behavioral and Brain Sciences, 13(4), 659–60.

See also


  1. 1.0 1.1 1.2 Jackson, Allyn (September 2007), "Interview with Martin Davis" (PDF), Notices of the American Mathematical Society, Providence, RI: American Mathematical Society (published 2008), 55 (5), pp. 560–571, ISSN 0002-9920, OCLC 1480366 Check date values in: |year= / |date= mismatch (help)<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>.
  2. 2.0 2.1 2.2 2.3 O'Connor, John J.; Robertson, Edmund F., "Martin Davis", MacTutor History of Mathematics archive, University of St Andrews<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>.
  3. Martin Davis at the Mathematics Genealogy Project
  4. Davis, Martin (1973). "Hilbert's tenth problem is unsolvable". Amer. Math. Monthly. 80: 233–269. doi:10.2307/2318447.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  5. List of Fellows of the American Mathematical Society, retrieved 2014-03-17.

External links