1. Forum
  2. Usenet
  3. SCI.MATH.SYMBOLIC

  • A UTM halt decider a pure function of its inputs

    From Richard Fateman@21:1/5 to olcott on Tue Mar 16 14:26:12 2021
    On Tuesday, March 16, 2021 at 9:30:58 AM UTC-7, olcott wrote:
    An at least partial halt decider based on adapting a UTM <is> a pure function of its inputs.

    This adapted UTM would simply simulate the execution of its input until
    its input halts on its own or its halt decider determines that its input would never halt on its own and stops simulating it.

    In order for the UTM to see what its input does it must keep track of an execution trace of its input. This execution trace <is not> another
    input it is merely the internal state of the halt decider / UTM.

    http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf


    --
    Copyright 2021 Pete Olcott

    "Great spirits have always encountered violent opposition from mediocre minds." Einstein
    I suggest you find something else to work on. The UTM (universal Turing machine) "Halt Decider" referenced in your essay cannot do what it is supposed to do. Presenting some program, even if it is in assembler, does not "solve" the halting problem.
    Good luck.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Richard Fateman on Mon Mar 22 21:44:03 2021
    On 3/16/2021 4:26 PM, Richard Fateman wrote:
    On Tuesday, March 16, 2021 at 9:30:58 AM UTC-7, olcott wrote:
    An at least partial halt decider based on adapting a UTM <is> a pure
    function of its inputs.

    This adapted UTM would simply simulate the execution of its input until
    its input halts on its own or its halt decider determines that its input
    would never halt on its own and stops simulating it.

    In order for the UTM to see what its input does it must keep track of an
    execution trace of its input. This execution trace <is not> another
    input it is merely the internal state of the halt decider / UTM.

    http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf


    --
    Copyright 2021 Pete Olcott

    "Great spirits have always encountered violent opposition from mediocre
    minds." Einstein
    I suggest you find something else to work on. The UTM (universal Turing machine) "Halt Decider" referenced in your essay cannot do what it is supposed to do. Presenting some program, even if it is in assembler, does not "solve" the halting problem.
    Good luck.

    Your words indicate that you certainly were not paying attention.


    --
    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)