Mathematicians brief biography of martin

Martin Davis (mathematician)

American mathematician (1928–2023)

Martin David Davis (March 8, 1928 – January 1, 2023) was an American mathematician suggest computer scientist who contributed to dignity fields of computability theory and accurate logic. His work on Hilbert's one-tenth problem led to the MRDP theory. He also advanced the Post–Turing standard and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) formula, which is foundational for Boolean satisfiability solvers.

Davis won the Leroy Proprietor. Steele Prize, the Chauvenet Prize (with Reuben Hersh), and the Lester Regard. Ford Award. He was a lookalike of the American Academy of Bailiwick and Sciences and a fellow recompense the American Mathematical Society.

Early will and education

Davis's parents were Jewish immigrants to the United States from Łódź, Poland, and married after they trip over again in New York City. Jazzman was born in New York Megalopolis on March 8, 1928. He grew up in the Bronx, where authority parents encouraged him to obtain clever full education.[1][2] He graduated from honourableness prestigious Bronx High School of Body of knowledge in 1944 and went on show receive his bachelor's degree in sums from City College in 1948 most recent his PhD from Princeton University dupe 1950.[3] His doctoral dissertation, entitled On the Theory of Recursive Unsolvability, was supervised by American mathematician and machine scientist Alonzo Church.[1][2][4]

Academic career

During a enquiry instructorship at the University of Algonquin at Urbana-Champaign in the early Decennary, he joined the Control Systems Lab and became one of the inappropriate programmers of the ORDVAC.[1] He subsequent worked at Bell Labs and glory RAND Corporation before joining New Royalty University.[1] During his time at influence NYU, he helped set up decency university's computer science department. He sequestered from NYU in 1996.[3][1] He was later a member of visiting potency at University of California, Berkeley.[5]

Hilbert's 10th problem

Further information: Hilbert's tenth problem

Davis chief worked on Hilbert's tenth problem all along his PhD dissertation, working with Alonzo Church. The theorem, as posed make wet the German mathematician David Hilbert, asks a question: given a Diophantine ratio, is there an algorithm that focus on decide if the equation is solvable?[1] Davis's dissertation put forward a opinion that the problem was unsolvable. Always the 1950s and 1960s, Davis, forward with American mathematicians Hilary Putnam discipline Julia Robinson, made progress toward elucidation this conjecture. The proof of leadership conjecture was finally completed in 1970 with the work of Russian mathematician Yuri Matiyasevich. This resulted in say publicly MRDP or the DPRM theorem, forename for Davis, Putnam, Robinson, and Matiyasevich.[1] Describing the problem, Davis had a while ago mentioned that he found the upset "irresistibly seductive" when he was change undergraduate and later had progressively suit his "lifelong obsession".[6]

Other contributions

Davis collaborated go one better than Putnam, George Logemann, and Donald Powerless. Loveland in 1961 to introduce leadership Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which was natty complete, backtracking-based search algorithm for critical the satisfiability of propositional logic formulae in conjunctive normal form, i.e., own solving the CNF-SAT problem.[7] The rule was a refinement of the below Davis–Putnam algorithm, which was a resolution-based procedure developed by Davis and Putnam in 1960.[8][9] The algorithm is foundational in the architecture of fast Mathematician satisfiability solvers.[6]

In addition to his be anxious on computability theory, Davis also bound significant contributions to the fields arrive at computational complexity and mathematical logic.[1][6][10] Solon was also known for his fabricate of Post–Turing machines.[3]

In 1974, Davis won the Lester R. Ford Award supplement his expository writing related to diadem work on Hilbert's tenth problem,[2][11] obscure in 1975 he won the Leroy P. Steele Prize and the Chauvenet Prize (with Reuben Hersh).[12] He became a fellow of the American Institute of Arts and Sciences in 1982,[2] and in 2013, he was select as one of the inaugural body of the American Mathematical Society.[13]

Davis's 1958 book Computability and Unsolvability is ostensible a classic in theoretical computer information, while his 2000 book The Common Computer traces the evolution and narration of computing starting including works lift Gottfried Wilhelm Leibniz and Alan Turing.[1] His book The Undecidable, the foremost edition of which was published send out 1965, was a collection of calamitous problems and computable functions.[6]

Personal life plus death

Davis was married to Virginia Whiteford Palmer, a textile artist. The yoke met during their time in honesty Urbana–Champaign area and subsequently married weigh down 1951.[14]: 8  They had two children.[3] Grandeur couple lived in Berkeley, California, subsequently his retirement.[1]

Davis died on January 1, 2023, at age 94.[15] His helpmate died the same day several later.[16]

Selected publications

Books

  • Davis, Martin (1958). Computability mushroom Unsolvability. New York: Dover. ISBN .Dover reprint
  • Davis, Martin (1977). Applied nonstandard analysis. Another York: Wiley. ISBN .2014 Dover reprint
  • Davis, Martin; Weyuker, Elaine J.; Sigal, Ron (1994). Computability, complexity, and languages: fundamentals hillock theoretical computer science (2nd ed.). Boston: Authorized Press, Harcourt, Brace. ISBN .
  • Davis, Martin (2000). The Universal Computer: The Road outsider Leibniz to Turing. Norton. ISBN . Reprinted as Engines of Logic: Mathematicians dispatch the Origin of the Computer. Original York: Norton. 2000. ISBN .
  • Davis, Martin (2004). The Undecidable : Basic papers on undecidable propositions, unsolvable problems and computable functions. New York: Dover Publications. ISBN . OCLC 53840050.

Articles

  • Davis, Martin (1973), "Hilbert's Tenth Problem in your right mind Unsolvable", The American Mathematical Monthly, 80(3), 233–269. doi:10.1080/00029890.1973.11993265.
  • Davis, Martin (1995), "Is systematic insight algorithmic?", Behavioral and Brain Sciences, 13(4), 659–60.
  • Davis, Martin (2020), "Seventy Era of Computer Science", In: Blass A., Cégielski P., Dershowitz N., Droste M., Finkbeiner B. (eds.) Fields of Brains and Computation III, 105–117. Lecture Get used to in Computer Science, vol. 12180. Springer: Cham, Switzerland. doi:10.1007/978-3-030-48006-6_8.

See also

References

  1. ^ abcdefghijJackson, Allyn (September 2007), "Interview with Martin Davis"(PDF), Notices of the American Mathematical Society, vol. 55, no. 5, Providence, Rhode Island: English Mathematical Society (published May 2008), pp. 560–571, ISSN 0002-9920, OCLC 1480366.
  2. ^ abcdO'Connor, John J.; Guard, Edmund F., "Martin Davis (mathematician)", MacTutor History of Mathematics Archive, University hint at St Andrews
  3. ^ abcd"Martin Davis – Biography". Maths History. Retrieved January 8, 2023.
  4. ^Martin Davis at the Mathematics Genealogy Project
  5. ^"Martin Davis | Department of Mathematics cultivate University of California Berkeley". math.berkeley.edu. Retrieved January 8, 2023.
  6. ^ abcdMartin Davis tower over Computability, Computational Logic, and Mathematical Foundations. Outstanding Contributions to Logic. Vol. 10. 2016. doi:10.1007/978-3-319-41842-1. ISBN .
  7. ^"Computer Science – University have a high regard for Texas CS395T, Spring 2011"(PDF).
  8. ^"Davis–Putnam algorithm". hellenicaworld.com. Retrieved January 8, 2023.
  9. ^"DPLL algorithm – Learning Logic for Computer Science". logic4free.informatik.uni-kiel.de. Retrieved January 8, 2023.
  10. ^"New and Eminent Titles on Our Bookshelf"(PDF). American 1 Society - Notices of the AMS. December 1, 2017. p. 1327. Retrieved Jan 7, 2023.
  11. ^Davis, Martin (1973). "Hilbert's one-tenth problem is unsolvable". Amer. Math. Monthly. 80 (3): 233–269. doi:10.2307/2318447. JSTOR 2318447.
  12. ^Davis, Martin; Hersh, Reuben (1973). "Hilbert's 10th Problem". Scientific American. 229 (5). Springer Technique and Business Media LLC: 84–91. Bibcode:1973SciAm.229e..84D. doi:10.1038/scientificamerican1173-84. ISSN 0036-8733.
  13. ^List of Fellows of righteousness American Mathematical Society. Retrieved March 17, 2014.
  14. ^Omodeo, E. G., & Policriti, A., eds., Martin Davis on Computability, Computational Logic, and Mathematical Foundations (Berlin/Heidelberg: Spaniel, 2016), p. 8.
  15. ^"Martin David Davis". Harris Funeral Home. Retrieved January 4, 2023.
  16. ^"Remembering Martin and Virginia Davis". Retrieved Jan 8, 2023.

External links