The Theory of Computation [Hardcover]

Bernard M. Moret (Author)

Book Description

ISBN-10: 0201258285 | ISBN-13: 978-0201258288 | Publication Date: September 12, 1997 | Edition: 1st

Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical issues in computing. The book establishes clear limits to computation, relates these limits to resource usage, and explores possible avenues of compromise through approximation and randomization. The book also provides an overview of current areas of research in theoretical computer science that are likely to have a significant impact on the practice of computing within the next few years.

Editorial Reviews

From the Back Cover

This is the best text on complexity theory I have seen, and could easily become the standard text on the subject...This is the first modern text on the theory of computing.
William Ward Jr, Ph.D, University of South Alabama

Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical issues in computing. The book establishes clear limits to computation, relates these limits to resource usage, and explores possible avenues of compromise through approximation and randomization. The book also provides an overview of current areas of research in theoretical computer science that are likely to have a significant impact on the practice of computing within the next few years.

Highlights

• Motivates theoretical developments by connecting them to practical issues
• Introduces every result and proof with an informal overview to build intuition
• Introduces models through finite automata, then builds to universal models, including recursion theory
• Emphasizes complexity theory, beginning with a detailed discussion of resource use in computation
• Includes large numbers of examples and illustrates abstract ideas through diagrams
• Gives informal presentations of difficult recent results with profound implications for computing

The writing style is very literate and careful. This is a well-written book on theoretical computer science, which is very refreshing. Clear motivations, and lucid reflections on the implications of what the author proves abound.
James A. Foster, Ph.D., University of Idaho

0201258285B04062001

About the Author

Bernard Moret is a Professor of Computer Science at the University of New Mexico. He received his Ph.D. in Electrical Engineering from the University of Tennessee. Dr. Moret received the University's Graduate Teacher of the Year award, the College of Engineering's Teaching Excellence award, and the Students' Faculty Recognition award. He is the Editor-in-Chief of the ACM Journal of Experimental Algorithmics. In this capacity and through his research, he has worked to bridge the gap between theory and applications, emphasizing the need for grounding theoretical developments upon problems of practical importance. Dr. Moret also co-authored Algorithms from P to NP, Volume I: Design and Efficiency, published by Addison-Wesley in 1991.

0201258285AB04062001

Product Details

• Hardcover: 453 pages
• Publisher: Addison Wesley; 1st edition (September 12, 1997)
• Language: English
• ISBN-10: 0201258285
• ISBN-13: 978-0201258288
• Product Dimensions: 9 x 6.4 x 1 inches
• Shipping Weight: 12.8 ounces (View shipping rates and policies)
• Average Customer Review: 2.5 out of 5 stars  See all reviews (4 customer reviews)
• Amazon Best Sellers Rank: #964,948 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

3 of 3 people found the following review helpful:

2.0 out of 5 stars If you love formalisms..., October 27, 2000

By 

theskeptic "theskeptic" (Jersey) - See all my reviews

This review is from: The Theory of Computation (Hardcover)

This is the assigned text for a graduate class in Foundations of Computation that I'm currently taking. I have thus far struggled through the first five chapters, and feel confident about making the following statement: Unless you *already* have a strong intuitive grasp of the concepts that the book covers AND are very comfortable with mathematical formalisms, you will find this to be a very unrewarding book (as I have).

I found it absolutely necessary to supplement my reading with the Sipser book (Introduction to the Theory of Computation), which delivers the essential concepts much more cleanly and powerfully. The problem with the Moret book is that the formalism adds almost nothing, while making the concept so much more difficult to extract. For example, the book certainly defines the mathematical notions of recursive and recursively enumerable sets, but the treatment will (I think) only resonate with those already broadly familiar with Turing decidability and recognizability. Otherwise, the discussion seems terribly abstract and unimportant.

I'm not being complete fair, because Moret doesn't leave things completely at the abstract level, but what I'm saying is that when you open this book, you have to already know what you're looking for. So if you already are familiar with issues of decidability and are ready for a more formal development (which may have no practical value whatsoever), you may get something from the book. If you open the book to see what theory of computation is all about, you will probably regret it.

If you're getting started, get the Sipser book.

-- Big Muggle

2 of 3 people found the following review helpful:

3.0 out of 5 stars Beware the bad binding, September 18, 2000

By 

theskeptic "theskeptic" (Jersey) - See all my reviews

This review is from: The Theory of Computation (Hardcover)

I don't think I can include myself in the book's target audience, so I will withhold a review of the content.

However, I want to warn potential buyers that the construction of the book may be very poor. Of the 15 or so used copies of the book in the Rutgers University bookstore, almost all had broken bindings. This despite no evidence whatsoever of any abuse (no bent corners, scarred covers, ripped pages, etc.). The binding on the used copy that I purchased also broke after about two weeks of extremely gentle use.

If you think (as I do) that an $80 book ought to have as robust a construction as technology allows, you may want to avoid this edition.

1 of 2 people found the following review helpful:

2.0 out of 5 stars Unsuccessful, January 25, 2000

By A Customer

This review is from: The Theory of Computation (Hardcover)

Always I can find something worse than typor in the book. Though the author want to introduce some nice topic on the subject, too many errors and confusion make it not enjoyable.