• Re: Two hypothetical possibilities --- HP decision problem instance

    From joes@[email protected] to comp.theory on Mon Nov 3 14:14:14 2025
    From Newsgroup: comp.theory

    Am Tue, 28 Oct 2025 15:25:39 -0500 schrieb olcott:
    On 10/28/2025 11:50 AM, Kaz Kylheku wrote:
    On 2025-10-28, joes <[email protected]> wrote:
    Am Tue, 21 Oct 2025 18:54:33 -0500 schrieb olcott:

    That DD() halts depends on HHH(DD) rejecting its input.
    Which it does, therefore DD halts.

    Moreover, there cannot be a "this DD" versus "that DD".
    If you're thinking about the problem in such a way that you have to
    distinguish different DDs, to all which the DD name refers
    simultaneously in the same scenario, you are wrong.

    Actually that is the key computer science discovery that I made. You
    have to accept the first step of my proof before you will understand the
    next step:

    That DD does not halt because HHH doesn’t abort?
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.
    --- Synchronet 3.21a-Linux NewsLink 1.2