Self programming inductive machines
Self-programming inductive machines have enough creativity to recognise the truth of Gödel sentences—and to beat the Lucas argument.
Argument anticipated by C.T.K. Chari (1963).
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
▲
Inductive machines immune to Gödelization »Inductive machines immune to Gödelization
■
Self programming inductive machines
●
Self-programming machines are too rigid »Self-programming machines are too rigid
+Commentaar (0)
+Citaten (0)
+About