Deutsch English Français Italiano |
<v3mj8m$303qa$4@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes <noreply@example.com> Newsgroups: comp.theory,sci.logic Subject: Re: The error of the halting problem Date: Tue, 4 Jun 2024 08:29:10 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <v3mj8m$303qa$4@i2pn2.org> References: <v3lafd$1uml$1@dont-email.me> <v3loms$2uv04$1@i2pn2.org> <v3lou5$43oa$1@dont-email.me> <v3lrh1$2uv03$1@i2pn2.org> <v3lrvi$4h2j$2@dont-email.me> <v3lsd0$2uv04$16@i2pn2.org> <v3ltaa$8gjv$2@dont-email.me> <v3lu07$2uv03$3@i2pn2.org> <v3lubr$8kuk$1@dont-email.me> <v3lv87$2uv03$5@i2pn2.org> <v3lvru$8r46$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Tue, 4 Jun 2024 08:29:10 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="3149642"; 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: 2919 Lines: 40 Am Mon, 03 Jun 2024 21:58:06 -0500 schrieb olcott: > On 6/3/2024 9:47 PM, Richard Damon wrote: >> On 6/3/24 10:32 PM, olcott wrote: >>> On 6/3/2024 9:26 PM, Richard Damon wrote: >>>> On 6/3/24 10:14 PM, olcott wrote: >>>>> On 6/3/2024 8:58 PM, Richard Damon wrote: >>>>>> On 6/3/24 9:51 PM, olcott wrote: >>>>>>> >>>>>>> When H is asked a yes/no question where both answers are >>>>>>> contradicted by its input *IT IS A FREAKING RIGGED GAME* >>>>>> >>>>>> But both answers aren't wrong. Remember, the question is built to >>>>>> make a SPECIFIC decider wrong, and by its algorithm, it will give a >>>>>> SPECIFIC answer to each SPECIFIC question. >>>>>> >>>>> You can't get away with that head game by pretending to not >>>>> understand what infinite an set of H/D pairs is. >>>> >>>> But it doesn't matter. >>>> >>> It matters enormously. Once we fully understand that the limits of >>> computation were always a ruse then we can give computation the >>> priority that it truly deserves. It might be the life on earth is >>> killed off because we did not build a semantic lie detector quickly >>> enough. >> >> But you are working on it wrong, because you just don't understand the >> actual nature of truth. > > Every expression X that is true on the basis of its meaning can be > proven untrue by a lack of a connection to the meaning that makes it > true. *You have understood this better than anyone else* No. "true expressions can be proven untrue"? There are true but unprovable sentences (see Gödel). > When D is defined to contradict both values that H returns then D is not > a truth bearer in H in the same way that the Liar Paradox "This sentence > is not true" is not a truth bearer in English. -- joes