• on the nature of undecidability within computing

    From dart200@user7160@newsgrouper.org.invalid to sci.logic,comp.theory,alt.messianic,alt.buddha.short.fat.guy on Fri Nov 6 00:35:05 2026
    From Newsgroup: alt.buddha.short.fat.guy

    On 11/5/26 11:18 PM, dart200 wrote:
    On 11/5/26 6:53 PM, olcott wrote:
    [an input that does the opposite of
    -a-awhat one particular decider outputs]
    -a-ais inherently incoherent.

    If it gets a return value to do the opposite of
    then it is the caller of the decider and not
    the input to this same decider. If it is the

    the paradoxical machine constructs an in memory copy of it's own
    definition using a quine, and then submits that copy to the decider for analysis

    the thing u don't understand polcott is that paradoxical machines do not
    exist by anyone's choice, not even a god could do fuck all about them

    if giving a set of finite string transformations that attempts to
    compute the halting function, totally, partially, or otherwise...

    some paradoxical machine is simply a logical possibility (and more so
    infinite variations of which) that can be written as a series of finite
    string transformations. its existence in the total enumeration of finite string transformations, is necessarily implied by any existence of any
    finite string transformation, that attempts to compute the halting
    function, totally, partially, or otherwise

    HHH does exist, u wrote it. therefore must DD does exist, which u also
    wrote, so theory aligns with evidence

    for any HHH_N, of which there are infinite variations of, that compute difference infinite slices of the total halting function, however
    accurate, there will necessarily be some DD1 analogy for it that is necessarily not in that slice.

    that just is the nature of undecidability within computing, whatcha
    gunna do about it polcott?

    in my opinion the real question we should be asking is which infinite
    slice we're truly interested in, which honestly we've answered quite
    poorly thus far


    input to a decider then it is not the caller
    of this same decider. One can be a father or
    a son one can fill both roles for the same person.
    One cannot be onerCOs own father.

    it's more akin to cloning itself polcott. and yes machines can do this,
    the technique isn't that complicated


    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf



    --
    arising us out of the computing dark ages,
    please excuse my pseudo-pyscript,
    ~ the lil crank that could

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to sci.logic,comp.theory,alt.messianic,alt.buddha.short.fat.guy on Fri Nov 6 11:45:19 2026
    From Newsgroup: alt.buddha.short.fat.guy

    On 11/6/2026 12:35 AM, dart200 wrote:
    On 11/5/26 11:18 PM, dart200 wrote:
    On 11/5/26 6:53 PM, olcott wrote:
    [an input that does the opposite of
    -a-awhat one particular decider outputs]
    -a-ais inherently incoherent.

    If it gets a return value to do the opposite of
    then it is the caller of the decider and not
    the input to this same decider. If it is the

    the paradoxical machine constructs an in memory copy of it's own
    definition using a quine, and then submits that copy to the decider
    for analysis

    the thing u don't understand polcott is that paradoxical machines do not exist by anyone's choice, not even a god could do fuck all about them

    if giving a set of finite string transformations that attempts to
    compute the halting function, totally, partially, or otherwise...

    some paradoxical machine is simply a logical possibility (and more so infinite variations of which) that can be written as a series of finite string transformations. its existence in the total enumeration of finite string transformations, is necessarily implied by any existence of any finite string transformation, that attempts to compute the halting
    function, totally, partially, or otherwise

    HHH does exist, u wrote it. therefore must DD does exist, which u also wrote, so theory aligns with evidence

    for any HHH_N, of which there are infinite variations of, that compute difference infinite slices of the total halting function, however
    accurate, there will necessarily be some DD1 analogy for it that is necessarily not in that slice.

    that just is the nature of undecidability within computing, whatcha
    gunna do about it polcott?

    in my opinion the real question we should be asking is which infinite
    slice we're truly interested in, which honestly we've answered quite
    poorly thus far

    Call me skeptical. It just doesn't compute. YMMV.

    Alright, I'm at C:\



    input to a decider then it is not the caller
    of this same decider. One can be a father or
    a son one can fill both roles for the same person.
    One cannot be onerCOs own father.

    it's more akin to cloning itself polcott. and yes machines can do
    this, the technique isn't that complicated


    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf





    --- Synchronet 3.22a-Linux NewsLink 1.2