Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes Newsgroups: comp.theory Subject: Re: DDD correctly emulated by HHH is Correctly rejected as non-halting V2 Date: Sun, 21 Jul 2024 14:55:50 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <944888d174edebc9353da8ebe29489295a0dad06@i2pn2.org> References: <23cb2d2401b87bf4f6a604aa1a78b93ffc9a29bc@i2pn2.org> <3fc6548531f91ed14a27420caf9679a634573ed0@i2pn2.org> <8a6e6d9ff49aabe2525ce5729a439c807de4768a@i2pn2.org> <34Ocnd4voeWlDAn7nZ2dnZfqnPudnZ2d@brightview.co.uk> <056325e336f81a50f4fb9e60f90934eaac823d22@i2pn2.org> <210383b2ee318f68a96d94aec314ee8b93f79b7f@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sun, 21 Jul 2024 14:55:50 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="4058496"; 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: 3399 Lines: 32 Am Sun, 21 Jul 2024 08:34:40 -0500 schrieb olcott: > On 7/21/2024 4:34 AM, Mikko wrote: >> On 2024-07-20 13:11:03 +0000, olcott said: >>> On 7/20/2024 3:21 AM, Mikko wrote: >>>> On 2024-07-19 14:08:24 +0000, olcott said: >> If HHH(DDD) abrots its simulation and returns true it is correct as a >> halt decider for DDD really halts. > (b) We know that a decider is not allowed to report on the behavior > computation that itself is contained within. Deciders only take finite > string inputs. They do not take executing processes as inputs. Thus HHH > is not allowed to report on the behavior of this int main() { DDD(); }. Its input just happens to be the same as enclosing computation. > Although embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ cannot possibly correctly report on its own > behavior because its input does the opposite of whatever it reports > embedded_H is only allowed to report on the behavior that its input > specifies. Which is the opposite. > Turing machines never take actual Turing machines as inputs. > They only take finite strings as inputs and an actual executing Turing > machine is not itself a finite string. Trivial. > Since we ourselves can directly see that UTM based embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ > must abort the simulation of its input otherwise this input would never > stop running we know that the criteria have been met. I see that the input halts. -- 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.