shopping cart
Call us:  800-878-7323 HELP
McAfee SECURE helps keep you safe from identity theft, credit card fraud, spyware, spam, viruses and online scams.
Original Essays | June 27, 2009

All posts by Fran Cannon Slayton On Wakes and Rum (and Coke)

"Unfortunately, I've been to my fair share of wakes." Continue »


  1. $11.89 Sale Hardcover add to wish list

    When the Whistle Blows

    Fran Cannon Slayton

Ships free on qualified orders.
$79.50
List price: $103.95
HARDCOVER, USED
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Beaverton Textbooks- General


Introduction To the Theory of Computation 2ND Edition

by Michael Sipser

Introduction To the Theory of Computation 2ND Edition Cover

ISBN13: 9780534950972
ISBN10: 0534950973
Condition: Standard
Dustjacket: None
All Product Details

Only 1 left in stock at $79.50!

Synopses & Reviews

Publisher Comments:

This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.

Review:

"For the market this text addresses, Introduction to the Theory of Computation, Second Edition is an outstanding text without peer." - Christopher Wilson, University of Oregon

Synopsis:

Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.

Synopsis:

This market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.

About the Author

Dr. Sipser has been at MIT teaching and doing research in computational complexity theory for the past 24 years. He has published on a variety of areas, including circuit complexity, interactive proof systems, probabilistic computation and quantum computation. He enjoys lecturing, and has given courses ranging from freshman calculus to advanced seminars in complexity. In addition to MIT, he has held positions at the University of California/Berkeley and at IBM research.

Table of Contents

Introduction Part 1: Automata and Languages 1. Regular Languages 2. Context-Free Languages Part 2: Computability Theory 3. The Church-Turing Thesis 4. Decidability 5. Reducibility 6. Advanced Topics in Computability Theory Part 3: Complexity Theory 7. Time Complexity 8. Space Complexity 9. Intractability 10. Advanced Topics in Complexity Theory Selected Bibliography

Product Details

ISBN:
9780534950972
Author:
Sipser, Michael
Publisher:
Course Technology
Subject:
Computer Science
Subject:
Machine Theory
Subject:
Formal languages
Subject:
Computational complexity
Copyright:
Edition Number:
2
Publication Date:
February 2005
Binding:
Hardcover
Grade Level:
College/higher education:
Language:
English
Illustrations:
Y
Pages:
431
Dimensions:
9.56x6.50x.91 in. 1.70 lbs.

Other books you might like

  1. $60.00 Used Trade Paper add to wish list
  2. $38.50 New Trade Paper add to wish list

    Refactoring Workbook

    William C. Wake

Related Aisles

  • back to top

Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and eBooks — here at Powells.com.