Sujet : Re: This function proves that only the outermost HHH examines the execution trace
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 01. Aug 2024, 16:46:02
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <3e91ca7ef46d6de40edf2bbd9d4761ba63578e09@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 Thu, 01 Aug 2024 07:56:27 -0500 schrieb olcott:
On 8/1/2024 7:52 AM, Fred. Zwarts wrote:
Op 01.aug.2024 om 14:03 schreef olcott:
On 8/1/2024 2:52 AM, Mikko wrote:
On 2024-07-31 17:33:38 +0000, olcott said:
On 7/31/2024 4:15 AM, Mikko wrote:
On 2024-07-30 23:40:21 +0000, olcott said:
On 7/30/2024 2:00 AM, Mikko wrote:
On 2024-07-29 16:50:53 +0000, olcott said:
On 7/28/2024 3:59 AM, Mikko wrote:
On 2024-07-27 20:05:31 +0000, olcott said:
When instructions are executed/emulated according to the semantics of
the x86 language then they are executed/emulated correctly.
>
But only those instructions. A halting program is simulated correctly
if no instructions are skipped.
Correctly and completely are not the same damn thing you
freaking moron.
Yes, an incomplete simulation is also incorrect.
-- 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.
…