From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!jvnc.net!darwin.sura.net!gatech!mcnc!ecsgate!lrc.edu!lehman_ds Tue Jan 28 12:18:30 EST 1992
Article 3201 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!jvnc.net!darwin.sura.net!gatech!mcnc!ecsgate!lrc.edu!lehman_ds
>From: lehman_ds@lrc.edu
Newsgroups: comp.ai.philosophy
Subject: Re: Table-lookup Chinese speaker
Message-ID: <1992Jan27.180859.159@lrc.edu>
Date: 27 Jan 92 23:08:58 GMT
References: <1992Jan21.170056.23347@oracorp.com> <1992Jan22.205804.39265@spss.com>
Organization: Lenoir-Rhyne College, Hickory, NC
Lines: 31

In article <1992Jan22.205804.39265@spss.com>, markrose@spss.com (Mark Rosenfelder) writes:
> For some reason I was assuming that the database had to store ALL sensible
> conversations.  This leads to numerous problems.  However, we are on different
> ground if the table stores, not all sensible replies to anything the
> tester says, but merely a few particularly good ones.  (It can't store
> just one response, or we would notice it making exactly the same responses
> in repeated runs, which be a failure of the Turing test.)
> 
> Does this get us out of the water?  I don't think so.  I still think there's
> a strategy to defeat the table-lookup machine: concentrate on questions
> that rely on the present context.  (I have to admit that this strategy
> was suggested by reading Mikhail Zeleny's post.)
> 
> For instance, ask the machine what today's date is.  Now, a reply with
> today's date in it is sensible, but should not be placed in the database, 
> because then it would be available if we run the machine tomorrow, too.
> When we are constructing the database we will have to limit the machine's
> responses to variations of "I don't know."  It will have to respond the
> same way to questions like "What city are we in?", "What's the big news in
> Washington this week?" and "What do you think about the Bulls this year?"
> 
> An accumulation of such responses would cause the machine to fail the Turing
> test.  It's just too suspicious that all its statements, though reasonable
> in themselves, so punctiliously avoid all reference to the current context.
  By asking question like that and using this as a basis for passing the test
I myself would fail... simply because I can't remeber the date.. I don't watch
football and If I was moving around, I may even get the city wrong.. but what
does this prove.. that certain data is unknown?  Are you saying intelligence
is strictly data?
   Drew Lehman
   Lehman_ds@lrc.edu


