Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!crdgw1!uunet!mcsun!ukc!slxsys!ibmpcug!mantis!mathew
From: mathew@mantis.co.uk (CNEWS MUST DIE!)
Newsgroups: comp.lang.misc
Subject: Re: Halting Problem Solved!  Film at 11!  (Was Re: definitions)
Message-ID: <a8uk215w164w@mantis.co.uk>
Date: 7 May 91 12:57:57 GMT
References: <30040@dime.cs.umass.edu>
Organization: Mantis Consultants, Cambridge. UK.
Lines: 17

yodaiken@chelm.cs.umass.edu (victor yodaiken) writes:
> In article <R73812w164w@mantis.co.uk> mathew@mantis.co.uk (mathew) writes:
> >Last I heard, the Halting Problem was still insoluble.
> >
> >Is there some new theoretical result you'd like to share with us?
> 
> The halting problem does not really apply to actual programming languages
> (i.e. those that are compiled or interpreted into machine code).

I see. So you are claiming that it is possible to write a program to predict
whether a given piece of code will terminate or not, for any compiled or
interpreted programming language?


mathew