Re: Sufficient knowledge of C proves that DD specifies non-terminating behavior to HHH

Am Tue, 18 Feb 2025 10:41:57 -0600 schrieb olcott:

On 2/18/2025 7:53 AM, joes wrote:

Am Tue, 18 Feb 2025 07:29:55 -0600 schrieb olcott:

On 2/18/2025 6:25 AM, Richard Damon wrote:

On 2/18/25 6:22 AM, olcott wrote:

>
I am talking about the impossibility of defining an Algorithm to
correctly encode square circles not placing any limit on
computation.
>

And who cares about that.
>

It is generally the case that problems that are defined to be
impossible DO NOT EVER ACTUALLY LIMIT COMPUTATION.

Impossible problems, like halting deciders. Asking for one makes no
sense the same way that asking for square circles does. Sure, you may
be able to decide on the halting of infinitely many programs, but there
will always be inf. many you cannot, among them everything that calls
the supposed „decider”.
i

What no one has ever bothered to notice is that impossible problems do
not place any actual real limit on computation.

Well, only if you unfathomably *wanted* a decider.