SUPER PARRY could pass Test by brute force
An advanced alien civilisation could write a program, like, Colby's PARRY, containing ready made responses to questions. This SUPER PARRY would be better prepared for the test, however, because it would contain responses to all possible questions.
SUPER PARRY could therefore pass the Turing test by brute force. But it is clearly not thinking; it is just dumbly searching a long list of conversations.

Jack Copeland, 1993.
Immediately related elementsHow this works
-
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
●
Repeated sentence maneuver Â»Repeated sentence maneuver
●
Substitution trick Â»Substitution trick
►
All Possible Conversations Machine Â»All Possible Conversations Machine
►
PARRY Â»PARRY
◄
Jack Copeland Â»Jack Copeland
+Kommentare (0)
+Verweise (0)
+About