Deutsch English Français Italiano |
<v6863k$36giv$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!2.eu.feeder.erje.net!feeder.erje.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Mikko <mikko.levanto@iki.fi> Newsgroups: comp.theory Subject: Re: Olcott seems to be willfully ignorant Date: Fri, 5 Jul 2024 10:07:32 +0300 Organization: - Lines: 54 Message-ID: <v6863k$36giv$1@dont-email.me> References: <v5vkun$1b0k9$1@dont-email.me> <v60red$1kr1q$2@dont-email.me> <v61hn7$1oec9$1@dont-email.me> <v61ipa$1og2o$2@dont-email.me> <v61jod$1oec9$2@dont-email.me> <v61leu$1p1uo$1@dont-email.me> <7b6a00827bfcc84e99e19a0d0ae6028ebcdc263c@i2pn2.org> <v620vu$1qutj$2@dont-email.me> <f6e8f5de9a1e61c7970a92145ce8c1f9087ba431@i2pn2.org> <v628ts$1s632$1@dont-email.me> <178edf6a7c5329df35a9af6852ecbd41c0948ea1@i2pn2.org> <v629mp$1s632$3@dont-email.me> <168858894febbaa529d1704ea864bbe15cb8f635@i2pn2.org> <v62bgv$1s632$6@dont-email.me> <211a07c98d1fc183ed3e6c079ec1e883dd45f1cc@i2pn2.org> <v62f92$20moo$3@dont-email.me> <623debd817e63a256100bb15fed3af8d4fb969fe@i2pn2.org> <v62hc7$20moo$6@dont-email.me> <e3c734b6a1ce3386210f7700bf03d183334d4d55@i2pn2.org> <v63jkc$26loi$7@dont-email.me> <0600a243a3bb843ec505712dc7746d41e0ca66dc@i2pn2.org> <v63n8u$27f1a$3@dont-email.me> <v63rd7$24jon$1@dont-email.me> <v63s2c$28dpi$1@dont-email.me> <f7c1d91bf0108f101bbccac8882c1b5a71ebdb39@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 05 Jul 2024 09:07:32 +0200 (CEST) Injection-Info: dont-email.me; posting-host="70c8d6b77d1510d9355906f09ac241dc"; logging-data="3359327"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+oVwT/3LtUEY1yJUGnLbsl" User-Agent: Unison/2.2 Cancel-Lock: sha1:tLcFopBM7fsqN5rcy6G3rRBEHa8= Bytes: 4231 On 2024-07-04 10:20:55 +0000, joes said: > Am Wed, 03 Jul 2024 10:51:40 -0500 schrieb olcott: >> On 7/3/2024 10:40 AM, Fred. Zwarts wrote: >>> Op 03.jul.2024 om 16:29 schreef olcott: >>>> On 7/3/2024 9:16 AM, joes wrote: >>>>> Am Wed, 03 Jul 2024 08:27:40 -0500 schrieb olcott: >>>>>> On 7/3/2024 6:44 AM, Richard Damon wrote: >>>>>>> On 7/2/24 11:43 PM, olcott wrote: >>>>>>>> On 7/2/2024 10:23 PM, Richard Damon wrote: >>>>>>>>> On 7/2/24 11:07 PM, olcott wrote: >>>>>>>>>> On 7/2/2024 9:35 PM, Richard Damon wrote: >>>>>>>>>>> On 7/2/24 10:03 PM, olcott wrote: >>>>>>>>>>>> On 7/2/2024 8:51 PM, Richard Damon wrote: >>>>>>>>>>>>> On 7/2/24 9:32 PM, olcott wrote: >>>>>>>>>>>>>> On 7/2/2024 8:25 PM, Richard Damon wrote: >>>>>>>>>>>>>>> On 7/2/24 9:18 PM, olcott wrote: > >>>>>>>>> And the only CORRECT EMULATION of that program is to infiniately >>>>>>>>> loop in the emulation. >>>>>>>> Not for a freaking termination analyzer nitwit. >>>>>>> Why do they get to lie? >>>>> Open question. > >>>>>>>>> Nothing says that you can't make a halt decider work with partial >>>>>>>>> emulation for SOME inputs. But the halt Decider just isn't itself >>>>>>>>> a fully correct emulator. >>>>>>>> You keep stupidly saying that less than an infinite emulation is >>>>>>>> an incorrect emulation. Why do you keep stupidly doing that? >>>>>>> Because it is. Partial emulations only show partial truth, and >>>>>>> truth is the whole truth and nothing but the truth. >>>>>>> BEHAVIOR needs the FULL description of what happens. >>>>>>> >>>>>> Why do you keep lying about this? >>>>>> As soon as HHH has seen a repeating state it has seen enough. >>>>> If the state is actually the same. But the simulated HHH sets a flag >>>>> or something to keep track if it is itself simulating a repetition. >>>>> <- Which it therefore isn’t. >>>>> >>>> *This is the repeating state* >>> But not an *infinitely* repeating state. >> >> The criteria that I spent two years writing and the best selling author >> of theory of computation textbooks agrees with says nothing about >> *infinitely* repeating state. > If the state doesn’t repeat infinitely often, it is not the same state > and does halt. That "halt" does not follow. A Turing machine can execute forever without repeating its state. -- Mikko