1. Forum
  2. Newsgroups
  3. comp.lang.c

  • D simulated by H cannot possibly reach its own return statement

    From olcott@polcott333@gmail.com to comp.theory,comp.lang.c on Mon Oct 27 20:12:29 2025
    From Newsgroup: comp.lang.c

    A straight forward sequence of steps that any
    C programmer can easily determine:

    int D()
    {
    int Halt_Status = H(D);
    if (Halt_Status)
    HERE: goto HERE;
    return Halt_Status;
    }

    H simulates D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    until H sees this repeating pattern.

    *Once this is agreed to the C portion of my proof is complete*

    *Halting Problem Simulation in C*
    https://philpapers.org/archive/OLCHPS-2.pdf
    --
    Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,comp.lang.c on Mon Oct 27 21:28:16 2025
    From Newsgroup: comp.lang.c

    On 10/27/25 9:12 PM, olcott wrote:
    A straight forward sequence of steps that any
    C programmer can easily determine:

    int D()
    {
      int Halt_Status = H(D);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    H simulates D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    until H sees this repeating pattern.

    At which point, H is wrong, as D, when run, will halt.

    All you have done is proved that you replacement of the meaning of the
    input being the objective measure of how the program described behaves
    when run, with the subjective requriement of if its simulation by the
    decider will reach the end it just invalid.


    *Once this is agreed to the C portion of my proof is complete*

    *Halting Problem Simulation in C*
    https://philpapers.org/archive/OLCHPS-2.pdf


    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory,comp.lang.c on Mon Oct 27 18:41:18 2025
    From Newsgroup: comp.lang.c

    On 10/27/2025 6:12 PM, olcott wrote:
    A straight forward sequence of steps that any
    C programmer can easily determine:

    You moron! Where is H? Define it in std C. rofl. lol. sigh. What a joke.


    int D()
    {
      int Halt_Status = H(D);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    H simulates D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    that calls H(D) to simulate D
    until H sees this repeating pattern.

    *Once this is agreed to the C portion of my proof is complete*

    *Halting Problem Simulation in C*
    https://philpapers.org/archive/OLCHPS-2.pdf


    --- Synchronet 3.21a-Linux NewsLink 1.2