Re: A state transition diagram proves ... GOOD PROGRESS

Liste des GroupesRevenir à c theory 
Sujet : Re: A state transition diagram proves ... GOOD PROGRESS
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theory
Date : 18. Oct 2024, 22:24:43
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <31fed9bd45277332bcabc040d4b21de642356f63@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Fri, 18 Oct 2024 15:18:46 -0500 schrieb olcott:
On 10/18/2024 2:51 PM, Alan Mackenzie wrote:
olcott <polcott333@gmail.com> wrote:
On 10/18/2024 2:10 PM, joes wrote:
 
The existence of the check has an effect right from the start;
besides, it is true the first time it is executed.
So maybe you have ADD too. You can't seem to pay attention when things
are explained to you many different times several different ways.
What you call "explaining" is in actual fact the assertion of
falsehoods.  This is usually called lying.
The variable Root does indeed affect your program.
*I never say that it didn't*
You said nothing at all. Productive communication would have included
an agreement and clarification.

The "root" variable has NO EFFECT WHAT-SO-EVER on the correctness or
completeness of HHH emulating itself emulating DDD until this DDD calls
HHH(DDD).
DDD does nothing else but call HHH, and Root is part of HHH, so is
simulated the first time around.

--
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
11 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal