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 1 of 25 [1] 2 3 … 25 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-20 11:33 -0500 |
| Subject | The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] |
| Message-ID | <d8SdnUgDwrvNjBLCnZ2dnUU7-fXNnZ2d@giganews.com> |
x86utm is as much as possible a Universal Turing Machine UTM that has
the x86 language as its Turing Machine Description language.
It is common knowledge that the RASP architecture is equivalent to a
universal Turing machine. It is self-evident that the x86 language is a
finite implementation of the Random Access Stored Program (RASP) model.
x86 UTM has these four key operating system functions providing the
functionality to transform an x86 emulator into a finite Universal
Turing Machine: (Source code will be provided)
u32* Allocate(u32 size); // Allocate bytes of memory
void SaveState(Registers* state);
void LoadState(Registers* state);
u32 DebugStep(Registers* master_state, Registers* slave_state);
To make x86utm easy to use it directly executes the COFF object file
output of the Microsoft C compiler. The entire x86UTM system works on
both Windows and Linux. It will also directly execute the output of the
GCC compiler when this output has been converted to the COFF format. An
open source utility is provided for this purpose.
x86utm is based on a very superb x86 emulator. The only change the
needed to be made to the emulator was to very slightly adapt it to
compile under windows and add the feature of disassembling an object
file. All of the adaptations to transform this emulator into a master
UTM are contained in a single C++ source file.
Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
correctly decide halting of H_Hat()
H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
H() decides that H_Hat() would not otherwise terminate. In this case H()
would stop executing H_Hat() and report Not_Halting behavior.
H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
processes having their own: {Memory, registers and stack}
To make things simple the halt deciding aspect of H() and H_Hat() is the
same function. (see below)
#define HALT __asm hlt
// N and M have address of H_Hat()
int H(u32 M, u32 N)
{
int Abort = DebugTrace(M, N);
if (Abort)
{
MOV_EAX_0
HALT
}
else
{
MOV_EAX_1
HALT
}
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT;
}
--
Copyright 2020 Pete Olcott
[toc] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-20 19:11 +0100 |
| Message-ID | <uoadnYnju-LNtRLCnZ2dnUU78evNnZ2d@brightview.co.uk> |
| In reply to | #24043 |
On 20/10/2020 17:33, olcott wrote:
> x86utm is as much as possible a Universal Turing Machine UTM that has
> the x86 language as its Turing Machine Description language.
>
> It is common knowledge that the RASP architecture is equivalent to a
> universal Turing machine. It is self-evident that the x86 language is a
> finite implementation of the Random Access Stored Program (RASP) model.
>
> x86 UTM has these four key operating system functions providing the
> functionality to transform an x86 emulator into a finite Universal
> Turing Machine: (Source code will be provided)
>
> u32* Allocate(u32 size); // Allocate bytes of memory
> void SaveState(Registers* state);
> void LoadState(Registers* state);
> u32 DebugStep(Registers* master_state, Registers* slave_state);
>
> To make x86utm easy to use it directly executes the COFF object file
> output of the Microsoft C compiler. The entire x86UTM system works on
> both Windows and Linux. It will also directly execute the output of the
> GCC compiler when this output has been converted to the COFF format. An
> open source utility is provided for this purpose.
>
> x86utm is based on a very superb x86 emulator. The only change the
> needed to be made to the emulator was to very slightly adapt it to
> compile under windows and add the feature of disassembling an object
> file. All of the adaptations to transform this emulator into a master
> UTM are contained in a single C++ source file.
>
> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
> correctly decide halting of H_Hat()
>
> H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
> H() decides that H_Hat() would not otherwise terminate. In this case H()
> would stop executing H_Hat() and report Not_Halting behavior.
>
> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
> processes having their own: {Memory, registers and stack}
> To make things simple the halt deciding aspect of H() and H_Hat() is the
> same function. (see below)
So what is this "the same function"? It looks like that function is
DebugTrace(), right? (A better name might be Decide(), which expresses
its role in the program, but no biggie.)
>
> #define HALT __asm hlt
> // N and M have address of H_Hat()
> int H(u32 M, u32 N)
> {
> int Abort = DebugTrace(M, N);
> if (Abort)
> {
> MOV_EAX_0
> HALT
> }
> else
> {
> MOV_EAX_1
> HALT
> }
> }
>
>
> int main()
> {
> u32 M = (u32)H_Hat;
> H(M, M);
> HALT;
> }
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-20 13:40 -0500 |
| Message-ID | <bt-dnYPjaYupshLCnZ2dnUU7-YPNnZ2d@giganews.com> |
| In reply to | #24044 |
On 10/20/2020 1:11 PM, Mike Terry wrote:
> On 20/10/2020 17:33, olcott wrote:
>> x86utm is as much as possible a Universal Turing Machine UTM that has
>> the x86 language as its Turing Machine Description language.
>>
>> It is common knowledge that the RASP architecture is equivalent to a
>> universal Turing machine. It is self-evident that the x86 language is a
>> finite implementation of the Random Access Stored Program (RASP) model.
>>
>> x86 UTM has these four key operating system functions providing the
>> functionality to transform an x86 emulator into a finite Universal
>> Turing Machine: (Source code will be provided)
>>
>> u32* Allocate(u32 size); // Allocate bytes of memory
>> void SaveState(Registers* state);
>> void LoadState(Registers* state);
>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>
>> To make x86utm easy to use it directly executes the COFF object file
>> output of the Microsoft C compiler. The entire x86UTM system works on
>> both Windows and Linux. It will also directly execute the output of the
>> GCC compiler when this output has been converted to the COFF format. An
>> open source utility is provided for this purpose.
>>
>> x86utm is based on a very superb x86 emulator. The only change the
>> needed to be made to the emulator was to very slightly adapt it to
>> compile under windows and add the feature of disassembling an object
>> file. All of the adaptations to transform this emulator into a master
>> UTM are contained in a single C++ source file.
>>
>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>> correctly decide halting of H_Hat()
>>
>> H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
>> H() decides that H_Hat() would not otherwise terminate. In this case H()
>> would stop executing H_Hat() and report Not_Halting behavior.
>>
>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
>> processes having their own: {Memory, registers and stack}
>> To make things simple the halt deciding aspect of H() and H_Hat() is the
>> same function. (see below)
>
> So what is this "the same function"? It looks like that function is
> DebugTrace(), right? (A better name might be Decide(), which expresses
> its role in the program, but no biggie.)
>
Both H() and H_Hat() invoke the same DebugTrace() function.
DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
otherwise terminate.
At the first point that DebugTrace() determines that M(N) would not
otherwise terminate it aborts the DebugStep() of M(N).
- #define MOV_EAX_0 __asm mov eax,0
- #define MOV_EAX_1 __asm mov eax,1
- #define HALT __asm hlt
- // N and M have the address of H_Hat()
- int H(u32 M, u32 N)
- {
- int Abort = DebugTrace(M, N);
- if (Abort)
- {
- MOV_EAX_0 // M(N) would not otherwise terminate
- HALT
- }
- else
- {
- MOV_EAX_1 // M(N) has terminated
- HALT
- }
- }
-
-
- int main()
- {
- u32 M = (u32)H_Hat;
- H(M, M);
- HALT;
- }
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-20 14:19 -0500 |
| Message-ID | <EdCdneTzL8uxpRLCnZ2dnUU7-KHNnZ2d@giganews.com> |
| In reply to | #24045 |
On 10/20/2020 1:40 PM, olcott wrote:
> On 10/20/2020 1:11 PM, Mike Terry wrote:
>> On 20/10/2020 17:33, olcott wrote:
>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>> the x86 language as its Turing Machine Description language.
>>>
>>> It is common knowledge that the RASP architecture is equivalent to a
>>> universal Turing machine. It is self-evident that the x86 language is a
>>> finite implementation of the Random Access Stored Program (RASP) model.
>>>
>>> x86 UTM has these four key operating system functions providing the
>>> functionality to transform an x86 emulator into a finite Universal
>>> Turing Machine: (Source code will be provided)
>>>
>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>> void SaveState(Registers* state);
>>> void LoadState(Registers* state);
>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>
>>> To make x86utm easy to use it directly executes the COFF object file
>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>> both Windows and Linux. It will also directly execute the output of the
>>> GCC compiler when this output has been converted to the COFF format. An
>>> open source utility is provided for this purpose.
>>>
>>> x86utm is based on a very superb x86 emulator. The only change the
>>> needed to be made to the emulator was to very slightly adapt it to
>>> compile under windows and add the feature of disassembling an object
>>> file. All of the adaptations to transform this emulator into a master
>>> UTM are contained in a single C++ source file.
>>>
>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>> correctly decide halting of H_Hat()
>>>
>>> H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
>>> H() decides that H_Hat() would not otherwise terminate. In this case H()
>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>
>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
>>> processes having their own: {Memory, registers and stack}
>>> To make things simple the halt deciding aspect of H() and H_Hat() is the
>>> same function. (see below)
>>
>> So what is this "the same function"? It looks like that function is
>> DebugTrace(), right? (A better name might be Decide(), which
>> expresses its role in the program, but no biggie.)
>>
>
> Both H() and H_Hat() invoke the same DebugTrace() function.
> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
> otherwise terminate.
>
> At the first point that DebugTrace() determines that M(N) would not
> otherwise terminate it aborts the DebugStep() of M(N).
>
> - #define MOV_EAX_0 __asm mov eax,0
> - #define MOV_EAX_1 __asm mov eax,1
> - #define HALT __asm hlt
> - // N and M have the address of H_Hat()
> - int H(u32 M, u32 N)
> - {
> - int Abort = DebugTrace(M, N);
> - if (Abort)
> - {
> - MOV_EAX_0 // M(N) would not otherwise terminate
> - HALT
> - }
> - else
> - {
> - MOV_EAX_1 // M(N) has terminated
> - HALT
> - }
> - }
> -
> -
> - int main()
> - {
> - u32 M = (u32)H_Hat;
> - H(M, M);
> - HALT;
> - }
>
All of the Input pairs {M, N} to H() that actually halt reach
MOV_EAX_1 // M(N) has terminated
All of the Input pairs {M, N} to H() that are decided would not
otherwise halt reach MOV_EAX_0 // M(N) would not otherwise terminate
Although there may be some cases that are very difficult to decide there
are no cases left that are impossible to decide.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 02:57 +0100 |
| Message-ID | <m5SdnWT29I_pCBLCnZ2dnUU78TnNnZ2d@brightview.co.uk> |
| In reply to | #24045 |
On 20/10/2020 19:40, olcott wrote:
> On 10/20/2020 1:11 PM, Mike Terry wrote:
>> On 20/10/2020 17:33, olcott wrote:
>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>> the x86 language as its Turing Machine Description language.
>>>
>>> It is common knowledge that the RASP architecture is equivalent to a
>>> universal Turing machine. It is self-evident that the x86 language is a
>>> finite implementation of the Random Access Stored Program (RASP) model.
>>>
>>> x86 UTM has these four key operating system functions providing the
>>> functionality to transform an x86 emulator into a finite Universal
>>> Turing Machine: (Source code will be provided)
>>>
>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>> void SaveState(Registers* state);
>>> void LoadState(Registers* state);
>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>
>>> To make x86utm easy to use it directly executes the COFF object file
>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>> both Windows and Linux. It will also directly execute the output of the
>>> GCC compiler when this output has been converted to the COFF format. An
>>> open source utility is provided for this purpose.
>>>
>>> x86utm is based on a very superb x86 emulator. The only change the
>>> needed to be made to the emulator was to very slightly adapt it to
>>> compile under windows and add the feature of disassembling an object
>>> file. All of the adaptations to transform this emulator into a master
>>> UTM are contained in a single C++ source file.
>>>
>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>> correctly decide halting of H_Hat()
>>>
>>> H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
>>> H() decides that H_Hat() would not otherwise terminate. In this case H()
>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>
>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
>>> processes having their own: {Memory, registers and stack}
>>> To make things simple the halt deciding aspect of H() and H_Hat() is the
>>> same function. (see below)
>>
>> So what is this "the same function"? It looks like that function is
>> DebugTrace(), right? (A better name might be Decide(), which
>> expresses its role in the program, but no biggie.)
>>
>
> Both H() and H_Hat() invoke the same DebugTrace() function.
> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
> otherwise terminate.
>
> At the first point that DebugTrace() determines that M(N) would not
> otherwise terminate it aborts the DebugStep() of M(N).
OK. I've added a valid implementation for H_Hat below. I've also added
an appropriate invocation for H_Hat in main(), but obviously main()
will only actually invoke one or the other, depending on whether we've
built the "run H" or "run H_Hat" machine.
(Hopefully this is equivalent to what you are doing... My actual
question at the end.)
>
> - #define MOV_EAX_0 __asm mov eax,0
> - #define MOV_EAX_1 __asm mov eax,1
> - #define HALT __asm hlt
> - // N and M have the address of H_Hat()
> - int H(u32 M, u32 N)
> - {
> - int Abort = DebugTrace(M, N);
> - if (Abort)
> - {
// DebugTrace says M(M) does not halt
> - MOV_EAX_0 // M(N) would not otherwise terminate
> - HALT
> - }
> - else
> - {
// DebugTrace says M(M) halts
> - MOV_EAX_1 // M(N) has terminated
> - HALT
> - }
> - }
> -
int H_Hat(u32 M)
{
int Abort = DebugTrace(M, M);
if (Abort)
{
// DebugTrace says M(M) does not halt
HALT // ..so we halt
}
else
{
// DebugTrace says M(M) halts
for (;;); // ..so we loop
}
}
> -
> - int main()
> - {
> - u32 M = (u32)H_Hat;
# ifdef RUN_H
> - H(M, M); // run H (H_Hat, H_Hat)
# else
H_Hat (M); // run H_Hat (H_Hat)
# endif
> - HALT;
> - }
>
So there are two execution contexts to consider where DebugTrace is
called - either from within H, or from within H_Hat. (Yes, these will
actually be in different "machines".) In both contexts, the DebugTrace
call receives the same parameters (H_Hat, H_Hat).
Can you confirm that in both the above execution paths, the
DebugTrace(H_Hat, H_Hat) returns the same return code? I don't know
what's in your DebugTrace(), but unless it's blatently cheating it will
return the same result if called with the same parameters, right?
Regards,
Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-20 22:07 -0500 |
| Message-ID | <45-dnc4wnct6OBLCnZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #24049 |
On 10/20/2020 8:57 PM, Mike Terry wrote:
> On 20/10/2020 19:40, olcott wrote:
>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>> On 20/10/2020 17:33, olcott wrote:
>>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>>> the x86 language as its Turing Machine Description language.
>>>>
>>>> It is common knowledge that the RASP architecture is equivalent to a
>>>> universal Turing machine. It is self-evident that the x86 language is a
>>>> finite implementation of the Random Access Stored Program (RASP) model.
>>>>
>>>> x86 UTM has these four key operating system functions providing the
>>>> functionality to transform an x86 emulator into a finite Universal
>>>> Turing Machine: (Source code will be provided)
>>>>
>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>> void SaveState(Registers* state);
>>>> void LoadState(Registers* state);
>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>
>>>> To make x86utm easy to use it directly executes the COFF object file
>>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>>> both Windows and Linux. It will also directly execute the output of the
>>>> GCC compiler when this output has been converted to the COFF format. An
>>>> open source utility is provided for this purpose.
>>>>
>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>> needed to be made to the emulator was to very slightly adapt it to
>>>> compile under windows and add the feature of disassembling an object
>>>> file. All of the adaptations to transform this emulator into a master
>>>> UTM are contained in a single C++ source file.
>>>>
>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>> correctly decide halting of H_Hat()
>>>>
>>>> H() continues to DebugStep() though H_Hat() until H_Hat() terminates or
>>>> H() decides that H_Hat() would not otherwise terminate. In this case
>>>> H()
>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>
>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
>>>> processes having their own: {Memory, registers and stack}
>>>> To make things simple the halt deciding aspect of H() and H_Hat() is
>>>> the
>>>> same function. (see below)
>>>
>>> So what is this "the same function"? It looks like that function is
>>> DebugTrace(), right? (A better name might be Decide(), which
>>> expresses its role in the program, but no biggie.)
>>>
>>
>> Both H() and H_Hat() invoke the same DebugTrace() function.
>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>> otherwise terminate.
>>
>> At the first point that DebugTrace() determines that M(N) would not
>> otherwise terminate it aborts the DebugStep() of M(N).
>
> OK. I've added a valid implementation for H_Hat below. I've also added
> an appropriate invocation for H_Hat in main(), but obviously main()
> will only actually invoke one or the other, depending on whether we've
> built the "run H" or "run H_Hat" machine.
> (Hopefully this is equivalent to what you are doing... My actual
> question at the end.)
>
I liked your simplest possible H_Hat() so I used it.
Immediately before I saw your simplest possible H_Hat() I had just
reduced the complexity of mine to be exactly the same so we are of one
mind on this.
// 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;
}
To make things easy I provided the actual code.
We don't need any compile time switch to execute H() and H_Hat().
H() executes H_Hat() in DebugTrace() mode which causes H_Hat() to
execute itself in DebugTrace() mode.
The invocation of H() is in one process context, the first invocation of
H_Hat() is in another process context, and the second invocation of
H_Hat() is in the third process context.
> So there are two execution contexts to consider where DebugTrace is
> called - either from within H, or from within H_Hat. (Yes, these will
> actually be in different "machines".) In both contexts, the DebugTrace
> call receives the same parameters (H_Hat, H_Hat).
>
> Can you confirm that in both the above execution paths, the
> DebugTrace(H_Hat, H_Hat) returns the same return code?
Yes.
> I don't know
> what's in your DebugTrace(), but unless it's blatently cheating it will
> return the same result if called with the same parameters, right?
>
> Regards,
> Mike.
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 16:28 +0100 |
| Message-ID | <AeKdnSTGuLEwzg3CnZ2dnUU78I_NnZ2d@brightview.co.uk> |
| In reply to | #24051 |
On 21/10/2020 04:07, olcott wrote:
> On 10/20/2020 8:57 PM, Mike Terry wrote:
>> On 20/10/2020 19:40, olcott wrote:
>>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>>> On 20/10/2020 17:33, olcott wrote:
>>>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>>>> the x86 language as its Turing Machine Description language.
>>>>>
>>>>> It is common knowledge that the RASP architecture is equivalent to a
>>>>> universal Turing machine. It is self-evident that the x86 language
>>>>> is a
>>>>> finite implementation of the Random Access Stored Program (RASP)
>>>>> model.
>>>>>
>>>>> x86 UTM has these four key operating system functions providing the
>>>>> functionality to transform an x86 emulator into a finite Universal
>>>>> Turing Machine: (Source code will be provided)
>>>>>
>>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>>> void SaveState(Registers* state);
>>>>> void LoadState(Registers* state);
>>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>>
>>>>> To make x86utm easy to use it directly executes the COFF object file
>>>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>>>> both Windows and Linux. It will also directly execute the output of
>>>>> the
>>>>> GCC compiler when this output has been converted to the COFF
>>>>> format. An
>>>>> open source utility is provided for this purpose.
>>>>>
>>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>>> needed to be made to the emulator was to very slightly adapt it to
>>>>> compile under windows and add the feature of disassembling an object
>>>>> file. All of the adaptations to transform this emulator into a master
>>>>> UTM are contained in a single C++ source file.
>>>>>
>>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>>> correctly decide halting of H_Hat()
>>>>>
>>>>> H() continues to DebugStep() though H_Hat() until H_Hat()
>>>>> terminates or
>>>>> H() decides that H_Hat() would not otherwise terminate. In this
>>>>> case H()
>>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>>
>>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are separate
>>>>> processes having their own: {Memory, registers and stack}
>>>>> To make things simple the halt deciding aspect of H() and H_Hat()
>>>>> is the
>>>>> same function. (see below)
>>>>
>>>> So what is this "the same function"? It looks like that function is
>>>> DebugTrace(), right? (A better name might be Decide(), which
>>>> expresses its role in the program, but no biggie.)
>>>>
>>>
>>> Both H() and H_Hat() invoke the same DebugTrace() function.
>>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>>> otherwise terminate.
>>>
>>> At the first point that DebugTrace() determines that M(N) would not
>>> otherwise terminate it aborts the DebugStep() of M(N).
>>
>> OK. I've added a valid implementation for H_Hat below. I've also
>> added an appropriate invocation for H_Hat in main(), but obviously
>> main() will only actually invoke one or the other, depending on
>> whether we've built the "run H" or "run H_Hat" machine.
>> (Hopefully this is equivalent to what you are doing... My actual
>> question at the end.)
>>
>
> I liked your simplest possible H_Hat() so I used it.
> Immediately before I saw your simplest possible H_Hat() I had just
> reduced the complexity of mine to be exactly the same so we are of one
> mind on this.
>
>
> // 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;
> }
>
> To make things easy I provided the actual code.
> We don't need any compile time switch to execute H() and H_Hat().
In the Linz proof, there are two separate TMs whose execution is considered:
H which runs with input (H^, H^), and halts in an
accept state or in a reject state
H^ which runs with input (H^) and either halts or
never halts
These two TMs, in your C program world, correspond to two COFF files:
one for H and one for H^. In my example you could generate the two COFF
files by defining (or not) the preprocessor symbol RUN_H. The C code
used for both COFF files is the same.
You have given the code for the H COFF file, and say there is no need
for any precompiler symbols, but you have not given the code for the H^
COFF file.
>
> H() executes H_Hat() in DebugTrace() mode
From a high level perspective, we can say H calls DebugTrace() which
returns an RC (return code) which is either zero or nonzero indicating
its decision that the examined calculation either halts [RC != 0] or
does not halt [RC=0].
What DebugTrace does internally matters to you (because you are writing
it), but not so much at this high level (which should turn out to be
enough to see your overall claim will not succeed).
> which causes H_Hat() to
> execute itself in DebugTrace() mode.
>
> The invocation of H() is in one process context, the first invocation of
> H_Hat() is in another process context, and the second invocation of
> H_Hat() is in the third process context.
>
(OK, but those low level details are not the focus of my post)
>> So there are two execution contexts to consider where DebugTrace is
>> called - either from within H, or from within H_Hat. (Yes, these will
>> actually be in different "machines".) In both contexts, the
>> DebugTrace call receives the same parameters (H_Hat, H_Hat).
>>
>> Can you confirm that in both the above execution paths, the
>> DebugTrace(H_Hat, H_Hat) returns the same return code?
>
> Yes.
>
You have said "yes", but I'm not certain that we're communicating
correctly. So far it seems to me you are only considering /one/ COFF
file? (The H COFF file).
Above, I mentioned execution contexts (or paths) and there are two of
these that matter at the high level I am interested in.
CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat) is
called ONCE at the highest level (from main()). [If DebugTrace()
internally results in further DebugTrace() invocations, at the high
level I'm considering those don't matter...]
CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
file. It is called ONCE at the highest level, from H_Hat which in turn
has just been called by main(). [Again, if DebugTrace() internally
results in further DebugTrace() invocations, at the high level I'm
considering those don't matter...]
My question was whether /those/ two specific calls to DebugTrace returns
the same RC.
Mike.
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 16:52 +0100 |
| Message-ID | <eNOdnfkALY7QxA3CnZ2dnUU78cPNnZ2d@brightview.co.uk> |
| In reply to | #24059 |
On 21/10/2020 16:28, Mike Terry wrote:
> On 21/10/2020 04:07, olcott wrote:
>> On 10/20/2020 8:57 PM, Mike Terry wrote:
>>> On 20/10/2020 19:40, olcott wrote:
>>>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>>>> On 20/10/2020 17:33, olcott wrote:
>>>>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>>>>> the x86 language as its Turing Machine Description language.
>>>>>>
>>>>>> It is common knowledge that the RASP architecture is equivalent to a
>>>>>> universal Turing machine. It is self-evident that the x86 language
>>>>>> is a
>>>>>> finite implementation of the Random Access Stored Program (RASP)
>>>>>> model.
>>>>>>
>>>>>> x86 UTM has these four key operating system functions providing the
>>>>>> functionality to transform an x86 emulator into a finite Universal
>>>>>> Turing Machine: (Source code will be provided)
>>>>>>
>>>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>>>> void SaveState(Registers* state);
>>>>>> void LoadState(Registers* state);
>>>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>>>
>>>>>> To make x86utm easy to use it directly executes the COFF object file
>>>>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>>>>> both Windows and Linux. It will also directly execute the output of
>>>>>> the
>>>>>> GCC compiler when this output has been converted to the COFF
>>>>>> format. An
>>>>>> open source utility is provided for this purpose.
>>>>>>
>>>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>>>> needed to be made to the emulator was to very slightly adapt it to
>>>>>> compile under windows and add the feature of disassembling an object
>>>>>> file. All of the adaptations to transform this emulator into a master
>>>>>> UTM are contained in a single C++ source file.
>>>>>>
>>>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>>>> correctly decide halting of H_Hat()
>>>>>>
>>>>>> H() continues to DebugStep() though H_Hat() until H_Hat()
>>>>>> terminates or
>>>>>> H() decides that H_Hat() would not otherwise terminate. In this
>>>>>> case H()
>>>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>>>
>>>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are
>>>>>> separate
>>>>>> processes having their own: {Memory, registers and stack}
>>>>>> To make things simple the halt deciding aspect of H() and H_Hat()
>>>>>> is the
>>>>>> same function. (see below)
>>>>>
>>>>> So what is this "the same function"? It looks like that function is
>>>>> DebugTrace(), right? (A better name might be Decide(), which
>>>>> expresses its role in the program, but no biggie.)
>>>>>
>>>>
>>>> Both H() and H_Hat() invoke the same DebugTrace() function.
>>>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>>>> otherwise terminate.
>>>>
>>>> At the first point that DebugTrace() determines that M(N) would not
>>>> otherwise terminate it aborts the DebugStep() of M(N).
>>>
>>> OK. I've added a valid implementation for H_Hat below. I've also
>>> added an appropriate invocation for H_Hat in main(), but obviously
>>> main() will only actually invoke one or the other, depending on
>>> whether we've built the "run H" or "run H_Hat" machine.
>>> (Hopefully this is equivalent to what you are doing... My actual
>>> question at the end.)
>>>
>>
>> I liked your simplest possible H_Hat() so I used it.
>> Immediately before I saw your simplest possible H_Hat() I had just
>> reduced the complexity of mine to be exactly the same so we are of one
>> mind on this.
>>
>>
>> // 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;
>> }
>>
>> To make things easy I provided the actual code.
>> We don't need any compile time switch to execute H() and H_Hat().
>
> In the Linz proof, there are two separate TMs whose execution is
> considered:
>
> H which runs with input (H^, H^), and halts in an
> accept state or in a reject state
>
> H^ which runs with input (H^) and either halts or
> never halts
>
> These two TMs, in your C program world, correspond to two COFF files:
> one for H and one for H^. In my example you could generate the two COFF
> files by defining (or not) the preprocessor symbol RUN_H. The C code
> used for both COFF files is the same.
>
> You have given the code for the H COFF file, and say there is no need
> for any precompiler symbols, but you have not given the code for the H^
> COFF file.
>
>>
>> H() executes H_Hat() in DebugTrace() mode
>
> From a high level perspective, we can say H calls DebugTrace() which
> returns an RC (return code) which is either zero or nonzero indicating
> its decision that the examined calculation either halts [RC != 0] or
> does not halt [RC=0].
Darn it! Despite trying to be careful it looks like I've still got the
RCs the wrong way round :(
DebugTrace RC=0: examined calculation terminates
RC nonzero: examined calculation does not terminate
>
> What DebugTrace does internally matters to you (because you are writing
> it), but not so much at this high level (which should turn out to be
> enough to see your overall claim will not succeed).
>
>> which causes H_Hat() to
>> execute itself in DebugTrace() mode.
>>
>> The invocation of H() is in one process context, the first invocation of
>> H_Hat() is in another process context, and the second invocation of
>> H_Hat() is in the third process context.
>>
>
> (OK, but those low level details are not the focus of my post)
>
>>> So there are two execution contexts to consider where DebugTrace is
>>> called - either from within H, or from within H_Hat. (Yes, these will
>>> actually be in different "machines".) In both contexts, the
>>> DebugTrace call receives the same parameters (H_Hat, H_Hat).
>>>
>>> Can you confirm that in both the above execution paths, the
>>> DebugTrace(H_Hat, H_Hat) returns the same return code?
>>
>> Yes.
>>
>
> You have said "yes", but I'm not certain that we're communicating
> correctly. So far it seems to me you are only considering /one/ COFF
> file? (The H COFF file).
>
> Above, I mentioned execution contexts (or paths) and there are two of
> these that matter at the high level I am interested in.
>
> CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat) is
> called ONCE at the highest level (from main()). [If DebugTrace()
> internally results in further DebugTrace() invocations, at the high
> level I'm considering those don't matter...]
>
> CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
> file. It is called ONCE at the highest level, from H_Hat which in turn
> has just been called by main(). [Again, if DebugTrace() internally
> results in further DebugTrace() invocations, at the high level I'm
> considering those don't matter...]
>
> My question was whether /those/ two specific calls to DebugTrace returns
> the same RC.
>
> Mike.
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 11:48 -0500 |
| Message-ID | <bKWdnQw504nz-w3CnZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #24059 |
On 10/21/2020 10:28 AM, Mike Terry wrote:
> On 21/10/2020 04:07, olcott wrote:
>> On 10/20/2020 8:57 PM, Mike Terry wrote:
>>> On 20/10/2020 19:40, olcott wrote:
>>>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>>>> On 20/10/2020 17:33, olcott wrote:
>>>>>> x86utm is as much as possible a Universal Turing Machine UTM that has
>>>>>> the x86 language as its Turing Machine Description language.
>>>>>>
>>>>>> It is common knowledge that the RASP architecture is equivalent to a
>>>>>> universal Turing machine. It is self-evident that the x86 language
>>>>>> is a
>>>>>> finite implementation of the Random Access Stored Program (RASP)
>>>>>> model.
>>>>>>
>>>>>> x86 UTM has these four key operating system functions providing the
>>>>>> functionality to transform an x86 emulator into a finite Universal
>>>>>> Turing Machine: (Source code will be provided)
>>>>>>
>>>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>>>> void SaveState(Registers* state);
>>>>>> void LoadState(Registers* state);
>>>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>>>
>>>>>> To make x86utm easy to use it directly executes the COFF object file
>>>>>> output of the Microsoft C compiler. The entire x86UTM system works on
>>>>>> both Windows and Linux. It will also directly execute the output of
>>>>>> the
>>>>>> GCC compiler when this output has been converted to the COFF
>>>>>> format. An
>>>>>> open source utility is provided for this purpose.
>>>>>>
>>>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>>>> needed to be made to the emulator was to very slightly adapt it to
>>>>>> compile under windows and add the feature of disassembling an object
>>>>>> file. All of the adaptations to transform this emulator into a master
>>>>>> UTM are contained in a single C++ source file.
>>>>>>
>>>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>>>> correctly decide halting of H_Hat()
>>>>>>
>>>>>> H() continues to DebugStep() though H_Hat() until H_Hat()
>>>>>> terminates or
>>>>>> H() decides that H_Hat() would not otherwise terminate. In this
>>>>>> case H()
>>>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>>>
>>>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are
>>>>>> separate
>>>>>> processes having their own: {Memory, registers and stack}
>>>>>> To make things simple the halt deciding aspect of H() and H_Hat()
>>>>>> is the
>>>>>> same function. (see below)
>>>>>
>>>>> So what is this "the same function"? It looks like that function is
>>>>> DebugTrace(), right? (A better name might be Decide(), which
>>>>> expresses its role in the program, but no biggie.)
>>>>>
>>>>
>>>> Both H() and H_Hat() invoke the same DebugTrace() function.
>>>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>>>> otherwise terminate.
>>>>
>>>> At the first point that DebugTrace() determines that M(N) would not
>>>> otherwise terminate it aborts the DebugStep() of M(N).
>>>
>>> OK. I've added a valid implementation for H_Hat below. I've also
>>> added an appropriate invocation for H_Hat in main(), but obviously
>>> main() will only actually invoke one or the other, depending on
>>> whether we've built the "run H" or "run H_Hat" machine.
>>> (Hopefully this is equivalent to what you are doing... My actual
>>> question at the end.)
>>>
>>
>> I liked your simplest possible H_Hat() so I used it.
>> Immediately before I saw your simplest possible H_Hat() I had just
>> reduced the complexity of mine to be exactly the same so we are of one
>> mind on this.
>>
>>
>> // 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;
>> }
>>
>> To make things easy I provided the actual code.
>> We don't need any compile time switch to execute H() and H_Hat().
>
> In the Linz proof, there are two separate TMs whose execution is
> considered:
>
> H which runs with input (H^, H^), and halts in an
> accept state or in a reject state
>
> H^ which runs with input (H^) and either halts or
> never halts
>
> These two TMs, in your C program world, correspond to two COFF files:
> one for H and one for H^. In my example you could generate the two COFF
> files by defining (or not) the preprocessor symbol RUN_H. The C code
> used for both COFF files is the same.
>
> You have given the code for the H COFF file, and say there is no need
> for any precompiler symbols, but you have not given the code for the H^
> COFF file.
Because every function that is invoked by DebugTrace() is executed in
its own separate process the source code that I provided specifies three
separate virtual machines:
(a) main() that executes H()
(b) The H_Hat() that is executed by H()
(c) The H_Hat() that is executed by itself.
The most difficult aspect of this was to make sure that DebugTrace()
could invoke itself recursively to an arbitrary depth. Each one of these
invocations is in its own separate process.
>>
>> H() executes H_Hat() in DebugTrace() mode
>
> From a high level perspective, we can say H calls DebugTrace() which
> returns an RC (return code) which is either zero or nonzero indicating
> its decision that the examined calculation either halts [RC != 0] or
> does not halt [RC=0].
>
> What DebugTrace does internally matters to you (because you are writing
> it), but not so much at this high level (which should turn out to be
> enough to see your overall claim will not succeed).
>
Yes I believe that is true.
The key to this is noticing that the halting question has been changed:
(a) Does H_Hat() halt on its input?
(b) Does the execution of H_Hat() have to be aborted to prevent the halt
decider from getting stuck in infinite execution?
I have one more key element that can best be demonstrated by fully
functional code.
>> which causes H_Hat() to
>> execute itself in DebugTrace() mode.
>>
>> The invocation of H() is in one process context, the first invocation of
>> H_Hat() is in another process context, and the second invocation of
>> H_Hat() is in the third process context.
>>
>
> (OK, but those low level details are not the focus of my post)
Those low level details are only required to understand that the source
code already specifies the execution of three separate virtual machines
thus no need for any compile-time switch.
>
>>> So there are two execution contexts to consider where DebugTrace is
>>> called - either from within H, or from within H_Hat. (Yes, these will
>>> actually be in different "machines".) In both contexts, the
>>> DebugTrace call receives the same parameters (H_Hat, H_Hat).
>>>
>>> Can you confirm that in both the above execution paths, the
>>> DebugTrace(H_Hat, H_Hat) returns the same return code?
>>
>> Yes.
>>
>
> You have said "yes", but I'm not certain that we're communicating
> correctly. So far it seems to me you are only considering /one/ COFF
> file? (The H COFF file).
>
As I have now fully elaborated the source file that I provided specifies
x86utm executing main() which executes H() which invokes H_Hat() in its
own separate process which invokes another H_Hat() in its own separate
process.
> Above, I mentioned execution contexts (or paths) and there are two of
> these that matter at the high level I am interested in.
>
> CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat) is
> called ONCE at the highest level (from main()). [If DebugTrace()
> internally results in further DebugTrace() invocations, at the high
> level I'm considering those don't matter...]
>
A new and totally separate execution context is created every single
time that DebugTrace() is invoked.
> CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
> file. It is called ONCE at the highest level, from H_Hat which in turn
> has just been called by main(). [Again, if DebugTrace() internally
> results in further DebugTrace() invocations, at the high level I'm
> considering those don't matter...]
>
> My question was whether /those/ two specific calls to DebugTrace returns
> the same RC.
>
> Mike.
>
As Ben has very carefully elaborated twice the invocation of a function
with the same input must result in the same output. The return value
from H_Hat() and the return value from H() are the same return value.
Like the Linz proof these "return values" are provided as halting in a
final state.
EAX = 0 means that the input program was aborted. EAX = 1 means that the
input program terminated.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 20:30 +0100 |
| Message-ID | <GZednZeIr8PMEQ3CnZ2dnUU78TvNnZ2d@brightview.co.uk> |
| In reply to | #24063 |
On 21/10/2020 17:48, olcott wrote:
> On 10/21/2020 10:28 AM, Mike Terry wrote:
>> On 21/10/2020 04:07, olcott wrote:
>>> On 10/20/2020 8:57 PM, Mike Terry wrote:
>>>> On 20/10/2020 19:40, olcott wrote:
>>>>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>>>>> On 20/10/2020 17:33, olcott wrote:
>>>>>>> x86utm is as much as possible a Universal Turing Machine UTM that
>>>>>>> has
>>>>>>> the x86 language as its Turing Machine Description language.
>>>>>>>
>>>>>>> It is common knowledge that the RASP architecture is equivalent to a
>>>>>>> universal Turing machine. It is self-evident that the x86 language
>>>>>>> is a
>>>>>>> finite implementation of the Random Access Stored Program (RASP)
>>>>>>> model.
>>>>>>>
>>>>>>> x86 UTM has these four key operating system functions providing the
>>>>>>> functionality to transform an x86 emulator into a finite Universal
>>>>>>> Turing Machine: (Source code will be provided)
>>>>>>>
>>>>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>>>>> void SaveState(Registers* state);
>>>>>>> void LoadState(Registers* state);
>>>>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>>>>
>>>>>>> To make x86utm easy to use it directly executes the COFF object file
>>>>>>> output of the Microsoft C compiler. The entire x86UTM system
>>>>>>> works on
>>>>>>> both Windows and Linux. It will also directly execute the output of
>>>>>>> the
>>>>>>> GCC compiler when this output has been converted to the COFF
>>>>>>> format. An
>>>>>>> open source utility is provided for this purpose.
>>>>>>>
>>>>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>>>>> needed to be made to the emulator was to very slightly adapt it to
>>>>>>> compile under windows and add the feature of disassembling an object
>>>>>>> file. All of the adaptations to transform this emulator into a
>>>>>>> master
>>>>>>> UTM are contained in a single C++ source file.
>>>>>>>
>>>>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>>>>> correctly decide halting of H_Hat()
>>>>>>>
>>>>>>> H() continues to DebugStep() though H_Hat() until H_Hat()
>>>>>>> terminates or
>>>>>>> H() decides that H_Hat() would not otherwise terminate. In this
>>>>>>> case H()
>>>>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>>>>
>>>>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are
>>>>>>> separate
>>>>>>> processes having their own: {Memory, registers and stack}
>>>>>>> To make things simple the halt deciding aspect of H() and H_Hat()
>>>>>>> is the
>>>>>>> same function. (see below)
>>>>>>
>>>>>> So what is this "the same function"? It looks like that function is
>>>>>> DebugTrace(), right? (A better name might be Decide(), which
>>>>>> expresses its role in the program, but no biggie.)
>>>>>>
>>>>>
>>>>> Both H() and H_Hat() invoke the same DebugTrace() function.
>>>>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>>>>> otherwise terminate.
>>>>>
>>>>> At the first point that DebugTrace() determines that M(N) would not
>>>>> otherwise terminate it aborts the DebugStep() of M(N).
>>>>
>>>> OK. I've added a valid implementation for H_Hat below. I've also
>>>> added an appropriate invocation for H_Hat in main(), but obviously
>>>> main() will only actually invoke one or the other, depending on
>>>> whether we've built the "run H" or "run H_Hat" machine.
>>>> (Hopefully this is equivalent to what you are doing... My actual
>>>> question at the end.)
>>>>
>>>
>>> I liked your simplest possible H_Hat() so I used it.
>>> Immediately before I saw your simplest possible H_Hat() I had just
>>> reduced the complexity of mine to be exactly the same so we are of one
>>> mind on this.
>>>
>>>
>>> // 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;
>>> }
>>>
>>> To make things easy I provided the actual code.
>>> We don't need any compile time switch to execute H() and H_Hat().
>>
>> In the Linz proof, there are two separate TMs whose execution is
>> considered:
>>
>> H which runs with input (H^, H^), and halts in an
>> accept state or in a reject state
>>
>> H^ which runs with input (H^) and either halts or
>> never halts
>>
>> These two TMs, in your C program world, correspond to two COFF files:
>> one for H and one for H^. In my example you could generate the two
>> COFF files by defining (or not) the preprocessor symbol RUN_H. The C
>> code used for both COFF files is the same.
>>
>> You have given the code for the H COFF file, and say there is no need
>> for any precompiler symbols, but you have not given the code for the
>> H^ COFF file.
>
> Because every function that is invoked by DebugTrace() is executed in
> its own separate process the source code that I provided specifies three
> separate virtual machines:
> (a) main() that executes H()
> (b) The H_Hat() that is executed by H()
> (c) The H_Hat() that is executed by itself.
Your claim is that you have two "TM-like-thingies" H and H^ where the
two calculations
H running with input (H^, H^)
H^ running with input (H^)
refute the Linz proof.
In your paradigm TM-like-entities translates to COFF files (with an
emulator providing the calculation side of things). So the /natural/
products you should deliver to support this are the two COFF files
demonstrating the claimed behaviour.
OK you're not going to do that, although it seems to me you /could/ do
that, at the cost of just 10 minutes of extra effort, and then your
delivery would logically match up with the claim you are making.
Instead you are effectively saying, "I don't need to spend those 10
minutes, because in fact if you understood the internals of how I've
implemented XXXXX you would see that the results that /would/ occur if I
spent the extra 10 minutes can instead be /deduced/ by looking at
particular subsets of the behaviour of the single COFF file. [Even
though the code provided so far, does not even shows any call H_Hat
(H_Hat).]
I won't bother arguing with any of that, although it's a strange.
>
> The most difficult aspect of this was to make sure that DebugTrace()
> could invoke itself recursively to an arbitrary depth. Each one of these
> invocations is in its own separate process.
>
>>>
>>> H() executes H_Hat() in DebugTrace() mode
>>
>> From a high level perspective, we can say H calls DebugTrace() which
>> returns an RC (return code) which is either zero or nonzero indicating
>> its decision that the examined calculation either halts [RC != 0] or
>> does not halt [RC=0].
>>
>> What DebugTrace does internally matters to you (because you are
>> writing it), but not so much at this high level (which should turn out
>> to be enough to see your overall claim will not succeed).
>>
>
> Yes I believe that is true.
> The key to this is noticing that the halting question has been changed:
> (a) Does H_Hat() halt on its input?
>
> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
> decider from getting stuck in infinite execution?
>
> I have one more key element that can best be demonstrated by fully
> functional code.
>
>>> which causes H_Hat() to
>>> execute itself in DebugTrace() mode.
>>>
>>> The invocation of H() is in one process context, the first invocation of
>>> H_Hat() is in another process context, and the second invocation of
>>> H_Hat() is in the third process context.
>>>
>>
>> (OK, but those low level details are not the focus of my post)
>
> Those low level details are only required to understand that the source
> code already specifies the execution of three separate virtual machines
> thus no need for any compile-time switch.
>
>>
>>>> So there are two execution contexts to consider where DebugTrace is
>>>> called - either from within H, or from within H_Hat. (Yes, these will
>>>> actually be in different "machines".) In both contexts, the
>>>> DebugTrace call receives the same parameters (H_Hat, H_Hat).
>>>>
>>>> Can you confirm that in both the above execution paths, the
>>>> DebugTrace(H_Hat, H_Hat) returns the same return code?
>>>
>>> Yes.
>>>
>>
>> You have said "yes", but I'm not certain that we're communicating
>> correctly. So far it seems to me you are only considering /one/ COFF
>> file? (The H COFF file).
>>
>
> As I have now fully elaborated the source file that I provided specifies
> x86utm executing main() which executes H() which invokes H_Hat() in its
> own separate process which invokes another H_Hat() in its own separate
> process.
>
>> Above, I mentioned execution contexts (or paths) and there are two of
>> these that matter at the high level I am interested in.
>>
>> CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat)
>> is called ONCE at the highest level (from main()). [If DebugTrace()
>> internally results in further DebugTrace() invocations, at the high
>> level I'm considering those don't matter...]
>>
>
> A new and totally separate execution context is created every single
> time that DebugTrace() is invoked.
>
>> CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
>> file. It is called ONCE at the highest level, from H_Hat which in
>> turn has just been called by main(). [Again, if DebugTrace()
>> internally results in further DebugTrace() invocations, at the high
>> level I'm considering those don't matter...]
>>
>> My question was whether /those/ two specific calls to DebugTrace
>> returns the same RC.
>>
>> Mike.
>>
>
> As Ben has very carefully elaborated twice the invocation of a function
> with the same input must result in the same output. The return value
> from H_Hat() and the return value from H() are the same return value.
Hopefully this is a typo - I asked about return codes from DebugTrace,
not from H or H_Hat. H^ in the Linz proof is not a decider of anything,
so output from H^ is irrelevant; all that matters is whether it halts.
I'll take it that you mean:
"The calls to DebugTrace() in the two contexts you've
described both return the same return code"
(It being understood that when my contexts refer to two COFF files, you
have equivalents in your single COFF file...)
Yes, both Ben and I and others have all elaborated that this /should/ be
the case, but I have to ask you, because it isn't clear to me that you
would necessarily agree on this point. If you did agree, your claim
would effectively be sunk, and you haven't withdrawn your claim of
refuting the Linz proof.
OK, so you say the calls to DebugTrace() in Context (1) and (2) return
the same result. There are just two possibilities:
*Both DebugTrace() RCs are zero* :
In Context (1) this indicates that H will decide that
calculation H_Hat (H_Hat) halts. (MOV_EAX_1; HALT; will
be executed.)
In Context (2) this means that the H_Hat code will take
the branch containing HERE: goto HERE;, and so H_Hat will
loop at this point.
So H clearly made the wrong halt decision for the calculation. OK, so
the other possibility is...
*Both DebugTrace() RCs are non-zero* :
In Context (1) this indicates that H will decide that
calculation H_Hat (H_Hat) does not halt. (MOV_EAX_0; HALT; will
be executed.)
In Context (2) this means that the H_Hat code will take
the branch containing MOV_EAX_0; HALT;, and so H_Hat(H_Hat)
will halt at this point.
Again H has made the wrong decision for the calculation.
Those are the only possibilities! So your "TM"s agree in behaviour with
the Linz proof. No refuting going on here! :)
Mike.
> Like the Linz proof these "return values" are provided as halting in a
> final state.
>
> EAX = 0 means that the input program was aborted. EAX = 1 means that the
> input program terminated.
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 15:27 -0500 |
| Message-ID | <U-mdnTnNTvFYBA3CnZ2dnUU7-L_NnZ2d@giganews.com> |
| In reply to | #24072 |
On 10/21/2020 2:30 PM, Mike Terry wrote:
> On 21/10/2020 17:48, olcott wrote:
>> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>> On 21/10/2020 04:07, olcott wrote:
>>>> On 10/20/2020 8:57 PM, Mike Terry wrote:
>>>>> On 20/10/2020 19:40, olcott wrote:
>>>>>> On 10/20/2020 1:11 PM, Mike Terry wrote:
>>>>>>> On 20/10/2020 17:33, olcott wrote:
>>>>>>>> x86utm is as much as possible a Universal Turing Machine UTM that
>>>>>>>> has
>>>>>>>> the x86 language as its Turing Machine Description language.
>>>>>>>>
>>>>>>>> It is common knowledge that the RASP architecture is equivalent
>>>>>>>> to a
>>>>>>>> universal Turing machine. It is self-evident that the x86 language
>>>>>>>> is a
>>>>>>>> finite implementation of the Random Access Stored Program (RASP)
>>>>>>>> model.
>>>>>>>>
>>>>>>>> x86 UTM has these four key operating system functions providing the
>>>>>>>> functionality to transform an x86 emulator into a finite Universal
>>>>>>>> Turing Machine: (Source code will be provided)
>>>>>>>>
>>>>>>>> u32* Allocate(u32 size); // Allocate bytes of memory
>>>>>>>> void SaveState(Registers* state);
>>>>>>>> void LoadState(Registers* state);
>>>>>>>> u32 DebugStep(Registers* master_state, Registers* slave_state);
>>>>>>>>
>>>>>>>> To make x86utm easy to use it directly executes the COFF object
>>>>>>>> file
>>>>>>>> output of the Microsoft C compiler. The entire x86UTM system
>>>>>>>> works on
>>>>>>>> both Windows and Linux. It will also directly execute the output of
>>>>>>>> the
>>>>>>>> GCC compiler when this output has been converted to the COFF
>>>>>>>> format. An
>>>>>>>> open source utility is provided for this purpose.
>>>>>>>>
>>>>>>>> x86utm is based on a very superb x86 emulator. The only change the
>>>>>>>> needed to be made to the emulator was to very slightly adapt it to
>>>>>>>> compile under windows and add the feature of disassembling an
>>>>>>>> object
>>>>>>>> file. All of the adaptations to transform this emulator into a
>>>>>>>> master
>>>>>>>> UTM are contained in a single C++ source file.
>>>>>>>>
>>>>>>>> Here is how x86UTM is applied to the Peter Linz H() and H_Hat() to
>>>>>>>> correctly decide halting of H_Hat()
>>>>>>>>
>>>>>>>> H() continues to DebugStep() though H_Hat() until H_Hat()
>>>>>>>> terminates or
>>>>>>>> H() decides that H_Hat() would not otherwise terminate. In this
>>>>>>>> case H()
>>>>>>>> would stop executing H_Hat() and report Not_Halting behavior.
>>>>>>>>
>>>>>>>> H() executes H_Hat() as if H() was a UTM. H() and H_Hat() are
>>>>>>>> separate
>>>>>>>> processes having their own: {Memory, registers and stack}
>>>>>>>> To make things simple the halt deciding aspect of H() and H_Hat()
>>>>>>>> is the
>>>>>>>> same function. (see below)
>>>>>>>
>>>>>>> So what is this "the same function"? It looks like that function is
>>>>>>> DebugTrace(), right? (A better name might be Decide(), which
>>>>>>> expresses its role in the program, but no biggie.)
>>>>>>>
>>>>>>
>>>>>> Both H() and H_Hat() invoke the same DebugTrace() function.
>>>>>> DebugTrace() continues a DebugStep() of M(N) unless M(N) would not
>>>>>> otherwise terminate.
>>>>>>
>>>>>> At the first point that DebugTrace() determines that M(N) would not
>>>>>> otherwise terminate it aborts the DebugStep() of M(N).
>>>>>
>>>>> OK. I've added a valid implementation for H_Hat below. I've also
>>>>> added an appropriate invocation for H_Hat in main(), but obviously
>>>>> main() will only actually invoke one or the other, depending on
>>>>> whether we've built the "run H" or "run H_Hat" machine.
>>>>> (Hopefully this is equivalent to what you are doing... My actual
>>>>> question at the end.)
>>>>>
>>>>
>>>> I liked your simplest possible H_Hat() so I used it.
>>>> Immediately before I saw your simplest possible H_Hat() I had just
>>>> reduced the complexity of mine to be exactly the same so we are of one
>>>> mind on this.
>>>>
>>>>
>>>> // 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;
>>>> }
>>>>
>>>> To make things easy I provided the actual code.
>>>> We don't need any compile time switch to execute H() and H_Hat().
>>>
>>> In the Linz proof, there are two separate TMs whose execution is
>>> considered:
>>>
>>> H which runs with input (H^, H^), and halts in an
>>> accept state or in a reject state
>>>
>>> H^ which runs with input (H^) and either halts or
>>> never halts
>>>
>>> These two TMs, in your C program world, correspond to two COFF files:
>>> one for H and one for H^. In my example you could generate the two
>>> COFF files by defining (or not) the preprocessor symbol RUN_H. The C
>>> code used for both COFF files is the same.
>>>
>>> You have given the code for the H COFF file, and say there is no need
>>> for any precompiler symbols, but you have not given the code for the
>>> H^ COFF file.
>>
>> Because every function that is invoked by DebugTrace() is executed in
>> its own separate process the source code that I provided specifies three
>> separate virtual machines:
>> (a) main() that executes H()
>> (b) The H_Hat() that is executed by H()
>> (c) The H_Hat() that is executed by itself.
>
> Your claim is that you have two "TM-like-thingies" H and H^ where the
> two calculations
> H running with input (H^, H^)
> H^ running with input (H^)
> refute the Linz proof.
>
> In your paradigm TM-like-entities translates to COFF files
No you are wrong and have been corrected on this several times.
> (with an
> emulator providing the calculation side of things). So the /natural/
> products you should deliver to support this are the two COFF files
> demonstrating the claimed behaviour.
>
> OK you're not going to do that, although it seems to me you /could/ do
> that, at the cost of just 10 minutes of extra effort, and then your
> delivery would logically match up with the claim you are making.
>
> Instead you are effectively saying, "I don't need to spend those 10
> minutes, because in fact if you understood the internals of how I've
> implemented XXXXX you would see that the results that /would/ occur if I
> spent the extra 10 minutes can instead be /deduced/ by looking at
> particular subsets of the behaviour of the single COFF file. [Even
> though the code provided so far, does not even shows any call H_Hat
> (H_Hat).]
>
> I won't bother arguing with any of that, although it's a strange.
>
>>
>> The most difficult aspect of this was to make sure that DebugTrace()
>> could invoke itself recursively to an arbitrary depth. Each one of these
>> invocations is in its own separate process.
>>
>>>>
>>>> H() executes H_Hat() in DebugTrace() mode
>>>
>>> From a high level perspective, we can say H calls DebugTrace() which
>>> returns an RC (return code) which is either zero or nonzero indicating
>>> its decision that the examined calculation either halts [RC != 0] or
>>> does not halt [RC=0].
>>>
>>> What DebugTrace does internally matters to you (because you are
>>> writing it), but not so much at this high level (which should turn out
>>> to be enough to see your overall claim will not succeed).
>>>
>>
>> Yes I believe that is true.
>> The key to this is noticing that the halting question has been changed:
>> (a) Does H_Hat() halt on its input?
>>
>> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
>> decider from getting stuck in infinite execution?
>>
>> I have one more key element that can best be demonstrated by fully
>> functional code.
>>
>>>> which causes H_Hat() to
>>>> execute itself in DebugTrace() mode.
>>>>
>>>> The invocation of H() is in one process context, the first
>>>> invocation of
>>>> H_Hat() is in another process context, and the second invocation of
>>>> H_Hat() is in the third process context.
>>>>
>>>
>>> (OK, but those low level details are not the focus of my post)
>>
>> Those low level details are only required to understand that the source
>> code already specifies the execution of three separate virtual machines
>> thus no need for any compile-time switch.
>>
>>>
>>>>> So there are two execution contexts to consider where DebugTrace is
>>>>> called - either from within H, or from within H_Hat. (Yes, these will
>>>>> actually be in different "machines".) In both contexts, the
>>>>> DebugTrace call receives the same parameters (H_Hat, H_Hat).
>>>>>
>>>>> Can you confirm that in both the above execution paths, the
>>>>> DebugTrace(H_Hat, H_Hat) returns the same return code?
>>>>
>>>> Yes.
>>>>
>>>
>>> You have said "yes", but I'm not certain that we're communicating
>>> correctly. So far it seems to me you are only considering /one/ COFF
>>> file? (The H COFF file).
>>>
>>
>> As I have now fully elaborated the source file that I provided specifies
>> x86utm executing main() which executes H() which invokes H_Hat() in its
>> own separate process which invokes another H_Hat() in its own separate
>> process.
>>
>>> Above, I mentioned execution contexts (or paths) and there are two of
>>> these that matter at the high level I am interested in.
>>>
>>> CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat)
>>> is called ONCE at the highest level (from main()). [If DebugTrace()
>>> internally results in further DebugTrace() invocations, at the high
>>> level I'm considering those don't matter...]
>>>
>>
>> A new and totally separate execution context is created every single
>> time that DebugTrace() is invoked.
>>
>>> CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
>>> file. It is called ONCE at the highest level, from H_Hat which in
>>> turn has just been called by main(). [Again, if DebugTrace()
>>> internally results in further DebugTrace() invocations, at the high
>>> level I'm considering those don't matter...]
>>>
>>> My question was whether /those/ two specific calls to DebugTrace
>>> returns the same RC.
>>>
>>> Mike.
>>>
>>
>> As Ben has very carefully elaborated twice the invocation of a function
>> with the same input must result in the same output. The return value
>> from H_Hat() and the return value from H() are the same return value.
>
> Hopefully this is a typo - I asked about return codes from DebugTrace,
The return value from DebugTrace() is the same for H() and H_Hat().
> not from H or H_Hat. H^ in the Linz proof is not a decider of anything,
> so output from H^ is irrelevant; all that matters is whether it halts.
>
> I'll take it that you mean:
>
> "The calls to DebugTrace() in the two contexts you've
> described both return the same return code"
>
Yes.
> (It being understood that when my contexts refer to two COFF files, you
> have equivalents in your single COFF file...)
>
> Yes, both Ben and I and others have all elaborated that this /should/ be
> the case,
No. Every software function having the same input can't possisbly have
different output.
> but I have to ask you, because it isn't clear to me that you
> would necessarily agree on this point. If you did agree, your claim
> would effectively be sunk, and you haven't withdrawn your claim of
> refuting the Linz proof.
>
>
> OK, so you say the calls to DebugTrace() in Context (1) and (2) return
> the same result. There are just two possibilities:
>
> *Both DebugTrace() RCs are zero* :
>
> In Context (1) this indicates that H will decide that
> calculation H_Hat (H_Hat) halts. (MOV_EAX_1; HALT; will
> be executed.)
>
> In Context (2) this means that the H_Hat code will take
> the branch containing HERE: goto HERE;, and so H_Hat will
> loop at this point.
>
> So H clearly made the wrong halt decision for the calculation. OK, so
> the other possibility is...
>
> *Both DebugTrace() RCs are non-zero* :
>
> In Context (1) this indicates that H will decide that
> calculation H_Hat (H_Hat) does not halt. (MOV_EAX_0; HALT; will
> be executed.)
>
> In Context (2) this means that the H_Hat code will take
> the branch containing MOV_EAX_0; HALT;, and so H_Hat(H_Hat)
> will halt at this point.
>
> Again H has made the wrong decision for the calculation.
>
No you have this incorrectly.
When I change the halting problem question:
(a) Does H_Hat() halt on its input?
(b) Does the execution of H_Hat() have to be aborted to prevent the halt
decider from getting stuck in infinite execution?
The previously undecidable halting problem becomes decidable.
There are no longer any cases that are impossible to decide:
(a) The input program must have its execution aborted.
(b) The input program continues to execute until its execution terminates.
> Those are the only possibilities! So your "TM"s agree in behaviour with
> the Linz proof. No refuting going on here! :)
>
> Mike.
>
>> Like the Linz proof these "return values" are provided as halting in a
>> final state.
>>
>> EAX = 0 means that the input program was aborted. EAX = 1 means that the
>> input program terminated.
>>
>>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 14:57 -0600 |
| Message-ID | <rmq7b9$9qd$1@dont-email.me> |
| In reply to | #24075 |
On 2020-10-21 14:27, olcott wrote: > When I change the halting problem question: > (a) Does H_Hat() halt on its input? > > (b) Does the execution of H_Hat() have to be aborted to prevent the halt > decider from getting stuck in infinite execution? > > The previously undecidable halting problem becomes decidable. When you change the halting problem question, then you are no longer addressing the halting problem. You are addressing some entirely different problem. > There are no longer any cases that are impossible to decide: > (a) The input program must have its execution aborted. Must have why? Because you got tired of waiting? How do you know it wouldn't have eventually halted on its own? I mean there may be cases where a given program is obviously stuck in an infinite loop (i.e. a very short loop), but there will also be cases where the program goes through a variety of states which don't end up repeating themselves until years or millennia into the future. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 16:12 -0500 |
| Message-ID | <bpednS7I0vq2OQ3CnZ2dnUU7-dHNnZ2d@giganews.com> |
| In reply to | #24077 |
On 10/21/2020 3:57 PM, André G. Isaak wrote: > On 2020-10-21 14:27, olcott wrote: > >> When I change the halting problem question: >> (a) Does H_Hat() halt on its input? >> >> (b) Does the execution of H_Hat() have to be aborted to prevent the >> halt decider from getting stuck in infinite execution? >> >> The previously undecidable halting problem becomes decidable. > > When you change the halting problem question, then you are no longer > addressing the halting problem. You are addressing some entirely > different problem. > Not when I change the question into an equlvalent question. >> There are no longer any cases that are impossible to decide: >> (a) The input program must have its execution aborted. > > Must have why? Because you got tired of waiting? How do you know it > wouldn't have eventually halted on its own? > The halt decider examines its input program and decides that it would never halt. When it does this it reports that its input program was aborted. This is the exact same question as the orginal halting problem question except that this equivalent question is not subject to pathological self reference. It divides all of its inputs into halting and not halting. > I mean there may be cases where a given program is obviously stuck in an > infinite loop (i.e. a very short loop), but there will also be cases > where the program goes through a variety of states which don't end up > repeating themselves until years or millennia into the future. > > André > I have not made solving the halting problem easy. I merely refuted the proofs that show it is impossible. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 15:54 -0600 |
| Message-ID | <rmqaml$v7r$1@dont-email.me> |
| In reply to | #24079 |
On 2020-10-21 15:12, olcott wrote: > On 10/21/2020 3:57 PM, André G. Isaak wrote: >> On 2020-10-21 14:27, olcott wrote: >> >>> When I change the halting problem question: >>> (a) Does H_Hat() halt on its input? >>> >>> (b) Does the execution of H_Hat() have to be aborted to prevent the >>> halt decider from getting stuck in infinite execution? >>> >>> The previously undecidable halting problem becomes decidable. >> >> When you change the halting problem question, then you are no longer >> addressing the halting problem. You are addressing some entirely >> different problem. >> > > Not when I change the question into an equlvalent question. If it really were the case that changing the question from (a) to (b) makes what was previously undecidable decidable, then obviously they cannot be equivalent questions. >>> There are no longer any cases that are impossible to decide: >>> (a) The input program must have its execution aborted. >> >> Must have why? Because you got tired of waiting? How do you know it >> wouldn't have eventually halted on its own? >> > > The halt decider examines its input program and decides that it would > never halt. When it does this it reports that its input program was > aborted. And it decides this how? That sounds like a restatement of the halting problem that you purport to be solving, so the above is entirely uninformative. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 17:20 -0500 |
| Message-ID | <BoSdnZA_U-2xKQ3CnZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #24081 |
On 10/21/2020 4:54 PM, André G. Isaak wrote: > On 2020-10-21 15:12, olcott wrote: >> On 10/21/2020 3:57 PM, André G. Isaak wrote: >>> On 2020-10-21 14:27, olcott wrote: >>> >>>> When I change the halting problem question: >>>> (a) Does H_Hat() halt on its input? >>>> >>>> (b) Does the execution of H_Hat() have to be aborted to prevent the >>>> halt decider from getting stuck in infinite execution? >>>> >>>> The previously undecidable halting problem becomes decidable. >>> >>> When you change the halting problem question, then you are no longer >>> addressing the halting problem. You are addressing some entirely >>> different problem. >>> >> >> Not when I change the question into an equlvalent question. > > If it really were the case that changing the question from (a) to (b) > makes what was previously undecidable decidable, then obviously they > cannot be equivalent questions. > >>>> There are no longer any cases that are impossible to decide: >>>> (a) The input program must have its execution aborted. >>> >>> Must have why? Because you got tired of waiting? How do you know it >>> wouldn't have eventually halted on its own? >>> >> >> The halt decider examines its input program and decides that it would >> never halt. When it does this it reports that its input program was >> aborted. > > And it decides this how? That sounds like a restatement of the halting > problem that you purport to be solving, so the above is entirely > uninformative. > > André Now that I have completed my x86utm operating system I finally have the required infrastructure to provide all the programming steps to decide whether or not H_Hat() must have its execution trace aborted because it would otherwise cause H() to be stuck in infinite execution or continue to DebugStep() H_Hat() until it completes its finite execution. The most difficult part of this was designing and implemented DebugTrace() so that it could DebugTrace() itself to an arbitrary recursive depth. All in all creating x86utm took about 2000 labor hours. The first 500 were wasted on trying to do everything from scratch. Even without providing anything more than I have already provided in this thread it should be able to be understood that the impossibility of solving the halting problem has been refuted by transforming the original question into an equivalent question that is not subject to pathological self-reference. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-22 00:16 +0100 |
| Message-ID | <87o8kvcgqb.fsf@bsb.me.uk> |
| In reply to | #24083 |
olcott <NoOne@NoWhere.com> writes: > Even without providing anything more than I have already provided in > this thread it should be able to be understood that the impossibility > of solving the halting problem has been refuted by transforming the > original question into an equivalent question that is not subject to > pathological self-reference. Now that your method has been revealed, please post what you had two years ago. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 18:28 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] |
| Message-ID | <V5mdnbCCqd27WQ3CnZ2dnUU7-X_NnZ2d@giganews.com> |
| In reply to | #24085 |
On 10/21/2020 6:16 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Even without providing anything more than I have already provided in >> this thread it should be able to be understood that the impossibility >> of solving the halting problem has been refuted by transforming the >> original question into an equivalent question that is not subject to >> pathological self-reference. > > Now that your method has been revealed, please post what you had two > years ago. > I am going beyond that. What I had two years ago was far too terse for anyone here to understand. Now that the man-years worth of work creating the x86utm operating system is totally complete I can write much more robust halt deciding code. If you can't see how I have already refuted the halting problem proofs by transforming the halting question: (a) Does H_Hat() halt on its input? Into an equivalent question that is not subject to pathological self-reference: (b) Does the execution of H_Hat() have to be aborted to prevent the halt decider from getting stuck in infinite execution? Then it makes no sense to provide the halt decider code. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-22 00:55 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] |
| Message-ID | <87d01bcey0.fsf@bsb.me.uk> |
| In reply to | #24086 |
olcott <NoOne@NoWhere.com> writes: > On 10/21/2020 6:16 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Even without providing anything more than I have already provided in >>> this thread it should be able to be understood that the impossibility >>> of solving the halting problem has been refuted by transforming the >>> original question into an equivalent question that is not subject to >>> pathological self-reference. >> >> Now that your method has been revealed, please post what you had two >> years ago. > > I am going beyond that. By which you mean no you won't? If you won't, please say so. People can then draw their own conclusions. I, for one, would really like to see what you had two years ago. It would, for example, explain exactly what you meant by an actual Turing machine, fully encoded. You have been less that forthcoming about what you meant when you said that. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 09:20 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] |
| Message-ID | <kPOdnYyc2q21CAzCnZ2dnUU7-XfNnZ2d@giganews.com> |
| In reply to | #24086 |
On 10/22/2020 5:28 AM, Malcolm McLean wrote: > On Thursday, 22 October 2020 at 00:28:58 UTC+1, olcott wrote: >> On 10/21/2020 6:16 PM, Ben Bacarisse wrote: >>> olcott <No...@NoWhere.com> writes: >>> >>>> Even without providing anything more than I have already provided in >>>> this thread it should be able to be understood that the impossibility >>>> of solving the halting problem has been refuted by transforming the >>>> original question into an equivalent question that is not subject to >>>> pathological self-reference. >>> >>> Now that your method has been revealed, please post what you had two >>> years ago. >>> >> >> I am going beyond that. What I had two years ago was far too terse for >> anyone here to understand. Now that the man-years worth of work creating >> the x86utm operating system is totally complete I can write much more >> robust halt deciding code. >> >> If you can't see how I have already refuted the halting problem proofs >> by transforming the halting question: >> (a) Does H_Hat() halt on its input? >> Into an equivalent question that is not subject to pathological >> self-reference: >> (b) Does the execution of H_Hat() have to be aborted to prevent the halt >> decider from getting stuck in infinite execution? >> Then it makes no sense to provide the halt decider code. >> > The question is whether, when you run the halt decider and it reports "abort", > is that an "abortion" because some calculation somewhere has been aborted, > or is it a "regular completed run", because the halt decider is itself a program > which has come to a conclusion? > In a computer or data transmission system, to abort means to terminate, usually in a controlled manner, a processing activity because it is impossible or undesirable for the activity to proceed or in conjunction with an error. Such an action may be accompanied by diagnostic information on the aborted process. https://en.wikipedia.org/wiki/Abort_(computing) -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 23:10 +0100 |
| Message-ID | <6IKdnaV9x8NcLA3CnZ2dnUU78W3NnZ2d@brightview.co.uk> |
| In reply to | #24075 |
On 21/10/2020 21:27, olcott wrote:
> On 10/21/2020 2:30 PM, Mike Terry wrote:
>> On 21/10/2020 17:48, olcott wrote:
>>> On 10/21/2020 10:28 AM, Mike Terry wrote:
>>>> On 21/10/2020 04:07, olcott wrote:
[... snip ...]
>>>>>
>>>>> I liked your simplest possible H_Hat() so I used it.
>>>>> Immediately before I saw your simplest possible H_Hat() I had just
>>>>> reduced the complexity of mine to be exactly the same so we are of one
>>>>> mind on this.
>>>>>
>>>>>
>>>>> // 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;
>>>>> }
>>>>>
[... snip ...]
>>>> Above, I mentioned execution contexts (or paths) and there are two of
>>>> these that matter at the high level I am interested in.
>>>>
>>>> CONTEXT 1: In the *H* COFF file execution, DebugTrace(H_Hat,H_Hat)
>>>> is called ONCE at the highest level (from main()). [If DebugTrace()
>>>> internally results in further DebugTrace() invocations, at the high
>>>> level I'm considering those don't matter...]
>>>>
>>>
>>> A new and totally separate execution context is created every single
>>> time that DebugTrace() is invoked.
>>>
>>>> CONTEXT 2: DebugTrace(H_Hat,H_Hat) is also called in the *H^* COFF
>>>> file. It is called ONCE at the highest level, from H_Hat which in
>>>> turn has just been called by main(). [Again, if DebugTrace()
>>>> internally results in further DebugTrace() invocations, at the high
>>>> level I'm considering those don't matter...]
>>>>
>>>> My question was whether /those/ two specific calls to DebugTrace
>>>> returns the same RC.
>>>>
>>>> Mike.
>>>>
>>>
>>> As Ben has very carefully elaborated twice the invocation of a function
>>> with the same input must result in the same output. The return value
>>> from H_Hat() and the return value from H() are the same return value.
>>
>> Hopefully this is a typo - I asked about return codes from DebugTrace,
>
> The return value from DebugTrace() is the same for H() and H_Hat().
>
>> not from H or H_Hat. H^ in the Linz proof is not a decider of
>> anything, so output from H^ is irrelevant; all that matters is whether
>> it halts.
>>
>
>> I'll take it that you mean:
>>
>> "The calls to DebugTrace() in the two contexts you've
>> described both return the same return code"
>>
>
> Yes.
>
[... snip ...]
>> OK, so you say the calls to DebugTrace() in Context (1) and (2) return
>> the same result. There are just two possibilities:
>>
>> *Both DebugTrace() RCs are zero* :
>>
>> In Context (1) this indicates that H will decide that
>> calculation H_Hat (H_Hat) halts. (MOV_EAX_1; HALT; will
>> be executed.)
>>
>> In Context (2) this means that the H_Hat code will take
>> the branch containing HERE: goto HERE;, and so H_Hat will
>> loop at this point.
>>
>> So H clearly made the wrong halt decision for the calculation. OK, so
>> the other possibility is...
>>
>> *Both DebugTrace() RCs are non-zero* :
>>
>> In Context (1) this indicates that H will decide that
>> calculation H_Hat (H_Hat) does not halt. (MOV_EAX_0; HALT; will
>> be executed.)
>>
>> In Context (2) this means that the H_Hat code will take
>> the branch containing MOV_EAX_0; HALT;, and so H_Hat(H_Hat)
>> will halt at this point.
>>
>> Again H has made the wrong decision for the calculation.
>>
>
> No you have this incorrectly.
You say that I have this incorrectly, without giving any indication of
what you think is incorrect. That looks like being deliberately unhelpful!
I'll have one more go - to save considering two alternatives for
everything, which of the above possibilities will actually occur in the
code you intend to finally deliver?
Will both the DebugTrace() return codes be ZERO, or will they be
NON-ZERO? (You previously agreed they would be the same...)
Mike.
>
> When I change the halting problem question:
> (a) Does H_Hat() halt on its input?
>
> (b) Does the execution of H_Hat() have to be aborted to prevent the halt
> decider from getting stuck in infinite execution?
>
> The previously undecidable halting problem becomes decidable.
>
> There are no longer any cases that are impossible to decide:
> (a) The input program must have its execution aborted.
>
> (b) The input program continues to execute until its execution terminates.
>
>
>> Those are the only possibilities! So your "TM"s agree in behaviour
>> with the Linz proof. No refuting going on here! :)
>>
>> Mike.
>>
>>> Like the Linz proof these "return values" are provided as halting in a
>>> final state.
>>>
>>> EAX = 0 means that the input program was aborted. EAX = 1 means that the
>>> input program terminated.
>>>
>>>
>
>
[toc] | [prev] | [next] | [standalone]
Page 1 of 25 [1] 2 3 … 25 Next page →
Back to top | Article view | comp.theory
csiph-web