Recursion Theory and Computational Complexity: Lectures Given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) Held in Bre

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.