Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #23988 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-10-19 12:45 -0500 |
| Last post | 2020-11-27 21:51 -0500 |
| Articles | 20 on this page of 97 — 14 participants |
Back to article view | Back to comp.theory
The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 12:45 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 20:04 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 14:15 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 21:34 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 15:50 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 22:09 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 16:28 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 23:13 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 17:54 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-20 00:41 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Richard Damon <Richard@Damon-Family.org> - 2020-10-19 21:15 -0400
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 20:18 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-20 02:38 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-20 04:35 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-20 13:27 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-20 11:31 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)[ KEY ] olcott <NoOne@NoWhere.com> - 2020-10-20 11:07 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Eli the Bearded <*@eli.users.panix.com> - 2020-10-19 21:04 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 22:46 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Eli the Bearded <*@eli.users.panix.com> - 2020-10-19 21:52 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-19 23:48 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 18:03 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Jeff Barnett <jbb@notatt.com> - 2020-10-19 21:26 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-19 14:54 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-19 14:57 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) R Kym Horsell <kym@kymhorsell.com> - 2020-10-19 22:17 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-19 16:25 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) R Kym Horsell <kym@kymhorsell.com> - 2020-10-19 23:29 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) David Kleinecke <dkleinecke@gmail.com> - 2020-10-19 18:19 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-19 18:26 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-19 16:34 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) R Kym Horsell <kym@kymhorsell.com> - 2020-10-20 00:08 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Richard Damon <Richard@Damon-Family.org> - 2020-10-19 21:12 -0400
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-21 20:23 -0700
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-19 20:39 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) olcott <NoOne@NoWhere.com> - 2020-10-19 14:54 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-19 21:49 +0100
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(39 days of review and no mistakes found) olcott <NoOne@NoWhere.com> - 2020-11-27 10:52 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(39 days of review and no mistakes found) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-27 16:57 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 11:10 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-27 17:24 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 11:54 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 13:24 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 19:08 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 13:34 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 14:04 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 21:04 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 15:24 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-28 03:29 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-27 21:57 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-30 01:42 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-29 20:40 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-30 17:25 +0000
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-30 11:55 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(keys to understanding) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-11-30 21:06 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 15:14 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-11-30 22:48 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 17:23 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-30 23:54 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 18:08 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 18:18 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 18:59 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 01:40 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 19:48 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 08:41 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-12-01 04:00 -0800
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 09:13 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 17:32 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 12:12 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 18:35 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 12:54 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 08:52 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 21:30 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 15:49 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 22:22 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 16:34 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 23:10 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Richard Damon <Richard@Damon-Family.org> - 2020-12-01 21:51 -0500
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Andy Walker <anw@cuboid.co.uk> - 2020-12-01 15:22 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 09:33 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 18:14 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 12:37 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 12:56 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-12-01 10:08 -0600
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 01:23 +0000
Re: The key aspects of x86utm are now finally complete (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 19:30 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 13:03 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 12:46 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 16:28 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 15:40 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 15:52 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 17:17 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 17:20 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 21:27 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 17:09 -0500
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) olcott <NoOne@NoWhere.com> - 2020-11-27 17:09 -0600
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 21:51 -0500
Page 2 of 5 — ← Prev page 1 [2] 3 4 5 Next page →
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-19 23:48 +0100 |
| Message-ID | <ApCdndsoUMRTihPCnZ2dnUU78KvNnZ2d@brightview.co.uk> |
| In reply to | #24012 |
On 19/10/2020 22:52, Eli the Bearded wrote: > In comp.lang.c, > Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >> On 19/10/2020 22:04, Eli the Bearded wrote: >>> This is informative, but a little less generalized than it should be: >>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >> Yes, that's a nice article which I've read before. He even mentions the >> fear of having their glory stolen, and consequent copy-righting common >> for trisectors. :) The final advice on what actually to do when the >> trisector comes seems a little naf to me though - and not applicable so >> much to these newsgroups. The joy of the article is in his descriptions >> of the individuals and his interactions with them over the years. > > The final paragraph advice to be so harsh in criticism that they never > come back seems like the only advice that might work. Or perhaps > ignoring the cranks. I'm pretty sure being harsh to them will have little or no effect. Ignoring them might possibly work /if/ it was a universal response by the group as a whole, but the thing is that it never is - the group is composed of individuals, some new to the group and others old, and there's always someone who's up for "arguing" with a crank, either for fun, or misguidedly believing they're helping somebody. Then there are those who can't bear to see anything false or misleading go unchallenged, and of course it's almost an axiom that a crank must refute every post criticising his/her argument. (The reasoning seems to be the belief that he who posts last has "won" the argument, at least in the eyes of the crank, and also of some crank stalkers...) So given these behaviours, I think we can prove mathematically that crank threads will grow and grow indefinitely ...until, well I've not worked out why they finally stop! :) But when they do, there are perhaps 20 or so posts saying something new/interesting, and 980 posts repeating stuff already said. On sci.math a few weeks ago there was some really earnest and rational poster who explained why responding to cranks was destroying the group. He suggested ignoring them, or at least just having one or two responses explaining the problem with their arguments and then ignoring them. Many people nodded in agreement, but it seems to have made absolutely no difference to the volume of posts! Mike. <https://xkcd.com/386/> > > Elijah > ------ > usually goes for "don't engage" or "mock" >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-19 18:03 -0500 |
| Message-ID | <HPKdndyl6aK0hhPCnZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #24012 |
On 10/19/2020 4:52 PM, Eli the Bearded wrote: > In comp.lang.c, > Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >> On 19/10/2020 22:04, Eli the Bearded wrote: >>> This is informative, but a little less generalized than it should be: >>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >> Yes, that's a nice article which I've read before. He even mentions the >> fear of having their glory stolen, and consequent copy-righting common >> for trisectors. :) The final advice on what actually to do when the >> trisector comes seems a little naf to me though - and not applicable so >> much to these newsgroups. The joy of the article is in his descriptions >> of the individuals and his interactions with them over the years. > > The final paragraph advice to be so harsh in criticism that they never > come back seems like the only advice that might work. Or perhaps > ignoring the cranks. All the harsh criticism has been written off as mere ad hominem attacks by fools. Anyone that denigrates my work on any other basis than its substance is simply a nitwit. We have made a little progress on the incompleteness stuff as soon as we got past that people are certain that I am incorrect entirely on the basis that they really really believe that I am incorrect. The fact that the commutativity of addition cannot be proven or refuted in Q might possibly show that Q is incomplete in some sense. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-10-19 21:26 -0600 |
| Message-ID | <rmlle3$rvq$1@dont-email.me> |
| In reply to | #24011 |
On 10/19/2020 3:46 PM, Mike Terry wrote: > On 19/10/2020 22:04, Eli the Bearded wrote: >> In comp.lang.c, >> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>> To my recollection, you have carefully avoided giving /any/ details of >>> what's in your partial decider, or its high level design, or e.g. what >>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>> from 2018 were, or anything really. When asked you refuse, saying it >>> might give the game away and let someone else steal your glory! >> >> This is informative, but a little less generalized than it should be: >> >> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >> >> Elijah >> ------ >> the decades roll by but the problems remain basically the same >> > > Yes, that's a nice article which I've read before. He even mentions the > fear of having their glory stolen, and consequent copy-righting common > for trisectors. :) The final advice on what actually to do when the > trisector comes seems a little naf to me though - and not applicable so > much to these newsgroups. The joy of the article is in his descriptions > of the individuals and his interactions with them over the years. I have the book and I find the character descriptions rather interesting; not so much, the pseudo mathematics. Perhaps PO will sneak a peek and use it as a training manual and that might provide us, his audience, with slightly more variety. == Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-10-19 14:54 -0700 |
| Message-ID | <rml1vg$4c2$3@gioia.aioe.org> |
| In reply to | #24007 |
On 10/19/2020 2:04 PM, Eli the Bearded wrote: > In comp.lang.c, > Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >> To my recollection, you have carefully avoided giving /any/ details of >> what's in your partial decider, or its high level design, or e.g. what >> the claimed "incorrect assumptions" in my PO-HP-check-list questions >> from 2018 were, or anything really. When asked you refuse, saying it >> might give the game away and let someone else steal your glory! > > This is informative, but a little less generalized than it should be: > > http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf For some reason this reminds me of a clock problem. When will the hands of a clock: hours, minutes, seconds, perfectly divide the circle into three equal parts? Well, imho, its impossible.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-10-19 14:57 -0700 |
| Message-ID | <rml248$4c2$4@gioia.aioe.org> |
| In reply to | #24013 |
On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: > On 10/19/2020 2:04 PM, Eli the Bearded wrote: >> In comp.lang.c, >> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>> To my recollection, you have carefully avoided giving /any/ details of >>> what's in your partial decider, or its high level design, or e.g. what >>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>> from 2018 were, or anything really. When asked you refuse, saying it >>> might give the game away and let someone else steal your glory! >> >> This is informative, but a little less generalized than it should be: >> >> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf > > > For some reason this reminds me of a clock problem. When will the hands > of a clock: hours, minutes, seconds, perfectly divide the circle into > three equal parts? Well, imho, its impossible. Basically the following time wrt positions of the hands is impossible: 12 for the hour hand 20 for the minute hand 40 for the second hand
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2020-10-19 22:17 +0000 |
| Message-ID | <rml39g$pqr$1@gioia.aioe.org> |
| In reply to | #24014 |
In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: > On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>> In comp.lang.c, >>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>> To my recollection, you have carefully avoided giving /any/ details of >>>> what's in your partial decider, or its high level design, or e.g. what >>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>> from 2018 were, or anything really. When asked you refuse, saying it >>>> might give the game away and let someone else steal your glory! >>> This is informative, but a little less generalized than it should be: >>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >> For some reason this reminds me of a clock problem. When will the hands >> of a clock: hours, minutes, seconds, perfectly divide the circle into >> three equal parts? Well, imho, its impossible. > Basically the following time wrt positions of the hands is impossible: > 12 for the hour hand > 20 for the minute hand > 40 for the second hand I think you missed Aleph_1 cases. -- Fuel Consumption of Conventional Reactor Typical reactor may contain about 100 tonnes of enriched uranium (i.e. about 113 tonnes of uranium dioxide). This fuel is loaded within, for example, 157 fuel assemblies composed of over 45,000 fuel rods. A common fuel assembly contain energy for approximately 4 years of operation at full power. -- Nuclear Power
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-10-19 16:25 -0700 |
| Message-ID | <87tuup94sl.fsf@nosuchdomain.example.com> |
| In reply to | #24016 |
R Kym Horsell <kym@kymhorsell.com> writes:
> In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote:
>> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote:
>>> On 10/19/2020 2:04 PM, Eli the Bearded wrote:
>>>> In comp.lang.c,
>>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote:
>>>>> To my recollection, you have carefully avoided giving /any/ details of
>>>>> what's in your partial decider, or its high level design, or e.g. what
>>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions
>>>>> from 2018 were, or anything really. When asked you refuse, saying it
>>>>> might give the game away and let someone else steal your glory!
>>>> This is informative, but a little less generalized than it should be:
>>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf
>>> For some reason this reminds me of a clock problem. When will the hands
>>> of a clock: hours, minutes, seconds, perfectly divide the circle into
>>> three equal parts? Well, imho, its impossible.
>> Basically the following time wrt positions of the hands is impossible:
>> 12 for the hour hand
>> 20 for the minute hand
>> 40 for the second hand
>
> I think you missed Aleph_1 cases.
But no more than a small finite number of those Aleph_1 cases
are relevant.
There are a small finite number of times when the hour and minute
hands are exactly 120 degrees apart (24 or so, but I'm too lazy to
look for off-by-one errors). At none of those times is the second
hand exactly 120 degrees away from both the hour and minute hands.
(This shouldn't be hard to prove, but again, I'm too lazy to do it.)
This assumes a clock on which all three hands move smoothly.
(I've dropped comp.lang.c, to which this certainly is not relevant.
It's not particularly relevant to comp.theory either.)
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2020-10-19 23:29 +0000 |
| Message-ID | <rml7gb$8fq$1@gioia.aioe.org> |
| In reply to | #24021 |
Keith Thompson <Keith.S.Thompson+u@gmail.com> wrote: > R Kym Horsell <kym@kymhorsell.com> writes: >> In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >>>> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>>>> In comp.lang.c, >>>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>>>> To my recollection, you have carefully avoided giving /any/ details of >>>>>> what's in your partial decider, or its high level design, or e.g. what >>>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>>>> from 2018 were, or anything really. When asked you refuse, saying it >>>>>> might give the game away and let someone else steal your glory! >>>>> This is informative, but a little less generalized than it should be: >>>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >>>> For some reason this reminds me of a clock problem. When will the hands >>>> of a clock: hours, minutes, seconds, perfectly divide the circle into >>>> three equal parts? Well, imho, its impossible. >>> Basically the following time wrt positions of the hands is impossible: >>> 12 for the hour hand >>> 20 for the minute hand >>> 40 for the second hand >> >> I think you missed Aleph_1 cases. > > But no more than a small finite number of those Aleph_1 cases > are relevant. > > There are a small finite number of times when the hour and minute > hands are exactly 120 degrees apart (24 or so, but I'm too lazy to > look for off-by-one errors). At none of those times is the second > hand exactly 120 degrees away from both the hour and minute hands. > (This shouldn't be hard to prove, but again, I'm too lazy to do it.) > > This assumes a clock on which all three hands move smoothly. > > (I've dropped comp.lang.c, to which this certainly is not relevant. > It's not particularly relevant to comp.theory either.) Oh, well. It's comp.theory and not sci.math so that's Ok then.
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-19 18:19 -0700 |
| Message-ID | <04088f20-f842-4846-9b10-34ffc0b5ac8do@googlegroups.com> |
| In reply to | #24021 |
On Monday, October 19, 2020 at 4:25:50 PM UTC-7, Keith Thompson wrote: > (I've dropped comp.lang.c, to which this certainly is not relevant. > It's not particularly relevant to comp.theory either.) Curious. Just what do you imagine is relevant to comp.theory?
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-10-19 18:26 -0700 |
| Message-ID | <87pn5d8z85.fsf@nosuchdomain.example.com> |
| In reply to | #24031 |
David Kleinecke <dkleinecke@gmail.com> writes:
> On Monday, October 19, 2020 at 4:25:50 PM UTC-7, Keith Thompson wrote:
>
>> (I've dropped comp.lang.c, to which this certainly is not relevant.
>> It's not particularly relevant to comp.theory either.)
>
> Curious. Just what do you imagine is relevant to comp.theory?
I have no opinion on that that's worth sharing.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-10-19 16:34 -0700 |
| Message-ID | <rml7po$cs3$1@gioia.aioe.org> |
| In reply to | #24016 |
On 10/19/2020 3:17 PM, R Kym Horsell wrote: > In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >>> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>>> In comp.lang.c, >>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>>> To my recollection, you have carefully avoided giving /any/ details of >>>>> what's in your partial decider, or its high level design, or e.g. what >>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>>> from 2018 were, or anything really. When asked you refuse, saying it >>>>> might give the game away and let someone else steal your glory! >>>> This is informative, but a little less generalized than it should be: >>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >>> For some reason this reminds me of a clock problem. When will the hands >>> of a clock: hours, minutes, seconds, perfectly divide the circle into >>> three equal parts? Well, imho, its impossible. >> Basically the following time wrt positions of the hands is impossible: >> 12 for the hour hand >> 20 for the minute hand >> 40 for the second hand > > I think you missed Aleph_1 cases. > Well, I was thinking about the: https://en.wikipedia.org/wiki/Clock_angle_problem Where 12:20:40 cannot ever occur. I was not thinking about an instantaneous case.
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2020-10-20 00:08 +0000 |
| Message-ID | <rml9pe$13pi$1@gioia.aioe.org> |
| In reply to | #24023 |
In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: > On 10/19/2020 3:17 PM, R Kym Horsell wrote: >> In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >>>> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>>>> In comp.lang.c, >>>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>>>> To my recollection, you have carefully avoided giving /any/ details of >>>>>> what's in your partial decider, or its high level design, or e.g. what >>>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>>>> from 2018 were, or anything really. When asked you refuse, saying it >>>>>> might give the game away and let someone else steal your glory! >>>>> This is informative, but a little less generalized than it should be: >>>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >>>> For some reason this reminds me of a clock problem. When will the hands >>>> of a clock: hours, minutes, seconds, perfectly divide the circle into >>>> three equal parts? Well, imho, its impossible. >>> Basically the following time wrt positions of the hands is impossible: >>> 12 for the hour hand >>> 20 for the minute hand >>> 40 for the second hand >> >> I think you missed Aleph_1 cases. > Well, I was thinking about the: > https://en.wikipedia.org/wiki/Clock_angle_problem > Where 12:20:40 cannot ever occur. > I was not thinking about an instantaneous case. Ach. The 21st Cent. kids is allays thinking about some wiki page! ;) I havent looked but you can imagine a proof by contradiction. Assume that the configuration exists, not that spinning the clock face behind the hands makes no difference, so you can arbitrarily put the min, hr or sec hand on the 12. If the min or hr hand is exactly on the 12 the second hand must also be in the 12. Cases ruled out. Which boils down to 2 cases with sweep hand pointing at the 12. Unfortunately this is comp.theory and I'm feeling to lazy to do the rest.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-19 21:12 -0400 |
| Message-ID | <rQqjH.365238$CM.203658@fx01.iad> |
| In reply to | #24023 |
On 10/19/20 7:34 PM, Chris M. Thomasson wrote: > On 10/19/2020 3:17 PM, R Kym Horsell wrote: >> In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >>>> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>>>> In comp.lang.c, >>>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>>>> To my recollection, you have carefully avoided giving /any/ >>>>>> details of >>>>>> what's in your partial decider, or its high level design, or e.g. >>>>>> what >>>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>>>> from 2018 were, or anything really. When asked you refuse, saying it >>>>>> might give the game away and let someone else steal your glory! >>>>> This is informative, but a little less generalized than it should be: >>>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >>>> For some reason this reminds me of a clock problem. When will the hands >>>> of a clock: hours, minutes, seconds, perfectly divide the circle into >>>> three equal parts? Well, imho, its impossible. >>> Basically the following time wrt positions of the hands is impossible: >>> 12 for the hour hand >>> 20 for the minute hand >>> 40 for the second hand >> >> I think you missed Aleph_1 cases. >> > > Well, I was thinking about the: > > https://en.wikipedia.org/wiki/Clock_angle_problem > > Where 12:20:40 cannot ever occur. > > I was not thinking about an instantaneous case. 12;20:40 is a perfectly valid time, the angles just don't match the requirements, it is just at that time the minute hand is a bit past the 4, and the hout hand is about 1/3 of the way between 12 and 1, so none of the angles is 120 degrees. In a 12 hour span, there will be 11 times when the minute hand is exactly 120 degress ahead, and 11 times when it is 120 degrees behind, and I suspect (but haven't checked) that at none of those instances will the second hand be in just the right spot.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-10-21 20:23 -0700 |
| Message-ID | <rmqtut$1v23$1@gioia.aioe.org> |
| In reply to | #24027 |
On 10/19/2020 6:12 PM, Richard Damon wrote: > On 10/19/20 7:34 PM, Chris M. Thomasson wrote: >> On 10/19/2020 3:17 PM, R Kym Horsell wrote: >>> In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>>> On 10/19/2020 2:54 PM, Chris M. Thomasson wrote: >>>>> On 10/19/2020 2:04 PM, Eli the Bearded wrote: >>>>>> In comp.lang.c, >>>>>> Mike Terry <news.dead.person.stones@darjeeling.plus.com> wrote: >>>>>>> To my recollection, you have carefully avoided giving /any/ >>>>>>> details of >>>>>>> what's in your partial decider, or its high level design, or e.g. >>>>>>> what >>>>>>> the claimed "incorrect assumptions" in my PO-HP-check-list questions >>>>>>> from 2018 were, or anything really. When asked you refuse, saying it >>>>>>> might give the game away and let someone else steal your glory! >>>>>> This is informative, but a little less generalized than it should be: >>>>>> http://web.mst.edu/%7Elmhall/WhatToDoWhenTrisectorComes.pdf >>>>> For some reason this reminds me of a clock problem. When will the hands >>>>> of a clock: hours, minutes, seconds, perfectly divide the circle into >>>>> three equal parts? Well, imho, its impossible. >>>> Basically the following time wrt positions of the hands is impossible: >>>> 12 for the hour hand >>>> 20 for the minute hand >>>> 40 for the second hand >>> >>> I think you missed Aleph_1 cases. >>> >> >> Well, I was thinking about the: >> >> https://en.wikipedia.org/wiki/Clock_angle_problem >> >> Where 12:20:40 cannot ever occur. >> >> I was not thinking about an instantaneous case. > > 12;20:40 is a perfectly valid time, Right. > the angles just don't match the > requirements, Indeed. > it is just at that time the minute hand is a bit past the > 4, and the hout hand is about 1/3 of the way between 12 and 1, so none > of the angles is 120 degrees. Right. > In a 12 hour span, there will be 11 times when the minute hand is > exactly 120 degress ahead, and 11 times when it is 120 degrees behind, > and I suspect (but haven't checked) that at none of those instances will > the second hand be in just the right spot. Unless I am missing something, that second hand will be out of sync wrt perfect 120 degree angles between the hour::minute::second hands when dealing with the clock angle problem.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-19 20:39 +0100 |
| Message-ID | <874kmqhuox.fsf@bsb.me.uk> |
| In reply to | #23988 |
olcott <NoOne@NoWhere.com> writes: > The code that correctly decides the conventional self-referential > halting problem counter-examples can now finally be written. This code > utterly depended upon the now finally completed DebugStep() operating > system function. Just post the actual Turing machine you've had fully encoded for nearly two years. Oh you can't, can you, because you lied about that. > This code exploits a key undiscovered aspect that is common to all the > conventional self-referential halting problem counter-examples. The code which can now finally be written despite your claiming to have written it two years ago? Translation: "I now have enough junk that I think I can hide the error for quite some time. And there will be enough noise that no one will ask for the code I never had back then". But I will ask for it. When you finally tip your hand and post this new pile of junk code, you will have no excuse for not posting the simple and easily verifiable "actual Turing machine" that you had "fully encoded" back in Dec 2018. Start thinking up new excuses now... -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-19 14:54 -0500 |
| Message-ID | <ec2dnVES7LFwcxDCnZ2dnUU7-YGdnZ2d@giganews.com> |
| In reply to | #23996 |
On 10/19/2020 2:39 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> The code that correctly decides the conventional self-referential >> halting problem counter-examples can now finally be written. This code >> utterly depended upon the now finally completed DebugStep() operating >> system function. > > Just post the actual Turing machine you've had fully encoded for nearly > two years. Oh you can't, can you, because you lied about that. > >> This code exploits a key undiscovered aspect that is common to all the >> conventional self-referential halting problem counter-examples. > > The code which can now finally be written despite your claiming to have > written it two years ago? > > Translation: "I now have enough junk that I think I can hide the error > for quite some time. And there will be enough noise that no one will > ask for the code I never had back then". > > But I will ask for it. When you finally tip your hand and post this new > pile of junk code, you will have no excuse for not posting the simple > and easily verifiable "actual Turing machine" that you had "fully > encoded" back in Dec 2018. Start thinking up new excuses now... > You continue so say goofy things on the basis that bias has totally clouded your mind. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-19 21:49 +0100 |
| Message-ID | <87mu0igcw2.fsf@bsb.me.uk> |
| In reply to | #23999 |
olcott <NoOne@NoWhere.com> writes: > On 10/19/2020 2:39 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> The code that correctly decides the conventional self-referential >>> halting problem counter-examples can now finally be written. This code >>> utterly depended upon the now finally completed DebugStep() operating >>> system function. >> >> Just post the actual Turing machine you've had fully encoded for nearly >> two years. Oh you can't, can you, because you lied about that. >> >>> This code exploits a key undiscovered aspect that is common to all the >>> conventional self-referential halting problem counter-examples. >> >> The code which can now finally be written despite your claiming to have >> written it two years ago? >> >> Translation: "I now have enough junk that I think I can hide the error >> for quite some time. And there will be enough noise that no one will >> ask for the code I never had back then". >> >> But I will ask for it. When you finally tip your hand and post this new >> pile of junk code, you will have no excuse for not posting the simple >> and easily verifiable "actual Turing machine" that you had "fully >> encoded" back in Dec 2018. Start thinking up new excuses now... > > You continue so say goofy things on the basis that bias has totally > clouded your mind. Will you post the actual Turing machines you had fully encoded in Dec 2018? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-27 10:52 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(39 days of review and no mistakes found) |
| Message-ID | <fOydnUUZrd5Gs1zCnZ2dnUU7-Y3NnZ2d@giganews.com> |
| In reply to | #23988 |
On 10/19/2020 12:45 PM, olcott wrote: > x86utm is a universal Turing Machine having the x86 language as machine > description language. It can directly execute the COFF object file > output of the Microsoft "C" compiler as long as the code does not invoke > any external libraries. All global data must be initialized or it does > not exist in the COFF object file. All relocatable refernces are patched > to point to their file offsets. > > This was the most difficult aspect of the entire x86utm system: > The operating system function DebugStep() can now invoke itself > recursively to an arbitrary depth. > > It can DebugStep() itself DebugStep()ing itself... > DebugStep()ing another function with an arbitrary hierarchy of > DebugStep()ing in-between. > > The halt decider aborts the execution of its target function and reports > not halting behavior as soon as it detects that its target function > would not otherwise halt. Without a DebugStep() function its examination > of the Target code wold be insufficiently granular. > > The code that correctly decides the conventional self-referential > halting problem counter-examples can now finally be written. This code > utterly depended upon the now finally completed DebugStep() operating > system function. > > This code exploits a key undiscovered aspect that is common to all the > conventional self-referential halting problem counter-examples. > > This key undiscovered aspect that makes all of the conventional > self-referential halting problem counter-examples decidable cannot > simply be dismissed out-of-hand without review when a fully operational > program shows that it does correctly decide elements of the set of of > conventional self-referential halting problem counter-examples. > > -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> |
|---|---|
| Date | 2020-11-27 16:57 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(39 days of review and no mistakes found) |
| Message-ID | <eeawH.150037$b5kb.121611@fx15.ams4> |
| In reply to | #26092 |
On 27/11/2020 16:52, olcott wrote: > On 10/19/2020 12:45 PM, olcott wrote: >> x86utm is a universal Turing Machine having the x86 language as machine description language. It can directly execute the COFF object file output of the Microsoft "C" compiler as long as the code does not invoke any external libraries. All global data must be initialized or it does not exist in the COFF object file. All relocatable refernces are patched to point to their file offsets. >> >> This was the most difficult aspect of the entire x86utm system: >> The operating system function DebugStep() can now invoke itself recursively to an arbitrary depth. >> >> It can DebugStep() itself DebugStep()ing itself... >> DebugStep()ing another function with an arbitrary hierarchy of DebugStep()ing in-between. >> >> The halt decider aborts the execution of its target function and reports not halting behavior as soon as it detects that its target function would not otherwise halt. Without a DebugStep() function its examination of the Target code wold be insufficiently granular. >> >> The code that correctly decides the conventional self-referential halting problem counter-examples can now finally be written. This code utterly depended upon the now finally completed DebugStep() operating system function. >> >> This code exploits a key undiscovered aspect that is common to all the conventional self-referential halting problem counter-examples. >> >> This key undiscovered aspect that makes all of the conventional self-referential halting problem counter-examples decidable cannot simply be dismissed out-of-hand without review when a fully operational program shows that it does correctly decide elements of the set of of conventional self-referential halting problem counter-examples. You still haven't shown how non-halting behaviour is decided. Still nothing to see here. /Flibble -- ¬
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-27 11:10 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs)(algorithm to decide not-halting ) |
| Message-ID | <jLSdncNvGeKGrlzCnZ2dnUU7-I3NnZ2d@giganews.com> |
| In reply to | #26093 |
On 11/27/2020 10:57 AM, Mr Flibble wrote: > On 27/11/2020 16:52, olcott wrote: >> On 10/19/2020 12:45 PM, olcott wrote: >>> x86utm is a universal Turing Machine having the x86 language as >>> machine description language. It can directly execute the COFF object >>> file output of the Microsoft "C" compiler as long as the code does >>> not invoke any external libraries. All global data must be >>> initialized or it does not exist in the COFF object file. All >>> relocatable refernces are patched to point to their file offsets. >>> >>> This was the most difficult aspect of the entire x86utm system: >>> The operating system function DebugStep() can now invoke itself >>> recursively to an arbitrary depth. >>> >>> It can DebugStep() itself DebugStep()ing itself... >>> DebugStep()ing another function with an arbitrary hierarchy of >>> DebugStep()ing in-between. >>> >>> The halt decider aborts the execution of its target function and >>> reports not halting behavior as soon as it detects that its target >>> function would not otherwise halt. Without a DebugStep() function its >>> examination of the Target code wold be insufficiently granular. >>> >>> The code that correctly decides the conventional self-referential >>> halting problem counter-examples can now finally be written. This >>> code utterly depended upon the now finally completed DebugStep() >>> operating system function. >>> >>> This code exploits a key undiscovered aspect that is common to all >>> the conventional self-referential halting problem counter-examples. >>> >>> This key undiscovered aspect that makes all of the conventional >>> self-referential halting problem counter-examples decidable cannot >>> simply be dismissed out-of-hand without review when a fully >>> operational program shows that it does correctly decide elements of >>> the set of of conventional self-referential halting problem >>> counter-examples. > > You still haven't shown how non-halting behaviour is decided. > > Still nothing to see here. > > /Flibble > I have explained how non-halting is decided in complete detail many times. It turns out that the complete detail is so simple that no-one accepted that it was complete until I proved that it is complete to Mike. Here is the proof. The sequences of instructions from HERE to THERE and HERE to HERE are from actual execution traces. The x86 emulator screens out all dead code and only shows us the precise sequence of the code that is actually reached. -HERE: // current location - Instructions that cannot possibly exit a loop -THERE: goto HERE; To form a mathematical proof on the basis of the x86 language being construed as a formal language we only have to derive the complete list of every instruction that can possibly exit the above loop and if there are none of these between the labels HERE and THERE then we know that the loop is infinite. The case for infinite recursion is similar. -HERE: Call Function At Address X - Instructions that cannot possibly exit recursion -HERE: Call Function At Address X If there are no instructions that can possibly exit recursion between invocations of the same function from the same machine address, then recursion is infinite. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 2 of 5 — ← Prev page 1 [2] 3 4 5 Next page →
Back to top | Article view | comp.theory
csiph-web