Deutsch English Français Italiano |
<f10230ff9b3561b3de08653fa9d234acc2fb3e81@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes <noreply@example.org> Newsgroups: comp.theory Subject: Re: Defining a correct simulating halt decider Date: Sun, 8 Sep 2024 12:46:31 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <f10230ff9b3561b3de08653fa9d234acc2fb3e81@i2pn2.org> References: <vb4plc$2tqeg$1@dont-email.me> <vb6o5t$3a95s$1@dont-email.me> <vb71a3$3b4ub$4@dont-email.me> <vbbmuc$8nbb$1@dont-email.me> <vbcbe4$bdtb$3@dont-email.me> <vbeoge$q2ph$1@dont-email.me> <vbeprp$punj$7@dont-email.me> <c600a691fab10473128eed2a1fad2a429ad4733f@i2pn2.org> <vbh2sp$19ov0$1@dont-email.me> <vbhm3c$1c7u5$12@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sun, 8 Sep 2024 12:46:31 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1273526"; mail-complaints-to="usenet@i2pn2.org"; posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM"; User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2) X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 2932 Lines: 42 Am Sat, 07 Sep 2024 08:57:00 -0500 schrieb olcott: > On 9/7/2024 3:29 AM, Mikko wrote: >> On 2024-09-07 05:12:19 +0000, joes said: >>> Am Fri, 06 Sep 2024 06:42:48 -0500 schrieb olcott: >>>> On 9/6/2024 6:19 AM, Mikko wrote: >>>>> On 2024-09-05 13:24:20 +0000, olcott said: >>>>>> On 9/5/2024 2:34 AM, Mikko wrote: >>>>>>> On 2024-09-03 13:00:50 +0000, olcott said: >>>>>>>> On 9/3/2024 5:25 AM, Mikko wrote: >>>>>>>>> On 2024-09-02 16:38:03 +0000, olcott said: >>>>>>>>> >>>>>>>>>> A halt decider is a Turing machine that computes the mapping >>>>>>>>>> from its finite string input to the behavior that this finite >>>>>>>>>> string specifies. >>>>>>>>> >>>>>>>>> A halt decider needn't compute the full behaviour, only whether >>>>>>>>> that behaviour is finite or infinite. >>>>>>>>> >>>>>>>> New slave_stack at:1038c4 Begin Local Halt Decider Simulation >>>>>>>> Local Halt Decider: Infinite Recursion Detected Simulation >>>>>>>> Stopped >>>>>>>> Hence HHH(DDD)==0 is correct >>>>>>> >>>>>>> Nice to see that you don't disagree with what said. >>>>>>> Unvortunately I can't agree with what you say. >>>>>>> HHH terminates, >>>>>>> os DDD obviously terminates, too. No valid >>>>>> >>>>>> DDD emulated by HHH never reaches it final halt state. >>>>> >>>>> If that iis true it means that HHH called by DDD does not return and >>>>> therefore is not a ceicder. >>>> The directly executed HHH is a decider. >>> What does simulating it change about that? >> >> If the simulation is incorrect it may change anything. >> > PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR How? What is pathological? -- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math: It is not guaranteed that n+1 exists for every n.