Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!asuvax!ukma!usenet.ins.cwru.edu!eagle!data.nas.nasa.gov!sun418.nas.nasa.gov!truesdel From: truesdel@nas.nasa.gov (David A. Truesdell) Newsgroups: comp.lang.misc Subject: Re: Halting Problem Solved! Film at 11! (Was Re: definitions) Message-ID: Date: 3 May 91 20:05:55 GMT References: <333124@socrates.umd.edu> <30040@dime.cs.umass.edu> Sender: news@nas.nasa.gov Organization: NAS Program, NASA Ames Research Center, Moffett Field, CA Lines: 20 yodaiken@chelm.cs.umass.edu (victor yodaiken) 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). >The sooner computer scientists begin to understand the actual meaning >of the undecidability and complexity results, the better off the filed >will be. Care to share the reason why the halting problem does not apply? Or, is this just some handwaving by someone who really doesn't understand what the halting problem means. -- T.T.F.N., dave truesdell (truesdel@nas.nasa.gov) Ita erat quando hic adventi.