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".