XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/22/2025 9:58 PM, Richard Damon wrote:   
   > On 12/22/25 10:54 PM, olcott wrote:   
   >> On 12/22/2025 9:46 PM, Richard Damon wrote:   
   >>> On 12/22/25 10:31 PM, olcott wrote:   
   >>   
   >> function LoopIfYouSayItHalts (bool YouSayItHalts):   
   >>     if YouSayItHalts () then   
   >>         while true do {}   
   >>      else   
   >>         return false;   
   >>   
   >> Does this program Halt?   
   >>   
   >> (Your (YES or NO) answer is to be considered   
   >>   translated to Boolean as the function's input   
   >>   parameter)   
   >>   
   >> Please ONLY PROVIDE CORRECT ANSWERS!   
   >>   
   >>>   
   >>> No, I understand what you are saying, but you are just misusing words.   
   >>>   
   >> I say that any yes/no question lacking a   
   >> incorrect yes/no answer is an incorrect   
   >> polar question.   
   >>   
   >> That is true on the basis of the meaning   
   >> of its words.   
   >>   
   >>   
   >   
   > But isn't a problem of the halting problem.   
   >   
   > EVERY correct input, that is the full representation of an actual   
   > program has a yes or no answer.   
   >   
      
   Every finite string P input to halt decider H   
   has a correct yes or no answer regarding the   
   behavior that its actual input actually specifies.   
      
   All of these inputs have behavior consistent with   
   the behavior of UTM(P) except those inputs that   
   cheat and call their own decider H(P).   
      
   --   
   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)