Advertisement

Recursion Theory and Computational Complexity

  • Editors
  • G.┬áLolli

Part of the C.I.M.E. Summer Schools book series (CIME, volume 79)

Table of contents

  1. Front Matter
    Pages i-iii
  2. Steve Homer
    Pages 5-28
  3. Barry E. Jacobs
    Pages 29-98
  4. Dag Normann
    Pages 99-106
  5. Gerald E. Sacks
    Pages 107-168
  6. Wolfgang Maass
    Pages 227-240

About this book

Introduction

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.

Bibliographic information