[continued from previous message]   
      
   >>> i hang out there tho, i have my own reasons for posting this there   
   >>>   
   >>   
   >> Theory of computation issues are disrespectful   
   >> spam to that group that violate Buddhist compassion.   
   >>   
   >> I was a long time poster to alt.zen. I still   
   >> have 8969 messages posted there since 2005.   
   >>   
   >> Also my great grand uncle Henry Steel Olcott   
   >> was a very famous Buddhist.   
   >>   
   >>>>   
   >>>> int sum(int x, int y){return x + y;}   
   >>>> sum(3,2) should return 5 and it is incorrect   
   >>>> to require sum(3,2) to return the sum of 5+6.   
   >>>>   
   >>>   
   >>> 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.   
   >   
      
   Asking a man that has never been married:   
   Did you stop beating your wife?   
   Both yes and no affirm the false presupposition   
   thus are incorrect answers, making the question   
   itself incorrect.   
      
   Any yes/no question lacking a correct yes/no   
   answer is an incorrect polar question.   
      
   Math and computer science incorrectly construe   
   incorrect questions as undecidable decision   
   problem instances.   
      
   --   
   Copyright 2025 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)