XPost: comp.theory   
   From: F.Zwarts@HetNet.nl   
      
   Op 20.jul.2024 om 22:29 schreef olcott:   
   > On 7/20/2024 3:10 PM, Richard Damon wrote:   
   >> On 7/20/24 4:02 PM, olcott wrote:   
   >>> On 7/20/2024 2:36 PM, Fred. Zwarts wrote:   
   >>>> Op 20.jul.2024 om 21:09 schreef olcott:   
   >>>>> On 7/20/2024 2:00 PM, Fred. Zwarts wrote:   
   >>>>>> Op 20.jul.2024 om 17:28 schreef olcott:   
   >>>>>>> void DDD()   
   >>>>>>> {   
   >>>>>>>    HHH(DDD);   
   >>>>>>> }   
   >>>>>>>   
   >>>>>>> int main()   
   >>>>>>> {   
   >>>>>>>    DDD();   
   >>>>>>> }   
   >>>>>>>   
   >>>>>>> (a) Termination Analyzers / Partial Halt Deciders must halt   
   >>>>>>> this is a design requirement.   
   >>>>>>>   
   >>>>>>> (b) Every simulating termination analyzer HHH either   
   >>>>>>> aborts the simulation of its input or not.   
   >>>>>>>   
   >>>>>>> (c) Within the hypothetical case where HHH does not abort   
   >>>>>>> the simulation of its input {HHH, emulated DDD and executed DDD}   
   >>>>>>> never stop running.   
   >>>>>>>   
   >>>>>>> This violates the design requirement of (a) therefore HHH must   
   >>>>>>> abort the simulation of its input.   
   >>>>>>   
   >>>>>> And when it aborts, the simulation is incorrect. When HHH aborts   
   >>>>>> and halts, it is not needed to abort its simulation, because it   
   >>>>>> will halt of its own.   
   >>>>>   
   >>>>> So you are trying to get away with saying that no HHH   
   >>>>> ever needs to abort the simulation of its input and HHH   
   >>>>> will stop running?   
   >>>>>   
   >>>>   
   >>>> No, you try to get away with saying that a HHH that is coded to   
   >>>> abort and halt, will never stop running, only because you are   
   >>>> dreaming of *another* HHH that does not abort.   
   >>>>   
   >>>   
   >>> *You know that I didn't say anything like that*   
   >>>   
   >>> Unless I refer to the infinite set of every possible   
   >>> HHH my reviewers try to get away with saying that I am   
   >>> referring to the wrong HHH.   
   >>>   
   >>> void DDD()   
   >>> {   
   >>>    HHH(DDD);   
   >>>    return;   
   >>> }   
   >>>   
   >>> DDD correctly simulated by pure function HHH cannot   
   >>> possibly reach its own return instruction.   
   >>>   
   >>>   
   >>   
   >> And the problem you ignore is that each HHH is given the DDD that   
   >> calls itself, and not some other HHH, and thus you can't look at the   
   >> other   
   >   
   > Yet again trying to get away with saying that when every element   
   > of an infinite set cannot reach its return instruction that some   
   > of these elements still reach their return instruction.   
      
   No, you are trying to get away with saying that, although all variants   
   of HHH are incorrect, the infinite set of them is correct.   
      
   The fact that none of them can reach its own return instruction, proves   
   that these simulations are incorrect.   
   Other simulations are shown, which prove that it is possible for a   
   simulation to reach the return of a HHH that aborts.   
   But HHH cannot possibly reach the return of its *own* simulation.   
   So, you are proving that HHH cannot possibly simulate itself correctly.   
      
      
   DDD is a misleading and unneeded complication. It is easy to eliminate DDD:   
      
           int main() {   
             return HHH(main);   
           }   
      
   This has the same problem. This proves that the problem is not in DDD,   
   but in HHH, which halts when it aborts the simulation, but it decides   
   that the simulation of itself does not halt.   
   It shows that HHH cannot possibly simulate itself correctly.   
      
   HHH is simply unable to decide about finite recursions.   
      
   void Finite_Recursion (int N) {   
      if (N > 0) Finite_Recursion (N - 1);   
   }   
      
   It decides after N recursions that there is an infinite recursion, which   
   is incorrect.   
      
   Olcott's HHH is programmed to abort the simulation after N cycles of   
   recursive simulations. Therefore, it is incorrect to abort the   
   simulation of HHH when the simulated HHH has performed only N-1 cycles,   
   because that changes the behaviour of HHH.   
   Since the simulated HHH always runs one cycle behind the simulating HHH,   
   it is clear that HHH can never simulate enough cycles for a correct   
   simulation, as is required by the x86 language.   
   Therefore, the simulation is incorrect according to the criteria olcott   
   stipulated.   
   The conclusion is simple:   
   HHH cannot possibly simulate itself correctly.   
      
   No matter how much olcott wants it to be correct, or how many times   
   olcott repeats that it is correct, it does not change the fact that such   
   a simulation is incorrect, because it is unable to reach the end.   
   Olcott's own claim that the simulated HHH does not reach its end   
   confirms it. The trace he has shown also proves that HHH cannot reach   
   the end of its own simulation. So, his own claims prove that it is true   
   that HHH cannot possibly simulate itself up to the end, which makes the   
   simulation incorrect.   
      
   Sipser would agree that this incorrect simulation cannot be used to   
   detect a non-halting behaviour.   
      
   Olcott does not know how to point to an error in this explanation, but   
   prefers to ignore it. He even consistently removes it from the   
   citations. So, I will repeat it, until either an error is found, or   
   olcott admits that HHH cannot possibly simulate itself correctly.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)