Recursion Theory and Computational Complexity Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979

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...

Full description

Bibliographic Details

Other Authors:	Lolli, G. (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg Springer Berlin Heidelberg 2011, 2011
Edition:	1st ed. 2011
Series:	C.I.M.E. Summer Schools
Subjects:	Mathematical Logic Mathematical Logic And Foundations
Online Access:	https://doi.org/10.1007/978-3-642-11072-6?nosfx=y
Collection:	Springer eBooks 2005- - Collection details see MPG.ReNa