Skip to product information
Recursion Theory and Computational Complexity
  • Recursion Theory and Computational Complexity
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

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

$44.96 $49.95

Reliable shipping

Flexible returns

C.I.M.E. Summer Schools

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

G. Lolli

Mathematics / Logic

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.

Publication Date: 30 November 2010
Publisher: Springer Berlin Heidelberg
Imprint: Springer
ISBN-13: 9783642110719
Format: Paperback softback
Page Count: 236

You may also like