XPost: sci.math, sci.logic, comp.theory   
   From: polcott333@gmail.com   
      
   On 12/20/2025 10:18 AM, Python wrote:   
   > Le 20/12/2025 à 14:42, olcott a écrit :   
   >> On 12/20/2025 7:29 AM, Python wrote:   
   >>> Le 20/12/2025 à 14:09, olcott a écrit :   
   >>>> Subject: Turing machines can not run other Turing machines   
   >>>   
   >>> Of course they can.   
   >>>   
   >>> https://en.wikipedia.org/wiki/Universal_Turing_machine   
   >>   
   >> That is not a Turing machine running another Turing machine.   
   >   
   > It is.   
   >   
   >> That is a Turing machine applying finite string transformations   
   >> to an input finite string.   
   >   
   > It is "running another Turing machine" by "applying finite string   
   > transformations   
   > to an input finite string".   
   >   
   > Your argument is ridiculous. It is similar to:   
   >   
      
   It turns out that simulating the machine description   
   of a Turing machine is exactly equivalent to directly   
   running the underlying machine ALMOST all the time.   
      
   In the very rare cases where they vary one overrules   
   the other on this basis:   
      
   Deciders: Transform finite strings by finite string   
   transformation rules into {Accept, 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)