Martin Davis
E46731
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Martin Davis canonical | 16 |
How this entity was disambiguated
This entity first appeared as the object of triple T364391 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Martin Davis Context triple: [Herbrand Award, notableRecipient, Martin Davis]
-
A.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
B.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
-
C.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
William H. Press
William H. Press is an American astrophysicist and computational scientist known for his influential work in numerical analysis, cosmology, and science policy, including co-authoring the widely used textbook "Numerical Recipes."
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Martin Davis Target entity description: Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
A.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
B.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
-
C.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
William H. Press
William H. Press is an American astrophysicist and computational scientist known for his influential work in numerical analysis, cosmology, and science policy, including co-authoring the widely used textbook "Numerical Recipes."
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
human ⓘ logician ⓘ mathematician ⓘ |
| academicAdvisor | Alonzo Church ⓘ |
| areaOfInfluence |
automated theorem proving
ⓘ
foundations of computer science ⓘ |
| awardReceived |
Chauvenet Prize
ⓘ
Herbrand Award ⓘ Leroy P. Steele Prize ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| educatedAt |
City College of New York
ⓘ
Princeton University ⓘ |
| employer |
New York University
ⓘ
surface form:
Courant Institute of Mathematical Sciences
New York University ⓘ |
| familyName | Davis ⓘ |
| fieldOfWork |
computability theory
ⓘ
decision problems ⓘ mathematical logic ⓘ mathematics ⓘ recursion theory ⓘ theoretical computer science ⓘ |
| genre | non-fiction ⓘ |
| givenName | Martin ⓘ |
| influencedBy |
Alan Turing
ⓘ
Alonzo Church ⓘ Kurt Gödel ⓘ |
| knownFor |
Davis–Putnam algorithm
ⓘ
Davis–Putnam algorithm ⓘ
surface form:
Davis–Putnam–Logemann–Loveland procedure
contributions to Hilbert's tenth problem ⓘ foundational work in computability theory ⓘ work on the Entscheidungsproblem ⓘ |
| languageOfWorkOrName | English ⓘ |
| memberOf |
American Mathematical Society
ⓘ
Association for Symbolic Logic ⓘ |
| notableWork |
Computability and Unsolvability
ⓘ
Davis–Putnam algorithm ⓘ Davis–Putnam algorithm ⓘ
surface form:
Davis–Putnam–Logemann–Loveland algorithm
Engines of Logic ⓘ The Undecidable ⓘ The Universal Computer ⓘ work on Hilbert's tenth problem ⓘ work on the Entscheidungsproblem ⓘ |
| occupation |
author
ⓘ
university teacher ⓘ |
| positionHeld | professor of mathematics ⓘ |
| sexOrGender | male ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Martin Davis Description of subject: Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
Referenced by (16)
Full triples — surface form annotated when it differs from this entity's canonical label.