| Deutsch English Français Italiano |
|
<bfd8fb85d23c3697182a0fa48fe41f8271ee2905@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: comp.theory Subject: Re: Why Peter Olcott is both right and wrong Date: Fri, 16 May 2025 20:25:58 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <bfd8fb85d23c3697182a0fa48fe41f8271ee2905@i2pn2.org> References: <5PfVP.200711$RD41.12367@fx12.ams4> <877c2i2hbk.fsf@bsb.me.uk> <tDlVP.271657$o31.174834@fx04.ams4> <871psp2zp5.fsf@bsb.me.uk> <qjvVP.134543$0ia.88163@fx11.ams4> <87v7q01br6.fsf@bsb.me.uk> <1008bju$3v7tg$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 17 May 2025 00:38:17 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="672722"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird In-Reply-To: <1008bju$3v7tg$2@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Content-Language: en-US On 5/16/25 5:44 PM, olcott wrote: > On 5/16/2025 4:33 PM, Ben Bacarisse wrote: >> Mr Flibble <flibble@red-dwarf.jmc.corp> writes: >> >>> On Fri, 16 May 2025 00:59:02 +0100, Ben Bacarisse wrote: >>> >>>> Mr Flibble <flibble@red-dwarf.jmc.corp> writes: >>>> >>>>> On Thu, 15 May 2025 13:23:43 +0100, Ben Bacarisse wrote: >>>>> >>>>>> Mr Flibble <flibble@red-dwarf.jmc.corp> writes: >>>>>> >>>>>>> the truth is pathlogical input is undecidable: >>>>>> >>>>>> No input[1] is undecidable. >>>>> >>>>> Eh? Partial deciders are a thing. >>>> >>>> Yes. That does not alter the fact that no input is undecidable. >>> >>> Pathological input is undecidable as pathological input is an >>> "impossible >>> program" [Strachey 1965]. >> >> The most likely explanation is that you don't know what decidable means. >> Either that or you just like posting remarks for the sake of it. >> > > Sure and these two PhD computer science professors > would also have no idea what the terms of their are mean: > > Problems with the Halting Problem > Eric C.R. Hehner > https://www.cs.toronto.edu/~hehner/PHP.pdf > > Halting misconceived? > Bill Stoddart > August 25, 2017 > https://www.complang.tuwien.ac.at/anton/euroforth/ef17/papers/stoddart.pdf > Yes, they show that they have no idea about computation theory, as they make rookie mistakes, like not understand that programs will do what they do. (They may be good in other parts of Computer Science, just not Computation Theory) That just shows the problem with trying to base an argument on "authority". It may work in general Philosophy, but not in a formal system like Computation Theory.