Sujet : Re: DDD emulated by HHH --- (does not refer to prior posts)
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 03. Sep 2024, 20:28:48
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <7390e70bd7d45ddb7db7fa64554e4cd3d41673ca@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Mon, 02 Sep 2024 08:31:23 -0500 schrieb olcott:
On 9/1/2024 6:05 AM, Mikko wrote:
On 2024-08-31 16:18:26 +0000, olcott said:
On 8/31/2024 10:49 AM, Fred. Zwarts wrote:
Op 31.aug.2024 om 17:19 schreef olcott:
On 8/31/2024 9:59 AM, Fred. Zwarts wrote:
Op 31.aug.2024 om 14:03 schreef olcott:
On 8/31/2024 4:07 AM, Fred. Zwarts wrote:
Before we can proceed to the next step you must first agree that the
second emulation of DDD by the emulated HHH is proven to be correct
on the basis that it does emulate the first four instructions of
DDD.
I agree that the simulation makes a good start, but it fails to
complete the simulation up to the end, making the simulation as a
whole incorrect.
Here is no abort and x86utm emulating 100,000,000 instructions.
What happens after those 100 000 000 instructions are executed?
I just showed you what happens immediately below. It shows that
100,000,000 million instructions were executed and the full trace
requires 1,492,537 Pages.
And after that?
-- 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.
Re: DDD emulated by HHH --- (does not refer to prior posts)
Re: DDD emulated by HHH --- (does not refer to prior posts)
