• Re: Correcting the errors in the foundation of computation

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

    On 31/10/2026 14:30, olcott wrote:
    On 10/31/2026 3:37 AM, Mikko wrote:
    On 30/10/2026 16:25, olcott wrote:
    On 10/30/2026 4:23 AM, Mikko wrote:
    On 29/10/2026 14:03, olcott wrote:
    On 10/29/2026 4:04 AM, Mikko wrote:
    On 26/10/2026 16:15, olcott wrote:
    On 10/26/2026 4:23 AM, Mikko wrote:
    It does not make sense to correct an error before an error is >>>>>>>> identified
    and analyzed.

    On 23/10/2026 21:10, olcott wrote:
    These terms are replaced:
    (a) "Turing machine description" is replaced with
    -a-a-a-a [Finite string source code for a Turing Machine]

    That does not make sense without a definition on "source code" >>>>>>>> in the
    context of Turing machines. A description can be required to
    have the
    form that can be used for a particular purpose but the term "source >>>>>>>> code" does not unless so defined earlier in the same opus.

    The term "Turing machine description" was vague because at the
    tome the term computation source code dis not exist and the
    TM description language had not be defined.

    There was nothing vague in Turing's original description of the
    "machine". The description language was as well defined as was
    needed.

    Source language is anyone of the languages anuone has ever used as >>>>>> for specifying a new Turing machine. A language used for writing
    an existing description in a more suitable way is not a source
    language.

    If you specify that your decider is given the "source code" of a
    Turing machine your decider must be able to interprete every
    source code as intended by its original author ever in cases
    where two authors give different meanings to the same strings.

    The bottom line is that:
    (a) My version written in C is equivalent to the TM versions

    Do you mean the TM deciders that don't exist?

    I mean that when all of the key details of the TM
    proofs that have been abstracted are made concrete
    and can be directly seen then prior misconceptions
    are corrected.

    Then you should reconsider your choice of words. Nobody understands
    your words above that way.

    Everyone "understands" my words as "Olcott is wrong
    no need to pay attention"

    Roughly so. If you want a different understanding you need different
    words.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Fri Nov 6 08:07:26 2026
    From Newsgroup: comp.theory

    On 11/6/2026 2:26 AM, Mikko wrote:
    On 31/10/2026 14:30, olcott wrote:
    On 10/31/2026 3:37 AM, Mikko wrote:
    On 30/10/2026 16:25, olcott wrote:
    On 10/30/2026 4:23 AM, Mikko wrote:
    On 29/10/2026 14:03, olcott wrote:
    On 10/29/2026 4:04 AM, Mikko wrote:
    On 26/10/2026 16:15, olcott wrote:
    On 10/26/2026 4:23 AM, Mikko wrote:
    It does not make sense to correct an error before an error is >>>>>>>>> identified
    and analyzed.

    On 23/10/2026 21:10, olcott wrote:
    These terms are replaced:
    (a) "Turing machine description" is replaced with
    -a-a-a-a [Finite string source code for a Turing Machine]

    That does not make sense without a definition on "source code" >>>>>>>>> in the
    context of Turing machines. A description can be required to >>>>>>>>> have the
    form that can be used for a particular purpose but the term >>>>>>>>> "source
    code" does not unless so defined earlier in the same opus.

    The term "Turing machine description" was vague because at the >>>>>>>> tome the term computation source code dis not exist and the
    TM description language had not be defined.

    There was nothing vague in Turing's original description of the
    "machine". The description language was as well defined as was
    needed.

    Source language is anyone of the languages anuone has ever used as >>>>>>> for specifying a new Turing machine. A language used for writing >>>>>>> an existing description in a more suitable way is not a source
    language.

    If you specify that your decider is given the "source code" of a >>>>>>> Turing machine your decider must be able to interprete every
    source code as intended by its original author ever in cases
    where two authors give different meanings to the same strings.

    The bottom line is that:
    (a) My version written in C is equivalent to the TM versions

    Do you mean the TM deciders that don't exist?

    I mean that when all of the key details of the TM
    proofs that have been abstracted are made concrete
    and can be directly seen then prior misconceptions
    are corrected.

    Then you should reconsider your choice of words. Nobody understands
    your words above that way.

    Everyone "understands" my words as "Olcott is wrong
    no need to pay attention"

    Roughly so. If you want a different understanding you need different
    words.


    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.

    Does anyone understand those words?
    --
    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:18:13 2026
    From Newsgroup: comp.theory

    On 06/11/2026 16:07, olcott wrote:
    On 11/6/2026 2:26 AM, Mikko wrote:
    On 31/10/2026 14:30, olcott wrote:
    On 10/31/2026 3:37 AM, Mikko wrote:
    On 30/10/2026 16:25, olcott wrote:
    On 10/30/2026 4:23 AM, Mikko wrote:
    On 29/10/2026 14:03, olcott wrote:
    On 10/29/2026 4:04 AM, Mikko wrote:
    On 26/10/2026 16:15, olcott wrote:
    On 10/26/2026 4:23 AM, Mikko wrote:
    It does not make sense to correct an error before an error is >>>>>>>>>> identified
    and analyzed.

    On 23/10/2026 21:10, olcott wrote:
    These terms are replaced:
    (a) "Turing machine description" is replaced with
    -a-a-a-a [Finite string source code for a Turing Machine] >>>>>>>>>>
    That does not make sense without a definition on "source code" >>>>>>>>>> in the
    context of Turing machines. A description can be required to >>>>>>>>>> have the
    form that can be used for a particular purpose but the term >>>>>>>>>> "source
    code" does not unless so defined earlier in the same opus.

    The term "Turing machine description" was vague because at the >>>>>>>>> tome the term computation source code dis not exist and the
    TM description language had not be defined.

    There was nothing vague in Turing's original description of the >>>>>>>> "machine". The description language was as well defined as was >>>>>>>> needed.

    Source language is anyone of the languages anuone has ever used as >>>>>>>> for specifying a new Turing machine. A language used for writing >>>>>>>> an existing description in a more suitable way is not a source >>>>>>>> language.

    If you specify that your decider is given the "source code" of a >>>>>>>> Turing machine your decider must be able to interprete every
    source code as intended by its original author ever in cases
    where two authors give different meanings to the same strings.

    The bottom line is that:
    (a) My version written in C is equivalent to the TM versions

    Do you mean the TM deciders that don't exist?

    I mean that when all of the key details of the TM
    proofs that have been abstracted are made concrete
    and can be directly seen then prior misconceptions
    are corrected.

    Then you should reconsider your choice of words. Nobody understands
    your words above that way.

    Everyone "understands" my words as "Olcott is wrong
    no need to pay attention"

    Roughly so. If you want a different understanding you need different
    words.

    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 "computation".
    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.

    That is true.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2