XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/22/2025 9:05 PM, Richard Damon wrote:   
   > On 12/22/25 7:01 PM, olcott wrote:   
   >> On 6/23/2004 9:34 PM, Peter Olcott wrote:   
   >>>>> PREMISES:   
   >>>>> (1) The Halting Problem was specified in  such a way that a solution   
   >>>>> was defined to be impossible.   
   >>>>   
   >>>> No, it wasn't. It's a perfectly legitimate mathematical problem. It's   
   >>>> not even obvious that it wouldn't have an effective solution at first   
   >>>> sight.   
   >>>   
   >>> 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!   
   >>>   
   >>>   
   >>   
   >> When a human answers that question both answers are   
   >> the wrong answer. Thus exactly the same as this question:   
   >> Is this sentence true or false: "This sentence is not true."   
   >>   
   >>   
   >   
   > And of course the correct answer is:   
   >   
      
   Any yes/no question where both yes and no are   
   the wrong answer is an incorrect polar question.   
      
   So even 21 years ago I knew that the halting   
   problem was fundamentally incorrect.   
      
   Here is the link to that original post.   
   https://groups.google.com/g/sci.logic/c/Hs78nMN6QZE/m/ID2rxwo__yQJ   
      
      
   --   
   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)