Liste des Groupes | Revenir à cl c |
Am 22.05.2024 um 06:37 schrieb olcott:*I AM GETTING NO WHERE WITH THEM ON THIS PAIR OF C FUNCTIONS*On 5/21/2024 11:29 PM, Bonita Montero wrote:Maybe, but according to the topic this group fits.Am 21.05.2024 um 20:48 schrieb olcott:>On 5/21/2024 1:39 PM, Bonita Montero wrote:>Am 21.05.2024 um 20:24 schrieb olcott:>On 5/21/2024 1:13 PM, Bonita Montero wrote:>Am 21.05.2024 um 20:09 schrieb olcott:>On 5/21/2024 1:01 PM, Bonita Montero wrote:>Am 21.05.2024 um 16:09 schrieb olcott:>
>I am only asking the c experts here whether or not D correctly>
simulated by *pure function* H can possibly reach its own line
06 and halt for every H/D pair matching the template provided.
Saying this is a question about C is like questioning something
about physics in Polish and claiming this is a question about
Polish.
I am convinced that the question can be fully answered entirely on the
basis of the semantics of C in the exact same way that the termination
status of the following functions can be answered entirely on the basis
of sufficient knowledge of the semantics of c.
>
*If you believe otherwise then I ask for you to please justify this*
>
void Infinite_Recursion()
{
Infinite_Recursion();
}
>
int factorial(int n) // called with 5
{
if (n >= 1)
return n*factorial(n-1);
else
return 1;
}
>
void Infinite_Loop()
{
HERE: goto HERE;
}
>
>
This is possible with most languages so this isn't a question about C.
None-the-less the semantics of my code template does seem
to prove the result that I stated. I would not even be here
except for the people in the other forum that consistently
lie about this.
>
You're neither asking about a C- or C++ problem.
So use a proper newsgroup.
>
There is no other group that knows enough about the semantics of the
C programming language and there is no other group still alive that
knows enough about the semantics of programming languages.
>
comp.theory is the most apppropriate group.
>
They have proven to not be the right group because they have
consistently lied about this for two years.
-->
It is trivial to see that for every H/D pair of the infinite
set of H/D pairs that match the below template that
>
D correctly simulated by H cannot possibly reach its own final
state at line 06 and halt because D correctly simulated by
H remains stuck in recursive simulation.
>
This provides the basis for simulating termination analyzer H to
correctly determine that the halting problem's counter-example
input D cannot possibly halt.
>
typedef int (*ptr)(); // ptr is pointer to int function in C
00 int H(ptr p, ptr i);
01 int D(ptr p)
02 {
03 int Halt_Status = H(p, p);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 int main()
10 {
11 H(D,D);
12 return 0;
13 }
>
>
Les messages affichés proviennent d'usenet.