XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/17/2025 5:00 AM, Tristan Wibberley wrote:   
   > On 17/12/2025 03:36, olcott wrote:   
   >> Turing Machines only transform finite string inputs into values.   
   >>   
   >   
   > No: "only"-ambiguity again.   
   > No: non-elementary wrt. "values".   
   >   
   > Maybe "finite string inputs" ought to be "expressions on finite segments   
   > of tapes" if you're trying to talk about machines as Turing did in 1939   
   > and physical ones at that rather than about expositions in C that are of   
   > derived concepts.   
   >   
      
   I am trying precisely define the exact essence   
   of the architecture of Turing Machine computation.   
   Things like writing to a tape are not of the essence.   
      
   Things that are outside their scope:   
   (a) examining strings that are not inputs   
   (b) directly executing other Turing Machines   
   (c) Taking other actual Turing machines as inputs   
      
   Turing machine halt deciders transform input   
   finite strings into halt status values by applying   
   finite string transformations to inputs.   
      
      
   --   
   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)