Elements of the Theory of Computation
E677190
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Elements of the Theory of Computation canonical | 2 |
| Theory of Computation (textbook) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7617152 — 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: Elements of the Theory of Computation Context triple: [Harry Lewis, notableWork, Elements of the Theory of Computation]
-
A.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
B.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
C.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
D.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
E.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
- 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: Elements of the Theory of Computation Target entity description: Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
A.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
B.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
C.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
D.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
E.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
textbook ⓘ |
| academicDiscipline | theoretical computer science ⓘ |
| field |
computer science
ⓘ
mathematics ⓘ |
| focusesOn |
computational limits
ⓘ
formal models of computation ⓘ mathematical foundations of computing ⓘ |
| genre | academic textbook ⓘ |
| hasAuthor |
Christos H. Papadimitriou
NERFINISHED
ⓘ
Harry R. Lewis NERFINISHED ⓘ |
| hasForm | print book ⓘ |
| hasSubject |
NP-completeness
ⓘ
Turing machines NERFINISHED ⓘ automata theory ⓘ complexity theory ⓘ computability theory ⓘ context-free grammars ⓘ context-free languages ⓘ decidability ⓘ finite automata ⓘ formal languages ⓘ recursive functions ⓘ recursively enumerable sets ⓘ reducibility ⓘ regular languages ⓘ theory of computation ⓘ |
| hasTopic |
Church–Turing thesis
NERFINISHED
ⓘ
computational models ⓘ decision problems ⓘ induction proofs ⓘ proof techniques in computer science ⓘ pumping lemma NERFINISHED ⓘ space complexity ⓘ time complexity ⓘ |
| intendedAudience |
graduate students
ⓘ
undergraduate students ⓘ |
| language | English ⓘ |
| relatedTo |
Computational Complexity
NERFINISHED
ⓘ
Introduction to Automata Theory, Languages, and Computation NERFINISHED ⓘ |
| teaches |
analysis of algorithms at a theoretical level
ⓘ
design of automata ⓘ formal reasoning about computation ⓘ |
| usedAs | university course textbook ⓘ |
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: Elements of the Theory of Computation Description of subject: Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Theory of Computation (textbook)