On 11/01/2026 10:53 AM, olcott wrote:
On 11/1/2026 11:59 AM, dbush wrote:
On 11/1/2026 12:44 PM, olcott wrote:
On 11/1/2026 9:09 AM, dbush wrote:
On 11/1/2026 9:50 AM, olcott wrote:
On 11/1/2026 8:01 AM, dbush wrote:
On 11/1/2026 8:35 AM, olcott wrote:
typedef int (*ptr)();The above statement is unclear as "DD" and "HHH" could be
int HHH(ptr P);
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
08
09 void main()
10 {
11-a HHH(DD);
12 }
The C / C++ groups are the only people in the
world that did not flat out lie about this question:
Does DD simulated by HHH ever reach its own "return"
statement while DD is being simulated by HHH?
referring to:
* an algorithm, i.e. a fixed immutable sequence of instructions
that always generates the same output for a given input.
* a C function, i.e. a named address that can contain any
arbitrary set of instructions in sequence
* a finite string, i.e. a 32-bit function pointer which is the
starting address of a C function.
So please clarify whether each use of "HHH" and "DD" in the above >>>>>>> sentence refers to an algorithm, a C function, or a finite string. >>>>>>>
DD is to be construed as a finite string of C source
code of a C function. HHH is to be construed as a C
interpreter that simulates C source code. HHH can
simulate itself simulating DD if needed.
So would the following be correct?
Does C function DD simulated by C function HHH ever reach its own
"return" statement while C function DD is being simulated by C
function HHH?
Yes that seems correct.
Does C function DD simulated by C function
HHH ever reach its own [SIMULATED] "return" statement
while C function DD is being simulated by
C function HHH?
Does there exist a finite number of N simulations
such that DD simulated by HHH reaches its own
simulated "return" statement while DD is being
simulated by HHH?
Let apply the same to the above, with a few more clarifications:
Does there exist a finite number of N simulations that C function HHH >>> -a> can be modified to perform such that C function DD simulated by Cfunction HHH reaches its own
simulated "return" statement while C function DD is being
simulated by C function HHH?
Yes?
There does not exist any HHH that simulates DD according
to the operational semantics of the C programming language
such that the simulated DD reaches its own simulated
return statement in any N finite number of simulations.
To make the request for clarification more explicit:
Does [algorithm|C function|finite string] DD simulated by[algorithm| C function|finite string] HHH ever reach its own
"return"
statement while [algorithm|C function|finite string] DD isbeing simulated by [algorithm|C function|finite string] HHH?
For each instance of "[algorithm|C function|finite string]" above, >>>>>>> pick one and give the resulting sentence.
That's idiocy when there sits under that function pointer a block
of memory full of instructions that according to otherwise the
content of registers and the machine and resource model and
the instruction set architecture what results a _closed_ model
of computation, that "static analysis" and "dynamic analysis"
are simple after code understanding.
"The semantics of the C runtime" include that there's an actual implementation, then whether it's Harvard or von Neuman the
program memory, and whether it's simply readable, is a fact
that already outside the box, that is the box.
Shut Up
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 54:31:07 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,563 |