Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules
joes <[email protected]> Thu, 13 Jun 2024 08:42:24 -0000 (UTC)
| Newsgroups | comp.theory,alt.crackpot |
|---|---|
| Organization | i2pn2 (i2pn.org) |
| Message-ID | <[email protected]> |
Am Wed, 12 Jun 2024 18:53:10 -0500 schrieb olcott: > On 6/12/2024 6:41 PM, Richard Damon wrote: >> On 6/12/24 7:12 PM, olcott wrote: >>> On 6/12/2024 5:59 PM, Richard Damon wrote: >>>> On 6/12/24 12:50 PM, olcott wrote: >>>>> On 6/12/2024 6:33 AM, Richard Damon wrote: >>>>>> On 6/11/24 11:34 PM, olcott wrote: >>>>>>> On 6/11/2024 9:32 PM, Richard Damon wrote: >>>>>>>> On 6/11/24 8:57 PM, olcott wrote: >>>>>>>>> On 6/11/2024 7:20 PM, Python wrote: >>>>>>>>>> Le 12/06/2024 à 01:23, olcott a écrit : >>>>>>>>>>> It turns out that by the generic definition of a decider what >>>>>>>>>>> the directly executed D(D) does is not any of the business of >>>>>>>>>>> H. WTF. It must decide whether D(D) halts. >>>>>>>>> There are no finite string transformations from the input to H >>>>>>>>> to the behavior of D(D), thus the behavior of D(D) is >>>>>>>>> irrelevant. >>>>>>>> Of course there is. >>>>>>>> That is exactly what the definition of a UTM is. I.e. a simulator. >>>>>>> Show each step of DDD correctly simulated by HH such that DDD >>>>>>> terminates normally. >>>>>> WHy? I never claimed that to be true. >>>>>> The lack of finding a couter example doesn't prove that no counter >>>>>> example exists, it might just not be discovered. >>>>> The actual behavior of the input to H(D,D) is the truthmaker for >>>>> halt decider H. >>>> Which is DEFINED to be the behavior of the program described by the >>>> input when directly run. >>> *If that was true then you could show ALL OF THE DETAILED STEPS* >>> *of the mapping that H(D,D) computes to derive that behavior* >> NO, because I never said that H COULD do that computation. That is >> whythe question is DOES THERE EXIST a machine that can do it. Very right > There are no finite string transformation rules that H(D,D) > can use to transform its finite string input into the behavior that you > expect. That's why halt deciders are impossible. > Halt Deciders are only allowed to report on the behavior that they can > map their finite string input to. And that behaviour is specified to match that of the input, or the simulation is wrong. > You are finally admitting that you are expecting H to report on > something that it cannot see and not report on that it does see. That is why it cannot give the right answer. -- joes