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.
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.
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.
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.
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:Making the interrelationships clearer and simpler
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. >>>>>
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?
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:Not at all. Once my C proof is understood a much deeper understanding >>>>> of the isomorphic Linz proof is achieved.
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. >>>>>
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.
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:Making the interrelationships clearer and simpler
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. >>>>>>
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.
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:Not at all. Once my C proof is understood a much deeper understanding >>>>>> of the isomorphic Linz proof is achieved.
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. >>>>>>
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.
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:and is therefore as irrelevant to those comments as the pair
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:The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>>> to how
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 >>>>>>>>>>>>
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 >>>>>>>>
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
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:and is therefore as irrelevant to those comments as the pair
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:The bottom of the page 319 is not a part of and not relevant >>>>>>>>>>>> to how
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 >>>>>>>>>>>>
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 >>>>>>>>
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.
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 55:42:03 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,687 |