XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/14/2025 6:51 AM, Tristan Wibberley wrote:   
   > On 13/12/2025 19:50, olcott wrote:   
   >> On 12/13/2025 1:33 PM, Tristan Wibberley wrote:   
   >>> On 13/12/2025 16:44, olcott wrote:   
   >   
   >>>> Turing machine Deciders are a subset of this   
   >>>> where the value indicates accept or reject a   
   >>>> finite string by some criterion measure.   
   >>>   
   >>> I continue to reject the use of "accept" and "reject" here. And I also   
   >>> reject the use of "indicates" wrt to them.   
   >>>   
   >>   
   >> My goal is to have accepted definitions as my only basis.   
   >   
   > Oh! I just noticed it's a new statement with "by some criterion measure"   
   > which makes it excellent. I retract my rejection.   
   >   
      
   Good.   
      
   This is my first post on the halting Problem   
   https://groups.google.com/g/sci.logic/c/V7wzVvx8IMw/m/ggPE6a-60cUJ   
      
   I worked for 15 years mostly on the basis of intuition.   
   Then 2 more years creating fully operational code. Then   
   3 years of discussing this code.   
      
   Now I am finally getting around to anchoring these   
   intuitions and my working code in standard definitions.   
      
   My current working code.   
   https://github.com/plolcott/x86utm/blob/master/Halt7.c   
      
   I had to refrain from learning the standard definitions   
   before now or they would have boxed me into the standard   
   views.   
      
   My insights are entirely from slight nuances of meaning   
   that are abstracted away in the standard definitions.   
      
   I had to carefully reverse-engineer the exact details   
   of what was actually happening before I could see what   
   nuances of meaning were being left out. Initially I   
   had to use my own non-standard terminology to do this.   
      
   This is my first principle   
   All Turing machines only compute the mapping   
   from input finite strings to some value.   
      
   Second Principle   
   Turing machine Deciders are a subset of this   
   where the value indicates accept or reject a   
   finite string by some criterion measure.   
      
   Third Principle (rough draft)   
   Turing machine halt deciders only report on   
   the behavior of Turing Machines through the   
   proxy of finite string inputs. The behavior   
   specified by the finite string input overrules   
   any other behavior.   
      
   >   
   > [snip]   
   >> This is a grammatically correct English sentence:   
   >> "flpm erf09-25k (*&j^*&NJ*&jkNef", reject.   
   >   
   >   
   > That's impertinent.   
   >   
   >   
      
   Sometimes required to put things in sharp focus.   
   I just proved that reject is a valid operation.   
      
      
   --   
   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)