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.

PAGE NAVIGATOR(Help)
-
Artificial Intelligence »Artificial Intelligence
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
Improved machines
Connectionist machine may evade Gödelization »Connectionist machine may evade Gödelization
Highly complex machine may not be Gödelizable »Highly complex machine may not be Gödelizable
Inductive machines immune to Gödelization »Inductive machines immune to Gödelization
Ingenious machines could evade the Gödel argument »Ingenious machines could evade the Gödel argument
Self-referential machines »Self-referential machines
The Gödelian insight has already been formalised »The Gödelian insight has already been formalised
+Commentaar (0)
+Citaten (0)
+About