All Possible Conversations Machine
An unintelligent machine engaging in sensible conversation by searching a database containing all possible lines of conversation in a finite Turing test, would pass the neo-Turing test—but it would be only echoing its programmer's intelligence.


Ned Block, 1981.

"This machine isn't intelligent. Its intelligence comes for the programmers who coded in all the conversations."

Note: Block simply calls this the "Unintelligent Machine".
CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Can the Turing Test determine this? [2]  »Can the Turing Test determine this? [2] 
▲
No: but Neo-Turing test is adequate »No: but Neo-Turing test is adequate
▲
The Psychologism Objection »The Psychologism Objection
■
All Possible Conversations Machine
●
All intelligent machines exhibit their designer's intelligence »All intelligent machines exhibit their designer's intelligence
●
Bantering zombies can't think »Bantering zombies can't think
●
Brute list-searcher can't respond flexibly to change »Brute list-searcher can't respond flexibly to change
●
Chauvinistic to assume we're better than the machine »Chauvinistic to assume we're better than the machine
●
Machine can't pass the Cyberiad Test »Machine can't pass the Cyberiad Test
●
Machine is dated »Machine is dated
●
Machine redefines intelligence »Machine redefines intelligence
●
What if we are all like this machine? »What if we are all like this machine?
●
Combinatorial explosion is invalid in a Patterns In Contexts model. »Combinatorial explosion is invalid in a Patterns In Contexts model.
◄
Ned Block »Ned Block
◄
SUPER PARRY could pass Test by brute force »SUPER PARRY could pass Test by brute force
+Comments (0)
+Citations (0)
+About