Ingenious machine's no better than a moronic one
A moronic machine can't extract itself from the Gödel predicament, even if it's given an infinite amount of time. Neither can an ingenious machine extract itself, because it only works faster than the moronic machine.
An ingenious machine may display some mathematical insight—ie it may be able to see shortcuts to proofs—but it still can't recognise the truth of its own Gödel sentence.

Argument anticipated by J. J. C. Smart (1961).
Immediately related elementsHow this works
-
Artificial Intelligence »Artificial Intelligence
▲
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
▲
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
▲
Improved machines »Improved machines
▲
Ingenious machines could evade the Gödel argument »Ingenious machines could evade the Gödel argument
■
Ingenious machine's no better than a moronic one
●
Self-reflecting ingenious machine can't be out-Gödeled »Self-reflecting ingenious machine can't be out-Gödeled
+Commentaires (0)
+Citations (0)
+About