Recursion Theory and Computational Complexity

• Corporate Author: SpringerLink (Online service)
• Other Authors: Lolli, G. (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011.
• Series: C.I.M.E. Summer Schools ; 79
• Subjects: Mathematics.; Mathematical logic.; Mathematical Logic and Foundations.

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursio...

Table of Contents:

• S. Homer: Admissible recursion theory
• B.E. Jacobs: Computational complexity and recursion theory
• D. Normann: A survey of set recursion
• G.E. Sacks: Priority arguments in Higgler recursion
• R.I. Soare: Construction in the recursively enumerable degrees
• W. Maass: Recursively invariant recursion theory.