Introduction to the Theory of Computation
E32458
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
All labels observed (4)
How this entity was disambiguated
This entity first appeared as the object of triple T249053 — 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: Introduction to the Theory of Computation Context triple: [Addison-Wesley, hasPublished, Introduction to the Theory of Computation]
-
A.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
D.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
E.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
- 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: Introduction to the Theory of Computation Target entity description: Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
A.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
D.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
E.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
textbook ⓘ |
| author | Michael Sipser ⓘ |
| country |
United States of America
ⓘ
surface form:
United States
|
| emphasizes |
mathematical rigor
ⓘ
proof techniques ⓘ |
| field | theoretical computer science ⓘ |
| format |
digital
ⓘ
print ⓘ |
| genre | academic textbook ⓘ |
| hasEdition |
first edition
ⓘ
second edition ⓘ third edition ⓘ |
| hasExercise |
algorithmic problems
ⓘ
proof-based problems ⓘ |
| hasSection |
Automata and Languages
ⓘ
Complexity Theory ⓘ Computability Theory ⓘ |
| intendedAudience |
computer science students
ⓘ
instructors in theoretical computer science ⓘ |
| language | English ⓘ |
| notableFor | clear exposition of automata and complexity ⓘ |
| publisher |
Cengage Learning
ⓘ
Thomson Course Technology ⓘ |
| relatedTo |
Computational Complexity: A Conceptual Perspective
ⓘ
surface form:
Computational Complexity (book)
Introduction to the Theory of Computation self-linksurface differs ⓘ
surface form:
Introduction to Automata Theory, Languages, and Computation
|
| subject |
computer science
ⓘ
mathematics ⓘ |
| topic |
NP-completeness
ⓘ
Turing machine ⓘ
surface form:
Turing machines
automata theory ⓘ complexity theory ⓘ computability theory ⓘ computational models ⓘ context-free languages ⓘ decidability ⓘ finite automata ⓘ formal languages ⓘ pushdown automata ⓘ reduction ⓘ regular languages ⓘ space complexity ⓘ time complexity ⓘ |
| usedAs | university textbook ⓘ |
| usedFor | preparation for advanced theory courses ⓘ |
| usedIn |
graduate courses
ⓘ
undergraduate courses ⓘ |
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: Introduction to the Theory of Computation Description of subject: Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
textbook Introduction to the Theory of Computation
Introduction to the Theory of Computation
→
relatedTo
→
Introduction to the Theory of Computation
self-linksurface differs
ⓘ
this entity surface form:
Introduction to Automata Theory, Languages, and Computation
this entity surface form:
Sipser: Introduction to the Theory of Computation