1. Forum
  2. USENET
  3. comp.theory

  • Olcott admits that the Halting Problem is undecidable - reprise #3

    From Mr Flibble@flibble@red-dwarf.jmc.corp to comp.theory on Wed Oct 8 00:30:53 2025
    From Newsgroup: comp.theory

    Olcott admits that the Halting Problem is undecidable with the following
    words quoted verbatim:

    DD is the caller of HHH(DD) that does the opposite of whatever HHH(DD) reports. This makes it logically impossible for HHH to correctly report
    on the behavior of its caller no matter what HHH does.

    So if HHH is asked the question does my caller halt?
    It is logically impossible for HHH to provide a correct answer.

    /Flibble
    --
    meet ever shorter deadlines, known as "beat the clock"
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Tue Oct 7 18:33:34 2025
    From Newsgroup: comp.theory

    On 10/7/2025 5:30 PM, Mr Flibble wrote:
    Olcott admits that the Halting Problem is undecidable with the following words quoted verbatim:

    DD is the caller of HHH(DD) that does the opposite of whatever HHH(DD)
    reports. This makes it logically impossible for HHH to correctly report
    on the behavior of its caller no matter what HHH does.

    So if HHH is asked the question does my caller halt?
    It is logically impossible for HHH to provide a correct answer.

    ;^D Olcott will probably act like the real flibble:

    https://youtu.be/AOE7qTAK87o

    lol.
    --- Synchronet 3.21a-Linux NewsLink 1.2