Liste des Groupes | Revenir à c theory |
Am Wed, 09 Jul 2025 11:06:03 -0500 schrieb olcott:On 7/9/2025 10:42 AM, joes wrote:Am Wed, 09 Jul 2025 09:06:42 -0500 schrieb olcott:On 7/9/2025 8:37 AM, joes wrote:Am Wed, 09 Jul 2025 08:02:16 -0500 schrieb olcott:On 7/9/2025 3:58 AM, Fred. Zwarts wrote:Yes it is the halting function.Yes. That is not the halting function.It is a matter of verified fact that HHH does correctly determine thatAll Turing machine deciders only compute the mapping from theirIt matters more what they map it to, i.e. which mapping they compute.
actual inputs. This entails that they never compute any mapping from
non-inputs.
HHH does not compute the halting function.
DDD correctly emulated by HHH cannot possibly reach its own emulated
final halt state.
The actual question posed to HHH is:
Does your input specify behavior that cannot reach its own final halt
state?
Yes, that is not the mathematical function that pairs encodings ofIt *is* what Turing machine deciders do.
programs with their halting state.
I have another program here that (tautologically) determines that itThat changes the words of the question thus becomes the strawman error.
cannot simulate ANY code (according to x86 semantics) to a halting
state - by simulating zero steps :-) That tells me nothing about
whether the input halts when executed.
No, it answers the same question as HHH: does the simulation halt?We know that the test program HHH halts.
In every case besides pathological self-referenceSince programs are not in its domain...How can your beloved Aprove even say anything about its inputs?
The abort could, if you hadn't botched it with static variables.How could HHH abort and not halt?None of the code in HHH can possibly help DDD correctly emulated by
HHH to reach its own emulated final halt state.
DDD emulated by HHH according to the semantics of the x86 language
continues to emulate the first four instructions of DDD in recursive
emulation until HHH aborts its emulation immediately killing every DDD
before any of them reach their own "ret" instruction.
Or before they reach the abort.The outermost HHH sees that its abort criteria has
I keep asking for your credentials because you seem to not have enough
technical knowledge about ordinary programming.
Doesn't sound like a degree would convince you.How many years of professional programming do you have?
The behavior that the input to HHH(DDD) actually specifies is the only
behavior that any decider can possibly report on.
That anyone believes that HHH is required to report on the behavior of
a non-input merely proves a lack of sufficient understanding of how
Turing machine deciders work.
Yes, what a processor does - turning code into behaviour - is clearly
uncomputable.
I'll take that as agreement.No Turing machine ever takes any directly executed
Les messages affichés proviennent d'usenet.