XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/21/2025 12:34 PM, Bonita Montero wrote:   
   > Am 21.12.2025 um 15:37 schrieb olcott:   
   >> Deciders: Transform finite string inputs by finite string   
   >> transformation rules into {Accept, Reject} values.   
   >>   
   >> When there are no finite string transformation rules that   
   >> transform the input finite string into {Accept, Reject} values   
   >> the conventional view is that the input is undecidable.   
   >>   
   > That's all for the ivory tower you do.   
   > Have you ever done any real programming ?   
   >   
      
   Decades.   
      
   My post recent.   
   https://github.com/plolcott/x86utm   
      
   https://en.wikipedia.org/wiki/NPOESS   
   I was the C++ programmer for Satellite ingest.   
      
   A couple of years of this   
   https://en.wikipedia.org/wiki/ObjectARX   
      
   --   
   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)