Computability

A Mathematical Sketchbook

  • Douglas S. Bridges

Part of the Graduate Texts in Mathematics book series (GTM, volume 146)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Douglas S. Bridges
    Pages 1-4
  3. Douglas S. Bridges
    Pages 5-17
  4. Douglas S. Bridges
    Pages 19-33
  5. Douglas S. Bridges
    Pages 35-45
  6. Douglas S. Bridges
    Pages 47-74
  7. Douglas S. Bridges
    Pages 75-91
  8. Douglas S. Bridges
    Pages 93-115
  9. Back Matter
    Pages 117-180

About this book

Introduction

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

Keywords

complexity computability function recursion theorem

Authors and affiliations

  • Douglas S. Bridges
    • 1
  1. 1.Department of MathematicsUniversity of WaikatoHamiltonNew Zealand

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-0863-1
  • Copyright Information Springer-Verlag New York, Inc. 1994
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-6925-0
  • Online ISBN 978-1-4612-0863-1
  • Series Print ISSN 0072-5285
  • About this book