Theories of Computability (Hardcover, New)

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	May 1997
First published:	1997
Authors:	Nicholas Pippenger
Dimensions:	229 x 152 x 19mm (L x W x T)
Format:	Hardcover
Pages:	264
Edition:	New
ISBN-13:	978-0-521-55380-3
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-55380-6
Barcode:	9780521553803

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!