From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!aunro!ukma!asuvax!ncar!noao!amethyst!organpipe.uug.arizona.edu!NSMA.AriZonA.EdU!bill Thu Feb 20 15:20:17 EST 1992
Article 3680 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!aunro!ukma!asuvax!ncar!noao!amethyst!organpipe.uug.arizona.edu!NSMA.AriZonA.EdU!bill
>From: bill@NSMA.AriZonA.EdU (Bill Skaggs)
Newsgroups: comp.ai.philosophy
Subject: Re: Humongous table-lookup misapprehensions
Message-ID: <1992Feb12.172855.19148@organpipe.uug.arizona.edu>
Date: 12 Feb 92 17:28:55 GMT
References: <1992Feb1.202710.8329@husc3.harvard.edu> <1992Feb4.162016.13805@cs.ucf.edu> <1992Feb12.002312.19459@ida.liu.se>
Sender: news@organpipe.uug.arizona.edu
Reply-To: bill@NSMA.AriZonA.EdU (Bill Skaggs)
Organization: Center for Neural Systems, Memory, and Aging
Lines: 22

In article <1992Feb12.002312.19459@ida.liu.se> 
c89ponga@odalix.ida.liu.se (Pontus Gagge) writes:
>
>Anyway, I seem to meet no further resistance to my original 
>statement that
>  a) the table-cheat is in principle possible
>  b) it would pass the Turing Test
>  c) it would be completely uninteresting.
>Even the ever-combative mr. Zeleny has agreed to drop his objection.
>
>Is everybody happy that a DFA exists which passes a Turing Test, and
>does so in a completely uninteresting manner? Is the Turing Test still
>a good criterion for intelligence?
>

  I'm not happy.  I said so before.  To make me think that the
lookup table passes the test in a completely uninteresting
manner, you must explain to me the completely uninteresting
way you set up the table.  How do you decide what entry to
put in each slot?  This question is very interesting to me. :-)

  	-- Bill


