From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!uunet!mcsun!news.funet.fi!sunic!liuida!c89ponga Thu Feb 20 15:20:08 EST 1992
Article 3665 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!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: <1992Feb12.002312.19459@ida.liu.se>
Date: 12 Feb 92 00:23:12 GMT
References: <1992Feb1.202710.8329@husc3.harvard.edu> <1992Feb4.162016.13805@cs.ucf.edu>
Sender: news@ida.liu.se
Organization: CIS Dept, Univ of Linkoping, Sweden
Lines: 52

clarke@acme.ucf.edu (Thomas Clarke) writes:

>Maybe I'm missing something, but it seems to me that table look-up,  
>Turing-certified AI is indeed trivial, even in light of temporal  
>considerations.  Taking 100 years as the maximum possible conversation 
>(human lifetime), and 1200 baud as a reasonable character rate that the 
>human tester can absorb, then the conversation can involve at most 
>3,784,320,000,000 bits. A look up table with 4 trillion address bits
>when addressed by the entire previous conversation stream would suffice
>to determine the next bit to send to the tester.  Building and 
>initializing this table would be a problem.

[Picture omitted]

Alas, that the misapprehensions cannot be killed in one stroke.
This was a new one, though. Maybe I am being nasty, pointing out
the fallacy, but anyway: 

Branching.

Heard of combinatorial explosion?

>Thomas Clarke.  University of Central Florida

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?











--
/-------------------------+-------- 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.    |
\-------------------------+-----------------------------/


