• Re: Correcting the errors in the foundation of computation --- Last sticking point

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,comp.lang.c,comp.lang.c++ on Wed Oct 28 16:58:03 2026
    From Newsgroup: comp.lang.c++

    On 10/28/2026 4:42 PM, Python wrote:
    Peter,

    STOP quoting me as if my words supported your claims.


    then find the actual error below:

    I was truly ecstatic that someone finally
    expressly agreed with anything that I said.

    I told my closest friends that I would finally
    have closure in a matter of weeks.

    On 10/23/2026 3:54 AM, Python wrote:

    Peter, I understand perfectly well what I agreed to.

    I agreed that IF HHH keeps recursively simulating
    the HHH call encountered at DD line 03, then we obtain:

    HHH -> DD -> HHH -> DD -> ...

    and that recursive simulation does not naturally return.

    <begin>
    Your own "does not naturally return" means HHH
    does not reach its own "return" statement.

    When HHH does not reach its own "return" statement
    then DD never receives a value from HHH.

    When DD never receives a value from HHH then
    DD never reaches its own "return" statement.

    When DD never reaches its own "return" statement
    then the correctly simulated DD never stops running.
    <end>
    --
    Copyright 2026 Olcott

    Axiom 1 --- 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.

    Axiom 2 --- Correcting the misnomer term-of-the-art: decider
    Deciders must apply finite string transformation inference
    steps to their finite string inputs that are relevant to the
    decision criteria and make their decision on this basis.

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


    The essence of computation is applying finite
    string transformations to finite string inputs
    to derive outputs. // paraphrase of Emil Post

    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.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2