--- product_id: 124181968 title: "Cengage Learning Introduction To The Theory Of Computation" price: "€ 49.42" currency: EUR in_stock: true reviews_count: 12 url: https://www.desertcart.fr/products/124181968-cengage-learning-introduction-to-the-theory-of-computation store_origin: FR region: France --- # Cengage Learning Introduction To The Theory Of Computation **Price:** € 49.42 **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Cengage Learning Introduction To The Theory Of Computation - **How much does it cost?** € 49.42 with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [www.desertcart.fr](https://www.desertcart.fr/products/124181968-cengage-learning-introduction-to-the-theory-of-computation) ## Best For - Customers looking for quality international products ## Why This Product - Free international shipping included - Worldwide delivery with tracking - 15-day hassle-free returns ## Description desertcart.com: Cengage Learning Introduction To The Theory Of Computation: 9788131525296: michael sipser: Books Review: First Thoughts: Very Mathematical; A Deep Treatment Of This Subject; Up To Date Too - This is a book I would recommend to third year university computer science and third year university pure mathematics students. Rather terse in style densely packed with challenging content, I really will have to take time to read it carefully to fully appreciate it. 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 ... Review: Fantastic coverage of formal language and automata theory - I purchased this book on the advice of my PhD advisor as an additional resource for a formal language and automata theory course. It is not the textbook for the course I am in, but it could/should be. Prof. Sipser breaks down the subject clearly and when used with the recorded lectures from MIT available for free online, it's a fantastic resource for enriching understanding of the fundamentals of theoretical computer science. ## Technical Specifications | Specification | Value | |---------------|-------| | ASIN | 8131525295 | | Best Sellers Rank | #547,091 in Books ( See Top 100 in Books ) #13,547 in Textbooks (Special Features Stores) | | Customer Reviews | 4.4 4.4 out of 5 stars (588) | | Dimensions | 7.99 x 10 x 1.85 inches | | Edition | 3RD, INTERNATIONAL ECONOMY EDITION | | ISBN-10 | 8131771865 | | ISBN-13 | 978-8131525296 | | Item Weight | 0.071 ounces | | Language | English | | Print length | 480 pages | | Publication date | January 1, 2014 | | Publisher | Cengage Learning | | Reading age | 5 years and up | ## Images ![Cengage Learning Introduction To The Theory Of Computation - Image 1](https://m.media-amazon.com/images/I/81dqg2MZIWL.jpg) ## Customer Reviews ### ⭐⭐⭐⭐⭐ First Thoughts: Very Mathematical; A Deep Treatment Of This Subject; Up To Date Too *by A***R on March 14, 2013* This is a book I would recommend to third year university computer science and third year university pure mathematics students. Rather terse in style densely packed with challenging content, I really will have to take time to read it carefully to fully appreciate it. 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 ... ### ⭐⭐⭐⭐⭐ Fantastic coverage of formal language and automata theory *by A***R on December 23, 2024* I purchased this book on the advice of my PhD advisor as an additional resource for a formal language and automata theory course. It is not the textbook for the course I am in, but it could/should be. Prof. Sipser breaks down the subject clearly and when used with the recorded lectures from MIT available for free online, it's a fantastic resource for enriching understanding of the fundamentals of theoretical computer science. ### ⭐⭐⭐⭐⭐ Excellent for industry practitioners as well as students *by B***R on November 10, 2015* This is a very practical book as well as theoretical. The exercises are great and help reinforce the material. I used this on the job to learn parser theory. It helped me implement an ANTLR parser for SQL. There is nothing more practical than a good theory. The writing is crisp, clear, and the theory easy to follow because of the book's excellent use of examples and diagrams. I highly recommend this book, not just to students taking a course, but for practitioners working in industry. It was expensive, but well worth the price. ## Frequently Bought Together - Introduction To The Theory Of Computation - Introduction to Automata Theory, Languages, and Computation - Introduction to Algorithms, fourth edition --- ## Why Shop on Desertcart? - 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016 - 🌍 **Shop Globally** — Access 737+ million products across 21 categories - 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price - 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members) - 🔒 **Secure Payments** — Trusted payment options with buyer protection - ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews **Shop now:** [https://www.desertcart.fr/products/124181968-cengage-learning-introduction-to-the-theory-of-computation](https://www.desertcart.fr/products/124181968-cengage-learning-introduction-to-the-theory-of-computation) --- *Product available on Desertcart France* *Store origin: FR* *Last updated: 2026-04-24*