A Recursive Introduction to the Theory of Computation

Focusing on the theory of computation, this textbook begins with models of computation and examples, then delves into the limitations of effective computation through basic recursion theory. It introduces self-reference and other essential tools for algorithm manipulation, followed by an exploration of computational complexity and measures. The book concludes with a classification of computable functions based on time and space measures. Designed for graduate students with basic knowledge of discrete mathematics, it includes numerous exercises and solutions.