• Re: Entails that part of Sipser Approved Criteria has been met

    From Mikko@mikko.levanto@iki.fi to comp.theory,sci.logic on Fri Nov 6 10:53:13 2026
    From Newsgroup: comp.theory

    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.


    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    -a-a-a If simulating halt decider H correctly simulates its
    -a-a-a input D until H correctly determines that its simulated D
    -a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly
    determines that its simulated D would never stop running unless
    aborted.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Fri Nov 6 08:17:38 2026
    From Newsgroup: comp.theory

    On 11/6/2026 2:53 AM, Mikko wrote:
    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.


    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    -a-a-a-a If simulating halt decider H correctly simulates its
    -a-a-a-a input D until H correctly determines that its simulated D
    -a-a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly determines that its simulated D would never stop running unless
    aborted.


    *We already have a five-way mutual agreement on this last Sunday*

    Andr|- G. Isaak is still trying to get away with playing
    head games on this.

    There does not exist any implementation of C function HHH
    that simulates C function DD according to the operational
    semantics of C such that the simulated C function DD reaches
    its own simulated return statement in any N finite number of
    steps.

    If you don't know the C programming language then
    either learn it or go away.
    --
    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 Tue Nov 10 09:37:14 2026
    From Newsgroup: comp.theory

    On 06/11/2026 16:17, olcott wrote:
    On 11/6/2026 2:53 AM, Mikko wrote:
    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    -a-a-a-a If simulating halt decider H correctly simulates its
    -a-a-a-a input D until H correctly determines that its simulated D
    -a-a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly
    determines that its simulated D would never stop running unless
    aborted.

    *We already have a five-way mutual agreement on this last Sunday*

    An agreement is not a proof. As long as you nave no proof you
    have nothing.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Tue Nov 10 09:00:35 2026
    From Newsgroup: comp.theory

    On 11/10/2026 1:37 AM, Mikko wrote:
    On 06/11/2026 16:17, olcott wrote:
    On 11/6/2026 2:53 AM, Mikko wrote:
    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    -a-a-a-a If simulating halt decider H correctly simulates its
    -a-a-a-a input D until H correctly determines that its simulated D
    -a-a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly
    determines that its simulated D would never stop running unless
    aborted.

    *We already have a five-way mutual agreement on this last Sunday*

    An agreement is not a proof. As long as you nave no proof you
    have nothing.


    *If you don't want to agree to this then I don't want to take to you*
    There does not exist any implementation of C function HHH
    that simulates C function DD according to the operational
    semantics of C such that the simulated C function DD reaches
    its own simulated return statement in any N finite number of
    steps.
    --
    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 Wed Nov 11 10:47:54 2026
    From Newsgroup: comp.theory

    On 10/11/2026 17:00, olcott wrote:
    On 11/10/2026 1:37 AM, Mikko wrote:
    On 06/11/2026 16:17, olcott wrote:
    On 11/6/2026 2:53 AM, Mikko wrote:
    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>> -a-a-a-a If simulating halt decider H correctly simulates its
    -a-a-a-a input D until H correctly determines that its simulated D
    -a-a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly
    determines that its simulated D would never stop running unless
    aborted.

    *We already have a five-way mutual agreement on this last Sunday*

    An agreement is not a proof. As long as you nave no proof you
    have nothing.

    *If you don't want to agree to this then I don't want to take to you*

    Nobody cares what I agree. I only peresent reasons to disagree with you. Everyone is free to agree with you even when common sense disagrees.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory,sci.logic on Wed Nov 11 12:01:04 2026
    From Newsgroup: comp.theory

    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.


    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    -a-a-a If simulating halt decider H correctly simulates its
    -a-a-a input D until H correctly determines that its simulated D
    -a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.
    If it does then we get

    halt decider H correctly simulates its
    input D until H correctly determines
    that its simulated D would never stop
    running unless aborted

    Whether a part of crtiearia are met does not matter. Only the parts
    that are not met matter.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Wed Nov 11 08:05:46 2026
    From Newsgroup: comp.theory

    On 11/11/2026 2:47 AM, Mikko wrote:
    On 10/11/2026 17:00, olcott wrote:
    On 11/10/2026 1:37 AM, Mikko wrote:
    On 06/11/2026 16:17, olcott wrote:
    On 11/6/2026 2:53 AM, Mikko wrote:
    On 02/11/2026 17:41, olcott wrote:
    On 11/2/2026 8:50 AM, Python wrote:
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    Although Python may not agree that any aspect of the
    Sipser Approved Criteria has been met the above statement
    does semantically entail:

    "its simulated D would never stop running unless aborted"
    Python may not agree that it entails that none-the-less
    is does entail that.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>> -a-a-a-a If simulating halt decider H correctly simulates its
    -a-a-a-a input D until H correctly determines that its simulated D >>>>>> -a-a-a-a would never stop running unless aborted then

    The key missing piece is whether or not HHH sees that
    -a-a-a-a WHILE THE SIMULATION CONTINUES,
    -a-a-a-a DD DOES NOT REACH ITS RETURN.

    No, the key missisng piece is to determine whether H ever correctly
    determines that its simulated D would never stop running unless
    aborted.

    *We already have a five-way mutual agreement on this last Sunday*

    An agreement is not a proof. As long as you nave no proof you
    have nothing.

    *If you don't want to agree to this then I don't want to take to you*

    Nobody cares what I agree. I only peresent reasons to disagree with you. Everyone is free to agree with you even when common sense disagrees.


    If are incapable of understanding what I am saying
    then as 71 years of recovered from cancer twice
    still recovering from very severe PJP pneumonia
    I must be careful how I allocate my time so that
    I can get my work validated before I die.
    --
    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 Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Wed Nov 11 15:11:53 2026
    From Newsgroup: comp.theory

    On 11/11/2026 6:05 AM, olcott wrote:
    [...]
    If are incapable of understanding what I am saying
    then as 71 years of recovered from cancer twice
    still recovering from very severe PJP pneumonia
    I must be careful how I allocate my time so that
    I can get my work validated before I die.

    What about your transgressions on Earth?

    --- Synchronet 3.22a-Linux NewsLink 1.2