Sujet : Re: Any honest person that knows the x86 language can see... predict correctly
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 31. Jul 2024, 09:54:32
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <9598b8ea0c68296492a4756938aefd1cec99df2a@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 30 Jul 2024 16:13:55 -0500 schrieb olcott:
On 7/30/2024 4:07 PM, joes wrote:
Am Tue, 30 Jul 2024 15:05:54 -0500 schrieb olcott:
On 7/30/2024 1:48 PM, Fred. Zwarts wrote:
Op 30.jul.2024 om 17:14 schreef olcott:
On 7/30/2024 9:51 AM, Fred. Zwarts wrote:
Op 30.jul.2024 om 16:21 schreef olcott:
On 7/30/2024 1:52 AM, Mikko wrote:
On 2024-07-29 14:07:53 +0000, olcott said:
I proved otherwise. When the abort code is commented out then it keeps
repeating again and again, thus conclusively proving that is must be
aborted or HHH never halts.
But the abort is not commented out in the running code!
I modified the original code by commenting out the abort and it does
endlessly repeat just like HHH correctly predicted.
Yes, and that modification makes HHH not call itself but a different
program. You'd need to also comment out the outermost abort; then it
wouldn't halt, but if you change HHH to abort, you change all copies
of it at the same time (to keep the recursive call structure).
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.