Foundations of Computer Science
E566632
Foundations of Computer Science is a widely used introductory textbook that presents the fundamental concepts and theoretical underpinnings of computer science, including algorithms, data structures, automata, and complexity.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Foundations of Computer Science canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6082254 — 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: Foundations of Computer Science Context triple: [Jeffrey D. Ullman, notableWork, Foundations of Computer Science]
-
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.
The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
-
C.
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.
-
D.
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
E.
Computing as a Discipline
"Computing as a Discipline" is a seminal 1989 paper by Peter J. Denning that systematically defined the intellectual structure and core subfields of computer science as an academic discipline.
- 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: Foundations of Computer Science Target entity description: Foundations of Computer Science is a widely used introductory textbook that presents the fundamental concepts and theoretical underpinnings of computer science, including algorithms, data structures, automata, 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.
The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
-
C.
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.
-
D.
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
E.
Computing as a Discipline
"Computing as a Discipline" is a seminal 1989 paper by Peter J. Denning that systematically defined the intellectual structure and core subfields of computer science as an academic discipline.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
introductory computer science textbook
ⓘ
textbook ⓘ |
| coversTopic |
NP-completeness
ⓘ
Turing machines ⓘ
linked to:
Turing machine
abstract data types ⓘ algorithm analysis ⓘ algorithms ⓘ asymptotic notation ⓘ automata theory ⓘ basic data types ⓘ combinatorics ⓘ computability ⓘ computational complexity ⓘ context-free languages ⓘ data structures ⓘ discrete mathematics ⓘ finite automata ⓘ formal languages ⓘ graph algorithms ⓘ graph theory ⓘ induction ⓘ logic ⓘ proof techniques ⓘ recursion ⓘ regular languages ⓘ searching algorithms ⓘ sorting algorithms ⓘ space complexity ⓘ time complexity ⓘ undecidability ⓘ |
| educationalLevel | undergraduate ⓘ |
| field | computer science ⓘ |
| goal |
to explain theoretical underpinnings of computing
ⓘ
to present fundamental concepts of computer science ⓘ |
| hasCharacteristic |
introductory level
ⓘ
mathematically rigorous ⓘ theoretical focus ⓘ |
| intendedAudience |
computer science students
ⓘ
introductory algorithms students ⓘ |
| intendedUse |
self-study resource
ⓘ
university course textbook ⓘ |
| medium |
digital
ⓘ
print ⓘ |
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: Foundations of Computer Science Description of subject: Foundations of Computer Science is a widely used introductory textbook that presents the fundamental concepts and theoretical underpinnings of computer science, including algorithms, data structures, automata, and complexity.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.