XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: mikko.levanto@iki.fi   
      
   On 13/12/2025 18: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.   
   >   
   > A further elaboration of this comes from the   
   > notion of computable functions and Rice's   
   > Theorem:   
   >   
   > Turing machine deciders compute functions from   
   > *finite string inputs* to {accept, reject} values   
   > according to whether the input has a syntactic   
   > property or specifies a semantic property.   
      
   Every property a Turing machine can compute is a syntactic property.   
   A Turing machine sees only its input. It does not see any neaning of   
   the input. Therefore it has no access to semantic properties. A   
   semantic property can be computed only if it is equivalent to a   
   syntactic property.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)