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.
RELATED ARTICLESExplain
Artificial Intelligence
Can the Turing Test determine this? [2] 
Yes: defines intelligence operationally/behaviorally
The black box objection
SUPER PARRY could pass Test by brute force
Repeated sentence maneuver
Substitution trick
All Possible Conversations Machine
PARRY
Jack Copeland
The beefed-up Turing Test
Knowledge of internal processes unnecessary
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip