From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!aunro!ukma!wupost!uunet!mcsun!news.funet.fi!sunic!liuida!c89ponga Thu Feb 20 15:20:43 EST 1992
Article 3727 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!aunro!ukma!wupost!uunet!mcsun!news.funet.fi!sunic!liuida!c89ponga
>From: c89ponga@odalix.ida.liu.se (Pontus Gagge)
Newsgroups: comp.ai.philosophy
Subject: Re: Humongous table-lookup misapprehensions
Message-ID: <1992Feb14.015835.22216@ida.liu.se>
Date: 14 Feb 92 01:58:35 GMT
References: <1992Feb1.202710.8329@husc3.harvard.edu> <1992Feb4.162016.13805@cs.ucf.edu> <1992Feb12.002312.19459@ida.liu.se> <1992Feb12.172855.19148@organpipe.uug.arizona.edu>
Sender: news@ida.liu.se
Organization: CIS Dept, Univ of Linkoping, Sweden
Lines: 50

bill@NSMA.AriZonA.EdU (Bill Skaggs) writes:

>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. :-)

Urgh. OK, a short recapitulation of my creation process:

An infinitely dedicated creator is given the task to create the table
for all conversations lasting less than a century. In order to avoid
certain practical problems we give her a turbo-charged longevity
drug, and put her in a timewarp, where she can happily hack away for 
the requisite >>10E100 years. In a moment, in the twinkling of an eye, :-)
she emerges, hands us the table, which proceeds to pass the Turing Test.

In order to simplify (hmmm...) her task, we could give her a 
random-query-generator that in each step of the conversation 
generates any possible query from the interrogator.

The creation is "uninteresting" insofar as it gives us no insight
into the nature of intelligence.

The table is "uninteresting" in that it is merely the creator's
intelligence, albeit canned.

Interesting enough?
--
/-------------------------+-------- DISCLAIMER ---------\
| Pontus Gagge            | The views expressed herein  |
| University of Link|ping | are compromises between my  |
|                         | mental subpersonae, and may |
| c89ponga@und.ida.liu.se | be held by none of them.    |
\-------------------------+-----------------------------/


