• Re: Complexity of Engineering products (Was: How to make a halt decider?)

    From olcott@polcott333@gmail.com to comp.theory,sci.logic on Fri Nov 13 08:40:16 2026
    From Newsgroup: sci.logic

    On 11/13/2026 7:34 AM, Tristan Wibberley wrote:
    On 09/11/2026 23:08, olcott wrote:

    No Silver Bullet
    Essence and Accidents
    of Software Engineering
    TR86-020
    September 1986
    https://www.cs.unc.edu/techreports/86-020.pdf

    Turing award winner Frederick Brooks showed how
    and why eliminating inessential complexity is
    crucially important.


    pfft, never eliminating even the slightest essential complexity is
    critical. That means it is crucial to be utterly perfect in every way.
    Even Mary Poppins only achieved practical perfection!

    Frederick Brooks was wrong. I bet he couldn't even give which objective measure of complexity he was referring to.



    He called it accidental complexity as applies when
    systems are being created. I renamed to this inessential
    complexity such that string rewrite systems can be
    used for exploring computation in a simpler equivalent
    model than Turing Machines.
    --
    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