---
product_id: 124181968
title: "Cengage Learning Introduction To The Theory Of Computation 3RD, INTERNATIONAL ECONOMY EDITION"
brand: "michael sipser"
price: "€ 57.75"
currency: EUR
in_stock: true
reviews_count: 12
url: https://www.desertcart.fi/products/124181968-cengage-learning-introduction-to-the-theory-of-computation-3rd-international
store_origin: FI
region: Finland
---

# Cengage Learning Introduction To The Theory Of Computation 3RD, INTERNATIONAL ECONOMY EDITION

**Brand:** michael sipser
**Price:** € 57.75
**Availability:** ✅ In Stock

## Quick Answers

- **What is this?** Cengage Learning Introduction To The Theory Of Computation 3RD, INTERNATIONAL ECONOMY EDITION by michael sipser
- **How much does it cost?** € 57.75 with free shipping
- **Is it available?** Yes, in stock and ready to ship
- **Where can I buy it?** [www.desertcart.fi](https://www.desertcart.fi/products/124181968-cengage-learning-introduction-to-the-theory-of-computation-3rd-international)

## Best For

- michael sipser enthusiasts

## Why This Product

- Trusted michael sipser brand quality
- Free international shipping included
- Worldwide delivery with tracking
- 15-day hassle-free returns

## Description

Full description not available

## Images

![Cengage Learning Introduction To The Theory Of Computation 3RD, INTERNATIONAL ECONOMY EDITION - Image 1](https://m.media-amazon.com/images/I/81dqg2MZIWL.jpg)

## Customer Reviews

### ⭐⭐⭐⭐⭐ 5.0 out of 5 stars







  
  
    First Thoughts:  Very Mathematical;  A Deep Treatment Of This Subject;  Up To Date Too
  

*by A***R on Reviewed in the United States 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  ...

### ⭐⭐⭐⭐⭐ 5.0 out of 5 stars







  
  
    This is a great intro to complexity theory
  

*by J***A on Reviewed in the United States on February 2, 2017*

This is a great intro to complexity theory, though expensive for my tastes. I bought it for an autonama class, never read it during the class, but came back to it for the special topics.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.

### ⭐⭐⭐⭐ 4.0 out of 5 stars







  
  
    content great, book in great condition, BUT
  

*by A***7 on Reviewed in the United States on July 22, 2024*

errata not corrected, even the print number shows the book was recently printed.What is the point to repeat the same error? are we not expect the publisher to correct the errata in every new print of the book anymore?

## 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.fi/products/124181968-cengage-learning-introduction-to-the-theory-of-computation-3rd-international](https://www.desertcart.fi/products/124181968-cengage-learning-introduction-to-the-theory-of-computation-3rd-international)

---

*Product available on Desertcart Finland*
*Store origin: FI*
*Last updated: 2026-02-17*