Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch Newsgroups: comp.lang.c Subject: Re: Why halt deciders can't be "interesting" programs. (HP refutation) Date: Sat, 12 Sep 2020 22:28:43 -0700 Organization: A noiseless patient Spider Lines: 13 Message-ID: <86lfhe2qk4.fsf@linuxsc.com> References: <2bWdncV6duQIcMbCnZ2dnUU78b3NnZ2d@brightview.co.uk> <2e60425e-34f9-4354-815b-aaf28d73f7ebo@googlegroups.com> <2dudnbCk_f-rmsHCnZ2dnUU7-WudnZ2d@giganews.com> <3umdnYJZTKAMi8HCnZ2dnUU78N3NnZ2d@brightview.co.uk> <1454f32c-5192-4f93-94b0-636bf132c456n@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Info: reader02.eternal-september.org; posting-host="94c20496801271c42e84b298ad5f3672"; logging-data="28970"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19Pcbv/Vat/k4wJT8cixcdsVwWdRqe1OAU=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:1YsFmt2f7v3uMSzY9VMAI/qdtk8= sha1:k9pHNTrjKSotlqIMNcZECym036M= Xref: csiph.com comp.lang.c:154925 Richard Damon writes: > On 9/12/20 7:30 PM, olcott wrote: > >> That is a great analysis, yet possibly incorrect if the whole idea of >> the halting problem proofs are anchored in a fundamental misconception. > > And I don't understand what a working simulation of a Turing Machine > will help if you intend to invalidate the basic rules of logic used to > describe them. I doubt very much that you will accomplish anything useful by continuing this conversation any further.