Sujet : Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 17. May 2025, 05:37:19
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <10093pv$73dt$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
User-Agent : Mozilla Thunderbird
On 5/16/2025 11:09 PM, Richard Heathfield wrote:
On 17/05/2025 04:49, olcott wrote:
<snip>
It is possible to create a C function that
simulates the source-code of other C functions.
The essential idea of this is a C interpreter.
No. You clearly have no idea what an interpreter is.
A C interpreter translates C, just as a C compiler translates C, the difference being that the compiler writes down the translation (like a book translator in a publishing house) while the interpreter says it out loud, so to speak (like an interpreter at a United Nations meeting).
In each case, the input is C, not machine code.
The actual HHH uses x86 emulation that is way
over most peoples heads.
Clearly not a C interpreter, then.
Modern language are a hybrid between compiling
and interpreting. Java compiles to byte code.
Interpreters translate code line-by-line and immediately execute each one in real-time, without a separate compilation phase. The interpreter effectively runs and translates the program simultaneously. This means changes to the code can take effect instantly, without waiting for compilation. But this flexibility comes at a performance cost relative to compiled programs.
https://thelinuxcode.com/interpreters-c-programming/-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer