Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!ccu.umanitoba.ca!herald.usask.ca!alberta!ubc-cs!uw-beaver!milton!dali.cs.montana.edu!uakari.primate.wisc.edu!sdd.hp.com!wuarchive!uunet!mcsun!ukc!slxsys!ibmpcug!mantis!mathew
From: mathew@mantis.co.uk (mathew)
Newsgroups: comp.lang.misc
Subject: Halting Problem Solved!  Film at 11!  (Was Re: definitions)
Message-ID: <R73812w164w@mantis.co.uk>
Date: 30 Apr 91 15:21:38 GMT
References: <333124@socrates.umd.edu>
Organization: Mantis Consultants, Cambridge. UK.
Lines: 16

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?


mathew