Limits of Computation: An Introduction to the Undecidable and
the Intractable offers a gentle introduction to the theory of
computational complexity. It explains the difficulties of
computation, addressing problems that have no algorithm at all and
problems that cannot be solved efficiently.
The book enables readers to understand:
- What does it mean for a problem to be unsolvable or to be
- What is meant by a computation and what is a general model of a
- What does it mean for an algorithm to exist and what kinds of
problems have no algorithm?
- What problems have algorithms but the algorithm may take
centuries to finish?
Developed from the authors course on computational complexity
theory, the text is suitable for advanced undergraduate and
beginning graduate students without a strong background in
theoretical computer science. Each chapter presents the
fundamentals, examples, complete proofs of theorems, and a wide
range of exercises."
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!