Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

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, PDF eBook

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 PDF

Edited by G. Lolli

Part of the C.I.M.E. Summer Schools series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Information