Computational complexity and Gödel's incompleteness theorem

• 1 April 1971
• journal article
• Published by Association for Computing Machinery (ACM) in ACM SIGACT News
• No. 9,p. 11-12
• https://doi.org/10.1145/1247066.1247068

Abstract

Keywords

• SIMPLY
• INCOMPLETENESS
• GÖDEL'S
• FORMAL
• THEOREM
• SYMBOL
• BERRY'S
• TAPE
• RICHARD
• TURING