• Re: Ben Bacarisse fails understand that deciders compute the mapping fr

    From joes@21:1/5 to All on Tue Aug 27 05:45:23 2024
    Am Mon, 26 Aug 2024 18:03:41 -0500 schrieb olcott:
    On 8/26/2024 7:42 AM, Ben Bacarisse wrote:
    Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
    On 23/08/2024 22:07, Ben Bacarisse wrote:

    We don't really know what context Sipser was given. I got in touch
    at the time so I do know he had enough context to know that PO's
    ideas were "wacky" and that had agreed to what he considered a "minor
    remark". Since PO considers his words finely crafted and key to his
    so-called work I think it's clear that Sipser did not take the "minor
    remark" he agreed to to mean what PO takes it to mean! My own take
    if that he (Sipser) read it as a general remark about how to
    determine some cases, i.e. that D names an input that H can partially
    simulate to determine it's halting or otherwise. We all know or
    could construct some such cases.

    Exactly my reading. It makes Sipser's agreement natural, because it
    is both correct [with sensible interpretation of terms], and moreover
    describes an obvious strategy that a partial decider might use that
    can decide halting for some specific cases. No need for Sipser to be
    deceptive or misleading here, when the truth suffices. (In particular
    no need to employ "tricksy" vacuous truth get out clauses just to get
    PO off his back as some have suggested.)

    Yes, and it fits with his thinking it a "trivial remark".

    That aside, it's such an odd way to present an argument: "I managed to
    trick X into saying 'yes' to something vague". In any reasonable
    collegiate exchange you'd go back and check: "So even when D is
    constructed from H, H can return based on what /would/ happen if H did
    not stop simulating so that H(D,D) == false is correct even though D(D)
    halts?". Just imagine what Sipser would say to that!
    Is this an accurate phrasing, pete?

    Academic exchange thrives on clarity. Cranks thrive on smoke and
    mirrors.
    Try to point to the tiniest lack of clarity in this fully specified
    concrete example.
    Ben was talking about your Sipser quote.
    But for one, HHH isn’t defined.

    [copypasta snipped]
    --
    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 Mikko@21:1/5 to olcott on Wed Aug 28 10:33:34 2024
    On 2024-08-27 13:04:26 +0000, olcott said:

    On 8/27/2024 12:45 AM, joes wrote:
    Am Mon, 26 Aug 2024 18:03:41 -0500 schrieb olcott:
    On 8/26/2024 7:42 AM, Ben Bacarisse wrote:
    Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
    On 23/08/2024 22:07, Ben Bacarisse wrote:

    We don't really know what context Sipser was given. I got in touch >>>>>> at the time so I do know he had enough context to know that PO's
    ideas were "wacky" and that had agreed to what he considered a "minor >>>>>> remark". Since PO considers his words finely crafted and key to his >>>>>> so-called work I think it's clear that Sipser did not take the "minor >>>>>> remark" he agreed to to mean what PO takes it to mean! My own take >>>>>> if that he (Sipser) read it as a general remark about how to
    determine some cases, i.e. that D names an input that H can partially >>>>>> simulate to determine it's halting or otherwise. We all know or
    could construct some such cases.

    Exactly my reading. It makes Sipser's agreement natural, because it >>>>> is both correct [with sensible interpretation of terms], and moreover >>>>> describes an obvious strategy that a partial decider might use that
    can decide halting for some specific cases. No need for Sipser to be >>>>> deceptive or misleading here, when the truth suffices. (In particular >>>>> no need to employ "tricksy" vacuous truth get out clauses just to get >>>>> PO off his back as some have suggested.)

    Yes, and it fits with his thinking it a "trivial remark".

    That aside, it's such an odd way to present an argument: "I managed to >>>> trick X into saying 'yes' to something vague". In any reasonable
    collegiate exchange you'd go back and check: "So even when D is
    constructed from H, H can return based on what /would/ happen if H did >>>> not stop simulating so that H(D,D) == false is correct even though D(D) >>>> halts?". Just imagine what Sipser would say to that!
    Is this an accurate phrasing, pete?

    Deciders never compute the mapping of the computation
    that they themselves are contained within.

    Why not? A decider always either accepts or rejects its input. If the
    input specifies a computation then it maps the computation to either
    accept or reject. Whether the computation contains the decider does
    not affect that. If the "decider" neither accpets nor rejects it is
    not a decider.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Wed Aug 28 14:35:57 2024
    Op 28.aug.2024 om 13:46 schreef olcott:
    On 8/28/2024 2:33 AM, Mikko wrote:
    On 2024-08-27 13:04:26 +0000, olcott said:

    On 8/27/2024 12:45 AM, joes wrote:
    Am Mon, 26 Aug 2024 18:03:41 -0500 schrieb olcott:
    On 8/26/2024 7:42 AM, Ben Bacarisse wrote:
    Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
    On 23/08/2024 22:07, Ben Bacarisse wrote:

    We don't really know what context Sipser was given.  I got in touch >>>>>>>> at the time so I do know he had enough context to know that PO's >>>>>>>> ideas were "wacky" and that had agreed to what he considered a >>>>>>>> "minor
    remark". Since PO considers his words finely crafted and key to his >>>>>>>> so-called work I think it's clear that Sipser did not take the >>>>>>>> "minor
    remark" he agreed to to mean what PO takes it to mean!  My own take >>>>>>>> if that he (Sipser) read it as a general remark about how to
    determine some cases, i.e. that D names an input that H can
    partially
    simulate to determine it's halting or otherwise.  We all know or >>>>>>>> could construct some such cases.

    Exactly my reading.  It makes Sipser's agreement natural, because it >>>>>>> is both correct [with sensible interpretation of terms], and
    moreover
    describes an obvious strategy that a partial decider might use that >>>>>>> can decide halting for some specific cases.  No need for Sipser >>>>>>> to be
    deceptive or misleading here, when the truth suffices.  (In
    particular
    no need to employ "tricksy" vacuous truth get out clauses just to >>>>>>> get
    PO off his back as some have suggested.)

    Yes, and it fits with his thinking it a "trivial remark".

    That aside, it's such an odd way to present an argument: "I
    managed to
    trick X into saying 'yes' to something vague".  In any reasonable >>>>>> collegiate exchange you'd go back and check: "So even when D is
    constructed from H, H can return based on what /would/ happen if H >>>>>> did
    not stop simulating so that H(D,D) == false is correct even though >>>>>> D(D)
    halts?".  Just imagine what Sipser would say to that!
    Is this an accurate phrasing, pete?

    Deciders never compute the mapping of the computation
    that they themselves are contained within.

    Why not? A decider always either accepts or rejects its input.

    The computation that they themselves are contained within cannot
    possibly be an input.
    No, but the description of their own computation can be part of the input.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Wed Aug 28 16:42:33 2024
    Op 28.aug.2024 om 14:50 schreef olcott:
    On 8/28/2024 7:35 AM, Fred. Zwarts wrote:
    Op 28.aug.2024 om 13:46 schreef olcott:
    On 8/28/2024 2:33 AM, Mikko wrote:
    On 2024-08-27 13:04:26 +0000, olcott said:

    On 8/27/2024 12:45 AM, joes wrote:
    Am Mon, 26 Aug 2024 18:03:41 -0500 schrieb olcott:
    On 8/26/2024 7:42 AM, Ben Bacarisse wrote:
    Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes: >>>>>>>>> On 23/08/2024 22:07, Ben Bacarisse wrote:

    We don't really know what context Sipser was given.  I got in >>>>>>>>>> touch
    at the time so I do know he had enough context to know that PO's >>>>>>>>>> ideas were "wacky" and that had agreed to what he considered a >>>>>>>>>> "minor
    remark". Since PO considers his words finely crafted and key >>>>>>>>>> to his
    so-called work I think it's clear that Sipser did not take the >>>>>>>>>> "minor
    remark" he agreed to to mean what PO takes it to mean!  My own >>>>>>>>>> take
    if that he (Sipser) read it as a general remark about how to >>>>>>>>>> determine some cases, i.e. that D names an input that H can >>>>>>>>>> partially
    simulate to determine it's halting or otherwise.  We all know or >>>>>>>>>> could construct some such cases.

    Exactly my reading.  It makes Sipser's agreement natural,
    because it
    is both correct [with sensible interpretation of terms], and >>>>>>>>> moreover
    describes an obvious strategy that a partial decider might use >>>>>>>>> that
    can decide halting for some specific cases.  No need for Sipser >>>>>>>>> to be
    deceptive or misleading here, when the truth suffices.  (In >>>>>>>>> particular
    no need to employ "tricksy" vacuous truth get out clauses just >>>>>>>>> to get
    PO off his back as some have suggested.)

    Yes, and it fits with his thinking it a "trivial remark".

    That aside, it's such an odd way to present an argument: "I
    managed to
    trick X into saying 'yes' to something vague".  In any reasonable >>>>>>>> collegiate exchange you'd go back and check: "So even when D is >>>>>>>> constructed from H, H can return based on what /would/ happen if >>>>>>>> H did
    not stop simulating so that H(D,D) == false is correct even
    though D(D)
    halts?".  Just imagine what Sipser would say to that!
    Is this an accurate phrasing, pete?

    Deciders never compute the mapping of the computation
    that they themselves are contained within.

    Why not? A decider always either accepts or rejects its input.

    The computation that they themselves are contained within cannot
    possibly be an input.
    No, but the description of their own computation can be part of the
    input.

    As I have proved many hundreds of times
    THIS FREAKING HAS FREAKING DIFFERENT FREAKING BEHAVIOR
    when each are emulated according to the semantics of the x86 language.

    And each time your were proved incorrect. But you do not learn from your mistakes.
    The semantics of the x86 language is exactly the same in the direct
    execution, in the simulation and in the simulation by HHH. So, when HHH
    aborts too soon, it deviates from this semantics, by skipping
    instructions that x86 would process.


    Disagreeing with the semantics of the x86 language is like
    freaking disagreeing with freaking arithmetic you DF !!!


    You can apply these strong words to your HHH:
    Why does your HHH deviate from the semantics of the x86 language by
    skipping instructions that the x86 language would process up to the end
    of the program? (As seen in the direct execution.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Thu Aug 29 11:00:37 2024
    On 2024-08-28 11:46:58 +0000, olcott said:

    On 8/28/2024 2:33 AM, Mikko wrote:
    On 2024-08-27 13:04:26 +0000, olcott said:

    On 8/27/2024 12:45 AM, joes wrote:
    Am Mon, 26 Aug 2024 18:03:41 -0500 schrieb olcott:
    On 8/26/2024 7:42 AM, Ben Bacarisse wrote:
    Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
    On 23/08/2024 22:07, Ben Bacarisse wrote:

    We don't really know what context Sipser was given.  I got in touch >>>>>>>> at the time so I do know he had enough context to know that PO's >>>>>>>> ideas were "wacky" and that had agreed to what he considered a "minor >>>>>>>> remark". Since PO considers his words finely crafted and key to his >>>>>>>> so-called work I think it's clear that Sipser did not take the "minor >>>>>>>> remark" he agreed to to mean what PO takes it to mean!  My own take >>>>>>>> if that he (Sipser) read it as a general remark about how to
    determine some cases, i.e. that D names an input that H can partially >>>>>>>> simulate to determine it's halting or otherwise.  We all know or >>>>>>>> could construct some such cases.

    Exactly my reading.  It makes Sipser's agreement natural, because it >>>>>>> is both correct [with sensible interpretation of terms], and moreover >>>>>>> describes an obvious strategy that a partial decider might use that >>>>>>> can decide halting for some specific cases.  No need for Sipser to be >>>>>>> deceptive or misleading here, when the truth suffices.  (In particular >>>>>>> no need to employ "tricksy" vacuous truth get out clauses just to get >>>>>>> PO off his back as some have suggested.)

    Yes, and it fits with his thinking it a "trivial remark".

    That aside, it's such an odd way to present an argument: "I managed to >>>>>> trick X into saying 'yes' to something vague".  In any reasonable >>>>>> collegiate exchange you'd go back and check: "So even when D is
    constructed from H, H can return based on what /would/ happen if H did >>>>>> not stop simulating so that H(D,D) == false is correct even though D(D) >>>>>> halts?".  Just imagine what Sipser would say to that!
    Is this an accurate phrasing, pete?

    Deciders never compute the mapping of the computation
    that they themselves are contained within.

    Why not? A decider always either accepts or rejects its input.

    The computation that they themselves are contained within cannot
    possibly be an input.

    What would prevent that if the input language permits computations?

    For example, every computation can be given to an UTM. That computation
    may involve a decider X that uses the same input language. What
    What prevents giving X the same input as the UTM was given?

    --
    Mikko

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