XPost: comp.theory, comp.lang.c++   
   From: polcott333@gmail.com   
      
   On 12/10/2025 5:11 PM, wij wrote:   
   > On Wed, 2025-12-10 at 17:03 -0600, polcott wrote:   
   >> On 12/10/2025 4:58 PM, wij wrote:   
   >>> On Wed, 2025-12-10 at 16:43 -0600, polcott wrote:   
   >>>> When the halting problem requires a halt decider   
   >>>> to report on the behavior of a Turing machine   
   >>>> this is always a category error.   
   >>>>   
   >>>> The corrected halting problem requires a Turing   
   >>>> machine decider to report in the behavior that   
   >>>> its finite string input specifies.   
   >>>   
   >>> If you honestly admit you are solving POO Problem, everything is fine.   
   >>>   
   >>   
   >> *It has take me 21 years to boil it down to this*   
   >>   
   >> When the halting problem requires a halt decider   
   >> to report on the behavior of a Turing machine this   
   >> is always a category error.   
   >>   
   >> The corrected halting problem requires a Turing   
   >> machine decider to report in the behavior that   
   >> its finite string input specifies.   
   >   
   > It looks you play blind block my other replies again.   
      
   My about two paragraphs sums the basis of how   
   the halting problem itself is flat out incorrect.   
      
   Nothing about the halting problem can possibly   
   be more significant than this.   
      
   --   
   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   
   for correct reasoning.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)