comments

Highly complex machine may not be Gödelizable

A qualitative difference in the way computers think may be introduced when they have advanced to a high enough degree of complexity. Such a highly complex machine may recognise the truth of its own Gödel sentence.

Argument anticipated by John Lucas (1961).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Improved machines
■
Highly complex machine may not be Gödelizable
↳
Un-Gödelizable machine wouldn't be a machine
□
Connectionist machine may evade Gödelization
□
Inductive machines immune to Gödelization
□
Ingenious machines could evade the Gödel argument
□
Self-referential machines
□
The Gödelian insight has already been formalised
□
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