Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Newberry <newberryxy@gmail.com> |
|---|---|
| Newsgroups | comp.theory, sci.logic |
| Subject | When will the establishment see the light? |
| Date | 2017-10-16 21:55 -0700 |
| Organization | A noiseless patient Spider |
| Message-ID | <os42gh$drf$1@dont-email.me> (permalink) |
Cross-posted to 2 groups.
When will the establishment see the light? I claim the existence of a sound and consistent partial halting decider that returns “yes” or “no” [or nothing], and is in a certain sense able to identify the cases it cannot decide. What is this “certain sense”? The Halting Theorem is usually proven by constructing a self-referential “counterexample”, a program that attempts to say that it itself does not halt. I claim the existence of a program that is able to determine that its own attempt to determine (that the counterexample does not halt) does not halt. I do not know if anyone can actually deny the existence such a program because I have a simple example running. http://xnewberry.tripod.com/ProvableNotProvableNotHalt.c The question is if the program contradicts itself. I am suggesting that it does not. https://www.researchgate.net/publication/316562253_Getting_around_the_Halting_Problem
Back to comp.theory | Previous | Next — Next in thread | Find similar | Unroll thread
When will the establishment see the light? Newberry <newberryxy@gmail.com> - 2017-10-16 21:55 -0700 Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-17 16:40 +0100 Re: When will the establishment see the light? "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-10-17 21:04 -0500
csiph-web