Focusing on the foundations of computing, this textbook explores key concepts such as the Halting Problem, Rice's Theorem, and the Church-Turing Thesis across 23 lecture-sized chapters. It offers a structured narrative through essential results in computability and time complexity, featuring classroom-tested examples and exercises. The interconnected chapters enhance understanding, making complex theories accessible for students and educators alike.
