Liste des Groupes | Revenir à theory |
On 26/07/2024 20:24, joes wrote:Yes GitHub has been recently updated to include the simplestAm Fri, 26 Jul 2024 10:56:55 -0500 schrieb olcott:Indeed - it comes from HHH. It is 1 for first HHH invocation and 0 subsequently, as determined using static variables in HHH.This is meant for Mike, Joes and Fred don't have the technicalFuck you too.
competence to understand it.
>Mike: It seems that HHH has been a pure function of its inputs and neverThe indirectly called HHH's most certainly make a decision.
has provided data downward to its slaves that corrupts their halt status
decision. They don't even make a halt status decision thus cannot make a
corrupted one.
>I could change the code so that the slave instances can and do try toThat's kinda the point.
form a halt status decision on the basis of the execution trace that
they do have.
There is no sense in doing that because they can't possibly have enough
data, they will always be one whole execution trace behind the next
outer instance of HHH.
>u32 Decide_Halting_HH(u32** Aborted,>
u32** execution_trace,
Decoded_Line_Of_Code** decoded,
u32 code_end,
u32 End_Of_Code, Registers**
master_state, Registers**
slave_state, u32** slave_stack,
u32 Root)
{
u32 aborted_temp = 0; // 2024-06-05 u32
Current_Length_Of_Execution_Trace = 0;
while (aborted_temp == 0) // 2024-06-05 {if (Root) // Master UTM halt decider {There it is.
Where is this passed from?
I think this GitHub link has all the code: <https://github.com/plolcott/x86utm>
PO has previously published a zip file with everything in, but I think it's the same content, with GitHub being a bit more recent.
Mike.
Les messages affichés proviennent d'usenet.