Liste des Groupes | Revenir à c theory |
On 9/4/2024 4:38 AM, Fred. Zwarts wrote:No, the source code shows that HHH is NOT a "pure function" and thus not eligible to be a decider OR a pure emulator.Op 03.sep.2024 om 22:25 schreef olcott:The source code proves otherwise that you are not brightOn 9/3/2024 2:01 PM, joes wrote:HHH *tries* to simulate itself, but it fails to reach the end of its simulation of the halting program.Am Tue, 03 Sep 2024 13:40:08 -0500 schrieb olcott:>On 9/3/2024 9:42 AM, joes wrote:But DDD halts, so it „specifies halting behaviour”.Am Mon, 02 Sep 2024 16:06:24 -0500 schrieb olcott:DDD emulated by HHH cannot possibly reach its final halt state no matterOn 9/2/2024 12:52 PM, Fred. Zwarts wrote:Which DDD does not.Op 02.sep.2024 om 18:38 schreef olcott:A halt decider is a Turing machine that computes the mapping from
its finite string input to the behavior that this finite string
specifies.
If the finite string machine string machine description specifies
that it cannot possibly reach its own final halt state then this
machine description specifies non-halting behavior.
what HHH does.
HHH can’t simulate itself.
>
HHH does simulate itself simulating DDD
why do you insist on lying about this?
>
https://github.com/plolcott/x86utm/blob/master/Halt7.c
enough to understand this code is no rebuttal at all.
This is a failure of the simulator, which Olcott uses to claim that the input has changed its behaviour. But it is clear that the behaviour of the program described by the finite string is completely fixed by the semantics of the x86 language and does not change by incorrect simulations.
Les messages affichés proviennent d'usenet.