EPSTEIN , RICHARD LOUIS;CARNIELLI , WALTER A
The classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal logic to give a full development of G”del's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This third edition contains the timeline "Computability and Undecidability" as well as the essay "On Mathematics". 1 Paradoxes; 2 What Do the Paradoxes Mean?; 3 Whole Numbers;4 Functions; 5 Proofs; 6 Infinite Collections?; 7 Hilbert "On the Infinite"; 8 Computability; 9 Turing Machines; 10 The Most Amazing Fact and Church's Thesis; 11 Primitive Recursive Functions; 12 The Grzegorczyk Hierarchy; 13 Multiple Recursion; 14
