Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | polcott <polcott333@gmail.com> |
|---|---|
| Newsgroups | comp.theory, sci.logic, sci.math |
| Subject | Re: on mathematical ghosts --- PLO |
| Date | 2025-12-08 22:51 -0600 |
| Message-ID | <10h89sq$1c3ec$1@solani.org> (permalink) |
| References | (16 earlier) <10h83o5$gh76$5@dont-email.me> <GyMZQ.42204$aeF6.4919@fx40.iad> <10h85k2$gh76$6@dont-email.me> <10h86ti$1c1r3$2@solani.org> <gsNZQ.1882$C_K8.1293@fx42.iad> |
Cross-posted to 3 groups.
On 12/8/2025 10:20 PM, Richard Damon wrote: > On 12/8/25 11:00 PM, polcott wrote: >> On 12/8/2025 9:38 PM, dart200 wrote: >> >> *You have support for this in high places* >> >> The Halting Paradox >> Bill Stoddart >> >> 6 Conclusions >> The idea of a universal halting test seems reasonable, >> but cannot be formalised as a consistent specification. >> It has no model and does not exist as a conceptual object. >> Assuming its conceptual existence leads to a paradox. >> >> https://arxiv.org/pdf/1906.05340 >> > > Which doesn't prove anything, as there IS a consistant specification for > the test. > > The problem is you (and Bill) just don't understand it. > > Part of the problem is Bill doesn't understand the nature of Turing > Complete systems. In particular, he assume there is a UNIQUE encoding > for every program, which is a false assumption in Turing Complete systems. With the text of each program P we associate a unique number ⌈P⌉, known as the program’s encoding, which will stand for the program when we want to use that program as data, e.g. when passing one program to another as an argument. You are just terribly inaccurate in paraphrasing. Perhaps speaking to no one at all is better than talking to you. -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable. This required establishing a new foundation for correct reasoning.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-08 22:00 -0600
Re: on mathematical ghosts --- PLO Richard Damon <Richard@Damon-Family.org> - 2025-12-08 23:20 -0500
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-08 22:33 -0600
Re: on mathematical ghosts --- PLO Richard Damon <Richard@Damon-Family.org> - 2025-12-09 07:42 -0500
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-09 09:53 -0600
Re: on mathematical ghosts --- PLO Richard Damon <Richard@Damon-Family.org> - 2025-12-09 23:02 -0500
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-08 22:51 -0600
Re: on mathematical ghosts --- PLO Richard Damon <Richard@Damon-Family.org> - 2025-12-09 07:42 -0500
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-09 09:39 -0600
Re: on mathematical ghosts --- PLO Richard Damon <Richard@Damon-Family.org> - 2025-12-09 23:02 -0500
Re: on mathematical ghosts --- PLO dart200 <user7160@newsgrouper.org.invalid> - 2025-12-08 20:54 -0800
Re: on mathematical ghosts --- PLO polcott <polcott333@gmail.com> - 2025-12-08 23:02 -0600
csiph-web