I learned C when K & R was the standard.
I met Bjarne Stroustrup are our local university when he
was promoting his new language. I have been a professional
programmer since 1984, and a professional C++ software
engineer since Y2K.
I know that my C function template will not execute.
I can't provide the details of this because this template refers to
an infinite set of H/D pairs where H is only required to correctly
simulate N steps of D using an x86 emulator. H must be a pure function.
On 5/21/2024 8:31 PM, Sam wrote:
olcott writes:
I learned C when K & R was the standard.
I met Bjarne Stroustrup are our local university when he
was promoting his new language. I have been a professional
programmer since 1984, and a professional C++ software
engineer since Y2K.
And I have been Lord High Posterchild Of The Known Universe, since birth. So >> what?
I know that my C function template will not execute.
Not only that, there is no such thing as "C function template" in the first >> place. Templates are a C++ thing. There are not templates in C.
I can't provide the details of this because this template refers to
an infinite set of H/D pairs where H is only required to correctly
simulate N steps of D using an x86 emulator. H must be a pure function.
Unfortunately, all our psychics are out to lunch and there's noone in the
office who knows how to operate the magical mind ray-beam machine that's
needed in order to extract all the relevant details from your head. You'll >> need to patiently wait until the lunch break is over.
We apologize for the inconvenience.
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 }
It is essentially trivial to see that D correctly simulated by H
cannot possibly reach its own final state at line 06 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.
It is essentially trivial to see that D correctly simulated by H
cannot possibly reach its own final state at line 06 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.
Negative. It is trivial to see that the above code does not execute, and, as >> such, any claims about what it does or does not do are void, by default.
Oh I forgot to endlessly repeat that that the above is
a code template such that every H/D pair of the infinite
set of H/D pairs is only required to correctly simulate
N steps of D using an x86 emulator.
Unfortunately, all our psychics are out to lunch and there's noone in the
office who knows how to operate the magical mind ray-beam machine that's
needed in order to extract all the relevant details from your head. You'll >> need to patiently wait until the lunch break is over.
We apologize for the inconvenience.
typedef int (*ptr)(); // ptr is pointer to int function in C
It is trivial to see that for every H/D pair of the infinite
set of H/D pairs that match the above template that
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (0 / 16) |
Uptime: | 167:15:30 |
Calls: | 10,385 |
Calls today: | 2 |
Files: | 14,057 |
Messages: | 6,416,529 |