ABSTRACT

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

chapter 1|12 pages

◾ Set Theory

chapter 3|28 pages

◾ Algorithms

chapter 4|20 pages

◾ Turing Machines

chapter 5|32 pages

◾ Turing-Completeness

chapter 6|16 pages

◾ Undecidability

chapter 7|32 pages

◾ Undecidability and Reducibility

chapter 8|24 pages

◾ Classes NP and NP-Complete

chapter 9|40 pages

◾ More NP-Complete Problems

chapter 10|28 pages

◾ Other Interesting Questions and Classes