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 |
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 ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.