Sujet : Re: Any honest person that knows the x86 language can see... predict correctly
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theoryDate : 01. Aug 2024, 05:03:36
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <c27d1515dc37261302985fc014ea04b6fce872b6.camel@gmail.com>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
On Wed, 2024-07-31 at 22:51 -0500, olcott wrote:
On 7/31/2024 10:08 PM, wij wrote:
On Tue, 2024-07-30 at 18:50 -0500, olcott wrote:
It is not supposed to be a general solution to the halting problem.
it only shows how the "impossible" input is correctly determined
to be non halting.
But how do you determine it is non-halting?
As I know you are even unable to define what 'halt' mean !!!
I have done this thousands of times and after someone
has read these thousands of times they say that I never
said it once.
void DDD()
{
HHH(DDD);
return;
}
int main()
{
HHH(DDD);
}
If DDD correctly emulated by HHH cannot possibly
reach its return instruction then it never halts.
That's right, HHH(DDD) as shown should never halt.
But The Halting Problem asks HHH to return 1 or 0 (so to speak, because you
don't know the detail).
Since HHH does not return 1 or 0 to answer the question, it is not a decider.
You are dealing with POO Problem.