Stephen Cook
E83179
Stephen Cook is a Canadian-American computer scientist renowned for founding the field of computational complexity theory, particularly through his seminal work on NP-completeness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Stephen Cook canonical | 7 |
How this entity was disambiguated
This entity first appeared as the object of triple T654101 — 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: Stephen Cook Context triple: [Grace Murray Hopper Award, notableRecipient, Stephen Cook]
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
Martin Davis
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.
-
C.
Donald Davies
Donald Davies was a British computer scientist who pioneered the concept of packet switching, a foundational technology for modern computer networks and the internet.
-
D.
Alan Emtage
Alan Emtage is a computer scientist best known for creating Archie, the first widely used Internet search engine, which laid foundational groundwork for modern web search.
-
E.
Tom Kibble
Tom Kibble was a British theoretical physicist renowned for his pioneering work on spontaneous symmetry breaking and the Higgs mechanism in particle physics.
- 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: Stephen Cook Target entity description: Stephen Cook is a Canadian-American computer scientist renowned for founding the field of computational complexity theory, particularly through his seminal work on NP-completeness.
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
Martin Davis
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.
-
C.
Donald Davies
Donald Davies was a British computer scientist who pioneered the concept of packet switching, a foundational technology for modern computer networks and the internet.
-
D.
Alan Emtage
Alan Emtage is a computer scientist best known for creating Archie, the first widely used Internet search engine, which laid foundational groundwork for modern web search.
-
E.
Tom Kibble
Tom Kibble was a British theoretical physicist renowned for his pioneering work on spontaneous symmetry breaking and the Higgs mechanism in particle physics.
- F. None of above. chosen
Statements (56)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
person ⓘ theoretical computer scientist ⓘ |
| academicDegree |
Bachelor of Science in Physics
ⓘ
Master of Science in Computer and Communication Sciences ⓘ PhD in Mathematics ⓘ |
| academicTitle | University Professor ⓘ |
| ACMFellow | true ⓘ |
| almaMater |
Harvard University
ⓘ
University of Michigan ⓘ |
| awardReceived |
BBVA Foundation Frontiers of Knowledge Award
ⓘ
surface form:
BBVA Foundation Frontiers of Knowledge Award in Information and Communication Technologies
CAP-CRM Prize in Theoretical and Mathematical Physics ⓘ CRM-Fields-PIMS Prize ⓘ EATCS Award ⓘ Gerhard Herzberg Canada Gold Medal for Science and Engineering ⓘ Guggenheim Fellowship ⓘ John L. Synge Award ⓘ Killam Prize ⓘ Natural Sciences and Engineering Research Council of Canada ⓘ
surface form:
NSERC Steacie Fellowship
Order of Canada ⓘ Fellow of the Royal Society (FRS) ⓘ
surface form:
Royal Society (London) fellowship
Royal Society of Canada Fellowship ⓘ
surface form:
Royal Society of Canada fellowship
Turing Award ⓘ |
| birthDate | 1939-12-14 ⓘ |
| birthPlace |
Buffalo
ⓘ
surface form:
Buffalo, New York, United States
|
| birthYear | 1939 ⓘ |
| citizenship |
Canada
ⓘ
United States of America ⓘ |
| contributedTo |
complexity theory foundations
ⓘ
definition of NP-complete problems ⓘ formalization of NP-completeness ⓘ |
| doctoralAdvisor | Hao Wang ⓘ |
| employer | University of Toronto ⓘ |
| familyName | Cook ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computer science ⓘ theoretical computer science ⓘ |
| givenName | Stephen ⓘ |
| influenced |
development of modern complexity theory
ⓘ
research on the P versus NP problem ⓘ |
| knownFor |
NP-completeness
ⓘ
surface form:
Cook–Levin theorem
NP-completeness ⓘ P versus NP problem ⓘ foundational work in computational complexity theory ⓘ |
| memberOf |
Association for Computing Machinery
ⓘ
Canadian Mathematical Society ⓘ Royal Society ⓘ Royal Society of Canada ⓘ |
| name | Stephen Cook self-link ⓘ |
| nationality | Canadian-American ⓘ |
| notableWork | "The Complexity of Theorem-Proving Procedures" ⓘ |
| positionHeld |
Professor of Computer Science at the University of Toronto
ⓘ
Professor of Mathematics at the University of Toronto ⓘ |
| publicationYear | 1971 paper "The Complexity of Theorem-Proving Procedures" ⓘ |
| workInstitution |
University of Toronto Department of Computer Science
ⓘ
University of Toronto Department of Mathematics ⓘ |
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: Stephen Cook Description of subject: Stephen Cook is a Canadian-American computer scientist renowned for founding the field of computational complexity theory, particularly through his seminal work on NP-completeness.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
The Complexity of Theorem-Proving Procedures