Computability Theory: Introduction to Recursion Theory
Overview & Synopsis
Computability Theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Computability Theory: Introduction to Recursion Theory |
|---|---|
| Author / Organization | Karl-Heinz Zimmermann, Frank Stephan, Jaap van Oosten, Jeremy Avigad, et al |
| Subject & Discipline | Mathematical Logic - Computability, Set Theory, Model Theory, etc, Theory of Computation and Computing, Computational Complexity |
| Categories | Mathematical Logic - Computability, Set Theory, Model Theory, etc |
| Resource Verification | ✓ Verified Direct PDF Available |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Reported File Size | 0.9 KB (919 bytes) |
| Language | ENGLISH |
| Catalog ID | DOC-71812 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |