Liste des Groupes | Revenir à theory |
On 7/15/2024 4:03 AM, joes wrote:What TM do you mean? They can all be encoded.Am Sun, 14 Jul 2024 22:41:24 -0500 schrieb olcott:Richard insists that HHH report on the behavior of the TM that is *not*On 7/14/2024 9:04 PM, Richard Damon wrote:Specifically, the input HHH aborts.On 7/14/24 9:27 PM, olcott wrote:>Excpet, as I have shown, it doesn't.
Any input that must be aborted to prevent the non termination of
simulating termination analyzer HHH necessarily specifies
non-halting behavior or it would never need to be aborted.
Your problem is you keep on ILEGALLY changing the input in your
argument because you have misdefined what the input is.
Don't deflect. HHH as part of DDD (because it is called) needs to beThe input to HHH is ALL of the memory that it would be accessed in aTuring machines only operate on finite strings they do not operate on
correct simulation of DDD, which includes all the codd of HHH, and
thus, if you change HHH you get a different input.
If you want to try to claim the input is just the bytes of the
function DDD proper then you are just admitting that you are nothing
more than a lying idiot that doesn't understand the problem,
other Turing machines *dumbo*
included in the input to the simulator.
Bedsides, TMs can be encoded as strings. Notwithstanding that HHH is
not and does not simulate a TM.
encoded as finite string. TM's are not allowed to report on the behavior
of the computation that they are contained within.
The question is not whether or not HHH halts.And the answer is yes, as you have agreed.
The question is does the finite string input to HHH mathematically map
to behavior that halts
when DDD is correctly emulated by HHH accordingIf HHH can't map it, it is not simulating correctly.
to the semantics of the x86 language?
Les messages affichés proviennent d'usenet.