Benacerraf’s argument is inconsistent
Benacerraf can't consistently claim that no particular program represents me and at the same time that some program represents me.
Benacerraf argues inconsistently to his conclusion that I'm a Turing machine but can't prove which one.

He says that for each program it can be demonstrated that the program doesn't represent me, but that I still might be represented by some program.

But he consistently claimed that no particular program represents me and at the same time that some program represents me.

John Lucas (1988).
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
Lucas may be a Turing machine »Lucas may be a Turing machine
Benacerraf’s argument is inconsistent
John Lucas »John Lucas
+Commentaar (0)
+Citaten (0)
+About