Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #24043 > unrolled thread

The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ]

Started byolcott <NoOne@NoWhere.com>
First post2020-10-20 11:33 -0500
Last post2020-10-29 14:01 +0100
Articles 20 on this page of 499 — 17 participants

Back to article view | Back to comp.theory


Contents

  The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-20 11:33 -0500
    Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-20 19:11 +0100
      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-20 13:40 -0500
        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-20 14:19 -0500
        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 02:57 +0100
          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-20 22:07 -0500
            Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 16:28 +0100
              Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 16:52 +0100
              Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-21 11:48 -0500
                Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 20:30 +0100
                  Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-21 15:27 -0500
                    Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] André G. Isaak <agisaak@gm.invalid> - 2020-10-21 14:57 -0600
                      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-21 16:12 -0500
                        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] André G. Isaak <agisaak@gm.invalid> - 2020-10-21 15:54 -0600
                          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-21 17:20 -0500
                            Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 00:16 +0100
                              Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] olcott <NoOne@NoWhere.com> - 2020-10-21 18:28 -0500
                                Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 00:55 +0100
                                Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] olcott <NoOne@NoWhere.com> - 2020-10-22 09:20 -0500
                    Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 23:10 +0100
                      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] olcott <NoOne@NoWhere.com> - 2020-10-21 17:55 -0500
                        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-22 03:38 +0100
                          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] olcott <NoOne@NoWhere.com> - 2020-10-21 21:54 -0500
                            Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-22 04:38 +0100
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-21 23:33 -0500
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 11:05 +0100
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 09:44 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 16:14 +0100
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-22 08:00 -0400
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 09:36 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 15:57 +0100
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 10:44 -0500
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 00:34 +0100
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 18:55 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 03:09 +0100
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 21:31 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 04:44 +0100
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 23:13 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 16:03 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 10:40 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 00:40 +0100
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-23 17:18 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 17:28 +0100
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:40 -0500
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 11:38 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-22 16:25 +0100
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 16:45 +0100
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-22 17:57 +0100
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:26 -0500
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 21:15 +0100
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 15:36 -0500
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 11:38 -0500
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 09:56 -0700
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:09 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 10:27 -0700
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:32 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 18:33 +0100
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 10:58 -0700
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:19 -0500
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:30 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 19:34 +0100
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 20:53 +0100
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 15:24 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 13:28 -0700
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 16:25 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 00:51 +0100
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 19:09 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 02:50 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-22 21:27 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 05:00 +0100
                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-22 23:31 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 17:19 +0100
                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 21:22 -0400
                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 20:36 -0500
                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 22:50 -0400
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 22:18 -0500
                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 10:00 -0400
                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 11:04 -0500
                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 00:12 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 03:47 -0700
                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 08:57 -0500
                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 07:34 -0700
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 10:12 -0500
                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 16:20 +0100
                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 11:55 -0500
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 00:52 +0100
                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 09:59 -0700
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:20 -0500
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 21:02 +0100
                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 13:29 -0700
                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 15:56 -0500
                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 14:12 -0700
                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 16:58 -0500
                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 21:35 -0400
                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 20:45 -0500
                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-23 19:54 -0700
                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 22:22 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 12:46 +0100
                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Andy Walker <anw@cuboid.co.uk> - 2020-10-24 16:43 +0100
                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 14:01 -0500
                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Andy Walker <anw@cuboid.co.uk> - 2020-10-24 23:14 +0100
                                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 17:35 -0500
                                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Andy Walker <anw@cuboid.co.uk> - 2020-10-25 16:33 +0000
                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-25 12:37 -0500
                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-25 12:10 -0600
                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-25 15:27 -0500
                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-25 15:42 -0500
                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 23:11 +0000
                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-26 03:18 -0600
                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-26 03:21 -0600
                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 22:58 -0400
                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 22:28 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-23 21:03 -0700
                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 23:13 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 13:27 -0400
                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 14:08 -0500
                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-24 19:54 +0000
                                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 15:48 -0500
                                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-24 21:41 +0000
                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 14:47 -0700
                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-24 17:20 -0500
                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-26 13:37 +0000
                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 11:30 -0500
                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-26 10:43 -0600
                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 12:44 -0500
                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-26 17:38 +0000
                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 13:13 -0500
                                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-26 19:28 +0000
                                                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 14:46 -0500
                                                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 15:43 -0500
                                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-26 21:07 +0000
                                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 16:27 -0500
                                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-27 07:03 +0000
                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 09:53 -0500
                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Mostowski Collapse <janburse@fastmail.fm> - 2020-10-27 21:07 +0100
                                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-26 16:57 -0500
                                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-27 04:53 -0600
                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 14:30 +0000
                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 07:52 -0700
                                                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 10:28 -0500
                                                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 15:30 +0000
                                                                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 08:45 -0700
                                                                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 16:05 +0000
                                                                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 11:05 -0500
                                                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 09:53 -0700
                                                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 13:36 -0500
                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 12:05 -0700
                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 14:44 -0500
                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-27 16:05 -0400
                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-28 03:41 +0000
                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-28 02:57 -0700
                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-28 15:54 +0000
                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] David Kleinecke <dkleinecke@gmail.com> - 2020-10-28 09:25 -0700
                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-28 18:31 -0500
                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-29 00:02 +0000
                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 07:55 -0500
                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Richard Damon <Richard@Damon-Family.org> - 2020-10-29 09:28 -0400
                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 10:49 -0500
                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Richard Damon <Richard@Damon-Family.org> - 2020-10-29 12:32 -0400
                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 12:41 -0500
                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Richard Damon <Richard@Damon-Family.org> - 2020-10-29 16:01 -0400
                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 15:58 -0500
                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-29 06:28 -0700
                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 10:59 -0500
                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-29 09:50 -0700
                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 12:48 -0500
                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-29 11:51 -0700
                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 14:09 -0500
                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-29 13:12 -0700
                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] olcott <NoOne@NoWhere.com> - 2020-10-29 16:08 -0500
                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-29 22:51 +0000
                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-29 18:15 -0500
                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-30 01:05 +0000
                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-29 20:32 -0500
                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-30 02:16 +0000
                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-29 21:36 -0500
                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-29 21:51 -0500
                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 03:44 -0700
                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 06:32 -0500
                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 06:40 -0500
                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-30 22:08 +0000
                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 17:21 -0500
                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 00:46 +0000
                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 20:07 -0500
                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-31 02:30 +0000
                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 02:44 +0000
                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 21:56 -0500
                                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 16:41 +0000
                                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Jeff Barnett <jbb@notatt.com> - 2020-10-31 11:16 -0600
                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 23:40 -0500
                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 16:28 +0000
                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 12:56 -0500
                                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 20:49 +0000
                                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 16:07 -0500
                                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-31 14:55 -0700
                                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 17:09 -0500
                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-31 15:22 -0700
                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 17:30 -0500
                                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-31 16:00 -0700
                                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 18:13 -0500
                                                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-01 13:56 +0000
                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Alan Mackenzie <acm@muc.de> - 2020-10-31 22:23 +0000
                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 17:37 -0500
                                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-10-31 19:18 -0400
                                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 18:40 -0500
                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-10-31 20:12 -0400
                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-10-31 21:29 -0400
                                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-10-31 22:34 -0400
                                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 21:38 -0500
                                                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-11-01 08:13 -0500
                                                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-11-01 12:18 -0500
                                                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-11-01 12:05 -0600
                                                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-01 10:43 -0800
                                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-11-01 12:56 -0600
                                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ x86 machine description language ] olcott <NoOne@NoWhere.com> - 2020-11-01 13:32 -0600
                                                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-11-01 17:37 -0500
                                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-11-01 17:41 -0600
                                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Richard Damon <Richard@Damon-Family.org> - 2020-11-01 19:09 -0500
                                                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-11-01 12:43 -0600
                                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ execution trace described ] olcott <NoOne@NoWhere.com> - 2020-10-31 23:36 -0500
                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 00:05 -0500
                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-31 16:40 +0000
                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 05:36 -0700
                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 10:32 -0500
                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 08:54 -0700
                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 11:30 -0500
                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 16:22 -0700
                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 18:41 -0500
                                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 16:48 -0700
                                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 18:50 -0500
                                                                                                                                                                                Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 16:59 -0700
                                                                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 19:07 -0500
                                                                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-30 17:23 -0700
                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 19:34 -0500
                                                                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-31 02:26 +0000
                                                                                                                                                                                        Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-31 03:05 -0700
                                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-31 12:23 +0000
                                                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-31 09:22 -0500
                                                                                                                                                          Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-30 14:26 +0000
                                                                                                                                                            Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] olcott <NoOne@NoWhere.com> - 2020-10-30 10:49 -0500
                                                                                                                                                              Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-31 01:26 +0000
                                                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-28 08:31 -0700
                                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Jeff Barnett <jbb@notatt.com> - 2020-10-28 10:57 -0600
                                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-28 12:05 -0700
                                                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Richard Damon <Richard@Damon-Family.org> - 2020-10-27 13:09 -0400
                                                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] André G. Isaak <agisaak@gm.invalid> - 2020-10-27 13:57 -0600
                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-27 11:00 -0500
                                                                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 16:53 +0000
                                                                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] key definitions provided olcott <NoOne@NoWhere.com> - 2020-10-27 10:20 -0500
                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] key definitions provided Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 15:56 +0000
                                                                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] key definitions provided André G. Isaak <agisaak@gm.invalid> - 2020-10-27 12:53 -0600
                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 01:25 +0100
                                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Andy Walker <anw@cuboid.co.uk> - 2020-10-25 18:38 +0000
                                                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Alan Mackenzie <acm@muc.de> - 2020-10-25 20:49 +0000
                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 23:26 +0000
                                                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Andy Walker <anw@cuboid.co.uk> - 2020-10-25 23:57 +0000
                                                                      Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 22:43 +0100
                                                                        Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 17:10 -0500
                                                                          Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 00:27 +0100
                                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:34 -0500
                                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 01:15 +0100
                                                            Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 16:46 +0100
                                                              Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:36 -0500
                                                                Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 01:05 +0100
                                                                  Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] olcott <NoOne@NoWhere.com> - 2020-10-23 19:15 -0500
                                                                    Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 01:29 +0100
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-22 23:41 -0400
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 23:02 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Tim Woodall <news001@woodall.me.uk> - 2020-10-23 07:05 +0000
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 08:38 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 11:02 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 08:45 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 15:56 +0100
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 10:30 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 00:32 +0100
                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:36 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 21:52 -0400
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-23 13:03 -0700
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 15:24 -0500
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 02:29 -0700
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 08:43 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-23 15:51 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 10:19 -0500
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-22 23:14 +0100
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 18:05 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 16:55 -0700
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 19:29 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 18:06 -0700
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 20:26 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-23 23:51 +0100
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 16:03 -0700
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:14 -0500
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 01:10 +0100
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 00:17 +0100
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:31 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 16:39 -0700
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:54 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 16:58 -0700
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 19:13 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 17:24 -0700
                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 01:43 +0100
                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 02:37 -0700
                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 10:41 -0500
                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 09:04 -0700
                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 13:46 -0500
                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 00:54 +0100
                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 22:03 +0100
                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 14:35 -0700
                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 01:23 +0000
                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 00:45 -0700
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 09:35 -0500
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 07:39 -0700
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 10:33 -0500
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-25 12:14 -0400
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] olcott <NoOne@NoWhere.com> - 2020-10-25 13:42 -0500
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] Richard Damon <Richard@Damon-Family.org> - 2020-10-25 16:55 -0400
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] olcott <NoOne@NoWhere.com> - 2020-10-25 16:07 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 23:51 +0000
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-25 17:26 +0000
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 14:16 -0500
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 13:55 -0700
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 15:56 -0500
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-25 17:35 -0400
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 14:43 -0700
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 16:55 -0500
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 14:43 +0000
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 08:36 -0700
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 12:23 -0500
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 22:54 +0000
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 16:19 -0700
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 18:35 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-25 18:40 -0500
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-26 01:17 +0000
                                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-26 02:49 +0000
                                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-26 03:56 +0000
                                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-26 02:37 -0700
                                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-26 12:10 +0000
                                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-26 06:45 -0700
                                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-26 17:24 +0000
                                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-26 10:38 -0700
                                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-27 00:51 +0000
                                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 11:16 -0500
                                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-26 15:41 +0000
                                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-26 17:28 +0000
                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 19:52 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 01:21 +0100
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 01:06 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 19:39 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 04:27 +0100
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 22:40 -0500
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 23:02 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 16:58 +0100
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 13:38 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 01:17 +0100
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:06 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 00:38 +0100
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 18:46 -0500
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 01:03 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-24 08:04 -0600
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 11:25 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 15:38 +0100
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 10:36 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 17:37 +0100
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 12:49 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 19:32 +0100
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 11:40 -0700
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 13:42 -0500
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 20:00 +0100
                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 14:05 -0500
                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 20:44 +0100
                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 15:41 -0500
                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 21:57 +0100
                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 16:05 -0500
                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-24 22:44 +0100
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 17:01 -0500
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-26 16:11 +0000
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 14:12 -0500
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-26 19:38 +0000
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 14:53 -0500
                                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-26 13:50 -0700
                                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 16:01 -0500
                                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-26 14:08 -0700
                                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-26 14:26 -0700
                                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 16:35 -0500
                                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-26 20:59 -0400
                                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 20:35 -0500
                                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 02:19 -0700
                                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 16:31 -0500
                                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 17:08 -0500
                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 15:16 -0700
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 18:30 -0400
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 15:47 -0700
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 18:08 -0500
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 17:45 -0500
                                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-26 16:29 +0000
                                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 13:03 -0500
                                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] correction olcott <NoOne@NoWhere.com> - 2020-10-26 13:14 -0500
                                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] correction Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 00:06 +0000
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] correction Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-26 17:16 -0700
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] correction Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 00:46 +0000
                                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 20:11 -0500
                                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-27 02:48 +0000
                                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-26 22:38 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 13:36 -0400
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 14:13 -0500
                                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 16:55 -0400
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-24 14:06 -0700
                                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 16:31 -0500
                                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 18:17 -0400
                                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 18:00 -0500
                                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 19:48 -0400
                                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 19:29 -0500
                                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 16:24 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 11:52 -0500
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-22 10:45 -0700
                Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 22:42 +0100
                Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Richard Damon <Richard@Damon-Family.org> - 2020-10-21 21:22 -0400
                  Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] olcott <NoOne@NoWhere.com> - 2020-10-21 21:14 -0500
                    Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] Richard Damon <Richard@Damon-Family.org> - 2020-10-22 08:12 -0400
                      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] olcott <NoOne@NoWhere.com> - 2020-10-22 09:41 -0500
                        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] André G. Isaak <agisaak@gm.invalid> - 2020-10-22 13:43 -0600
                          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] olcott <NoOne@NoWhere.com> - 2020-10-22 14:54 -0500
                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 15:13 -0500
                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-22 14:34 -0600
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 16:28 -0500
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-22 15:34 -0600
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 16:47 -0500
                      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ] Andy Walker <anw@cuboid.co.uk> - 2020-10-22 16:20 +0100
          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Richard Damon <Richard@Damon-Family.org> - 2020-10-21 09:09 -0400
            Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 14:36 +0100
        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:19 -0500
          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 18:21 +0100
            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:27 -0500
              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 18:30 +0100
                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 12:35 -0500
                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 18:43 +0100
                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:08 -0500
                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 19:12 +0100
                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 11:17 -0700
                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:21 -0500
                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 11:30 -0700
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:35 -0500
                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Jeff Barnett <jbb@notatt.com> - 2020-10-22 11:59 -0600
                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 10:45 -0700
                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:13 -0500
                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 19:17 +0100
                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 13:24 -0500
          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 19:40 -0500
            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-22 17:44 -0700
              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 19:49 -0500
                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-22 17:59 -0700
                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 18:13 -0700
                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 20:15 -0500
                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 00:10 -0400
                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 23:28 -0500
                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 22:22 -0400
                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 21:51 -0500
                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-24 13:07 +0100
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 11:40 -0500
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-25 02:07 +0000
                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 06:29 -0600
                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 09:10 -0500
                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 08:30 -0600
                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 09:52 -0500
                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 09:04 -0600
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 10:49 -0500
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 10:06 -0600
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 11:48 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 11:04 -0600
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:31 -0500
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 12:00 -0600
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 13:12 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 12:35 -0600
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 14:04 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] André G. Isaak <agisaak@gm.invalid> - 2020-10-23 15:34 -0600
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 17:05 -0500
                                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-23 22:32 -0400
                                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 21:55 -0500
                                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Richard Damon <Richard@Damon-Family.org> - 2020-10-24 09:50 -0400
                                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-24 11:14 -0500
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-23 11:15 -0700
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 13:49 -0500
                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-23 17:37 +0100
                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 11:43 -0500
                                Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-23 17:49 +0100
                                  Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:06 -0500
                                    Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-23 18:10 +0100
                                      Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:24 -0500
                                        Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-23 18:35 +0100
                                          Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:46 -0500
                                            Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-23 18:53 +0100
                                              Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-23 13:06 -0500
    Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 17:54 +0100
      Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] olcott <NoOne@NoWhere.com> - 2020-10-22 11:57 -0500
        Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 18:05 +0100
          Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Joe Pfeiffer <pfeiffer@cs.nmsu.edu> - 2020-10-22 12:55 -0600
            Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-10-22 19:59 +0100
              Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2020-10-22 19:13 +0000
    Stop crossposting you imbecil spammer (Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ]) Mostowski Collapse <janburse@fastmail.fm> - 2020-10-29 14:01 +0100

Page 21 of 25 — ← Prev page 1 … 19 20 [21] 22 23 … 25  Next page →


#24504 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-26 20:11 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<FLGdnaP7s91R7grCnZ2dnUU7-eXNnZ2d@giganews.com>
In reply to#24498
On 10/26/2020 7:06 PM, Mike Terry wrote:
> On 26/10/2020 18:14, olcott wrote:
>> On 10/26/2020 1:03 PM, olcott wrote:
>>> On 10/26/2020 11:29 AM, Mike Terry wrote:
>>>> On 24/10/2020 23:08, olcott wrote:
>>>>> On 10/24/2020 3:57 PM, Mike Terry wrote:
>>>>>> On 24/10/2020 21:41, olcott wrote:
>>>>>>> On 10/24/2020 2:44 PM, Mike Terry wrote:
>>>>>>>> On 24/10/2020 20:05, olcott wrote:
>>>>>>>>> On 10/24/2020 2:00 PM, Mike Terry wrote:
>>>>>>>>>> On 24/10/2020 19:42, olcott wrote:
>>>>>>>>>>> On 10/24/2020 1:32 PM, Mike Terry wrote:
>>>>>>>>>>>> On 24/10/2020 18:49, olcott wrote:
>>>>>>>>>>>>> On 10/24/2020 11:37 AM, Mike Terry wrote:
>>>>>>>>>>>>>> On 24/10/2020 16:36, olcott wrote:
>>>>>>>>>>>>>>> On 10/24/2020 9:38 AM, Mike Terry wrote:
>>>>>>>>>>>>>>>> On 24/10/2020 07:03, olcott wrote:
>>>>>>>>>>>>>>>>> On 10/23/2020 5:51 PM, Mike Terry wrote:
>>>>>>>>>>>>>>>>>> On 23/10/2020 00:05, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 10/22/2020 5:14 PM, Mike Terry wrote:
>>>>>>>>>>>>>>>>>>>> On 22/10/2020 17:38, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 10/22/2020 10:25 AM, Mike Terry wrote:
>>>>>>>>>>>>>>>>>>>>>> On 22/10/2020 15:36, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 10/22/2020 7:00 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 10/22/20 12:33 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> The difference is that it is no longer possible 
>>>>>>>>>>>>>>>>>>>>>>>>> for
>>>>>>>>>>>>>>>>>>>>>>>>> H_Hat()
>>>>>>>>>>>>>>>>>>>>>>>>> to do
>>>>>>>>>>>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>>>>>>>>>>>> opposite of what H() decides. This transforms an
>>>>>>>>>>>>>>>>>>>>>>>>> undecidable
>>>>>>>>>>>>>>>>>>>>>>>>> problem
>>>>>>>>>>>>>>>>>>>>>>>>> into a decidable problem.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> If H_Hat no longer does what the proof defined, 
>>>>>>>>>>>>>>>>>>>>>>>> then
>>>>>>>>>>>>>>>>>>>>>>>> your
>>>>>>>>>>>>>>>>>>>>>>>> demonstration
>>>>>>>>>>>>>>>>>>>>>>>> is no longer applicable to the proof.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> If the halt decider is to report whether or not its
>>>>>>>>>>>>>>>>>>>>>>> input
>>>>>>>>>>>>>>>>>>>>>>> halts
>>>>>>>>>>>>>>>>>>>>>>> another
>>>>>>>>>>>>>>>>>>>>>>> program can be constructed on the the basis of
>>>>>>>>>>>>>>>>>>>>>>> this halt
>>>>>>>>>>>>>>>>>>>>>>> decider
>>>>>>>>>>>>>>>>>>>>>>> that
>>>>>>>>>>>>>>>>>>>>>>> does the opposite of whatever the halt decider
>>>>>>>>>>>>>>>>>>>>>>> decides.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> This is how H() and H_Hat() are defined in the Linz
>>>>>>>>>>>>>>>>>>>>>>> proof.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> If the halt decider is to report whether or not it
>>>>>>>>>>>>>>>>>>>>>>> aborted its
>>>>>>>>>>>>>>>>>>>>>>> input
>>>>>>>>>>>>>>>>>>>>>>> program because its input program would otherwise
>>>>>>>>>>>>>>>>>>>>>>> cause
>>>>>>>>>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>>>>>>>>>> halt
>>>>>>>>>>>>>>>>>>>>>>> decider
>>>>>>>>>>>>>>>>>>>>>>> to get stuck in infinite execution then this other
>>>>>>>>>>>>>>>>>>>>>>> program
>>>>>>>>>>>>>>>>>>>>>>> can no
>>>>>>>>>>>>>>>>>>>>>>> longer
>>>>>>>>>>>>>>>>>>>>>>> fool its halt decider and do the opposite of
>>>>>>>>>>>>>>>>>>>>>>> whatever it
>>>>>>>>>>>>>>>>>>>>>>> decides.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> If H() aborts the execution of H_Hat() then H_Hat()
>>>>>>>>>>>>>>>>>>>>>>> cannot
>>>>>>>>>>>>>>>>>>>>>>> continue to
>>>>>>>>>>>>>>>>>>>>>>> execute because H() has complete control over H_Hat.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> The end result of this slight change is that the
>>>>>>>>>>>>>>>>>>>>>>> halting
>>>>>>>>>>>>>>>>>>>>>>> problem
>>>>>>>>>>>>>>>>>>>>>>> can no
>>>>>>>>>>>>>>>>>>>>>>> longer be shown to be undecidable.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> It is suspicious that in none of this have you ever
>>>>>>>>>>>>>>>>>>>>>> stated
>>>>>>>>>>>>>>>>>>>>>> what is
>>>>>>>>>>>>>>>>>>>>>> actually wrong in the Linz proof.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> When the halting problem is defined as:
>>>>>>>>>>>>>>>>>>>>> bool Does_It_Halt(u32 P, u32 I)
>>>>>>>>>>>>>>>>>>>>> another program can be constructed on the basis of
>>>>>>>>>>>>>>>>>>>>> Does_It_Halt()
>>>>>>>>>>>>>>>>>>>>> that
>>>>>>>>>>>>>>>>>>>>> does the opposite of whatever Does_It_Halt() decides.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Yes, regardless of the internal details of
>>>>>>>>>>>>>>>>>>>> Does_It_Halt().
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> When the halting problem is defined as:
>>>>>>>>>>>>>>>>>>>>> bool Was_Its_Execution_Aborted(u32 P, u32 I)
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> another program CANNOT be constructed on the basis of
>>>>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted() that does the opposite of
>>>>>>>>>>>>>>>>>>>>> whatever
>>>>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted() decides.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Sure, if you interpret your question literally as 
>>>>>>>>>>>>>>>>>>>> asking
>>>>>>>>>>>>>>>>>>>> whether P
>>>>>>>>>>>>>>>>>>>> would actually be aborted if it executes under the UTM
>>>>>>>>>>>>>>>>>>>> within
>>>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted()!
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> However, another program CAN be constructed on the
>>>>>>>>>>>>>>>>>>>> basis of
>>>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted() that:
>>>>>>>>>>>>>>>>>>>> -   halts if Was_Its_Execution_Aborted() decides
>>>>>>>>>>>>>>>>>>>> "aborted"
>>>>>>>>>>>>>>>>>>>> -   loops if Was_Its_Execution_Aborted() decides
>>>>>>>>>>>>>>>>>>>> "halted"
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> (right?)
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Wrong.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> No, right.  To avoid a silly pantomine argument, here
>>>>>>>>>>>>>>>>>> is an
>>>>>>>>>>>>>>>>>> example of
>>>>>>>>>>>>>>>>>> such a function:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> int H_Hat(u32 M)
>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>     if (Was_Its_Execution_Aborted(M, M))
>>>>>>>>>>>>>>>>>>     {
>>>>>>>>>>>>>>>>>>       // Was_Its_Execution_Aborted says that M(M) was
>>>>>>>>>>>>>>>>>> aborted
>>>>>>>>>>>>>>>>>>       HALT;       // so we halt
>>>>>>>>>>>>>>>>>>     }
>>>>>>>>>>>>>>>>>>     else
>>>>>>>>>>>>>>>>>>     {
>>>>>>>>>>>>>>>>>>       // Was_Its_Execution_Aborted says that M(M) halted
>>>>>>>>>>>>>>>>>>       HERE: goto HERE;   // so we loop
>>>>>>>>>>>>>>>>>>     }
>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> and for completeness, here is the function being
>>>>>>>>>>>>>>>>>> invoked from
>>>>>>>>>>>>>>>>>> main():
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> int main()
>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>     u32 M = (u32)H_Hat;
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>     H_Hat(M);       // run H_Hat with input H_Hat
>>>>>>>>>>>>>>>>>>     HALT;
>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You see, H_Hat /is/ constructed so that if
>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted(M, M) returns "aborted"
>>>>>>>>>>>>>>>>>> (nonzero),
>>>>>>>>>>>>>>>>>> H_Hat
>>>>>>>>>>>>>>>>>> will halt, and if Was_Its_Execution_Aborted(M, M) returns
>>>>>>>>>>>>>>>>>> "halted"
>>>>>>>>>>>>>>>>>> (zero), H_Hat will loop.  Just like I said.  Thre is no
>>>>>>>>>>>>>>>>>> subtle
>>>>>>>>>>>>>>>>>> philosophical point here, just beginner knowledge of 
>>>>>>>>>>>>>>>>>> the C
>>>>>>>>>>>>>>>>>> programming
>>>>>>>>>>>>>>>>>> language.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> (To save you making a silly response, yes IF we were to
>>>>>>>>>>>>>>>>>> run the
>>>>>>>>>>>>>>>>>> program under a debugger or emulator of some kind, and we
>>>>>>>>>>>>>>>>>> aborted the
>>>>>>>>>>>>>>>>>> run at the "if (Abort)" statement or earlier, then of
>>>>>>>>>>>>>>>>>> course we
>>>>>>>>>>>>>>>>>> would
>>>>>>>>>>>>>>>>>> not get to see what it actually does next.  (Duh.)  
>>>>>>>>>>>>>>>>>> That's
>>>>>>>>>>>>>>>>>> irrelevent
>>>>>>>>>>>>>>>>>> because regardless of this, H_Hat as constructed meets 
>>>>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>>>>> conditions
>>>>>>>>>>>>>>>>>> just as I described.)
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>  > There is no way to make the revised halting question
>>>>>>>>>>>>>>>>>> contradictory.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> DebugTrace() either reports that it has aborted the
>>>>>>>>>>>>>>>>>>> execution
>>>>>>>>>>>>>>>>>>> of its
>>>>>>>>>>>>>>>>>>> input or it reports that its input has not been aborted
>>>>>>>>>>>>>>>>>>> after
>>>>>>>>>>>>>>>>>>> its
>>>>>>>>>>>>>>>>>>> input
>>>>>>>>>>>>>>>>>>> has terminated.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>  > [A quick observation: you've flipped to talking about
>>>>>>>>>>>>>>>>>> DebugTrace()
>>>>>>>>>>>>>>>>>> rather than Was_Its_Execution_Aborted() which we were
>>>>>>>>>>>>>>>>>> discussing.
>>>>>>>>>>>>>>>>>> I'll just take it they're the same thing, and continue
>>>>>>>>>>>>>>>>>> saying
>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted().]
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> OK good. I like that. Make the function say what it really
>>>>>>>>>>>>>>>>> means.
>>>>>>>>>>>>>>>>> That is good software engineering.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> I never said otherwise.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> BUT bear in mind that H (as opposed to
>>>>>>>>>>>>>>>>>> Was_Its_Execution_Aborted())
>>>>>>>>>>>>>>>>>> plays the role in all this of a Linz *Halt Decider*, and
>>>>>>>>>>>>>>>>>> so is
>>>>>>>>>>>>>>>>>> required to deliver its HD decision *HALT* or *NOT_HALT*.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> No, not at all. Not in the least little bit.
>>>>>>>>>>>>>>>>> This takes my solution of removing the pathological
>>>>>>>>>>>>>>>>> self-reference
>>>>>>>>>>>>>>>>> from
>>>>>>>>>>>>>>>>> the halting decision and tosses this solution in the 
>>>>>>>>>>>>>>>>> trash.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Maybe, and that would be the right thing to do if your
>>>>>>>>>>>>>>>> solution is
>>>>>>>>>>>>>>>> wrong.  In any case, if you can't refute the Linz proof
>>>>>>>>>>>>>>>> without
>>>>>>>>>>>>>>>> changing the meaning of "Halt Decider", then your
>>>>>>>>>>>>>>>> solution is
>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> I am refuting that the Linz proof proves that the halting
>>>>>>>>>>>>>>> problem is
>>>>>>>>>>>>>>> undecidable by finding another way to define the halt 
>>>>>>>>>>>>>>> decider
>>>>>>>>>>>>>>> that
>>>>>>>>>>>>>>> cannot be contradicted.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The Linz halt decider corresponds to the correct (HP)
>>>>>>>>>>>>>> definition
>>>>>>>>>>>>>> of a
>>>>>>>>>>>>>> halt decider.  If you change this definition you are not
>>>>>>>>>>>>>> discussing HP.
>>>>>>>>>>>>>
>>>>>>>>>>>>> As long as a halt decider cannot be shown to make this 
>>>>>>>>>>>>> decision
>>>>>>>>>>>>> incorrectly for any of its inputs then the halting problem
>>>>>>>>>>>>> cannot be
>>>>>>>>>>>>> shown to be undecidable:
>>>>>>>>>>>>>
>>>>>>>>>>>>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P,
>>>>>>>>>>>>> u32 I)
>>>>>>>>>>>>
>>>>>>>>>>>> The Linz proof shows HP to be undecidable.  Your refuting code
>>>>>>>>>>>> conforms with the Linz conclusion, and does not refute 
>>>>>>>>>>>> anything.
>>>>>>>>>>>
>>>>>>>>>>> Unless you can concretely show how this function would get the
>>>>>>>>>>> wrong
>>>>>>>>>>> answer all of your rebuttal is ultimately totally vacuous:
>>>>>>>>>>>
>>>>>>>>>>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> In your code, the function answers "non halting behaviour
>>>>>>>>>> detected"
>>>>>>>>>> for input which actually halts, and so by any reasonable
>>>>>>>>>> definition of
>>>>>>>>>> the words, it has decided incorrectly.
>>>>>>>>>
>>>>>>>>> Bullshit. The actual question that it always correctly answers is:
>>>>>>>>> Does the input have to be aborted to prevent infinite execution?
>>>>>>>>
>>>>>>>> I provided the traces which back up what I said, so it's not
>>>>>>>> bullshit.
>>>>>>>> You have snipped them because you don't want to look stupid, so I'm
>>>>>>>> going to restore them:
>>>>>>>>
>>>>>>>> H_Hat machine trace
>>>>>>>> -------------------
>>>>>>>>
>>>>>>>> H_Hat starts (main() calls H_Hat(H_Hat))
>>>>>>>>     H_Hat calls Was_Its_Execution_Aborted(H_Hat,H_Hat)
>>>>>>>>       Was_Its_Execution_Aborted emulates H_Hat(H_Hat)
>>>>>>>>       Was_Its_Execution_Aborted decides the emulated program ..
>>>>>>>>                  .. will never terminate if not aborted
>>>>>>>>       Was_Its_Execution_Aborted stops emulating and returns ABORTED
>>>>>>>>     H_Hat *halts*
>>>>>>>>
>>>>>>>> OK, so the H_Hat calculation halts...
>>>>>>>
>>>>>>> In this case we have an outer instance of H_Hat() an inner
>>>>>>> instance of
>>>>>>> H_Hat(). The outer instance of H_Hat() is executed in the master UTM
>>>>>>> process context of x86utm.
>>>>>>>
>>>>>>> This outer instance of H_Hat() invokes
>>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) which
>>>>>>> creates the inner instance of H_Hat() in its own process context and
>>>>>>> executes it. It then returns true to the outer instance of H_Hat()
>>>>>>> after
>>>>>>> aborting the inner instance.
>>>>>>
>>>>>> ..*and then terminates*
>>>>>>
>>>>>> The calculation H_Hat(H_Hat) halts.  So if
>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) says 
>>>>>> there
>>>>>> was "non-halting behaviour" it was wrong.
>>>>>>
>>>>>> No point in saying this over and over....
>>>>>>
>>>>>>
>>>>>>>
>>>>>>>> H machine trace
>>>>>>>>
>>>>>>>> ---------------
>>>>>>>> H starts (main() calls H(H_Hat,H_Hat))
>>>>>>>>     H calls Was_Its_Execution_Aborted(H_Hat,H_Hat)
>>>>>>>>       Was_Its_Execution_Aborted emulates H_Hat(H_Hat)
>>>>>>>>       Was_Its_Execution_Aborted decides the emulated program ..
>>>>>>>>                  .. will never terminate if not aborted
>>>>>>>>       Was_Its_Execution_Aborted stops emulating and returns ABORTED
>>>>>>>>     H halts, with EAX=0 [= *NOT_HALT* decision]
>>>>>>>>
>>>>>>>
>>>>>>> In this case we have an instance of H() and an instance of
>>>>>>> H_Hat(). The
>>>>>>>  instance of H() is executed in the master UTM process context of
>>>>>>> x86utm.
>>>>>>>
>>>>>>> H() invokes Aborted_Because_Non_Halting_Behavior_Detected(H_Hat,
>>>>>>> H_Hat)
>>>>>>> which creates the instance of H_Hat() and executes it. It then
>>>>>>> returns
>>>>>>> true to H() after aborting the instance of _H_Hat().
>>>>>>
>>>>>> Again, returning true to H is supposed to say it detected non-halting
>>>>>> behaviour, but the calculation it is examining actually halts.
>>>>>>
>>>>>> There, I said it again! :)  (last time, really...)
>>>>> Apparently this whole inner invocation of H_Hat() and outer invocation
>>>>> of H_Hat() is against your religion.
>>>>
>>>> Why do you say that?  I understand perfectly about outer and inner
>>>> invocations of H_Hat().  I understand it better than you, because I
>>>> lack your confusions on what's going on.
>>>>
>>>> Incidentally, I believe I've realised where you are going wrong in
>>>> your thinking!  (If I'm right, it will come out in your answer to the
>>>> question below...)
>>>>
>>>>> None-the-less an actual execution
>>>>> trace would show that the outer invocation does abort the inner
>>>>> invocation thus allowing the outer invocation to terminate normally.
>>>>
>>>> That's fine.
>>>>
>>>> If the outer invocation aborts the inner invocation, that implies
>>>> that the H_Hat(H_Hat) calculation halts.
>>>
>>
>> CORRECTION
>>> None of the invocations of H_Hat() would ever halt unless they are
>>> aborted.
>>
>> In both cases the input H_Hat would not halt unless it has been aborted:
>> H_Hat(H_Hat)
>> H(H_Hat, H_Hat)
>>
> 
> Talking about what /would/ happen if xxxxx is confusing the discussion, 
> I think.

That is the problem with posting my results a little bit prematurely.
If I simply provided the execution trace of exactly what each one of the 
virtual machines actually does in each one of their process contexts 
then it would not be possible to simply disagree that these are the 
actual execution traces.

Since each process context has its own unique memory address and I have 
updated the x86utm operating system to have some Output() functions I 
will be able to provide this execution trace fairly soon.

> By now you must know for your ACTUAL FINAL coded H and H_Hat:  Does the 
> calculation H_Hat(H_Hat) halt?

The key thing to realize is that this function cannot be shown to ever 
provide an incorrect return value:
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);

All of the other things are simply dodges.
In your case not a dishonest dodge.

> I'm not talking about what its internal 
> Aborted_Because_Non_Halting_Behavior_Detected(M, N) routine does, or 
> what happens in any internal emulations of anything.

The key thing to realize is that this function cannot be shown to ever 
provide an incorrect return value:
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);

This requires knowing in a very complex recursive invocation sequence 
exactly which instance of that function is returning a value and exactly 
which instance of H_Hat is its actual input.

It turns out that the outermost invocation of
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
bases its decision on its first parmeter.

>>> That is why this is the correct halt decider question:
>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, N)
> 
> It is only the correct halt decider question if it actually relates to 
> the halting of calculation (M,N).  Otherwise it is not a halt decider, 
> it's a "Internal routine aborted something" decider.

This function cannot be shown to ever return an incorrect value:
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);


> Mike.
> 
>>>
>>> When the return value of true is provided for the (M, N) input this
>>> return value is correct. Every other return value from
>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, N)
>>> does not occur because every other
>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, N)
>>> has had its execution terminated before it ever returns any value.
>>>
>>> Therefore we can conclude that
>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, N)
>>> Is a halt decider function that cannot be shown to be incorrect.
>>>
>>>> [When I say a calculation halts, I mean that there is a number n such
>>>> that after n steps the calculation reaches a halt state.  It is
>>>> nothing to do with anything being emulated, or run on some physical
>>>> computer.]
>>>>
>>>> Do you agree with this?
>>>>
>>>> Mike.
>>>
>>>
>>> No. I pointed out the false assumptions.
>>> The one time that
>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, N)
>>> returns its decision value this decision value is correct.
>>> There are no other times that it reteuns its decsion value.
>>>
>>>
>>
>>


-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24508 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromMike Terry <news.dead.person.stones@darjeeling.plus.com>
Date2020-10-27 02:48 +0000
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<_KSdnUEr7oL6FwrCnZ2dnUU78SfNnZ2d@brightview.co.uk>
In reply to#24504
On 27/10/2020 01:11, olcott wrote:
> On 10/26/2020 7:06 PM, Mike Terry wrote:
>> On 26/10/2020 18:14, olcott wrote:
>>> On 10/26/2020 1:03 PM, olcott wrote:
[... snip ...]
>>>>
>>>
>>> CORRECTION
>>>> None of the invocations of H_Hat() would ever halt unless they are
>>>> aborted.
>>>
>>> In both cases the input H_Hat would not halt unless it has been aborted:
>>> H_Hat(H_Hat)
>>> H(H_Hat, H_Hat)
>>>
>>
>> Talking about what /would/ happen if xxxxx is confusing the
>> discussion, I think.
>
> That is the problem with posting my results a little bit prematurely.
> If I simply provided the execution trace of exactly what each one of the
> virtual machines actually does in each one of their process contexts
> then it would not be possible to simply disagree that these are the
> actual execution traces.

Nobody has simply disagreed with any execution traces, because you have 
not provided any, and more to the point you have refused to answer 
questions about your code like whether H_Hat(H_Hat) halts.  So this is 
not an issue.

>
> Since each process context has its own unique memory address and I have
> updated the x86utm operating system to have some Output() functions I
> will be able to provide this execution trace fairly soon.
>
>> By now you must know for your ACTUAL FINAL coded H and H_Hat:  Does
>> the calculation H_Hat(H_Hat) halt?

[... snip non-reply ...]
So, for your ACTUAL FINAL coded H and H_Hat:  Does the calculation 
H_Hat(H_Hat) halt?

>
> The key thing to realize is that this function cannot be shown to ever
> provide an incorrect return value:
> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);

Since you have refused to provide any spec for 
Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I), or to 
define what "return an incorrect value" means, no wonder!  It is a 
meaningless claim until you clarify exactly what it means.

ok, in one response you did say "yes" when I asked if it meant "return a 
value that disagrees with its spec", but you've never given a spec!  And 
I don't believe that's actually what you mean anyway, but that's all 
you've revealed.

And without that spec, the relationship of that function to the Linz 
halting proof is unknown.  The HP proof requires answering the halting 
question, not some new undefined question you've come up with!

The REAL key thing is whether your H, H^ are correctly related (as in 
the Linz proof), and whether H correctly decides the halting for H^ 
running with input H^.  THAT is what you've always said you were going 
to deliver.

Are you admitting that your H, H^ won't do that after all?

Mike

[toc] | [prev] | [next] | [standalone]


#24510 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-26 22:38 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<cYSdnQ9W-cO9CwrCnZ2dnUU7-Y3NnZ2d@giganews.com>
In reply to#24508
On 10/26/2020 9:48 PM, Mike Terry wrote:
> On 27/10/2020 01:11, olcott wrote:
>> On 10/26/2020 7:06 PM, Mike Terry wrote:
>>> On 26/10/2020 18:14, olcott wrote:
>>>> On 10/26/2020 1:03 PM, olcott wrote:
> [... snip ...]
>>>>>
>>>>
>>>> CORRECTION
>>>>> None of the invocations of H_Hat() would ever halt unless they are
>>>>> aborted.
>>>>
>>>> In both cases the input H_Hat would not halt unless it has been 
>>>> aborted:
>>>> H_Hat(H_Hat)
>>>> H(H_Hat, H_Hat)
>>>>
>>>
>>> Talking about what /would/ happen if xxxxx is confusing the
>>> discussion, I think.
>>
>> That is the problem with posting my results a little bit prematurely.
>> If I simply provided the execution trace of exactly what each one of the
>> virtual machines actually does in each one of their process contexts
>> then it would not be possible to simply disagree that these are the
>> actual execution traces.
> 
> Nobody has simply disagreed with any execution traces, because you have 
> not provided any, 

I have provided complete description of all of the key elements of the 
execution trace such that it can be understood

bool Aborted_Because_Non_Halting_Behavior_Detected(H_hat, H_Hat)
does return the correct value. It is a fact that I did totally prove 
this point as long as the actual execution is as I have described.

It is also reasonably likely that this detailed description may been too 
difficult to understand.

> and more to the point you have refused to answer 
> questions about your code like whether H_Hat(H_Hat) halts.  So this is 
> not an issue.

bool Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat)
does provide the correct return value. It cannot be shown that it ever 
does not provide the correct return value.

>> Since each process context has its own unique memory address and I have
>> updated the x86utm operating system to have some Output() functions I
>> will be able to provide this execution trace fairly soon.
>>
>>> By now you must know for your ACTUAL FINAL coded H and H_Hat:  Does
>>> the calculation H_Hat(H_Hat) halt?
> 
> [... snip non-reply ...]
> So, for your ACTUAL FINAL coded H and H_Hat:  Does the calculation 
> H_Hat(H_Hat) halt?
> 
>>
>> The key thing to realize is that this function cannot be shown to ever
>> provide an incorrect return value:
>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
> 
> Since you have refused to provide any spec for 
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I), or to 

I provided the complete description of the execution trace that proves
that it decides (H_Hat, H_Hat) correctly. That this answer was too 
difficult for you to understand is no evidence what-so-ever that I not 
provide a complete answer.

I acknowledge that if you don't understand an answer that you would have 
no direct evidence that it is an answer. That is easily fixed. I just 
have to finish writing the code that fully implements this answer.

> define what "return an incorrect value" means, no wonder!  It is a 
> meaningless claim until you clarify exactly what it means.

This statement is seeming to be quite disingenuous at this point.
Which line of H decides H(H_Hat, H_Hat) correctly: {04, 06} ?

Any answer not from this set: {04, 06} indicates that you are trying to 
dodge the idea of "return an incorrect value" and you always knew all 
along exactly what I meant.

void H_Hat(u32 M)
{
   if (!Halts(M, M))
     MOV_EAX_0  // Does not Halt
   else
   {
     MOV_EAX_1  // Halts
     HERE: goto HERE;
   }
   HALT
}


01 void H(u32 M, u32 N)
02 {
03  if (!Halts(M, M))
04    MOV_EAX_0  // Does not Halt
05  else
06    MOV_EAX_1  // Halts
07  HALT
08 }

int main()
{
   u32 M = (u32)H_Hat;
   H(M, M);
   HALT
}

> ok, in one response you did say "yes" when I asked if it meant "return a 
> value that disagrees with its spec", but you've never given a spec!  And 
> I don't believe that's actually what you mean anyway, but that's all 
> you've revealed.

I have given the complete spec as a detailed description of the 
execution trace of how Aborted_Because_Non_Halting_Behavior_Detected()
decides (H_Hat, H_Hat) very many times now.

It is either that it is too difficult for you to understand or you don't 
believe that my description is accurate. If it is not too difficult for 
you to understand then you could evaluate it hypothetically while I 
write the actual code. If it is too difficult for you to understand ten 
I will shortly have the code.

> And without that spec, the relationship of that function to the Linz 
> halting proof is unknown.  The HP proof requires answering the halting 
> question, not some new undefined question you've come up with!
> 
> The REAL key thing is whether your H, H^ are correctly related (as in 
> the Linz proof), and whether H correctly decides the halting for H^ 
> running with input H^.  THAT is what you've always said you were going 
> to deliver.

I have done that a bunch of times now. It is OK if what I said is too 
complex to understand. I will write the actual code and then make its 
execution trace only show the key decision points.

> Are you admitting that your H, H^ won't do that after all?
> 
> Mike
> 


-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24326 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-24 13:36 -0400
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<7CZkH.162640$NB.122335@fx20.iad>
In reply to#24315
On 10/24/20 11:36 AM, olcott wrote:
> 
> I am refuting that the Linz proof proves that the halting problem is
> undecidable by finding another way to define the halt decider that
> cannot be contradicted.

That is like refute the fact that there is no highest prime number by
redefining prime numbers (or maybe redefining the Natural Numbers that
primes are part of).

Just because you are CALLING something a solution to the halting
problem, if it isn't what is accepted as the real halting problem, it
doesn't talk about the real problem people are concerned about.

[toc] | [prev] | [next] | [standalone]


#24337 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-24 14:13 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<hN-dnaGefsIg4QnCnZ2dnUU7-N_NnZ2d@giganews.com>
In reply to#24326
On 10/24/2020 12:36 PM, Richard Damon wrote:
> On 10/24/20 11:36 AM, olcott wrote:
>>
>> I am refuting that the Linz proof proves that the halting problem is
>> undecidable by finding another way to define the halt decider that
>> cannot be contradicted.
> 
> That is like refute the fact that there is no highest prime number by
> redefining prime numbers (or maybe redefining the Natural Numbers that
> primes are part of).

Not at all.

Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
means that the input has infinite execution.

Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
means that the input DOES NOT HAVE infinite execution.

and there are no programs left over that can be shown to be undecidable.

-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24343 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-24 16:55 -0400
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<cx0lH.410481$0W4.202239@fx42.iad>
In reply to#24337
On 10/24/20 3:13 PM, olcott wrote:
> On 10/24/2020 12:36 PM, Richard Damon wrote:
>> On 10/24/20 11:36 AM, olcott wrote:
>>>
>>> I am refuting that the Linz proof proves that the halting problem is
>>> undecidable by finding another way to define the halt decider that
>>> cannot be contradicted.
>>
>> That is like refute the fact that there is no highest prime number by
>> redefining prime numbers (or maybe redefining the Natural Numbers that
>> primes are part of).
> 
> Not at all.
> 
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
> means that the input has infinite execution.
> 
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
> means that the input DOES NOT HAVE infinite execution.
> 
> and there are no programs left over that can be shown to be undecidable.
> 

I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
execution.

I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus
H_Hat does NOT have infinite execution, contrary to what H said.

THUS, H does not met the requirements of the Halting Problem.

The Halting Problem, the one which mathematics wants, and how it defines
it, is to have a determiner, that will tell you in finite time,
accurately, whether a specified machine with specified input will
ultimately halt or never halt.

All you have shown, is that your particular method of trying to
implement the machine H, is incapable of doing the job. Linz did you one
better, he showed that NO machine can do the job.

The question asked was, will the program stop.

Your answer was, I don't know, I got overloaded thinking about it.

Note, that your method is actually doomed to fail on most interesting
machines, because it is fundamentally finite, and from everything I have
heard, you seem to be anticipating that you will detect looping by
getting into repeated state. While it is true, that the loop in H_Hat is
detectable by this, many of the interesting machines don't hit this sort
of state, but the machine data just keeps growing infinitely large until
it either finds the answer it is looking for, or never stops if there is
no possible answer.

[toc] | [prev] | [next] | [standalone]


#24347 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2020-10-24 14:06 -0700
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<0cfdb846-7903-44df-8059-917ac28fcbc5n@googlegroups.com>
In reply to#24343
On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
> On 10/24/20 3:13 PM, olcott wrote: 
> > On 10/24/2020 12:36 PM, Richard Damon wrote: 
> >> On 10/24/20 11:36 AM, olcott wrote: 
> >>> 
> >>> I am refuting that the Linz proof proves that the halting problem is 
> >>> undecidable by finding another way to define the halt decider that 
> >>> cannot be contradicted. 
> >> 
> >> That is like refute the fact that there is no highest prime number by 
> >> redefining prime numbers (or maybe redefining the Natural Numbers that 
> >> primes are part of). 
> > 
> > Not at all. 
> > 
> > Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true 
> > means that the input has infinite execution. 
> > 
> > Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false 
> > means that the input DOES NOT HAVE infinite execution. 
> > 
> > and there are no programs left over that can be shown to be undecidable. 
> >
> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite 
> execution. 
> 
> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus 
> H_Hat does NOT have infinite execution, contrary to what H said. 
> 
> THUS, H does not met the requirements of the Halting Problem. 
> 
> The Halting Problem, the one which mathematics wants, and how it defines 
> it, is to have a determiner, that will tell you in finite time, 
> accurately, whether a specified machine with specified input will 
> ultimately halt or never halt. 
> 
> All you have shown, is that your particular method of trying to 
> implement the machine H, is incapable of doing the job. Linz did you one 
> better, he showed that NO machine can do the job. 
> 
> The question asked was, will the program stop. 
> 
> Your answer was, I don't know, I got overloaded thinking about it. 
> 
> Note, that your method is actually doomed to fail on most interesting 
> machines, because it is fundamentally finite, and from everything I have 
> heard, you seem to be anticipating that you will detect looping by 
> getting into repeated state. While it is true, that the loop in H_Hat is 
> detectable by this, many of the interesting machines don't hit this sort 
> of state, but the machine data just keeps growing infinitely large until 
> it either finds the answer it is looking for, or never stops if there is 
> no possible answer.
>
The scope of this was to show that the Linz proof is unsound, not to
construct an actual halt decider. It's logically possible for one proof 
that halt deciders can't be written to be unsound, whilst another one
is sound.
However in fact the proof is sound. The weakness is that it requires that
H be a Turing machine. It's not a proof that no halt decider is possible,
just that the halt decider is not a Turing machine.

[toc] | [prev] | [next] | [standalone]


#24349 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-24 16:31 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<haadnWzXes27AAnCnZ2dnUU7-SvNnZ2d@giganews.com>
In reply to#24347
On 10/24/2020 4:06 PM, Malcolm McLean wrote:
> On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
>> On 10/24/20 3:13 PM, olcott wrote:
>>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>>
>>>>> I am refuting that the Linz proof proves that the halting problem is
>>>>> undecidable by finding another way to define the halt decider that
>>>>> cannot be contradicted.
>>>>
>>>> That is like refute the fact that there is no highest prime number by
>>>> redefining prime numbers (or maybe redefining the Natural Numbers that
>>>> primes are part of).
>>>
>>> Not at all.
>>>
>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>> means that the input has infinite execution.
>>>
>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>> means that the input DOES NOT HAVE infinite execution.
>>>
>>> and there are no programs left over that can be shown to be undecidable.
>>>
>> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
>> execution.
>>
>> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus
>> H_Hat does NOT have infinite execution, contrary to what H said.
>>
>> THUS, H does not met the requirements of the Halting Problem.
>>
>> The Halting Problem, the one which mathematics wants, and how it defines
>> it, is to have a determiner, that will tell you in finite time,
>> accurately, whether a specified machine with specified input will
>> ultimately halt or never halt.
>>
>> All you have shown, is that your particular method of trying to
>> implement the machine H, is incapable of doing the job. Linz did you one
>> better, he showed that NO machine can do the job.
>>
>> The question asked was, will the program stop.
>>
>> Your answer was, I don't know, I got overloaded thinking about it.
>>
>> Note, that your method is actually doomed to fail on most interesting
>> machines, because it is fundamentally finite, and from everything I have
>> heard, you seem to be anticipating that you will detect looping by
>> getting into repeated state. While it is true, that the loop in H_Hat is
>> detectable by this, many of the interesting machines don't hit this sort
>> of state, but the machine data just keeps growing infinitely large until
>> it either finds the answer it is looking for, or never stops if there is
>> no possible answer.
>>
> The scope of this was to show that the Linz proof is unsound, not to
> construct an actual halt decider. It's logically possible for one proof
> that halt deciders can't be written to be unsound, whilst another one
> is sound.
> However in fact the proof is sound. The weakness is that it requires that
> H be a Turing machine. It's not a proof that no halt decider is possible,
> just that the halt decider is not a Turing machine.
> 

Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
means that the input has infinite execution.

Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
means that the input DOES NOT HAVE infinite execution.

All Input is divided into exactly one of these two sets:
(a) The input Program/TM has infinite execution.
(b) The input Program/TM DOES NOT HAVE infinite execution.

There is no reason why a UTM halt decider could not be implemented so 
that it examines every state transition of its input UTM in the exact 
same way as described above.


-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24361 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-24 18:17 -0400
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<rK1lH.126049$cc1.112047@fx29.iad>
In reply to#24349
On 10/24/20 5:31 PM, olcott wrote:
> On 10/24/2020 4:06 PM, Malcolm McLean wrote:
>> On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
>>> On 10/24/20 3:13 PM, olcott wrote:
>>>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>>>
>>>>>> I am refuting that the Linz proof proves that the halting problem is
>>>>>> undecidable by finding another way to define the halt decider that
>>>>>> cannot be contradicted.
>>>>>
>>>>> That is like refute the fact that there is no highest prime number by
>>>>> redefining prime numbers (or maybe redefining the Natural Numbers that
>>>>> primes are part of).
>>>>
>>>> Not at all.
>>>>
>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>> means that the input has infinite execution.
>>>>
>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>>> means that the input DOES NOT HAVE infinite execution.
>>>>
>>>> and there are no programs left over that can be shown to be
>>>> undecidable.
>>>>
>>> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
>>> execution.
>>>
>>> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus
>>> H_Hat does NOT have infinite execution, contrary to what H said.
>>>
>>> THUS, H does not met the requirements of the Halting Problem.
>>>
>>> The Halting Problem, the one which mathematics wants, and how it defines
>>> it, is to have a determiner, that will tell you in finite time,
>>> accurately, whether a specified machine with specified input will
>>> ultimately halt or never halt.
>>>
>>> All you have shown, is that your particular method of trying to
>>> implement the machine H, is incapable of doing the job. Linz did you one
>>> better, he showed that NO machine can do the job.
>>>
>>> The question asked was, will the program stop.
>>>
>>> Your answer was, I don't know, I got overloaded thinking about it.
>>>
>>> Note, that your method is actually doomed to fail on most interesting
>>> machines, because it is fundamentally finite, and from everything I have
>>> heard, you seem to be anticipating that you will detect looping by
>>> getting into repeated state. While it is true, that the loop in H_Hat is
>>> detectable by this, many of the interesting machines don't hit this sort
>>> of state, but the machine data just keeps growing infinitely large until
>>> it either finds the answer it is looking for, or never stops if there is
>>> no possible answer.
>>>
>> The scope of this was to show that the Linz proof is unsound, not to
>> construct an actual halt decider. It's logically possible for one proof
>> that halt deciders can't be written to be unsound, whilst another one
>> is sound.
>> However in fact the proof is sound. The weakness is that it requires that
>> H be a Turing machine. It's not a proof that no halt decider is possible,
>> just that the halt decider is not a Turing machine.
>>
> 
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
> means that the input has infinite execution.
> 
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
> means that the input DOES NOT HAVE infinite execution.
> 
> All Input is divided into exactly one of these two sets:
> (a) The input Program/TM has infinite execution.
> (b) The input Program/TM DOES NOT HAVE infinite execution.
> 
> There is no reason why a UTM halt decider could not be implemented so
> that it examines every state transition of its input UTM in the exact
> same way as described above.
> 
> 

Lets look at this statement.

We have two programs in view, H(H_Hat, H_Hat) which calls
Aborted_Because_Non_Halting_Behavior_Detected and H_Hat(H_Hat) which
will also call Aborted_Because_Non_Halting_Behavior_Detected, and in
both case the call is given exactly the same input, so it will, by
necessity, generate exactly the same output.

The first possibility, which is how it seems you are saying it will go,
the function will detect infinite recursion in the input program, and
thus return true. When we run H this way, H being the required halt
detector, based on the value it got, will declare H_Hat(H_Hat) to be a
non-Halting program.

Now, we run H_Hat(H_Hat), and it will also get the same true answer, and
it will then immediately Halt. Thus it is clear that H gave the wrong
answer, as when we ran H, it said that it wouldn't. The fact that H_Hat
stopped on its own, its irrefutable. Note, H by its definition and your
construction does NOT have infinite execution, and H_Hat, at least if H
returned non-Halting, adds a very small finite amount of execution to
it, so it is also finite in execution.

If there IS a problem of infinite execution, then that problem is in H,
which is what YOU provided, so if there is a problem, it is yours.

The alternative case, would be if
Aborted_Because_Non_Halting_Behavior_Detected returns false, then H will
say that H_Hat does terminate, but when you run H_Hat is will never
halt, so again you get the wrong answer.

Also, based on what I think you are describing, I suspect that if you
run H(H) it will also declare it as having infinite execution, even
though H will always (by its definition) halt in finite time.

[toc] | [prev] | [next] | [standalone]


#24367 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-24 18:00 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<vJidnTyM9IxiLAnCnZ2dnUU7-YXNnZ2d@giganews.com>
In reply to#24361
On 10/24/2020 5:17 PM, Richard Damon wrote:
> On 10/24/20 5:31 PM, olcott wrote:
>> On 10/24/2020 4:06 PM, Malcolm McLean wrote:
>>> On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
>>>> On 10/24/20 3:13 PM, olcott wrote:
>>>>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>>>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>>>>
>>>>>>> I am refuting that the Linz proof proves that the halting problem is
>>>>>>> undecidable by finding another way to define the halt decider that
>>>>>>> cannot be contradicted.
>>>>>>
>>>>>> That is like refute the fact that there is no highest prime number by
>>>>>> redefining prime numbers (or maybe redefining the Natural Numbers that
>>>>>> primes are part of).
>>>>>
>>>>> Not at all.
>>>>>
>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>>> means that the input has infinite execution.
>>>>>
>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>>>> means that the input DOES NOT HAVE infinite execution.
>>>>>
>>>>> and there are no programs left over that can be shown to be
>>>>> undecidable.
>>>>>
>>>> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
>>>> execution.
>>>>
>>>> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus
>>>> H_Hat does NOT have infinite execution, contrary to what H said.
>>>>
>>>> THUS, H does not met the requirements of the Halting Problem.
>>>>
>>>> The Halting Problem, the one which mathematics wants, and how it defines
>>>> it, is to have a determiner, that will tell you in finite time,
>>>> accurately, whether a specified machine with specified input will
>>>> ultimately halt or never halt.
>>>>
>>>> All you have shown, is that your particular method of trying to
>>>> implement the machine H, is incapable of doing the job. Linz did you one
>>>> better, he showed that NO machine can do the job.
>>>>
>>>> The question asked was, will the program stop.
>>>>
>>>> Your answer was, I don't know, I got overloaded thinking about it.
>>>>
>>>> Note, that your method is actually doomed to fail on most interesting
>>>> machines, because it is fundamentally finite, and from everything I have
>>>> heard, you seem to be anticipating that you will detect looping by
>>>> getting into repeated state. While it is true, that the loop in H_Hat is
>>>> detectable by this, many of the interesting machines don't hit this sort
>>>> of state, but the machine data just keeps growing infinitely large until
>>>> it either finds the answer it is looking for, or never stops if there is
>>>> no possible answer.
>>>>
>>> The scope of this was to show that the Linz proof is unsound, not to
>>> construct an actual halt decider. It's logically possible for one proof
>>> that halt deciders can't be written to be unsound, whilst another one
>>> is sound.
>>> However in fact the proof is sound. The weakness is that it requires that
>>> H be a Turing machine. It's not a proof that no halt decider is possible,
>>> just that the halt decider is not a Turing machine.
>>>
>>
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>> means that the input has infinite execution.
>>
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>> means that the input DOES NOT HAVE infinite execution.
>>
>> All Input is divided into exactly one of these two sets:
>> (a) The input Program/TM has infinite execution.
>> (b) The input Program/TM DOES NOT HAVE infinite execution.
>>
>> There is no reason why a UTM halt decider could not be implemented so
>> that it examines every state transition of its input UTM in the exact
>> same way as described above.
>>
>>
> 
> Lets look at this statement.
> 
> We have two programs in view, H(H_Hat, H_Hat) which calls
> Aborted_Because_Non_Halting_Behavior_Detected and H_Hat(H_Hat) which
> will also call Aborted_Because_Non_Halting_Behavior_Detected, and in
> both case the call is given exactly the same input, so it will, by
> necessity, generate exactly the same output.
> 
> The first possibility, which is how it seems you are saying it will go,
> the function will detect infinite recursion in the input program, and
> thus return true. When we run H this way, H being the required halt
> detector, based on the value it got, will declare H_Hat(H_Hat) to be a
> non-Halting program.
> 
> Now, we run H_Hat(H_Hat), and it will also get the same true answer, and
> it will then immediately Halt. Thus it is clear that H gave the wrong
> answer, 

No the outer H_Hat() is an entirely different process and has much more 
data than the inner H_Hat(). Because the same code has entirely 
different data one instance can have a completely different execution 
trace than the other.

> as when we ran H, it said that it wouldn't. The fact that H_Hat
> stopped on its own, its irrefutable. Note, H by its definition and your
> construction does NOT have infinite execution, and H_Hat, at least if H
> returned non-Halting, adds a very small finite amount of execution to
> it, so it is also finite in execution.

Different instances of H_Hat() having entirely different data must be 
against your religion, none-the-less fully operational code will totally 
prove my point.

> If there IS a problem of infinite execution, then that problem is in H,
> which is what YOU provided, so if there is a problem, it is yours.

No H() and H_Hat() are merely the conventional functions used in every 
standard halting problem proof.

> The alternative case, would be if
> Aborted_Because_Non_Halting_Behavior_Detected returns false, then H will
> say that H_Hat does terminate, but when you run H_Hat is will never
> halt, so again you get the wrong answer.

Yes you can break my solution to make it not work. That is not any sort 
of actual rebuttal what-so-ever.

> Also, based on what I think you are describing, I suspect that if you
> run H(H) it will also declare it as having infinite execution, even
> though H will always (by its definition) halt in finite time.



-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24369 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-24 19:48 -0400
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<W23lH.28770$ri1.12583@fx26.iad>
In reply to#24367
On 10/24/20 7:00 PM, olcott wrote:
> On 10/24/2020 5:17 PM, Richard Damon wrote:
>> On 10/24/20 5:31 PM, olcott wrote:
>>> On 10/24/2020 4:06 PM, Malcolm McLean wrote:
>>>> On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
>>>>> On 10/24/20 3:13 PM, olcott wrote:
>>>>>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>>>>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>>>>>
>>>>>>>> I am refuting that the Linz proof proves that the halting
>>>>>>>> problem is
>>>>>>>> undecidable by finding another way to define the halt decider that
>>>>>>>> cannot be contradicted.
>>>>>>>
>>>>>>> That is like refute the fact that there is no highest prime
>>>>>>> number by
>>>>>>> redefining prime numbers (or maybe redefining the Natural Numbers
>>>>>>> that
>>>>>>> primes are part of).
>>>>>>
>>>>>> Not at all.
>>>>>>
>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>>>> means that the input has infinite execution.
>>>>>>
>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>>>>> means that the input DOES NOT HAVE infinite execution.
>>>>>>
>>>>>> and there are no programs left over that can be shown to be
>>>>>> undecidable.
>>>>>>
>>>>> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
>>>>> execution.
>>>>>
>>>>> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and
>>>>> thus
>>>>> H_Hat does NOT have infinite execution, contrary to what H said.
>>>>>
>>>>> THUS, H does not met the requirements of the Halting Problem.
>>>>>
>>>>> The Halting Problem, the one which mathematics wants, and how it
>>>>> defines
>>>>> it, is to have a determiner, that will tell you in finite time,
>>>>> accurately, whether a specified machine with specified input will
>>>>> ultimately halt or never halt.
>>>>>
>>>>> All you have shown, is that your particular method of trying to
>>>>> implement the machine H, is incapable of doing the job. Linz did
>>>>> you one
>>>>> better, he showed that NO machine can do the job.
>>>>>
>>>>> The question asked was, will the program stop.
>>>>>
>>>>> Your answer was, I don't know, I got overloaded thinking about it.
>>>>>
>>>>> Note, that your method is actually doomed to fail on most interesting
>>>>> machines, because it is fundamentally finite, and from everything I
>>>>> have
>>>>> heard, you seem to be anticipating that you will detect looping by
>>>>> getting into repeated state. While it is true, that the loop in
>>>>> H_Hat is
>>>>> detectable by this, many of the interesting machines don't hit this
>>>>> sort
>>>>> of state, but the machine data just keeps growing infinitely large
>>>>> until
>>>>> it either finds the answer it is looking for, or never stops if
>>>>> there is
>>>>> no possible answer.
>>>>>
>>>> The scope of this was to show that the Linz proof is unsound, not to
>>>> construct an actual halt decider. It's logically possible for one proof
>>>> that halt deciders can't be written to be unsound, whilst another one
>>>> is sound.
>>>> However in fact the proof is sound. The weakness is that it requires
>>>> that
>>>> H be a Turing machine. It's not a proof that no halt decider is
>>>> possible,
>>>> just that the halt decider is not a Turing machine.
>>>>
>>>
>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>> means that the input has infinite execution.
>>>
>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>> means that the input DOES NOT HAVE infinite execution.
>>>
>>> All Input is divided into exactly one of these two sets:
>>> (a) The input Program/TM has infinite execution.
>>> (b) The input Program/TM DOES NOT HAVE infinite execution.
>>>
>>> There is no reason why a UTM halt decider could not be implemented so
>>> that it examines every state transition of its input UTM in the exact
>>> same way as described above.
>>>
>>>
>>
>> Lets look at this statement.
>>
>> We have two programs in view, H(H_Hat, H_Hat) which calls
>> Aborted_Because_Non_Halting_Behavior_Detected and H_Hat(H_Hat) which
>> will also call Aborted_Because_Non_Halting_Behavior_Detected, and in
>> both case the call is given exactly the same input, so it will, by
>> necessity, generate exactly the same output.
>>
>> The first possibility, which is how it seems you are saying it will go,
>> the function will detect infinite recursion in the input program, and
>> thus return true. When we run H this way, H being the required halt
>> detector, based on the value it got, will declare H_Hat(H_Hat) to be a
>> non-Halting program.
>>
>> Now, we run H_Hat(H_Hat), and it will also get the same true answer, and
>> it will then immediately Halt. Thus it is clear that H gave the wrong
>> answer, 
> 
> No the outer H_Hat() is an entirely different process and has much more
> data than the inner H_Hat(). Because the same code has entirely
> different data one instance can have a completely different execution
> trace than the other.

Both the outer H and outer H_Hat invoke the function in identical
manners, if they don't you have translated them right. Thus they invoke
the detection function the same way.

The inner H_Hat is supposed to be a faithful representation of the outer
H_Hat, if not, you haven't encoded it properly.

Both are calculating the value of H_Hat(H_Hat), one as the actual
program and one as your emulated program. Yes, because you are emulating
the inner H_Hat, your emulator can do what it wants to that inner one,
but the whole purpose of this to let H decide what the running of H_Hat
is going to do. Making the emulated one act differently just isn't going
to help you figure out what the real machine is going to do.


> 
>> as when we ran H, it said that it wouldn't. The fact that H_Hat
>> stopped on its own, its irrefutable. Note, H by its definition and your
>> construction does NOT have infinite execution, and H_Hat, at least if H
>> returned non-Halting, adds a very small finite amount of execution to
>> it, so it is also finite in execution.
> 
> Different instances of H_Hat() having entirely different data must be
> against your religion, none-the-less fully operational code will totally
> prove my point.

There is nothing wrong with running H_Hat with some other data, but it
is meaningless to the Linz proof. Linz everywhere is using H_Hat(H_Hat)
and H(H_Hat, H_Hat).

> 
>> If there IS a problem of infinite execution, then that problem is in H,
>> which is what YOU provided, so if there is a problem, it is yours.
> 
> No H() and H_Hat() are merely the conventional functions used in every
> standard halting problem proof.
> 
>> The alternative case, would be if
>> Aborted_Because_Non_Halting_Behavior_Detected returns false, then H will
>> say that H_Hat does terminate, but when you run H_Hat is will never
>> halt, so again you get the wrong answer.
> 
> Yes you can break my solution to make it not work. That is not any sort
> of actual rebuttal what-so-ever.
> 
>> Also, based on what I think you are describing, I suspect that if you
>> run H(H) it will also declare it as having infinite execution, even
>> though H will always (by its definition) halt in finite time.
> 
> 
> 

[toc] | [prev] | [next] | [standalone]


#24370 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-24 19:29 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<ldSdncS-ho1xWwnCnZ2dnUU7-fvNnZ2d@giganews.com>
In reply to#24369
On 10/24/2020 6:48 PM, Richard Damon wrote:
> On 10/24/20 7:00 PM, olcott wrote:
>> On 10/24/2020 5:17 PM, Richard Damon wrote:
>>> On 10/24/20 5:31 PM, olcott wrote:
>>>> On 10/24/2020 4:06 PM, Malcolm McLean wrote:
>>>>> On Saturday, 24 October 2020 at 21:55:39 UTC+1, Richard Damon wrote:
>>>>>> On 10/24/20 3:13 PM, olcott wrote:
>>>>>>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>>>>>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>>>>>>
>>>>>>>>> I am refuting that the Linz proof proves that the halting
>>>>>>>>> problem is
>>>>>>>>> undecidable by finding another way to define the halt decider that
>>>>>>>>> cannot be contradicted.
>>>>>>>>
>>>>>>>> That is like refute the fact that there is no highest prime
>>>>>>>> number by
>>>>>>>> redefining prime numbers (or maybe redefining the Natural Numbers
>>>>>>>> that
>>>>>>>> primes are part of).
>>>>>>>
>>>>>>> Not at all.
>>>>>>>
>>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>>>>> means that the input has infinite execution.
>>>>>>>
>>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>>>>>> means that the input DOES NOT HAVE infinite execution.
>>>>>>>
>>>>>>> and there are no programs left over that can be shown to be
>>>>>>> undecidable.
>>>>>>>
>>>>>> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
>>>>>> execution.
>>>>>>
>>>>>> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and
>>>>>> thus
>>>>>> H_Hat does NOT have infinite execution, contrary to what H said.
>>>>>>
>>>>>> THUS, H does not met the requirements of the Halting Problem.
>>>>>>
>>>>>> The Halting Problem, the one which mathematics wants, and how it
>>>>>> defines
>>>>>> it, is to have a determiner, that will tell you in finite time,
>>>>>> accurately, whether a specified machine with specified input will
>>>>>> ultimately halt or never halt.
>>>>>>
>>>>>> All you have shown, is that your particular method of trying to
>>>>>> implement the machine H, is incapable of doing the job. Linz did
>>>>>> you one
>>>>>> better, he showed that NO machine can do the job.
>>>>>>
>>>>>> The question asked was, will the program stop.
>>>>>>
>>>>>> Your answer was, I don't know, I got overloaded thinking about it.
>>>>>>
>>>>>> Note, that your method is actually doomed to fail on most interesting
>>>>>> machines, because it is fundamentally finite, and from everything I
>>>>>> have
>>>>>> heard, you seem to be anticipating that you will detect looping by
>>>>>> getting into repeated state. While it is true, that the loop in
>>>>>> H_Hat is
>>>>>> detectable by this, many of the interesting machines don't hit this
>>>>>> sort
>>>>>> of state, but the machine data just keeps growing infinitely large
>>>>>> until
>>>>>> it either finds the answer it is looking for, or never stops if
>>>>>> there is
>>>>>> no possible answer.
>>>>>>
>>>>> The scope of this was to show that the Linz proof is unsound, not to
>>>>> construct an actual halt decider. It's logically possible for one proof
>>>>> that halt deciders can't be written to be unsound, whilst another one
>>>>> is sound.
>>>>> However in fact the proof is sound. The weakness is that it requires
>>>>> that
>>>>> H be a Turing machine. It's not a proof that no halt decider is
>>>>> possible,
>>>>> just that the halt decider is not a Turing machine.
>>>>>
>>>>
>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>> means that the input has infinite execution.
>>>>
>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>>>> means that the input DOES NOT HAVE infinite execution.
>>>>
>>>> All Input is divided into exactly one of these two sets:
>>>> (a) The input Program/TM has infinite execution.
>>>> (b) The input Program/TM DOES NOT HAVE infinite execution.
>>>>
>>>> There is no reason why a UTM halt decider could not be implemented so
>>>> that it examines every state transition of its input UTM in the exact
>>>> same way as described above.
>>>>
>>>>
>>>
>>> Lets look at this statement.
>>>
>>> We have two programs in view, H(H_Hat, H_Hat) which calls
>>> Aborted_Because_Non_Halting_Behavior_Detected and H_Hat(H_Hat) which
>>> will also call Aborted_Because_Non_Halting_Behavior_Detected, and in
>>> both case the call is given exactly the same input, so it will, by
>>> necessity, generate exactly the same output.
>>>
>>> The first possibility, which is how it seems you are saying it will go,
>>> the function will detect infinite recursion in the input program, and
>>> thus return true. When we run H this way, H being the required halt
>>> detector, based on the value it got, will declare H_Hat(H_Hat) to be a
>>> non-Halting program.
>>>
>>> Now, we run H_Hat(H_Hat), and it will also get the same true answer, and
>>> it will then immediately Halt. Thus it is clear that H gave the wrong
>>> answer,
>>
>> No the outer H_Hat() is an entirely different process and has much more
>> data than the inner H_Hat(). Because the same code has entirely
>> different data one instance can have a completely different execution
>> trace than the other.
> 
> Both the outer H and outer H_Hat invoke the function in identical
> manners, if they don't you have translated them right. Thus they invoke
> the detection function the same way.
> 
> The inner H_Hat is supposed to be a faithful representation of the outer
> H_Hat, if not, you haven't encoded it properly.

The inner H_Hat has the exact same machine code as the outer H_Hat yet 
the outer DebugTrace() has seen many more steps of the inner H_Hat() 
than this inner H_Hat()'s DebugTrace() have seen of its own inner inner 
H_Hat().

> Both are calculating the value of H_Hat(H_Hat), one as the actual
> program and one as your emulated program. Yes, because you are emulating
> the inner H_Hat, your emulator can do what it wants to that inner one,
> but the whole purpose of this to let H decide what the running of H_Hat
> is going to do. Making the emulated one act differently just isn't going
> to help you figure out what the real machine is going to do.

Actually you are missing a key detail. The only function in the whole 
system that decides halting is
Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)

>>> as when we ran H, it said that it wouldn't. The fact that H_Hat
>>> stopped on its own, its irrefutable. Note, H by its definition and your
>>> construction does NOT have infinite execution, and H_Hat, at least if H
>>> returned non-Halting, adds a very small finite amount of execution to
>>> it, so it is also finite in execution.
>>
>> Different instances of H_Hat() having entirely different data must be
>> against your religion, none-the-less fully operational code will totally
>> prove my point.
> 
> There is nothing wrong with running H_Hat with some other data, but it
> is meaningless to the Linz proof. Linz everywhere is using H_Hat(H_Hat)
> and H(H_Hat, H_Hat).

No one seems to be getting the idea that there are three different 
H_Hats() specified by the execution of this code:

void H_Hat(u32 M)
{
   if (Aborted_Because_Non_Halting_Behavior_Detected(M, M))
     MOV_EAX_0  // Execution of M(N) has been aborted
   else
   {
     MOV_EAX_1  // M(N) has halted
     HERE: goto HERE;
   }
   HALT
}


int main()
{
   u32 M = (u32)H_Hat;
   H_Hat(M);  // MOV_EAX_0
   HALT;
}

The H_Hat() called by main() is the outermost H_Hat().

Aborted_Because_Non_Halting_Behavior_Detected(M, M) creates a whole 
brand new process context to execute its own H_Hat() instance

which in turn executes a whole other instance of 
Aborted_Because_Non_Halting_Behavior_Detected(M, M) in the process 
instance of the inner H_Hat()

which which in turn creates yet another whole process instance to 
execute an inner inner H_Hat().

The two instances of the actual halt deciders:
Aborted_Because_Non_Halting_Behavior_Detected(M, M)
have different amounts of data.

The outer instance decides to abort the whole process tree. This aborts 
both inner and inner H_Hats() and it also aborts the inner instance of 
Aborted_Because_Non_Halting_Behavior_Detected(M, M) before it ever 
returns a value.

Apparently this stuff is simply too difficult to understand without 
seeing working code that proves that the execution trace has been 
described accurately.

>>> If there IS a problem of infinite execution, then that problem is in H,
>>> which is what YOU provided, so if there is a problem, it is yours.
>>
>> No H() and H_Hat() are merely the conventional functions used in every
>> standard halting problem proof.
>>
>>> The alternative case, would be if
>>> Aborted_Because_Non_Halting_Behavior_Detected returns false, then H will
>>> say that H_Hat does terminate, but when you run H_Hat is will never
>>> halt, so again you get the wrong answer.
>>
>> Yes you can break my solution to make it not work. That is not any sort
>> of actual rebuttal what-so-ever.
>>
>>> Also, based on what I think you are describing, I suspect that if you
>>> run H(H) it will also declare it as having infinite execution, even
>>> though H will always (by its definition) halt in finite time.
>>
>>
>>
> 


-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24348 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-24 16:24 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<-cmdnWoATZ3iBgnCnZ2dnUU7-RfNnZ2d@giganews.com>
In reply to#24343
On 10/24/2020 3:55 PM, Richard Damon wrote:
> On 10/24/20 3:13 PM, olcott wrote:
>> On 10/24/2020 12:36 PM, Richard Damon wrote:
>>> On 10/24/20 11:36 AM, olcott wrote:
>>>>
>>>> I am refuting that the Linz proof proves that the halting problem is
>>>> undecidable by finding another way to define the halt decider that
>>>> cannot be contradicted.
>>>
>>> That is like refute the fact that there is no highest prime number by
>>> redefining prime numbers (or maybe redefining the Natural Numbers that
>>> primes are part of).
>>
>> Not at all.
>>
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>> means that the input has infinite execution.
>>
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false
>> means that the input DOES NOT HAVE infinite execution.
>>
>> and there are no programs left over that can be shown to be undecidable.
>>
> 
> I run H(H_Hat, H_Hat), I get the answer that H_Hat(H_Hat) has infinite
> execution.
> 
> I run H_Hat(H_Hat), the function returns true, so H_Hat halts, and thus
> H_Hat does NOT have infinite execution, contrary to what H said.

You must be able to follow the key nuances that an outer instance of
Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) that was 
invoked by the outer instance of H_Hat() has a longer execution trace 
thus more data than the inner instance of
Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) that was 
invoked by the inner instance of H_Hat().

If you cannot follow this analysis because it is too complex or you 
simply don't believe in different instances then you can wait until I 
finish encoding it as fully executable code.

When-so-ever H_Hat(H_Hat) is executed and it is never aborted at any 
level of outer or inner invocations then H_Hat(H_Hat) never terminates.

> THUS, H does not met the requirements of the Halting Problem.
> 
> The Halting Problem, the one which mathematics wants, and how it defines
> it, is to have a determiner, that will tell you in finite time,
> accurately, whether a specified machine with specified input will
> ultimately halt or never halt.
> 
> All you have shown, is that your particular method of trying to
> implement the machine H, is incapable of doing the job. Linz did you one
> better, he showed that NO machine can do the job.
> 
> The question asked was, will the program stop.

When-so-ever H_Hat(H_Hat) is executed and it is never aborted at any 
level of outer or inner invocations then H_Hat(H_Hat) never terminates.

> Your answer was, I don't know, I got overloaded thinking about it.
> 
> Note, that your method is actually doomed to fail on most interesting
> machines, because it is fundamentally finite, and from everything I have
> heard, you seem to be anticipating that you will detect looping by
> getting into repeated state. While it is true, that the loop in H_Hat is
> detectable by this, many of the interesting machines don't hit this sort
> of state, but the machine data just keeps growing infinitely large until
> it either finds the answer it is looking for, or never stops if there is
> no possible answer.
> 


-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24114 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-22 11:52 -0500
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<tYOdnd-3sZNZJQzCnZ2dnUU7-I_NnZ2d@giganews.com>
In reply to#24104
On 10/22/2020 10:07 AM, Malcolm McLean wrote:
> On Thursday, 22 October 2020 at 15:37:09 UTC+1, olcott wrote:
>> On 10/22/2020 7:00 AM, Richard Damon wrote:
>>> On 10/22/20 12:33 AM, olcott wrote:
>>>>
>>>> The difference is that it is no longer possible for H_Hat() to do the
>>>> opposite of what H() decides. This transforms an undecidable problem
>>>> into a decidable problem.
>>>
>>> If H_Hat no longer does what the proof defined, then your demonstration
>>> is no longer applicable to the proof.
>>>
>> If the halt decider is to report whether or not its input halts another
>> program can be constructed on the the basis of this halt decider that
>> does the opposite of whatever the halt decider decides.
>>
>> This is how H() and H_Hat() are defined in the Linz proof.
>>
>> If the halt decider is to report whether or not it aborted its input
>> program because its input program would otherwise cause the halt decider
>> to get stuck in infinite execution then this other program can no longer
>> fool its halt decider and do the opposite of whatever it decides.
>>
>> If H() aborts the execution of H_Hat() then H_Hat() cannot continue to
>> execute because H() has complete control over H_Hat.
>>
> On the first run, H indeed has complete control over H_Hat. On the second run,
> it doesn't. H_Hat is invoked directly. 

H_Hat() is always under the complete control of DebugTrace()
H() is never under the complete control of DebugTrace()

The most difficult part of creating the x86utm operating system was to 
make sure the DebugTrace() could DebugTrace() itself to an arbitrary 
recursive depth.

> The challenge is to make the second
> run consistent with the first - if H reports that H_Hat will halt on the first run,

There is only one run:
x86utm executes main() and H() which executes DebugTrace() that creates 
a separate virtual machine process that executes H_Hat() which executes 
DebugTrace() that creates a separate virtual machine process that 
executes H_Hat(). The DebugStep() that H() invoked remains in complete 
control of the full hierarchy of subordinate processes.

> H_Hat should halt on the second run when it is run directly. If H reports
> that H_Hat won't halt, H_Hat shouldn't halt. You might ask how you know
> that H_Hat won't halt, but we haven't explored that yet.
> 
> Of course it's impossible, if everything is as Linz says. But it is possible if you
> can somehow smuggle information into H so it knows if it is being called
> directly or not. If you can successfully conceal that information, then you have
> met the challenge.
> 
> Much harder to do that with a Turing machine than with an elaborate apparatus
> of X86 code, as Ben pointed out, however. X86 code is only limited to the
> local environment of a subroutine by convention. A Turing machine is limited
> to its internal states and "tape" by fundamentals of design. So you really have
> to try to produce something which looks like a Turing machine but in fact has
> a back door. Maybe a professional stage magician could advise.
> 

The x86 language is equivalent to the RASP architecture which is 
equivalent to a UTM.

https://en.wikipedia.org/wiki/Random-access_stored-program_machine

-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24132 — Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]

FromKeith Thompson <Keith.S.Thompson+u@gmail.com>
Date2020-10-22 10:45 -0700
SubjectRe: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ]
Message-ID<87lffy888t.fsf@nosuchdomain.example.com>
In reply to#24101
Richard Damon <Richard@Damon-Family.org> writes:
> On 10/22/20 12:33 AM, olcott wrote:
[SNIP]

A reminder: PO will undoubtedly persist in inappropriate
cross-posting to various comp.lang.* groups, but the rest of us
don't have to.  Please check the Newsgroups: header when you post
a followup and remove anything that isn't relevant.

The parent article was cross-posted to comp.theory, comp.lang.prolog,
comp.lang.c, and comp.lang.c++.

-- 
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]


#24080

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-10-21 22:42 +0100
Message-ID<87zh4fcl2q.fsf@bsb.me.uk>
In reply to#24063
There's actually something topical in comp.lang.c...

olcott <NoOne@NoWhere.com> writes:

> As Ben has very carefully elaborated twice the invocation of a
> function with the same input must result in the same output. The
> return value from H_Hat() and the return value from H() are the same
> return value.

That first sentence, attributed to me, is not true, and I hope I never
said it!  (If I did, post a message ID so I can post a correction,
please.)

You appear to writing C (or maybe C++), and in C, the invocation of a
function with the same "input" does not necessarily result in the same
"output", not unless the terms "input" and "output" are being stretched
beyond all reason.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#24090

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-21 21:22 -0400
Message-ID<795kH.351531$%p.107392@fx33.iad>
In reply to#24063
On 10/21/20 12:48 PM, olcott wrote:
> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>
>> What DebugTrace does internally matters to you (because you are
>> writing it), but not so much at this high level (which should turn out
>> to be enough to see your overall claim will not succeed).
>>
> 
> Yes I believe that is true.
> The key to this is noticing that the halting question has been changed:
> (a) Does H_Hat() halt on its input?
> 
> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
> decider from getting stuck in infinite execution?
> 
> I have one more key element that can best be demonstrated by fully
> functional code.
> 

Note, you do not have the 'right' to redefine the Halting Question, at
least not if you want to be talking about the 'classical' Halt Decider
and Linz's proof of impossibility.  The machine which he showed to be
impossible was the machine that could be given the description of any
Turing machine, and its input, and be able to ALWAYS tell, in finite
time, if said machine with said input would halt, or if it would process
forever an not halt.

Thus, the machine H, must never get stuck in an 'infinite loop' for any
legal input.

If you have decided that as part of that implementation, that it somehow
can detect that it has gotten itself in a loop and aborts that
calculation, and declare that the described machine will not halt, it
can, but that means that if someone can come up with a sufficiently
complicated machine that triggers this condition when given to H, but if
run by itself does eventual halt, that H wasn't the needed halt detector
(but for Linz's proof, this isn't really needed, at the Linz H^ when it
loops can be fairly easily detected,

Note, that your new wording seems to leave open some possibilities that
are not allowed in the original construction:

The implementation of your function that implements the decision of H(),
your DebugStep isn't allowed to know which program called it, but must
return the same code to both H and H_Hat.

Your implementation of your function can't halt in and of itself, but
MUST return the answer to its caller (The Turing machine H had just two
terminal states, both of which were accounted for in H_Hat).

The answer that it returns needs to reflect what H_Hat actually ends up
doing, and the program H_Hat needs to act in the manner that Linz described.

Note, that I don;'t really care how it actually gets the answer, as it
only really needs to provide the answer for this one case, being given
the machine/Input H_Hat/H_Hat, as far as I am concerned, Linz proof
still holds even if the function is just a return 0;, or a return 1;

There are only a few things that are really important:

Both the calls to it in H and in H_Hat need to return the same value,
and in finite time.

That H indicates the correct halting indication for H_Hat.

That H_Hat was constructed and executes per Linz's specification (It
must halt if H will indicate that it looped, and it must loop if H will
indicate it halted)

Any attempt to mark H_Hat is an 'improper program' will just prove
Linz's statement, as if there IS an H, then the construction of H_Hat is
clearly a legal modification, so any problems with it must have been
contained in H, so saying H can't exist is exactly what Linz was trying
to prove.

[toc] | [prev] | [next] | [standalone]


#24092 — Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-21 21:14 -0500
SubjectRe: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]
Message-ID<Bd6dnQgPu-h2dw3CnZ2dnUU7-bmdnZ2d@giganews.com>
In reply to#24090
On 10/21/2020 8:22 PM, Richard Damon wrote:
> On 10/21/20 12:48 PM, olcott wrote:
>> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>>
>>> What DebugTrace does internally matters to you (because you are
>>> writing it), but not so much at this high level (which should turn out
>>> to be enough to see your overall claim will not succeed).
>>>
>>
>> Yes I believe that is true.
>> The key to this is noticing that the halting question has been changed:
>> (a) Does H_Hat() halt on its input?
>>
>> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
>> decider from getting stuck in infinite execution?
>>
>> I have one more key element that can best be demonstrated by fully
>> functional code.
>>
> 
> Note, you do not have the 'right' to redefine the Halting Question, at
> least not if you want to be talking about the 'classical' Halt Decider
> and Linz's proof of impossibility.  The machine which he showed to be
> impossible was the machine that could be given the description of any
> Turing machine, and its input, and be able to ALWAYS tell, in finite
> time, if said machine with said input would halt, or if it would process
> forever an not halt.
> 
> Thus, the machine H, must never get stuck in an 'infinite loop' for any
> legal input.
> 
> If you have decided that as part of that implementation, that it somehow
> can detect that it has gotten itself in a loop and aborts that
> calculation, and declare that the described machine will not halt, it
> can, but that means that if someone can come up with a sufficiently
> complicated machine that triggers this condition when given to H, but if
> run by itself does eventual halt, that H wasn't the needed halt detector
> (but for Linz's proof, this isn't really needed, at the Linz H^ when it
> loops can be fairly easily detected,
> 
> Note, that your new wording seems to leave open some possibilities that
> are not allowed in the original construction:
> 
> The implementation of your function that implements the decision of H(),
> your DebugStep isn't allowed to know which program called it, but must
> return the same code to both H and H_Hat.
> 
> Your implementation of your function can't halt in and of itself, but
> MUST return the answer to its caller (The Turing machine H had just two
> terminal states, both of which were accounted for in H_Hat).
> 
> The answer that it returns needs to reflect what H_Hat actually ends up
> doing, and the program H_Hat needs to act in the manner that Linz described.
> 
> Note, that I don;'t really care how it actually gets the answer, as it
> only really needs to provide the answer for this one case, being given
> the machine/Input H_Hat/H_Hat, as far as I am concerned, Linz proof
> still holds even if the function is just a return 0;, or a return 1;
> 
> There are only a few things that are really important:
> 
> Both the calls to it in H and in H_Hat need to return the same value,
> and in finite time.
> 
> That H indicates the correct halting indication for H_Hat.
> 
> That H_Hat was constructed and executes per Linz's specification (It
> must halt if H will indicate that it looped, and it must loop if H will
> indicate it halted)
> 
> Any attempt to mark H_Hat is an 'improper program' will just prove
> Linz's statement, as if there IS an H, then the construction of H_Hat is
> clearly a legal modification, so any problems with it must have been
> contained in H, so saying H can't exist is exactly what Linz was trying
> to prove.
> 

When we make the single change that I suggest the halting problem ceases 
to be impossible to solve because this revised question is not subject 
to pathological self-reference.

All of the inputs are divided into halting and not halting and the halt 
decider cannot be fooled by a program based on itself that does the 
opposite of whatever it decides.

-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


#24102 — Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]

FromRichard Damon <Richard@Damon-Family.org>
Date2020-10-22 08:12 -0400
SubjectRe: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]
Message-ID<2HekH.179030$RY8.71308@fx48.iad>
In reply to#24092
On 10/21/20 10:14 PM, olcott wrote:
> On 10/21/2020 8:22 PM, Richard Damon wrote:
>> On 10/21/20 12:48 PM, olcott wrote:
>>> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>>>
>>>> What DebugTrace does internally matters to you (because you are
>>>> writing it), but not so much at this high level (which should turn out
>>>> to be enough to see your overall claim will not succeed).
>>>>
>>>
>>> Yes I believe that is true.
>>> The key to this is noticing that the halting question has been changed:
>>> (a) Does H_Hat() halt on its input?
>>>
>>> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
>>> decider from getting stuck in infinite execution?
>>>
>>> I have one more key element that can best be demonstrated by fully
>>> functional code.
>>>
>>
>> Note, you do not have the 'right' to redefine the Halting Question, at
>> least not if you want to be talking about the 'classical' Halt Decider
>> and Linz's proof of impossibility.  The machine which he showed to be
>> impossible was the machine that could be given the description of any
>> Turing machine, and its input, and be able to ALWAYS tell, in finite
>> time, if said machine with said input would halt, or if it would process
>> forever an not halt.
>>
>> Thus, the machine H, must never get stuck in an 'infinite loop' for any
>> legal input.
>>
>> If you have decided that as part of that implementation, that it somehow
>> can detect that it has gotten itself in a loop and aborts that
>> calculation, and declare that the described machine will not halt, it
>> can, but that means that if someone can come up with a sufficiently
>> complicated machine that triggers this condition when given to H, but if
>> run by itself does eventual halt, that H wasn't the needed halt detector
>> (but for Linz's proof, this isn't really needed, at the Linz H^ when it
>> loops can be fairly easily detected,
>>
>> Note, that your new wording seems to leave open some possibilities that
>> are not allowed in the original construction:
>>
>> The implementation of your function that implements the decision of H(),
>> your DebugStep isn't allowed to know which program called it, but must
>> return the same code to both H and H_Hat.
>>
>> Your implementation of your function can't halt in and of itself, but
>> MUST return the answer to its caller (The Turing machine H had just two
>> terminal states, both of which were accounted for in H_Hat).
>>
>> The answer that it returns needs to reflect what H_Hat actually ends up
>> doing, and the program H_Hat needs to act in the manner that Linz
>> described.
>>
>> Note, that I don;'t really care how it actually gets the answer, as it
>> only really needs to provide the answer for this one case, being given
>> the machine/Input H_Hat/H_Hat, as far as I am concerned, Linz proof
>> still holds even if the function is just a return 0;, or a return 1;
>>
>> There are only a few things that are really important:
>>
>> Both the calls to it in H and in H_Hat need to return the same value,
>> and in finite time.
>>
>> That H indicates the correct halting indication for H_Hat.
>>
>> That H_Hat was constructed and executes per Linz's specification (It
>> must halt if H will indicate that it looped, and it must loop if H will
>> indicate it halted)
>>
>> Any attempt to mark H_Hat is an 'improper program' will just prove
>> Linz's statement, as if there IS an H, then the construction of H_Hat is
>> clearly a legal modification, so any problems with it must have been
>> contained in H, so saying H can't exist is exactly what Linz was trying
>> to prove.
>>
> 
> When we make the single change that I suggest the halting problem ceases
> to be impossible to solve because this revised question is not subject
> to pathological self-reference.
> 
> All of the inputs are divided into halting and not halting and the halt
> decider cannot be fooled by a program based on itself that does the
> opposite of whatever it decides.
> 

But, Turing machines DO allow for such a self-reference. If we can make
a Halting Determinator supposes(H), then based on the basic construction
rules of Turing machines, we can construct another Turing machine
(H_Hat). Since that IS a Turing Machine, H needs to be able to process it.

Your argument seems to basically devolve into redefining the Halt
Detector definition to have a trinary output, Yes, it Halt, No it
doesn't, or I can't determine because it 'cheats'. Showing that such a
determinator might be able to exist does NOTHING to negate the proof
that the strict determinator can't exist.

In some ways that is very much like incompleateness, there are machines
you can prove halt, there are machines you can prove will never halt,
and then there are some machines that you can't determine, in finite
time, whether they halt or not. This means that H can't exist (and thus
you can't build H_Hat).

[toc] | [prev] | [next] | [standalone]


#24105 — Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]

Fromolcott <NoOne@NoWhere.com>
Date2020-10-22 09:41 -0500
SubjectRe: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ refutation of HP proofs ]
Message-ID<hPudnQ8e2tWWBwzCnZ2dnUU7-RvNnZ2d@giganews.com>
In reply to#24102
On 10/22/2020 7:12 AM, Richard Damon wrote:
> On 10/21/20 10:14 PM, olcott wrote:
>> On 10/21/2020 8:22 PM, Richard Damon wrote:
>>> On 10/21/20 12:48 PM, olcott wrote:
>>>> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>>>>
>>>>> What DebugTrace does internally matters to you (because you are
>>>>> writing it), but not so much at this high level (which should turn out
>>>>> to be enough to see your overall claim will not succeed).
>>>>>
>>>>
>>>> Yes I believe that is true.
>>>> The key to this is noticing that the halting question has been changed:
>>>> (a) Does H_Hat() halt on its input?
>>>>
>>>> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
>>>> decider from getting stuck in infinite execution?
>>>>
>>>> I have one more key element that can best be demonstrated by fully
>>>> functional code.
>>>>
>>>
>>> Note, you do not have the 'right' to redefine the Halting Question, at
>>> least not if you want to be talking about the 'classical' Halt Decider
>>> and Linz's proof of impossibility.  The machine which he showed to be
>>> impossible was the machine that could be given the description of any
>>> Turing machine, and its input, and be able to ALWAYS tell, in finite
>>> time, if said machine with said input would halt, or if it would process
>>> forever an not halt.
>>>
>>> Thus, the machine H, must never get stuck in an 'infinite loop' for any
>>> legal input.
>>>
>>> If you have decided that as part of that implementation, that it somehow
>>> can detect that it has gotten itself in a loop and aborts that
>>> calculation, and declare that the described machine will not halt, it
>>> can, but that means that if someone can come up with a sufficiently
>>> complicated machine that triggers this condition when given to H, but if
>>> run by itself does eventual halt, that H wasn't the needed halt detector
>>> (but for Linz's proof, this isn't really needed, at the Linz H^ when it
>>> loops can be fairly easily detected,
>>>
>>> Note, that your new wording seems to leave open some possibilities that
>>> are not allowed in the original construction:
>>>
>>> The implementation of your function that implements the decision of H(),
>>> your DebugStep isn't allowed to know which program called it, but must
>>> return the same code to both H and H_Hat.
>>>
>>> Your implementation of your function can't halt in and of itself, but
>>> MUST return the answer to its caller (The Turing machine H had just two
>>> terminal states, both of which were accounted for in H_Hat).
>>>
>>> The answer that it returns needs to reflect what H_Hat actually ends up
>>> doing, and the program H_Hat needs to act in the manner that Linz
>>> described.
>>>
>>> Note, that I don;'t really care how it actually gets the answer, as it
>>> only really needs to provide the answer for this one case, being given
>>> the machine/Input H_Hat/H_Hat, as far as I am concerned, Linz proof
>>> still holds even if the function is just a return 0;, or a return 1;
>>>
>>> There are only a few things that are really important:
>>>
>>> Both the calls to it in H and in H_Hat need to return the same value,
>>> and in finite time.
>>>
>>> That H indicates the correct halting indication for H_Hat.
>>>
>>> That H_Hat was constructed and executes per Linz's specification (It
>>> must halt if H will indicate that it looped, and it must loop if H will
>>> indicate it halted)
>>>
>>> Any attempt to mark H_Hat is an 'improper program' will just prove
>>> Linz's statement, as if there IS an H, then the construction of H_Hat is
>>> clearly a legal modification, so any problems with it must have been
>>> contained in H, so saying H can't exist is exactly what Linz was trying
>>> to prove.
>>>
>>
>> When we make the single change that I suggest the halting problem ceases
>> to be impossible to solve because this revised question is not subject
>> to pathological self-reference.
>>
>> All of the inputs are divided into halting and not halting and the halt
>> decider cannot be fooled by a program based on itself that does the
>> opposite of whatever it decides.
>>
> 
> But, Turing machines DO allow for such a self-reference. If we can make
> a Halting Determinator supposes(H), then based on the basic construction
> rules of Turing machines, we can construct another Turing machine
> (H_Hat). Since that IS a Turing Machine, H needs to be able to process it.
> 
> Your argument seems to basically devolve into redefining the Halt
> Detector definition to have a trinary output, Yes, it Halt, No it
> doesn't, or I can't determine because it 'cheats'. 

No it is binary:
(a) Its execution was aborted because it would not otherwise halt.
(b) Its execution was allowed to continue until it terminated.

> Showing that such a
> determinator might be able to exist does NOTHING to negate the proof
> that the strict determinator can't exist.
> 
> In some ways that is very much like incompleateness, there are machines
> you can prove halt, there are machines you can prove will never halt,
> and then there are some machines that you can't determine, in finite
> time, whether they halt or not. This means that H can't exist (and thus
> you can't build H_Hat).
> 

The undecidability of the conventional self-referential halting problem 
proofs has been refuted.

-- 
Copyright 2020 Pete Olcott

[toc] | [prev] | [next] | [standalone]


Page 21 of 25 — ← Prev page 1 … 19 20 [21] 22 23 … 25  Next page →

Back to top | Article view | comp.theory


csiph-web