Computability

  • Klaus Weihrauch

Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 9)

Table of contents

  1. Front Matter
    Pages I-X
  2. Prerequisites and Notation

    1. Klaus Weihrauch
      Pages 1-3
  3. Basic Concepts of Computability

    1. Front Matter
      Pages 4-4
    2. Klaus Weihrauch
      Pages 5-23
    3. Klaus Weihrauch
      Pages 24-41
    4. Klaus Weihrauch
      Pages 53-58
    5. Klaus Weihrauch
      Pages 59-69
    6. Klaus Weihrauch
      Pages 70-78
    7. Klaus Weihrauch
      Pages 93-102
    8. Klaus Weihrauch
      Pages 103-122
    9. Klaus Weihrauch
      Pages 123-136
  4. Type 1 Recursion Theory

    1. Front Matter
      Pages 137-137
    2. Klaus Weihrauch
      Pages 138-143
    3. Klaus Weihrauch
      Pages 144-158
    4. Klaus Weihrauch
      Pages 177-190
    5. Klaus Weihrauch
      Pages 191-204
    6. Klaus Weihrauch
      Pages 205-215

About this book

Keywords

Notation complexity computability computability theory computational complexity logic turing degree

Authors and affiliations

  • Klaus Weihrauch
    • 1
  1. 1.FB Mathematik und InformatikFern Universität HagenHagenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-69965-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1987
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-69967-2
  • Online ISBN 978-3-642-69965-8
  • Series Print ISSN 1431-2654
  • About this book