LIBERO WebOPAC Catalogue Display (W561)

Catalogue Information
Field name	Details
Dewey Class	511.3 (DDC 23)
Title	Recursion Theory and Computational Complexity (EB) / edited by G. Lolli.
Author	Lolli, Gabriele
Other name(s)	SpringerLink (Online service)
Edition statement	Reprint of the 1st ed. CIME ed. Liguori, Napoli & Birkhäuser, 1981
Publication	Berlin, Heidelberg : Springer, , 2011.
Physical Details	236 p., 6 illus. : online resource.
Series	CIME summer schools ; 79
ISBN	9783642110726
Summary Note	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.:
Contents note	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.
System details note	Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site	http://dx.doi.org/10.1007/978-3-642-11072-6
Links to Related Works	Subject References: Logic, Symbolic and mathematical . Mathematical Logic and Foundations . Mathematics . Authors: Lolli, Gabriele . Corporate Authors: SpringerLink (Online service) . Series: CIME summer schools . Classification: 511.3 (DDC 23) .

Catalogue Display

Recursion Theory and Computational Complexity

Reviews