Machine isn't capable of informal proof
A machine isn't capable of informal proof in the human sense. No matter how informal a machine's reasoning may appear to be, it will still be grounded in a formal system; so its informal proof's also formalisable, and subject to the Gödel procedure.
John Lucas (1988).
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 »A self-Gödelizing machine can still be out-Gödeled
▲
Informal proof »Informal proof
■
Machine isn't capable of informal proof
◄
John Lucas »John Lucas
+Komentarai (0)
+Citavimą (0)
+About