Gödelizing operator can defeat Lucas's argument
Machine with a Gödelizing operator can carry out the Gödel procedure and add all its Gödel sentences to itself as theorums. It could recognise the truth of its Gödel sentence and any subsequent Gödel sentences that could be formed about the machine.
Argument anticipated by John Lucas (1961).



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 »Improved machines
▲
Self-referential machines »Self-referential machines
■
Gödelizing operator can defeat Lucas's argument
●
A self-Gödelizing machine can still be out-Gödeled »A self-Gödelizing machine can still be out-Gödeled
+Commentaar (0)
+Citaten (0)
+About