comments

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.
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
⌃
Substitution trick
■
Machine prepared for subsitution tricks
⇥
Jack Copeland
□
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