Research Catalog

Theory of recursive functions and effective computability.

Title
Theory of recursive functions and effective computability.
Author
Rogers, Hartley, Jr., 1926-2015
Publication
New York : McGraw-Hill, [1967]

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
How do I pick up this item and when will it be ready?
TextUse in library 8125.781Off-site

Details

Description
xix, 482 pages illustrations; 23 cm
Series Statement
McGraw-Hill series in higher mathematics
Uniform Title
McGraw-Hill series in higher mathematics
Subject
  • Recursive functions
  • Computable functions
  • Recursieve functies
  • RECURSIVE FUNCTIONS
  • Récursivité, Théorie de la
  • Fonctions calculables
  • Fonctions récursives
  • Algorithmes
Note
  • "A portion of the material ... appeared, in somewhat different order and form, as Theory of recursive functions and effective computability, volume I ... in 1957."
Bibliography (note)
  • Bibliography: p. 459-468.
Contents
1. Recursive functions -- 2. Unsolvable problems -- 3. Purposes: summary -- 4. Recursive invariance -- 5. Recursive and recursively enumerable sets -- 6. Reducibilities -- 7. One-one reducibility; many-one reducibility; creative sets -- 8. Truth-table reducibilities; simple sets -- 9. Turing reducibility; hypersimple sets -- 10. Post's problem; incomplete sets -- 11. The recursion theorem -- 12. Recursively enumerable sets as a lattice -- 13. Degrees of solvability -- 14. The arithmetical hierarchy (part 1) -- 15. The arithmetical hierarchy (part 2) -- 16. The analytical hierarchy.
LCCN
65025921
OCLC
  • ocm00527706
  • 527706
  • SCSB-213157
Owning Institutions
Princeton University Library