[continued from previous message]   
      
   >>>>>>> So, it seems you can't point out where I aaid something wrong,   
   >>>>>>> just repeated the statement which I showed you what it means.   
   >>>>>>>   
   >>>>>>   
   >>>>>> Maybe formal correctness is too overwhelming.   
   >>>>>   
   >>>>> Yes, it seems to have overwhelmed you.   
   >>>>>   
   >>>>> You didn't respond to my explanation, so I guess you are just   
   >>>>> admitting that you removed my CORRECT description and agree to it.   
   >>>>>   
   >>>>>>   
   >>>>>> (1) Turing machine deciders: Transform finite string   
   >>>>>> inputs by finite string transformation rules into   
   >>>>>> {Accept, Reject} values.   
   >>>>>>   
   >>>>>> (2) Any required value that cannot be derived by applying   
   >>>>>> finite string transformation rules to finite string inputs   
   >>>>>> is outside of the scope of computation.   
   >>>>>>   
   >>>>>   
   >>>>> And since the halting behavior of the encoded P was derived by such   
   >>>>> a transformation, it was correct and you ADMIT you have LIED.   
   >>>>>   
   >>>>   
   >>>> Transform finite string   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>>   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>>   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>> inputs   
   >>>>   
   >>>> by finite string transformation rules into   
   >>>> {Accept, Reject} values.   
   >>>   
   >>> Right, which I showed, but apparently due to your ignorance, you   
   >>> can't understand.   
   >>>   
   >>   
   >> P simulated by H derives recursive simulation   
   >   
   > But only finitely, for this H, then it halts.   
   >   
      
   (1) Turing machine deciders: Transform finite string   
   inputs by finite string transformation rules into   
   {Accept, Reject} values   
      
   P simulated by H cannot possibly reach its own   
   final halt state Dumbo.   
      
      
      
   --   
   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)