[continued from previous message]   
      
   >>> However, C rules specify what that function must return. If the function   
   >>> returns something other than 5 it violates C rules regardless what it   
   >>> is required to return.   
   >>   
   >> Likewise a halt decider is required to report on the   
   >> behavior that its input finite string actually   
   >> specifies.   
   >   
   > That does not mean anuthing without interpretation rules. Without them   
   > strings are merely uninterpreted strings that don't specify anything.   
   > Also needed is a proof that every conputation is an interpretaion of   
   > some string according to the inpterpretation rules.   
   >   
      
   (a) TMs only transform input finite strings to values   
   using finite string transformation rules.   
      
   (b) There exists no alternative more definitive measure   
   of the behavior that the input to H(P) specifies (within   
   finite string transformation rules) than P simulated by H.   
      
   Here is an insight that LLM Kimi suggested entirely   
   on the basis of the text of my first principles.   
      
   The Universal TM's Illusion: The UTM appears   
   to "simulate another machine," but it's really just   
   interpreting a string as a lookup table for state   
   transitions. The simulation is pure string rewriting.   
      
   > A simple way to specify the interpretaion rules is to select one   
   > universal Turing machine as the reference machine and saty that   
   > the specified interpretation is what the refernce machine does.   
   > The halting problem can then be formulated as:   
   >    the halting decider shall accept if the reference machine with the   
   >        same input halts, and   
   >    the halting decider shall reject if the reference machine with the   
   >        same input runs forever.   
   >   
   >> This remains true even when this finite string input   
   >> defines an interdependency with its decider that   
   >> changes its behavior.   
   >   
   > The behaviour of a Turing macine does not depend on anything other than   
   > its input.   
   >   
      
      
   --   
   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)