Sujet : Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 16. May 2025, 16:50:06
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1007mre$3qb7l$21@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
User-Agent : Mozilla Thunderbird
On 5/16/2025 10:38 AM, joes wrote:
Am Sun, 11 May 2025 19:51:27 -0500 schrieb olcott:
If on a real system an input tried to fool the denial-of-service-attack
detector IT WOULD FAIL.
Prior to my work a denial-of-service-attack detector WOULD FAIL. It
would not know to reject DDD.
No, the goal is not to make HHH run forever. It would not fail at
terminating contrary to HHH's result.
The goal of the counter-example input to the HP
proofs has always been to make halting undecidable
on this input. A simulating termination analyzer
fixes that.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer