Re: Failure to meet this challenge proves that all of my reviewers are wrong

Liste des GroupesRevenir à theory 
Sujet : Re: Failure to meet this challenge proves that all of my reviewers are wrong
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theory
Date : 02. Mar 2025, 18:07:23
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <3fecc81b7b9b661ef0ec148aec56b5a796a946e8@i2pn2.org>
References : 1 2 3 4 5
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sun, 02 Mar 2025 10:48:06 -0600 schrieb olcott:
On 3/2/2025 10:22 AM, joes wrote:
Am Sun, 02 Mar 2025 09:51:56 -0600 schrieb olcott:
On 3/2/2025 8:55 AM, joes wrote:
Am Sun, 02 Mar 2025 08:42:03 -0600 schrieb olcott:
>
I challenged everyone here to provide the machine address by machine
address (AKA line by line) execution trace of DD correctly emulated
by HHH that reaches its own "ret" instruction.
No one made any attempt to do this because they know that this would
prove that they are stupidly wrong to say that my trace is
incorrect.
I did, on thursday at 9pm UTC.
I am asking for a sequence of 10 hexadecimal integer machine addresses
of DD correctly emulated by HHH.
See that post.
Do you not know what a hexadecimal integer machine address is?
Are you a compiler?

On 2/27/2025 3:00 PM, joes wrote:
 > Anyway: ignoring the call to HHH, because it doesn't call DD in turn,
Is counterfactual The actual HHH does emulate itself emulating DD as a
100% totally verified fact.
Calling != simulating. And you only wanted the instructions of DD.

 > we continue with 2141 until the conditional jump, whereupon we either
 > enter an infinite loop (which is more than 15 instructions) or
 > proceed to return (which is 13 instructions), depending on the return
 > value of HHH.
There you go.

--
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.

Date Sujet#  Auteur
2 Mar 25 * Failure to meet this challenge proves that all of my reviewers are wrong21olcott
2 Mar 25 +* Re: Failure to meet this challenge proves that all of my reviewers are wrong6joes
2 Mar 25 i`* Re: Failure to meet this challenge proves that all of my reviewers are wrong5olcott
2 Mar 25 i +* Re: Failure to meet this challenge proves that all of my reviewers are wrong3joes
2 Mar 25 i i`* Re: Failure to meet this challenge proves that all of my reviewers are wrong2olcott
2 Mar 25 i i `- Re: Failure to meet this challenge proves that all of my reviewers are wrong1joes
2 Mar 25 i `- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Fred. Zwarts
2 Mar 25 +- Re: Failure to meet this challenge proves that all of my reviewers are wrong1olcott
2 Mar 25 +* Re: Failure to meet this challenge proves that all of my reviewers are wrong9Fred. Zwarts
2 Mar 25 i`* Re: Failure to meet this challenge proves that all of my reviewers are wrong8olcott
2 Mar 25 i +- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Fred. Zwarts
3 Mar 25 i `* Re: Failure to meet this challenge proves that all of my reviewers are wrong6Mikko
3 Mar 25 i  `* Re: Failure to meet this challenge proves that all of my reviewers are wrong5olcott
3 Mar 25 i   +* Re: Failure to meet this challenge proves that all of my reviewers are wrong2joes
4 Mar 25 i   i`- Re: Failure to meet this challenge proves that all of my reviewers are wrong1olcott
4 Mar 25 i   +- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Richard Damon
4 Mar 25 i   `- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Mikko
2 Mar 25 +- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Richard Damon
3 Mar 25 `* Re: Failure to meet this challenge proves that all of my reviewers are wrong3Mikko
3 Mar 25  `* Re: Failure to meet this challenge proves that all of my reviewers are wrong2olcott
4 Mar 25   `- Re: Failure to meet this challenge proves that all of my reviewers are wrong1Mikko

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal