Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!philabs!cmcl2!seismo!lll-crg!lll-lcc!qantel!ihnp4!inuxc!pur-ee!pucc-j!pucc-h!ags
From: ags@pucc-h (Dave Seaman)
Newsgroups: net.puzzle
Subject: Re: New Puzzle (honestly...) [CLARIFICATION, no spoiler]
Message-ID: <2664@pucc-h>
Date: Mon, 24-Feb-86 09:29:58 EST
Article-I.D.: pucc-h.2664
Posted: Mon Feb 24 09:29:58 1986
Date-Received: Wed, 26-Feb-86 21:02:32 EST
References: <423@watdragon.UUCP>
Reply-To: ags@pucc-h.UUCP (Dave Seaman)
Organization: Purdue University Computing Center
Lines: 15

In article <423@watdragon.UUCP> gawilson@watdragon.UUCP (Graham Wilson) writes:
>Consider a machine which is used to create true sentences (for example,
>the sentence "A dog is a dog" is true).  If the machine is "complete",
>then it could, given time, produce the set of ALL true sentences.  If the
		^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>machine is "consistent", then all the sentences that it produces will be
>true.
>
>Question:  Can such a machine exist (even in theory)?

The machine cannot produce the set of ALL true sentences unless that set
is finite.  I think you meant to say any given true sentence would eventually
be produced by the machine.
-- 
Dave Seaman	  					pur-ee!pucc-h!ags