Power Search
Low Price Guarantee
We Take School POs
A Recursive Introduction to the Theory of Computation Softcover Repri Edition
Contributor(s): Smith, Carl (Author)

View larger image

 ISBN: 1461264200     ISBN-13: 9781461264200
Publisher: Springer
OUR PRICE: $52.24  

Binding Type: Paperback - See All Available Formats & Editions
Published: November 2012
Qty:

Click for more in this series: Texts in Computer Science
Additional Information
BISAC Categories:
- Mathematics | Logic
- Mathematics | Discrete Mathematics
- Gardening
Dewey: 511.35
Series: Texts in Computer Science
Physical Information: 0.34" H x 6" W x 9" L (0.49 lbs) 148 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!