Skip to main content
SpringerLink
Log in

Computability

A Mathematical Sketchbook

  • Textbook
  • © 1994

Overview

Authors:
  1. Douglas S. Bridges

    1. Department of Mathematics, University of Waikato, Hamilton, New Zealand

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 84.95
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Preliminaries

    • Douglas S. Bridges
    Pages 1-4

  3. What Is a Turing Machine?

    • Douglas S. Bridges
    Pages 5-17

  4. Computable Partial Functions

    • Douglas S. Bridges
    Pages 19-33

  5. Effective Enumerations

    • Douglas S. Bridges
    Pages 35-45

  6. Computable Numbers and Functions

    • Douglas S. Bridges
    Pages 47-74

  7. Rice’s Theorem and the Recursion Theorem

    • Douglas S. Bridges
    Pages 75-91

  8. Abstract Complexity Theory

    • Douglas S. Bridges
    Pages 93-115

  9. Back Matter

    Pages 117-180
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Mathematics, University of Waikato, Hamilton, New Zealand

    Douglas S. Bridges

Bibliographic Information

  • Book Title: Computability

  • Book Subtitle: A Mathematical Sketchbook

  • Authors: Douglas S. Bridges

  • Series Title: Graduate Texts in Mathematics

  • DOI: https://doi.org/10.1007/978-1-4612-0863-1

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1994

  • Hardcover ISBN: 978-0-387-94174-5Published: 14 January 1994

  • Softcover ISBN: 978-1-4612-6925-0Published: 13 July 2013

  • eBook ISBN: 978-1-4612-0863-1Published: 06 December 2012

  • Series ISSN: 0072-5285

  • Series E-ISSN: 2197-5612

  • Edition Number: 1

  • Number of Pages: XI, 180

  • Topics: Mathematics, general

Publish with us

Policies and ethics

Back to top

Search

Navigation