Computability in Europe 2006
Logical Approaches to Computational Barriers


Special Session Talk:
What does the incompleteness theorem add to the unsolvability of the halting problem?


THIS TALK IS CANCELLED!!!
Speaker: Torkel Franzén

Abstract

Turing's paper including a proof of the unsolvability of the halting
problem appeared five years after Gödel's 1931 paper, and ever since
there have been many and close ties between uncomputability and
incompleteness. The purpose of my talk is to discuss the specific role
and contribution of the "Gödelian" approach to incompleteness. 


websites: Arnold Beckmann 2006-06-22