A self-Gödelizing machine can still be out-Gödeled
The Gödelizing operator—to be programmable—must be specified by some finite rule. But in that case, the Gödelizing operator is itself formalisable. The resulting system can be shown to contain a formula that's true but can't be proven in the system.
So the Gödelizing procedure still holds against the self Gödelizing machine.


John Lucas (1961).
Immediately related elementsHow this works
-
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 »Gödelizing operator can defeat Lucas's argument
■
A self-Gödelizing machine can still be out-Gödeled
●
Informal proof »Informal proof
◄
John Lucas »John Lucas
+Kommentare (0)
+Verweise (0)
+About