From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!utgpu!cs.utexas.edu!asuvax!ncar!hsdndev!husc-news.harvard.edu!zariski!zeleny Tue Apr  7 23:23:04 EDT 1992
Article 4802 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:4802 sci.philosophy.tech:2463
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!utgpu!cs.utexas.edu!asuvax!ncar!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: <1992Mar29.050810.10415@husc3.harvard.edu>
Date: 29 Mar 92 10:08:09 GMT
References: <1992Mar18.045939.3084@bronze.ucs.indiana.edu> <1992Mar18.095140.9984@husc3.harvard.edu> <OZ.92Mar29001111@ursa.sis.yorku.ca>
Organization: Dept. of Math, Harvard Univ.
Lines: 33
Nntp-Posting-Host: zariski.harvard.edu

In article <OZ.92Mar29001111@ursa.sis.yorku.ca> 
oz@ursa.sis.yorku.ca (Ozan Yigit) writes: 

>zeleny@zariski.harvard.edu (Mikhail Zeleny) writes:

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.

OY:
>There seems to be an infinite number of mappings. Exactly which
>one did you have in mind? ;-)

A finite bound on input length is easily justified by certain practical
considerations.

>oz

`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'
: 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            :
:                                                                    :
'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`'`


