• Computation defined

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,comp.ai.philosophy,sci.math on Mon Nov 2 21:29:59 2026
    From Newsgroup: comp.ai.philosophy

    Computation defined
    Paraphrase of Emil Post definition of computation
    All computations are equivalent applying 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 of the domain
    of ChurchrCoTuring computable functions.
    --
    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,sci.logic,comp.ai.philosophy,sci.math on Wed Nov 11 12:03:55 2026
    From Newsgroup: comp.ai.philosophy

    On 03/11/2026 05:29, olcott wrote:
    Computation defined
    Paraphrase of Emil Post definition of computation
    All computations are equivalent applying finite string
    transformation rules to finite string inputs to derive
    any and all outputs.
    That does not define. In particular, it does not say anything
    about non-computations that are equivalent applying finte
    string transformation rules to finite string inputs to derive
    any and all outputs.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2