On 8/10/24 9:43 PM, olcott wrote:
On 8/10/2024 8:13 PM, Richard Damon wrote:
On 8/10/24 8:51 PM, olcott wrote:
On 8/10/2024 7:20 PM, Richard Damon wrote:
On 8/10/24 7:52 PM, olcott wrote:
On 8/10/2024 5:47 PM, Richard Damon wrote:
On 8/10/24 6:41 PM, olcott wrote:
On 8/10/2024 4:53 PM, Richard Damon wrote:
On 8/10/24 5:37 PM, olcott wrote:
On 8/10/2024 4:33 PM, Richard Damon wrote:
On 8/10/24 5:18 PM, olcott wrote:
On 8/10/2024 3:58 PM, Richard Damon wrote:
On 8/10/24 4:36 PM, olcott wrote:
>
As I have countlessly proven it only requires enough correctly
emulated steps to correctly infer that the input would never
reach is "return" instruction halt state.
>
Except that HHH does't do that, since if HHH decides to abort and return, then the DDD that it is emulating WILL return, just after HHH has stopped its emulation.
>
You just confuse the behavior of DDD with the PARTIAL emulation that HHH does, because you lie about your false "tautology".
>
>
>
Denying a tautology seems to make you a liar. I only
say "seems to" because I know that I am fallible.
>
Claiming a false statement is a tautology only make you a liar.
>
In this case, you lie is that the HHH that you are talking about do the "correct emulation" you base you claim on.
>
That is just a deception like the devil uses, has just a hint of truth, but the core is a lie.
>
>
What I say is provably correct on the basis of the
semantics of the x86 language.
>
Nope.
>
The x86 language says DDD will Halt if HHH(DDD) returns a value.
>
HHH is called by main() there is no directly executed DDD()
any where in the whole computation.
>
>
Except in your requirements, and we can see what it does by adding a call to DDD from main, since nothing in your system calls main.
>
>
All that you need to know is that there is not any
directly executed DDD() anywhere in the computation.
>
But there ccould be, and the behavior of it is what matters.
>
>
The key error of the halting problem proofs all of these
years has been the false assumption that a halt decider
must report on the behavior of the computation that itself
is contained within.
>
But it isn't a false assemption, but an actual requirement.
>
A Halt Decider must be able to correctly answer for ANY Turing Machine represented as its input.
>
ANY includes those that are built from a copy of itself.
>
So, a Halt Decider needs to be able to correctly answer about programs that include copies of itself, even with contrary behavior, which is what makes it impossible to compute.
>
You seem to confuse non-computable with invalid, it seems in part because you don't understand the difference between knowledge and truth.
>
>
Everyone has simply assumed that the behavior of the
input to a decider must exactly match the direct execution
of this input. They only did this because everyone rejected
simulation out-of-hand without review.
>
Because that is the DEFINITION of what it is to decide on.
>
You just don't understand what a requirement is.
>
Since the DEFINITION of "Correct Simulation" that you are trying to use (from a UTM) means a machine the EXACTLY reproduces the behavior of the direct exectution of the machine described by the input, the correct simulation must exactly match the behavior of the direct execution.
>
You can't get out of it by trying to lie about it being different.
>
>
This caused them to never notice that the input simulated
according to its correct semantics does call its own decider
in recursive simulation thus cannot possibly return to its
caller. The Linz proof is sufficiently isomorphic so this equally
applies to the Linz TM proof.
>
Nope, just shows you don't know what "Correct" means.
>
Your proof is NOT "sufficiently isomorphic" since by your own claims it is clearly not even Turing Complete, so no where near isomorphic.
>
>
If HHH were to report on the direct execution of DDD it would
be breaking the definition of a halt decider that only computes
the mapping from its input...
>
Nope. Since the mapping that it is supposed to compute is DEFINED as based on the direct exectut
>
>
No it never has been this. I has always been a mapping
from the behavior that the finite string specifies. It
has never been the behavior of the actual computation
that the decider is contained within.
>
>
And thatg behavior is specified to be the behavior of the program the input represents. PERIOD.
>
That has never been true. It is always the case that every
decider of any kind only computes the mapping from its input
finite string and never gives a rat's ass about anything else
anywhere else.
No, you are confusing capability with requirements.
A "Foo Decider" has ALWAYS been required to compute the "Foo" mapping, as that mapping is defined.
The "Halting" mapping is defined as the behavior of the machine/input represented by the input, so the input needs to be a representation of the program and input and the decider tries to compute the mapping of that representation to the behavior that program represents.
How that isn't the "mapping" of the input to a Halt Decider seems to put a big hole in your argument.
So, the behavior of the program the input describes *IS* the mapping that HHH needs to try to compute to be a halt decider, as that is the mapping that Halting defines.
Now, it is only CAPABLE of computing a computable mapping, like a finite length emulation of the input, and since it has been shown that Halting is NOT a computable mapping, there will be some inputs (like H^) that the decider WILL get wrong. That doesn't say the problem is wrong, or specifies the wrong mapping, just that the problem can't be done with a computation.
Your HHH may be a decider, if it ALWAYS halts for any input give to it, but since the answer it gives doesn't always match the Halting mapping, it just isn't a Halt Decider.
Ben should have known this. He didn't. People here that pretend
to know computer science should know that. That they don't proves
that they are (to some degree) fakers.
What make you think they don't know it.
After all, the mapping of the finite string that completely represents the program and input to be decided to whether that program and input that it represents will halt when run is a perfectly defined mapping.
The semantics of my 100% fully specified concrete example
conclusively proves that the behavior of DDD correctly emulated
by HHH is a different sequence that the directly executed DDD().
Nope, since you have never shown the requested output, you have no grounds to claim that you HHH does a correct x86 emulation of the input.
Remember, that means the trace is of what HHH does, so starts with is emulating the beginnig of DDD(), and then following the call to HHH that it makes into HHH, all the way until the emulator decides to stop.
Then you need to point out what instruction that it correctly emulated differed from what the actually directly executed machine would have done, and explain WHY its difference is correct.
Even a pretty stupid person can see that each HHH does emulate
its input correctly even if it does this by wild guess. They
*merely have to bother to pay attention that the emulated lines*
*are the same lines as the x86 source code of DDD*
No, each HHH CONDITIONALLY emulates the input it is given, and will abort its emulation and return to its caller if it decides the input isn't going to halt. As such, to prove infinite recursion you have to show that NONE of the emulated HHHs will abort their emulations and return, which, since they are the same HHH as deciding, means your top level HHH can't do that either, so it fails to be a decider.
That after three years no one has bothered to do that can't seem
to have any plausible explanation besides playing sadistic trollish
head games.
No, the fact that you can't prove that the "correct emulation" differs from the Direct Execution means your claim that they differ is a lie, and thus HHH is just wrong about it deciding that DDD will not halt, when it does.
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
Begin Local Halt Decider Simulation Execution Trace Stored at:1138cc
[00002172][001138bc][001138c0] 55 push ebp ; housekeeping
[00002173][001138bc][001138c0] 8bec mov ebp,esp ; housekeeping
[00002175][001138b8][00002172] 6872210000 push 00002172 ; push DDD
[0000217a][001138b4][0000217f] e853f4ffff call 000015d2 ; call HHH(DDD)
New slave_stack at:14e2ec
Note, this is NOT a correct emulation, and is just your way to try to LIE.
We need to see the instruction of HHH here.
[00002172][0015e2e4][0015e2e8] 55 push ebp ; housekeeping
[00002173][0015e2e4][0015e2e8] 8bec mov ebp,esp ; housekeeping
[00002175][0015e2e0][00002172] 6872210000 push 00002172 ; push DDD
[0000217a][0015e2dc][0000217f] e853f4ffff call 000015d2 ; call HHH(DDD)
Local Halt Decider: Infinite Recursion Detected Simulation Stopped
And, HH may hve decided this, but that isn't a true determination.
Again, more of your lies.
Sorry, your "logic" just proves your stupidity, and the fact you can't see that just proves how stupid you are, and that is the worse kind of stupid.
Who here is too stupid to know that DDD correctly simulated by HHH cannot possibly reach its own return instruction?
Re: Who here is too stupid to know that DDD correctly simulated,by HHH cannot possibly reach its own return instruction?