From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!think.com!yale.edu!jvnc.net!darwin.sura.net!haven.umd.edu!umd5!fermat!orourke Tue Mar 24 09:56:46 EST 1992
Article 4549 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!think.com!yale.edu!jvnc.net!darwin.sura.net!haven.umd.edu!umd5!fermat!orourke
>From: orourke@fermat.cs.jhu.edu (Joseph O'Rourke)
Newsgroups: comp.ai.philosophy
Subject: Re: A rock implements every FSA
Message-ID: <11353@cs.jhu.edu>
Date: 18 Mar 92 12:41:09 GMT
Reply-To: orourke@sophia.smith.edu (Joseph O'Rourke)
Followup-To: comp.ai.philosophy
Organization: Smith College, Northampton, MA, US
Lines: 13

In article <1992Mar18.014416.9980@husc3.harvard.edu> 
	zeleny@zariski.harvard.edu (Mikhail Zeleny) writes:

[Re Putnam's rock theorem]:
>Nonsense.  As I've demonstrated in the previous posting, Putnam considers
>every possible state of the automaton, not just a particular trace thereof.

	I don't see that you have demonstrated it (but I may not have
received that posting yet), and I definitely don't see that Putnam
considers every possible state of the automaton.  He says, "let us
suppose the table calls of the automaton to go through the following
sequence of states..." (p. 122).  This is precisely a trace of the
FSA.


