Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Special Session Talk:
Kurt Gödel and Computability Theory

Speaker: Richard Zach
Presentation: cie-beam.pdf

Abstract

Although Kurt Goedel 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, Goedel'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 studies Goedel 1931, and Goedel taught a seminar at Princeton
in 1934.  Seen in the historical context, Goedel was a
catalyst for the emergence of computability theory in the mid 1930s. 


websites: Arnold Beckmann 2006-04-21 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net