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).
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
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
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip