Jump to content

Martin Davis (mathematician)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by MainlyTwelve (talk | contribs) at 22:30, 11 February 2016 (Category:Princeton University alumni, 1950-1959). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Martin Davis
Born1928 (age 95–96)
NationalityAmerican
Alma materPrinceton University
Known forDavis–Putnam algorithm
DPLL algorithm
work on Hilbert's tenth problem
AwardsChauvenet Prize (1975)
Scientific career
InstitutionsNew York University
Thesis On the Theory of Recursive Unsolvability  (1950)
Doctoral advisorAlonzo Church
Doctoral studentsJohn 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

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

Selected publications

Books
  • Davis, Martin (1977). Applied nonstandard analysis. New York: Wiley. ISBN 9780471198970.
  • 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.
  • Davis, Martin (2000). Engines of logic: mathematicians and the origin of the computer. New York: Norton. ISBN 9780393322293.
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. {{citation}}: Invalid |ref=harv (help)
Hardcover edition published as : The Universal Computer
Articles
  • Davis, Martin (1995), "Is mathematical insight algorithmic", Behavioral and Brain Sciences, 13(4), 659–60.

See also

References

  1. ^ a b c Jackson, Allyn (September 2007), "Interview with Martin Davis" (PDF), Notices of the American Mathematical Society, vol. 55, no. 5, Providence, RI: American Mathematical Society (published 2008), pp. 560–571, ISSN 0002-9920, OCLC 1480366 {{citation}}: Check date values in: |year= / |date= mismatch (help).
  2. ^ a b c d e O'Connor, John J.; Robertson, Edmund F., "Martin Davis (mathematician)", MacTutor History of Mathematics Archive, University of St Andrews Cite error: The named reference "mactutor" was defined multiple times with different content (see the help page).
  3. ^ Davis, Martin (1973). "Hilbert's tenth problem is unsolvable". Amer. Math. Monthly. 80: 233–269. doi:10.2307/2318447.
  4. ^ List of Fellows of the American Mathematical Society, retrieved 2014-03-17.