Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)

On 5/11/25 9:05 PM, olcott wrote:

On 5/11/2025 7:58 PM, dbush wrote:

On 5/11/2025 8:48 PM, olcott wrote:

On 5/11/2025 7:38 PM, Mike Terry wrote:

On 11/05/2025 18:11, Richard Heathfield wrote:

On 11/05/2025 17:44, olcott wrote:

Any yes/no question where both yes and no are the
wrong answer is an incorrect polar question.

>
Either DD stops or it doesn't (once it's been hacked around to get it to compile and after we've leeched out all the dodgy programming).

>
Done that.  It still stops.
>

>
If the computer cannot correctly decide whether or not DD halts,

>
The decider says it doesn't stop..
>

we have an undecidable computation,

>
No no, that doesn't make sense.  DD stops, and there are lots of partial halt deciders that will decide that particular input correctly.  PO's DD isn't "undecidable".
>
No single computation can be undecidable, considered on its own! There are only two possibilities: it halts or it doesn't.  In either case there is a decider which decides that /one specific input/ correctly. By extension, any finite number of computations is decidable - we just have a giant switch statement followed by returning halts/neverhalts as appropriate.  If the input domain has just n inputs, there are 2^n trivial deciders that together cater for every combination of each input halting or never halting.  One of those deciders is a correct decider for that (finite domain) problem.
>
The HP is asking for a TM (or equiv.) that correctly decides EVERY (P,I) in its one finite algorithm.  That is what is proven impossible.  The trick of having a big switch statement no longer works because there are infinitely many possible inputs.
>
Decidability for just one single input is trivial and not intersting.
>

and therefore some computations are undecidable, so Turing's conclusion was right. Who knew? (Apart from practically everybody else, I mean.)

>
>
Mike.

>
DDD emulated by HHH according to the rules of
the computational language that DD is encoded
within

>
Doesn't happen, as you have admitted on the record:
>
>

 I admitted on record that DDD is not infinitely
emulated by HHH. Because you are only a damned
Troll you try to twist this into incorrect emulation.
 

Then why is the emulation of it non-halting? That a machine didn't halt after only some finite number of steps isn't non-halting.
Note, partial emulation don't follow the law of the excluded middle, You have 3 states, Halted, Not-Yet-Halted, and Non-Halting.