{
"item_title" : "A Recursive Introduction to the Theory of Computation",
"item_author" : [" Carl Smith "],
"item_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.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/38/794/332/0387943323_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780387943329
- ISBN-10: 0387943323
- Publisher: Springer
- Publish Date: October 1994
- Dimensions: 9.56 x 6.29 x 0.66 inches
- Shipping Weight: 0.85 pounds
- Page Count: 148
Related Categories
