Mathematical Theory of Computation
E260369
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Mathematical Theory of Computation canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2384366 — 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: Mathematical Theory of Computation Context triple: [Zohar Manna, authorOf, Mathematical Theory of Computation]
-
A.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
B.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
C.
Mathematics and Computation
"Mathematics and Computation" is a book by Avi Wigderson that explores the deep connections between theoretical computer science and mathematics, emphasizing how computational complexity shapes modern mathematical thought.
-
D.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- 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: Mathematical Theory of Computation Target entity description: Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
A.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
B.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
C.
Mathematics and Computation
"Mathematics and Computation" is a book by Avi Wigderson that explores the deep connections between theoretical computer science and mathematics, emphasizing how computational complexity shapes modern mathematical thought.
-
D.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- F. None of above. chosen
Statements (36)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
textbook ⓘ theoretical computer science textbook ⓘ |
| approach |
axiomatic
ⓘ
mathematically rigorous ⓘ |
| author | Zvi Kohavi ⓘ |
| educationalUse |
course textbook
ⓘ
reference for theoretical computer science ⓘ |
| field |
computer science
ⓘ
mathematics ⓘ theoretical computer science ⓘ |
| focus |
mathematical foundations of computation
ⓘ
systematic development of formal models of computation ⓘ |
| genre | academic textbook ⓘ |
| hasFormat | print ⓘ |
| hasPart |
chapters on automata
ⓘ
chapters on complexity ⓘ chapters on computability ⓘ |
| intendedAudience |
advanced undergraduates
ⓘ
graduate students ⓘ researchers in theoretical computer science ⓘ |
| language | English ⓘ |
| subject |
complexity
ⓘ
computability ⓘ formal language theory ⓘ |
| topic |
Turing machines
ⓘ
linked to:
Turing machine
automata theory ⓘ computability theory ⓘ computational complexity theory ⓘ decidability ⓘ formal languages ⓘ formal models of computation ⓘ recursive functions ⓘ undecidability ⓘ |
| usedIn |
graduate courses in computer science theory
ⓘ
university courses in theory of computation ⓘ |
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: Mathematical Theory of Computation Description of subject: Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.