Self-reflecting ingenious machine can't be out-Gödeled
An ingenious machine that can ascertain its own syntax can avoid the Gödel problem. By progressively adding new syntax to its language, an ingenious machine could understand any new Gödel sentence that Lucas might present it with.
J. J. C. Smart (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
▲
Ingenious machines could evade the Gödel argument »Ingenious machines could evade the Gödel argument
▲
Ingenious machine's no better than a moronic one »Ingenious machine's no better than a moronic one
■
Self-reflecting ingenious machine can't be out-Gödeled
+Commentaar (0)
+Citaten (0)
+About