Liste des Groupes | Revenir à c theory |
Am Fri, 31 May 2024 09:25:40 -0500 schrieb olcott:*Trying to get away with changing the subject away from this*On 5/31/2024 2:50 AM, Fred. Zwarts wrote:Op 31.mei.2024 om 00:01 schreef olcott:On 5/30/2024 4:54 PM, joes wrote:Am Thu, 30 May 2024 09:55:24 -0500 schrieb olcott:
>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 }Everyone with sufficient knowledge of C can easily determine that DYeah, of course not, if H doesn’t halt.
correctly emulated by any *pure function* H (using an x86 emulator)
cannot possibly reach its own simulated final state at line 06 and
halt.The fuck? If H halts, then D can definitely reach past line 4.*pure function H definitely halts you are confused*Or maybe you did not know that every computation that never reachesSince the claim is that H is also a computation, it holds for H, as
its own final state *DOES NOT HALT* even if it stops running because
it is no longer simulated.
well. That means that H *DOES NOT HALT* even if it stops running because
it is no longer simulated.
--DD correctly simulated by pure function HH cannot possibly reach
its own final state at line 06 in any finite number of steps of
correct simulation.
>
Pure function H reaches its own final state after the finite number
of steps of correct simulation, thus halts.
Les messages affichés proviennent d'usenet.