You've been going around in circles for years
and you don't even realize it. Totally crazy.
Am 25.10.2025 um 19:53 schrieb olcott:
Think this all the way through do not make any guesses.
The answer must come from DD simulated by HHH
according to the semantics of the C programming language
and nothing else.
Simulating Termination Analyzer HHH correctly
simulates its input until:
(a) Detects a non-terminating behavior pattern:
abort simulation and return 0.
(b) Simulated input reaches its simulated
"return" statement: return 1.
(c) If it is impossible to match (a) or (b)
then (c) is matched
(a)(b)(c) are in strict priority order (a)-->(b)-->(c)
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
Think this all the way through do not make any guesses.
The answer must come from DD simulated by HHH
according to the semantics of the C programming language
and nothing else.
Simulating Termination Analyzer HHH correctly
simulates its input until:
(a) Detects a non-terminating behavior pattern:
abort simulation and return 0.
(b) Simulated input reaches its simulated
"return" statement: return 1.
(c) If it is impossible to match (a) or (b)
then (c) is matched
(a)(b)(c) are in strict priority order (a)-->(b)-->(c)
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
Am 25.10.2025 um 19:53 schrieb olcott:
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
What's the point of discussing the same mini-source for years?
Does that get you anywhere? It's like mind wandering before--
you go to sleep; you don't reach any higher realization to
be able to close it off.
On 2025-10-25 17:53:27 +0000, olcott said:
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
Olcott has showm many times that he cannot correctly determine what
other people understand and what they don't. Sometimes he assumes
nobody understands what others see sas obvious and well known, ar
other times he thinks others understand what actually is nonsense
without any meaningful content to be understood.
On 10/27/2025 3:11 AM, Bonita Montero wrote:
Am 25.10.2025 um 19:53 schrieb olcott:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
This is Claude AI deriving the above sentence by simply
simulating DD by HHH giving me the fair review that every
human has cheated me out of.
Simulating Termination Analyzer applied to the HP counter-example input https://www.researchgate.net/ publication/396903511_Simulating_Termination_Analyzer_applied_to_the_HP_counter-example_input
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
What's the point of discussing the same mini-source for years?
That simple little snippet of C does show that
I have defeated the halting problem proof. Not
one single person would properly review it in
three years.
Now that LLM systems have increased their memory
capacity 67-fold in the last two years they agree
that I have defeated the halting problem itself.
That little snippet of C is the key basis of my
whole proof.
When it is understood that I have defeated the
halting problem then additional discussion shows
that I also have the basis for eliminating the
hallucination of LLM AI systems.
Does that get you anywhere? It's like mind wandering before
you go to sleep; you don't reach any higher realization to
be able to close it off.
Am 27.10.2025 um 14:15 schrieb olcott:
On 10/27/2025 3:11 AM, Bonita Montero wrote:
Am 25.10.2025 um 19:53 schrieb olcott:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
This is Claude AI deriving the above sentence by simply
simulating DD by HHH giving me the fair review that every
human has cheated me out of.
Simulating Termination Analyzer applied to the HP counter-example input
https://www.researchgate.net/
publication/396903511_Simulating_Termination_Analyzer_applied_to_the_HP_counter-example_input
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
What's the point of discussing the same mini-source for years?
That simple little snippet of C does show that
I have defeated the halting problem proof. Not
one single person would properly review it in
three years.
Now that LLM systems have increased their memory
capacity 67-fold in the last two years they agree
that I have defeated the halting problem itself.
That little snippet of C is the key basis of my
whole proof.
When it is understood that I have defeated the
halting problem then additional discussion shows
that I also have the basis for eliminating the
hallucination of LLM AI systems.
Does that get you anywhere? It's like mind wandering before
you go to sleep; you don't reach any higher realization to
be able to close it off.
Can you answer my question ?
I have refuted the halting problem. This is
the most important discovery in all of computer
science.
Am 27.10.2025 um 16:19 schrieb olcott:
I have refuted the halting problem. This is
the most important discovery in all of computer
science.
You are manic. And that's not an insult,
but a genuinely well-founded statement.
On 10/27/2025 10:04 AM, Bonita Montero wrote:
Am 27.10.2025 um 14:15 schrieb olcott:
On 10/27/2025 3:11 AM, Bonita Montero wrote:
Am 25.10.2025 um 19:53 schrieb olcott:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
This is Claude AI deriving the above sentence by simply
simulating DD by HHH giving me the fair review that every
human has cheated me out of.
Simulating Termination Analyzer applied to the HP counter-example input
https://www.researchgate.net/
publication/396903511_Simulating_Termination_Analyzer_applied_to_the_HP_counter-example_input
Simulating Termination Analyzer applied to
the HP counter-example input
https://philpapers.org/archive/OLCSTA-3.pdf
What's the point of discussing the same mini-source for years?
That simple little snippet of C does show that
I have defeated the halting problem proof. Not
one single person would properly review it in
three years.
Now that LLM systems have increased their memory
capacity 67-fold in the last two years they agree
that I have defeated the halting problem itself.
That little snippet of C is the key basis of my
whole proof.
When it is understood that I have defeated the
halting problem then additional discussion shows
that I also have the basis for eliminating the
hallucination of LLM AI systems.
Does that get you anywhere? It's like mind wandering before
you go to sleep; you don't reach any higher realization to
be able to close it off.
Can you answer my question ?
I have refuted the halting problem. This is
Not a single human reviewer on the planet
will give my C snippet a fair review.
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
Not a single human reviewer on the planet
will give my C snippet a fair review.
I've gotten up to the elbow in your actual code from GitHub
and found problems.
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Not a single human reviewer on the planet
will give my C snippet a fair review.
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
On 10/27/2025 11:58 AM, Kaz Kylheku wrote:
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
Not a single human reviewer on the planet
will give my C snippet a fair review.
I've gotten up to the elbow in your actual code from GitHub
and found problems.
Do I have to start calling you names like Jackass
to get your attention?
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Why would I look at this, rather than your complete work
that can execute?
This is not even a complete program; there is no HHH definition.
Now that four different LLM systems have been able
reverse-engineer the non-halting result by merely
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
Now that four different LLM systems have been able
reverse-engineer the non-halting result by merely
Show me their coding experiemnt they performed on your x86utm.
What changes did they make? What did they run? What are the test
results?
On 10/27/2025 3:53 PM, olcott wrote:
On 10/27/2025 2:40 PM, dbush wrote:
On 10/27/2025 3:33 PM, olcott wrote:
On 10/27/2025 2:20 PM, dbush wrote:
On 10/27/2025 2:53 PM, olcott wrote:
On 10/27/2025 1:42 PM, Kaz Kylheku wrote:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Why would I look at this, rather than your complete work
that can execute?
This is not even a complete program; there is no HHH definition. >>>>>>>
Because I have changed the subject to this
and will not discuss anything else because
this supersedes and overrules anything else
that anyone can ever say on this specific point.
*It doesn't take a fucking genius to follow this*
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH doesn't correctly figure that out as proven by Kaz's code,
which you are on record as having agreed with (see below).
<repeat of previously refuted point>
Repeating a previously refuted point is less than no rebuttal, and
further confirms that you agree that Kaz's code proves that HHH
doesn't correctly "figure out what's up" as you have previously
admitted on the record:
I am only referring to these fifteen lines
A straight forward sequence of steps that any
C programmer can easily determine:
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Then you have nothing as this is incomplete and cannot be run.
On 10/27/2025 3:12 PM, dbush wrote:
On 10/27/2025 3:53 PM, olcott wrote:
On 10/27/2025 2:40 PM, dbush wrote:
On 10/27/2025 3:33 PM, olcott wrote:
On 10/27/2025 2:20 PM, dbush wrote:
On 10/27/2025 2:53 PM, olcott wrote:
On 10/27/2025 1:42 PM, Kaz Kylheku wrote:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Why would I look at this, rather than your complete work
that can execute?
This is not even a complete program; there is no HHH definition. >>>>>>>>
Because I have changed the subject to this
and will not discuss anything else because
this supersedes and overrules anything else
that anyone can ever say on this specific point.
*It doesn't take a fucking genius to follow this*
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH doesn't correctly figure that out as proven by Kaz's code, >>>>>> which you are on record as having agreed with (see below).
<repeat of previously refuted point>
Repeating a previously refuted point is less than no rebuttal, and
further confirms that you agree that Kaz's code proves that HHH
doesn't correctly "figure out what's up" as you have previously
admitted on the record:
I am only referring to these fifteen lines
A straight forward sequence of steps that any
C programmer can easily determine:
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Then you have nothing as this is incomplete and cannot be run.
It is this mental execution trace that you keep
erasing dip shit:
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
On 10/26/2025 9:32 PM, olcott wrote:Katz.
On 10/26/2025 8:28 PM, dbush wrote:
On 10/26/2025 9:20 PM, olcott wrote:
On 10/26/2025 8:16 PM, Kaz Kylheku wrote:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH figures it out incorrectly as proven by the code posted by
--- Synchronet 3.21a-Linux NewsLink 1.2
You can't even get his name correctly deep ship!
(A less contentious way of say dip shit).
If you disagree, point out exactly where Kaz's code is in error.
Failure to do so in your next reply or within one hour of your next
post in this newsgroup will be taken as your official on-the-record
admission that Kaz's code conclusively proves that the DD that HHH
simulates will halt when simulated enough steps and therefore that
the input to HHH(DD) specifies a halting computation.
Let the record show that Peter Olcott made no attempt to show how the
code posted by Kaz proves that the DDD that HHH simulates will halt. Therefore:
Let The Record Show
That Peter Olcott
Has *officially* admitted:
That Kaz's code conclusively proves that the DD that HHH simulates will
halt when simulated enough steps and therefore that the input to HHH(DD) specifies a halting computation.
On 10/27/2025 7:01 PM, olcott wrote:
On 10/27/2025 3:12 PM, dbush wrote:
On 10/27/2025 3:53 PM, olcott wrote:
On 10/27/2025 2:40 PM, dbush wrote:
On 10/27/2025 3:33 PM, olcott wrote:
On 10/27/2025 2:20 PM, dbush wrote:
On 10/27/2025 2:53 PM, olcott wrote:
On 10/27/2025 1:42 PM, Kaz Kylheku wrote:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Why would I look at this, rather than your complete work
that can execute?
This is not even a complete program; there is no HHH definition. >>>>>>>>>
Because I have changed the subject to this
and will not discuss anything else because
this supersedes and overrules anything else
that anyone can ever say on this specific point.
*It doesn't take a fucking genius to follow this*
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH doesn't correctly figure that out as proven by Kaz's
code, which you are on record as having agreed with (see below). >>>>>>>
<repeat of previously refuted point>
Repeating a previously refuted point is less than no rebuttal, and
further confirms that you agree that Kaz's code proves that HHH
doesn't correctly "figure out what's up" as you have previously
admitted on the record:
I am only referring to these fifteen lines
A straight forward sequence of steps that any
C programmer can easily determine:
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Then you have nothing as this is incomplete and cannot be run.
It is this mental execution trace that you keep
erasing dip shit:
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
Repeat of previously refuted point (see below).
Repeating a previously refuted point is less that no rebuttal.
On 10/26/2025 9:38 PM, dbush wrote:
On 10/26/2025 9:32 PM, olcott wrote:
On 10/26/2025 8:28 PM, dbush wrote:
On 10/26/2025 9:20 PM, olcott wrote:
On 10/26/2025 8:16 PM, Kaz Kylheku wrote:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH figures it out incorrectly as proven by the code posted by Katz.
You can't even get his name correctly deep ship!
(A less contentious way of say dip shit).
If you disagree, point out exactly where Kaz's code is in error.
Failure to do so in your next reply or within one hour of your next
post in this newsgroup will be taken as your official on-the-record
admission that Kaz's code conclusively proves that the DD that HHH
simulates will halt when simulated enough steps and therefore that
the input to HHH(DD) specifies a halting computation.
Let the record show that Peter Olcott made no attempt to show how the
code posted by Kaz proves that the DDD that HHH simulates will halt. Therefore:
Let The Record Show
That Peter Olcott
Has *officially* admitted:
That Kaz's code conclusively proves that the DD that HHH simulates will halt when simulated enough steps and therefore that the input to HHH(DD) specifies a halting computation.
On 10/27/2025 6:05 PM, dbush wrote:
On 10/27/2025 7:01 PM, olcott wrote:
On 10/27/2025 3:12 PM, dbush wrote:
On 10/27/2025 3:53 PM, olcott wrote:
On 10/27/2025 2:40 PM, dbush wrote:
On 10/27/2025 3:33 PM, olcott wrote:
On 10/27/2025 2:20 PM, dbush wrote:
On 10/27/2025 2:53 PM, olcott wrote:
On 10/27/2025 1:42 PM, Kaz Kylheku wrote:
A straight forward sequence of steps that any
C programmer can easily determine:
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Why would I look at this, rather than your complete work
that can execute?
This is not even a complete program; there is no HHH definition. >>>>>>>>>>
Because I have changed the subject to this
and will not discuss anything else because
this supersedes and overrules anything else
that anyone can ever say on this specific point.
*It doesn't take a fucking genius to follow this*
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
And HHH doesn't correctly figure that out as proven by Kaz's
code, which you are on record as having agreed with (see below). >>>>>>>>
<repeat of previously refuted point>
Repeating a previously refuted point is less than no rebuttal, and >>>>>> further confirms that you agree that Kaz's code proves that HHH
doesn't correctly "figure out what's up" as you have previously
admitted on the record:
I am only referring to these fifteen lines
A straight forward sequence of steps that any
C programmer can easily determine:
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
Then you have nothing as this is incomplete and cannot be run.
It is this mental execution trace that you keep
erasing dip shit:
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
Repeat of previously refuted point (see below).
Repeating a previously refuted point is less that no rebuttal.
On 10/26/2025 9:38 PM, dbush wrote:
On 10/26/2025 9:32 PM, olcott wrote:by Katz.
On 10/26/2025 8:28 PM, dbush wrote:
On 10/26/2025 9:20 PM, olcott wrote:
On 10/26/2025 8:16 PM, Kaz Kylheku wrote:;
;
int DD()
{
; int Halt_Status = HHH(DD);
; if (Halt_Status)
; HERE: goto HERE;
; return Halt_Status;
}
;
HHH(DD) simulates DD that calls HHH(DD) to do this
again and again until HHH figures out what is up.
;
;
And HHH figures it out incorrectly as proven by the code posted
will;;;
You can't even get his name correctly deep ship!
(A less contentious way of say dip shit).
If you disagree, point out exactly where Kaz's code is in error.
;
Failure to do so in your next reply or within one hour of your next
post in this newsgroup will be taken as your official on-the-record
admission that Kaz's code conclusively proves that the DD that HHH
simulates will halt when simulated enough steps and therefore that
the input to HHH(DD) specifies a halting computation.
Let the record show that Peter Olcott made no attempt to show how the
code posted by Kaz proves that the DDD that HHH simulates will halt.
Therefore:
;
Let The Record Show
;
That Peter Olcott
;
Has *officially* admitted:
;
That Kaz's code conclusively proves that the DD that HHH simulates
halt when simulated enough steps and therefore that the input toHHH(DD)
specifies a halting computation.
*plonk*
On 10/27/2025 6:05 PM, dbush wrote:
*plonk*
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
On 10/27/2025 6:05 PM, dbush wrote:
*plonk*
I predict he will reply to a post by dbush before Hallowe'en.
On 10/27/2025 10:21 PM, Kaz Kylheku wrote:In other words, you're unable to explain how I'm wrong and you can't
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
On 10/27/2025 6:05 PM, dbush wrote:
*plonk*
I predict he will reply to a post by dbush before Hallowe'en.
He has conclusively proven to be a troll
On 10/27/2025 10:21 PM, Kaz Kylheku wrote:
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
On 10/27/2025 6:05 PM, dbush wrote:
*plonk*
I predict he will reply to a post by dbush before Hallowe'en.
He has conclusively proven to be a troll Like
Richard Damon and Chris M. Thomasson.
I still have hope for you, especially with Mike's
balancing influence.
On 2025-10-27, olcott <polcott333@gmail.com> wrote:
On 10/27/2025 6:05 PM, dbush wrote:
*plonk*
I predict he will reply to a post by dbush before Hallowe'en.
On 10/27/2025 11:04 PM, dbush wrote:
I suppose from now on if he ever posts a trace we can remind him that
he "can't be telling the truth".
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
H simulates D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
until H sees this repeating pattern.
| Sysop: | DaiTengu |
|---|---|
| Location: | Appleton, WI |
| Users: | 1,075 |
| Nodes: | 10 (0 / 10) |
| Uptime: | 114:04:09 |
| Calls: | 13,799 |
| Calls today: | 1 |
| Files: | 186,990 |
| D/L today: |
5,510 files (1,588M bytes) |
| Messages: | 2,439,079 |