From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wupost!uunet!tdatirv!sarima Fri Jan 31 10:27:12 EST 1992
Article 3288 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wupost!uunet!tdatirv!sarima
>From: sarima@tdatirv.UUCP (Stanley Friesen)
Newsgroups: comp.ai.philosophy
Subject: Re: Table-lookup Chinese speaker
Message-ID: <392@tdatirv.UUCP>
Date: 29 Jan 92 21:45:16 GMT
References: <1992Jan24.185620.41411@spss.com> <F9aaFB3w164w@depsych.Gwinnett.COM>
Reply-To: sarima@tdatirv.UUCP (Stanley Friesen)
Organization: Teradata Corp., Irvine
Lines: 11

In article <F9aaFB3w164w@depsych.Gwinnett.COM> rc@depsych.Gwinnett.COM (Richard Carlson) writes:
|Can you convince a computer it is a bad computer in the
|Turing test and expect to get mischievous answers?

If it is to pass the Enhanced Turing Test, yes.

If it is incapable of this, it does not pass the Turing Test.
-- 
---------------
uunet!tdatirv!sarima				(Stanley Friesen)



