Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #24043 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-10-20 11:33 -0500 |
| Last post | 2020-10-29 14:01 +0100 |
| Articles | 20 on this page of 499 — 17 participants |
Back to article view | Back to comp.theory
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 16 of 25 — ← Prev page 1 … 14 15 [16] 17 18 … 25 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-24 01:43 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <87k0vg1mij.fsf@bsb.me.uk> |
| In reply to | #24281 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > So you've got a choice. You can keep H_Hat as a Turing machine, and say > Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that > it is no longer a Turing machine. Forgive my laziness. I haven't been following all of this conversation between the showman and his coach (as I think you see it) so I am really puzzled by what you mean by a Turing machine. You can't mean it literally (H_Hat has been published and it's a C function with asm directives) but I can't work out the non-literal meaning you have for it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-24 02:37 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <88de5b88-37d9-402d-abed-816ee108b102n@googlegroups.com> |
| In reply to | #24284 |
On Saturday, 24 October 2020 at 01:43:51 UTC+1, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > > So you've got a choice. You can keep H_Hat as a Turing machine, and say > > Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that > > it is no longer a Turing machine. > Forgive my laziness. I haven't been following all of this conversation > between the showman and his coach (as I think you see it) so I am really > puzzled by what you mean by a Turing machine. You can't mean it > literally (H_Hat has been published and it's a C function with asm > directives) but I can't work out the non-literal meaning you have for > it. > We have this system. A computer with a command terminal, running a shell, and with so much memory that no "sane" program would ever exhaust it. It also has a C compiler, and a big red buton. When we press the button, it raises a signal that terminates the program, puts up the message "this program has terminated abormally" and returns control to the shell. We also have a function in the Clibrary called "raise_signal". Once raise_signal iis called, exactly the same signal is raised. There's no way for the software to distinguish them. Out "Turing machines" have a special state. When they enter it, raise_signal is called. We write H() so that, if it detects non-halting, it goes into this special state. Now what happens if we call H() on "Hello world"? Obviously, it reports "halts". Now what happens if we call on "while(1);" It reports "this program has terminated abormally?". So what happens when we run "while(1);" directly? Well we've only got one computer. We can't wait indefinitely. Eventually we'll have to press the button and it reports "this program has terminated abormally". Now what happens if we try to write H_Hat? It can't be done. That's because H_Hat is meant to halt if H reports that the program has terminated abormally. But the machine doesn't exist any longer if H terminates it. So we write H_Hat anyway, ignoring this little difficulty. H(H_Hat,H_Hat) reports "this program terminated abormally". H_Hat(H_Hat) terminates abormally. So everything is consistent.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 10:41 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <88Wdnfit-M-s1gnCnZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #24307 |
On 10/24/2020 4:37 AM, Malcolm McLean wrote: > On Saturday, 24 October 2020 at 01:43:51 UTC+1, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >>> So you've got a choice. You can keep H_Hat as a Turing machine, and say >>> Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that >>> it is no longer a Turing machine. >> Forgive my laziness. I haven't been following all of this conversation >> between the showman and his coach (as I think you see it) so I am really >> puzzled by what you mean by a Turing machine. You can't mean it >> literally (H_Hat has been published and it's a C function with asm >> directives) but I can't work out the non-literal meaning you have for >> it. >> > We have this system. A computer with a command terminal, running a shell, > and with so much memory that no "sane" program would ever exhaust it. > It also has a C compiler, and a big red buton. When we press the button, > it raises a signal that terminates the program, puts up the message "this > program has terminated abormally" and returns control to the shell. We > also have a function in the Clibrary called "raise_signal". Once raise_signal > iis called, exactly the same signal is raised. There's no way for the software > to distinguish them. > Out "Turing machines" have a special state. When they enter it, raise_signal > is called. We write H() so that, if it detects non-halting, it goes into this special > state. > > Now what happens if we call H() on "Hello world"? Obviously, it reports "halts". > Now what happens if we call on "while(1);" It reports "this program has > terminated abormally?". So what happens when we run "while(1);" directly? > Well we've only got one computer. We can't wait indefinitely. Eventually we'll > have to press the button and it reports "this program has terminated abormally". > > Now what happens if we try to write H_Hat? It can't be done. That's because > H_Hat is meant to halt if H reports that the program has terminated abormally. > But the machine doesn't exist any longer if H terminates it. So we write H_Hat > anyway, ignoring this little difficulty. H(H_Hat,H_Hat) reports "this program > terminated abormally". H_Hat(H_Hat) terminates abormally. > > So everything is consistent. > > 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. Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true Does not precisely fit into either category of HALTS / DOES_NOT_HALT, yet always indicates that the input program would never halt unless it was aborted. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-24 09:04 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <285c1231-a52b-4e99-ab17-0e3630511cabn@googlegroups.com> |
| In reply to | #24316 |
On Saturday, 24 October 2020 at 16:41:45 UTC+1, olcott wrote: > > 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. > Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true > Does not precisely fit into either category of HALTS / DOES_NOT_HALT, > yet always indicates that the input program would never halt unless it > was aborted. > Abortion has to be "sticky". So if DebugTrace aborts a program it is emulating because it detects it loops infinitely, it has to also abort itself. Otherwise it's just another name for HALTS / DOES_NOT_HALT. The best way to think of this is when we abort, it's like detonating a bomb which blows up the entire computer. However currently DebugTrace doesn't abort itself. That's the mistake you're making.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 13:46 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <vfSdnQ_ZG40d6wnCnZ2dnUU7-TvNnZ2d@giganews.com> |
| In reply to | #24320 |
On 10/24/2020 11:04 AM, Malcolm McLean wrote: > On Saturday, 24 October 2020 at 16:41:45 UTC+1, olcott wrote: >> >> 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. >> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true >> Does not precisely fit into either category of HALTS / DOES_NOT_HALT, >> yet always indicates that the input program would never halt unless it >> was aborted. >> > Abortion has to be "sticky". So if DebugTrace aborts a program it is emulating > because it detects it loops infinitely, it has to also abort itself. Otherwise > it's just another name for HALTS / DOES_NOT_HALT. > The best way to think of this is when we abort, it's like detonating a bomb > which blows up the entire computer. > However currently DebugTrace doesn't abort itself. That's the mistake you're > making. > The outer instance of Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) that is executed in the operating system process context of x86utm aborts the whole process tree that is connected to the process that it is emulating. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-25 00:54 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <874kmjyyc5.fsf@bsb.me.uk> |
| In reply to | #24316 |
olcott <NoOne@NoWhere.com> writes:
> 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.
>
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
> Does not precisely fit into either category of HALTS / DOES_NOT_HALT,
> yet always indicates that the input program would never halt unless it
> was aborted.
That's very cagey. If the categories /did/ corresponded exactly to the
conventional halting problem answers, we would have the following grid:
ABNHBD(P, I) == true ABNHBD(P, I) == false
-------------------+----------------------+-----------------------+
P(I) halts | none | some |
-------------------+----------------------+-----------------------+
P(I) does not halt | some | none |
-------------------+----------------------+-----------------------+
with "none" meaning there are no P, I pairs with the indicated
properties, and "some" meaning that there are.
So which of those "some" and "none" boxes have I got wrong for your
Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) function?
Can you fill in the grid properly for me?
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-24 22:03 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <8736231gli.fsf@bsb.me.uk> |
| In reply to | #24307 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
> On Saturday, 24 October 2020 at 01:43:51 UTC+1, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>> > So you've got a choice. You can keep H_Hat as a Turing machine, and say
>> > Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that
>> > it is no longer a Turing machine.
>> Forgive my laziness. I haven't been following all of this conversation
>> between the showman and his coach (as I think you see it) so I am really
>> puzzled by what you mean by a Turing machine. You can't mean it
>> literally (H_Hat has been published and it's a C function with asm
>> directives) but I can't work out the non-literal meaning you have for
>> it.
>>
> We have this system. A computer with a command terminal, running a shell,
> and with so much memory that no "sane" program would ever exhaust it.
> It also has a C compiler, and a big red buton. When we press the button,
> it raises a signal that terminates the program, puts up the message "this
> program has terminated abormally" and returns control to the shell. We
> also have a function in the Clibrary called "raise_signal". Once raise_signal
> iis called, exactly the same signal is raised. There's no way for the software
> to distinguish them.
> Out "Turing machines" have a special state. When they enter it, raise_signal
> is called. We write H() so that, if it detects non-halting, it goes into this special
> state.
What Turing machines? That's the bit I don't get. Putting scare quotes
round the words does not help -- I know you are using the term in some
metaphorical, way but I am not sure what attributes of TMs are being
referenced by the metaphor. The best I can come up with is that you
mean programs, but that is such an obvious word, I can't see why you
would avoid it.
> Now what happens if we call H() on "Hello world"? Obviously, it
> reports "halts".
On a hello word function, I think you mean. The H that has been posted
here can't be called on programs.
> Now what happens if we call on "while(1);" It reports "this program has
> terminated abormally?".
It sets eax to 0, that's all that happens.
What that means is up to PO (and you if you claim to know his intent)
and "this program has terminated abormally?" is truly a awful
description. First off "this program" is mighty confusing because "this
program" could reasonably be taken to be whatever program has called H
when the report is actually about some other computation.
To see the other reasons why this the wrong phrase we need to see H:
void H(u32 M, u32 N)
{
if (DebugTrace(M, N))
MOV_EAX_0
else
MOV_EAX_1
HALT
}
Now we can see that "program" is the wrong abstraction. What is "under
test" is a computation: M(N). Further, the word "has" is wrong because
M(N) is not run and usually won't have any logic for abnormal
termination. At best it is simulated and/or single-stepped with other
code used to determine whether to stop the simulation or stepping. Thus
"was terminated" is a better phrase.
Also, the abnormality pertains to the simulation, if at all, and not to
M(N) which will usually have no abnormal termination logic. (But
frankly, the term is just a distraction.)
Finally, what's with the question mark?
So what would be a better thing to say? How about "M(N) not found to
halt"? This describes the meaning without tying the code so some
particular method.
So H divides it's inputs into two classes: those that are found to halt
and those that are not. It's a classical partial halt decider.
Here is PO's first major problem. The claim was that H would be right
about just the one case: H_Hat(H_Hat) (we know it can't be right about
all cases) and that means only the "known to halt" result can be used.
"Not known to halt" is never a correct answer to a halting problem
instance.
I don't think he's ever got his head round this. There is always a
correct answer, and it must be yes or no. We've given him huge
latitude everywhere else. His H can get every single other case wrong!
The only case it must get right is the one he claimed it could:
H_Hat(H_Hat).
In fact, PO will probably dispute this partial halt decider
characterisation. He will say, I think, that DeubgTrace is never wrong.
It detects every non-halting computation and never missing a halting
one. Of course, this is impossible, but assuming it isn't any help
because both reports from H can still be showm to be wrong.
> So what happens when we run "while(1);" directly?
> Well we've only got one computer. We can't wait indefinitely. Eventually we'll
> have to press the button and it reports "this program has terminated
> abormally".
"This program" is correct here, but "it /was/ terminated", not "it /has/
terminated". Has terminated means it was the logic of the program that
resulted in the control flow action we call an "abort", and "while(1);"
has not such logic.
But the big trouble lies elsewhere. By confusing programs with the
computations they execute, you have brushed a crucial matter under the
carpet. Pushing the button is input to a program. The computation
"while(1);" and "while(1);" with a signal are not the same computation.
The program is the same, but the computation is different.
This operational rather than denotational view of semantics has led PO,
and apparently you, down a rabbit hole. Halting is a property of
program texts (or instruction lists if we much use that model). They
don't have to be run so know what happens, nor do they need to be
simulated. You don't even need any computers (as we know them). After
all, the original theorem pre-dates our notion of a computer -- it's
about the mathematics of what can be determined by a finite set of
atomic rules.
> Now what happens if we try to write H_Hat? It can't be done.
It's been written. Actual code. Here it is:
void H_Hat(u32 M)
{
if (!DebugTrace(M, M))
HERE: goto HERE;
HALT
}
> That's because
> H_Hat is meant to halt if H reports that the program has terminated
> abormally.
No, there is no "meant" about it. H_Hat's behaviour is determined by
what DebugTrace returns, just like H's.
(PO should have written H_Hat in terms of H but H is just a thin wrapper
round DebugTrace so we are not losing too much clarity by this small
cheat.)
> But the machine doesn't exist any longer if H terminates it. So we write H_Hat
> anyway, ignoring this little difficulty. H(H_Hat,H_Hat) reports "this program
> terminated abormally". H_Hat(H_Hat) terminates abormally.
I can't make head or tail of this.
If H(H_Hat, H_Hat) sets eax to 0, meaning "H_Hat(H_Hat) not found to
halt", then it can't be correct. Only yes and no are correct answers
for any instance of the halting problem.
PO will claim (I think) that setting eax to 0 means that H_Hat(H_Hat)
really does not halt. But then, we can go a bit further. H sets eax to
0 if and only if DebugTrace(H_Hat, H_Hat) != 0. And if
DebugTrace(H_Hat, H_Hat) != 0 we know that H_Hat(H_Hat) is a computation
whose trace is a single halt instruction.
Note that these facts are derived from the texts of the functions. They
remain true in a world with no computers, no programs and no running
code. All the stuff about aborting, big red buttons and programs no
longer running or machine not existing is just smoke and mirrors.
Please don't add to it. Analyse what PO claims to have in clear,
abstract terms.
> So everything is consistent.
You seem to have bought into his schtick. The claim was a correct
result, not a consistent one.
Sorry this got so long. All I wanted to know was what you meant by a
Turing machine (and I still don't unless my guess of "a program" is
correct), but you posted so much more that seemed designed to add to the
confusion that I decided to have a go at making things clearer.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-24 14:35 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <4a313cbe-bb52-4416-88d8-5c2f7ae6c5c5n@googlegroups.com> |
| In reply to | #24345 |
On Saturday, 24 October 2020 at 22:03:57 UTC+1, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>
> > On Saturday, 24 October 2020 at 01:43:51 UTC+1, Ben Bacarisse wrote:
> >> Malcolm McLean <malcolm.ar...@gmail.com> writes:
> >>
> >> > So you've got a choice. You can keep H_Hat as a Turing machine, and say
> >> > Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that
> >> > it is no longer a Turing machine.
> >> Forgive my laziness. I haven't been following all of this conversation
> >> between the showman and his coach (as I think you see it) so I am really
> >> puzzled by what you mean by a Turing machine. You can't mean it
> >> literally (H_Hat has been published and it's a C function with asm
> >> directives) but I can't work out the non-literal meaning you have for
> >> it.
> >>
> > We have this system. A computer with a command terminal, running a shell,
> > and with so much memory that no "sane" program would ever exhaust it.
> > It also has a C compiler, and a big red buton. When we press the button,
> > it raises a signal that terminates the program, puts up the message "this
> > program has terminated abormally" and returns control to the shell. We
> > also have a function in the Clibrary called "raise_signal". Once raise_signal
> > iis called, exactly the same signal is raised. There's no way for the software
> > to distinguish them.
> > Out "Turing machines" have a special state. When they enter it, raise_signal
> > is called. We write H() so that, if it detects non-halting, it goes into this special
> > state.
>
> What Turing machines? That's the bit I don't get. Putting scare quotes
> round the words does not help -- I know you are using the term in some
> metaphorical, way but I am not sure what attributes of TMs are being
> referenced by the metaphor. The best I can come up with is that you
> mean programs, but that is such an obvious word, I can't see why you
> would avoid it.
>
I mean something with the facility to abort.
>
> > Now what happens if we call H() on "Hello world"? Obviously, it
> > reports "halts".
>
> On a hello word function, I think you mean. The H that has been posted
> here can't be called on programs.
>
> > Now what happens if we call on "while(1);" It reports "this program has
> > terminated abormally?".
>
> It sets eax to 0, that's all that happens.
>
> What that means is up to PO (and you if you claim to know his intent)
> and "this program has terminated abormally?" is truly a awful
> description. First off "this program" is mighty confusing because "this
> program" could reasonably be taken to be whatever program has called H
> when the report is actually about some other computation.
>
"Abort is" exactly equivlalent to smashing the computer. That's what you don't
seem to have taken on board. The program that called H no longer does anything,
because the computer it runs on no longer exists.
>
> To see the other reasons why this the wrong phrase we need to see H:
>
> void H(u32 M, u32 N)
> {
> if (DebugTrace(M, N))
> MOV_EAX_0
> else
> MOV_EAX_1
> HALT
> }
>
> Now we can see that "program" is the wrong abstraction. What is "under
> test" is a computation: M(N). Further, the word "has" is wrong because
> M(N) is not run and usually won't have any logic for abnormal
> termination. At best it is simulated and/or single-stepped with other
> code used to determine whether to stop the simulation or stepping. Thus
> "was terminated" is a better phrase.
>
H smashes the machine when DebugTrace returns a detected non-halt.
It doesen't abort M.
>
> Also, the abnormality pertains to the simulation, if at all, and not to
> M(N) which will usually have no abnormal termination logic. (But
> frankly, the term is just a distraction.)
>
> Finally, what's with the question mark?
>
Typo.
>
> So what would be a better thing to say? How about "M(N) not found to
> halt"? This describes the meaning without tying the code so some
> particular method.
>
Of course that would be better. But then a clever person can construct
a case we can'r decide. By smashing the machine, we prevent that from
happening.
>
> So H divides it's inputs into two classes: those that are found to halt
> and those that are not. It's a classical partial halt decider.
>
No, H returns if the input is found to halt. Otherwise the machine breaks.
>
> Here is PO's first major problem. The claim was that H would be right
> about just the one case: H_Hat(H_Hat) (we know it can't be right about
> all cases) and that means only the "known to halt" result can be used.
> "Not known to halt" is never a correct answer to a halting problem
> instance.
>
> I don't think he's ever got his head round this. There is always a
> correct answer, and it must be yes or no. We've given him huge
> latitude everywhere else. His H can get every single other case wrong!
> The only case it must get right is the one he claimed it could:
> H_Hat(H_Hat).
>
I think you're right. By saying H_Hat(H_Hat) is "undecideable" you might think
it neither halts nor doesn't halt. In fact what Linz is saying is that it
does the opposite to what H has decided when called directly.
>
> In fact, PO will probably dispute this partial halt decider
> characterisation. He will say, I think, that DeubgTrace is never wrong.
> It detects every non-halting computation and never missing a halting
> one. Of course, this is impossible, but assuming it isn't any help
> because both reports from H can still be showm to be wrong.
>
> > So what happens when we run "while(1);" directly?
> > Well we've only got one computer. We can't wait indefinitely. Eventually we'll
> > have to press the button and it reports "this program has terminated
> > abormally".
>
> "This program" is correct here, but "it /was/ terminated", not "it /has/
> terminated". Has terminated means it was the logic of the program that
> resulted in the control flow action we call an "abort", and "while(1);"
> has not such logic.
>
No, pressing the red button is exactly equivalnet to smashing the machine.
It's not control flow at the logical level (it is physically, because machines
are expensive and we can't literally smash them for this little example).
>
> But the big trouble lies elsewhere. By confusing programs with the
> computations they execute, you have brushed a crucial matter under the
> carpet. Pushing the button is input to a program. The computation
> "while(1);" and "while(1);" with a signal are not the same computation.
> The program is the same, but the computation is different.
>
The computation while(1); will terminate when the machine is smashed..
A machine has two outcomes, processing stops when it halts, or processing
stops when the machine breaks.
>
> This operational rather than denotational view of semantics has led PO,
> and apparently you, down a rabbit hole. Halting is a property of
> program texts (or instruction lists if we much use that model). They
> don't have to be run so know what happens, nor do they need to be
> simulated. You don't even need any computers (as we know them). After
> all, the original theorem pre-dates our notion of a computer -- it's
> about the mathematics of what can be determined by a finite set of
> atomic rules.
>
That why "Turing machine" is in scare quotes. These Turing machines can smash
their own machine.No function can do that. It's not entirely obvious that
they are now no longer Turing machines, but they are not.
> > Now what happens if we try to write H_Hat? It can't be done.
>
> It's been written. Actual code. Here it is:
>
> void H_Hat(u32 M)
> {
> if (!DebugTrace(M, M))
> HERE: goto HERE;
> HALT
> }
>
> > That's because
> > H_Hat is meant to halt if H reports that the program has terminated
> > abormally.
>
> No, there is no "meant" about it. H_Hat's behaviour is determined by
> what DebugTrace returns, just like H's.
>
DebugTrace() can only return 0 (Non-halt). Otherwise the machine breaks. So
H_Hat never gets to halt.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-25 01:23 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <87h7qjxfn6.fsf@bsb.me.uk> |
| In reply to | #24350 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
> On Saturday, 24 October 2020 at 22:03:57 UTC+1, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>> > On Saturday, 24 October 2020 at 01:43:51 UTC+1, Ben Bacarisse wrote:
>> >> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>> >>
>> >> > So you've got a choice. You can keep H_Hat as a Turing machine, and say
>> >> > Linz hasn't been refuted. Or you can make a tiny change to H_Hat so that
>> >> > it is no longer a Turing machine.
>> >> Forgive my laziness. I haven't been following all of this conversation
>> >> between the showman and his coach (as I think you see it) so I am really
>> >> puzzled by what you mean by a Turing machine. You can't mean it
>> >> literally (H_Hat has been published and it's a C function with asm
>> >> directives) but I can't work out the non-literal meaning you have for
>> >> it.
>> >>
>> > We have this system. A computer with a command terminal, running a shell,
>> > and with so much memory that no "sane" program would ever exhaust it.
>> > It also has a C compiler, and a big red buton. When we press the button,
>> > it raises a signal that terminates the program, puts up the message "this
>> > program has terminated abormally" and returns control to the shell. We
>> > also have a function in the Clibrary called "raise_signal". Once raise_signal
>> > iis called, exactly the same signal is raised. There's no way for the software
>> > to distinguish them.
>> > Out "Turing machines" have a special state. When they enter it, raise_signal
>> > is called. We write H() so that, if it detects non-halting, it goes into this special
>> > state.
>>
>> What Turing machines? That's the bit I don't get. Putting scare quotes
>> round the words does not help -- I know you are using the term in some
>> metaphorical, way but I am not sure what attributes of TMs are being
>> referenced by the metaphor. The best I can come up with is that you
>> mean programs, but that is such an obvious word, I can't see why you
>> would avoid it.
>>
> I mean something with the facility to abort.
Turing machines don't have that.
>> > Now what happens if we call H() on "Hello world"? Obviously, it
>> > reports "halts".
>>
>> On a hello word function, I think you mean. The H that has been posted
>> here can't be called on programs.
>>
>> > Now what happens if we call on "while(1);" It reports "this program has
>> > terminated abormally?".
>>
>> It sets eax to 0, that's all that happens.
>>
>> What that means is up to PO (and you if you claim to know his intent)
>> and "this program has terminated abormally?" is truly a awful
>> description. First off "this program" is mighty confusing because "this
>> program" could reasonably be taken to be whatever program has called H
>> when the report is actually about some other computation.
>>
> "Abort is" exactly equivlalent to smashing the computer.
OK. So you want to limit your (and PO's) arguments to physical things
that can be smashed? If that not literal, how much of the smashing
metaphor is needed for the things you want limit the discussion to?
> That's what you don't
> seem to have taken on board. The program that called H no longer does anything,
> because the computer it runs on no longer exists.
I can't deal with this terminology. Halting is not about runnable
programs or hardware that can be hit. And if you make it so, you are
talking about something else. H has meaning when there are no machines
left in the world. H(H_Hat, H_Hat) can still be wrong when we are back
in the stone age.
>> To see the other reasons why this the wrong phrase we need to see H:
>>
>> void H(u32 M, u32 N)
>> {
>> if (DebugTrace(M, N))
>> MOV_EAX_0
>> else
>> MOV_EAX_1
>> HALT
>> }
>>
>> Now we can see that "program" is the wrong abstraction. What is "under
>> test" is a computation: M(N). Further, the word "has" is wrong because
>> M(N) is not run and usually won't have any logic for abnormal
>> termination. At best it is simulated and/or single-stepped with other
>> code used to determine whether to stop the simulation or stepping. Thus
>> "was terminated" is a better phrase.
>>
> H smashes the machine when DebugTrace returns a detected non-halt.
> It doesen't abort M.
Whether H is right about H_Hat(H_Hat) is not conditional on the
existence of any hardware at all. And if it is, you are talking about
some other as yet undefined problem.
>> Also, the abnormality pertains to the simulation, if at all, and not to
>> M(N) which will usually have no abnormal termination logic. (But
>> frankly, the term is just a distraction.)
>>
>> Finally, what's with the question mark?
>>
> Typo.
>>
>> So what would be a better thing to say? How about "M(N) not found to
>> halt"? This describes the meaning without tying the code so some
>> particular method.
>>
> Of course that would be better. But then a clever person can construct
> a case we can'r decide. By smashing the machine, we prevent that from
> happening.
The case that H gets wrong is just a piece of software. No machine is
needed for H to be wrong about H_Hat.
What happens if H and H_Hat are written in a well-specified language
with no compiler? What is the significance of actual hardware running
the code in any of this?
>> So H divides it's inputs into two classes: those that are found to halt
>> and those that are not. It's a classical partial halt decider.
>>
> No, H returns if the input is found to halt. Otherwise the machine
> breaks.
So you really are limiting the discussion to programs running on real
hardware? When the last computer stops working, what is the state of
your version of the halting problem? I guess the problem simple stops
meaning anything even though there are people who still know what the
program texts mean. What an odd point of view.
Anyway, you want to think about some non-mathematical version of halting
all bound up with chips and hammers. I don't know what that halting
problem is. The state of the program would have to include the minds of
the people standing round with the hammers. I can't connect it to the
halting problem nor to PO's recent writing.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-25 00:45 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <07a2fc11-3e8b-4463-8a96-1ca58a00f980n@googlegroups.com> |
| In reply to | #24372 |
On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > "Abort is" exactly equivlalent to smashing the computer. > OK. So you want to limit your (and PO's) arguments to physical things > that can be smashed? If that not literal, how much of the smashing > metaphor is needed for the things you want limit the discussion to? > The mistake you are making is that if H aborts, you can somehow capture that and suppress or invert it. Then its not an abort. To make that obvious, I say abort means "smash the machine".
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-25 09:35 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <b5adnQzw2aHWEAjCnZ2dnUU7-bPNnZ2d@giganews.com> |
| In reply to | #24377 |
On 10/25/2020 2:45 AM, Malcolm McLean wrote:
> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>
>>> "Abort is" exactly equivlalent to smashing the computer.
>> OK. So you want to limit your (and PO's) arguments to physical things
>> that can be smashed? If that not literal, how much of the smashing
>> metaphor is needed for the things you want limit the discussion to?
>>
> The mistake you are making is that if H aborts, you can somehow capture that
> and suppress or invert it. Then its not an abort.
> To make that obvious, I say abort means "smash the machine".
>
We could say that the computer is smashed so that H_Hat() cannot do the
opposite of what the halt decider decided.
We also could say that the process containing H_Hat() has been aborted
and its memory has been released so that H_Hat() cannot do the opposite
of what the halt decider decided.
And we can finally say that the Universal Turing Machine (UTM) halt
decider that was executing the H_Hat() UTM simply stops executing it so
that H_Hat() cannot do the opposite of what the halt decider decided.
In each of these three cases H_Hat() cannot possibly do the opposite of
whatever the halt decider decides as it always does in each of the
conventional self-referential halting problem proof counter-examples.
When the halt decider makes its {true,false} halting decision:
Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
The program under test is no longer executing.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-25 07:39 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <67fa5186-e432-4802-930e-f5b0b8dfe655n@googlegroups.com> |
| In reply to | #24381 |
On Sunday, 25 October 2020 at 14:36:03 UTC, olcott wrote:
> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
> > On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
> >> Malcolm McLean <malcolm.ar...@gmail.com> writes:
> >
> >>> "Abort is" exactly equivlalent to smashing the computer.
> >> OK. So you want to limit your (and PO's) arguments to physical things
> >> that can be smashed? If that not literal, how much of the smashing
> >> metaphor is needed for the things you want limit the discussion to?
> >>
> > The mistake you are making is that if H aborts, you can somehow capture that
> > and suppress or invert it. Then its not an abort.
> > To make that obvious, I say abort means "smash the machine".
> >
> We could say that the computer is smashed so that H_Hat() cannot do the
> opposite of what the halt decider decided.
>
That's it in a nutshell.
>
> We also could say that the process containing H_Hat() has been aborted
> and its memory has been released so that H_Hat() cannot do the opposite
> of what the halt decider decided.
>
> And we can finally say that the Universal Turing Machine (UTM) halt
> decider that was executing the H_Hat() UTM simply stops executing it so
> that H_Hat() cannot do the opposite of what the halt decider decided.
>
> In each of these three cases H_Hat() cannot possibly do the opposite of
> whatever the halt decider decides as it always does in each of the
> conventional self-referential halting problem proof counter-examples.
>
> When the halt decider makes its {true,false} halting decision:
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
> The program under test is no longer executing.
>
And H is no longer executing either. That's the crucial step.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-25 10:33 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <svKdndHutJ1BBwjCnZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #24382 |
On 10/25/2020 9:39 AM, Malcolm McLean wrote:
> On Sunday, 25 October 2020 at 14:36:03 UTC, olcott wrote:
>> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>
>>>>> "Abort is" exactly equivlalent to smashing the computer.
>>>> OK. So you want to limit your (and PO's) arguments to physical things
>>>> that can be smashed? If that not literal, how much of the smashing
>>>> metaphor is needed for the things you want limit the discussion to?
>>>>
>>> The mistake you are making is that if H aborts, you can somehow capture that
>>> and suppress or invert it. Then its not an abort.
>>> To make that obvious, I say abort means "smash the machine".
>>>
>> We could say that the computer is smashed so that H_Hat() cannot do the
>> opposite of what the halt decider decided.
>>
> That's it in a nutshell.
>>
>> We also could say that the process containing H_Hat() has been aborted
>> and its memory has been released so that H_Hat() cannot do the opposite
>> of what the halt decider decided.
>>
>> And we can finally say that the Universal Turing Machine (UTM) halt
>> decider that was executing the H_Hat() UTM simply stops executing it so
>> that H_Hat() cannot do the opposite of what the halt decider decided.
>>
>> In each of these three cases H_Hat() cannot possibly do the opposite of
>> whatever the halt decider decides as it always does in each of the
>> conventional self-referential halting problem proof counter-examples.
>>
>> When the halt decider makes its {true,false} halting decision:
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>> The program under test is no longer executing.
>>
> And H is no longer executing either. That's the crucial step.
>
When the halt decider has already terminated the execution of its
program under test, then this PUT cannot possibly implement the
conventional trick of doing the opposite of whatever the halt decider
decides.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-25 12:14 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <IvhlH.300669$r25.161300@fx08.iad> |
| In reply to | #24381 |
On 10/25/20 10:35 AM, olcott wrote:
> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>>>> "Abort is" exactly equivlalent to smashing the computer.
>>> OK. So you want to limit your (and PO's) arguments to physical things
>>> that can be smashed? If that not literal, how much of the smashing
>>> metaphor is needed for the things you want limit the discussion to?
>>>
>> The mistake you are making is that if H aborts, you can somehow
>> capture that
>> and suppress or invert it. Then its not an abort.
>> To make that obvious, I say abort means "smash the machine".
>>
>
> We could say that the computer is smashed so that H_Hat() cannot do the
> opposite of what the halt decider decided.
>
> We also could say that the process containing H_Hat() has been aborted
> and its memory has been released so that H_Hat() cannot do the opposite
> of what the halt decider decided.
>
> And we can finally say that the Universal Turing Machine (UTM) halt
> decider that was executing the H_Hat() UTM simply stops executing it so
> that H_Hat() cannot do the opposite of what the halt decider decided.
>
> In each of these three cases H_Hat() cannot possibly do the opposite of
> whatever the halt decider decides as it always does in each of the
> conventional self-referential halting problem proof counter-examples.
>
> When the halt decider makes its {true,false} halting decision:
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
> The program under test is no longer executing.
>
Or we could say that the argument has nothing to do with what a
classical Halt Decider does.
When the Decider stop executing the input program H_Hat(H_Hat) and
reports that H_Hat(H_Hat) needed to be aborted in order to complete, the
outer machine that called the decider and takes that results and Halts,
showing the answer to be WRONG, it did not need to be aborted, but was
able to complete within a finite execution.
If the Halt Decider chooses to not return its answer to its caller, it
has also failed in its requirements to be a Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-25 13:42 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] |
| Message-ID | <5sadnUmJLoaHWgjCnZ2dnUU7-KvNnZ2d@giganews.com> |
| In reply to | #24395 |
On 10/25/2020 11:14 AM, Richard Damon wrote:
> On 10/25/20 10:35 AM, olcott wrote:
>> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>
>>>>> "Abort is" exactly equivlalent to smashing the computer.
>>>> OK. So you want to limit your (and PO's) arguments to physical things
>>>> that can be smashed? If that not literal, how much of the smashing
>>>> metaphor is needed for the things you want limit the discussion to?
>>>>
>>> The mistake you are making is that if H aborts, you can somehow
>>> capture that
>>> and suppress or invert it. Then its not an abort.
>>> To make that obvious, I say abort means "smash the machine".
>>>
>>
>> We could say that the computer is smashed so that H_Hat() cannot do the
>> opposite of what the halt decider decided.
>>
>> We also could say that the process containing H_Hat() has been aborted
>> and its memory has been released so that H_Hat() cannot do the opposite
>> of what the halt decider decided.
>>
>> And we can finally say that the Universal Turing Machine (UTM) halt
>> decider that was executing the H_Hat() UTM simply stops executing it so
>> that H_Hat() cannot do the opposite of what the halt decider decided.
>>
>> In each of these three cases H_Hat() cannot possibly do the opposite of
>> whatever the halt decider decides as it always does in each of the
>> conventional self-referential halting problem proof counter-examples.
>>
>> When the halt decider makes its {true,false} halting decision:
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>> The program under test is no longer executing.
>>
>
> Or we could say that the argument has nothing to do with what a
> classical Halt Decider does.
We don't need any classical false presumptions and preconceived notions
all we need is a function that divides its input into:
(a) Would not halt unless aborted.
(b) Has already halted.
Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
> When the Decider stop executing the input program H_Hat(H_Hat) and
> reports that H_Hat(H_Hat) needed to be aborted in order to complete, the
> outer machine that called the decider and takes that results and Halts,
> showing the answer to be WRONG, it did not need to be aborted, but was
> able to complete within a finite execution.
You can keep ignoring what I say yet simply ignoring what I say does not
form any rebuttal what-so-ever.
Likewise you can read what I say yet simply say that you believe that it
is incorrect and this also forms no rebuttal what-so-ever.
The following code specifies three entirely different instances of
H_Hat() that each have very different amounts of data.
Failing to believe this is also no rebuttal what-so-ever.
I will soon have code that shows this.
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 outermost H_Hat() receives a return value of true from its
invocation of Aborted_Because_Non_Halting_Behavior_Detected(M, M).
The innermost H_Hat() shows that H_Hat() is infinitely recursive when it
calls Aborted_Because_Non_Halting_Behavior_Detected(M, M).
This causes the outermost
Aborted_Because_Non_Halting_Behavior_Detected(M, M) to abort its inner
H_Hat() which terminates the whole process tree that was created and
executed from this inner H_Hat().
Only the outermost Aborted_Because_Non_Halting_Behavior_Detected(M, M)
has a long enough execution trace to "see" that H_Hat() called
Aborted_Because_Non_Halting_Behavior_Detected(M, M) twice from the same
machine address without any conditional code in H_Hat() to terminate
this infinite recursion. // The 2018-12-13 @ 7:00 PM solution
The middle H_Hat() (of three) has its process terminated before its
separate, distinct instance of
Aborted_Because_Non_Halting_Behavior_Detected(M, M)
ever returns a value.
So when we are answering the question:
Would the input to a halt decider have to have its execution terminated
to prevent its infinite execution?
The answer of YES always means that the input has non-halting behavior.
(a) H(H_Hat, H_Hat) // YES
(b) H_Hat(H_Hat) // H_Hat() is not a halt decider
> If the Halt Decider chooses to not return its answer to its caller, it
> has also failed in its requirements to be a Halt Decider.
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-25 16:55 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] |
| Message-ID | <8DllH.289563$bQ4.148719@fx04.iad> |
| In reply to | #24408 |
On 10/25/20 2:42 PM, olcott wrote:
> On 10/25/2020 11:14 AM, Richard Damon wrote:
>> On 10/25/20 10:35 AM, olcott wrote:
>>> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>>>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>
>>>>>> "Abort is" exactly equivlalent to smashing the computer.
>>>>> OK. So you want to limit your (and PO's) arguments to physical things
>>>>> that can be smashed? If that not literal, how much of the smashing
>>>>> metaphor is needed for the things you want limit the discussion to?
>>>>>
>>>> The mistake you are making is that if H aborts, you can somehow
>>>> capture that
>>>> and suppress or invert it. Then its not an abort.
>>>> To make that obvious, I say abort means "smash the machine".
>>>>
>>>
>>> We could say that the computer is smashed so that H_Hat() cannot do the
>>> opposite of what the halt decider decided.
>>>
>>> We also could say that the process containing H_Hat() has been aborted
>>> and its memory has been released so that H_Hat() cannot do the opposite
>>> of what the halt decider decided.
>>>
>>> And we can finally say that the Universal Turing Machine (UTM) halt
>>> decider that was executing the H_Hat() UTM simply stops executing it so
>>> that H_Hat() cannot do the opposite of what the halt decider decided.
>>>
>>> In each of these three cases H_Hat() cannot possibly do the opposite of
>>> whatever the halt decider decides as it always does in each of the
>>> conventional self-referential halting problem proof counter-examples.
>>>
>>> When the halt decider makes its {true,false} halting decision:
>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>>> The program under test is no longer executing.
>>>
>>
>> Or we could say that the argument has nothing to do with what a
>> classical Halt Decider does.
>
> We don't need any classical false presumptions and preconceived notions
> all we need is a function that divides its input into:
> (a) Would not halt unless aborted.
> (b) Has already halted.
>
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>
>> When the Decider stop executing the input program H_Hat(H_Hat) and
>> reports that H_Hat(H_Hat) needed to be aborted in order to complete, the
>> outer machine that called the decider and takes that results and Halts,
>> showing the answer to be WRONG, it did not need to be aborted, but was
>> able to complete within a finite execution.
>
> You can keep ignoring what I say yet simply ignoring what I say does not
> form any rebuttal what-so-ever.
>
> Likewise you can read what I say yet simply say that you believe that it
> is incorrect and this also forms no rebuttal what-so-ever.
>
> The following code specifies three entirely different instances of
> H_Hat() that each have very different amounts of data.
>
> Failing to believe this is also no rebuttal what-so-ever.
> I will soon have code that shows this.
>
> 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 outermost H_Hat() receives a return value of true from its
> invocation of Aborted_Because_Non_Halting_Behavior_Detected(M, M).
>
> The innermost H_Hat() shows that H_Hat() is infinitely recursive when it
> calls Aborted_Because_Non_Halting_Behavior_Detected(M, M).
>
> This causes the outermost
> Aborted_Because_Non_Halting_Behavior_Detected(M, M) to abort its inner
> H_Hat() which terminates the whole process tree that was created and
> executed from this inner H_Hat().
>
> Only the outermost Aborted_Because_Non_Halting_Behavior_Detected(M, M)
> has a long enough execution trace to "see" that H_Hat() called
> Aborted_Because_Non_Halting_Behavior_Detected(M, M) twice from the same
> machine address without any conditional code in H_Hat() to terminate
> this infinite recursion. // The 2018-12-13 @ 7:00 PM solution
>
> The middle H_Hat() (of three) has its process terminated before its
> separate, distinct instance of
> Aborted_Because_Non_Halting_Behavior_Detected(M, M)
> ever returns a value.
>
> So when we are answering the question:
> Would the input to a halt decider have to have its execution terminated
> to prevent its infinite execution?
>
> The answer of YES always means that the input has non-halting behavior.
> (a) H(H_Hat, H_Hat) // YES
> (b) H_Hat(H_Hat) // H_Hat() is not a halt decider
>
>
>
>
>> If the Halt Decider chooses to not return its answer to its caller, it
>> has also failed in its requirements to be a Halt Decider.
>>
>
>
What you don't seem to realize or are refusing to face is WHY the
halting problem, as originally stated, is useful, and why your revised
version, is not.
This also likely relates to your attempts to get around Godel's
incompleteness, as it is very related.
Turning machines, by their structure, are somewhat easy to reason about,
and derive theorems about their computational capability, even though
they are impossible to build exactly, and impractical to use in their
realizable approximation, because there has been established
relationships between what can be computed on a Turning Machine, and
other types of computing machines. This allows us to describe algorithms
to run in a more convenient form that has computational equivalence to a
Turning machine, and then make arguments about that Turing machine,
without needed to actually convert the algorithm into a Turning Machine.
For instance, if we could make a true Halting Decider, we could use it
to prove or disprove Fermat's last Theorem by writing a simple Turning
machine that in an outer loop counted n from 3 to infinity, and provided
this as an input to an inner loop machine run through the Halt Decider
that checked all pair a, b and stopped if it was ever able to find a
pair for which existed an integer c such that a^n+b^n=c^n
The outer machine halting when ever it found the counter example.
From everything you have stated, your Abort Detector is not going to be
able to detect the need to abort this function, except perhaps just
because the numbers got too big and you ran out of memory, which doesn't
mean that no solution exists, it just establishes a lower bound for a
solution.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-25 16:07 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] |
| Message-ID | <OZednR8EcsaKdAjCnZ2dnUU7-eHNnZ2d@giganews.com> |
| In reply to | #24422 |
On 10/25/2020 3:55 PM, Richard Damon wrote:
> On 10/25/20 2:42 PM, olcott wrote:
>> On 10/25/2020 11:14 AM, Richard Damon wrote:
>>> On 10/25/20 10:35 AM, olcott wrote:
>>>> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>>>>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>>
>>>>>>> "Abort is" exactly equivlalent to smashing the computer.
>>>>>> OK. So you want to limit your (and PO's) arguments to physical things
>>>>>> that can be smashed? If that not literal, how much of the smashing
>>>>>> metaphor is needed for the things you want limit the discussion to?
>>>>>>
>>>>> The mistake you are making is that if H aborts, you can somehow
>>>>> capture that
>>>>> and suppress or invert it. Then its not an abort.
>>>>> To make that obvious, I say abort means "smash the machine".
>>>>>
>>>>
>>>> We could say that the computer is smashed so that H_Hat() cannot do the
>>>> opposite of what the halt decider decided.
>>>>
>>>> We also could say that the process containing H_Hat() has been aborted
>>>> and its memory has been released so that H_Hat() cannot do the opposite
>>>> of what the halt decider decided.
>>>>
>>>> And we can finally say that the Universal Turing Machine (UTM) halt
>>>> decider that was executing the H_Hat() UTM simply stops executing it so
>>>> that H_Hat() cannot do the opposite of what the halt decider decided.
>>>>
>>>> In each of these three cases H_Hat() cannot possibly do the opposite of
>>>> whatever the halt decider decides as it always does in each of the
>>>> conventional self-referential halting problem proof counter-examples.
>>>>
>>>> When the halt decider makes its {true,false} halting decision:
>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>>>> The program under test is no longer executing.
>>>>
>>>
>>> Or we could say that the argument has nothing to do with what a
>>> classical Halt Decider does.
>>
>> We don't need any classical false presumptions and preconceived notions
>> all we need is a function that divides its input into:
>> (a) Would not halt unless aborted.
>> (b) Has already halted.
>>
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>>
>>> When the Decider stop executing the input program H_Hat(H_Hat) and
>>> reports that H_Hat(H_Hat) needed to be aborted in order to complete, the
>>> outer machine that called the decider and takes that results and Halts,
>>> showing the answer to be WRONG, it did not need to be aborted, but was
>>> able to complete within a finite execution.
>>
>> You can keep ignoring what I say yet simply ignoring what I say does not
>> form any rebuttal what-so-ever.
>>
>> Likewise you can read what I say yet simply say that you believe that it
>> is incorrect and this also forms no rebuttal what-so-ever.
>>
>> The following code specifies three entirely different instances of
>> H_Hat() that each have very different amounts of data.
>>
>> Failing to believe this is also no rebuttal what-so-ever.
>> I will soon have code that shows this.
>>
>> 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 outermost H_Hat() receives a return value of true from its
>> invocation of Aborted_Because_Non_Halting_Behavior_Detected(M, M).
>>
>> The innermost H_Hat() shows that H_Hat() is infinitely recursive when it
>> calls Aborted_Because_Non_Halting_Behavior_Detected(M, M).
>>
>> This causes the outermost
>> Aborted_Because_Non_Halting_Behavior_Detected(M, M) to abort its inner
>> H_Hat() which terminates the whole process tree that was created and
>> executed from this inner H_Hat().
>>
>> Only the outermost Aborted_Because_Non_Halting_Behavior_Detected(M, M)
>> has a long enough execution trace to "see" that H_Hat() called
>> Aborted_Because_Non_Halting_Behavior_Detected(M, M) twice from the same
>> machine address without any conditional code in H_Hat() to terminate
>> this infinite recursion. // The 2018-12-13 @ 7:00 PM solution
>>
>> The middle H_Hat() (of three) has its process terminated before its
>> separate, distinct instance of
>> Aborted_Because_Non_Halting_Behavior_Detected(M, M)
>> ever returns a value.
>>
>> So when we are answering the question:
>> Would the input to a halt decider have to have its execution terminated
>> to prevent its infinite execution?
>>
>> The answer of YES always means that the input has non-halting behavior.
>> (a) H(H_Hat, H_Hat) // YES
>> (b) H_Hat(H_Hat) // H_Hat() is not a halt decider
>>
>>
>>
>>
>>> If the Halt Decider chooses to not return its answer to its caller, it
>>> has also failed in its requirements to be a Halt Decider.
>>>
>>
>>
>
> What you don't seem to realize or are refusing to face is WHY the
> halting problem, as originally stated, is useful, and why your revised
> version, is not.
>
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
Every syntactically correct machine description can be divided into
(a) HAS_INFINITE_EXECUTION
(b) DOES_NOT_HAVE_INFINITE_EXECUTION
I have as I have claimed correctly refuted the conventional
self-referential halting problem proofs.
There are no inputs that can be shown to be undecidable.
There are no inputs that can be shown to be undecidable.
There are no inputs that can be shown to be undecidable.
There are no inputs that can be shown to be undecidable.
> This also likely relates to your attempts to get around Godel's
> incompleteness, as it is very related.
>
> Turning machines, by their structure, are somewhat easy to reason about,
> and derive theorems about their computational capability, even though
> they are impossible to build exactly, and impractical to use in their
> realizable approximation, because there has been established
> relationships between what can be computed on a Turning Machine, and
> other types of computing machines. This allows us to describe algorithms
> to run in a more convenient form that has computational equivalence to a
> Turning machine, and then make arguments about that Turing machine,
> without needed to actually convert the algorithm into a Turning Machine.
x86 language ≡ von Neumann architecture ≡ UTM
> For instance, if we could make a true Halting Decider, we could use it
> to prove or disprove Fermat's last Theorem by writing a simple Turning
> machine that in an outer loop counted n from 3 to infinity, and provided
> this as an input to an inner loop machine run through the Halt Decider
> that checked all pair a, b and stopped if it was ever able to find a
> pair for which existed an integer c such that a^n+b^n=c^n
>
> The outer machine halting when ever it found the counter example.
>
> From everything you have stated, your Abort Detector is not going to be
> able to detect the need to abort this function, except perhaps just
> because the numbers got too big and you ran out of memory, which doesn't
> mean that no solution exists, it just establishes a lower bound for a
> solution.
>
I have never said that I solved the halting problem.
I have always said that I have refuted the conventional self-referential
halting problem proofs.
I really have done that and no one can show otherwise.
I really have done that and no one can show otherwise.
I really have done that and no one can show otherwise.
I really have done that and no one can show otherwise.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-25 23:51 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation Key Details] |
| Message-ID | <87k0vd6ezo.fsf@bsb.me.uk> |
| In reply to | #24425 |
olcott <NoOne@NoWhere.com> writes: > bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) > > Every syntactically correct machine description can be divided into > (a) HAS_INFINITE_EXECUTION > (b) DOES_NOT_HAVE_INFINITE_EXECUTION > > I have as I have claimed correctly refuted the conventional > self-referential halting problem proofs. Nope. I won't repeat why. You ignored it last time. > There are no inputs that can be shown to be undecidable. > There are no inputs that can be shown to be undecidable. > There are no inputs that can be shown to be undecidable. > There are no inputs that can be shown to be undecidable. Everyone here knows that that is possible (or they should do). And no one here has any reason to doubt it's true for your a/b distinction above. There is no need to be a jerk about it. Rather than childishly repeating a meaningless mantra, you should step up and say in what ways your a/b distinction differs from halting. You have made it clear yours is not quite the same (it has to be), but you steadfastly refuse to say how. That's wise (since when you do come clean your claim will fall apart) but it makes you look shifty. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-25 17:26 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <5M-dna9o9K-oKAjCnZ2dnUU78bfNnZ2d@brightview.co.uk> |
| In reply to | #24381 |
On 25/10/2020 14:35, olcott wrote:
> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>>>> "Abort is" exactly equivlalent to smashing the computer.
>>> OK. So you want to limit your (and PO's) arguments to physical things
>>> that can be smashed? If that not literal, how much of the smashing
>>> metaphor is needed for the things you want limit the discussion to?
>>>
>> The mistake you are making is that if H aborts, you can somehow
>> capture that
>> and suppress or invert it. Then its not an abort.
>> To make that obvious, I say abort means "smash the machine".
>>
I still think you're confusing what PO means by "abort".
The only "abort" going on in any of PO's code is the following scenario:
Calculation A is running some emulation of another calculation B, and at
some point simply decides not to continue the emulating any further. In
this scenario PO says calculation A has "aborted" calculation B.
[Whether that's a conventional/good use of the term "abort" others can
decide.]
IMO it adds nothing to say "calculation A has smashed the emulated
machine running B", as this does not help explain anything - if anything
it invites the confusion that perhaps A has somehow smashed its own
machine! Calculation A can never "aborted" /itself/, and it continues
running after it aborts the calculation B. If A is H_Hat(H_Hat), then
the abort does not stop A from continuing and doing the opposite of what
the halt decider decided.
Of course, A could itself be an emulated calculation, and its emulator
could decide to "abort" it, but that's a different scenario. In any
case, an /outer level/ calculation H_Hat(H_Hat) (not emulated) /cannot/
be aborted in the PO sense, as there is nothing overseeing its execution
to decide to stop executing it. So it always "gets the chance" to do
the opposite of what the halt decider says.
>
> We could say that the computer is smashed so that H_Hat() cannot do the
> opposite of what the halt decider decided.
clearer: "the /emulated/ computer is smashed, so that the /emulated/
H_Hat() cannot..."
OK, the phrase "cannot" is also potentially misleading, along with the
use of phrases like "gets the chance" etc..
The [mathematically defined] "calculation" H_Hat(H_Hat) is what it is:
just the sequence of states [machine+data] that occur for the
calculation, from start state to halt state (or continuing indefinitely
if no halt state is ever reached). Think of it as a mathematically
defined sequence, fixed for a given H_Hat - a finite sequence if the
calculation halts, or else an infinite sequence. The concept of some
hardware or emulator physically "running" the code simply doesn't come
into the picture. (This is a definition that is clear and useful when
discussing the HP and the Linz proof.)
When the emulated machine is "smashed" (or the emulated calculation
"aborted"), it just means the emulator only decides to examine the
initial segment of the calculation up to the point where it had learned
enough, and then stopped looking. The /calculation/ H_Hat(H_Hat) itself
is unchanged by this. For example if the calculation H_Hat(H_Hat) is
non-halting, this is the case regardless of whether some code runs an
emulator examining the calculation and only looks at the first few steps
before going on to other things.
If there is a need to refer specifically to the initial sequence of
states examined by an emulator, a sensible term for that might be
"emulated calculation".
Best just say what is clear and correct: the emulator just looked at the
first few calculation steps then decided to stop looking.
>
> We also could say that the process containing H_Hat() has been aborted
> and its memory has been released so that H_Hat() cannot do the opposite
> of what the halt decider decided.
.. "the emulated proocess containing the emulated H_Hat()...so that the
emulated H_Hat calculation never reaches the point where..."
>
> And we can finally say that the Universal Turing Machine (UTM) halt
> decider that was executing the H_Hat() UTM simply stops executing it so
> that H_Hat() cannot do the opposite of what the halt decider decided.
>
Sprinkling UTM all over the place makes things worse IMO, although the
"simply stops executing it" is clear.
The all round best phrasing I can come up with is "the halt decider that
was emulating the H_Hat() calculation simply stops emulating it, so that
the emulated calculation never reaches the point where H_Hat does the
opposite of what its halt decider decided".
If the aim is to put UTM into the sentence, perhaps: "the halt decider
that was running its embedded UTM emulating the H_Hat() calculation
simply stops emulating it, so that the emulated calculation never
reaches the point where H_Hat does the opposite of what its halt decider
decided"
> In each of these three cases H_Hat() cannot possibly do the opposite of
> whatever the halt decider decides as it always does in each of the
> conventional self-referential halting problem proof counter-examples.
.. "the /emulated/ H_Hat(H_hat) calculation /never reaches the point
where/ it does the opposite of what its halt decider decided, as it does
in the full H_Hat(H_Hat) calculation of the HP proof counter-examples."
>
> When the halt decider makes its {true,false} halting decision:
> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
> The program under test is no longer executing.
Correct, but for Malcolm's benefit, the halt decider itself continues
running. It has not smashed its own machine. :)
Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-25 14:16 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <keGdndR0mqaLUgjCnZ2dnUU7-UnNnZ2d@giganews.com> |
| In reply to | #24403 |
On 10/25/2020 12:26 PM, Mike Terry wrote:
> On 25/10/2020 14:35, olcott wrote:
>> On 10/25/2020 2:45 AM, Malcolm McLean wrote:
>>> On Sunday, 25 October 2020 at 03:33:13 UTC, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>
>>>>> "Abort is" exactly equivlalent to smashing the computer.
>>>> OK. So you want to limit your (and PO's) arguments to physical things
>>>> that can be smashed? If that not literal, how much of the smashing
>>>> metaphor is needed for the things you want limit the discussion to?
>>>>
>>> The mistake you are making is that if H aborts, you can somehow
>>> capture that
>>> and suppress or invert it. Then its not an abort.
>>> To make that obvious, I say abort means "smash the machine".
>>>
>
> I still think you're confusing what PO means by "abort".
>
> The only "abort" going on in any of PO's code is the following scenario:
> Calculation A is running some emulation of another calculation B, and at
> some point simply decides not to continue the emulating any further. In
> this scenario PO says calculation A has "aborted" calculation B.
Yes that is precisely correct. When Malcolm says smashing the computer
he wants to make it completely clear that with the revised definition of
a halt decider the input program cannot possibly do the opposite of
whatever the halt decider decided.
If my example was implemented using an extension of the Turing Machine
Description language provided here:
http://www.lns.mit.edu/~dsw/turing/turing.html
An "aborted process" would merely mean that the UTM that is executing
its subordinate UTM one state transition at a time would stop executing
this subordinate UTM and transition to one of its own final states.
> [Whether that's a conventional/good use of the term "abort" others can
> decide.]
It is a very convetional computer science term. Everyone immediately
understands that an aborted process utterly ceases all execution.
> IMO it adds nothing to say "calculation A has smashed the emulated
> machine running B", as this does not help explain anything - if anything
It makes it clear for the people that do not know that the term "aborted
process" means that a process has utterly stopped all execution and
cannot possibly execute another step.
> it invites the confusion that perhaps A has somehow smashed its own
> machine! Calculation A can never "aborted" /itself/, and it continues
> running after it aborts the calculation B. If A is H_Hat(H_Hat), then
> the abort does not stop A from continuing and doing the opposite of what
> the halt decider decided.
>
Neither an aborted process, nor a smashed computer will ever execute
another step.
> Of course, A could itself be an emulated calculation, and its emulator
> could decide to "abort" it, but that's a different scenario. In any
> case, an /outer level/ calculation H_Hat(H_Hat) (not emulated) /cannot/
> be aborted in the PO sense, as there is nothing overseeing its execution
> to decide to stop executing it. So it always "gets the chance" to do
> the opposite of what the halt decider says.
No, not at all not in the least. Try and show a concrete example of this
and I will point out your false assumption.
The outermost H_Hat() is merely a broken version of H(). It is not a
halt decider. Anything that it does merely shows the halt deciders can
be created incorrectly.
>> We could say that the computer is smashed so that H_Hat() cannot do the
>> opposite of what the halt decider decided.
>
> clearer: "the /emulated/ computer is smashed, so that the /emulated/
> H_Hat() cannot..."
>
> OK, the phrase "cannot" is also potentially misleading, along with the
> use of phrases like "gets the chance" etc..
>
> The [mathematically defined] "calculation" H_Hat(H_Hat) is what it is:
> just the sequence of states [machine+data] that occur for the
> calculation, from start state to halt state (or continuing indefinitely
> if no halt state is ever reached). Think of it as a mathematically
> defined sequence, fixed for a given H_Hat - a finite sequence if the
> calculation halts, or else an infinite sequence. The concept of some
> hardware or emulator physically "running" the code simply doesn't come
> into the picture. (This is a definition that is clear and useful when
> discussing the HP and the Linz proof.)
>
> When the emulated machine is "smashed" (or the emulated calculation
> "aborted"), it just means the emulator only decides to examine the
> initial segment of the calculation up to the point where it had learned
> enough, and then stopped looking. The /calculation/ H_Hat(H_Hat) itself
> is unchanged by this. For example if the calculation H_Hat(H_Hat) is
> non-halting, this is the case regardless of whether some code runs an
> emulator examining the calculation and only looks at the first few steps
> before going on to other things.
>
> If there is a need to refer specifically to the initial sequence of
> states examined by an emulator, a sensible term for that might be
> "emulated calculation".
>
> Best just say what is clear and correct: the emulator just looked at the
> first few calculation steps then decided to stop looking.
>
>>
>> We also could say that the process containing H_Hat() has been aborted
>> and its memory has been released so that H_Hat() cannot do the opposite
>> of what the halt decider decided.
>
> .. "the emulated proocess containing the emulated H_Hat()...so that the
> emulated H_Hat calculation never reaches the point where..."
>
>>
>> And we can finally say that the Universal Turing Machine (UTM) halt
>> decider that was executing the H_Hat() UTM simply stops executing it so
>> that H_Hat() cannot do the opposite of what the halt decider decided.
>>
>
> Sprinkling UTM all over the place makes things worse IMO, although the
> "simply stops executing it" is clear.
The definition of my refutation of the halting problem proofs requires
that the halt decider execute its input one state transition at a time.
The ONLY TM that can execute another TM at all is a UTM.
When we are thinking of this in conventional terms it is simplest to
think of ever TM as a UTM so that the entire system only deals with
Turing machine Descriptions and never deals with any separate TM.
The universal language of x86utm is the x86 machine language that is
interpreted by an x86 emulator.
> The all round best phrasing I can come up with is "the halt decider that
> was emulating the H_Hat() calculation simply stops emulating it, so that
> the emulated calculation never reaches the point where H_Hat does the
> opposite of what its halt decider decided".
Perfect! That is the simplest way to say it for everyone that fully
understands these terms. Some people might not understand that "the
process has been aborted" to mean that the process will not execute any
more steps. These people might need the smashed computer analogy.
> If the aim is to put UTM into the sentence, perhaps: "the halt decider
> that was running its embedded UTM emulating the H_Hat() calculation
> simply stops emulating it, so that the emulated calculation never
> reaches the point where H_Hat does the opposite of what its halt decider
> decided"
Yes this is also perfect for everyone (like yourself) that fully
understands all these terms.
>> In each of these three cases H_Hat() cannot possibly do the opposite of
>> whatever the halt decider decides as it always does in each of the
>> conventional self-referential halting problem proof counter-examples.
>
> .. "the /emulated/ H_Hat(H_hat) calculation /never reaches the point
> where/ it does the opposite of what its halt decider decided, as it does
> in the full H_Hat(H_Hat) calculation of the HP proof counter-examples."
>
>>
>> When the halt decider makes its {true,false} halting decision:
>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I)
>> The program under test is no longer executing.
>
> Correct, but for Malcolm's benefit, the halt decider itself continues
> running. It has not smashed its own machine. :)
>
> Mike.
>
Actually no. The actual execution trace of H(H_Hat, H_Hat) or
H_Hat(H_Hat) has two different instances of the
Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) halt decider.
All of the processes that are executed in the x86utm master UTM process
context cannot be aborted. The second process instance of
Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) is executed
in the process context created to execute: (H_Hat, H_Hat).
This process context is aborted as soon as the outer process context of
x86utm Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat)
decides that H_Hat is infinitely recursive.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 16 of 25 — ← Prev page 1 … 14 15 [16] 17 18 … 25 Next page →
Back to top | Article view | comp.theory
csiph-web