Theory of Recursive Functions and Effective Computability
E943474
Theory of Recursive Functions and Effective Computability is a foundational 1957 textbook that systematically develops the theory of computable functions and formalizes the mathematical notion of effective computability.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Theory of Recursive Functions and Effective Computability canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11736267 — 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: Theory of Recursive Functions and Effective Computability Context triple: [Barkley Rosser, notableWork, Theory of Recursive Functions and Effective Computability]
-
A.
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.
-
B.
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.
-
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.
Introduction to Metamathematics
Introduction to Metamathematics is a classic 1952 textbook by Stephen Kleene that systematically develops the foundations of mathematical logic and recursion theory.
-
E.
Outline of a Mathematical Theory of Computation
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.
- 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: Theory of Recursive Functions and Effective Computability Target entity description: Theory of Recursive Functions and Effective Computability is a foundational 1957 textbook that systematically develops the theory of computable functions and formalizes the mathematical notion of effective computability.
-
A.
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.
-
B.
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.
-
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.
Introduction to Metamathematics
Introduction to Metamathematics is a classic 1952 textbook by Stephen Kleene that systematically develops the foundations of mathematical logic and recursion theory.
-
E.
Outline of a Mathematical Theory of Computation
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.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
computer science textbook ⓘ mathematics textbook ⓘ textbook ⓘ |
| author | Hartley Rogers Jr. NERFINISHED ⓘ |
| contribution |
standard reference in computability theory
ⓘ
systematic development of recursion theory ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| describes | formalization of effective computability ⓘ |
| field |
computability theory
ⓘ
mathematical logic ⓘ recursion theory NERFINISHED ⓘ theoretical computer science ⓘ |
| hasSubject |
computer science
ⓘ
logic ⓘ mathematics ⓘ |
| influenced |
development of theoretical computer science
ⓘ
subsequent textbooks on computability ⓘ |
| language | English ⓘ |
| level |
advanced undergraduate
ⓘ
graduate ⓘ |
| publicationYear | 1957 ⓘ |
| publisher | McGraw-Hill NERFINISHED ⓘ |
| timePeriod | 20th century ⓘ |
| topic |
Church–Turing thesis
NERFINISHED
ⓘ
Gödel numbering ⓘ Turing computability NERFINISHED ⓘ Turing degrees NERFINISHED ⓘ arithmetical hierarchy ⓘ computable enumerability ⓘ computable functions ⓘ decision problems ⓘ degrees of unsolvability ⓘ effective computability ⓘ effective procedures ⓘ formal systems ⓘ lambda-definability ⓘ partial recursive functions ⓘ post correspondence problem ⓘ primitive recursive functions ⓘ recursive functions ⓘ recursive relations ⓘ recursive sets ⓘ recursively enumerable sets ⓘ undecidability ⓘ universal Turing machines ⓘ |
| usedAs | graduate-level 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: Theory of Recursive Functions and Effective Computability Description of subject: Theory of Recursive Functions and Effective Computability is a foundational 1957 textbook that systematically develops the theory of computable functions and formalizes the mathematical notion of effective computability.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.