XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/16/2025 2:39 AM, Tristan Wibberley wrote:   
   > On 15/12/2025 23:23, polcott wrote:   
   >> They are not going to know the nuances of context   
   >> dependent execution. Everyone here denies that it   
   >> exists when I have proven it beyond all possible   
   >> doubt thousands of times.   
   >   
   > It's literally in Turing's paper. He calls them c-machines (choice   
   > machines). One of the state-transitions takes context from outside the   
   > machine.   
   >   
      
   It is a verified fact that HHH(DD)==0 and HHH1(DD)==1   
   are both correct when   
      
   (a) TMs only transform input finite strings to values   
      
   (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.   
      
   --   
   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)