# Martin Davis

> American mathematician (1928–2023)

**Wikidata**: [Q1239172](https://www.wikidata.org/wiki/Q1239172)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Martin_Davis_(mathematician))  
**Source**: https://4ort.xyz/entity/martin-davis

## Summary
Martin Davis was an American mathematician and computer scientist best known for his foundational work in computability theory and contributions to Hilbert's tenth problem. His research laid the groundwork for modern theoretical computer science, particularly in algorithmic logic and recursive function theory.

## Biography
- **Born**: March 8, 1928, in New York City, United States
- **Died**: January 1, 2023, in Berkeley, California, United States
- **Nationality**: American
- **Education**:
  - Ph.D. in Mathematics, Princeton University (1950)
  - B.S., City College of New York (1948)
  - Attended Bronx High School of Science (1940–1944)
- **Known for**: Pioneering work in computability theory, Hilbert's tenth problem, and the Davis–Putnam algorithm
- **Employer(s)**:
  - New York University (1959–1960, 1965–1996)
  - Institute for Advanced Study (1952–1954)
  - University of Illinois Urbana–Champaign (1950–1952)
  - University of California, Davis (1954–1955)
  - Yeshiva University (1960–1965)
- **Field(s)**: Mathematics, Computer Science, Computability Theory

## Contributions
Martin Davis made seminal contributions to computability theory and mathematical logic. His 1950 Ph.D. thesis, *On the Theory of Recursive Unsolvability*, introduced key concepts in recursive function theory. In 1958, he published *Computability & Unsolvability*, a foundational text in the field. Davis co-developed the **Davis–Putnam algorithm** (1960), a precursor to the DPLL algorithm, which became a cornerstone of automated theorem proving and satisfiability solvers. His work on **Hilbert's tenth problem** (1970) demonstrated the unsolvability of Diophantine equations, resolving a long-standing mathematical challenge. Davis also mentored influential computer scientists, including Donald W. Loveland and Moshe Koppel, shaping the next generation of researchers in logic and computation.

## FAQs
### Q: What is Martin Davis best known for?
A: Martin Davis is best known for his work in computability theory, particularly his contributions to Hilbert's tenth problem and the development of the Davis–Putnam algorithm, which is fundamental in automated reasoning.

### Q: Where did Martin Davis teach?
A: Davis held academic positions at New York University, Yeshiva University, the Institute for Advanced Study, and the University of Illinois Urbana–Champaign, among others.

### Q: What awards did Martin Davis receive?
A: He received numerous honors, including the **Leroy P. Steele Prize** (1975), **Chauvenet Prize** (1975), **Guggenheim Fellowship** (1983), and **Herbrand Award** (2005). He was also a Fellow of the American Mathematical Society.

### Q: What is the Davis–Putnam algorithm?
A: The Davis–Putnam algorithm (1960) is a method for determining the satisfiability of propositional logic formulas, laying the groundwork for modern SAT solvers used in computer science and artificial intelligence.

### Q: How did Martin Davis contribute to Hilbert's tenth problem?
A: Davis proved that Hilbert's tenth problem—the question of whether there exists an algorithm to solve all Diophantine equations—is unsolvable, a landmark result in mathematical logic.

## Why They Matter
Martin Davis's work bridged mathematics and computer science, establishing foundational results in computability and logic. His resolution of Hilbert's tenth problem demonstrated the limits of algorithmic decision-making, influencing both pure mathematics and theoretical computer science. The Davis–Putnam algorithm revolutionized automated theorem proving, enabling advancements in AI, verification systems, and constraint satisfaction. As a mentor, he shaped the careers of prominent computer scientists, ensuring his legacy in academia. Without his contributions, key areas of algorithmic logic and computational complexity might have developed far more slowly.

## Notable For
- **Davis–Putnam algorithm** (1960), a precursor to modern SAT solvers.
- **Resolution of Hilbert's tenth problem** (1970), proving the unsolvability of Diophantine equations.
- **Author of *Computability & Unsolvability*** (1958), a seminal textbook in computability theory.
- **Recipient of the Leroy P. Steele Prize** (1975) and **Chauvenet Prize** (1975).
- **Doctoral advisor** to influential computer scientists, including Donald W. Loveland and Moshe Koppel.

## Body
### Early Life and Education
Martin David Davis was born on March 8, 1928, in New York City. He attended the Bronx High School of Science (1940–1944) and earned his bachelor's degree from the City College of New York in 1948. He completed his Ph.D. in mathematics at Princeton University in 1950 under the supervision of Alonzo Church, with a dissertation titled *On the Theory of Recursive Unsolvability*.

### Academic Career
Davis held positions at multiple institutions:
- **University of Illinois Urbana–Champaign** (1950–1952)
- **Institute for Advanced Study** (1952–1954)
- **University of California, Davis** (1954–1955)
- **New York University** (1959–1960, 1965–1996)
- **Yeshiva University** (1960–1965)

### Key Contributions
- **Computability Theory**: Davis's 1958 book *Computability & Unsolvability* became a standard reference, formalizing concepts like recursive functions and Turing degrees.
- **Davis–Putnam Algorithm**: Developed with Hilary Putnam in 1960, this algorithm for propositional satisfiability (SAT) was later extended into the DPLL algorithm, widely used in AI and verification.
- **Hilbert's Tenth Problem**: In collaboration with Yuri Matiyasevich, Julia Robinson, and Hilary Putnam, Davis proved in 1970 that no algorithm exists to solve all Diophantine equations, resolving a problem posed by David Hilbert in 1900.
- **Mentorship**: Supervised Ph.D. students who became leaders in computer science, including Donald W. Loveland (1964) and Moshe Koppel (1980).

### Awards and Honors
- **Leroy P. Steele Prize** (1975) for seminal contributions to research.
- **Chauvenet Prize** (1975) for mathematical exposition.
- **Guggenheim Fellowship** (1983) in computer science.
- **Herbrand Award** (2005) for contributions to automated reasoning.
- **Fellow of the American Mathematical Society** (2013).

### Later Life and Legacy
Davis retired from NYU in 1996 but remained active in research and writing. He passed away on January 1, 2023, in Berkeley, California, leaving a lasting impact on mathematics and computer science.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Martin Davis",
  "alternateName": ["Martin D. Davis", "Martin David Davis"],
  "jobTitle": "Mathematician",
  "worksFor": [
    {
      "@type": "Organization",
      "name": "New York University"
    },
    {
      "@type": "Organization",
      "name": "Institute for Advanced Study"
    }
  ],
  "nationality": {
    "@type": "Country",
    "name": "United States"
  },
  "birthDate": "1928-03-08",
  "birthPlace": "New York City, United States",
  "deathDate": "2023-01-01",
  "deathPlace": "Berkeley, California, United States",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "Princeton University"
    },
    {
      "@type": "EducationalOrganization",
      "name": "City College of New York"
    }
  ],
  "knowsAbout": ["Computability Theory", "Mathematical Logic", "Hilbert's Tenth Problem"],
  "award": [
    "Leroy P. Steele Prize",
    "Chauvenet Prize",
    "Guggenheim Fellowship",
    "Herbrand Award"
  ],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q13219454",
    "https://en.wikipedia.org/wiki/Martin_Davis_(mathematician)"
  ],
  "description": "American mathematician and computer scientist known for his work in computability theory and Hilbert's tenth problem."
}
```

## References

1. BnF authorities
2. Integrated Authority File
3. MacTutor History of Mathematics archive
4. Czech National Authority Database
5. [Source](https://www.ias.edu/scholars/martin-d-davis)
6. [Source](https://www.legacy.com/us/obituaries/name/martin-davis-obituary?id=38544823)
7. [Source](https://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=28)
8. Guggenheim Fellows database
9. [Source](http://www.ams.org/fellows_by_year.cgi?year=2013)
10. [Source](http://www.ams.org/news?news_id=1680)
11. Mathematics Genealogy Project
12. International Standard Name Identifier
13. Virtual International Authority File
14. CiNii Research
15. [Martin David Davis](https://www.harrisfuneralhomeberkeley.com/obituaries/Martin-Davis-6/#!/TributeWall)
16. Freebase Data Dumps. 2013
17. [BnF authorities](http://data.bnf.fr/ark:/12148/cb12298096f)
18. CONOR.SI
19. National Library of Israel Names and Subjects Authority File
20. Catalogo of the National Library of India