Michael Sipser
E22252
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Michael Sipser canonical | 5 |
How this entity was disambiguated
This entity first appeared as the object of triple T143818 — 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.
Target entity: Michael Sipser Context triple: [Shafi Goldwasser, coAuthor, Michael Sipser]
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
C.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
D.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
E.
Ronald L. Rivest
Ronald L. Rivest is an American cryptographer and computer scientist best known as one of the co-inventors of the RSA public-key cryptosystem and a pioneer in modern cryptography.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Michael Sipser Target entity description: Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
C.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
D.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
E.
Ronald L. Rivest
Ronald L. Rivest is an American cryptographer and computer scientist best known as one of the co-inventors of the RSA public-key cryptosystem and a pioneer in modern cryptography.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
American
ⓘ
book ⓘ computer scientist ⓘ person ⓘ textbook ⓘ theoretical computer scientist ⓘ |
| academicDiscipline |
computer science
ⓘ
mathematics ⓘ |
| almaMater |
Cornell University
ⓘ
University of California, Berkeley ⓘ |
| author | Michael Sipser self-linksurface differs ⓘ |
| basedIn | Cambridge, Massachusetts ⓘ |
| citizenship | United States of America ⓘ |
| doctoralAdvisor | Richard Karp ⓘ |
| educatedAt |
Cornell University
ⓘ
University of California, Berkeley ⓘ |
| employer | Massachusetts Institute of Technology ⓘ |
| field |
automata theory
ⓘ
computability theory ⓘ computational complexity theory ⓘ theoretical computer science ⓘ |
| fieldOfWork |
complexity classes
ⓘ
proof systems in complexity theory ⓘ randomized computation ⓘ |
| genre |
computer science textbook
ⓘ
textbook ⓘ |
| hasRole |
educator
ⓘ
researcher ⓘ |
| hasWritten | Introduction to the Theory of Computation ⓘ |
| knownFor |
Introduction to the Theory of Computation
ⓘ
surface form:
textbook Introduction to the Theory of Computation
work in computational complexity theory ⓘ |
| languageOfWorkOrName | English ⓘ |
| mainSubject |
automata theory
ⓘ
computability theory ⓘ computational complexity theory ⓘ theory of computation ⓘ |
| nationality | American ⓘ |
| notableIdea |
results in circuit complexity
ⓘ
results in interactive proof systems ⓘ |
| notableWork | Introduction to the Theory of Computation ⓘ |
| occupation | professor ⓘ |
| positionHeld |
Dean of the School of Science at MIT
ⓘ
Head of the MIT Department of Mathematics ⓘ |
| workInstitution | Massachusetts Institute of Technology ⓘ |
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.
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.
Subject: Michael Sipser Description of subject: Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.