A Recursive Introduction to the Theory of Computation (Hardcover, 1994 ed.)

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Texts in Computer Science
Release date:	October 1994
First published:	1994
Authors:	Carl Smith
Dimensions:	229 x 152 x 12mm (L x W x T)
Format:	Hardcover
Pages:	148
Edition:	1994 ed.
ISBN-13:	978-0-387-94332-9
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	0-387-94332-3
Barcode:	9780387943329

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!