Computability Theory

Contents: The core of section 1 is devoted to decidability and calculability; In section 2, entitled Recursiveness & Church’s Thesis, we see that Herbrand’s broad characterization was used in Gödel’s 1933 paper reducing
classical to intuitionist arithmetic; Section 3 takes up matters where they were left off in the second section,
but proceeds in a quite different direction: it returns to the original task of
characterizing mechanical procedures and focuses on computations and
combinatory processes.