XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/20/2025 7:32 AM, Richard Damon wrote:   
   > On 12/20/25 8:01 AM, Tristan Wibberley wrote:   
   >> On 19/12/2025 23:01, olcott wrote:   
   >>> Deciders: Transform finite strings by finite string   
   >>> transformation rules into {Accept, Reject}.   
   >>   
   >> I continue to Reject your asymmetric and functionally-loaded labels for   
   >> the classes.   
   >>   
   >>   
   >   
   > That is just one of the few accurate quotations Olcott makes.   
   >   
      
   It was not a quotation. I had to piece that together   
   myself from numerous sources. It took me 22 years to   
   do this.   
      
   > In ONE of the version of defining Deciders, they are determinators of   
   > sentences matching a defined language, and they are to ACCEPT strings   
   > that match that grammar, and REJECT statements that fail to meet the   
   > grammar.   
   >   
   > "Halt Deciders" can be considered to be of that type of deciders, where   
   > the grammar defines that a given string represents a finite computation.   
      
      
   --   
   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)