Lolli, G.
Recursion Theory and Computational Complexity
Table of contents
1. Admissible Recursion Theory
Steve Homer
2. Computational Complexity and Recursion Theory
Barry E. Jacobs
3. A Survey of Set Recursion
Dag Normann
4. Priority Arguments in Higher Recursion Theory
Gerald E. Sacks
5. Constructions in the Recursively Enumerable Degrees
Robert I. Soare
6. Recursively Invariant -Recursion Theory
Wolfgang Maass
Keywords: Mathematics, Mathematical Logic and Foundations
- Author(s)
- Lolli, G.
- Publisher
- Springer
- Publication year
- 2011
- Language
- en
- Edition
- 1
- Series
- C.I.M.E. Summer Schools
- Page amount
- 3 pages
- Category
- Natural Sciences
- Format
- Ebook
- eISBN (PDF)
- 9783642110726