Sujet : Re: Hypothetical possibilities --- Complete Proof
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 01. Aug 2024, 17:11:56
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <9d2f2d8a1bf9614b9d8ab56bd500a78075b365e4@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Thu, 01 Aug 2024 09:30:00 -0500 schrieb olcott:
On 8/1/2024 9:23 AM, Fred. Zwarts wrote:
Op 01.aug.2024 om 15:29 schreef olcott:
On 8/1/2024 8:12 AM, Fred. Zwarts wrote:
Op 01.aug.2024 om 14:20 schreef olcott:
On 8/1/2024 3:10 AM, Fred. Zwarts wrote:
Op 31.jul.2024 om 23:23 schreef olcott:
On 7/31/2024 3:01 PM, Fred. Zwarts wrote:
Op 31.jul.2024 om 17:14 schreef olcott:
On 7/31/2024 3:44 AM, Fred. Zwarts wrote:
Op 31.jul.2024 om 06:09 schreef olcott:
The trace stops and hides what happens when 000015d2 is called.
Olcott is hiding the conditional branch instructions in the
recursion.
These next lines conclusively prove that DDD is being correctly
emulated by HHH after DDD calls HHH(DDD).
It also shows that HHH when simulating itself, does not reach the end
of its own simulation.
If you weren't a clueless wonder you would understand that DDD correctly
emulated by HHH including HHH emulating itself emulated DDD has no end
of correct emulation.
It does if the simulated HHH aborts, but its simulating copy preempts
that. Indeed, it has no choice, but if it didn't abort, the simulation
wouldn't abort either. Therefore it can't simulate itself.
-- 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.
…