From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!usc!wupost!uunet!tarpit!cs.ucf.edu!news Wed Feb  5 11:56:58 EST 1992
Article 3475 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!usc!wupost!uunet!tarpit!cs.ucf.edu!news
>From: clarke@acme.ucf.edu (Thomas Clarke)
Newsgroups: comp.ai.philosophy
Subject: Re: Humongous table-lookup misapprehensions
Message-ID: <1992Feb4.162016.13805@cs.ucf.edu>
Date: 4 Feb 92 16:20:16 GMT
References: <1992Feb1.202710.8329@husc3.harvard.edu>
Sender: news@cs.ucf.edu (News system)
Organization: University of Central Florida
Lines: 34

| In article <1992Jan29.023448.11610@aisb.ed.ac.uk> 
| jeff@aiai.ed.ac.uk (Jeff Dalton) writes:
| 
| >In article <1992Jan28.164711.8184@husc3.harvard.edu> 
| >zeleny@zariski.harvard.edu (Mikhail Zeleny) writes:
| 
| >>In article <1992Jan25.224700.8656@ida.liu.se> 
| >>c89ponga@odalix.ida.liu.se (Pontus Gagge) writes:
| 
| PG:
| >>>Pro primo: The table-lookup passes the Turing test by *definition*. 
| 
| MZ:
| >>Not true.  Temporal considerations undermine the very idea of a static
| >>table, requiring constant update thereof through some input mechanism.
| 
| JD:
| >I still don't see what's wrong with a static table.  
| 
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.

					         <---<--Look Up Table
												 |								^^^    ^^^^   4x10^12 lines
             |        |||....||||    
   Tester's TTY --> Shift Register  (shift at TTY rate)
									                      
Thomas Clarke.  University of Central Florida


