• Detecting infinite recursion (V2)

    From olcott@21:1/5 to R Kym Horsell on Thu Mar 4 15:32:50 2021
    XPost: comp.theory

    On 3/4/2021 3:22 PM, R Kym Horsell wrote:
    In comp.theory olcott <NoOne@nowhere.com> wrote:
    ...
    Can this Simulate() function correctly decide not halting on its input
    on the basis that it did correctly detect that it was being called in
    infinite recursion?

    Since detecting infinite recursion is the same problem as
    the halting problem we can all guess "no" and your thinking is
    still hopelessly confused.


    Removing the pathological self-reference(Olcott 2004) from the halting
    problem by changing the halt deciding criteria:

    (a) Does the input program halt on its input?

    (b) Does the simulation of the input program have to be stopped to
    prevent its otherwise infinite execution?

    Provides the basis for dividing all inputs into those having the
    not-halting property and those that do not.

    Halts() simply decides that H_Hat() has the property of non-halting on
    the basis that H_Hat() would invoke Halts() in infinite recursion unless Halts() stops simulating H_Hat().

    void H_Hat(u32 P)
    {
    u32 Input_Halts = Halts(P, P);
    if (Input_Halts)
    HERE: goto HERE;
    return;
    }

    int main()
    {
    u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
    Output("Input_Would_Halt = ", Input_Would_Halt);
    }


    --
    Copyright 2021 Pete Olcott

    "Great spirits have always encountered violent opposition from mediocre
    minds." Einstein

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From R Kym Horsell@21:1/5 to olcott on Thu Mar 4 21:22:24 2021
    XPost: comp.theory

    In comp.theory olcott <NoOne@nowhere.com> wrote:
    ...
    Can this Simulate() function correctly decide not halting on its input
    on the basis that it did correctly detect that it was being called in infinite recursion?

    Since detecting infinite recursion is the same problem as
    the halting problem we can all guess "no" and your thinking is
    still hopelessly confused.

    --
    Eye hag a pruf of da haltin prollem!(*)
    We no a "if statement" can not take an infinite number of steps.
    But a "while statement" can gits inna loop an take an lon thyme!
    So da Halting Prollem is da same as decidin wedda a progam
    contayns a "while statment" an is therefour deciabubblle!
    Q-E-G!

    (*) Some role play may be inbolbed.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)