Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows with Prime
Try Prime
and start saving today with fast, free delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Streaming of thousands of movies and TV shows with limited ads on Prime Video.
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
-74% $80.62$80.62
Ships from: Amazon Sold by: Apex_media
$35.90$35.90
Ships from: Amazon Sold by: ddubya2012
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Image Unavailable
Color:
-
-
-
- To view this video download Flash Player
- VIDEO
Follow the authors
OK
Introduction to the Theory of Computation 3rd Edition
Purchase options and add-ons
- ISBN-10113318779X
- ISBN-13978-1133187790
- Edition3rd
- PublisherCengage Learning
- Publication dateJune 27, 2012
- LanguageEnglish
- Dimensions6.5 x 1 x 9.5 inches
- Print length504 pages
Frequently bought together
Similar items that may ship from close to you
From the Publisher
This product is included in a Cengage Unlimited subscription
|
|
|
---|---|---|
With Cengage Unlimited You CanWith a Cengage Unlimited subscription you get all your Cengage access codes and online textbooks, online homework and study tools for one price per semester, no matter how many Cengage classes you take. |
Access All Your Cengage Online PlatformsThis includes all your courses on faculty-assigned Cengage online platforms like MindTap, WebAssign, CengageNOWv2, SAM, iLrn, OWLv2, and OpenNow. |
All For Only One Price Per SemesterNo matter how many Cengage access codes you need or online textbooks and study tools you use, the price of Cengage Unlimited stays the same. |
What’s included in Cengage Unlimited?
- Get all your Cengage access codes for platforms like MindTap, WebAssign, CengageNowv2, SAM, OWLv2 and OpenNow
- Access to the online version of your textbook + our full library
- A lower cost hardcopy textbook rental with each access code, available within the 50 states
- New study tools including online homework, flashcards, test prep and study guides
- A career center where you can boost your job skills, explore career options and build your resume
Editorial Reviews
Review
"As one of my students puts it, the book is 'fun to read and helps him learn the subject better'."
"This is a model for readability, with sensitivity for what students find difficult."
"Excellent prose (simple and succinct) with very good diagrams. It is by far the best presentation of automata in the business."
About the Author
Product details
- Publisher : Cengage Learning; 3rd edition (June 27, 2012)
- Language : English
- Hardcover : 504 pages
- ISBN-10 : 113318779X
- ISBN-13 : 978-1133187790
- Item Weight : 1.65 pounds
- Dimensions : 6.5 x 1 x 9.5 inches
- Best Sellers Rank: #121,053 in Books (See Top 100 in Books)
- #23 in Machine Theory (Books)
- #93 in Computer Science (Books)
- #203 in Core
- Customer Reviews:
Videos
Videos for this product
1:15
Click to play video
Introduction to Private Security
Merchant Video
About the authors
Discover more of the author’s books, see similar authors, read author blogs and more
Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonReviews with images
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
In my Bachelor of Science at the University of Melbourne years ago I studied some related content in a subject entitled 618-341 Mathematical Logic, and did not take the computer science subject 622-301 Theory Of Computation. Now, from the mathematician's point of view finitism is irrelevant it's a matter of axiom systems being consistent and proving things. The Godel number encoding of theorems and interiority arguments and clever free variable substitution arguments together with model theory were used to establish as true many powerful results ...
I note that the terminology has changed since 1982; what was called then 'a recursive formula' is now called Turing decidable and what was called then 'a recursively enumerable formula' is now called 'Turing recognizable'. For example, this author would regard a Turing machine that took a blank tape and churned out the binary representation of pi 3.14159265358979323846 etc in some tape representation to an infinite number of places as a Turing machine that loops, even if such a Turing machine was reasonably well behaved in terms of its generally moving forwards ... This begs the question of real number representation; the bit string 0.11111111111 ... is essentially the same real value as 1.0000000000 ... This suggests to me that Turing theory has taken a more finitistic turn; whether this is to avoid paradoxes recently found I haven't worked out yet. In the real world with its quantum mechanics randomness and lack of apparent finititude it's quite concievable that a multi-tape Turing machine (as described in outline in section 3.2 p176ff) device could resolve a real number function evaluation so as to avoid a value ending in an infinite series of 1's that rightly should be rounded up, and store the real value as a constant in some 'set' device for storing real numbers ... However till we know more about the real truths underlying physics this is mere speculation ...
There are a lot of topics that are quite new to me. For example, P less than NP less than PSPACE less than NPSPACE less then EXPTIME seems a rather more complex hypothesis regarding algorithms and their expected time to complete than I've met in other works ... Reading this section I hope will prove rewarding ...
Overall it seems that the field has moved on since 1982 in many a way and I hope this book enables me to refresh my knowledge with the latest results. An excellent treatment of the whole field of theory of computation.
The only criticism I can think to make is that this work seems to have a finitistic philosophy rather than a mathematical Platonist philosophy ... but then this is essential to the computer science approach rather than a pure mathematical one ...
This only dips into the special topics, but introduces many of the important classes, and their relation to other complexity classes. Such classes as L, BPP, IP, Alternating, NC, and of course P, NP, exptime, PSPACE, and more.
It is very well written. It ussually explains the proof ideas before starting, and gives detailed proofs. If you can afford it, this book makes a great intro to complexity theory.
However, this is an intro. This book does not discuss advanced topics in depth, just enough to understand the most common comexity classes and their known relationships.
The material in this book is extremely dense, but all of the topics covered are extremely well covered. I highly suggest purchasing this book if you are interested in the material or are taking a theory of computation class, even if the suggested text is a different book.
I looked at the listing- it mentions at the VERY BOTTOM of the product description that it is the international edition. I didn't read the entire description because...Why would I? I read the first few lines to confirm it was the right book, and ordered. I am very upset.
On the bright side, it is a pretty decent book. But not a good enough book to get back a star.
Top reviews from other countries
Content => 5/5.
Awesome explanations, perfect.
Calidad cobertura y hoja 8/10
Encuadernación 6/10