What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?

  • Torkel Franzén
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)


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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Torkel Franzén
    • 1
  1. 1.SystemteknikLTULuleåSweden

Personalised recommendations