Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/17/84; site link.UUCP Path: utzoo!watmath!clyde!cbosgd!ihnp4!houxm!link!msb From: msb@link.UUCP (Mike S. Balenger x8789) Newsgroups: net.puzzle Subject: truth machine clarification**2 Message-ID: <394@link.UUCP> Date: Mon, 3-Mar-86 18:42:07 EST Article-I.D.: link.394 Posted: Mon Mar 3 18:42:07 1986 Date-Received: Wed, 5-Mar-86 03:54:33 EST References: <423@watdragon.UUCP> <2664@pucc-h> Organization: AT&T Bell Laboratories, Holmdel Lines: 26 > 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 You can't even guarantee that any given true sentence would eventually be produced by the machine unless the set is finite. -- ---------------------------------------------------------------------- Michael S. Balenger (201) 949-8789 AT&T Bell Labs Crawfords Corner Road ihnp4!link!msb Holmdel, NJ 07733