• Re: No not believe Liars that changed their name to mine speak for me -

    From Richard Damon@21:1/5 to olcott on Mon Sep 2 12:47:46 2024
    On 9/2/24 12:24 PM, olcott wrote:
    A halt decider is a Turing machine that computes
    the mapping from its finite string input to the
    behavior that this finite string specifies.

    Where the "finite string" is a representation of a Turing Machine and
    its input, and the mapping is the behavior of that Machine/Input when run.

    Important point, as only a Machine and its input has the "halting"
    property, and its is the direct


    If the finite string machine string machine
    description specifies that it cannot possibly
    reach its own final halt state then this machine
    description specifies non-halting behavior.


    Which MEANS the direct execution of the machine and input the finite
    string describes.

    A halt decider never ever computes the mapping
    for the computation that itself is contained within.

    But it can be asked about a computation that includes a copy of itself.

    Of course, the decider is looking at an input that might create another instance of itself by using a copy of itself, and that is a valid question.

    It is of course structurally impossible for an input to include *THIS*
    instance of the decider as the input doesn't specify what "instance" it
    is of, just the code, and the instance is created when it is run/simulated.


    Unless there is a pathological relationship between
    the halt decider H and its input D the direct execution
    of this input D will always have identical behavior to
    D correctly simulated by simulating halt decider H.

    No, the "pathological relationship" doesn't affect the meaning of the
    input or the question being asked.

    The question is SPECIFICALLY about the behavior of the machine and input described to the decider, and NOT about what the decider can determine
    about the input.

    Sorry, you are just proving that you are nothing but an ignorant liar.




    Simulating Termination Analyzer H is Not Fooled by Pathological Input D https://www.researchgate.net/publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D




    Which just LIES about what it is trying to show, because you don't
    understand the problem you say you are working on.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Mon Sep 2 12:55:09 2024
    If you actual think there is impersonation, then report it to
    eternal-September has you host requests.

    Note, for this complaint to be valid, you must be posting with an email
    address that you actually "own", and not a fake address that is
    undeliverable. (and using fake gmail addresses would be a Goggle TOS
    violation)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Tue Sep 3 11:48:41 2024
    On 2024-09-02 16:24:23 +0000, olcott said:

    A halt decider is a Turing machine that computes
    the mapping from its finite string input to the
    behavior that this finite string specifies.

    If the finite string machine string machine
    description specifies that it cannot possibly
    reach its own final halt state then this machine
    description specifies non-halting behavior.

    A halt decider never ever computes the mapping
    for the computation that itself is contained within.

    Unless there is a pathological relationship between
    the halt decider H and its input D the direct execution
    of this input D will always have identical behavior to
    D correctly simulated by simulating halt decider H.


    Simulating Termination Analyzer H is Not Fooled by Pathological Input D https://www.researchgate.net/publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D


    You needn't worry. We don't believe anyone who uses the name "olcott"
    with a lower case c or puts a copyright claim for "Olcott" to the bottom
    of the message.

    --
    Mikko

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