Limits of Computation
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice''s Theorem, Kleene''s Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin''s Theorem. Ea...
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice''s Theorem, Kleene''s Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin''s Theorem. Ea...
