Re: Proving the: Simulating termination analyzer Principle

On 4/6/2025 5:25 AM, Tim Rentsch wrote:

Richard Heathfield <rjh@cpax.org.uk> writes:
 

On 05/04/2025 23:42, Kaz Kylheku wrote:
>

On 2025-04-05, Richard Heathfield <rjh@cpax.org.uk> wrote:
>

On 05/04/2025 23:20, olcott wrote:
>

...

>
The difference between us is that I know it and you don't.

>
Olcott resides in a fortress he built out of bricks that were
specially ordered from Dunning and Kruger's website.
You're not getting through.

>
Well, no.  On the other hand, the discussion has in places driven
me to the literature and has thus in its own way been
educational.  For example, I was surprised to discover that
although Turing's 1936 paper does deal with the Halting Problem,
he doesn't actually use that term, which didn't surface until
1952.  I also stumbled on a 1972 paper on incomputability by Tony
Hoare and Donald Allison - well worth the read, and I was amused
by its somewhat prescient opening paragraph: "[...] programmers
have been known to attempt solutions to problems which are
probably unsolvable;  the existence of such problems should be of
interest to all programmers."  Clearly, 53 years ago, they already
had Olcott nailed.

 I agree these discoveries are interesting, but the subject still
isn't one that is suitable for comp.lang.c.  A good way to avoid
these long pointless discussions is not to respond to postings
that are not suitable to comp.lang.c, except to point out that
they are not suitable to comp.lang.c.  And for any given poster,
don't respond to unsuitable postings more often than once a month.

My intent was to focus on the semantics of a pair of C functions.
Digression into computer science seems inappropriate and never
was my intent. The comp.theory people refused to consider the
semantics of C aspects of these functions.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer