Gödel's incompleteness theorems
No.11435712 ViewReplyOriginalReport
Quoted By: >>11435745 >>11436004 >>11436091
Hofstadter's book is too wordy. Here is a complete proof.
Given an axiomatic system S, you can write a computer program to do the following:
1. print its code into a variable R.
2. deduce consequences of S, looking for "R does not halt"
3. if it finds this, halts.
This proves the theorem. QED.
Given an axiomatic system S, you can write a computer program to do the following:
1. print its code into a variable R.
2. deduce consequences of S, looking for "R does not halt"
3. if it finds this, halts.
This proves the theorem. QED.
