Change search
ReferencesLink to record
Permanent link

Direct link
What does the incompleteness theorem add to the unsolvability of the halting problem?
Luleå tekniska universitet.
2006 (English)In: Logical approaches to computational barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30 - July 5, 2006 ; proceedings / [ed] Arnold Beckmann; Ulrich Berger; Benedikt Löwe; John V. Tucker, Encyclopedia of Global Archaeology/Springer Verlag, 2006, 198- p.Conference paper (Refereed)
Abstract [en]

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

Place, publisher, year, edition, pages
Encyclopedia of Global Archaeology/Springer Verlag, 2006. 198- p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3988
Identifiers
URN: urn:nbn:se:ltu:diva-35927Local ID: aa8eb260-a05f-11df-a707-000ea68e967bISBN: 978-3-540-35466-6OAI: oai:DiVA.org:ltu-35927DiVA: diva2:1009182
Conference
Conference on Computability in Europe : 30/06/2006 - 05/07/2006
Note
Validerad; 2006; 20100805 (andbra)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

No full text

Search outside of DiVA

GoogleGoogle Scholar

Total: 25 hits
ReferencesLink to record
Permanent link

Direct link