Sujet : Re: Title: A Structural Analysis of the Standard Halting Problem Proof
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 25. Jul 2025, 17:32:03
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1060bi4$138e1$11@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
User-Agent : Mozilla Thunderbird
On 7/25/2025 10:10 AM, joes wrote:
Am Fri, 25 Jul 2025 09:15:52 -0500 schrieb olcott:
On 7/25/2025 2:53 AM, joes wrote:
Am Thu, 24 Jul 2025 16:41:26 -0500 schrieb olcott:
On 7/24/2025 4:24 PM, joes wrote:
Am Thu, 24 Jul 2025 09:32:45 -0500 schrieb olcott:
>
Aborting prematurely literally means that after N instructions of
DDD are correctly emulated by HHH that this emulated DDD would reach
its own emulated "ret" instruction final halt state.
What value of N are you proposing?
>
Let's see: the call to HHH is #4, [waves hands], then another 4
inside the next level of simulation, and after another 4 the first
simulated HHH (the one called by the input, not the outermost
simulator. We are now 3 levels in) decides that enough is enough and
aborts,
>
Thus immediate killing its simulated DDD and everything else that HHH
was simulating thus no simulated DDD or simulated HHH can possibly
ever return no matter how many or how few X86 instructions that the
executed HHH correctly emulates.
This is the part that you fail to understand or understand that I am
correct and disagree anyway.
>
You failed to understand I was talking about the first simulated HHH
aborting, not the outermost simulator.
>
*I am trying to get you to understand that is impossible*
The only HHH that can possibly abort is the outermost directly executed
one.
True if the input changes along with the simulator, but not if we
The input is always the exact same sequence of machine
language bytes.
simulate the fixed input (that aborts after 4+4=8 instructions of DDD,
when we encounter the second nested call to HHH) without prematurely
aborting.
*Correctly emulated is defined as*
Emulated according to the rules of the x86 language.
This includes DDD emulated by HHH and HHH emulating
itself emulating DDD one or more times.
_DDD()
[00002192] 55 push ebp
[00002193] 8bec mov ebp,esp
[00002195] 6892210000 push 00002192 // push DDD
[0000219a] e833f4ffff call 000015d2 // call HHH
[0000219f] 83c404 add esp,+04
[000021a2] 5d pop ebp
[000021a3] c3 ret
Size in bytes:(0018) [000021a3]
There exists no finite or infinite number of correctly
emulated x86 instructions such that the emulated DDD
ever reaches its emulated "ret" instruction final halt
state because the input to HHH(DDD) specifies recursive
emulation.
I get that if you change what "HHH" refers to in order do extend the
simulation you necessarily simulate a different input. You don't.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer