Kurt Gödel Dead
His 1931 incompleteness theorems bounded what formal systems — and thus programs — can prove.
190019251950197520002025
Proved the incompleteness theorems (1931) — any consistent formal system containing arithmetic has true statements it cannot prove. Mathematics cannot mechanize itself completely.\n\nTuring's halting problem is the computational restatement; every theory of what programs can do starts where Gödel stopped.