Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdragon.UUCP
Path: utzoo!watmath!watnot!watdragon!gawilson
From: gawilson@watdragon.UUCP (Graham Wilson)
Newsgroups: net.puzzle
Subject: Re:  New Puzzle (Clarification by Author)
Message-ID: <478@watdragon.UUCP>
Date: Thu, 27-Feb-86 20:55:08 EST
Article-I.D.: watdrago.478
Posted: Thu Feb 27 20:55:08 1986
Date-Received: Fri, 28-Feb-86 22:06:41 EST
Reply-To: gawilson@watdragon.UUCP (Graham Wilson)
Organization: U of Waterloo, Ontario
Lines: 15

With respect to the puzzle I recently submitted concerning the
Sentence-producing machine, there is something I wish to clarify:

The comment that the machine is complete if, given time, it could
produce all true sentences should have been the machine is complete
if there does not exist a true sentence which the machine could not
produce.  The original wording presents a problem if the number of
true sentences is uncountably infinite (there is no problem if the
# is countably infinite).  My thanks to Rico Mariani for pointing this
out.

Sorry for the inconvenience.

Graham Wilson
gawilson@watdragon