Path: utzoo!attcan!uunet!mcsun!ukc!edcastle!lfcs!arshad
From: arshad@lfcs.ed.ac.uk (Arshad Mahmood)
Newsgroups: comp.ai
Subject: Re: Reasons why you don't prove your programs are correct
Message-ID: <1597@castle.ed.ac.uk>
Date: 13 Jan 90 14:00:41 GMT
References: <25711@cup.portal.com> <1449@krafla.rhi.hi.is> <1990Jan11.015531.20996@world.std.com> <9220@medusa.cs.purdue.edu> <1990Jan12.164806.601@utzoo.uucp> <9236@medusa.cs.purdue.edu>
Reply-To: arshad@lfcs.ed.ac.uk (Arshad Mahmood)
Organization: Laboratory for the Foundations of Computer Science, Edinburgh U
Lines: 7

I rather invisibly moved in my last message from the halting
problem to the undecidability theorem of Goedl, only the first line
of my message should be linked to the halting problem the rest should
be taken with regard to Goedl's famous theorem which I see as a much bigger
problem than the Halting Problem.

Ash