Re: Every sufficiently competent C programmer knows --- Truthmaker Maximalism

Am Fri, 14 Mar 2025 18:28:24 -0500 schrieb olcott:

On 3/14/2025 1:01 PM, dbush wrote:

On 3/14/2025 1:19 PM, olcott wrote:

On 3/14/2025 11:58 AM, wij wrote:

On Fri, 2025-03-14 at 11:33 -0500, olcott wrote:

On 3/14/2025 11:01 AM, wij wrote:

On Fri, 2025-03-14 at 10:51 -0500, olcott wrote:

On 3/14/2025 10:04 AM, wij wrote:

On Fri, 2025-03-14 at 09:35 -0500, olcott wrote:

 

Are you solving The Halting Problem or not? Yes or No.
>

I have only correctly refuted the conventional halting problem
proof. Actually solving the halting problem requires a program that
is ALL KNOWING thus God like.

>
I (GUR) had told you God cannot solve HP neither (maybe because the
problem is limited in a box)
>

When we define the HP as having H return a value corresponding to the
halting behavior of input D and input D can actually does the opposite
of whatever value that H returns, then we have boxed ourselves in to a
problem having no solution.
>

And that is EXACTLY what the halting problem is about: it is not
possible to construct an H where H(X,Y) reports whether X(Y) halts when
executed directly.
A problem that you have now EXPLICITLY agreed is unsolvable.  So...
>

Likewise:
What time is it (yes or no)? equally has no solution.
That BOGUS problem instances have no solution places no actual limit on
anything.

It places a limit on deciding termination.
 

I coined the term "incorrect question" years ago.
https://groups.google.com/g/sci.lang/c/lSdYexJ0ozo/m/aDN9-TYLHwIJ

(x) doubt