Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bloom-beacon!oberon!cit-vax!ucla-cs!zen!ucbvax!decvax!linus!philabs!pwa-b!mmintl!franka
From: franka@mmintl.UUCP (Frank Adams)
Newsgroups: sci.philosophy.tech
Subject: Re: Godel (short)
Message-ID: <2474@mmintl.UUCP>
Date: Fri, 9-Oct-87 18:51:49 EDT
Article-I.D.: mmintl.2474
Posted: Fri Oct  9 18:51:49 1987
Date-Received: Mon, 12-Oct-87 21:48:59 EDT
References: <2362@sphinx.uchicago.edu> <1094@vaxb.calgary.UUCP>
Reply-To: franka@mmintl.UUCP (Frank Adams)
Organization: Multimate International, E. Hartford, CT.
Lines: 17

In article <1094@vaxb.calgary.UUCP> radford@calgary.UUCP (Radford Neal) writes:
>[Re: proof of undecidability by unsolvability of the halting problem]
>It also avoids the tricky self-reference stuff, though there's a
>bit of that in the proof of the halting problem itself.

There is, in fact, every bit as much tricky self-reference in the proof of
the unsolvability of the halting problem as there is in Goedel's
incompleteness proof.

These two proofs (undecidability of formal systems and unsolvability of the
halting problem) are so similar that I have always considered them
essentially the same, although I haven't ever tried to see exactly how
parallel they are.
-- 

Frank Adams                           ihnp4!philabs!pwa-b!mmintl!franka
Ashton-Tate          52 Oakland Ave North         E. Hartford, CT 06108