comments

Improved machines

A beefed-up machine can recognise the truth of the Gödel sentence. Such a machine defeats Lucas's argument, because it shows that a formal system can evade Lucas's Gödelizing ability.


RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
■
Improved machines
↳
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
↳
The Gödelian insight has already been formalised
□
Theorems show limitations of machine thought
□
Gödel shows machines can't be fully conscious
□
Argument from Gödel's theorem is dialectical
□
Mathematical insight is non-algorithmic
□
Gödel limits formal systems not machine implementations
□
The problem of consistency
□
Lucas may be a Turing machine
□
Lucas tricks machines into contradicting themselves
□
Some people cannot understand Gödel's theorem
□
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