Computability : A Mathematical Sketchbook

4 (1 rating by Goodreads)
By (author) 
4 (1 rating by Goodreads)
Free delivery worldwide Expected delivery to the United States in 9-12 business days.

Not ordering to the United States? Click here.
May not be delivered to the United States by Christmas May not be delivered to the United States by Christmas


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.
show more

Product details

  • Hardback | 180 pages
  • 155 x 235 x 18.03mm | 1,000g
  • New York, NY, United States
  • English
  • 1994 ed.
  • XI, 180 p.
  • 0387941746
  • 9780387941745

Back cover copy

Computability: A Mathematical Sketchbook is a concise, rigorous introduction to the theory of computation. Using Turing machines as models of computers, the author develops major themes of computability theory, culminating in a systematic account of Blum's abstract complexity measures. One of the book's unique aspects is the inclusion of a chapter on computable real numbers and elementary computable analysis. Exercises and solutions form an integral part of the material. The book is suitable for self-study and provides excellent course materials for senior and graduate-level students in mathematics and computer science.
show more

Table of contents

Preliminaries.- 1 What Is a Turing Machine?.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice's Theorem and the Recursion Theorem.- 6 Abstract Complexity Theory.- Solutions to Exercises.- Solutions for Chapter 1.- Solutions for Chapter 2.- Solutions for Chapter 3.- Solutions for Chapter 4.- Solutions for Chapter 5.- Solutions for Chapter 6.- References.
show more

Rating details

1 rating
4 out of 5 stars
5 0% (0)
4 100% (1)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X