Liste des Groupes | Revenir à theory |
Op 18.mei.2024 om 02:34 schreef olcott:https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulationOn 5/17/2024 6:15 PM, André G. Isaak wrote:Please, tell us how this empirical proof for an infinite set of H/D pairs looks like.On 2024-05-17 17:00, olcott wrote:>On 5/17/2024 3:02 PM, Alan Mackenzie wrote:>>That "program" doesn't compile. It's ill-formed.>
This does compile under C17 and C11
with Microsoft Visual Studio 2022*Maybe you forgot to take the line numbers out*>
*Maybe you forgot to take the line numbers out*
*Maybe you forgot to take the line numbers out*
*Maybe you forgot to take the line numbers out*
>
typedef int (*ptr)();
int H(ptr P, ptr I);
But that's not the code you provide in your numerous previous posts where you insist on
>
int H(ptr x, ptr x);
>
Maybe when people point out that there is an error you should actually proofread what you wrote.
>
[remaining code deleted].
>
André
>
typedef int (*ptr)(); // ptr is pointer to int function
00 int H(ptr x, ptr y);
01 int D(ptr x)
02 {
03 int Halt_Status = H(x, x);
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 }
>
When people tell me that I am wrong about the semantics of
that code template I have always known they are wrong because
I have always had empirical proof that D correctly simulated
By H cannot possibly reach its own simulated line 06 and halt.
Les messages affichés proviennent d'usenet.