Computability - A Mathematical Sketchbook (Hardcover, 1994 ed.)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Graduate Texts in Mathematics, 146
Release date:	1994
First published:	1994
Authors:	Douglas S. Bridges
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Hardcover
Pages:	180
Edition:	1994 ed.
ISBN-13:	978-0-387-94174-5
Categories:	Books > Science & Mathematics > Mathematics > General Books > Computing & IT > General theory of computing > Mathematical theory of computation
LSN:	0-387-94174-6
Barcode:	9780387941745

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!