Part III (“Infinite Automata. Computability”) introduces the Turing machine model as a formalization of the effective procedure and discusses the limits of computability (especially the halting problem), then presents the theory of recursive functions and its relation to computability in the Turing sense.
Exceptionally, I publish here the original text of Part III in two pages corresponding to the two chapters.
