Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes Newsgroups: comp.theory Subject: Re: DDD simulated by HHH cannot possibly halt (Halting Problem) --- mindless robots Date: Mon, 14 Apr 2025 09:29:40 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: References: <852f89c9196e0261b8156050fea4572fe886933f@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Mon, 14 Apr 2025 09:29:40 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="289185"; 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: 4325 Lines: 54 Am Sun, 13 Apr 2025 16:00:43 -0500 schrieb olcott: > On 4/13/2025 3:00 PM, dbush wrote: >> On 4/13/2025 3:59 PM, olcott wrote: >>> On 4/13/2025 3:54 AM, joes wrote: >>>> Am Fri, 11 Apr 2025 10:56:32 -0500 schrieb olcott: >>>>> On 4/11/2025 3:24 AM, Richard Heathfield wrote: >>>>>> On 11/04/2025 08:57, Mikko wrote: >>>> >>>>>>> No proof of this principle has been shown so its use is not valid. >>>>>> >>>>>> No proof of Peano's axioms or Euclid's fifth postulate has been >>>>>> shown. >>>>>> That doesn't mean we can't use them. >>>>>> Mr Olcott can have his principle if he likes, but only by EITHER >>>>>> proving it (which, as you say, he has not yet done) OR by taking it >>>>>> as axiomatic, leaving the world of mainstream computer science >>>>>> behind him, >>>>>> constructing his own computational 'geometry' so to speak, and >>>>>> abandoning any claim to having overturned the Halting Problem. >>>>>> Navel contemplation beckons. >>>>>> Axioms are all very well, and he's free to invent as many as he >>>>>> wishes, >>>>>> but nobody else is obliged to accept them. >>>>>> >>>>> *Simulating termination analyzer Principle* >>>>> It is always correct for any simulating termination analyzer to stop >>>>> simulating and reject any input that would otherwise prevent its own >>>>> termination. >>>> Sure. Why doesn’t the STA simulate itself rejecting its input? >>>> >>> Because that is a STUPID idea and categorically impossible because the >>> outermost HHH sees its needs to stop simulating before any inner HHH >>> can possibly see this. >>> >> In other words, you agree that Linz and others are correct that no H >> exists that satisfies these requirements: >> Given any algorithm (i.e. a fixed immutable sequence of instructions) X >> described as with input Y: >> A solution to the halting problem is an algorithm H that computes the >> following mapping: >> (,Y) maps to 1 if and only if X(Y) halts when executed directly >> (,Y) maps to 0 if and only if X(Y) does not halt when executed >> directly >> > No stupid! Those freaking requirements are wrong and anchored in the > ignorance of rejecting the notion of a simulating termination analyzer > OUT-OF-HAND WITHOUT REVIEW. > As anyone can see HHH MUST REJECT ITS INPUT OR GET STUPIDLY STUCK IN > NON-TERMINATION. If people were not mindless robots they would have > immediately acknowledged this years ago. But why does it not return „I know this halts, but I can’t simulate it”? -- 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.