Machine prepared for subsitution tricks
Because there are only a finite number of "substitution tricks" SUPER PARRY could be built to handle all of them.
Jack Copeland, 1993.
CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Can the Turing Test determine this? [2]  »Can the Turing Test determine this? [2] 
▲
Yes: defines intelligence operationally/behaviorally »Yes: defines intelligence operationally/behaviorally
▲
The black box objection »The black box objection
▲
SUPER PARRY could pass Test by brute force »SUPER PARRY could pass Test by brute force
▲
Substitution trick »Substitution trick
■
Machine prepared for subsitution tricks
◄
Jack Copeland »Jack Copeland
+Comments (0)
+Citations (0)
+About