Sujet : Re: DD correctly emulated by HHH --- Totally ignoring invalid rebuttals ---PSR---
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 09. Mar 2025, 02:24:16
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vqiqk0$dc6s$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
User-Agent : Mozilla Thunderbird
On 3/8/2025 6:56 PM, dbush wrote:
On 3/8/2025 7:29 PM, olcott wrote:
On 3/8/2025 5:31 PM, dbush wrote:
On 3/8/2025 6:23 PM, olcott wrote:
On 3/8/2025 4:58 PM, dbush wrote:
On 3/8/2025 5:42 PM, olcott wrote:
On 3/8/2025 9:00 AM, dbush wrote:
On 3/8/2025 9:03 AM, olcott wrote:
>
Apparently you don't understand that inputs to a
simulating termination analyzer specifying infinite
recursion or recursive emulation cannot possibly
reach their own final state and terminate normally.
>
Apparently you don't understand that inputs to a termination analyzer, simulating or otherwise, are specified by the specification that is the halting function:
>
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed
>
And HHH(DD)==0 fails to meet the above specification
>
*THIS IS A SEMANTIC TAUTOLOGY THUS IMPOSSIBLY FALSE*
Replacing the code of HHH with an unconditional simulator and subsequently running HHH(DD) cannot possibly reach
its own "ret" instruction and terminate normally
because DD calls HHH(DD) in recursive emulation.
>
It is ridiculously stupid to believe that HHH must
report on behavior other than the above behavior.
>
>
It must if it is to be classified as a halt decider or termination analyzer as per the definition.
>
In other words you believe that HHH
>
Is required to map the halting function to meet the requirements to be a halt decider / termination analyzer.
>
>
HHH must map from the input finite string DD
to the behavior that this finite string specifies
And what it specifies, to be considered a solution to the halting problem, is given by the specification:
Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as <X> with input Y:
A solution to the halting problem is an algorithm H that computes the following mapping:
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed
In the same way that Sum(5,3) == 9
That is misconception is very widely held
does not make it not a misconception.
It is your above crazy nonsense that I require complete
agreement with these exact words before moving on to
any other point:
DD correctly emulated by HHH cannot possibly reach
its own "ret" instruction and terminate normally
because DD calls HHH(DD) in recursive emulation.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer