Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!udel!haven.umd.edu!socrates.umd.edu!socrates!rockwell
From: rockwell@socrates.umd.edu (Raul Rockwell)
Newsgroups: comp.lang.misc
Subject: Re: Halting Problem Solved! Film at 11!
Message-ID: <ROCKWELL.91May10084151@socrates.umd.edu>
Date: 10 May 91 13:41:51 GMT
References: <3007@optima.cs.arizona.edu> <STEPHEN.91May10011311@estragon.uchicago.edu>
Sender: rockwell@socrates.umd.edu (Raul Rockwell)
Organization: Traveller
Lines: 10
In-Reply-To: stephen@estragon.uchicago.edu's message of 10 May 91 07: 13:11 GMT

Stephen P Spackman:
   Oh, yes. Correct me if I'm wrong, but it seems to me that they are
   not adequate to THEORETICAL purposes like the standard
   incompleteness/inconsistency proofs.

Which is not at all to say that a computer is complete -- if it was
you wouldn't have to worry about being able to write programs that can
not run because of machine limits :-)

Raul Rockwell