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 8 of 25 — ← Prev page 1 … 6 7 [8] 9 10 … 25 Next page →
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-27 15:30 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <odidnTWLjPK6oAXCnZ2dnUU78N3NnZ2d@brightview.co.uk> |
| In reply to | #24518 |
On 27/10/2020 14:52, Malcolm McLean wrote:
> On Tuesday, 27 October 2020 at 14:31:03 UTC, Mike Terry wrote:
>> On 27/10/2020 10:53, André G. Isaak wrote:
>>> On 2020-10-26 15:57, olcott wrote:
>>>
>>>> If you were paying very close enough attention rather than merely
>>>> glancing at a few words here and there under the presumption that I
>>>> must be incorrect you would notice that none of the examples ever
>>>> showed a single case where:
>>>>
>>>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N)
>>>> ever returned an incorrect value for its input.
>>>
>>> Can we get you to commit the following more precise set of claims?
>>>
>>> (1) In every instance where its input would not halt when run
>>> independently, you ABNHBD function will always return 'non halting
>>> behavior detected - aborted'
>>>
>>> (2) In every instance where its input would halt when run independently,
>>> your ABNHBD will return 'terminated normally'
>>>
>>> (3) Your ABNHBD function is actually guaranteed to return one of the
>>> above two values for every input.
>>>
>>> André
>>>
>> This is what I've been trying to get PO to clarify in my last few posts.
>> He steadfastly declines to provide an actual specification for what
>> his ABNHDB() function, or even to clarify anything about what it does,
>> saying that he's given a "trace" that shows it making the right decision
>> (whatever that means!). (He refuses to say define what the "right
>> decision" is, when it's called with an input pair (Pgm, Data).)
>>
>> The most I've ever seen him say is that ABNHDB() steps through its input
>> program's execution until either it halts, or it "detects non-halting
>> behaviour", but he WON'T clarify "non-halting behaviour", even to the
>> point of saying whether a halting calculation P(I) can exhibit
>> non-halting behaviour! I think that's what you're trying to pin him
>> down on. (It's my focus anyway.)
>>
>> The problem with your questions as worded is that he can/will reply "my
>> decider isn't all-knowing, and it may not work with /every/ input".
>> Fine, we know it only has to work with his H_Hat(H_Hat) calculation.
>> All my attempts to get him to talk about that specific case come to nothing.
>>
>> Anyway, I suggest that your wording above will need to have filters
>> added so that it only talks about the one case his H actually has to
>> deal with. Also to avoid the "my code is not all-knowing" response,
>> perhaps (1) should say something like "ABNHDB() returns ABORTED for
>> input pair (H_Hat, H_Hat) only if it is the case that calculation
>> H_Hat(H_Hat) is non-halting" ... Hope you have more success than me!
>>
> Here's the code
Is this code from PO, or is it your code?
It is hard enough work dealing with PO, and I don't want to spend much
time on /your/ arguments, even if you believe you are making the same
argument as PO. If you feel that you have some insight into PO's
thinking, by all means respond to my posts saying what you think, but I
will probably not seriously engage with you. (I will read what you say
at least, and might respond sometimes.)
>
> int eax = 1; // seto to zero means "abort".
>
> int AbortedBecauseNonHaltingBehaviourDetected(char *M, char *N)
> {
> if (M == H_Hatsrc && N == H_Hatsrc)
> {
> // we know that this will cause an infinite recursion of debug traces if we
> // don't take action, so detect it and take action here
> eax = 0; // aborted
> return 1;
The problem here is that the input pair (H_Hat, H_Hat) actually DOESN'T
contain infinite recursion, if PO's H is indeed this code sample.
So ABNHBD(M, N) is aborting an input that actually halts. In fact, it's
not aborting anything, just saying that it's aborting something.
Nothing here refutes anything in the Linz proof, basically because it is
not related to the HALTING class that a halt decider is supposed to decide.
> }
> // a real halt decider would have to to more, but because we only need one case
> // we don't have to give the rest of the logic
> }
>
> void H_Hat(char *input)
> {
> if (!AbortedBecauseNonHaltingBehaviourDetected(input, input))
> while(1); // loop forever if not aborted
> }
>
> char *H_Hatsrc = "void H_Hat ..."; // Don't actually ned this because detect function is a stub.
>
> int main(void)
> {
> AbortedBecauseNonHaltingBehaviourDetected(H_Hatsrc, H_Hatsrc);
> if (eax == 0)
> printf("aborted\n");
> else
> printf("Not aborted\n");
>
> eax = 1; // reset
> H_Hat(H_Hatsrc);
> if (eax == 0)
> printf("aborted\n");
> else
> printf("not aborted\n");
> }
>
> Can't you see what PO is saying? The contradiction no longer exists when we change the function
> from "halts" to "AbortedBecauseNonHaltingBehaviourDetected.
>
But the Linz proof concerns deciding the class HALTING, not some vaguely
defined return code from a function with a really long name.
Anyone can write a function that gives a "guaranteed correct result"
[one which is not tied to the input pair (M,N)'s membership of HALTING
class] and use that to replace H's logic, and then there will be no
contradiction! That would just be crass.
E.g. just always return SPONGE for every input, where SPONGE is the
defined return code in that function's spec. (Duh.) This SPONGE decider
correctly decides membership of the class SPONGE_CALCULATIONS, which is
the class of all calculations. Nothing to do with HP...
So no, I don't see what PO is saying. He still professes to be talking
about the HP and the Linz proof.
Mike.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-27 08:45 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <9260ea00-68cd-4701-8ac0-ada906630cd6n@googlegroups.com> |
| In reply to | #24523 |
On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: > > > Here's the code > Is this code from PO, or is it your code? > > It is hard enough work dealing with PO, and I don't want to spend much > time on /your/ arguments, even if you believe you are making the same > argument as PO. If you feel that you have some insight into PO's > thinking, by all means respond to my posts saying what you think, but I > will probably not seriously engage with you. (I will read what you say > at least, and might respond sometimes.) > It's my code. But based on what PO posted. The key difference is that PO hasn't realised that you can stub the detector / abort function, because it is a function and it only has to deal with an input set with one member. To be fair, this isn't obvious because the input set makes reference to the function itself. You yourself seem to have made this error. You forgot the word "if". It will cause an infinite recursion IF we don't take action. But we do take action. To make this a bit more obvious, replace if (M == H_Hatsrc && N == Hatsrc) with if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) That has the same effect, but now it's clearer that we're detecting what would be an infinite recursion, and taking action against it. I'm trying to get an insight into why PO is convinced that he has refuted the Linz proof. I might be wrong - I'm not him, I can't read his mind, and he's not been entirely consistent. But I think I've identified it.
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-27 16:05 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <2ZydnfoEc9zF2AXCnZ2dnUU78bPNnZ2d@brightview.co.uk> |
| In reply to | #24524 |
On 27/10/2020 15:45, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >> >>> Here's the code >> Is this code from PO, or is it your code? >> >> It is hard enough work dealing with PO, and I don't want to spend much >> time on /your/ arguments, even if you believe you are making the same >> argument as PO. If you feel that you have some insight into PO's >> thinking, by all means respond to my posts saying what you think, but I >> will probably not seriously engage with you. (I will read what you say >> at least, and might respond sometimes.) >> > It's my code. But based on what PO posted. The key difference is that PO > hasn't realised that you can stub the detector / abort function, because > it is a function and it only has to deal with an input set with one member. > > To be fair, this isn't obvious because the input set makes reference to > the function itself. You yourself seem to have made this error. You forgot > the word "if". It will cause an infinite recursion IF we don't take action. > But we do take action. You mean the "if" in "..*If* none of the instances of its recursive invocation were aborted then H_Hat(H_Hat) would never terminate." I have not overlooked that if, you might like to read my post (Tue, 27 Oct 2020 15:56:41 +0000) to save me repeating it in full here. That "if" is a source of confusion, and doesn't mean what most people would think it means. Specifically, it DOESN'T mean that if we ran H_Hat(H_Hat) outside of an emulator (so there is no "aborting" of /this/ calculation) the H_Hat(H_Hat) would exhibit infinite recursion. And yes, I understand what "infinite recursion" refers to, and there is none of it in H_Hat(H_Hat) !!! (Clarified in the post I referenced...) > > To make this a bit more obvious, replace > if (M == H_Hatsrc && N == Hatsrc) > with > if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) > > That has the same effect, but now it's clearer that we're detecting > what would be an infinite recursion, and taking action against it. > > I'm trying to get an insight into why PO is convinced that he has refuted > the Linz proof. I might be wrong - I'm not him, I can't read his mind, and > he's not been entirely consistent. But I think I've identified it. >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 11:05 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <QM-dnXd6lMf42AXCnZ2dnUU7-d_NnZ2d@giganews.com> |
| In reply to | #24524 |
On 10/27/2020 10:45 AM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >> >>> Here's the code >> Is this code from PO, or is it your code? >> >> It is hard enough work dealing with PO, and I don't want to spend much >> time on /your/ arguments, even if you believe you are making the same >> argument as PO. If you feel that you have some insight into PO's >> thinking, by all means respond to my posts saying what you think, but I >> will probably not seriously engage with you. (I will read what you say >> at least, and might respond sometimes.) >> > It's my code. But based on what PO posted. The key difference is that PO > hasn't realised that you can stub the detector / abort function, because > it is a function and it only has to deal with an input set with one member. > > To be fair, this isn't obvious because the input set makes reference to > the function itself. You yourself seem to have made this error. You forgot > the word "if". It will cause an infinite recursion IF we don't take action. > But we do take action. > > To make this a bit more obvious, replace > if (M == H_Hatsrc && N == Hatsrc) > with > if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) > > That has the same effect, but now it's clearer that we're detecting > what would be an infinite recursion, and taking action against it. > > I'm trying to get an insight into why PO is convinced that he has refuted > the Linz proof. I might be wrong - I'm not him, I can't read his mind, and > he's not been entirely consistent. But I think I've identified it. > The Linz proof** claims to have proved the the halting problem is undecidable. It has not actually proved this. All of these proofs merely show one architectural design of a halt decider that gets the wrong answer some of the time. My architectural design of a halt decider cannot be shown to get the wrong answer any of the time. ** And all of the conventional self-referential halting problem proofs. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-27 09:53 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <abf717fa-38c7-4b24-be53-0930c8426544n@googlegroups.com> |
| In reply to | #24528 |
On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: > On 10/27/2020 10:45 AM, Malcolm McLean wrote: > > On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: > >> > >>> Here's the code > >> Is this code from PO, or is it your code? > >> > >> It is hard enough work dealing with PO, and I don't want to spend much > >> time on /your/ arguments, even if you believe you are making the same > >> argument as PO. If you feel that you have some insight into PO's > >> thinking, by all means respond to my posts saying what you think, but I > >> will probably not seriously engage with you. (I will read what you say > >> at least, and might respond sometimes.) > >> > > It's my code. But based on what PO posted. The key difference is that PO > > hasn't realised that you can stub the detector / abort function, because > > it is a function and it only has to deal with an input set with one member. > > > > To be fair, this isn't obvious because the input set makes reference to > > the function itself. You yourself seem to have made this error. You forgot > > the word "if". It will cause an infinite recursion IF we don't take action. > > But we do take action. > > > > To make this a bit more obvious, replace > > if (M == H_Hatsrc && N == Hatsrc) > > with > > if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) > > > > That has the same effect, but now it's clearer that we're detecting > > what would be an infinite recursion, and taking action against it. > > > > I'm trying to get an insight into why PO is convinced that he has refuted > > the Linz proof. I might be wrong - I'm not him, I can't read his mind, and > > he's not been entirely consistent. But I think I've identified it. > > > The Linz proof** claims to have proved the the halting problem is > undecidable. It has not actually proved this. All of these proofs merely > show one architectural design of a halt decider that gets the wrong > answer some of the time. My architectural design of a halt decider > cannot be shown to get the wrong answer any of the time. > > ** And all of the conventional self-referential halting problem proofs. > I'm not quite sure what you've shown yet because you haven't been absolutely clear. Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be stubbed to deal only with the input H_Hat, H_Hat? Or does this change somethin fundamental?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 13:36 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <eeadnQAbUKYi9QXCnZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #24530 |
On 10/27/2020 11:53 AM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: >> On 10/27/2020 10:45 AM, Malcolm McLean wrote: >>> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >>>> >>>>> Here's the code >>>> Is this code from PO, or is it your code? >>>> >>>> It is hard enough work dealing with PO, and I don't want to spend much >>>> time on /your/ arguments, even if you believe you are making the same >>>> argument as PO. If you feel that you have some insight into PO's >>>> thinking, by all means respond to my posts saying what you think, but I >>>> will probably not seriously engage with you. (I will read what you say >>>> at least, and might respond sometimes.) >>>> >>> It's my code. But based on what PO posted. The key difference is that PO >>> hasn't realised that you can stub the detector / abort function, because >>> it is a function and it only has to deal with an input set with one member. >>> >>> To be fair, this isn't obvious because the input set makes reference to >>> the function itself. You yourself seem to have made this error. You forgot >>> the word "if". It will cause an infinite recursion IF we don't take action. >>> But we do take action. >>> >>> To make this a bit more obvious, replace >>> if (M == H_Hatsrc && N == Hatsrc) >>> with >>> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) >>> >>> That has the same effect, but now it's clearer that we're detecting >>> what would be an infinite recursion, and taking action against it. >>> >>> I'm trying to get an insight into why PO is convinced that he has refuted >>> the Linz proof. I might be wrong - I'm not him, I can't read his mind, and >>> he's not been entirely consistent. But I think I've identified it. >>> >> The Linz proof** claims to have proved the the halting problem is >> undecidable. It has not actually proved this. All of these proofs merely >> show one architectural design of a halt decider that gets the wrong >> answer some of the time. My architectural design of a halt decider >> cannot be shown to get the wrong answer any of the time. >> >> ** And all of the conventional self-referential halting problem proofs. >> > I'm not quite sure what you've shown yet because you haven't been absolutely > clear. > Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be > stubbed to deal only with the input H_Hat, H_Hat? Or does this change > somethin fundamental? It is no good to merely stub this function when the complete description of the execution trace showing exactly how (H_Hat, H_Hat) is decided correctly has already been provided. Instead of a stub function we could simply assume that: bool Aborted_Because_Non_Halting_Behavior_Detected(u32 N, u32 M); always returns a correct result meaning that it: "only aborts its input and returns true when it detects the non halting behavior of its input" and otherwise returns false. Then we try to do the same thing as the conventional halting problem proofs and see if there is any input that it cannot correctly decide. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-27 12:05 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <5deef067-2d08-4592-a87b-0f6578f8678an@googlegroups.com> |
| In reply to | #24534 |
On Tuesday, 27 October 2020 at 18:36:55 UTC, olcott wrote: > On 10/27/2020 11:53 AM, Malcolm McLean wrote: > > On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: > >> On 10/27/2020 10:45 AM, Malcolm McLean wrote: > >>> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: > >>>> > >>>>> Here's the code > >>>> Is this code from PO, or is it your code? > >>>> > >>>> It is hard enough work dealing with PO, and I don't want to spend much > >>>> time on /your/ arguments, even if you believe you are making the same > >>>> argument as PO. If you feel that you have some insight into PO's > >>>> thinking, by all means respond to my posts saying what you think, but I > >>>> will probably not seriously engage with you. (I will read what you say > >>>> at least, and might respond sometimes.) > >>>> > >>> It's my code. But based on what PO posted. The key difference is that PO > >>> hasn't realised that you can stub the detector / abort function, because > >>> it is a function and it only has to deal with an input set with one member. > >>> > >>> To be fair, this isn't obvious because the input set makes reference to > >>> the function itself. You yourself seem to have made this error. You forgot > >>> the word "if". It will cause an infinite recursion IF we don't take action. > >>> But we do take action. > >>> > >>> To make this a bit more obvious, replace > >>> if (M == H_Hatsrc && N == Hatsrc) > >>> with > >>> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) > >>> > >>> That has the same effect, but now it's clearer that we're detecting > >>> what would be an infinite recursion, and taking action against it. > >>> > >>> I'm trying to get an insight into why PO is convinced that he has refuted > >>> the Linz proof. I might be wrong - I'm not him, I can't read his mind, and > >>> he's not been entirely consistent. But I think I've identified it. > >>> > >> The Linz proof** claims to have proved the the halting problem is > >> undecidable. It has not actually proved this. All of these proofs merely > >> show one architectural design of a halt decider that gets the wrong > >> answer some of the time. My architectural design of a halt decider > >> cannot be shown to get the wrong answer any of the time. > >> > >> ** And all of the conventional self-referential halting problem proofs. > >> > > I'm not quite sure what you've shown yet because you haven't been absolutely > > clear. > > Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be > > stubbed to deal only with the input H_Hat, H_Hat? Or does this change > > somethin fundamental? > It is no good to merely stub this function when the complete description > of the execution trace showing exactly how (H_Hat, H_Hat) is decided > correctly has already been provided. > > Instead of a stub function we could simply assume that: > bool Aborted_Because_Non_Halting_Behavior_Detected(u32 N, u32 M); > always returns a correct result meaning that it: > > "only aborts its input and returns true when it detects the non halting > behavior of its input" and otherwise returns false. > I think you need to stub the function. People need some concrete code to reason about. But let's see if anyone else agrees that thhis would be a way forwards. > > Then we try to do the same thing as the conventional halting problem > proofs and see if there is any input that it cannot correctly decide. > As I understand it, instead of HALTS / RUNSFOREVER it returns HALTS / ABORTED. We can explore the difference.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 14:44 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <sJidnZrphpko5QXCnZ2dnUU7-ImdnZ2d@giganews.com> |
| In reply to | #24536 |
On 10/27/2020 2:05 PM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 18:36:55 UTC, olcott wrote: >> On 10/27/2020 11:53 AM, Malcolm McLean wrote: >>> On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: >>>> On 10/27/2020 10:45 AM, Malcolm McLean wrote: >>>>> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >>>>>> >>>>>>> Here's the code >>>>>> Is this code from PO, or is it your code? >>>>>> >>>>>> It is hard enough work dealing with PO, and I don't want to spend much >>>>>> time on /your/ arguments, even if you believe you are making the same >>>>>> argument as PO. If you feel that you have some insight into PO's >>>>>> thinking, by all means respond to my posts saying what you think, but I >>>>>> will probably not seriously engage with you. (I will read what you say >>>>>> at least, and might respond sometimes.) >>>>>> >>>>> It's my code. But based on what PO posted. The key difference is that PO >>>>> hasn't realised that you can stub the detector / abort function, because >>>>> it is a function and it only has to deal with an input set with one member. >>>>> >>>>> To be fair, this isn't obvious because the input set makes reference to >>>>> the function itself. You yourself seem to have made this error. You forgot >>>>> the word "if". It will cause an infinite recursion IF we don't take action. >>>>> But we do take action. >>>>> >>>>> To make this a bit more obvious, replace >>>>> if (M == H_Hatsrc && N == Hatsrc) >>>>> with >>>>> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) >>>>> >>>>> That has the same effect, but now it's clearer that we're detecting >>>>> what would be an infinite recursion, and taking action against it. >>>>> >>>>> I'm trying to get an insight into why PO is convinced that he has refuted >>>>> the Linz proof. I might be wrong - I'm not him, I can't read his mind, and >>>>> he's not been entirely consistent. But I think I've identified it. >>>>> >>>> The Linz proof** claims to have proved the the halting problem is >>>> undecidable. It has not actually proved this. All of these proofs merely >>>> show one architectural design of a halt decider that gets the wrong >>>> answer some of the time. My architectural design of a halt decider >>>> cannot be shown to get the wrong answer any of the time. >>>> >>>> ** And all of the conventional self-referential halting problem proofs. >>>> >>> I'm not quite sure what you've shown yet because you haven't been absolutely >>> clear. >>> Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be >>> stubbed to deal only with the input H_Hat, H_Hat? Or does this change >>> somethin fundamental? >> It is no good to merely stub this function when the complete description >> of the execution trace showing exactly how (H_Hat, H_Hat) is decided >> correctly has already been provided. >> >> Instead of a stub function we could simply assume that: >> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 N, u32 M); >> always returns a correct result meaning that it: >> >> "only aborts its input and returns true when it detects the non halting >> behavior of its input" and otherwise returns false. >> > I think you need to stub the function. People need some concrete code > to reason about. But let's see if anyone else agrees that thhis would be > a way forwards. >> >> Then we try to do the same thing as the conventional halting problem >> proofs and see if there is any input that it cannot correctly decide. >> > As I understand it, instead of HALTS / RUNSFOREVER it returns > HALTS / ABORTED. We can explore the difference. > New thread: (explores the difference) [Architectural design of a halting problem solution] -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-27 16:05 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <B4%lH.242381$d95.153022@fx06.iad> |
| In reply to | #24536 |
On 10/27/20 3:05 PM, Malcolm McLean wrote: > I think you need to stub the function. People need some concrete code > to reason about. But let's see if anyone else agrees that thhis would be > a way forwards. He can't have the stub, because he needs to blame the simulation of H_Hat for giving the decider difficulties onto H_Hat itself. Of course, it is the deciders own fault that it couldn't do it, not the code of H_Hat, so the only 'infinite execution' that potentially occurred was in the decider, which isn't allowed infinite execution.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-28 03:41 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <87d01310gm.fsf@bsb.me.uk> |
| In reply to | #24536 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > As I understand it, instead of HALTS / RUNSFOREVER it returns > HALTS / ABORTED. We can explore the difference. Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate confusion, and lets write C(r) for the set of computations that result in a particular return code. C(HALTS) are all (and only) the halting computations. C(RUNSFOREVER) are all (and only) the non-halting computations. If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names because we must also have C(HALTS) = C(NOT_ABORTED). Despite the fact that much of what PO has written about the internals his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has been clear that they are not equal (that's the "re-definition of the problem" part). However, all attempts to get him to say which computations are either in C(ABORTED) but not in C(RUNSFOREVER), or which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. These questions are only asked to get him to see (or admit) what he's really doing. I don't think anyone cares about exactly what sort of almost-halt decider he actually plans to write. There is a separate argument about the specific claim that he can provide two programs or functions, H and H_Hat, related to each other as in Linz, where H(H_Hat, H_Hat) reports the correct answer about the halting/non-halting of H_Hat(H_Hat). His suggested H and H_Hat fail in this regard. PO has less now than he said he had two years ago when he (untruthfully) claimed to have two actual Turing machines, exactly and precisely as in Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). (Here, because the claim is about fully encoded Turing machines, I've written the claim as it should be written -- in terms of encoded machines [...] and encoded pairs <...>.) There's been the most extraordinary amount of hot air about nothing. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-28 02:57 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <c7ecd51b-5b65-4b59-8cd0-2143304fdbb7n@googlegroups.com> |
| In reply to | #24560 |
On Wednesday, 28 October 2020 at 03:41:33 UTC, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > > As I understand it, instead of HALTS / RUNSFOREVER it returns > > HALTS / ABORTED. We can explore the difference. > Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate > confusion, and lets write C(r) for the set of computations that result > in a particular return code. > > C(HALTS) are all (and only) the halting computations. > C(RUNSFOREVER) are all (and only) the non-halting computations. > > If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names > because we must also have C(HALTS) = C(NOT_ABORTED). > > Despite the fact that much of what PO has written about the internals > his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has > been clear that they are not equal (that's the "re-definition of the > problem" part). However, all attempts to get him to say which > computations are either in C(ABORTED) but not in C(RUNSFOREVER), or > which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. > I've suggested a difference between C(ABORTED) and C(RUNSFOREVER) which indeed allows you to claim that the results are self-consistent. However it doesn't seem to have been taken up. I can try to understand where PO is coming from, but ultimately I cannot speak for him. > > These questions are only asked to get him to see (or admit) what he's > really doing. I don't think anyone cares about exactly what sort of > almost-halt decider he actually plans to write. > With my solution, although you do indeed provide a counter-example to the Linz proof, really what you are doing is exposing that the proof only applies to deciders which are Turing machines. And it's possible to trivially modify the proof to show that the halt-decider element of the almost-halt decider has a case it can't decide. > > There is a separate argument about the specific claim that he can > provide two programs or functions, H and H_Hat, related to each other as > in Linz, where H(H_Hat, H_Hat) reports the correct answer about the > halting/non-halting of H_Hat(H_Hat). His suggested H and H_Hat fail in > this regard. > It's unclear whether PO regards Aborted_Because_Non_Halting_Behaviour_Detected to be sufficiently similar to H as to be effectively H for the purpose of refuting Linz, or if it is a component of H. We haven't actually had a H, H_Hat pair. I've suggested stubbing Aborted_Beacuse_Non_Halting_Behaviour_Detected, but the suggestion hasn't been taken up. > > PO has less now than he said he had two years ago when he (untruthfully) > claimed to have two actual Turing machines, exactly and precisely as in > Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). > (Here, because the claim is about fully encoded Turing machines, I've > written the claim as it should be written -- in terms of encoded > machines [...] and encoded pairs <...>.) > Two actual Turing machines would be more impressive. If you make H subtly different from a Turing machine, then Linz's proof doesn't apply. > > There's been the most extraordinary amount of hot air about nothing. > I think that at root what PO is doing and why he's convinced that he has refuted Linz is quite simple. However other people don't agree with me.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-28 15:54 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <87pn52z6pj.fsf@bsb.me.uk> |
| In reply to | #24568 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Wednesday, 28 October 2020 at 03:41:33 UTC, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >> > As I understand it, instead of HALTS / RUNSFOREVER it returns >> > HALTS / ABORTED. We can explore the difference. >> Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate >> confusion, and lets write C(r) for the set of computations that result >> in a particular return code. >> >> C(HALTS) are all (and only) the halting computations. >> C(RUNSFOREVER) are all (and only) the non-halting computations. >> >> If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names >> because we must also have C(HALTS) = C(NOT_ABORTED). >> >> Despite the fact that much of what PO has written about the internals >> his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has >> been clear that they are not equal (that's the "re-definition of the >> problem" part). However, all attempts to get him to say which >> computations are either in C(ABORTED) but not in C(RUNSFOREVER), or >> which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. >> > I've suggested a difference between C(ABORTED) and C(RUNSFOREVER) > which indeed allows you to claim that the results are self-consistent. Yes. The trouble is that self-consistency was not the issue, correctness (as to halting) was. > However it doesn't seem to have been taken up. I can try to understand > where PO is coming from, but ultimately I cannot speak for him. >> These questions are only asked to get him to see (or admit) what he's >> really doing. I don't think anyone cares about exactly what sort of >> almost-halt decider he actually plans to write. >> > With my solution, although you do indeed provide a counter-example to the > Linz proof, really what you are doing is exposing that the proof only applies > to deciders which are Turing machines. That's an odd, and somewhat misleading, way of putting it. A proof always only applies to the things it talks about, so you can't have a counterexample in C-like code, even if it never raises a signal. The proof is only about TMs. But the proof structure applies to all reasonable models of computation. A similar proof can be produced for any other formal model of computation, including one that that looks exactly like C with signals. In that model, your C code just fails to give the right answer about the halting of H_Hat(H_Hat). It doesn't even pretend to decide halting, so it would not be a counterargument to the key part of the proof. <cut> > It's unclear whether PO regards > Aborted_Because_Non_Halting_Behaviour_Detected to be sufficiently > similar to H as to be effectively H for the purpose of refuting Linz, > or if it is a component of H. We haven't actually had a H, H_Hat pair. Yes, he's not keen on details. It would help his case (and avoid some side arguments) if H_Hat were to call, reference or include H in some way as in the usual proof stricture. But since H just calls the function with the silly name, and indicates it's result (using a silly mechanism) we can forgive this omission. > suggested stubbing Aborted_Beacuse_Non_Halting_Behaviour_Detected, but the > suggestion hasn't been taken up. >> >> PO has less now than he said he had two years ago when he (untruthfully) >> claimed to have two actual Turing machines, exactly and precisely as in >> Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). >> (Here, because the claim is about fully encoded Turing machines, I've >> written the claim as it should be written -- in terms of encoded >> machines [...] and encoded pairs <...>.) >> > Two actual Turing machines would be more impressive. If you make H subtly > different from a Turing machine, then Linz's proof doesn't apply. At the time, I (and others), suggested he use something else as the formal model. Almost anything would better than a Turing machine, and it would be just as impressive: H and H_Hat in Haskell or Scheme (a modern Lisp) for example, and both are, out of the box, Turing complete notations. Even, at a pinch, C with some abstract extensions like unbounded integer types or address types would work. >> There's been the most extraordinary amount of hot air about nothing. >> > I think that at root what PO is doing and why he's convinced that he has > refuted Linz is quite simple. However other people don't agree with > me. Your explanations don't tie up with his history on this topic. All this recent x86 junk is simply there to draw fire from the fact that he does not have what he claimed he had two years ago. As recently as yesterday I saw a claim that he has not yet written the "key decider code" but that it would be very soon now. He's never had anything substantive, but it's getting harder to avoid showing something, so he's put all the magic into a mysterious function he won't show or specify. Even then it's all falling apart. It's generous or you to have worked so hard to find interpretation of what he is doing that is not an outright deceit. I struggle to find one. All he has is an idea that there must be something wrong because he does not like the result. That's not a bad feeling to start with -- maybe Gödel started out thinking there must be something wrong about the mechanical view of arithmetical truth -- but when that is combined with delusions of superior intellect, perspicacity or dedication, the result is not helpful. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-28 09:25 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <8e07c137-ba43-4b42-9841-a7b575000f18o@googlegroups.com> |
| In reply to | #24574 |
On Wednesday, October 28, 2020 at 8:54:53 AM UTC-7, Ben Bacarisse wrote: > Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > > > On Wednesday, 28 October 2020 at 03:41:33 UTC, Ben Bacarisse wrote: > >> Malcolm McLean <malcolm.ar...@gmail.com> writes: > >> > >> > As I understand it, instead of HALTS / RUNSFOREVER it returns > >> > HALTS / ABORTED. We can explore the difference. > >> Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate > >> confusion, and lets write C(r) for the set of computations that result > >> in a particular return code. > >> > >> C(HALTS) are all (and only) the halting computations. > >> C(RUNSFOREVER) are all (and only) the non-halting computations. > >> > >> If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names > >> because we must also have C(HALTS) = C(NOT_ABORTED). > >> > >> Despite the fact that much of what PO has written about the internals > >> his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has > >> been clear that they are not equal (that's the "re-definition of the > >> problem" part). However, all attempts to get him to say which > >> computations are either in C(ABORTED) but not in C(RUNSFOREVER), or > >> which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. > >> > > I've suggested a difference between C(ABORTED) and C(RUNSFOREVER) > > which indeed allows you to claim that the results are self-consistent. > > Yes. The trouble is that self-consistency was not the issue, > correctness (as to halting) was. > > > However it doesn't seem to have been taken up. I can try to understand > > where PO is coming from, but ultimately I cannot speak for him. > > >> These questions are only asked to get him to see (or admit) what he's > >> really doing. I don't think anyone cares about exactly what sort of > >> almost-halt decider he actually plans to write. > >> > > With my solution, although you do indeed provide a counter-example to the > > Linz proof, really what you are doing is exposing that the proof only applies > > to deciders which are Turing machines. > > That's an odd, and somewhat misleading, way of putting it. A proof > always only applies to the things it talks about, so you can't have a > counterexample in C-like code, even if it never raises a signal. The > proof is only about TMs. > > But the proof structure applies to all reasonable models of computation. > A similar proof can be produced for any other formal model of > computation, including one that that looks exactly like C with signals. > In that model, your C code just fails to give the right answer about the > halting of H_Hat(H_Hat). It doesn't even pretend to decide halting, so > it would not be a counterargument to the key part of the proof. > > <cut> > > It's unclear whether PO regards > > Aborted_Because_Non_Halting_Behaviour_Detected to be sufficiently > > similar to H as to be effectively H for the purpose of refuting Linz, > > or if it is a component of H. We haven't actually had a H, H_Hat pair. > > Yes, he's not keen on details. It would help his case (and avoid some > side arguments) if H_Hat were to call, reference or include H in some > way as in the usual proof stricture. But since H just calls the > function with the silly name, and indicates it's result (using a > silly mechanism) we can forgive this omission. > > > suggested stubbing Aborted_Beacuse_Non_Halting_Behaviour_Detected, but the > > suggestion hasn't been taken up. > >> > >> PO has less now than he said he had two years ago when he (untruthfully) > >> claimed to have two actual Turing machines, exactly and precisely as in > >> Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). > >> (Here, because the claim is about fully encoded Turing machines, I've > >> written the claim as it should be written -- in terms of encoded > >> machines [...] and encoded pairs <...>.) > >> > > Two actual Turing machines would be more impressive. If you make H subtly > > different from a Turing machine, then Linz's proof doesn't apply. > > At the time, I (and others), suggested he use something else as the > formal model. Almost anything would better than a Turing machine, and > it would be just as impressive: H and H_Hat in Haskell or Scheme (a > modern Lisp) for example, and both are, out of the box, Turing complete > notations. Even, at a pinch, C with some abstract extensions like > unbounded integer types or address types would work. > > >> There's been the most extraordinary amount of hot air about nothing. > >> > > I think that at root what PO is doing and why he's convinced that he has > > refuted Linz is quite simple. However other people don't agree with > > me. > > Your explanations don't tie up with his history on this topic. All this > recent x86 junk is simply there to draw fire from the fact that he does > not have what he claimed he had two years ago. As recently as yesterday > I saw a claim that he has not yet written the "key decider code" but > that it would be very soon now. He's never had anything substantive, > but it's getting harder to avoid showing something, so he's put all the > magic into a mysterious function he won't show or specify. Even then > it's all falling apart. It's generous or you to have worked so hard to > find interpretation of what he is doing that is not an outright > deceit. I struggle to find one. > > All he has is an idea that there must be something wrong because he does > not like the result. That's not a bad feeling to start with -- maybe > Gödel started out thinking there must be something wrong about the > mechanical view of arithmetical truth -- but when that is combined with > delusions of superior intellect, perspicacity or dedication, the result > is not helpful. I may be responsible for PO's use of comp.theory. I was working on getting him out of sci.lang (He has some weird ideas about natural language too.) I started replying to him in comp.theory and not in sci.lang. I'm a Google Groups user and can't crosspost anyway. So. whatever you do, don't reply in any of the language groups. Better yet don't reply at all.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-28 18:31 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <VbKdncSdWaHKYgTCnZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #24568 |
On 10/28/2020 4:57 AM, Malcolm McLean wrote: > On Wednesday, 28 October 2020 at 03:41:33 UTC, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >>> As I understand it, instead of HALTS / RUNSFOREVER it returns >>> HALTS / ABORTED. We can explore the difference. >> Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate >> confusion, and lets write C(r) for the set of computations that result >> in a particular return code. >> >> C(HALTS) are all (and only) the halting computations. >> C(RUNSFOREVER) are all (and only) the non-halting computations. >> >> If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names >> because we must also have C(HALTS) = C(NOT_ABORTED). >> >> Despite the fact that much of what PO has written about the internals >> his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has >> been clear that they are not equal (that's the "re-definition of the >> problem" part). However, all attempts to get him to say which >> computations are either in C(ABORTED) but not in C(RUNSFOREVER), or >> which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. >> > I've suggested a difference between C(ABORTED) and C(RUNSFOREVER) > which indeed allows you to claim that the results are self-consistent. > However it doesn't seem to have been taken up. I can try to understand > where PO is coming from, but ultimately I cannot speak for him. >> >> These questions are only asked to get him to see (or admit) what he's >> really doing. I don't think anyone cares about exactly what sort of >> almost-halt decider he actually plans to write. >> > With my solution, although you do indeed provide a counter-example to the > Linz proof, really what you are doing is exposing that the proof only applies > to deciders which are Turing machines. And it's possible to trivially modify > the proof to show that the halt-decider element of the almost-halt decider > has a case it can't decide. I defined a NON_HALTING decider that always Accepts NON_HALTING input and Rejects HALTING input. The NON_HALTING decider UTM executes its subordinate UTM one state transition at a time until it detects non-halting behavior or its subordinate UTM has terminated normally. If the halt decider UTM detects non-halting behavior of its subordinate UTM it simply stops executing the subordinate and transitions to its own final state of ABORTED_NON_TERMINATING_BEHAVIOR. If the subordinate UTM terminates normally the halt decider UTM transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >> There is a separate argument about the specific claim that he can >> provide two programs or functions, H and H_Hat, related to each other as >> in Linz, where H(H_Hat, H_Hat) reports the correct answer about the >> halting/non-halting of H_Hat(H_Hat). His suggested H and H_Hat fail in >> this regard. >> > It's unclear whether PO regards Aborted_Because_Non_Halting_Behaviour_Detected > to be sufficiently similar to H as to be effectively H for the purpose of refuting > Linz, or if it is a component of H. We haven't actually had a H, H_Hat pair. I've > suggested stubbing Aborted_Beacuse_Non_Halting_Behaviour_Detected, but the > suggestion hasn't been taken up. Maybe my latest words are easier to understand (see above). >> PO has less now than he said he had two years ago when he (untruthfully) >> claimed to have two actual Turing machines, exactly and precisely as in >> Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). >> (Here, because the claim is about fully encoded Turing machines, I've >> written the claim as it should be written -- in terms of encoded >> machines [...] and encoded pairs <...>.) >> > Two actual Turing machines would be more impressive. If you make H subtly > different from a Turing machine, then Linz's proof doesn't apply. Not having random access makes Turing machines much more tedious than mowing five acres of grass with finger nail clippers. x86 language ≡ von Neumann architecture ≡ UTM >> >> There's been the most extraordinary amount of hot air about nothing. >> > I think that at root what PO is doing and why he's convinced that he has > refuted Linz is quite simple. However other people don't agree with me. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-29 00:02 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <87pn51yk4t.fsf@bsb.me.uk> |
| In reply to | #24582 |
olcott <NoOne@NoWhere.com> writes: > On 10/28/2020 4:57 AM, Malcolm McLean wrote: <cut> >> With my solution, although you do indeed provide a counter-example to the >> Linz proof, really what you are doing is exposing that the proof only applies >> to deciders which are Turing machines. And it's possible to trivially modify >> the proof to show that the halt-decider element of the almost-halt decider >> has a case it can't decide. > > I defined a NON_HALTING decider that always Accepts NON_HALTING input > and Rejects HALTING input. And again you are vague! It's not clear if this is deliberate or simply a consequence of the fact that you have trouble being precise. >> Two actual Turing machines would be more impressive. If you make H subtly >> different from a Turing machine, then Linz's proof doesn't apply. > > Not having random access makes Turing machines much more tedious than > mowing five acres of grass with finger nail clippers. But you've already done all the work. You had them "fully encoded" two years ago. They would avoid all ambiguity. Except of course you never did have them. That's what the last two years of back-peddling have all been about. > x86 language ≡ von Neumann architecture ≡ UTM No. A UTM is a Turing machine. And it's universal. And its input is an encoded TM computation. The first are mote true of "x86 language", and the third could be true of an x86 program but is not true for yours. (And you are using the equivalence symbol poetically. While the x86 is a von Neumann architecture, the reverse is not true.) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 07:55 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <IaWdna0UhKw2JgfCnZ2dnUU7-RPNnZ2d@giganews.com> |
| In reply to | #24584 |
On 10/28/2020 7:02 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/28/2020 4:57 AM, Malcolm McLean wrote: > <cut> >>> With my solution, although you do indeed provide a counter-example to the >>> Linz proof, really what you are doing is exposing that the proof only applies >>> to deciders which are Turing machines. And it's possible to trivially modify >>> the proof to show that the halt-decider element of the almost-halt decider >>> has a case it can't decide. >> >> I defined a NON_HALTING decider that always Accepts NON_HALTING input >> and Rejects HALTING input. > > And again you are vague! It's not clear if this is deliberate or simply > a consequence of the fact that you have trouble being precise. This is not vague: Intuitively, a decider should be a Turing machine that given an input, halts and either accepts or rejects, relaying its answer in one of many equivalent ways, such as halting at an ACCEPT or REJECT state, or leaving its answer on the output tape.Yuval Filmus https://cs.stackexchange.com/questions/84433/what-is-decider Yuval Filmus top 0.04% overall Assistant Professor in the Department of Computer Science at the Technion. A non-halting decider can be defined that always Accepts NON_HALTING input and Rejects HALTING input as follows: The NON_HALTING decider UTM executes its subordinate TM/UTM one state transition at a time until it detects non-halting behavior or its subordinate UTM has terminated normally. If the halt decider UTM detects non-halting behavior of its subordinate TM/UTM it simply stops executing the subordinate and transitions to its own final state of NON_TERMINATING_BEHAVIOR_DETECTED. If the subordinate TM/UTM terminates normally the halt decider UTM transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >>> Two actual Turing machines would be more impressive. If you make H subtly >>> different from a Turing machine, then Linz's proof doesn't apply. >> >> Not having random access makes Turing machines much more tedious than >> mowing five acres of grass with finger nail clippers. > > But you've already done all the work. You had them "fully encoded" two > years ago. They would avoid all ambiguity. Except of course you never > did have them. That's what the last two years of back-peddling have all > been about. > >> x86 language ≡ von Neumann architecture ≡ UTM > > No. A UTM is a Turing machine. And it's universal. And its input is > an encoded TM computation. The first are mote true of "x86 language", > and the third could be true of an x86 program but is not true for yours. > > (And you are using the equivalence symbol poetically. While the x86 is > a von Neumann architecture, the reverse is not true.) > x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded (infinite in capacity); whether the number of registers is finite is model-specific. Thus the RASP is to the RAM as the Universal Turing machine is to the Turing machine. The RASP is an example of the von Neumann architecture whereas the RAM is an example of the Harvard architecture. https://en.wikipedia.org/wiki/Random-access_stored-program_machine -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-29 09:28 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <hszmH.763305$AN2.650740@fx46.iad> |
| In reply to | #24600 |
On 10/29/20 8:55 AM, olcott wrote: >> > > This is not vague: > Intuitively, a decider should be a Turing machine that given an input, > halts and either accepts or rejects, relaying its answer in one of many > equivalent ways, such as halting at an ACCEPT or REJECT state, or > leaving its answer on the output tape.Yuval Filmus > > https://cs.stackexchange.com/questions/84433/what-is-decider > > Yuval Filmus top 0.04% overall Assistant Professor in the Department of > Computer Science at the Technion. > > A non-halting decider can be defined that always Accepts NON_HALTING > input and Rejects HALTING input as follows: > > The NON_HALTING decider UTM executes its subordinate TM/UTM one state > transition at a time until it detects non-halting behavior or its > subordinate UTM has terminated normally. > > If the halt decider UTM detects non-halting behavior of its subordinate > TM/UTM it simply stops executing the subordinate and transitions to its > own final state of NON_TERMINATING_BEHAVIOR_DETECTED. > > If the subordinate TM/UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which is the core issue that has been problem that has been proven to not be possible to build for the universal case. Yes, you can detect a number of cases of detectable non-halting behavior, but some Machine/Input combinations are not decidable as to if they will halt or not. Basically, YOUR definition of a Halting Decider just went into infinite recursion of definition, so until you can provide a non-recursive definition of this non-halting behavior detection, you don't have a detector.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 10:49 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <PM-dnemqwOc5eQfCnZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #24607 |
On 10/29/2020 8:28 AM, Richard Damon wrote:
> On 10/29/20 8:55 AM, olcott wrote:
>>>
>>
>> This is not vague:
>> Intuitively, a decider should be a Turing machine that given an input,
>> halts and either accepts or rejects, relaying its answer in one of many
>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>> leaving its answer on the output tape.Yuval Filmus
>>
>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>
>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>> Computer Science at the Technion.
>>
>> A non-halting decider can be defined that always Accepts NON_HALTING
>> input and Rejects HALTING input as follows:
>>
>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>> transition at a time until it detects non-halting behavior or its
>> subordinate UTM has terminated normally.
>>
>> If the halt decider UTM detects non-halting behavior of its subordinate
>> TM/UTM it simply stops executing the subordinate and transitions to its
>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>
>> If the subordinate TM/UTM terminates normally the halt decider UTM
>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>
> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
> is the core issue that has been problem that has been proven to not be
> possible to build for the universal case.
Yet if you are paying attention to what I am saying you will see that
the conventional halting problem trick cannot possibly be applied to do
the opposite of what ever the halt decider decides because in my
definition of a halt decider the first thing that the halt decider does
to indicate its decision is to terminate the execution of the input program.
This have been reviewed for more tan one week on there have been no
correct rebuttals.
> Yes, you can detect a number of cases of detectable non-halting
> behavior, but some Machine/Input combinations are not decidable as to if
> they will halt or not.
You cannot use examples of undecided problems and called them
undecidable. These example remain undecided and thus not undecidable.
You can imagine a program that never repeats the same state and never
halts. As soon as you prove that such an example exists you have made it
decidable.
> Basically, YOUR definition of a Halting Decider just went into infinite
> recursion of definition, so until you can provide a non-recursive
> definition of this non-halting behavior detection, you don't have a
> detector.
>
Not at all and not in the least, Infinite recursion is one function
calling itself directly or through a sequence of other function calls
and there is no recursion termination condition in the execution trace
in-between.
void H_Hat(u32 P)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
MOV_EAX_1 // Execution of P(P) has been aborted
else
{
MOV_EAX_0 // P(P) has halted
HERE: goto HERE;
}
HALT
}
void H(u32 P, u32 I)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(P, I))
MOV_EAX_1 // Execution of P(I) has been aborted
else
MOV_EAX_0 // P(I) has halted
HALT
}
int main()
{
u32 P = (u32)H_Hat;
H(P, P);
HALT
}
When-so-ever any code executed by this function would not otherwise halt
unless this function stops executing it, the code has been decided to
have NON_TERMINATING_BEHAVIOR.
u32 Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-29 12:32 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <y8CmH.677093$eN2.527610@fx47.iad> |
| In reply to | #24614 |
On 10/29/20 11:49 AM, olcott wrote:
> On 10/29/2020 8:28 AM, Richard Damon wrote:
>> On 10/29/20 8:55 AM, olcott wrote:
>>>>
>>>
>>> This is not vague:
>>> Intuitively, a decider should be a Turing machine that given an input,
>>> halts and either accepts or rejects, relaying its answer in one of many
>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>> leaving its answer on the output tape.Yuval Filmus
>>>
>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>
>>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>>> Computer Science at the Technion.
>>>
>>> A non-halting decider can be defined that always Accepts NON_HALTING
>>> input and Rejects HALTING input as follows:
>>>
>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>>> transition at a time until it detects non-halting behavior or its
>>> subordinate UTM has terminated normally.
>>>
>>> If the halt decider UTM detects non-halting behavior of its subordinate
>>> TM/UTM it simply stops executing the subordinate and transitions to its
>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>>
>>> If the subordinate TM/UTM terminates normally the halt decider UTM
>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>
>> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
>> is the core issue that has been problem that has been proven to not be
>> possible to build for the universal case.
>
> Yet if you are paying attention to what I am saying you will see that
> the conventional halting problem trick cannot possibly be applied to do
> the opposite of what ever the halt decider decides because in my
> definition of a halt decider the first thing that the halt decider does
> to indicate its decision is to terminate the execution of the input
> program.
>
> This have been reviewed for more tan one week on there have been no
> correct rebuttals.
>
You OBVIOUSLY are reading a different feed then I am, as almost
universally people people are finding flaws in your work,
>> Yes, you can detect a number of cases of detectable non-halting
>> behavior, but some Machine/Input combinations are not decidable as to if
>> they will halt or not.
>
> You cannot use examples of undecided problems and called them
> undecidable. These example remain undecided and thus not undecidable.
I can use a very decided problem and give them to your machine and it
will not be able to correctly decide on them, at least from every thing
you have said.
My H_Hat2 that always halts after using H(H_Hat2, H_Hat2) will be
decided as 'aborted' when it clearly doesn't
>
> You can imagine a program that never repeats the same state and never
> halts. As soon as you prove that such an example exists you have made it
> decidable.
Yes, you can make the proof that it will never halt, but your machine
will not be able to get the answer.
A halt decider machine that can only tell you if the machine will halt
or not if you already know the answer is WORTHLESS. If that is really
your basis, then you are in the wrong field.
>
>> Basically, YOUR definition of a Halting Decider just went into infinite
>> recursion of definition, so until you can provide a non-recursive
>> definition of this non-halting behavior detection, you don't have a
>> detector.
>>
>
> Not at all and not in the least, Infinite recursion is one function
> calling itself directly or through a sequence of other function calls
> and there is no recursion termination condition in the execution trace
> in-between.
>
>
> void H_Hat(u32 P)
> {
> if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
> MOV_EAX_1 // Execution of P(P) has been aborted
> else
> {
> MOV_EAX_0 // P(P) has halted
> HERE: goto HERE;
> }
> HALT
> }
>
>
> void H(u32 P, u32 I)
> {
> if (Aborted_Because_Non_Halting_Behavior_Detected(P, I))
> MOV_EAX_1 // Execution of P(I) has been aborted
> else
> MOV_EAX_0 // P(I) has halted
> HALT
> }
>
>
> int main()
> {
> u32 P = (u32)H_Hat;
> H(P, P);
> HALT
> }
>
> When-so-ever any code executed by this function would not otherwise halt
> unless this function stops executing it, the code has been decided to
> have NON_TERMINATING_BEHAVIOR.
> u32 Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 12:41 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <ldSdnca0gN1cYwfCnZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #24621 |
On 10/29/2020 11:32 AM, Richard Damon wrote:
> On 10/29/20 11:49 AM, olcott wrote:
>> On 10/29/2020 8:28 AM, Richard Damon wrote:
>>> On 10/29/20 8:55 AM, olcott wrote:
>>>>>
>>>>
>>>> This is not vague:
>>>> Intuitively, a decider should be a Turing machine that given an input,
>>>> halts and either accepts or rejects, relaying its answer in one of many
>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>> leaving its answer on the output tape.Yuval Filmus
>>>>
>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>
>>>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>>>> Computer Science at the Technion.
>>>>
>>>> A non-halting decider can be defined that always Accepts NON_HALTING
>>>> input and Rejects HALTING input as follows:
>>>>
>>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>>>> transition at a time until it detects non-halting behavior or its
>>>> subordinate UTM has terminated normally.
>>>>
>>>> If the halt decider UTM detects non-halting behavior of its subordinate
>>>> TM/UTM it simply stops executing the subordinate and transitions to its
>>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>>>
>>>> If the subordinate TM/UTM terminates normally the halt decider UTM
>>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>>
>>> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
>>> is the core issue that has been problem that has been proven to not be
>>> possible to build for the universal case.
>>
>> Yet if you are paying attention to what I am saying you will see that
>> the conventional halting problem trick cannot possibly be applied to do
>> the opposite of what ever the halt decider decides because in my
>> definition of a halt decider the first thing that the halt decider does
>> to indicate its decision is to terminate the execution of the input
>> program.
>>
>> This have been reviewed for more tan one week on there have been no
>> correct rebuttals.
>>
>
> You OBVIOUSLY are reading a different feed then I am, as almost
> universally people people are finding flaws in your work,
Every "flaw" has been proved to be incorrect and then this proof is
simply ignored.
>>> Yes, you can detect a number of cases of detectable non-halting
>>> behavior, but some Machine/Input combinations are not decidable as to if
>>> they will halt or not.
>>
>> You cannot use examples of undecided problems and called them
>> undecidable. These example remain undecided and thus not undecidable.
>
> I can use a very decided problem and give them to your machine and it
> will not be able to correctly decide on them, at least from every thing
> you have said.
So you have a problem that has been provably decided and also provably
undecidable by a machine. At most this would simply show that software
technology has not caught up to the capability of the human mind.
> My H_Hat2 that always halts after using H(H_Hat2, H_Hat2) will be
> decided as 'aborted' when it clearly doesn't
Please give me the cite on this in a form like this:
On 10/29/2020 11:32 AM, Richard Damon wrote:
>>
>> You can imagine a program that never repeats the same state and never
>> halts. As soon as you prove that such an example exists you have made it
>> decidable.
>
> Yes, you can make the proof that it will never halt, but your machine
> will not be able to get the answer.
If there is any proof that it will never halt then the machine can use
this same proof making it decidable for this machine.
> A halt decider machine that can only tell you if the machine will halt
> or not if you already know the answer is WORTHLESS. If that is really
> your basis, then you are in the wrong field.
That is NOT my basis.
I have already provided my complete basis at least 20 times now:
A non-halting decider can be defined that always Accepts NON_HALTING
input and Rejects HALTING input as follows:
The NON_HALTING decider UTM executes its subordinate TM/UTM one state
transition at a time until it detects non-halting behavior or its
subordinate TM/UTM has terminated normally.
If the halt decider UTM detects non-halting behavior of its subordinate
TM/UTM it simply stops executing the subordinate and transitions to its
own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
If the subordinate TM/UTM terminates normally the halt decider UTM
transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>
>>> Basically, YOUR definition of a Halting Decider just went into infinite
>>> recursion of definition, so until you can provide a non-recursive
>>> definition of this non-halting behavior detection, you don't have a
>>> detector.
>>>
>>
>> Not at all and not in the least, Infinite recursion is one function
>> calling itself directly or through a sequence of other function calls
>> and there is no recursion termination condition in the execution trace
>> in-between.
>>
>>
>> void H_Hat(u32 P)
>> {
>> if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
>> MOV_EAX_1 // Execution of P(P) has been aborted
>> else
>> {
>> MOV_EAX_0 // P(P) has halted
>> HERE: goto HERE;
>> }
>> HALT
>> }
>>
>>
>> void H(u32 P, u32 I)
>> {
>> if (Aborted_Because_Non_Halting_Behavior_Detected(P, I))
>> MOV_EAX_1 // Execution of P(I) has been aborted
>> else
>> MOV_EAX_0 // P(I) has halted
>> HALT
>> }
>>
>>
>> int main()
>> {
>> u32 P = (u32)H_Hat;
>> H(P, P);
>> HALT
>> }
>>
>> When-so-ever any code executed by this function would not otherwise halt
>> unless this function stops executing it, the code has been decided to
>> have NON_TERMINATING_BEHAVIOR.
>> u32 Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
>>
>>
>
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 8 of 25 — ← Prev page 1 … 6 7 [8] 9 10 … 25 Next page →
Back to top | Article view | comp.theory
csiph-web