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

On 2/18/25 11:41 AM, olcott wrote:

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”.
>

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

Except to add to the knowledge of what can be done.
As you have been told, but refuse to learn, the Halting Problem was not "designed" to be impossible, but in fact comes out of a chain of ideas that would show that logic and mathematics were a complete system, one where EVERY true statement could be proven.
Great minds worked hard to try to prove that, until Turing found this simple and obvious (in hindsight) proof that it could not be done.
So, your premise that the halting problem was designed to be impossible is just another of your LIES to support your FRAUD.
But, you can't look at history, as it shows you are wrong, and you seem to think that being ignorant of your error is better than knowing you are wrong, because you just can't face the truth. Truth being something you just don't understand.