• Re: HHH(DD) implements the The Peter Linz decider/input pair in C

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

    On 31/10/2026 14:28, olcott wrote:
    On 10/31/2026 3:23 AM, Mikko wrote:
    On 30/10/2026 14:57, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If >>>>>>>>>>>>> so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior
    of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" or >>>>>>>>>> "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant to how >>>>>>>> Linz has already defined the haliting problem on pages 317-318. >>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself.

    Making the interrelationships clearer and simpler
    while maintaining complete accuracy enables these
    foundational elements to be understood much more deeply.

    A switch of topic does not make anything cleare or simpler. It only
    makes you look afraid of the truth about the original topic.

    int never_makes_any_actual_decision_about_it_input(char* s){ return 1; }
    is a misnomer

    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.

    That you refuse to stay on topic shows that you are know your attempt
    to deceive failed and you only wnat that readers forget it.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Fri Nov 6 10:57:06 2026
    From Newsgroup: comp.theory

    On 31/10/2026 14:29, olcott wrote:
    On 10/31/2026 3:26 AM, Mikko wrote:
    On 30/10/2026 16:21, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If >>>>>>>>>>>>> so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior
    of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" or >>>>>>>>>> "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant to how >>>>>>>> Linz has already defined the haliting problem on pages 317-318. >>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself.

    Not at all. Once my C proof is understood a much deeper understanding
    of the isomorphic Linz proof is achieved.

    That will not happen as long as you refuse to discuss the context and
    goal of the proof.

    You are just stonewalling.

    The readers may want to know whether you are deceptive.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Fri Nov 6 08:11:47 2026
    From Newsgroup: comp.theory

    On 11/6/2026 2:33 AM, Mikko wrote:
    On 31/10/2026 14:28, olcott wrote:
    On 10/31/2026 3:23 AM, Mikko wrote:
    On 30/10/2026 14:57, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior
    of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant to >>>>>>>>> how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself.

    Making the interrelationships clearer and simpler
    while maintaining complete accuracy enables these
    foundational elements to be understood much more deeply.

    A switch of topic does not make anything cleare or simpler. It only
    makes you look afraid of the truth about the original topic.

    int never_makes_any_actual_decision_about_it_input(char* s){ return 1; }
    is a misnomer

    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.

    That you refuse to stay on topic shows that you are know your attempt
    to deceive failed and you only wnat that readers forget it.


    So you are trying to get away with saying that
    the way the deciders actually work is not relevant
    to halt deciders?
    --
    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 olcott@polcott333@gmail.com to comp.theory on Fri Nov 6 08:21:47 2026
    From Newsgroup: comp.theory

    On 11/6/2026 2:57 AM, Mikko wrote:
    On 31/10/2026 14:29, olcott wrote:
    On 10/31/2026 3:26 AM, Mikko wrote:
    On 30/10/2026 16:21, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior
    of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant to >>>>>>>>> how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself.

    Not at all. Once my C proof is understood a much deeper understanding
    of the isomorphic Linz proof is achieved.

    That will not happen as long as you refuse to discuss the context and
    goal of the proof.

    You are just stonewalling.

    The readers may want to know whether you are deceptive.


    If the readers don't know C they lack the minimum
    required prerequisites. Five LLMs have fully validated
    every aspect of my work dozens of times each even
    when you tell them turn sycophancy off. All that they
    do that no human will ever do is pay complete attention.
    --
    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 10:23:43 2026
    From Newsgroup: comp.theory

    On 06/11/2026 16:11, olcott wrote:
    On 11/6/2026 2:33 AM, Mikko wrote:
    On 31/10/2026 14:28, olcott wrote:
    On 10/31/2026 3:23 AM, Mikko wrote:
    On 30/10/2026 14:57, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself. >>>>>
    Making the interrelationships clearer and simpler
    while maintaining complete accuracy enables these
    foundational elements to be understood much more deeply.

    A switch of topic does not make anything cleare or simpler. It only
    makes you look afraid of the truth about the original topic.

    int never_makes_any_actual_decision_about_it_input(char* s){ return 1; } >>> is a misnomer

    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.

    That you refuse to stay on topic shows that you are know your attempt
    to deceive failed and you only wnat that readers forget it.

    So you are trying to get away with saying that
    the way the deciders actually work is not relevant
    to halt deciders?

    No, I'm trying to stay on the topic of your earlier message.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Tue Nov 10 10:37:34 2026
    From Newsgroup: comp.theory

    On 06/11/2026 16:21, olcott wrote:
    On 11/6/2026 2:57 AM, Mikko wrote:
    On 31/10/2026 14:29, olcott wrote:
    On 10/31/2026 3:26 AM, Mikko wrote:
    On 30/10/2026 16:21, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>> includes all possible output sequences, it is not solvable >>>>>>>>>>>>>> for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this*
    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>
    Consequently, your false claims about the content of the page 319 >>>>>>>>>> are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about the >>>>>>>> halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself. >>>>>
    Not at all. Once my C proof is understood a much deeper understanding >>>>> of the isomorphic Linz proof is achieved.

    That will not happen as long as you refuse to discuss the context and
    goal of the proof.

    You are just stonewalling.

    The readers may want to know whether you are deceptive.

    If the readers don't know C they lack the minimum
    required prerequisites.

    I have a good knowledge of C as it was when I needed it for my work.
    More recent customers havn't wanted C programs so I have no experience
    on the new features of C.

    Programming in C is not much different from programming in Algol or
    Fortran or Ada. Even Prolog can be used the same way.
    --
    Mikko


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Tue Nov 10 09:10:08 2026
    From Newsgroup: comp.theory

    On 11/10/2026 2:23 AM, Mikko wrote:
    On 06/11/2026 16:11, olcott wrote:
    On 11/6/2026 2:33 AM, Mikko wrote:
    On 31/10/2026 14:28, olcott wrote:
    On 10/31/2026 3:23 AM, Mikko wrote:
    On 30/10/2026 14:57, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>>> includes all possible output sequences, it is not >>>>>>>>>>>>>>> solvable for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this* >>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>>
    Consequently, your false claims about the content of the page >>>>>>>>>>> 319
    are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about >>>>>>>>> the
    halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself. >>>>>>
    Making the interrelationships clearer and simpler
    while maintaining complete accuracy enables these
    foundational elements to be understood much more deeply.

    A switch of topic does not make anything cleare or simpler. It only
    makes you look afraid of the truth about the original topic.

    int never_makes_any_actual_decision_about_it_input(char* s){ return
    1; }
    is a misnomer

    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.

    That you refuse to stay on topic shows that you are know your attempt
    to deceive failed and you only wnat that readers forget it.

    So you are trying to get away with saying that
    the way the deciders actually work is not relevant
    to halt deciders?

    No, I'm trying to stay on the topic of your earlier message.


    Like my C code

    https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    Linz encodes his embedding of his machine H as -nq0
    Linz calls the finite string input to -n: Wm

    From the bottom of page 319
    q0 Wm Wm reo* -nq0 Wm Wm reo* -n.reR // accept state
    q0 Wm Wm reo* -nq0 Wm Wm reo* -n.qn // reject state

    has been adapted to this
    -n.q0 rf?-nrf- reo* -n.embedded_H rf?-nrf- rf?-nrf- reo* -n.reR, // accept state
    -n.q0 rf?-nrf- reo* -n.embedded_H rf?-nrf- rf?-nrf- reo* -n.qn // reject state

    rf?-nrf- more conventionally shows that -n is taking its
    own finite string machine description as its input.

    When embedded_H is a UTM based simulating halt decider then
    Simulation Invariant
    (a) -n copies its input rf?-nrf-
    (b) -n invokes embedded_H rf?-nrf- rf?-nrf-
    (c) embedded_H simulates rf?-nrf- rf?-nrf-

    The Linz -n.embedded_H rf?-nrf- rf?-nrf- gets stuck in recursive
    emulation that it can see. Thus is its basis to reject its input.
    --
    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 olcott@polcott333@gmail.com to comp.theory on Tue Nov 10 09:11:16 2026
    From Newsgroup: comp.theory

    On 11/10/2026 2:37 AM, Mikko wrote:
    On 06/11/2026 16:21, olcott wrote:
    On 11/6/2026 2:57 AM, Mikko wrote:
    On 31/10/2026 14:29, olcott wrote:
    On 10/31/2026 3:26 AM, Mikko wrote:
    On 30/10/2026 16:21, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? >>>>>>>>>>>>>>>> If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>>> includes all possible output sequences, it is not >>>>>>>>>>>>>>> solvable for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about "DD()" >>>>>>>>>>>>> or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this* >>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf

    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>>
    Consequently, your false claims about the content of the page >>>>>>>>>>> 319
    are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims about >>>>>>>>> the
    halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C

    and is therefore as irrelevant to those comments as the pair itself. >>>>>>
    Not at all. Once my C proof is understood a much deeper understanding >>>>>> of the isomorphic Linz proof is achieved.

    That will not happen as long as you refuse to discuss the context and >>>>> goal of the proof.

    You are just stonewalling.

    The readers may want to know whether you are deceptive.

    If the readers don't know C they lack the minimum
    required prerequisites.

    I have a good knowledge of C as it was when I needed it for my work.
    More recent customers havn't wanted C programs so I have no experience
    on the new features of C.

    Programming in C is not much different from programming in Algol or
    Fortran or Ada. Even Prolog can be used the same way.


    Only K&R C is needed. I have been working with it since then.
    --
    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 11:21:10 2026
    From Newsgroup: comp.theory

    On 10/11/2026 17:10, olcott wrote:
    On 11/10/2026 2:23 AM, Mikko wrote:
    On 06/11/2026 16:11, olcott wrote:
    On 11/6/2026 2:33 AM, Mikko wrote:
    On 31/10/2026 14:28, olcott wrote:
    On 10/31/2026 3:23 AM, Mikko wrote:
    On 30/10/2026 14:57, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>> On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not >>>>>>>>>>>>>>>>> solvable? If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>>>> includes all possible output sequences, it is not >>>>>>>>>>>>>>>> solvable for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about >>>>>>>>>>>>>> "DD()" or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this* >>>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf >>>>>>>>>>>>
    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>>>
    Consequently, your false claims about the content of the >>>>>>>>>>>> page 319
    are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims >>>>>>>>>> about the
    halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C >>>>>>>>
    and is therefore as irrelevant to those comments as the pair
    itself.

    Making the interrelationships clearer and simpler
    while maintaining complete accuracy enables these
    foundational elements to be understood much more deeply.

    A switch of topic does not make anything cleare or simpler. It only >>>>>> makes you look afraid of the truth about the original topic.

    int never_makes_any_actual_decision_about_it_input(char* s){ return >>>>> 1; }
    is a misnomer

    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.

    That you refuse to stay on topic shows that you are know your attempt
    to deceive failed and you only wnat that readers forget it.

    So you are trying to get away with saying that
    the way the deciders actually work is not relevant
    to halt deciders?

    No, I'm trying to stay on the topic of your earlier message.

    Like my C code

    Not that one but the one about the "key mistake in the halting theorem".
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Wed Nov 11 11:26:55 2026
    From Newsgroup: comp.theory

    On 10/11/2026 17:11, olcott wrote:
    On 11/10/2026 2:37 AM, Mikko wrote:
    On 06/11/2026 16:21, olcott wrote:
    On 11/6/2026 2:57 AM, Mikko wrote:
    On 31/10/2026 14:29, olcott wrote:
    On 10/31/2026 3:26 AM, Mikko wrote:
    On 30/10/2026 16:21, olcott wrote:
    On 10/30/2026 4:06 AM, Mikko wrote:
    On 29/10/2026 15:02, olcott wrote:
    On 10/29/2026 3:49 AM, Mikko wrote:
    On 25/10/2026 15:16, olcott wrote:
    On 10/25/2026 4:56 AM, Mikko wrote:
    On 07/10/2026 16:07, olcott wrote:
    On 10/7/2026 5:40 AM, Mikko wrote:
    On 02/10/2026 15:28, olcott wrote:
    On 10/1/2026 10:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote: >>>>>>>>>>>>>>>>> On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not >>>>>>>>>>>>>>>>> solvable? If so, so what?

    it is solvable for an enumerable set of machines that >>>>>>>>>>>>>>>> includes all possible output sequences, it is not >>>>>>>>>>>>>>>> solvable for all possible machines

    The key mistake of the halting theorem is that
    it requires a halt decider to report on the behavior >>>>>>>>>>>>>>> of the direct execution of DD() from main()

    No, it isn't. The halting problem says nothing about >>>>>>>>>>>>>> "DD()" or "main()".
    The halting problem asks "How can one determine whether a >>>>>>>>>>>>>> computation
    halts?"

    Here is the same thing from Linz where H and -n.embedded_H are >>>>>>>>>>>>> also based on UTM simulation of their inputs.

    *From the bottom of page 319 has been adapted to this* >>>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf >>>>>>>>>>>>
    The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>>> to how
    Linz has already defined the haliting problem on pages 317-318. >>>>>>>>>>>>
    Consequently, your false claims about the content of the >>>>>>>>>>>> page 319
    are irrlevant, too.

    The bottom of page 319 is the Linz halting problem
    counter-example input.

    And therefore irrelevant to comments to your false claims >>>>>>>>>> about the
    halting problem.

    HHH(DD) implements the The Peter Linz decider/input pair in C >>>>>>>>
    and is therefore as irrelevant to those comments as the pair
    itself.

    Not at all. Once my C proof is understood a much deeper
    understanding
    of the isomorphic Linz proof is achieved.

    That will not happen as long as you refuse to discuss the context and >>>>>> goal of the proof.

    You are just stonewalling.

    The readers may want to know whether you are deceptive.

    If the readers don't know C they lack the minimum
    required prerequisites.

    I have a good knowledge of C as it was when I needed it for my work.
    More recent customers havn't wanted C programs so I have no experience
    on the new features of C.

    Programming in C is not much different from programming in Algol or
    Fortran or Ada. Even Prolog can be used the same way.

    Only K&R C is needed. I have been working with it since then.

    I din't need even that. Experience with other languages, a C compiler
    and a manual that came with the compiler were sufficient.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2