Kurt Gödel and Computability Theory

In Beckmann Arnold, Berger Ulrich, Löwe Benedikt & Tucker John V. (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Springer. pp. 575--583 (2006)
  Copy   BIBTEX

Abstract

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar at Princeton in 1934. Seen in the historical context, Gödel was an important catalyst for the emergence of computability theory in the mid 1930s.

Author's Profile

Richard Zach
University of Calgary

Analytics

Added to PP
2017-10-10

Downloads
1,133 (#13,511)

6 months
238 (#9,025)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?