XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/11/2025 3:00 AM, Mikko wrote:   
   > olcott kirjoitti 10.12.2025 klo 15.04:   
   >> On 12/10/2025 3:43 AM, Mikko wrote:   
   >>> polcott kirjoitti 10.12.2025 klo 0.27:   
   >>>> These are finally the long sought words that do   
   >>>> resolve the halting problem to a category error.   
   >>>   
   >>>> Turing machine deciders only compute the mapping from   
   >>>> their [finite string] inputs to an accept or reject   
   >>>> state on the basis that this [finite string] input   
   >>>> specifies or fails to specify a particular semantic   
   >>>> or syntactic property.   
   >>>   
   >>> The above paragraph (acutally just one sentence) does not prove or   
   >>> even say anything about the halting problem.   
   >>   
   >> It is the definition of a decider that the halting   
   >> problem violates.   
   >   
   > Nothing in the problem statement violates any definition. You can't   
   > even quote the alleged "violation".   
   >   
      
   *It has taken me 21 years to derive these first principles*   
      
   When the halting problem requires a halt decider   
   to report on the behavior of a Turing machine this   
   is always a category error because Turing machines   
   only take finite string inputs.   
      
   The corrected halting problem requires a Turing   
   machine decider to report in the behavior that   
   its finite string input specifies.   
      
      
   --   
   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)