Re: PHIL/AI: Humongous Lookup Table

Michael Lorrey (
Mon, 10 Feb 1997 21:59:53 -0500

Hal Finney wrote:
> From: Eliezer Yudkowsky <>
> > [...]
> > I can PROVE that a giant
> > hashtable-thermostat can maximize anything a computational mind can.
> > I.e. REALLY BIIG (but less than 3^^^3) lookup table, duplicates inputs
> > and outputs, no mind, but works as well.
> In this light, the HLT is not really a challenge to the Turing test because
> we're not really talking to the HLT at all. The HLT attracts our attention
> so that we forget about the program which was used to create it. That is
> where the mind actually is.
> Hal
Given present search engines on the net, it should be rather a simple
step to add in a contextual/grammatical comparator. Using a database the
size of the net, maybe even just recording all email or usenet traffic
for a few months to create the database, such an engine could enter in
text read from a person, look up contextually and grammatically relevant
material, as well as with a thesaurus to vary the use of words to
prevent redundancy, and pass as an AI rather handily. Would a 128 bit
search engine be able to do this?

Michael Lorrey ------------------------------------------------------------ President Northstar Technologies Agent Inventor of the Lorrey Drive

Website: Now Featuring: Mikey's Animatronic Factory My Own Nuclear Espionage Agency (MONEA) MIKEYMAS(tm): The New Internet Holiday Transhumans of New Hampshire (>HNH) ------------------------------------------------------------ Transhumanist, Inventor, Webmaster, Ski Guide, Entrepreneur, Artist, Outdoorsman, Libertarian, Arms Exporter-see below. ------------------------------------------------------------ #!/usr/local/bin/perl-0777---export-a-crypto-system-sig-RC4-3-lines-PERL @k=unpack('C*',pack('H*',shift));for(@t=@s=0..255){$y=($k[$_%@k]+$s[$x=$_ ]+$y)%256;&S}$x=$y=0;for(unpack('C*',<>)){$x++;$y=($s[$x%=256]+$y)%256; &S;print pack(C,$_^=$s[($s[$x]+$s[$y])%256])}sub S{@s[$x,$y]=@s[$y,$x]}