Liste des Groupes | Revenir à c theory |
On 7/27/2024 7:40 PM, Mike Terry wrote:No, it is a VERIFIED FACT that HHH does NOT 100% exactly and preciesly according to the actual x86 semantics of the emuilated code do anything is it doesn't meet that requirement. IT does NOT correct emulate the cll 000015c3 (call HHH(DDD) ) instruction, so you whole argument is based on a LIE.On 27/07/2024 19:14, Alan Mackenzie wrote:_DDD()olcott <polcott333@gmail.com> wrote:>
>Stopping running is not the same as halting.>
DDD emulated by HHH stops running when its emulation has been aborted.
This is not the same as reaching its ret instruction and terminating
normally (AKA halting).
I think you're wrong, here. All your C programs are a stand in for
turing machines. A turing machine is either running or halted. There is
no third state "aborted". An aborted C program certainly doesn't
correspond with a running turing machine - so it must be a halted turing
machine.
>
So aborted programs are halted programs. If you disagree, perhaps you
could point out where in my arguments above I'm wrong.
>
Aborting is an action performed by a simulator, not the TM being simulated.
>
If we want to count "aborted" as some kind of final status, it will have to be the status of a specific /PARTIAL SIMULATOR's/ simulation of a given computation. That's not a property of the computation itself, as different partial simulators can simulate the same computation and terminate for different reasons. Like HHH(DDD) aborts, while UTM(DDD) simulates to completion and so the final simulation status is halts. [Neither of those outcomes contradict the fact that the computation DDD() halts.]
>
If some partial simulator halts when simulating a computation [as with UTM(DDD)] that implies the computation DDD() halts. But if the simulator aborts, it doesn't say that much (in and of itself) about whether the /computation/ halts. The halting problem statement is not concerned with simulations or how the simulations end.
>
Every time anyone in these PO threads says "halts" it ought to be 100% clear to everyone whether the computation itself is being discussed, or whether some simulation final status is intended. (But that's far from being the case!) Since the halting problem is concerned with computations halting and not how partial simulations are ended, I suggest that PO explicitly make clear that he is referring to simulations, whenever that is the case. It seems reasonable that readers seeing "halts" with no further clarification can interpret that as actual computation behaviour, as that is how the term is always used in the literature. Same with other terms like "reach"...
>
So when PO says "DDD simulated by HHH cannot reach its final ret instruction" is he talking about the computation DDD() [as defined mathematically], or its simulation by HHH? He means the latter, but its far from clear, I'd say! [I think most readers now have come around to reading it as a statement about simulations rather than the actual computation, which totally changes things...]
>
>
Mike.
>
[00002163] 55 push ebp ; housekeeping
[00002164] 8bec mov ebp,esp ; housekeeping
[00002166] 6863210000 push 00002163 ; push DDD
[0000216b] e853f4ffff call 000015c3 ; call HHH(DDD)
[00002170] 83c404 add esp,+04
[00002173] 5d pop ebp
[00002174] c3 ret
Size in bytes:(0018) [00002174]
It is a verified fact that DDD emulated by HHH 100% exactly
and precisely according to the actual x86 semantics of
the emulated code including the recursive call that causes
HHH to emulate itself emulating DDD cannot possibly get
past it own 0000216b machine address.
*Anyone as much as hinting otherwise is not being truthful*And, the fact that HHH can not possible emulate the input to the final state, becuase is has been programmed to abort its simulation without proper grouds just proves that its programmer (YOU) is an idiot.
If we remove all of the problematic code then this same
trace still occurs until it crashes from OOM error.
Les messages affichés proviennent d'usenet.