display all the ideas for this combination of texts
1 idea
3178 | A fast machine could pass all behavioural tests with a vast lookup table [Block, by Rey] |
Full Idea: Ned Block proposes a machine (a 'blockhead') which could pass the Turing Test just by looking up responses in a vast look-up table. | |
From: report of Ned Block (works [1984]) by Georges Rey - Contemporary Philosophy of Mind 5.3 | |
A reaction: Once you suspected you were talking to a blockhead, I think you could catch it out in a Turing Test. How can the lookup table keep up to date with immediate experience? Ask it about your new poem. |