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!alberta!ubc-cs!uw-beaver!micro-heart-of-gold.mit.edu!news.bbn.com!usc!wupost!darwin.sura.net!Sirius.dfn.de!chx400!bernina!neptun Thu Feb 20 15:22:16 EST 1992
Article 3880 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!alberta!ubc-cs!uw-beaver!micro-heart-of-gold.mit.edu!news.bbn.com!usc!wupost!darwin.sura.net!Sirius.dfn.de!chx400!bernina!neptun
e!santas
>From: santas@inf.ethz.ch (Philip Santas)
Newsgroups: comp.ai.philosophy
Subject: Re: Look-up tables
Message-ID: <1992Feb19.200727.26155@neptune.inf.ethz.ch>
Date: 19 Feb 92 20:07:27 GMT
References: <299C3CC6.15601@orion.oac.uci.edu> <1992Feb17.175002.38249@spss.com>
Sender: news@neptune.inf.ethz.ch (Mr News)
Organization: Dept. Informatik, Swiss Federal Institute of Technology (ETH)
Lines: 26
Nntp-Posting-Host: spica.inf.ethz.ch



In article <1992Feb17.175002.38249@spss.com> markrose@spss.com (Mark Rosenfelder) writes:
>
>Suppose there's n words in the language and you can say m words in a lifetime.
>Then the total number of possible conversations is n^^m-- a finite number.
>Very, very big, but finite.


Note that your set of conversations includes silly ones too 
ie. conversations that cannot pass the Turing test.

What about the possible misspellings? These make the number 
of the meaningful conversations much bigger. 


Philip Santas

--------------------------------------------------------------------------------
email: santas@inf.ethz.ch				 Philip Santas
Mail: Dept. Informatik				Department of Computer Science
      ETH-Zentrum			  Swiss Federal Institute of Technology
      CH-8092 Zurich				       Zurich, Switzerland
      Switzerland
Phone: +41-1-2547391
      


