The Gödelian insight has already been formalised

Programs have been developed that can derive Gödel's theorems. The Gödelian insight has, in effect, been formalised.

Penrose neglects this possibility because he fails to distinguish between the formal system within which a Gödel sentence is proven and the system that does the proving.

Stewart Russell and Peter Norvig (1995).

Note: This came was originally articulated as an attack on Penrose's response to Boolos—see "The Gödelian insight is all that we need", Box 66. Also, see the "Does Gödel's theorem  show that mathematical insight is not algorithmic?" arguments on this map.
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
The Gödelian insight has already been formalised
Gödelization procedure algorithmically specifiable
SHUNYATA—implemented model
Connectionist machine may evade Gödelization
Highly complex machine may not be Gödelizable
Inductive machines immune to Gödelization
Ingenious machines could evade the Gödel argument
Self-referential machines
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