A Recursive Introduction to the Theory of Computation

  • Carl H. Smith

Part of the Graduate Texts in Computer Science book series (TCS)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Carl H. Smith
    Pages 1-2
  3. Carl H. Smith
    Pages 3-30
  4. Carl H. Smith
    Pages 31-67
  5. Carl H. Smith
    Pages 68-90
  6. Carl H. Smith
    Pages 91-124
  7. Back Matter
    Pages 125-148

About this book

Introduction

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.

Keywords

algorithms complexity complexity theory mathematics models of computation

Authors and affiliations

  • Carl H. Smith
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandCollege ParkUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-8501-9
  • Copyright Information Springer-Verlag New York, Inc. 1994
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-6420-0
  • Online ISBN 978-1-4419-8501-9
  • Series Print ISSN 1868-0941
  • Series Online ISSN 1868-095X
  • About this book