Re: Simulating Termination Analyzer HHH(DDD) rejects input DDD

On 2024-10-08 14:02:45 +0000, olcott said:

On 10/8/2024 8:50 AM, Mikko wrote:

On 2024-10-07 20:29:33 +0000, olcott said:
 

*Simulating Termination Analyzer HHH(DDD) rejects input DDD*
HHH is an emulating termination analyzer that takes the machine
address of DDD as input then emulates the x86 machine language
of DDD until a non-terminating behavior pattern is recognized.
 *HHH recognizes this pattern when HHH emulates itself emulating DDD*
 void DDD()
{
   HHH(DDD);
   return;
}

 The above code shows that if HHH(DDD) rejects then DDD halts, which
means that no program that rejects DDD is a halting decider.
 

 DDD emulated by each corresponding HHH that can possibly
exist never returns

That does not make sense without a definition of "each corresponding
HHH that can possibly exist".

thus each of the directly executed  HHH emulators that does
return 0 correctly reports the above non-terminating behavior.

If HHH returns 0 to DDD then DDD halts, proving that HHH is not a
halt decider.
If HHH returns 1 to DDD then DDD halts, failing to prove that HHH is
not a halt decider.
If HHH does not return to DDD it is not a halt decider.
--
Mikko