• HHH computes the mapping from its input finite sting to the actual beha

    From olcott@21:1/5 to Mikko on Wed Aug 7 08:54:41 2024
    On 8/7/2024 2:29 AM, Mikko wrote:
    On 2024-08-05 13:49:44 +0000, olcott said:

    On 8/5/2024 2:39 AM, Mikko wrote:
    On 2024-08-04 18:59:03 +0000, olcott said:

    On 8/4/2024 1:51 PM, Richard Damon wrote:
    On 8/4/24 9:53 AM, olcott wrote:
    On 8/4/2024 1:22 AM, Fred. Zwarts wrote:
    Op 03.aug.2024 om 18:35 schreef olcott:
    ∞ instructions of DDD correctly emulated by HHH[∞] never >>>>>>>> reach their own "return" instruction final state.

    So you are saying that the infinite one does?


    Dreaming again of HHH that does not abort? Dreams are no
    substitute for facts.
    The HHH that aborts and halts, halts. A tautology.

    void DDD()
    {
       HHH(DDD);
       return;
    }

    That is the right answer to the wrong question.
    I am asking whether or not DDD emulated by HHH
    reaches its "return" instruction.

    But the "DDD emulated by HHH" is the program DDD above,

    When I say DDD emulated by HHH I mean at any level of
    emulation and not and direct execution.

    If you mean anything other than what the words mean you wihout
    a definition in the beginning of the same message then it is
    not reasonable to expect anyone to understand what you mean.
    Instead people may think that you mean what you say or that
    you don't know what you are saying.

    If you don't understand what the word "emulate" means look it up.

    I know what it means. But the inflected form "emulated" does not
    mean what you apparently think it means. You seem to think that
    "DDD emulated by HHH" means whatever HHH thinks DDD means but it
    does not. DDD means what it means whether HHH emulates it or not.


    In other words when DDD is defined to have a pathological
    relationship to HHH we can just close our eyes and ignore
    it and pretend that it doesn't exist?

    DDD does specify non-halting behavior to HHH and HHH must
    report on this non-halting behavior that DDD specifies.

    All halt deciders compute the mapping from their input
    finite string to the behavior that this finite string
    specifies.

    No halt decider is ever allowed to report on the behavior
    of any computation that itself is contained within unless
    this is the same behavior that its finite string input
    specifies.

    void DDD()
    {
    HHH(DDD);
    return;
    }

    Any expert in the C language that knows what x86 emulators
    are knows that DDD correctly emulated by HHH specifies what
    is essentially equivalent to infinite recursion that cannot
    possibly reach its "return" instruction halt state.

    It seems that no one here has that degree of expertise.
    That they know that they don't understand these things
    and still say that I am wrong is dishonest.

    --
    Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 7 18:02:23 2024
    Am Wed, 07 Aug 2024 08:54:41 -0500 schrieb olcott:
    On 8/7/2024 2:29 AM, Mikko wrote:
    On 2024-08-05 13:49:44 +0000, olcott said:

    I know what it means. But the inflected form "emulated" does not mean
    what you apparently think it means. You seem to think that "DDD
    emulated by HHH" means whatever HHH thinks DDD means but it does not.
    DDD means what it means whether HHH emulates it or not.

    In other words when DDD is defined to have a pathological relationship
    to HHH we can just close our eyes and ignore it and pretend that it
    doesn't exist?
    It doesn't change anything about DDD. HHH was supposed to decide anything
    and can't fulfill that promise. That doesn't mean that DDD is somehow
    faulty, it's just a counterexample.

    DDD does specify non-halting behavior to HHH and HHH must report on this non-halting behavior that DDD specifies.
    DDD halts.

    No halt decider is ever allowed to report on the behavior of any
    computation that itself is contained within unless this is the same
    behavior that its finite string input specifies.
    Aha! The "unless" is new (you could've marked it.

    It seems that no one here has that degree of expertise. That they know
    that they don't understand these things and still say that I am wrong is dishonest.
    Crackpots are usually too incompetent to recognise their own incompetence.

    Regarding the title: the actual behaviour of the description of a machine
    is, well, the behaviour of that machine.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Aug 7 21:03:03 2024
    On 8/7/24 2:14 PM, olcott wrote:
    On 8/7/2024 1:02 PM, joes wrote:
    Am Wed, 07 Aug 2024 08:54:41 -0500 schrieb olcott:
    On 8/7/2024 2:29 AM, Mikko wrote:
    On 2024-08-05 13:49:44 +0000, olcott said:

    I know what it means. But the inflected form "emulated" does not mean
    what you apparently think it means. You seem to think that "DDD
    emulated by HHH" means whatever HHH thinks DDD means but it does not.
    DDD means what it means whether HHH emulates it or not.

    In other words when DDD is defined to have a pathological relationship
    to HHH we can just close our eyes and ignore it and pretend that it
    doesn't exist?
    It doesn't change anything about DDD. HHH was supposed to decide anything
    and can't fulfill that promise. That doesn't mean that DDD is somehow
    faulty, it's just a counterexample.


    void DDD()
    {
      HHH(DDD);
      return;
    }

    *HHH is required to report on the behavior of DDD*
    Anyone that does not understand that HHH meets this criteria
    has insufficient understanding.

    But it doesn't, as a correct simulation of a DDD that calls an HHH that
    returns will stop running, and thus HHH can never correctly determine
    something that doesn't happen, so it is never correct to abort its
    emulation.

    The only DDD that is non-halting, is the one built on an HHH that will
    NEVER return an answer for it, and such an HHH can not abort to return,
    or it isn't what it needed to be to make that the corret answer.


    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
        If simulating halt decider H correctly simulates its input D
        until H correctly determines that its simulated D would never
        stop running unless aborted then

    I can't imagine that any expert in the C language can say
    that HHH does not meet this criteria without lying. All
    four of them that answered agreed that it does. Two of
    these four have MSCS.

    If most everyone here hardly knows C at all that would
    be quite a shock to me.


    Nope, YOU don't know the C language, or Logic, or what Truth is, or it
    seems ANYTHING you talk about.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Aug 7 21:03:11 2024
    On 8/7/24 9:54 AM, olcott wrote:
    On 8/7/2024 2:29 AM, Mikko wrote:
    On 2024-08-05 13:49:44 +0000, olcott said:

    On 8/5/2024 2:39 AM, Mikko wrote:
    On 2024-08-04 18:59:03 +0000, olcott said:

    On 8/4/2024 1:51 PM, Richard Damon wrote:
    On 8/4/24 9:53 AM, olcott wrote:
    On 8/4/2024 1:22 AM, Fred. Zwarts wrote:
    Op 03.aug.2024 om 18:35 schreef olcott:
    ∞ instructions of DDD correctly emulated by HHH[∞] never >>>>>>>>> reach their own "return" instruction final state.

    So you are saying that the infinite one does?


    Dreaming again of HHH that does not abort? Dreams are no
    substitute for facts.
    The HHH that aborts and halts, halts. A tautology.

    void DDD()
    {
       HHH(DDD);
       return;
    }

    That is the right answer to the wrong question.
    I am asking whether or not DDD emulated by HHH
    reaches its "return" instruction.

    But the "DDD emulated by HHH" is the program DDD above,

    When I say DDD emulated by HHH I mean at any level of
    emulation and not and direct execution.

    If you mean anything other than what the words mean you wihout
    a definition in the beginning of the same message then it is
    not reasonable to expect anyone to understand what you mean.
    Instead people may think that you mean what you say or that
    you don't know what you are saying.

    If you don't understand what the word "emulate" means look it up.

    I know what it means. But the inflected form "emulated" does not
    mean what you apparently think it means. You seem to think that
    "DDD emulated by HHH" means whatever HHH thinks DDD means but it
    does not. DDD means what it means whether HHH emulates it or not.


    In other words when DDD is defined to have a pathological
    relationship to HHH we can just close our eyes and ignore
    it and pretend that it doesn't exist?

    No, you have to admit that you will get the wrong answer.

    Remember, HHH is a fixed defined piece of code, so it has a fixed
    defined answer that it WILL give based on the algorithm that HHH used.

    What ever that answer is, it will be wrong, as can be easily determined
    by many other deciders.


    DDD does specify non-halting behavior to HHH and HHH must
    report on this non-halting behavior that DDD specifies.

    No, because halting is an OBJECTIVE criteria, and either HHH will return
    and that makes DDD a halting program (so HHH would have needed to have
    guessed 1 to be right), or HHH will never return, making DDD a
    non-halting program (and ONLY that makes it non-halting) but HHH turns
    out not to be a decider.



    All halt deciders compute the mapping from their input
    finite string to the behavior that this finite string
    specifies.

    Which, for a halt decide is DEFINED to be the mapping based on the
    direct execution of the program, and whether it reaches a final state
    iin a finite number of steps or not.

    That HHH can't compute this does not make that not the mapping it NEEDS
    to compute to be a Halt Decider, that just means there is no such thing
    as a universally correct Halt Decider.


    No halt decider is ever allowed to report on the behavior
    of any computation that itself is contained within unless
    this is the same behavior that its finite string input
    specifies.

    Says WHAT? This is just you stating you lie again.

    ALL Halt deciders are REQUIRED (to be a halt decider) that answer about
    *ANY* program described by their input, even if it includes a copy of
    itself.

    You just proved yourself to be a ingnoran LIAR that reckless repeats
    lies that he has been informed are lies because you stupidly refuse to
    even look at the actual definition, because you don't "beleive" in them.

    Sorry, you don't get to not believe in the rules of the game that have
    been establish.

    You just canceled yourself out of the game, and booked your ticket to
    the garbage heap of life.


    void DDD()
    {
      HHH(DDD);
      return;
    }

    Any expert in the C language that knows what x86 emulators
    are knows that DDD correctly emulated by HHH specifies what
    is essentially equivalent to infinite recursion that cannot
    possibly reach its "return" instruction halt state.

    It seems that no one here has that degree of expertise.
    That they know that they don't understand these things
    and still say that I am wrong is dishonest.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to joes on Thu Aug 8 10:34:04 2024
    On 2024-08-07 18:02:23 +0000, joes said:

    Crackpots are usually too incompetent to recognise their own incompetence.

    Those crackpots are also incompetent to hide their incompetence.
    That makes them almost harmless.

    --
    Mikko

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