Outline of a Mathematical Theory of Computation
E755395
Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Outline of a Mathematical Theory of Computation canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T8751936 — 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: Outline of a Mathematical Theory of Computation Context triple: [Dana Scott, notableWork, Outline of a Mathematical Theory of Computation]
-
A.
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.
-
B.
Elements of the Theory of Computation
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.
-
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.
Blum–Shub–Smale model of computation
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
-
E.
The Calculus of Computation
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
- 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: Outline of a Mathematical Theory of Computation Target entity description: Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
-
A.
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.
-
B.
Elements of the Theory of Computation
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.
-
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.
Blum–Shub–Smale model of computation
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
-
E.
The Calculus of Computation
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
academic paper
ⓘ
foundational work in theoretical computer science ⓘ |
| author | Dana Scott ⓘ |
| contributedTo |
denotational semantics
ⓘ
domain theory ⓘ formalization of program meaning ⓘ mathematical treatment of recursive definitions ⓘ theoretical foundations of computer science ⓘ |
| field |
mathematical logic
ⓘ
semantics of programming languages ⓘ theoretical computer science ⓘ |
| hasAuthorAward | Turing Award (for Dana Scott, partly for this line of work) ⓘ |
| hasKeyIdea |
interpretation of programs as mathematical functions
ⓘ
mathematical semantics independent of operational details ⓘ use of domains to model partial information ⓘ use of least fixed points to model recursion ⓘ |
| influenced |
development of denotational semantics
ⓘ
development of domain theory ⓘ formal methods in computer science ⓘ semantics of programming languages research ⓘ |
| influencedBy |
fixed point theorems
ⓘ
lambda calculus ⓘ mathematical logic ⓘ order theory ⓘ |
| language | English ⓘ |
| proposes |
denotational models of programming languages
ⓘ
mathematical models for programs ⓘ |
| recognizedAs |
classic in semantics of programming languages
ⓘ
foundational text for domain theory ⓘ |
| relatedTo |
computability theory
ⓘ
denotational semantics of programming languages ⓘ formal semantics ⓘ mathematical models of computation ⓘ |
| topic |
domains as models of computation
ⓘ
mathematical theory of computation ⓘ ordered structures for semantics ⓘ semantics of computation ⓘ |
| usesConcept |
complete partial orders
ⓘ
continuous functions on domains ⓘ fixed point theory ⓘ lattices ⓘ least fixed points ⓘ partially ordered sets ⓘ |
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: Outline of a Mathematical Theory of Computation Description of subject: Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.