Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC

On 5/27/25 5:25 PM, olcott wrote:

On 5/27/2025 8:11 AM, Richard Heathfield wrote:

On 27/05/2025 11:41, Fred. Zwarts wrote:
>
<snip>
>

Of course HHH can be called by any other function even by DDD.

>
And is. DDD's source shows this.
>

But that is completely irrelevant

>
Not in my view.
>
I accept that that's your view and I won't dispute it because I understand your reasoning, but you and I are talking about different things. My underlying point is quite simply that Olcott made an incorrect and indeed contradictory claim about what HHH can and cannot report on. At the very, *very* least he made an insufficiently qualified claim.
>

 int sum(int x, int y) { return x + y; }
HHH must report on the behavior that its input actually
specifies the same way that sum(3,4) must report on the
sum of 3 + 4.
 

Right, and just as the function that sum is to compute is defined by the arithmetic of Natural Numbers, the behavior of the input to HHH is defined by the definition in the Halting Problem, namely the behavior of the program that the input represent when run.
SInce it can't do that, it is just wrong, and we show that the Halting Function mapping is not computable, as no universally correct halt decider can exist.
You aare just showing you are too stupid to understand the requirement of following the definition of the words.