PART II. INFINITE AUTOMATA. COMPUTABILITY
This part introduces the Turing machine as a model for the notion of an effective procedure, discusses the limits of computability (especially the halting problem), and presents recursive functions as an equivalent formalism for the same notion of computation.
Exceptionally, I publish here the original text of this part in two HTML pages, one for each chapter.
