Recursion Theory and Computational Complexity (eBook, PDF)

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

• Format: PDF

Produktbeschreibung

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.

Produktdetails

• Verlag: Springer Berlin
• Erscheinungstermin: 17. Juni 2011
• Englisch
• ISBN-13: 9783642110726
• Artikelnr.: 44223344

Inhaltsangabe

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.