Recursion Theory and Computational Complexity: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in by G. LolliRecursion Theory and Computational Complexity: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in by G. Lolli

Recursion Theory and Computational Complexity: Lectures given at a Summer School of the Centro…

byG. Lolli

Paperback | November 30, 2010

Pricing and Purchase Info

$65.92 online 
$70.95 list price save 7%
Earn 330 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Recursion Theory and Computational Complexity: Lectures given at a Summer School of the Centro…Format:PaperbackDimensions:236 pagesPublished:November 30, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642110711

ISBN - 13:9783642110719

Reviews

Table of Contents

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.