• How do correct partial halt deciders actually work?

    From olcott@polcott333@gmail.com to comp.theory,sci.logic on Thu Nov 5 09:37:10 2026
    From Newsgroup: sci.logic

    HHH examines the exact HP input that was defined to do the opposite of whatever value that it reports. Just like strcmp() must actually compare strings every halt decider must examine behavior. The behavior that is
    being examined is the behavior specified by the input finite string of source-code. It must be examined within the operational semantics of the source language of computation. Static analysis might be allowed yet
    only if it derives the exact same steps as DD simulated by HHH.

    Correct rebuttals to this require showing all of the detailed steps
    of how a partial halt decider correctly determines the halt status
    of an input finite string of source-code through deriving behavior
    that has a different sequence of steps than input simulated by decider.
    --
    Copyright 2026 Olcott

    Computation(Olcott)
    Paraphrase of Emil Post definition of computation
    All computations are equivalent to the application of finite
    string transformation rules to finite string inputs to derive
    any and all outputs.

    Because Post canonical systems are Turing-equivalent, anything
    that cannot be derived by applying finite string transformations
    to finite strings is outside the scope of ChurchrCoTuring computation.

    Decider(Olcott)
    Correcting the misnomer term-of-the-art: decider
    Every Decider(Olcott) must apply finite string transformation
    inference steps to their finite string inputs that are relevant
    to the decision criteria. It must make its decision on this basis.

    Halt Decider(Olcott)
    Decider(Olcott) entails that Halt Decider(Olcott) H(D) must apply
    finite-string inference steps according to the operational semantics
    of the source-code computation language of D. The only way to determine
    the halting property of a finite string input is to examine the same
    behavior as the behavior of D simulated by H.

    *Succinct refutation of the Halting Theorem* https://github.com/plolcott/x86utm/blob/master/README.md

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of general knowledge.
    The complete structure of this system is now defined.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Fred. Zwarts@F.Zwarts@HetNet.nl to comp.theory,sci.logic on Sat Nov 7 11:58:06 2026
    From Newsgroup: sci.logic

    Op 05.nov.2026 om 16:37 schreef olcott:
    HHH examines the exact HP input that was defined to do the opposite of whatever value that it reports.
    Completely irrelevant, because HHH does not even reach the part where
    the input decides to do the opposite.
    HHH will report any program that uses HHH as non-halting, whether or not
    it does the opposite.
    Olcott confirmed that when the following program runs, main returns and reports main as non-halting. (Or HHH returns and reports HHH as
    non-halting.) A very simple false negative.

    int main() {
    return HHH(main);
    }


    All Olcott's talking about 'pathological' and 'doing the opposite', is irrelevant and distracting to see the errors in HHH.
    But is is unable to pay full attention to these words, because he is so convinced that he cannot be wrong, that he simply ignores all rebuttals.
    --- Synchronet 3.22a-Linux NewsLink 1.2