Lucas claims less than Wang's dilemma suggests
Only those machines we know to be consistent are adequate candidates for models of the mind—and we can often tell this. Mechanists don't need to know the consistency of all machines, just that the ones presented to the mentalist are consistent.
John Lucas (1997).
Λεπτομέρειες πλοηγού
(Βοήθεια)
-
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
Argument from Gödel's theorem is dialectical »Argument from Gödel's theorem is dialectical
A dilemma about consistency »A dilemma about consistency
Lucas claims less than Wang's dilemma suggests
John Lucas »John Lucas
+Σχόλια (0)
+Αναφορές (0)
+About