From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rutgers!hsdndev!husc-news.harvard.edu!zariski!zeleny Tue Apr  7 23:22:49 EDT 1992
Article 4775 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:4775 sci.philosophy.tech:2449
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rutgers!hsdndev!husc-news.harvard.edu!zariski!zeleny
>From: zeleny@zariski.harvard.edu (Mikhail Zeleny)
Newsgroups: comp.ai.philosophy,sci.philosophy.tech
Subject: Re: A rock implements every FSA
Message-ID: <1992Mar28.101509.10368@husc3.harvard.edu>
Date: 28 Mar 92 15:15:08 GMT
References: <1992Mar18.045939.3084@bronze.ucs.indiana.edu> <1992Mar18.095140.9984@husc3.harvard.edu> <6477@skye.ed.ac.uk>
Organization: Dept. of Math, Harvard Univ.
Lines: 39
Nntp-Posting-Host: zariski.harvard.edu

In article <6477@skye.ed.ac.uk> 
jeff@aiai.ed.ac.uk (Jeff Dalton) writes:

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

>>In article <1992Mar18.045939.3084@bronze.ucs.indiana.edu>
>>chalmers@bronze.ucs.indiana.edu (David Chalmers) writes: 

DC:
>>>Therefore the claim that the system in question implements the FSA is
>>>groundless.  At best, it implements a "trace" of a particular run
>>>of the FSA, as Joseph O'Rourke nicely put it.

MZ:
>>This is easy: first, you interpret the states of Putnam's automaton as
>>ordered pairs <state, input> of a FSA (cf. the relevant comments on p.124);
>>follow this by running through enough input/state combinations to exhaust
>>the finite combinatorial possibilities afforded by the machine's table.
>>Finally, you do the mapping.  In this way, there will be no counterfactual
>>possibilities left unaccounted for.

JD:
>This seems reasonable to me, and I think it answers Chalmer's
>objection.

Same here.  I'm afraid that it won't stop him from repeating it all the same.

`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'
: Qu'est-ce qui est bien?  Qu'est-ce qui est laid?         Harvard   :
: Qu'est-ce qui est grand, fort, faible...                 doesn't   :
: Connais pas! Connais pas!                                 think    :
:                                                             so     :
: Mikhail Zeleny                                                     :
: 872 Massachusetts Ave., Apt. 707                                   :
: Cambridge, Massachusetts 02139           (617) 661-8151            :
: email zeleny@zariski.harvard.edu or zeleny@HUMA1.BITNET            :
:                                                                    :
'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`


