Lolli G. (ed.) Recursion Theory and Computational Complexity

Springer, 1979. — 228 p.Lectures given at Centro Internazionale Matematico Estivo (C.I.M.E.), held in Bressanone (Bolzano), Italy, June 14-23, 1979.
The purpose of these lectures is to develop some deeper results in α-recursion theory which will hold in somewhat more general setting than L(α) and in particular in many other admissible sets and structures. In addition, I will briefly mention some applications to structures which arise from other areas of recursion theory and which are inadmissible.Admissible Recursion 'Iheory
Computational Complexity and recursion theory
A Survey of Set Recursion
Priority Arguments in Higgler Recursion
Constructions in the Recursively Enumerable Degrees
Recursively Invariant Recursion Theory