Turing’s Analysis of Computability, and Major Applications of lt
S. C. Kleene · 1990
Abstract The aim of this article is to present to readers, not assumed to have any previous acquaintance with Turing’s work, both (1) the basic ideas in Turing’s analysis of computability, and (2) what seems to me the most straightforward way of developing from it some significant features of the structure of mathematics. The application I use of his computability, and the path I follow in the developments from it, are somewhat different than in Turing’s own writing. Other investigators contributed.