From newshub.ccs.yorku.ca!newshub.ccs.yorku.ca!oz Tue Apr  7 23:23:00 EDT 1992
Article 4796 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:4796 sci.philosophy.tech:2461
Newsgroups: comp.ai.philosophy,sci.philosophy.tech
Path: newshub.ccs.yorku.ca!newshub.ccs.yorku.ca!oz
>From: oz@ursa.sis.yorku.ca (Ozan Yigit)
Subject: Re: A rock implements every FSA
In-Reply-To: zeleny@zariski.harvard.edu's message of 18 Mar 92 14: 51:37 GMT
Message-ID: <OZ.92Mar29001111@ursa.sis.yorku.ca>
Sender: news@newshub.ccs.yorku.ca (USENET News System)
Organization: York U. Student Information Systems Project
References: <1992Mar17.224156.9177@bronze.ucs.indiana.edu>
	<1992Mar17.231452.9979@husc3.harvard.edu>
	<1992Mar18.045939.3084@bronze.ucs.indiana.edu>
	<1992Mar18.095140.9984@husc3.harvard.edu>
Date: Sun, 29 Mar 1992 05:11:11 GMT

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

   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.

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

oz


