• Re: Olcott is provably correct --- no one can correct refute this

    From Mikko@mikko.levanto@iki.fi to comp.theory on Fri Nov 6 10:23:23 2026
    From Newsgroup: comp.theory

    On 31/10/2026 14:04, olcott wrote:
    On 10/31/2026 4:11 AM, Mikko wrote:
    On 31/10/2026 05:14, olcott wrote:
    01 int DD()
    02 {
    03-a-a int Halt_Status = HHH(DD);
    04-a-a if (Halt_Status)
    05-a-a-a-a HERE: goto HERE;
    06-a-a return Halt_Status;
    07 }

    Mathematical proof of program correctness:
    Simulation invariant (while DD is simulated by HHH)
    Line 03: simulated DD() invokes simulated HHH(DD) that simulates DD()

    DD simulated by HHH according to the operational semantics
    of the C programming language cannot possibly reach its own
    simulated return statement while being simulated by HHH.

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH

    The proof is invalid. If HHH(DD) returns 0 then DD goes to line 6

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH
    It does not matter whether what you accept. What matters is that
    readers can see at least some of your errors.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Fri Nov 6 08:01:07 2026
    From Newsgroup: comp.theory

    On 11/6/2026 2:23 AM, Mikko wrote:
    On 31/10/2026 14:04, olcott wrote:
    On 10/31/2026 4:11 AM, Mikko wrote:
    On 31/10/2026 05:14, olcott wrote:
    01 int DD()
    02 {
    03-a-a int Halt_Status = HHH(DD);
    04-a-a if (Halt_Status)
    05-a-a-a-a HERE: goto HERE;
    06-a-a return Halt_Status;
    07 }

    Mathematical proof of program correctness:
    Simulation invariant (while DD is simulated by HHH)
    Line 03: simulated DD() invokes simulated HHH(DD) that simulates DD()

    DD simulated by HHH according to the operational semantics
    of the C programming language cannot possibly reach its own
    simulated return statement while being simulated by HHH.

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH

    The proof is invalid. If HHH(DD) returns 0 then DD goes to line 6

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH

    It does not matter whether what you accept. What matters is that
    readers can see at least some of your errors.


    Or respondents can falsely claim errors that
    they do not show because they know there are
    no errors.
    --
    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 Mikko@mikko.levanto@iki.fi to comp.theory on Mon Nov 9 11:11:34 2026
    From Newsgroup: comp.theory

    On 06/11/2026 16:01, olcott wrote:
    On 11/6/2026 2:23 AM, Mikko wrote:
    On 31/10/2026 14:04, olcott wrote:
    On 10/31/2026 4:11 AM, Mikko wrote:
    On 31/10/2026 05:14, olcott wrote:
    01 int DD()
    02 {
    03-a-a int Halt_Status = HHH(DD);
    04-a-a if (Halt_Status)
    05-a-a-a-a HERE: goto HERE;
    06-a-a return Halt_Status;
    07 }

    Mathematical proof of program correctness:
    Simulation invariant (while DD is simulated by HHH)
    Line 03: simulated DD() invokes simulated HHH(DD) that simulates DD() >>>>>
    DD simulated by HHH according to the operational semantics
    of the C programming language cannot possibly reach its own
    simulated return statement while being simulated by HHH.

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH

    The proof is invalid. If HHH(DD) returns 0 then DD goes to line 6

    The only acceptable rebuttal
    show exactly how DD reaches its return statement
    on line 06 while DD is being simulated by HHH

    It does not matter whether what you accept. What matters is that
    readers can see at least some of your errors.

    Or respondents can falsely claim errors that
    they do not show because they know there are
    no errors.

    If that is suspected if would be helpful to ask why they think it
    is an error. One might also ask about the nature of the error if
    that is not clear.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2