Computability: A Mathematical Sketchbook
Author:   Douglas S. Bridges
Publisher:   Springer-Verlag New York Inc.
Edition:   1994 ed.
Volume:   146
ISBN:  

9780387941745


Pages:   180
Publication Date:   14 January 1994
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $224.27 Quantity:  
Add to Cart

Share |

Computability: A Mathematical Sketchbook


Overview

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.

Full Product Details

Author:   Douglas S. Bridges
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   1994 ed.
Volume:   146
Dimensions:   Width: 15.50cm , Height: 1.20cm , Length: 23.50cm
Weight:   1.000kg
ISBN:  

9780387941745


ISBN 10:   0387941746
Pages:   180
Publication Date:   14 January 1994
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now