From Newsgroup: comp.lang.c

On 11/20/2025 4:10 PM, Kaz Kylheku wrote:

On 2025-11-20, olcott <polcott333@gmail.com> wrote:

On 11/19/2025 10:42 PM, Kaz Kylheku wrote:

On 2025-11-20, olcott <polcott333@gmail.com> wrote:

On 11/19/2025 3:41 PM, Kaz Kylheku wrote:

On 2025-11-19, olcott <polcott333@gmail.com> wrote:

The sound basis of this reasoning is the
semantics of the C programming language.

... and, note,

that you dishonestly erased most of the context

That's just the same pseudo-code snppet you've posted
hundreds of times.

The idea is that I will keep repeating this
until you pay attention

int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}

int main()
{
HHH(DD);
}

I've given ths an incredible amount of attention.

HHH simulates DD that calls HHH(DD)
that simulates DD that calls HHH(DD)...

If HHH(DD) returns 0, it's this;

HHH simulates DD that calls HHH(DD)
- that simulates DD that calls HHH(DD)...
- that simulates DD that calls HHH(DD)...
- but only partially, returning 0.
- such that DD terminates.
- but only partially, returning 0.
- such that DD terminates.

Adding another level:

HHH simulates DD that calls HHH(DD)
- that simulates DD that calls HHH(DD)...
- that simulates DD that calls HHH(DD)...
- that simulates DD that calls HHH(DD)...
- that ...
- that ...
- that ...

Such a jackass trying to get away with saying
that simulated inputs that cannot possibly stop
running unless aborted terminate normally.

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

On 10/14/2022 7:44 PM, Ben Bacarisse wrote:

I don't think that is the shell game. PO really /has/ an H
(it's trivial to do for this one case) that correctly determines
that P(P) *would* never stop running *unless* aborted.

*You are not stupid so that only leaves liar*
https://www.nongnu.org/txr/

- but only partially, returning 0.
- such that DD terminates.
- but only partially, returning 0.
- such that DD terminates.
- but only partially, returning 0.
- such that DD terminates.

Infinite simulation tower: finite DD's.

Since you don't grok this but I do, obviously the one who has
paid more attention is me.

--
Copyright 2025 Olcott

My 28 year goal has been to make
"true on the basis of meaning" computable.
--- Synchronet 3.21a-Linux NewsLink 1.2