Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!bu.edu!m2c!risky.ecs.umass.edu!dime!yodaiken
From: yodaiken@chelm.cs.umass.edu (victor yodaiken)
Newsgroups: comp.lang.misc
Subject: Re: Halting Problem Solved!  Film at 11!  (Was Re: definitions)
Message-ID: <30040@dime.cs.umass.edu>
Date: 3 May 91 10:48:14 GMT
References: <333124@socrates.umd.edu> <R73812w164w@mantis.co.uk>
Sender: news@dime.cs.umass.edu
Reply-To: yodaiken@chelm.cs.umass.edu (victor yodaiken)
Organization: University of Massachusetts, Amherst
Lines: 20

In article <R73812w164w@mantis.co.uk> mathew@mantis.co.uk (mathew) writes:
>rockwell@socrates.umd.edu (Raul Rockwell) writes:
>> David Gudeman  []
>> [] Strong typing: the feature that an operation cannot return an
>> [] undefined result because it did not know the typing of one of its
>> [] operands.
>> 
>> Strong typing also means that the function will terminate.
>
>I beg your pardon?!
>
>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).
The sooner computer scientists begin to understand the actual meaning
of the undecidability and complexity results, the better off the filed
will be.