Computability Theory

Computability Theory

An Introduction to Recursion Theory, Students Solutions Manual (e-only)

1st Edition - May 3, 2011

Write a review

  • Author: Herbert Enderton
  • eBook ISBN: 9780123878366

Purchase options

Purchase options
DRM-free (Mobi, EPub, PDF)
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order

Description

Computability Theory:  An Introduction to Recursion Theory,  provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.  The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.  Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way.

Table of Contents

  • 1. The Computability Concept

    2. General Recursive Functions

    3. Programs and Machines

    4. Recursive Enumerability

    5. Connections to Logic

    6. Degrees of Unsolvability

    7. Polynomial-Time Computability

Product details

  • No. of pages: 21
  • Language: English
  • Copyright: © Academic Press 2011
  • Published: May 3, 2011
  • Imprint: Academic Press
  • eBook ISBN: 9780123878366

About the Author

Herbert Enderton

Affiliations and Expertise

University of California, Los Angeles, U.S.A.

Ratings and Reviews

Write a review

There are currently no reviews for "Computability Theory"