Re: Can someone please verify the execution trace of this?

On 5/20/2024 5:14 PM, Fred. Zwarts wrote:

Op 20.mei.2024 om 18:07 schreef olcott:

On 5/20/2024 10:17 AM, Bonita Montero wrote:

Am 20.05.2024 um 16:51 schrieb olcott:
>

Anyone having sufficient knowledge of the semantics
knows the answer. Likewise for these C functions:
>
void Infinite_Recursion(u32 N)
{
   Infinite_Recursion(N);
}
>
int factorial(int n)
{
   if (n >= 1)
     return n*factorial(n-1);
   else
     return 1;
}
>
void Infinite_Loop()
{
   HERE: goto HERE;
}
>
>

>
I can't believe you're a professional developer when you repeatedly
run into the wall with simple questions like this for years.

>
I have known the answer from an actual execution trace for years.

 The actual execution trace of the infinite number of H/D pairs?
 

Anyone with sufficient knowledge of the semantics of the C language
knows the answer. *I just need several liars to be put in their place*
>

  Showing a proof for the claim would help more than finding somebody to confirm the claim without evidence.
 

The same way that my claim can be understood to be self-evidently
true that halt status of the following functions is self-evidently
true.
*Try and explain to the experts in this forum how no one can*
*possibly know that Infinite_Recursion() will not terminate normally*
void Infinite_Recursion()
{
   Infinite_Recursion();
}
int factorial(int n) // on input 5
{
   if (n >= 1)
     return n*factorial(n-1);
   else
     return 1;
}
void Infinite_Loop()
{
   HERE: goto HERE;
}
void This_Halts()
{
   return;
}
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer