Sujet : Re: Simulating Termination Analyzer HHH(DDD) rejects input DDD
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 08. Oct 2024, 15:13:42
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <c68a472aca1b9dc6350da8514d0ff29ddfda6008@i2pn2.org>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 10/8/24 10:02 AM, olcott wrote:
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
thus each of the directly executed HHH emulators that does
return 0 correctly reports the above non-terminating behavior.
No, the program DDD (which is what the subject of the sentence refers to) returns since the HHH(DDD) that it calls returns (since you claim that HHH is correct in doing so)
The emulation of it by HHH just doesn't reach that point, because it is only partial.
You confound the truth of the program with the fantasy of the emulation, because you don't understand the different between truth and knowledge, and thus you don't have either.
Thus, the HHH are incorrect and it shows that
PPPP EEEEE TTTTT EEEEE RRRR
P P E T E R R
P P E T E R R
PPPP EEEEE T EEEEE RRRR
P E T E R R
P E T E R R
P EEEEE T EEEEE R R
OOO L CCC OOO TTTTT TTTTT
O O L C C O O T T
O O L C O O T T
O O L C O O T T
O O L C O O T T
O O L C C O O T T
OOO LLLLL CCC OOO T T
L IIIII EEEEE SSS
L I E S S
L I E S
L I EEEEE SSS
L I E S
L I E S S
LLLLL IIIII EEEEE SSS
AND THINKS THAT IS JUST OK.