Description

Book Synopsis


Trade Review
This is only a 200 page book, but it covers a wealth of material...[A] clear, concise introduction that would be ideal for a one-term undergraduate course...Recommended." - CHOICE

"This short text does an excellent job of covering those topics that should be included in an undergraduate introduction to computability theory... There are both appropriate exercises and enticing doorways to open topics and current research. The exposition is precise, but still conversational. I believe my students will enjoy reading this text." - Jeffry L. Hirst, Zentralblatt MATH

Table of Contents
  • Introduction
  • Background
  • Defining computability
  • Working with computable functions
  • Computing and enumerating sets
  • Turing reduction and Post’s problem
  • Two hierarchies of sets
  • Further tools and results
  • Areas of research
  • Mathematical asides
  • Bibliography
  • Index

Computability Theory

    Product form

    £46.80

    Includes FREE delivery

    RRP £52.00 – you save £5.20 (10%)

    Order before 4pm tomorrow for delivery by Mon 10 Aug 2026.

    A Paperback by Rebecca Weber

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Computability Theory by Rebecca Weber

      Publisher: MP-AMM American Mathematical
      Publication Date: Publication Date: 6/30/2012 12:00:00 AM
      ISBN13: 9780821873922, 978-0821873922
      ISBN10: 082187392X
      Also in:
      Not Just Books Stationery

      Description

      Book Synopsis


      Trade Review
      This is only a 200 page book, but it covers a wealth of material...[A] clear, concise introduction that would be ideal for a one-term undergraduate course...Recommended." - CHOICE

      "This short text does an excellent job of covering those topics that should be included in an undergraduate introduction to computability theory... There are both appropriate exercises and enticing doorways to open topics and current research. The exposition is precise, but still conversational. I believe my students will enjoy reading this text." - Jeffry L. Hirst, Zentralblatt MATH

      Table of Contents
      • Introduction
      • Background
      • Defining computability
      • Working with computable functions
      • Computing and enumerating sets
      • Turing reduction and Post’s problem
      • Two hierarchies of sets
      • Further tools and results
      • Areas of research
      • Mathematical asides
      • Bibliography
      • Index

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account