Provides a brief but rigorous introduction to the abstract theory of computation, often referred to as recursion theory. The author develops major themes in computability theory, such as Rice's theorem and the recursion theorem, as well as Blum's complexity theory.