From Newsgroup: comp.lang.c

On 10/28/2025 8:03 AM, wij wrote:

On Mon, 2025-10-27 at 23:29 -0700, Chris M. Thomasson wrote:

Humm...

1 HOME
5 PRINT "The Olcott All-in-One Halt Decider!"
10 INPUT "Shall I halt or not? " ; A$
30 IF A$ = "YES" GOTO 666
40 GOTO 10
666 PRINT "OK!"

Yes, HP is just that simple. The not-so-simple part (just a little bit) is making it precise to become a theorem. olcott wants to save human (not really)
and AI industry. BASIC is too... well, kid stuff, not famous and big enough to
exhibit the 3% intelligence. Being Simple and clear is olcott's enermy.

*D simulated by H cannot possibly reach past its own first line*

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.

Even Olcott asks what should HHH(DD) return? Humm...

His shit HHH crap aside for a moment. Why does he even ask what HHH(DD)
should return to begin with? Shit man. Sounds of toilets flushing in the
background...

Say Olcott got HHH(DD) right for his DD, he would have to say it
sometimes halts, other times it does not. HHH(DD) is Olcotts dictator?
Humm... ;^o

Change DD's logic and Olcott needs to try to make a brand new HHH?

Why did Olcott ever even ask what should HHH(DD) return anyway? Humm...

The fungi? in the brain seems allergy to 'undecidable'. E.g.

Q1: What is the value of proposition "asdf!!#@#@"? Yes or No (or Undecidable
if none fits).
Q2: What time is it? Yes or No (or Undecidable if none fits)

olcott cannot answer!

--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 10/28/2025 10:19 AM, wij wrote:

On Tue, 2025-10-28 at 09:29 -0500, olcott wrote:

On 10/28/2025 8:03 AM, wij wrote:

On Mon, 2025-10-27 at 23:29 -0700, Chris M. Thomasson wrote:

Humm...

1 HOME
5 PRINT "The Olcott All-in-One Halt Decider!"
10 INPUT "Shall I halt or not? " ; A$
30 IF A$ = "YES" GOTO 666
40 GOTO 10
666 PRINT "OK!"

Yes, HP is just that simple. The not-so-simple part (just a little bit) is >>> making it precise to become a theorem. olcott wants to save human (not really)
and AI industry. BASIC is too... well, kid stuff, not famous and big enough to
exhibit the 3% intelligence. Being Simple and clear is olcott's enermy. >>>

*D simulated by H cannot possibly reach past its own first line*

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.

'D' (or DDD, whatever, although they look similar) is not the example mentioned
in the HP proof. You are solving POO Problem.

The proof has no idea about simulating halt deciders.
I cannot begin to show the next step of my proof
until people utterly stop stonewalling me on the
above step. They have done this for three years.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On Tue, 2025-10-28 at 11:24 -0500, olcott wrote:

On 10/28/2025 10:19 AM, wij wrote:

On Tue, 2025-10-28 at 09:29 -0500, olcott wrote:

On 10/28/2025 8:03 AM, wij wrote:

On Mon, 2025-10-27 at 23:29 -0700, Chris M. Thomasson wrote:

Humm...

1 HOME
5 PRINT "The Olcott All-in-One Halt Decider!"
10 INPUT "Shall I halt or not? " ; A$
30 IF A$ = "YES" GOTO 666
40 GOTO 10
666 PRINT "OK!"

Yes, HP is just that simple. The not-so-simple part (just a little bit) is
making it precise to become a theorem. olcott wants to save human (not really)
and AI industry. BASIC is too... well, kid stuff, not famous and big enough to
exhibit the 3% intelligence. Being Simple and clear is olcott's enermy.

*D simulated by H cannot possibly reach past its own first line*

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.

'D' (or DDD, whatever, although they look similar) is not the example mentioned
in the HP proof. You are solving POO Problem.

The proof has no idea about simulating halt deciders.

The HP proof only needs a 'given' halt decider.
As a proof (in this case), you must provide a reproducable halt decider for reviewers. So far, none, just mouth: "I have one".

I cannot begin to show the next step of my proof
until people utterly stop stonewalling me on the
above step. They have done this for three years.

Forget about the 'next'. You should go back to understand what the HP is asking.
Hint: HP is asking for a TM. Do the exercises in Linz's book to prove to
yourself you understand TM. Text book is not popular-science magzine.
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 10/28/2025 4:33 PM, Kaz Kylheku wrote:

On 2025-10-28, olcott <polcott333@gmail.com> wrote:

On 10/28/2025 3:37 PM, Kaz Kylheku wrote:

The above C violates a rule.

I am providing the gist of the essence because

C does not run on gists and essences, sorry.

In other words you are trying to get away with
pretending that you are too damned stupid to
do this execution trace in your head?

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.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 10/28/2025 2:40 PM, olcott wrote:

On 10/28/2025 4:33 PM, Kaz Kylheku wrote:

On 2025-10-28, olcott <polcott333@gmail.com> wrote:

On 10/28/2025 3:37 PM, Kaz Kylheku wrote:

The above C violates a rule.

I am providing the gist of the essence because

C does not run on gists and essences, sorry.

In other words you are trying to get away with
pretending that you are too damned stupid to
do this execution trace in your head?

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.

So? You need to cover all the paths of DD, no? The halt and the non-halt paths. Conclusion, DD can sometimes halt, other times not. H(D),
HH(DDD), lol.

Again, this D, what happened to DD or HHH for that matter? ;^o Anyway, D
is dependent on what H(D) returns. It can halt, or not halt. It sure
seems like my basic is a better decider than any H(D), H(DDDDF), HHHHH(DDDDDDDD), HHH(DD), ect you can ever make?

1 HOME
5 PRINT "The Olcott All-in-One Halt Decider!"
10 INPUT "Shall I halt or not? " ; A$
30 IF A$ = "YES" GOTO 666
40 GOTO 10
666 PRINT "OK!"

DD, D, DDD, DDD_DDD_D, is dependent what your H, HH, HHH, HHHH, returns anyway? ... Assuming you keep DD, D, DDD, ... as depending on what
HHH(DD) returns? It logic literally depends on H, HH, HHH, ...? So what?


You really need to keep unique version numbers, say:

H0, H1, H2 with D0, D1, D2, D3, D4, ...

Humm... ?
--- Synchronet 3.21a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

On 10/28/2025 2:40 PM, olcott wrote:

On 10/28/2025 4:33 PM, Kaz Kylheku wrote:

On 2025-10-28, olcott <polcott333@gmail.com> wrote:

On 10/28/2025 3:37 PM, Kaz Kylheku wrote:

The above C violates a rule.

I am providing the gist of the essence because

C does not run on gists and essences, sorry.

In other words you are trying to get away with
pretending that you are too damned stupid to
do this execution trace in your head?

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.

HHH(DD)? Or, H(D), or HHHHH(D), ect? Anyway:


int D() {
for (;;)
{
if (! H(D, D)) break;
// we are in a loop.
}

return HALT;
}

Or

int D() {
if (H(D, D))
{
// Bump the per path counter for non-halt

for (;;)
{
// we are in a loop.
ct_sim_yield_fiber(...);
}

return NON_HALT;
}

// Bump the per path counter for halt

return HALT;
}


--- Synchronet 3.21a-Linux NewsLink 1.2