[continued from previous message]   
      
   >> Yes, the Halting Problem IS a decision problem, and thus has only a   
   >> binary result.   
   >>   
   >> A result that can't always be achieved by a finite deterministic   
   >> algrotihm in finite steps, and thus the problem is uncomputable.   
   >>   
   >> Which doesn't make it invalid, just impossible to make a full Halt   
   >> Decider that always gives the right answer.   
   >>   
   >>   
   >   
   >   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)