XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: flibble@red-dwarf.jmc.corp   
      
   On Sun, 21 Dec 2025 17:19:50 -0600, olcott wrote:   
      
   > On 6/12/2024 11:50 AM, olcott wrote:   
   >>   
   >> When we compute the mapping from the input to H(D,D) this must apply a   
   >> set of finite string transformation rules (specified by the semantics   
   >> of the x86 language) to this input.   
   >>   
   >>   
   > The above is my first use applying this term to a halt decider.   
   >   
   > My first documented use of the term "finite string transformation rules"   
   > https://groups.google.com/g/comp.theory/c/TFXhleKnHmY/m/lqhDVnvUBgAJ   
   >   
   > *This is the basis for my unique definition of a generic decider*   
   >   
   > Deciders: Transform finite string inputs by finite string transformation   
   > rules into {Accept, Reject} values.   
      
   D halts, H is not a halt decider.   
      
   /Flibble   
      
      
      
   --   
   meet ever shorter deadlines, known as "beat the clock"   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)