comments

Self-referential machines

A self-referential machine can evaluate Gödel sentences for itself. Such a machine may evade the Lucas argument.


RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Improved machines
■
Self-referential machines
↳
Gödelizing operator can defeat Lucas's argument
↳
METACAT
□
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
□
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