3 ms·
Uh oh, you got technical on me! It's been a long time since I've studied this stuff, but for what it's worth, your argument feels incorrect to me. It might not
by gruseom 19y ago
Uh oh, you got technical on me!
It's been a long time since I've studied this stuff, but for what it's worth, your argument feels incorrect to me. It might not be possible to address that effectively here, but let me try.
Let's call a particular run of the Turing test a "Turing dialog". Say a Turing dialog D consists of alternating statements C1,H1,...,Cn,Hn where C stands for "computer" and H for "human". Say a "successful Turing dialog" is one that succeeds in fooling the human participant - that is, Hn is something like "I think you're human".
You're right that for any Turing dialog D, D is finite and therefore an algorithm exists to reproduce it (a simple lookup table will do). But such an algorithm is only good for one specific D. To build it, you'd have to know all of D in advance.
To pass the Turing test, we need more. We need an algorithm, which, given any valid prefix of a Turing dialog, i.e. any sequence C1,H1,...,Ck,Hk, knows how to produce Ck+1 in such a way that the dialog will end successfully. That's not the same thing, is it?
- bumbledraven 19y agoWe need an algorithm, which, given any valid prefix of a Turing dialog, i.e. any sequence C1,H1,...,Ck,Hk, knows how to produce Ck+1 in such a way that the dialog will end successfully. Exactly, but since each Turing dialog is of bounded length (i.e. no more than a megabyte in size, depending on the bandwidth of the TTY and the predetermined maximum length of the test), the set of all Turing dialogs is finite and is therefore subject to the dictionary algorithm approach. It's rather like building out the game tree of optimal play for White in chess. The tree for the Turing Test "game" would have to include all the questions that could be asked at each point in the tree, but you only need one possible correct ("Turing-test passing") response at each node.