[continued from previous message]   
      
   >> u can argue about what computing machines actually exist all u want,   
   >> and whether anything actually computes the halting *function*, i'm not   
   >> going to argue over what the halting *function* itself is   
   >>   
   >   
   > Then you get the wrong answer.   
   >   
   > In computability theory and computational complexity   
   > theory, a decision problem is a computational problem   
   > that can be posed as a yes–no question on a set of   
   > input values. https://en.wikipedia.org/wiki/Decision_problem   
   >   
   > Most people have no idea that there is such a thing   
   > as an incorrect question. Because of this they misclassify   
   > incorrect yes/no questions as undecidable decision problem   
   > instances.   
      
   Most people understand that a question is incorrect if it does not ask.   
   They also understand that a question can be correct ever when you don't   
   know the answer.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)