XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/13/2025 1:33 PM, Tristan Wibberley wrote:   
   > On 13/12/2025 16:44, olcott wrote:   
   >> At the most fundamental level:   
   >> All Turing machines only compute the mapping   
   >> from input finite strings to some value.   
   >>   
   >> Turing machine Deciders are a subset of this   
   >> where the value indicates accept or reject a   
   >> finite string by some criterion measure.   
   >   
   > I continue to reject the use of "accept" and "reject" here. And I also   
   > reject the use of "indicates" wrt to them.   
   >   
      
   My goal is to have accepted definitions as my only basis.   
      
   > There's no good reason to suppose this is about grammars and strings   
   > rather than propositions about programs. To the extent that they might   
   > be isomorphic you need to introduce the notion of grammars and string   
   > acceptance by them to give "accept" and "reject" and "indicates" the   
   > correct meaning.   
   >   
   >   
      
   This is a grammatically correct English sentence:   
   "flpm erf09-25k (*&j^*&NJ*&jkNef", reject.   
      
      
   --   
   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)