XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/20/2025 6:42 PM, Richard Damon wrote:   
   > On 12/20/25 7:03 PM, olcott wrote:   
   >> On 12/20/2025 6:00 PM, Richard Damon wrote:   
   >>> On 12/20/25 6:47 PM, olcott wrote:   
   >>>> On 12/20/2025 5:34 PM, Richard Damon wrote:   
   >>>>> On 12/20/25 6:28 PM, olcott wrote:   
   >>>>>> 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.   
   >>>>>   
   >>>>> Gee, that should be something you could have found in just a few   
   >>>>> minutes of searching. It is basic material in Computation Theory in   
   >>>>> the introductory material on Deciders.   
   >>>>>   
   >>>>   
   >>>> They never ever phrase it exactly that way.   
   >>>> Look for yourself.   
   >>>   
   >>>   
   >>> Really? With a very quick search I get to:   
   >>>   
   >>> https://sites.radford.edu/~nokie/classes/420/Chap3-Langs.html   
   >>>   
   >>> Which begins:   
   >>>   
   >>> Question: If a TM is given a string, what can happen to the computation?   
   >>>   
   >>> Answer: The machine can either   
   >>> 1. Accept the string (ie enter the Accept state and halt the   
   >>> computation)   
   >>>   
   >>> 2. Reject the string (ie enter the Reject state and halt the   
   >>> computation)   
   >>>   
   >>> 3. Enter an Infinite Loop (ie the computation never ends)   
   >>>   
   >>> Thus introducing the idea that machines can accept or reject the input.   
   >>>   
   >>>   
   >>   
   >> Where on Earth can you find that this must be   
   >> anchored in finite string transformation rules?   
   >>   
   >   
   > Because that is what Computations do.   
      
   I know that, you know that. What computer science textbook says that?   
      
   >   
   > And, if you aren't fixing your model to Turing Machines, it doesn't need   
   > to be finite strings, but can be other types of representations.   
      
   How so?   
      
   --   
   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)