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 4 of 25 — ← Prev page 1 2 3 [4] 5 6 … 25 Next page →
| From | Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> |
|---|---|
| Date | 2020-10-22 19:34 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <bhkkH.112223$KL2.100752@fx21.am4> |
| In reply to | #24144 |
On 22/10/2020 19:30, olcott wrote: > On 10/22/2 > 020 12:58 PM, Malcolm McLean wrote: >> On Thursday, 22 October 2020 at 18:32:25 UTC+1, olcott wrote: >>> On 10/22/2020 12:27 PM, Malcolm McLean wrote: >>>> On Thursday, 22 October 2020 at 18:09:33 UTC+1, olcott wrote: >>>>> On 10/22/2020 11:56 AM, Malcolm McLean wrote: >>> >>>>> It refutes the general assertion that the halting problem is undecidable >>>>> by showing how the halting question can be transformed into an >>>>> equivalent question that cannot be thwarted by pathological self-reference. >>>>> >>>> I transforms it into what looks like an equivalent question. >>> >>> When-so-ever the halting problem question is stated as: >>> Was the execution of the input program on its input aborted because >>> non-halting behavior was detected? >>> >>> The undecidability of the halting problem has been refuted. >>> >> Sounds reasonable, doesn't it? As I said, if you want H to make the correct call >> on H_Hat, you have to smuggle into H the information about whether it is >> being called directly or through H_Hat. You appear to have done that quite well. >> > > Executing von Neumann architecture machine in DebugStep() mode or executing a UTM inside another UTM is a perfectly legitimate thing to do. By doing this a halt decider can directly see all the relevant details. Mate, you need to do three things: 1) Re-read what a UTM actually is; 2) Re-read what the halting problem actually is; 3) take your meds. I could add: 4) Fuck off. But that would be rude. /Flibble -- ¬
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-22 20:53 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <87d01a9gvy.fsf@bsb.me.uk> |
| In reply to | #24120 |
olcott <NoOne@NoWhere.com> writes: > So within Linz's faulty assumption that the only possible way to > create a universal halt decider is to directly ask the question: Does > the input program halt on its input? The Linz proof is correct. So, just get at least one thing clear, when you said: "I provide the exact ⊢* wildcard states after the Linz H.q0 and after Ĥ.qx ... showing exactly how the actual Linz H would correctly decide the actual Linz (Ĥ, Ĥ)" and "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz specs does not exist. I now have a fully encoded pair of Turing Machines H / Ĥ proving them wrong." and "I am waiting to encode the UTM in C++ so that I can actually execute H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not a universal halt decider, yet it is exactly and precisely the Peter Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis of Ĥ actually deciding itself." you were wrong? Do you now acknowledge that Linz is right about his construction of H^ from H, and you were ... mistaken ... when you said you had "exactly and precisely" what Linz was talking about? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 15:24 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <paSdnVfGSMvpdwzCnZ2dnUU7-fPNnZ2d@giganews.com> |
| In reply to | #24152 |
On 10/22/2020 2:53 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> So within Linz's faulty assumption that the only possible way to >> create a universal halt decider is to directly ask the question: Does >> the input program halt on its input? The Linz proof is correct. > > So, just get at least one thing clear, when you said: > > "I provide the exact ⊢* wildcard states after the Linz H.q0 and after > Ĥ.qx ... showing exactly how the actual Linz H would correctly decide > the actual Linz (Ĥ, Ĥ)" > > and > > "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz > specs does not exist. I now have a fully encoded pair of Turing > Machines H / Ĥ proving them wrong." > > and > > "I am waiting to encode the UTM in C++ so that I can actually execute > H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not > a universal halt decider, yet it is exactly and precisely the Peter > Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis > of Ĥ actually deciding itself." > > you were wrong? Do you now acknowledge that Linz is right about his > construction of H^ from H, and you were ... mistaken ... when you said > you had "exactly and precisely" what Linz was talking about? > The more general claim that I made is that I would show exactly how the conventional self-referential halting problem proof counter-examples do not prove that the halting problem is undecidable. This has now been totally fulfilled. As soon as you acknowledge this we can move on to talking about other aspects. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-22 13:28 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <27dd1223-691f-408f-a724-767f831692e9n@googlegroups.com> |
| In reply to | #24156 |
On Thursday, 22 October 2020 at 21:24:28 UTC+1, olcott wrote: > > The more general claim that I made is that I would show exactly how the > conventional self-referential halting problem proof counter-examples do > not prove that the halting problem is undecidable. > Absolutely right. Linz proves that halting cannot be decided _by a Turing machine_.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 16:25 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <5O-dnQEZ3MVQZQzCnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #24157 |
On 10/22/2020 3:28 PM, Malcolm McLean wrote:
> On Thursday, 22 October 2020 at 21:24:28 UTC+1, olcott wrote:
>>
>> The more general claim that I made is that I would show exactly how the
>> conventional self-referential halting problem proof counter-examples do
>> not prove that the halting problem is undecidable.
>>
> Absolutely right. Linz proves that halting cannot be decided _by a Turing machine_.
>
And a the x86 language is equivalent to a RASP machine which is
equivalent to a UTM.
https://en.wikipedia.org/wiki/Random-access_stored-program_machine
And these virtual machine functions are equivalent to the Linz templates.
// M has address of H_Hat()
int H_Hat(u32 M)
{
int Abort = DebugTrace(M, M);
if (Abort)
{
MOV_EAX_0 // DebugTrace says that M(M)
HALT // has been aborted
}
else
{
MOV_EAX_1 // M(M) has halted
HERE: goto HERE;
HALT
}
}
// M and N have the address of H_Hat()
int H(u32 M, u32 N)
{
int Abort = DebugTrace(M, N);
if (Abort)
{
MOV_EAX_0 // DebugTrace says that M(N)
HALT // has been aborted
}
else
{
MOV_EAX_1 // M(N) has halted
HALT
}
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT;
}
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-23 00:51 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <87d01995vd.fsf@bsb.me.uk> |
| In reply to | #24156 |
olcott <NoOne@NoWhere.com> writes: > On 10/22/2020 2:53 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> So within Linz's faulty assumption that the only possible way to >>> create a universal halt decider is to directly ask the question: Does >>> the input program halt on its input? The Linz proof is correct. >> >> So, just get at least one thing clear, when you said: >> >> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after >> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide >> the actual Linz (Ĥ, Ĥ)" >> >> and >> >> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >> specs does not exist. I now have a fully encoded pair of Turing >> Machines H / Ĥ proving them wrong." >> >> and >> >> "I am waiting to encode the UTM in C++ so that I can actually execute >> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >> a universal halt decider, yet it is exactly and precisely the Peter >> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >> of Ĥ actually deciding itself." >> >> you were wrong? Unanswered. >> Do you now acknowledge that Linz is right about his >> construction of H^ from H, and you were ... mistaken ... when you said >> you had "exactly and precisely" what Linz was talking about? Unanswered. > The more general claim that I made... is that I would show exactly how > the conventional self-referential halting problem proof > counter-examples do not prove that the halting problem is undecidable. You made this claim after you made the claims above, and only when you realised you could not do what you originally claimed to have done. Stop deflecting and come clean, or post what you said you had two years ago. > This has now been totally fulfilled. > > As soon as you acknowledge this we can move on to talking about other > aspects. Ha! You are using the fact that you are wrong now (no one will agree to this new claim) to prevent you posting the code that would prove you right! If it weren't all a big con, it would be logic comedy gold. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 19:09 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <MsGdnU9NoMDYgg_CnZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #24167 |
On 10/22/2020 6:51 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/22/2020 2:53 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> So within Linz's faulty assumption that the only possible way to >>>> create a universal halt decider is to directly ask the question: Does >>>> the input program halt on its input? The Linz proof is correct. >>> >>> So, just get at least one thing clear, when you said: >>> >>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after >>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide >>> the actual Linz (Ĥ, Ĥ)" >>> >>> and >>> >>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >>> specs does not exist. I now have a fully encoded pair of Turing >>> Machines H / Ĥ proving them wrong." >>> >>> and >>> >>> "I am waiting to encode the UTM in C++ so that I can actually execute >>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >>> a universal halt decider, yet it is exactly and precisely the Peter >>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >>> of Ĥ actually deciding itself." >>> >>> you were wrong? > > Unanswered. > >>> Do you now acknowledge that Linz is right about his >>> construction of H^ from H, and you were ... mistaken ... when you said >>> you had "exactly and precisely" what Linz was talking about? > > Unanswered. > >> The more general claim that I made... is that I would show exactly how >> the conventional self-referential halting problem proof >> counter-examples do not prove that the halting problem is undecidable. > > You made this claim after you made the claims above, and only when you > realised you could not do what you originally claimed to have done. > > Stop deflecting and come clean, or post what you said you had two years > ago. > >> This has now been totally fulfilled. >> >> As soon as you acknowledge this we can move on to talking about other >> aspects. > > Ha! You are using the fact that you are wrong now (no one will agree to > this new claim) to prevent you posting the code that would prove you > right! If it weren't all a big con, it would be logic comedy gold. > Maybe you don't really understand this stuff very well after all. A person that memorizes these sort of things purely by rote has no depth of understanding. People can very easily directly see that I am correct when they try to show how to make the input program do the opposite of whatever the halt decider decides and find that this is no longer possible. When the halt decider aborts its input program this input program can't do anything because the memory of its process has been released. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-23 02:50 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <874kml90df.fsf@bsb.me.uk> |
| In reply to | #24170 |
olcott <NoOne@NoWhere.com> writes: > On 10/22/2020 6:51 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/22/2020 2:53 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> So within Linz's faulty assumption that the only possible way to >>>>> create a universal halt decider is to directly ask the question: Does >>>>> the input program halt on its input? The Linz proof is correct. >>>> >>>> So, just get at least one thing clear, when you said: >>>> >>>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after >>>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide >>>> the actual Linz (Ĥ, Ĥ)" >>>> >>>> and >>>> >>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >>>> specs does not exist. I now have a fully encoded pair of Turing >>>> Machines H / Ĥ proving them wrong." >>>> >>>> and >>>> >>>> "I am waiting to encode the UTM in C++ so that I can actually execute >>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >>>> a universal halt decider, yet it is exactly and precisely the Peter >>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >>>> of Ĥ actually deciding itself." >>>> >>>> you were wrong? >> >> Unanswered. Still unanswered. >>>> Do you now acknowledge that Linz is right about his >>>> construction of H^ from H, and you were ... mistaken ... when you said >>>> you had "exactly and precisely" what Linz was talking about? >> >> Unanswered. Again, no answer. >>> The more general claim that I made... is that I would show exactly how >>> the conventional self-referential halting problem proof >>> counter-examples do not prove that the halting problem is undecidable. >> >> You made this claim after you made the claims above, and only when you >> realised you could not do what you originally claimed to have done. >> >> Stop deflecting and come clean, or post what you said you had two years >> ago. >> >>> This has now been totally fulfilled. >>> >>> As soon as you acknowledge this we can move on to talking about other >>> aspects. >> >> Ha! You are using the fact that you are wrong now (no one will agree to >> this new claim) to prevent you posting the code that would prove you >> right! If it weren't all a big con, it would be logic comedy gold. > > Maybe you don't really understand this stuff very well after all. Sixteen years of equivocating, ducking and diving with nothing concrete to show for it. I hope you can see why someone would want to see the tangible and verifiable result you pretended to have in Dec 2018. It made such a change from the empty boasts. But then it turned out to be an empty boast as well, but this time one that you had to lie about because there was no wriggle room in what you had claimed to have. > When the halt decider aborts its input program this input program > can't do anything because the memory of its process has been released. You, two years ago: "I am waiting to encode the UTM in C++ so that I can actually execute H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not a universal halt decider, yet it is exactly and precisely the Peter Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis of Ĥ actually deciding itself." No x86 code. No programs aborting others. No memory being released. No changed questions. Just Turing machines H and H^ exactly as in Linz doing something incredible! Don't you just wish you really had those two Turing machines so you could post them and stun your critics? What a shame you never did. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 21:27 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <G8CdnX_H7-4Qog_CnZ2dnUU7-c3NnZ2d@giganews.com> |
| In reply to | #24180 |
On 10/22/2020 8:50 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/22/2020 6:51 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/22/2020 2:53 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> So within Linz's faulty assumption that the only possible way to >>>>>> create a universal halt decider is to directly ask the question: Does >>>>>> the input program halt on its input? The Linz proof is correct. >>>>> >>>>> So, just get at least one thing clear, when you said: >>>>> >>>>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after >>>>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide >>>>> the actual Linz (Ĥ, Ĥ)" >>>>> >>>>> and >>>>> >>>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >>>>> specs does not exist. I now have a fully encoded pair of Turing >>>>> Machines H / Ĥ proving them wrong." >>>>> >>>>> and >>>>> >>>>> "I am waiting to encode the UTM in C++ so that I can actually execute >>>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >>>>> a universal halt decider, yet it is exactly and precisely the Peter >>>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >>>>> of Ĥ actually deciding itself." >>>>> >>>>> you were wrong? >>> >>> Unanswered. > > Still unanswered. > >>>>> Do you now acknowledge that Linz is right about his >>>>> construction of H^ from H, and you were ... mistaken ... when you said >>>>> you had "exactly and precisely" what Linz was talking about? >>> >>> Unanswered. > > Again, no answer. > >>>> The more general claim that I made... is that I would show exactly how >>>> the conventional self-referential halting problem proof >>>> counter-examples do not prove that the halting problem is undecidable. >>> >>> You made this claim after you made the claims above, and only when you >>> realised you could not do what you originally claimed to have done. >>> >>> Stop deflecting and come clean, or post what you said you had two years >>> ago. >>> >>>> This has now been totally fulfilled. >>>> >>>> As soon as you acknowledge this we can move on to talking about other >>>> aspects. >>> >>> Ha! You are using the fact that you are wrong now (no one will agree to >>> this new claim) to prevent you posting the code that would prove you >>> right! If it weren't all a big con, it would be logic comedy gold. >> >> Maybe you don't really understand this stuff very well after all. > > Sixteen years of equivocating, ducking and diving with nothing concrete > to show for it. I hope you can see why someone would want to see the > tangible and verifiable result you pretended to have in Dec 2018. It > made such a change from the empty boasts. But then it turned out to be > an empty boast as well, but this time one that you had to lie about > because there was no wriggle room in what you had claimed to have. > >> When the halt decider aborts its input program this input program >> can't do anything because the memory of its process has been released. > > You, two years ago: > > "I am waiting to encode the UTM in C++ so that I can actually execute > H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not > a universal halt decider, yet it is exactly and precisely the Peter > Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis > of Ĥ actually deciding itself." > > No x86 code. No programs aborting others. No memory being released. > No changed questions. Just Turing machines H and H^ exactly as in Linz > doing something incredible! Don't you just wish you really had those > two Turing machines so you could post them and stun your critics? What > a shame you never did. > My current claim that I have already provided an unequivocal refutation ALL of the conventional self-referential halting problem proofs and this naturally takes precedence over all of your lesser points above. There is a simple and direct path to a correct rebuttal of my current claim if and only if I am incorrect. The conventional definition of the halt decider can be easily thwarted by making a program based on this halt decider that does the opposite of whatever the halt decider decides. (1) Original self-referential halting problem counter example (a) Decision: ~Halting and Behavior: Halts (a contradiction) (b) Decision: Halting and Behavior: Loops (a contradiction) When the halt decider is a UTM that executes its TM one state transition at a time and ceases executing this TM as soon as it detects non-halting behavior, and then reports that it aborted the execution of this TM it is reporting non-halting behavior that cannot be contradicted. If you can show how its TM can be defined such that its input does the opposite of whatever the halt decider UTM decides then you would have refuted this new position. On the other hand if it is impossible to derive any examples that this redefined halt decider cannot decide, this would prove that I am correct. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-23 05:00 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <87mu0d7fsa.fsf@bsb.me.uk> |
| In reply to | #24182 |
olcott <NoOne@NoWhere.com> writes:
> On 10/22/2020 8:50 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/22/2020 6:51 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 10/22/2020 2:53 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> So within Linz's faulty assumption that the only possible way to
>>>>>>> create a universal halt decider is to directly ask the question: Does
>>>>>>> the input program halt on its input? The Linz proof is correct.
>>>>>>
>>>>>> So, just get at least one thing clear, when you said:
>>>>>>
>>>>>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after
>>>>>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide
>>>>>> the actual Linz (Ĥ, Ĥ)"
>>>>>>
>>>>>> and
>>>>>>
>>>>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz
>>>>>> specs does not exist. I now have a fully encoded pair of Turing
>>>>>> Machines H / Ĥ proving them wrong."
>>>>>>
>>>>>> and
>>>>>>
>>>>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>>>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>>>>> a universal halt decider, yet it is exactly and precisely the Peter
>>>>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>>>>> of Ĥ actually deciding itself."
>>>>>>
>>>>>> you were wrong?
>>>>
>>>> Unanswered.
>>
>> Still unanswered.
>>
>>>>>> Do you now acknowledge that Linz is right about his
>>>>>> construction of H^ from H, and you were ... mistaken ... when you said
>>>>>> you had "exactly and precisely" what Linz was talking about?
>>>>
>>>> Unanswered.
>>
>> Again, no answer.
>>
>>>>> The more general claim that I made... is that I would show exactly how
>>>>> the conventional self-referential halting problem proof
>>>>> counter-examples do not prove that the halting problem is undecidable.
>>>>
>>>> You made this claim after you made the claims above, and only when you
>>>> realised you could not do what you originally claimed to have done.
>>>>
>>>> Stop deflecting and come clean, or post what you said you had two years
>>>> ago.
>>>>
>>>>> This has now been totally fulfilled.
>>>>>
>>>>> As soon as you acknowledge this we can move on to talking about other
>>>>> aspects.
>>>>
>>>> Ha! You are using the fact that you are wrong now (no one will agree to
>>>> this new claim) to prevent you posting the code that would prove you
>>>> right! If it weren't all a big con, it would be logic comedy gold.
>>>
>>> Maybe you don't really understand this stuff very well after all.
>>
>> Sixteen years of equivocating, ducking and diving with nothing concrete
>> to show for it. I hope you can see why someone would want to see the
>> tangible and verifiable result you pretended to have in Dec 2018. It
>> made such a change from the empty boasts. But then it turned out to be
>> an empty boast as well, but this time one that you had to lie about
>> because there was no wriggle room in what you had claimed to have.
>>
>>> When the halt decider aborts its input program this input program
>>> can't do anything because the memory of its process has been released.
>>
>> You, two years ago:
>>
>> "I am waiting to encode the UTM in C++ so that I can actually execute
>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>> a universal halt decider, yet it is exactly and precisely the Peter
>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>> of Ĥ actually deciding itself."
>>
>> No x86 code. No programs aborting others. No memory being released.
>> No changed questions. Just Turing machines H and H^ exactly as in Linz
>> doing something incredible! Don't you just wish you really had those
>> two Turing machines so you could post them and stun your critics? What
>> a shame you never did.
>
> My current claim that I have already provided an unequivocal
> refutation ALL of the conventional self-referential halting problem
> proofs and this naturally takes precedence over all of your lesser
> points above.
You don't have what you claimed to have. That's why you will never post
it.
> There is a simple and direct path to a correct rebuttal of my current
> claim if and only if I am incorrect.
Yes there is. Here are H and H_Hat with some of the noise removed:
void H(u32 M, u32 N)
{
if (DebugTrace(M, N))
MOV_EAX_0 // M(N) would not otherwise terminate
else
MOV_EAX_1 // M(N) has terminated
HALT
}
void H_Hat(u32 M)
{
if (!DebugTrace(M, M))
HERE: goto HERE;
HALT
}
Neither function returns a result they should be "void". The EAX
settings in H_Hat are a distraction since H_Hat is not supposed to report
anything at all. All that matters is whether is halts or not.
Now, since you refuse to say what DebugTrace(H_Hat, H_Hat) returns (I
don't think you know yet), we need to consider both cases:
When DebugTrace(H_Hat, H_Hat) == 1 the two computations execute like this:
H(H_Hat, H_Hat):
MOV_EAX_0 // H_Hat(H_Hat) would not otherwise terminate
HALT
H_Hat(H_Hat):
HALT
and when DebugTrace(H_Hat, H_Hat) == 0 they execute
H(H_Hat, H_Hat):
MOV_EAX_1 // H_Hat(H_Hat) has terminated
HALT
H_Hat(H_Hat):
HERE: goto HERE;
Sure looks like H gets the wrong answer to me.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 23:31 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <2dmdnQhzpdQOwQ_CnZ2dnUU7-XGdnZ2d@giganews.com> |
| In reply to | #24186 |
On 10/22/2020 11:00 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 10/22/2020 8:50 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/22/2020 6:51 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 10/22/2020 2:53 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> So within Linz's faulty assumption that the only possible way to
>>>>>>>> create a universal halt decider is to directly ask the question: Does
>>>>>>>> the input program halt on its input? The Linz proof is correct.
>>>>>>>
>>>>>>> So, just get at least one thing clear, when you said:
>>>>>>>
>>>>>>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after
>>>>>>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide
>>>>>>> the actual Linz (Ĥ, Ĥ)"
>>>>>>>
>>>>>>> and
>>>>>>>
>>>>>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz
>>>>>>> specs does not exist. I now have a fully encoded pair of Turing
>>>>>>> Machines H / Ĥ proving them wrong."
>>>>>>>
>>>>>>> and
>>>>>>>
>>>>>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>>>>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>>>>>> a universal halt decider, yet it is exactly and precisely the Peter
>>>>>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>>>>>> of Ĥ actually deciding itself."
>>>>>>>
>>>>>>> you were wrong?
>>>>>
>>>>> Unanswered.
>>>
>>> Still unanswered.
>>>
>>>>>>> Do you now acknowledge that Linz is right about his
>>>>>>> construction of H^ from H, and you were ... mistaken ... when you said
>>>>>>> you had "exactly and precisely" what Linz was talking about?
>>>>>
>>>>> Unanswered.
>>>
>>> Again, no answer.
>>>
>>>>>> The more general claim that I made... is that I would show exactly how
>>>>>> the conventional self-referential halting problem proof
>>>>>> counter-examples do not prove that the halting problem is undecidable.
>>>>>
>>>>> You made this claim after you made the claims above, and only when you
>>>>> realised you could not do what you originally claimed to have done.
>>>>>
>>>>> Stop deflecting and come clean, or post what you said you had two years
>>>>> ago.
>>>>>
>>>>>> This has now been totally fulfilled.
>>>>>>
>>>>>> As soon as you acknowledge this we can move on to talking about other
>>>>>> aspects.
>>>>>
>>>>> Ha! You are using the fact that you are wrong now (no one will agree to
>>>>> this new claim) to prevent you posting the code that would prove you
>>>>> right! If it weren't all a big con, it would be logic comedy gold.
>>>>
>>>> Maybe you don't really understand this stuff very well after all.
>>>
>>> Sixteen years of equivocating, ducking and diving with nothing concrete
>>> to show for it. I hope you can see why someone would want to see the
>>> tangible and verifiable result you pretended to have in Dec 2018. It
>>> made such a change from the empty boasts. But then it turned out to be
>>> an empty boast as well, but this time one that you had to lie about
>>> because there was no wriggle room in what you had claimed to have.
>>>
>>>> When the halt decider aborts its input program this input program
>>>> can't do anything because the memory of its process has been released.
>>>
>>> You, two years ago:
>>>
>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>> a universal halt decider, yet it is exactly and precisely the Peter
>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>> of Ĥ actually deciding itself."
>>>
>>> No x86 code. No programs aborting others. No memory being released.
>>> No changed questions. Just Turing machines H and H^ exactly as in Linz
>>> doing something incredible! Don't you just wish you really had those
>>> two Turing machines so you could post them and stun your critics? What
>>> a shame you never did.
>>
>> My current claim that I have already provided an unequivocal
>> refutation ALL of the conventional self-referential halting problem
>> proofs and this naturally takes precedence over all of your lesser
>> points above.
>
> You don't have what you claimed to have. That's why you will never post
> it.
>
>> There is a simple and direct path to a correct rebuttal of my current
>> claim if and only if I am incorrect.
>
> Yes there is. Here are H and H_Hat with some of the noise removed:
>
> void H(u32 M, u32 N)
> {
> if (DebugTrace(M, N))
> MOV_EAX_0 // M(N) would not otherwise terminate
> else
> MOV_EAX_1 // M(N) has terminated
> HALT
> }
>
> void H_Hat(u32 M)
> {
> if (!DebugTrace(M, M))
> HERE: goto HERE;
> HALT
> }
>
> Neither function returns a result they should be "void". The EAX
> settings in H_Hat are a distraction since H_Hat is not supposed to report
> anything at all. All that matters is whether is halts or not.
>
> Now, since you refuse to say what DebugTrace(H_Hat, H_Hat) returns (I
> don't think you know yet), we need to consider both cases:
>
> When DebugTrace(H_Hat, H_Hat) == 1 the two computations execute like this:
>
> H(H_Hat, H_Hat):
> MOV_EAX_0 // H_Hat(H_Hat) would not otherwise terminate
> HALT
>
> H_Hat(H_Hat):
> HALT
>
> and when DebugTrace(H_Hat, H_Hat) == 0 they execute
>
> H(H_Hat, H_Hat):
> MOV_EAX_1 // H_Hat(H_Hat) has terminated
> HALT
>
> H_Hat(H_Hat):
> HERE: goto HERE;
>
> Sure looks like H gets the wrong answer to me.
>
The input program is created from the halt decider and made to do the
opposite of whatever the halt decider decides. This fools the halt decider.
If the halt decider decides its input will halt the input program loops.
If the halt decider decides its input will loop the input program halts.
When the halt decider executes its input in debug trace mode
(or a UTM executes its TM one state transition at a time).
then as soon as it detects non-halting behavior its stops executing its
input and reports non-halting behavior.
The input program cannot do the opposite of whatever the halt decider
decides because the input program cannot do anything at all because it
is no longer executing.
There is no longer any input that can fool this halt decider therefore
the halting problem proofs have been refuted.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-23 17:19 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <8736246hjt.fsf@bsb.me.uk> |
| In reply to | #24191 |
You've split the thread by replying twice with different answers. This
objection seem particularly silly, but I don't know if you still stand
by it:
olcott <NoOne@NoWhere.com> writes:
> On 10/22/2020 11:00 PM, Ben Bacarisse wrote:
>> ... Here are H and H_Hat with some of the noise removed:
>>
>> void H(u32 M, u32 N)
>> {
>> if (DebugTrace(M, N))
>> MOV_EAX_0 // M(N) would not otherwise terminate
>> else
>> MOV_EAX_1 // M(N) has terminated
>> HALT
>> }
>>
>> void H_Hat(u32 M)
>> {
>> if (!DebugTrace(M, M))
>> HERE: goto HERE;
>> HALT
>> }
<cut>
>> When DebugTrace(H_Hat, H_Hat) == 1 the two computations execute like this:
>>
>> H(H_Hat, H_Hat):
>> MOV_EAX_0 // H_Hat(H_Hat) would not otherwise terminate
>> HALT
>>
>> H_Hat(H_Hat):
>> HALT
>>
>> and when DebugTrace(H_Hat, H_Hat) == 0 they execute
>>
>> H(H_Hat, H_Hat):
>> MOV_EAX_1 // H_Hat(H_Hat) has terminated
>> HALT
>>
>> H_Hat(H_Hat):
>> HERE: goto HERE;
>>
>> Sure looks like H gets the wrong answer to me.
<cut>
> When the halt decider executes its input in debug trace mode
> (or a UTM executes its TM one state transition at a time).
> then as soon as it detects non-halting behavior its stops executing
> its input and reports non-halting behavior.
>
> The input program cannot do the opposite of whatever the halt decider
> decides because the input program cannot do anything at all because it
> is no longer executing.
DebugTrace(H_Hat, H_Hat) will return the same result today, tomorrow and
a year from now. We run H(H_Hat, H_Hat) on Monday and observe that is
does MOV_EAX_1. We now know that when we run H_Hat(H_Hat) the following
day it will execute a tight loop. And if H(H_Hat, H_Hat) does MOV_EAX_0
on the Monday, H_Hat(H_Hat) will immediately halt when run on the
Tuesday.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-23 21:22 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <MlLkH.423585$RF4.381605@fx43.iad> |
| In reply to | #24191 |
On 10/23/20 12:31 AM, olcott wrote: > > The input program is created from the halt decider and made to do the > opposite of whatever the halt decider decides. This fools the halt decider. > > If the halt decider decides its input will halt the input program loops. > If the halt decider decides its input will loop the input program halts. > > When the halt decider executes its input in debug trace mode > (or a UTM executes its TM one state transition at a time). > then as soon as it detects non-halting behavior its stops executing its > input and reports non-halting behavior. > > The input program cannot do the opposite of whatever the halt decider > decides because the input program cannot do anything at all because it > is no longer executing. > > There is no longer any input that can fool this halt decider therefore > the halting problem proofs have been refuted. It isn't the input program that behaves differently, it is the H_Hat that call H that does the opposite. BUT, since the input program was an encoding of H_Hat, what the input program does will by necessity match what the calling program does (They are both instances of H_Hat(H_Hat). Your returning that you aborted H_Hat, is an indication that you detected that H_Hat(H_Hat) is a forever looping machine/input, but then the calling H_Hat halts, so your machine gave the wrong answer.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 20:36 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <abqdnRb8T5O2GA7CnZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #24286 |
On 10/23/2020 8:22 PM, Richard Damon wrote: > On 10/23/20 12:31 AM, olcott wrote: >> >> The input program is created from the halt decider and made to do the >> opposite of whatever the halt decider decides. This fools the halt decider. >> >> If the halt decider decides its input will halt the input program loops. >> If the halt decider decides its input will loop the input program halts. >> >> When the halt decider executes its input in debug trace mode >> (or a UTM executes its TM one state transition at a time). >> then as soon as it detects non-halting behavior its stops executing its >> input and reports non-halting behavior. >> >> The input program cannot do the opposite of whatever the halt decider >> decides because the input program cannot do anything at all because it >> is no longer executing. >> >> There is no longer any input that can fool this halt decider therefore >> the halting problem proofs have been refuted. > > It isn't the input program that behaves differently, it is the H_Hat > that call H that does the opposite. > > BUT, since the input program was an encoding of H_Hat, what the input > program does will by necessity match what the calling program does (They > are both instances of H_Hat(H_Hat). > > Your returning that you aborted H_Hat, is an indication that you > detected that H_Hat(H_Hat) is a forever looping machine/input, but then > the calling H_Hat halts, so your machine gave the wrong answer. > Superficially within the indoctrination of the conventional halting problem proofs it would seem that way. H_Hat() decides that that its input would not halt so it aborts its input forcing it to halt. It says it won't halt and then it halts. When the halting problem question is: Do you have to abort your input to force it to halt? H_hat() aborts its input and says YES. Contradiction has been removed ! -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-23 22:50 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <GDMkH.86697$RN.75677@fx13.iad> |
| In reply to | #24288 |
On 10/23/20 9:36 PM, olcott wrote: >> > > Superficially within the indoctrination of the conventional halting > problem proofs it would seem that way. > > H_Hat() decides that that its input would not halt so it aborts its > input forcing it to halt. It says it won't halt and then it halts. > > When the halting problem question is: > Do you have to abort your input to force it to halt? > H_hat() aborts its input and says YES. Contradiction has been removed ! The Halting problem is: "Will the given machine, with the given input halt in finite time, or will it run forever?". (And the answer needs to be provided in a finite time), THAT is the USEFUL halting problem. Your answer is like someone asking, "Do Dogs Bark?", and you answer is "Cows Moo!", it doesn't answer the question. You may not like the question, or not like the answer, but changing the question doesn't change the answer to the orginal question. All your complication to the problem seems to be an attempt to hide that you are changing the question. The fact that you show a way to get around the original argument by changing the question does NOT invalidate that the original argument was still valid for the original question. Yes, it is well know that adding restrictions to the domain of machines/input that need to be processed, or the question being asked, may well allow a limited halt decider to be created. That is not new. The proof is SPECIFICALLY about a universal halt decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 22:18 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <ot-dnX-Qr4WRAA7CnZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #24293 |
On 10/23/2020 9:50 PM, Richard Damon wrote:
> On 10/23/20 9:36 PM, olcott wrote:
>>>
>>
>> Superficially within the indoctrination of the conventional halting
>> problem proofs it would seem that way.
>>
>> H_Hat() decides that that its input would not halt so it aborts its
>> input forcing it to halt. It says it won't halt and then it halts.
>>
>> When the halting problem question is:
>> Do you have to abort your input to force it to halt?
>> H_hat() aborts its input and says YES. Contradiction has been removed !
>
> The Halting problem is: "Will the given machine, with the given input
> halt in finite time, or will it run forever?". (And the answer needs to
> be provided in a finite time),
I spent 12,000 hours on this since 2004. I just finished one man-year
worth of work creating the x86utm operating system for the sole purpose
of providing a fully executable UTM equivalent von Neumann architecture
machine virtual machine.
I found that one key element of the undeciability of the halting problem
is how the halting decider was defined.
bool Does_It_Halt(u32 P, u32 I)
is subject to pathological self-reference(Olcott 2004) and makes the
halting problem undecidable.
bool Was_Input_Aborted(u32 P, u32 I)
is NOT subject to pathological self-reference(Olcott 2004) and makes the
halting problem decidable.
It answers the exact same question as the original question except that
this time it does it in a way that it cannot be fooled.
> THAT is the USEFUL halting problem.
>
> Your answer is like someone asking, "Do Dogs Bark?", and you answer is
> "Cows Moo!", it doesn't answer the question.
>
> You may not like the question, or not like the answer, but changing the
> question doesn't change the answer to the orginal question.
>
> All your complication to the problem seems to be an attempt to hide that
> you are changing the question. The fact that you show a way to get
> around the original argument by changing the question does NOT
> invalidate that the original argument was still valid for the original
> question.
No. Not at all. Not in the least little bit.
The original proofs asserted that they proved that the halting problem
was undecidable. They did not really prove that the halting problem is
undecidable at all they merely found one way that doesn't work.
> Yes, it is well know that adding restrictions to the domain of
> machines/input that need to be processed, or the question being asked,
> may well allow a limited halt decider to be created. That is not new.
> The proof is SPECIFICALLY about a universal halt decider.
With my change to the definition of the halt decider the conventional
counter-examples that were presented as proof that halting is
undecidable have now been made decidable.
I am working on writing the x86utm code to directly show the steps
involved for DebugTrace() to decide that H_Hat() is infinitly recursive.
Now that I have already provided 99.99% of the solution most any
competent programmer could complete these steps.
// M has address of H_Hat()
void H_Hat(u32 M)
{
if (DebugTrace(M, M)) // M(M) Aborted?
MOV_EAX_0 // Execution of M(N) has been aborted
else
{
MOV_EAX_1 // M(N) has halted
HERE: goto HERE;
}
HALT
}
// M and N have the address of H_Hat()
void H(u32 M, u32 N)
{
if (DebugTrace(M, N)) // M(N) Aborted?
MOV_EAX_0 // Execution of M(N) has been aborted
else
MOV_EAX_1 // M(N) has halted
HALT
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT;
}
In the above case DebugTrace() detects that H_Hat() is infinitely
recursive and aborts the outermost instance of H_Hat() and its whole
process tree so that the inner DebugTrace() that is invoked by H_Hat()
never returns a value to H_Hat().
This makes the standard halting problem trick impossible.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-24 10:00 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <ksWkH.28281$ri1.2260@fx26.iad> |
| In reply to | #24298 |
On 10/23/20 11:18 PM, olcott wrote: > > I spent 12,000 hours on this since 2004. I just finished one man-year > worth of work creating the x86utm operating system for the sole purpose > of providing a fully executable UTM equivalent von Neumann architecture > machine virtual machine. > > I found that one key element of the undeciability of the halting problem > is how the halting decider was defined. > > bool Does_It_Halt(u32 P, u32 I) > is subject to pathological self-reference(Olcott 2004) and makes the > halting problem undecidable. > > bool Was_Input_Aborted(u32 P, u32 I) > is NOT subject to pathological self-reference(Olcott 2004) and makes the > halting problem decidable. > > It answers the exact same question as the original question except that > this time it does it in a way that it cannot be fooled. Does it? Does Was_Input_Aborted ALWAYS return the correct answer. Will it say 'Aborted' only if the program being analyzed WILL loop infinitely? Or is the answer that I aborted the program just meaning that the program likely runs forever, but maybe it stops? If the latter, then you are basically admitting that your answer isn't always correct. In particular, it seems that you are accepting that H(H_Hat, H_Hat) will say that the machine H_Hat(H_Hat) needed to be aborted, even though when you actually run H_Hat(H_Hat) it properly halts in finite time. So yes, your 'Halting Decider' can be built as long as it is allowed to be WRONG some of the time. As I mentioned elsewhere, this means that if you build a Turing Machine to prove a conjecture, your machine might declare that the conjecture is True (the machine never halted finding a counter example) when in fact there IS a counter example that the machine might eventually have found, but the aborting logic decided it got stuck in a loop on.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 11:04 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <86CdnQGJ_dESzQnCnZ2dnUU7-L_NnZ2d@giganews.com> |
| In reply to | #24311 |
On 10/24/2020 9:00 AM, Richard Damon wrote: > On 10/23/20 11:18 PM, olcott wrote: >> >> I spent 12,000 hours on this since 2004. I just finished one man-year >> worth of work creating the x86utm operating system for the sole purpose >> of providing a fully executable UTM equivalent von Neumann architecture >> machine virtual machine. >> >> I found that one key element of the undeciability of the halting problem >> is how the halting decider was defined. >> >> bool Does_It_Halt(u32 P, u32 I) >> is subject to pathological self-reference(Olcott 2004) and makes the >> halting problem undecidable. >> >> bool Was_Input_Aborted(u32 P, u32 I) >> is NOT subject to pathological self-reference(Olcott 2004) and makes the >> halting problem decidable. >> >> It answers the exact same question as the original question except that >> this time it does it in a way that it cannot be fooled. > > Does it? Does Was_Input_Aborted ALWAYS return the correct answer. Will > it say 'Aborted' only if the program being analyzed WILL loop infinitely? > The redefined halt decider eliminates the undecidability of the halting problem. It cannot be shown that the redefined halt decider ever necessarily gets the wrong answer. > Or is the answer that I aborted the program just meaning that the > program likely runs forever, but maybe it stops? > > If the latter, then you are basically admitting that your answer isn't > always correct. > It cannot be shown that the answer is ever necessarily incorrect. The redefined halt decider eliminates the undecidability of the halting problem. > In particular, it seems that you are accepting that H(H_Hat, H_Hat) will > say that the machine H_Hat(H_Hat) needed to be aborted, even though when > you actually run H_Hat(H_Hat) it properly halts in finite time. > This is the tricky part. Now that I have a full x86utm operating system to back me up I can make claims that can be empirically proved. I will use Mike Terry's new name because it is more clear: The outermost x86utm process that invokes this function Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) has a longer execution trace than its inner invocation in the H_Hat() process. This means that the outer invocation has more data than the inner invocation. Because it has more data the rule that the same function with the same data must produce the same result is not violated when the outer x86utm process: Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) decides to abort the whole H_Hat() process tree. It doesn't matter if H() or H_Hat() invokes Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) in the x86utm process because they are both invoking the same function with the same data thus decuding the same result: Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) == true. It turns out that all of the conventional self-referential halting problem proof counter-examples specify infinite recursion that never reaches the undecidable states. Because of this none of them would ever halt unless their execution is aborted. If we simply wait and see what H_Hat() does and do not decide to abort it, then H_Hat()'s infinite recursion causes it to have infinite execution. > So yes, your 'Halting Decider' can be built as long as it is allowed to > be WRONG some of the time. > This redefined halt decider cannot be shown to ever necessarily decide incorrectly. > As I mentioned elsewhere, this means that if you build a Turing Machine > to prove a conjecture, your machine might declare that the conjecture is > True (the machine never halted finding a counter example) when in fact > there IS a counter example that the machine might eventually have found, > but the aborting logic decided it got stuck in a loop on. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 00:12 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <wZqdnWuzy8qg-w_CnZ2dnUU7-TfNnZ2d@giganews.com> |
| In reply to | #24186 |
On 10/22/2020 11:00 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 10/22/2020 8:50 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/22/2020 6:51 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 10/22/2020 2:53 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> So within Linz's faulty assumption that the only possible way to
>>>>>>>> create a universal halt decider is to directly ask the question: Does
>>>>>>>> the input program halt on its input? The Linz proof is correct.
>>>>>>>
>>>>>>> So, just get at least one thing clear, when you said:
>>>>>>>
>>>>>>> "I provide the exact ⊢* wildcard states after the Linz H.q0 and after
>>>>>>> Ĥ.qx ... showing exactly how the actual Linz H would correctly decide
>>>>>>> the actual Linz (Ĥ, Ĥ)"
>>>>>>>
>>>>>>> and
>>>>>>>
>>>>>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz
>>>>>>> specs does not exist. I now have a fully encoded pair of Turing
>>>>>>> Machines H / Ĥ proving them wrong."
>>>>>>>
>>>>>>> and
>>>>>>>
>>>>>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>>>>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>>>>>> a universal halt decider, yet it is exactly and precisely the Peter
>>>>>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>>>>>> of Ĥ actually deciding itself."
>>>>>>>
>>>>>>> you were wrong?
>>>>>
>>>>> Unanswered.
>>>
>>> Still unanswered.
>>>
>>>>>>> Do you now acknowledge that Linz is right about his
>>>>>>> construction of H^ from H, and you were ... mistaken ... when you said
>>>>>>> you had "exactly and precisely" what Linz was talking about?
>>>>>
>>>>> Unanswered.
>>>
>>> Again, no answer.
>>>
>>>>>> The more general claim that I made... is that I would show exactly how
>>>>>> the conventional self-referential halting problem proof
>>>>>> counter-examples do not prove that the halting problem is undecidable.
>>>>>
>>>>> You made this claim after you made the claims above, and only when you
>>>>> realised you could not do what you originally claimed to have done.
>>>>>
>>>>> Stop deflecting and come clean, or post what you said you had two years
>>>>> ago.
>>>>>
>>>>>> This has now been totally fulfilled.
>>>>>>
>>>>>> As soon as you acknowledge this we can move on to talking about other
>>>>>> aspects.
>>>>>
>>>>> Ha! You are using the fact that you are wrong now (no one will agree to
>>>>> this new claim) to prevent you posting the code that would prove you
>>>>> right! If it weren't all a big con, it would be logic comedy gold.
>>>>
>>>> Maybe you don't really understand this stuff very well after all.
>>>
>>> Sixteen years of equivocating, ducking and diving with nothing concrete
>>> to show for it. I hope you can see why someone would want to see the
>>> tangible and verifiable result you pretended to have in Dec 2018. It
>>> made such a change from the empty boasts. But then it turned out to be
>>> an empty boast as well, but this time one that you had to lie about
>>> because there was no wriggle room in what you had claimed to have.
>>>
>>>> When the halt decider aborts its input program this input program
>>>> can't do anything because the memory of its process has been released.
>>>
>>> You, two years ago:
>>>
>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>> a universal halt decider, yet it is exactly and precisely the Peter
>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>> of Ĥ actually deciding itself."
>>>
>>> No x86 code. No programs aborting others. No memory being released.
>>> No changed questions. Just Turing machines H and H^ exactly as in Linz
>>> doing something incredible! Don't you just wish you really had those
>>> two Turing machines so you could post them and stun your critics? What
>>> a shame you never did.
>>
>> My current claim that I have already provided an unequivocal
>> refutation ALL of the conventional self-referential halting problem
>> proofs and this naturally takes precedence over all of your lesser
>> points above.
>
> You don't have what you claimed to have. That's why you will never post
> it.
>
>> There is a simple and direct path to a correct rebuttal of my current
>> claim if and only if I am incorrect.
>
> Yes there is. Here are H and H_Hat with some of the noise removed:
>
> void H(u32 M, u32 N)
> {
> if (DebugTrace(M, N))
> MOV_EAX_0 // M(N) would not otherwise terminate
> else
> MOV_EAX_1 // M(N) has terminated
> HALT
> }
>
Since I strive for complete honestly I do have to say this this is a
clear improvement.
> void H_Hat(u32 M)
> {
> if (!DebugTrace(M, M))
> HERE: goto HERE;
> HALT
> }
>
In this one we are losing the transition to (qy) or ((qn)) detail, yet
this is an inessential detail and since we are aiming to generalize
beyond Linz it is also an improvement. In both cases you removed
clumsiness, so good job.
> Neither function returns a result they should be "void".
Yes I initially tried for a return value but stack unwinding caused an
incorrect return value, so right again.
> The EAX
> settings in H_Hat are a distraction since H_Hat is not supposed to report
> anything at all. All that matters is whether is halts or not.
>
Yes good call.
> Now, since you refuse to say what DebugTrace(H_Hat, H_Hat) returns (I
> don't think you know yet), we need to consider both cases:
>
I have known for 3.5 years. We discussed this at great length yet you
were so sure that I must be wrong that you paid no attention at all.
> When DebugTrace(H_Hat, H_Hat) == 1 the two computations execute like this:
>
> H(H_Hat, H_Hat):
> MOV_EAX_0 // H_Hat(H_Hat) would not otherwise terminate
> HALT
>
> H_Hat(H_Hat):
> HALT
>
> and when DebugTrace(H_Hat, H_Hat) == 0 they execute
>
> H(H_Hat, H_Hat):
> MOV_EAX_1 // H_Hat(H_Hat) has terminated
> HALT
>
> H_Hat(H_Hat):
> HERE: goto HERE;
>
> Sure looks like H gets the wrong answer to me.
You actually did quite well in analyzing the above except for one very
glaring exception. One of the two return values from DebugTrace() is
correct.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-23 03:47 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <a757d6de-f67e-475b-95b6-27ea3828d3bbn@googlegroups.com> |
| In reply to | #24192 |
On Friday, 23 October 2020 at 06:12:37 UTC+1, olcott wrote: > On 10/22/2020 11:00 PM, Ben Bacarisse wrote: > > > The EAX > > settings in H_Hat are a distraction since H_Hat is not supposed to report > > anything at all. All that matters is whether is halts or not. > > > Yes good call. > No, that's essential to your system. H_Hat aborts, which it achieves by writing 0 to eax. That's your "abort path",or "exception return" or whatever you want to call it. If H_Hat doesn't abort, then DebugTrace has to abort it. Or Linz is right all along and behaviour is inconsistent. Either DebugTrace isn't a Turing machine or H_Hat isn't a Turing machine, and you've got round Linz. Linz's proof only applies to Turing machines, and Turing machines can't abort.
[toc] | [prev] | [next] | [standalone]
Page 4 of 25 — ← Prev page 1 2 3 [4] 5 6 … 25 Next page →
Back to top | Article view | comp.theory
csiph-web