XPost: comp.theory   
   From: polcott333@gmail.com   
      
   On 12/13/2025 12:01 AM, Tristan Wibberley wrote:   
   > On 13/12/2025 05:08, polcott wrote:   
   >> On 12/12/2025 10:36 PM, Tristan Wibberley wrote:   
   >>> On 12/12/2025 04:01, olcott wrote:   
   >>>> Principle 1: Turing machine deciders compute functions   
   >>>> from finite strings to {accept, reject} according to   
   >>>                            ^^^^^^^^^^^^^^^^   
   >>> "some binary classification"   
   >>>   
   >>> however, {accept, reject implies a specific human purpose that is not   
   >>> intrinsic to the decider, so I think it's not appropriate for a general   
   >>> statement.   
   >>>   
   >>>   
   >>   
   >> It seemed to be the generic way to say this.   
   >   
   > It's wrong for the reasons I stated above. It's just a meme for politics.   
   >   
      
   It seems like you are saying that testing whether or   
   not a finite string is a member is a set is mortally wrong.   
      
   --   
   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)