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 9 of 25 — ← Prev page 1 … 7 8 [9] 10 11 … 25 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-10-29 16:01 -0400 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <8cFmH.385910$I15.114004@fx36.iad> |
| In reply to | #24627 |
On 10/29/20 1:41 PM, olcott wrote: > On 10/29/2020 11:32 AM, Richard Damon wrote: >> On 10/29/20 11:49 AM, olcott wrote: >>> On 10/29/2020 8:28 AM, Richard Damon wrote: >>>> On 10/29/20 8:55 AM, olcott wrote: >>>>>> >>>>> >>>>> This is not vague: >>>>> Intuitively, a decider should be a Turing machine that given an input, >>>>> halts and either accepts or rejects, relaying its answer in one of >>>>> many >>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or >>>>> leaving its answer on the output tape.Yuval Filmus >>>>> >>>>> https://cs.stackexchange.com/questions/84433/what-is-decider >>>>> >>>>> Yuval Filmus top 0.04% overall Assistant Professor in the >>>>> Department of >>>>> Computer Science at the Technion. >>>>> >>>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>>> input and Rejects HALTING input as follows: >>>>> >>>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state >>>>> transition at a time until it detects non-halting behavior or its >>>>> subordinate UTM has terminated normally. >>>>> >>>>> If the halt decider UTM detects non-halting behavior of its >>>>> subordinate >>>>> TM/UTM it simply stops executing the subordinate and transitions to >>>>> its >>>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED. >>>>> >>>>> If the subordinate TM/UTM terminates normally the halt decider UTM >>>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >>>> >>>> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which >>>> is the core issue that has been problem that has been proven to not be >>>> possible to build for the universal case. >>> >>> Yet if you are paying attention to what I am saying you will see that >>> the conventional halting problem trick cannot possibly be applied to do >>> the opposite of what ever the halt decider decides because in my >>> definition of a halt decider the first thing that the halt decider does >>> to indicate its decision is to terminate the execution of the input >>> program. >>> >>> This have been reviewed for more tan one week on there have been no >>> correct rebuttals. >>> >> >> You OBVIOUSLY are reading a different feed then I am, as almost >> universally people people are finding flaws in your work, > > Every "flaw" has been proved to be incorrect and then this proof is > simply ignored. No they haven't. You have just repeated you disproven claims, and rarely even address the points made. > >>>> Yes, you can detect a number of cases of detectable non-halting >>>> behavior, but some Machine/Input combinations are not decidable as >>>> to if >>>> they will halt or not. >>> >>> You cannot use examples of undecided problems and called them >>> undecidable. These example remain undecided and thus not undecidable. >> >> I can use a very decided problem and give them to your machine and it >> will not be able to correctly decide on them, at least from every thing >> you have said. > > So you have a problem that has been provably decided and also provably > undecidable by a machine. At most this would simply show that software > technology has not caught up to the capability of the human mind. And what you seem to miss is that part of Linz proof is showing that formalized computations will ALWAYS be behind what can be otherwise shown if the domain space is big enough. We can create problems we can not solve, We can know solutions we can not prove. > >> My H_Hat2 that always halts after using H(H_Hat2, H_Hat2) will be >> decided as 'aborted' when it clearly doesn't > > Please give me the cite on this in a form like this: > On 10/29/2020 11:32 AM, Richard Damon wrote: (You even replied to this message, so you did read it) Message-ID: <8VymH.133314$cc1.50205@fx29.iad> On 10/29/20 8:51 AM, Richard Damon wrote: > On 10/29/20 8:14 AM, olcott wrote: >> I spent a man year developing the x86utm operating system so that I >> could show every single detailed step of exactly how and why the Linz >> halt decider halts in its ((qn)) state. >> >> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine >> >> The reason that a halt decider can actually decide that the Linz H_Hat >> does not halt is based on the fact that it gets stuck in infinite >> recursion before it ever reaches its undecidable states. We can tell >> that it gets stuck in infinite recursion because it invokes the halt >> decider a second time from the same machine address without any >> conditional instructions in its execution trace in-between that would >> terminate this otherwise infinite recursion. I derived this solution >> 2018-12-13 @ 7:00 PM. > > The amount of time you wasted on this isn't the issue. It is that fact > that you still get the answer wrong. HOW the halt decider works isn't > really interesting, it is the answer it gives. > > Let us look at a slight variation of Linz, that has a clear answer, > > H_Hat2(N) does the same replication has H_Hat, calls H(N, N) like H_Hat, > but then halts whether H says halts or not. Clearly H_Hat2 halts, it has > no choice other than that. Simple inspection makes it clear that it MUST > halt (as H by its definition must have finite execution), and there is > no loops outside of H. > > But, run H(H_Hat2) and you decider will say that it has to be abort due > to infinite execution, because your H is faulty, fundamentally by its > structure. This says that your 'Halted'/'Needed to be Aborted' isn't > even a close alternative to the original 'Halted'/'Non-halting' > decision. Thus your revised halting problem says nothing about the > original problem Linz was dealing with. > > Again, this is like the classical Trisect an angle with compass and > straight edge, and saying you did it by bisection the angle twice, or > assuming the angle is known (like 90 degrees). > Note, that the issue isnt so muc that you decider doesn't decide, but that it gives the WRONG answer. If you declare that a machine has infinite execution and must have been terminated, for a machine that by even casual inspection terminates, then your decider is flawed. You seem to justify this by your 'changing the question', but as I have said, that is like claiming to have solved the angle trisection problem by doing two bisections. You have done something, but it doesn't answer the original problem, and your 'proof', because it uses a different question actuallys says NOTHING about Linz proof, as you are working from a different starting point. > >>> >>> You can imagine a program that never repeats the same state and never >>> halts. As soon as you prove that such an example exists you have made it >>> decidable. >> >> Yes, you can make the proof that it will never halt, but your machine >> will not be able to get the answer. > > If there is any proof that it will never halt then the machine can use > this same proof making it decidable for this machine. That is not true. There are an infinite number of proofs, so it would take an infinite time to determine that it is not provable. The decider MUST answer in finite time so can't exhaustively try every proof. The Human may have gotten lucky, perhaps the proof took hundreds of years for someone to get the right proof to show it. It may even be that the problem was designed based on a specific proof, but that proof may not be obvious in the final problem statement. The provider of the problem has an advantage here. There are many problems which we as humans have accepted as not proven (yet). The Universal Halt Decider doesn't have that option, if it is given a problem, to be true to its nature, it MUST give an answer. One of the big results of the proof that there can be no universal halt decider is that it shows that there is a possibility of having some propositions that we will not be able to decide if they are true or false. If a universal halt decider existed, then all that would be needed would be to Turing Machine to produce a counter example if one exists, and run the Halting Decider on it. The Halting Decider determining that the Turing Machine will never halt, would be proof that the proposition was true (assuming you could show that the machine would find a counter example in finite time if one existed). Theze are exactly the sort of problem that you 'emulation decider' fails at, as they don't 'repeat' to allow the detection of looping. > >> A halt decider machine that can only tell you if the machine will halt >> or not if you already know the answer is WORTHLESS. If that is really >> your basis, then you are in the wrong field. > > That is NOT my basis. > I have already provided my complete basis at least 20 times now: > > A non-halting decider can be defined that always Accepts NON_HALTING > input and Rejects HALTING input as follows: > > The NON_HALTING decider UTM executes its subordinate TM/UTM one state > transition at a time until it detects non-halting behavior or its > subordinate TM/UTM has terminated normally. > > If the halt decider UTM detects non-halting behavior of its subordinate > TM/UTM it simply stops executing the subordinate and transitions to its > own final state of NON_TERMINATING_BEHAVIOR_DETECTED. > > If the subordinate TM/UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. And either that gives the wrong answer to the halting problem in view (the one that Linz was working on) or it is non applicable to Linz's problem. Perhaps you have shown that for this DIFFERENT question, Linz's proof isn't applicable, but that doesn't mean you have broken Linz's proof for the REAL Halting Problem Question. You passionately avoid answering the question that people put to you to clerify this.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 15:58 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <2-6dnXrGGo57sQbCnZ2dnUU7-WvNnZ2d@giganews.com> |
| In reply to | #24646 |
On 10/29/2020 3:01 PM, Richard Damon wrote:
> On 10/29/20 1:41 PM, olcott wrote:
>> On 10/29/2020 11:32 AM, Richard Damon wrote:
>>> On 10/29/20 11:49 AM, olcott wrote:
>>>> On 10/29/2020 8:28 AM, Richard Damon wrote:
>>>>> On 10/29/20 8:55 AM, olcott wrote:
>>>>>>>
>>>>>>
>>>>>> This is not vague:
>>>>>> Intuitively, a decider should be a Turing machine that given an input,
>>>>>> halts and either accepts or rejects, relaying its answer in one of
>>>>>> many
>>>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>>>> leaving its answer on the output tape.Yuval Filmus
>>>>>>
>>>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>>>
>>>>>> Yuval Filmus top 0.04% overall Assistant Professor in the
>>>>>> Department of
>>>>>> Computer Science at the Technion.
>>>>>>
>>>>>> A non-halting decider can be defined that always Accepts NON_HALTING
>>>>>> input and Rejects HALTING input as follows:
>>>>>>
>>>>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>>>>>> transition at a time until it detects non-halting behavior or its
>>>>>> subordinate UTM has terminated normally.
>>>>>>
>>>>>> If the halt decider UTM detects non-halting behavior of its
>>>>>> subordinate
>>>>>> TM/UTM it simply stops executing the subordinate and transitions to
>>>>>> its
>>>>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>>>>>
>>>>>> If the subordinate TM/UTM terminates normally the halt decider UTM
>>>>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>>>>
>>>>> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
>>>>> is the core issue that has been problem that has been proven to not be
>>>>> possible to build for the universal case.
>>>>
>>>> Yet if you are paying attention to what I am saying you will see that
>>>> the conventional halting problem trick cannot possibly be applied to do
>>>> the opposite of what ever the halt decider decides because in my
>>>> definition of a halt decider the first thing that the halt decider does
>>>> to indicate its decision is to terminate the execution of the input
>>>> program.
>>>>
>>>> This have been reviewed for more tan one week on there have been no
>>>> correct rebuttals.
>>>>
>>>
>>> You OBVIOUSLY are reading a different feed then I am, as almost
>>> universally people people are finding flaws in your work,
>>
>> Every "flaw" has been proved to be incorrect and then this proof is
>> simply ignored.
>
> No they haven't. You have just repeated you disproven claims, and rarely
> even address the points made.
There has been no input to this function that has shown to be
undecidable: bool Aborted_Because_Non_Halting_Behavior_Detected(P, I)
Of the two attempts at rebuttal one of them has been refuted on the
basis that it was not input to that function.
The other was only a hypothetical thus not any actual input.
It was shown to be categorically impossible on the basis that there
cannot possibly be any input that has already been decided that can be
proved to be undecidable by the halt decider that I have defined.
If you can think of other examples or can overcome my refutation of the
above to please feel free as long as you honestly want a sincere dialogue.
>>>>> Yes, you can detect a number of cases of detectable non-halting
>>>>> behavior, but some Machine/Input combinations are not decidable as
>>>>> to if
>>>>> they will halt or not.
>>>>
>>>> You cannot use examples of undecided problems and called them
>>>> undecidable. These example remain undecided and thus not undecidable.
>>>
>>> I can use a very decided problem and give them to your machine and it
>>> will not be able to correctly decide on them, at least from every thing
>>> you have said.
>>
>> So you have a problem that has been provably decided and also provably
>> undecidable by a machine. At most this would simply show that software
>> technology has not caught up to the capability of the human mind.
>
> And what you seem to miss is that part of Linz proof is showing that
> formalized computations will ALWAYS be behind what can be otherwise
> shown if the domain space is big enough. We can create problems we can
> not solve, We can know solutions we can not prove.
That common misconception that my proof refutes. If you try to provide a
100% specific concrete example I will show the error.
>>
>>> My H_Hat2 that always halts after using H(H_Hat2, H_Hat2) will be
>>> decided as 'aborted' when it clearly doesn't
>>
>> Please give me the cite on this in a form like this:
>> On 10/29/2020 11:32 AM, Richard Damon wrote:
>
> (You even replied to this message, so you did read it)
> Message-ID: <8VymH.133314$cc1.50205@fx29.iad>
> On 10/29/20 8:51 AM, Richard Damon wrote:
I will try again and reply again.
OK, I just posted my reply.
Since it is clear that you want an honest dialogue to achieve mutual
understanding feel free to refer to prior posts in the same way and I
will add further elaboration.
>> On 10/29/20 8:14 AM, olcott wrote:
>>> I spent a man year developing the x86utm operating system so that I
>>> could show every single detailed step of exactly how and why the Linz
>>> halt decider halts in its ((qn)) state.
>>>
>>> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
>>>
>>> The reason that a halt decider can actually decide that the Linz H_Hat
>>> does not halt is based on the fact that it gets stuck in infinite
>>> recursion before it ever reaches its undecidable states. We can tell
>>> that it gets stuck in infinite recursion because it invokes the halt
>>> decider a second time from the same machine address without any
>>> conditional instructions in its execution trace in-between that would
>>> terminate this otherwise infinite recursion. I derived this solution
>>> 2018-12-13 @ 7:00 PM.
>>
>> The amount of time you wasted on this isn't the issue. It is that fact
>> that you still get the answer wrong. HOW the halt decider works isn't
>> really interesting, it is the answer it gives.
>>
>> Let us look at a slight variation of Linz, that has a clear answer,
>>
>> H_Hat2(N) does the same replication has H_Hat, calls H(N, N) like H_Hat,
>> but then halts whether H says halts or not. Clearly H_Hat2 halts, it has
>> no choice other than that. Simple inspection makes it clear that it MUST
>> halt (as H by its definition must have finite execution), and there is
>> no loops outside of H.
>>
>> But, run H(H_Hat2) and you decider will say that it has to be abort due
>> to infinite execution, because your H is faulty, fundamentally by its
>> structure. This says that your 'Halted'/'Needed to be Aborted' isn't
>> even a close alternative to the original 'Halted'/'Non-halting'
>> decision. Thus your revised halting problem says nothing about the
>> original problem Linz was dealing with.
>>
>> Again, this is like the classical Trisect an angle with compass and
>> straight edge, and saying you did it by bisection the angle twice, or
>> assuming the angle is known (like 90 degrees).
>>
>
> Note, that the issue isnt so muc that you decider doesn't decide, but
> that it gives the WRONG answer.
Although it may seem to do this because recursive invocations that are
several levels deep are hard to create in one's head it never really
does this.
> If you declare that a machine has
> infinite execution and must have been terminated, for a machine that by
> even casual inspection terminates, then your decider is flawed.
void H_Hat2(u32 P)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
HALT
else
HALT
}
Although it seems quite obvious that this function's input: H(H_Hat2)
must halt on its own without having its execution aborted this is not
true. It must have its execution aborted.
> You seem to justify this by your 'changing the question', but as I have
> said, that is like claiming to have solved the angle trisection problem
> by doing two bisections. You have done something, but it doesn't answer
> the original problem, and your 'proof', because it uses a different
> question actuallys says NOTHING about Linz proof, as you are working
> from a different starting point.
>
>>
>>>>
>>>> You can imagine a program that never repeats the same state and never
>>>> halts. As soon as you prove that such an example exists you have made it
>>>> decidable.
>>>
>>> Yes, you can make the proof that it will never halt, but your machine
>>> will not be able to get the answer.
>>
>> If there is any proof that it will never halt then the machine can use
>> this same proof making it decidable for this machine.
>
> That is not true. There are an infinite number of proofs, so it would
> take an infinite time to determine that it is not provable.
In the hypothetical case it was "given" that it is provable.
The machine could use the same categorical process of elimination that I
used to make the halting problem decidable and not need to execute an
infinite number of steps to find the proof. In any case if a proof
exists then it cannot be proved that the machine cannot possibly find
this proof.
> The decider
> MUST answer in finite time so can't exhaustively try every proof. The
> Human may have gotten lucky, perhaps the proof took hundreds of years
> for someone to get the right proof to show it. It may even be that the
> problem was designed based on a specific proof, but that proof may not
> be obvious in the final problem statement. The provider of the problem
> has an advantage here. There are many problems which we as humans have
> accepted as not proven (yet). The Universal Halt Decider doesn't have
> that option, if it is given a problem, to be true to its nature, it MUST
> give an answer.
In any case all of this talk is only bout whether or not I solved the
halting problem. That I proved that the conventional self-referential
halting problem proofs do not prove that a halt decider is impossible is
very much more obvious.
All of these proofs were based on a key trick that I overcame.
> One of the big results of the proof that there can be no universal halt
> decider is that it shows that there is a possibility of having some
> propositions that we will not be able to decide if they are true or
> false. If a universal halt decider existed, then all that would be
> needed would be to Turing Machine to produce a counter example if one
> exists, and run the Halting Decider on it. The Halting Decider
> determining that the Turing Machine will never halt, would be proof that
> the proposition was true (assuming you could show that the machine would
> find a counter example in finite time if one existed).
I redefined a halt decider so that examples of undecidable input can no
longer be shown. At the very least this very obviously refutes the
conclusion of all of the conventional self-referential halting problem
proofs. At the very best it provides the basic foundation for solving
the halting problem.
> Theze are exactly the sort of problem that you 'emulation decider' fails
> at, as they don't 'repeat' to allow the detection of looping.
>>
>>> A halt decider machine that can only tell you if the machine will halt
>>> or not if you already know the answer is WORTHLESS. If that is really
>>> your basis, then you are in the wrong field.
>>
>> That is NOT my basis.
>> I have already provided my complete basis at least 20 times now:
>>
>> A non-halting decider can be defined that always Accepts NON_HALTING
>> input and Rejects HALTING input as follows:
>>
>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>> transition at a time until it detects non-halting behavior or its
>> subordinate TM/UTM has terminated normally.
>>
>> If the halt decider UTM detects non-halting behavior of its subordinate
>> TM/UTM it simply stops executing the subordinate and transitions to its
>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>
>> If the subordinate TM/UTM terminates normally the halt decider UTM
>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>
> And either that gives the wrong answer to the halting problem in view
> (the one that Linz was working on) or it is non applicable to Linz's
> problem.
Wrong and Wrong.
> Perhaps you have shown that for this DIFFERENT question, Linz's proof
> isn't applicable, but that doesn't mean you have broken Linz's proof for
> the REAL Halting Problem Question.
>
> You passionately avoid answering the question that people put to you to
> clerify this.
>
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-29 06:28 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <b66cc5c7-2c8e-42ac-a6cf-8c4b8e0e4c88n@googlegroups.com> |
| In reply to | #24600 |
On Thursday, 29 October 2020 at 12:55:15 UTC, olcott wrote: > On 10/28/2020 7:02 PM, Ben Bacarisse wrote: > > olcott <No...@NoWhere.com> writes: > > > >> On 10/28/2020 4:57 AM, Malcolm McLean wrote: > > <cut> > >>> With my solution, although you do indeed provide a counter-example to the > >>> Linz proof, really what you are doing is exposing that the proof only applies > >>> to deciders which are Turing machines. And it's possible to trivially modify > >>> the proof to show that the halt-decider element of the almost-halt decider > >>> has a case it can't decide. > >> > >> I defined a NON_HALTING decider that always Accepts NON_HALTING input > >> and Rejects HALTING input. > > > > And again you are vague! It's not clear if this is deliberate or simply > > a consequence of the fact that you have trouble being precise. > This is not vague: > Intuitively, a decider should be a Turing machine that given an input, > halts and either accepts or rejects, relaying its answer in one of many > equivalent ways, such as halting at an ACCEPT or REJECT state, or > leaving its answer on the output tape.Yuval Filmus > > https://cs.stackexchange.com/questions/84433/what-is-decider > > Yuval Filmus top 0.04% overall Assistant Professor in the Department of > Computer Science at the Technion. > A non-halting decider can be defined that always Accepts NON_HALTING > input and Rejects HALTING input as follows: > > The NON_HALTING decider UTM executes its subordinate TM/UTM one state > transition at a time until it detects non-halting behavior or its > subordinate UTM has terminated normally. > > If the halt decider UTM detects non-halting behavior of its subordinate > TM/UTM it simply stops executing the subordinate and transitions to its > own final state of NON_TERMINATING_BEHAVIOR_DETECTED. > > If the subordinate TM/UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. > OK, so a halt decider takes two inputs, decides whether the program will terminate on that input or not on some basis or other (either by emulating it or by doing a code analysis). Then it goes into state HALTING or NON_ HALTING. We agree that the normal halt decider doesn't refute Linz. So what you have to make clear is the difference between the normal halt decider and your NON_TEMINATING_BEHAVIOR_DETECTED / SUBORDINATE_HAS_TERMINATED system. What's the crucial distinction which means that your system rebuts Linz?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 10:59 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <mMKdncu2nLNjewfCnZ2dnUU7-bvNnZ2d@giganews.com> |
| In reply to | #24608 |
On 10/29/2020 8:28 AM, Malcolm McLean wrote: > On Thursday, 29 October 2020 at 12:55:15 UTC, olcott wrote: >> On 10/28/2020 7:02 PM, Ben Bacarisse wrote: >>> olcott <No...@NoWhere.com> writes: >>> >>>> On 10/28/2020 4:57 AM, Malcolm McLean wrote: >>> <cut> >>>>> With my solution, although you do indeed provide a counter-example to the >>>>> Linz proof, really what you are doing is exposing that the proof only applies >>>>> to deciders which are Turing machines. And it's possible to trivially modify >>>>> the proof to show that the halt-decider element of the almost-halt decider >>>>> has a case it can't decide. >>>> >>>> I defined a NON_HALTING decider that always Accepts NON_HALTING input >>>> and Rejects HALTING input. >>> >>> And again you are vague! It's not clear if this is deliberate or simply >>> a consequence of the fact that you have trouble being precise. >> This is not vague: >> Intuitively, a decider should be a Turing machine that given an input, >> halts and either accepts or rejects, relaying its answer in one of many >> equivalent ways, such as halting at an ACCEPT or REJECT state, or >> leaving its answer on the output tape.Yuval Filmus >> >> https://cs.stackexchange.com/questions/84433/what-is-decider >> >> Yuval Filmus top 0.04% overall Assistant Professor in the Department of >> Computer Science at the Technion. >> A non-halting decider can be defined that always Accepts NON_HALTING >> input and Rejects HALTING input as follows: >> >> The NON_HALTING decider UTM executes its subordinate TM/UTM one state >> transition at a time until it detects non-halting behavior or its >> subordinate UTM has terminated normally. >> >> If the halt decider UTM detects non-halting behavior of its subordinate >> TM/UTM it simply stops executing the subordinate and transitions to its >> own final state of NON_TERMINATING_BEHAVIOR_DETECTED. >> >> If the subordinate TM/UTM terminates normally the halt decider UTM >> transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >> > OK, so a halt decider takes two inputs, decides whether the program will > terminate on that input or not on some basis or other (either by emulating > it or by doing a code analysis). Then it goes into state HALTING or NON_ > HALTING. > > We agree that the normal halt decider doesn't refute Linz. > We agree that the standard definition of a halt decider used in all of the conventional self-referential halting problem proofs is a halt decider that has some undecidable inputs. In other words all of the conventional self-referential halting problem proofs did indeed find one way to define a halt decider simply does not work. The huge mistake of all of these proofs is their presumption that the one way that they defined a halt decider is the only possible way to define a halt decider. The system that I used to find this other way is called categorically exhaustive reasoning. > So what you have to make clear is the difference between the normal halt > decider and your NON_TEMINATING_BEHAVIOR_DETECTED / > SUBORDINATE_HAS_TERMINATED system. > > What's the crucial distinction which means that your system rebuts Linz? > The first decision step of my halt decider is to stop executing its input. This makes it impossible for the input to do anything at all. If it is impossible for the input to do anything at all then it is impossible for the input to do the opposite of whatever the halt decider decides. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-29 09:50 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <75ad1637-70dc-4870-93f1-30dd061f7d2cn@googlegroups.com> |
| In reply to | #24616 |
On Thursday, 29 October 2020 at 16:00:07 UTC, olcott wrote:
> On 10/29/2020 8:28 AM, Malcolm McLean wrote:
> > On Thursday, 29 October 2020 at 12:55:15 UTC, olcott wrote:
> >> On 10/28/2020 7:02 PM, Ben Bacarisse wrote:
> >>> olcott <No...@NoWhere.com> writes:
> >>>
> >>>> On 10/28/2020 4:57 AM, Malcolm McLean wrote:
> >>> <cut>
> >>>>> With my solution, although you do indeed provide a counter-example to the
> >>>>> Linz proof, really what you are doing is exposing that the proof only applies
> >>>>> to deciders which are Turing machines. And it's possible to trivially modify
> >>>>> the proof to show that the halt-decider element of the almost-halt decider
> >>>>> has a case it can't decide.
> >>>>
> >>>> I defined a NON_HALTING decider that always Accepts NON_HALTING input
> >>>> and Rejects HALTING input.
> >>>
> >>> And again you are vague! It's not clear if this is deliberate or simply
> >>> a consequence of the fact that you have trouble being precise.
> >> This is not vague:
> >> Intuitively, a decider should be a Turing machine that given an input,
> >> halts and either accepts or rejects, relaying its answer in one of many
> >> equivalent ways, such as halting at an ACCEPT or REJECT state, or
> >> leaving its answer on the output tape.Yuval Filmus
> >>
> >> https://cs.stackexchange.com/questions/84433/what-is-decider
> >>
> >> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
> >> Computer Science at the Technion.
> >> A non-halting decider can be defined that always Accepts NON_HALTING
> >> input and Rejects HALTING input as follows:
> >>
> >> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
> >> transition at a time until it detects non-halting behavior or its
> >> subordinate UTM has terminated normally.
> >>
> >> If the halt decider UTM detects non-halting behavior of its subordinate
> >> TM/UTM it simply stops executing the subordinate and transitions to its
> >> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
> >>
> >> If the subordinate TM/UTM terminates normally the halt decider UTM
> >> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
> >>
> > OK, so a halt decider takes two inputs, decides whether the program will
> > terminate on that input or not on some basis or other (either by emulating
> > it or by doing a code analysis). Then it goes into state HALTING or NON_
> > HALTING.
> >
> > We agree that the normal halt decider doesn't refute Linz.
> >
> We agree that the standard definition of a halt decider used in all of
> the conventional self-referential halting problem proofs is a halt
> decider that has some undecidable inputs.
>
> In other words all of the conventional self-referential halting problem
> proofs did indeed find one way to define a halt decider simply does not
> work.
>
OK, so we agree that this
int H(u32 *M, u32 *N)
{
if (some_logic_which_is a pure_function(M, N))
return 1;
else
return 0;
}
WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
(Assuming it is a pure function, as suggested by the name, of course).
>
> The huge mistake of all of these proofs is their presumption that the
> one way that they defined a halt decider is the only possible way to
> define a halt decider.
>
> The system that I used to find this other way is called categorically
> exhaustive reasoning.
> > So what you have to make clear is the difference between the normal halt
> > decider and your NON_TEMINATING_BEHAVIOR_DETECTED /
> > SUBORDINATE_HAS_TERMINATED system.
> >
> > What's the crucial distinction which means that your system rebuts Linz?
> >
> The first decision step of my halt decider is to stop executing its
> input. This makes it impossible for the input to do anything at all.
>
> If it is impossible for the input to do anything at all then it is
> impossible for the input to do the opposite of whatever the halt decider
> decides.
>
I've suggested this and posted both compilable C code and pseudo-code.
However what has been missing from you is confirmation that this is indeed
the distinction you are making.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 12:48 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <ltmdnXI_5qfMnQbCnZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #24624 |
On 10/29/2020 11:50 AM, Malcolm McLean wrote:
> On Thursday, 29 October 2020 at 16:00:07 UTC, olcott wrote:
>> On 10/29/2020 8:28 AM, Malcolm McLean wrote:
>>> On Thursday, 29 October 2020 at 12:55:15 UTC, olcott wrote:
>>>> On 10/28/2020 7:02 PM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> On 10/28/2020 4:57 AM, Malcolm McLean wrote:
>>>>> <cut>
>>>>>>> With my solution, although you do indeed provide a counter-example to the
>>>>>>> Linz proof, really what you are doing is exposing that the proof only applies
>>>>>>> to deciders which are Turing machines. And it's possible to trivially modify
>>>>>>> the proof to show that the halt-decider element of the almost-halt decider
>>>>>>> has a case it can't decide.
>>>>>>
>>>>>> I defined a NON_HALTING decider that always Accepts NON_HALTING input
>>>>>> and Rejects HALTING input.
>>>>>
>>>>> And again you are vague! It's not clear if this is deliberate or simply
>>>>> a consequence of the fact that you have trouble being precise.
>>>> This is not vague:
>>>> Intuitively, a decider should be a Turing machine that given an input,
>>>> halts and either accepts or rejects, relaying its answer in one of many
>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>> leaving its answer on the output tape.Yuval Filmus
>>>>
>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>
>>>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>>>> Computer Science at the Technion.
>>>> A non-halting decider can be defined that always Accepts NON_HALTING
>>>> input and Rejects HALTING input as follows:
>>>>
>>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>>>> transition at a time until it detects non-halting behavior or its
>>>> subordinate UTM has terminated normally.
>>>>
>>>> If the halt decider UTM detects non-halting behavior of its subordinate
>>>> TM/UTM it simply stops executing the subordinate and transitions to its
>>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>>>
>>>> If the subordinate TM/UTM terminates normally the halt decider UTM
>>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>>>
>>> OK, so a halt decider takes two inputs, decides whether the program will
>>> terminate on that input or not on some basis or other (either by emulating
>>> it or by doing a code analysis). Then it goes into state HALTING or NON_
>>> HALTING.
>>>
>>> We agree that the normal halt decider doesn't refute Linz.
>>>
>> We agree that the standard definition of a halt decider used in all of
>> the conventional self-referential halting problem proofs is a halt
>> decider that has some undecidable inputs.
>>
>> In other words all of the conventional self-referential halting problem
>> proofs did indeed find one way to define a halt decider simply does not
>> work.
>>
> OK, so we agree that this
>
> int H(u32 *M, u32 *N)
> {
> if (some_logic_which_is a pure_function(M, N))
> return 1;
> else
> return 0;
> }
> WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
How many times do I have to say that my halt decider correctly decides
the Linz H_Hat() ??? This is my 2018-12-13 @ 7:00 PM solution.
x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
The RASP is a random-access machine (RAM) model that, unlike the RAM,
has its program in its "registers" together with its input. The
registers are unbounded (infinite in capacity); whether the number of
registers is finite is model-specific. Thus the RASP is to the RAM as
the Universal Turing machine is to the Turing machine. The RASP is an
example of the von Neumann architecture whereas the RAM is an example of
the Harvard architecture.
https://en.wikipedia.org/wiki/Random-access_stored-program_machine
> (Assuming it is a pure function, as suggested by the name, of course).
>>
>> The huge mistake of all of these proofs is their presumption that the
>> one way that they defined a halt decider is the only possible way to
>> define a halt decider.
>>
>> The system that I used to find this other way is called categorically
>> exhaustive reasoning.
>>> So what you have to make clear is the difference between the normal halt
>>> decider and your NON_TEMINATING_BEHAVIOR_DETECTED /
>>> SUBORDINATE_HAS_TERMINATED system.
>>>
>>> What's the crucial distinction which means that your system rebuts Linz?
>>>
>> The first decision step of my halt decider is to stop executing its
>> input. This makes it impossible for the input to do anything at all.
>>
>> If it is impossible for the input to do anything at all then it is
>> impossible for the input to do the opposite of whatever the halt decider
>> decides.
>>
> I've suggested this and posted both compilable C code and pseudo-code.
> However what has been missing from you is confirmation that this is indeed
> the distinction you are making.
The purpose of the compilable C code is to provide the high level
abstraction of the underlying x86 machine language. The actual halt
decider is x86 machine language and it makes its halting decision on the
basis of x86 machine language.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-29 11:51 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <7d2013c8-cba2-43ec-bdd6-14baef6f472en@googlegroups.com> |
| In reply to | #24628 |
On Thursday, 29 October 2020 at 17:48:09 UTC, olcott wrote:
> On 10/29/2020 11:50 AM, Malcolm McLean wrote:
>
> > OK, so we agree that this
> >
> > int H(u32 *M, u32 *N)
> > {
> > if (some_logic_which_is a pure_function(M, N))
> > return 1;
> > else
> > return 0;
> > }
> > WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
> How many times do I have to say that my halt decider correctly decides
> the Linz H_Hat() ??? This is my 2018-12-13 @ 7:00 PM solution.
> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
>
> The RASP is a random-access machine (RAM) model that, unlike the RAM,
> has its program in its "registers" together with its input. The
> registers are unbounded (infinite in capacity); whether the number of
> registers is finite is model-specific. Thus the RASP is to the RAM as
> the Universal Turing machine is to the Turing machine. The RASP is an
> example of the von Neumann architecture whereas the RAM is an example of
> the Harvard architecture.
>
> https://en.wikipedia.org/wiki/Random-access_stored-program_machine
>
I thought that the architecture of you halt decider was different to the one
normally employed, and this was the central insight.
You need to clarify this. You know what a "pure function" means, I take it.
Are offering something to replace "some_logic_which_is_a_pure_function"
or not?
> > (Assuming it is a pure function, as suggested by the name, of course).
> >>
> >> The huge mistake of all of these proofs is their presumption that the
> >> one way that they defined a halt decider is the only possible way to
> >> define a halt decider.
> >>
> >> The system that I used to find this other way is called categorically
> >> exhaustive reasoning.
> >>> So what you have to make clear is the difference between the normal halt
> >>> decider and your NON_TEMINATING_BEHAVIOR_DETECTED /
> >>> SUBORDINATE_HAS_TERMINATED system.
> >>>
> >>> What's the crucial distinction which means that your system rebuts Linz?
> >>>
> >> The first decision step of my halt decider is to stop executing its
> >> input. This makes it impossible for the input to do anything at all.
> >>
> >> If it is impossible for the input to do anything at all then it is
> >> impossible for the input to do the opposite of whatever the halt decider
> >> decides.
> >>
> > I've suggested this and posted both compilable C code and pseudo-code.
> > However what has been missing from you is confirmation that this is indeed
> > the distinction you are making.
> The purpose of the compilable C code is to provide the high level
> abstraction of the underlying x86 machine language. The actual halt
> decider is x86 machine language and it makes its halting decision on the
> basis of x86 machine language.
>
I provided compilable C code. There were two reasons for this. First, it
was asked for. And second, it meant that no-one could deny what the code
was doing. It was plain for all to see.
The question is whether the code I posted has relevance to what you are doing,.
As you say, the code I posted makes it impossible for the input to do the opposite
of what the halt decider decides.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 14:09 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <hridnaDAk7nCjgbCnZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #24638 |
On 10/29/2020 1:51 PM, Malcolm McLean wrote:
> On Thursday, 29 October 2020 at 17:48:09 UTC, olcott wrote:
>> On 10/29/2020 11:50 AM, Malcolm McLean wrote:
>>
>>> OK, so we agree that this
>>>
>>> int H(u32 *M, u32 *N)
>>> {
>>> if (some_logic_which_is a pure_function(M, N))
>>> return 1;
>>> else
>>> return 0;
>>> }
>>> WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
>> How many times do I have to say that my halt decider correctly decides
>> the Linz H_Hat() ??? This is my 2018-12-13 @ 7:00 PM solution.
>> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
>>
>> The RASP is a random-access machine (RAM) model that, unlike the RAM,
>> has its program in its "registers" together with its input. The
>> registers are unbounded (infinite in capacity); whether the number of
>> registers is finite is model-specific. Thus the RASP is to the RAM as
>> the Universal Turing machine is to the Turing machine. The RASP is an
>> example of the von Neumann architecture whereas the RAM is an example of
>> the Harvard architecture.
>>
>> https://en.wikipedia.org/wiki/Random-access_stored-program_machine
>>
> I thought that the architecture of you halt decider was different to the one
> normally employed, and this was the central insight.
>
> You need to clarify this. You know what a "pure function" means, I take it.
> Are offering something to replace "some_logic_which_is_a_pure_function"
> or not?
I mean this computer science definition of a decider:
Intuitively, a decider should be a Turing machine that given an input,
halts and either accepts or rejects, relaying its answer in one of many
equivalent ways, such as halting at an ACCEPT or REJECT state, or
leaving its answer on the output tape. Yuval Filmus
https://cs.stackexchange.com/questions/84433/what-is-decider
Yuval Filmus top 0.04% overall Assistant Professor in the Department of
Computer Science at the Technion.
>>> (Assuming it is a pure function, as suggested by the name, of course).
>>>>
>>>> The huge mistake of all of these proofs is their presumption that the
>>>> one way that they defined a halt decider is the only possible way to
>>>> define a halt decider.
>>>>
>>>> The system that I used to find this other way is called categorically
>>>> exhaustive reasoning.
>>>>> So what you have to make clear is the difference between the normal halt
>>>>> decider and your NON_TEMINATING_BEHAVIOR_DETECTED /
>>>>> SUBORDINATE_HAS_TERMINATED system.
>>>>>
>>>>> What's the crucial distinction which means that your system rebuts Linz?
>>>>>
>>>> The first decision step of my halt decider is to stop executing its
>>>> input. This makes it impossible for the input to do anything at all.
>>>>
>>>> If it is impossible for the input to do anything at all then it is
>>>> impossible for the input to do the opposite of whatever the halt decider
>>>> decides.
>>>>
>>> I've suggested this and posted both compilable C code and pseudo-code.
>>> However what has been missing from you is confirmation that this is indeed
>>> the distinction you are making.
>> The purpose of the compilable C code is to provide the high level
>> abstraction of the underlying x86 machine language. The actual halt
>> decider is x86 machine language and it makes its halting decision on the
>> basis of x86 machine language.
>>
> I provided compilable C code. There were two reasons for this. First, it
> was asked for. And second, it meant that no-one could deny what the code
> was doing. It was plain for all to see.
>
> The question is whether the code I posted has relevance to what you are doing,.
> As you say, the code I posted makes it impossible for the input to do the opposite
> of what the halt decider decides.
It will be soon enough when I have fully operational code that actually
uses the Linz H() to correctly decide the Linz H_Hat().
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-29 13:12 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <3db8eb81-42bf-4043-a234-af72f602bba8n@googlegroups.com> |
| In reply to | #24642 |
On Thursday, 29 October 2020 at 19:09:27 UTC, olcott wrote:
> On 10/29/2020 1:51 PM, Malcolm McLean wrote:
> > On Thursday, 29 October 2020 at 17:48:09 UTC, olcott wrote:
> >> On 10/29/2020 11:50 AM, Malcolm McLean wrote:
> >>
> >>> OK, so we agree that this
> >>>
> >>> int H(u32 *M, u32 *N)
> >>> {
> >>> if (some_logic_which_is a pure_function(M, N))
> >>> return 1;
> >>> else
> >>> return 0;
> >>> }
> >>> WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
> >> How many times do I have to say that my halt decider correctly decides
> >> the Linz H_Hat() ??? This is my 2018-12-13 @ 7:00 PM solution.
> >> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
> >>
> >> The RASP is a random-access machine (RAM) model that, unlike the RAM,
> >> has its program in its "registers" together with its input. The
> >> registers are unbounded (infinite in capacity); whether the number of
> >> registers is finite is model-specific. Thus the RASP is to the RAM as
> >> the Universal Turing machine is to the Turing machine. The RASP is an
> >> example of the von Neumann architecture whereas the RAM is an example of
> >> the Harvard architecture.
> >>
> >> https://en.wikipedia.org/wiki/Random-access_stored-program_machine
> >>
> > I thought that the architecture of you halt decider was different to the one
> > normally employed, and this was the central insight.
> >
> > You need to clarify this. You know what a "pure function" means, I take it.
> > Are offering something to replace "some_logic_which_is_a_pure_function"
> > or not?
> I mean this computer science definition of a decider:
> Intuitively, a decider should be a Turing machine that given an input,
> halts and either accepts or rejects, relaying its answer in one of many
> equivalent ways, such as halting at an ACCEPT or REJECT state, or
> leaving its answer on the output tape. Yuval Filmus
> https://cs.stackexchange.com/questions/84433/what-is-decider
>
> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
> Computer Science at the Technion.
> >
> > The question is whether the code I posted has relevance to what you are doing,.
> > As you say, the code I posted makes it impossible for the input to do the opposite
> > of what the halt decider decides.
> It will be soon enough when I have fully operational code that actually
> uses the Linz H() to correctly decide the Linz H_Hat().
>
You clearly have something, or you wouldn't so tenaciously insist that you had
refuted Linz. But I'd suggest that what you have isn't a Turing machine, or it isn't
a "pure function" to say the same thing ia different manner. We might have to wait
for the fully operational code to find out.
Any "pure function" has the same architecture as the conventional Linz H examples,
and we seemed to agree that none of these examples can refute Linz. So you
need something with a different architecture.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 16:08 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <p96dnTDZ5oGksgbCnZ2dnUU7-IXNnZ2d@giganews.com> |
| In reply to | #24648 |
On 10/29/2020 3:12 PM, Malcolm McLean wrote:
> On Thursday, 29 October 2020 at 19:09:27 UTC, olcott wrote:
>> On 10/29/2020 1:51 PM, Malcolm McLean wrote:
>>> On Thursday, 29 October 2020 at 17:48:09 UTC, olcott wrote:
>>>> On 10/29/2020 11:50 AM, Malcolm McLean wrote:
>>>>
>>>>> OK, so we agree that this
>>>>>
>>>>> int H(u32 *M, u32 *N)
>>>>> {
>>>>> if (some_logic_which_is a pure_function(M, N))
>>>>> return 1;
>>>>> else
>>>>> return 0;
>>>>> }
>>>>> WIll not refute Linz, whever we put in some_logic_which_is_a_pure_function.
>>>> How many times do I have to say that my halt decider correctly decides
>>>> the Linz H_Hat() ??? This is my 2018-12-13 @ 7:00 PM solution.
>>>> x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine
>>>>
>>>> The RASP is a random-access machine (RAM) model that, unlike the RAM,
>>>> has its program in its "registers" together with its input. The
>>>> registers are unbounded (infinite in capacity); whether the number of
>>>> registers is finite is model-specific. Thus the RASP is to the RAM as
>>>> the Universal Turing machine is to the Turing machine. The RASP is an
>>>> example of the von Neumann architecture whereas the RAM is an example of
>>>> the Harvard architecture.
>>>>
>>>> https://en.wikipedia.org/wiki/Random-access_stored-program_machine
>>>>
>>> I thought that the architecture of you halt decider was different to the one
>>> normally employed, and this was the central insight.
>>>
>>> You need to clarify this. You know what a "pure function" means, I take it.
>>> Are offering something to replace "some_logic_which_is_a_pure_function"
>>> or not?
>> I mean this computer science definition of a decider:
>> Intuitively, a decider should be a Turing machine that given an input,
>> halts and either accepts or rejects, relaying its answer in one of many
>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>> leaving its answer on the output tape. Yuval Filmus
>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>
>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>> Computer Science at the Technion.
>>>
>>> The question is whether the code I posted has relevance to what you are doing,.
>>> As you say, the code I posted makes it impossible for the input to do the opposite
>>> of what the halt decider decides.
>> It will be soon enough when I have fully operational code that actually
>> uses the Linz H() to correctly decide the Linz H_Hat().
>>
> You clearly have something, or you wouldn't so tenaciously insist that you had
> refuted Linz. But I'd suggest that what you have isn't a Turing machine, or it isn't
> a "pure function" to say the same thing ia different manner. We might have to wait
> for the fully operational code to find out.
> Any "pure function" has the same architecture as the conventional Linz H examples,
> and we seemed to agree that none of these examples can refute Linz. So you
> need something with a different architecture.
>
It is exactly and precisely the Linz proof with the value of the
wildcard state transitions: ⊢* filled in by an unexpected algorithm and
such that the meaning of qy and qn have been toggled and only reported
after the input has been terminated or has terminated on its own.
H.q0 wMw ⊢* H.qy
H.q0 wMw ⊢* H.qn
http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-29 22:51 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <87wnz8wsqo.fsf@bsb.me.uk> |
| In reply to | #24600 |
olcott <NoOne@NoWhere.com> writes: > On 10/28/2020 7:02 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: <cut> >>> I defined a NON_HALTING decider that always Accepts NON_HALTING input >>> and Rejects HALTING input. >> >> And again you are vague! It's not clear if this is deliberate or simply >> a consequence of the fact that you have trouble being precise. > > This is not vague: > > Intuitively, a decider should be a Turing machine that given an input, > halts and either accepts or rejects, relaying its answer in one of > many equivalent ways, such as halting at an ACCEPT or REJECT state, or > leaving its answer on the output tape. > Yuval Filmus Yes it is. But then it's from StackExchange. Precision was probably not called for. Mind you, I accept that it's less vague that what you wrote. > A non-halting decider can be defined that always Accepts NON_HALTING > input and Rejects HALTING input as follows: No decider can accept all, and only all, non-halting inputs, while rejecting all, and only all, halting ones. See the difference? (a) I don't use MAGIC_CAPS but technical terms like halting and non-halting. (b) I say exactly what inputs are accepted and which rejected by saying "all, and only all" rather than "always". But you don't claim to have this sort of impossible decider do you? If you do, specify it at least as clearly as I have or no one will know that it's impossible. Only impossible non-halting decider are worth paying attention to. If you don't, you need to say which halting and which non-halting inputs your non-halting decider gets wrong. It may still be impossible, and therefore interesting, but it too easy for a reader to assume it's just another decider for something or other. You've been asked this so many times, by so many people, that your refusal to say must mean that you either simply don't yet know, or you know that the answer is a problem for you. > The NON_HALTING decider UTM executes its subordinate TM/UTM one state > transition at a time until it detects non-halting behavior or its > subordinate UTM has terminated normally. > > If the halt decider UTM detects non-halting behavior of its > subordinate TM/UTM it simply stops executing the subordinate and > transitions to its own final state of > NON_TERMINATING_BEHAVIOR_DETECTED. > > If the subordinate TM/UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. If you think this sort of writing is not vague, you need to read more technical specifications. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 18:15 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <QNudnZR9Fq6e0AbCnZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #24658 |
On 10/29/2020 5:51 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/28/2020 7:02 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>> I defined a NON_HALTING decider that always Accepts NON_HALTING input >>>> and Rejects HALTING input. >>> >>> And again you are vague! It's not clear if this is deliberate or simply >>> a consequence of the fact that you have trouble being precise. >> >> This is not vague: >> >> Intuitively, a decider should be a Turing machine that given an input, >> halts and either accepts or rejects, relaying its answer in one of >> many equivalent ways, such as halting at an ACCEPT or REJECT state, or >> leaving its answer on the output tape. >> Yuval Filmus > > Yes it is. But then it's from StackExchange. Precision was probably > not called for. Mind you, I accept that it's less vague that what you > wrote. > >> A non-halting decider can be defined that always Accepts NON_HALTING >> input and Rejects HALTING input as follows: > > No decider can accept all, and only all, non-halting inputs, while > rejecting all, and only all, halting ones. > > See the difference? (a) I don't use MAGIC_CAPS but technical terms like > halting and non-halting. (b) I say exactly what inputs are accepted and > which rejected by saying "all, and only all" rather than "always". Yes that is the exactly kind of improvement in wording that I need to make my presentation conform somewhat more closely to an academic paper degree of professionalism. The non-halting decider that I defined accepts any and all non-halting inputs and rejects any and all halting inputs. I hope that you can get over your presumption that this is not true and pay enough attention to see how the non-halting decider that I defined utterly circumvents the conventional halting problem trick that makes the halting problem undecidable. > But you don't claim to have this sort of impossible decider do you? If > you do, specify it at least as clearly as I have or no one will know > that it's impossible. Only impossible non-halting decider are worth > paying attention to. The definition of the non-halting decider that I provided is exactly this. > If you don't, you need to say which halting and which non-halting inputs > your non-halting decider gets wrong. It may still be impossible, and > therefore interesting, but it too easy for a reader to assume it's just > another decider for something or other. > > You've been asked this so many times, by so many people, that your > refusal to say must mean that you either simply don't yet know, or you > know that the answer is a problem for you. As I have said many hundreds of times (and everyone totally ignores because they simply assume that I must be wrong) the non-halting decider that I have defined has no undecidable inputs. >> The NON_HALTING decider UTM executes its subordinate TM/UTM one state >> transition at a time until it detects non-halting behavior or its >> subordinate UTM has terminated normally. >> >> If the halt decider UTM detects non-halting behavior of its >> subordinate TM/UTM it simply stops executing the subordinate and >> transitions to its own final state of >> NON_TERMINATING_BEHAVIOR_DETECTED. >> >> If the subordinate TM/UTM terminates normally the halt decider UTM >> transitions to its own final state of SUBORDINATE_HAS_TERMINATED. > > If you think this sort of writing is not vague, you need to read more > technical specifications. > If you simply dogmatically say that it is vague I have no idea which details you believe are missing. If you state the details that you think are missing as question I can then provide these details. It should be clear even from the above terse definition that the halting problem trick that otherwise makes the halting problem undecidable has been utterly circumvented. The trick is to make an input that does the opposite of whatever the halt decider decides. This is not possible with the above non-halting decider definition. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-30 01:05 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <878sbowmjh.fsf@bsb.me.uk> |
| In reply to | #24659 |
olcott <NoOne@NoWhere.com> writes: > On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: <cut> >>> A non-halting decider can be defined that always Accepts NON_HALTING >>> input and Rejects HALTING input as follows: >> >> No decider can accept all, and only all, non-halting inputs, while >> rejecting all, and only all, halting ones. >> >> See the difference? (a) I don't use MAGIC_CAPS but technical terms like >> halting and non-halting. (b) I say exactly what inputs are accepted and >> which rejected by saying "all, and only all" rather than "always". > > Yes that is the exactly kind of improvement in wording that I need to > make my presentation conform somewhat more closely to an academic > paper degree of professionalism. > > The non-halting decider that I defined accepts any and all non-halting > inputs and rejects any and all halting inputs. Excellent. Very clear (though there is always the worry that you are using your own meanings for some of the words). No such decider can be written (you can, of course, define what must do). There is no point in insisting over and over that it can be written -- just write it! It will make you famous. But if you want a more productive use of your time, ask someone here to explain why there can be no such algorithm. Ask lots of supplementary questions, and then go and watch the dogs playing the park. > I hope that you can get over your presumption that this is not true > and pay enough attention to see how the non-halting decider that I > defined utterly circumvents the conventional halting problem trick > that makes the halting problem undecidable. It's not a presumption. There are theorems that say you are wrong. You don't yet have the program you claim you can write. It's you that is presuming things: that the theorems are wrong and you will be able to write the program. You once made a clear claim. That was wrong, and you've spent two years walking that claim back. You've made another clear claim now. Don't spend another two years reneging on it -- write the program. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 20:32 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <Bu2dnX5aar-s8AbCnZ2dnUU7-QXNnZ2d@giganews.com> |
| In reply to | #24660 |
On 10/29/2020 8:05 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>> input and Rejects HALTING input as follows: >>> >>> No decider can accept all, and only all, non-halting inputs, while >>> rejecting all, and only all, halting ones. >>> >>> See the difference? (a) I don't use MAGIC_CAPS but technical terms like >>> halting and non-halting. (b) I say exactly what inputs are accepted and >>> which rejected by saying "all, and only all" rather than "always". >> >> Yes that is the exactly kind of improvement in wording that I need to >> make my presentation conform somewhat more closely to an academic >> paper degree of professionalism. >> >> The non-halting decider that I defined accepts any and all non-halting >> inputs and rejects any and all halting inputs. > > Excellent. Very clear (though there is always the worry that you are > using your own meanings for some of the words). > > No such decider can be written (you can, of course, define what must > do). There is no point in insisting over and over that it can be > written -- just write it! It will make you famous. > > But if you want a more productive use of your time, ask someone here to > explain why there can be no such algorithm. Ask lots of supplementary > questions, and then go and watch the dogs playing the park. > >> I hope that you can get over your presumption that this is not true >> and pay enough attention to see how the non-halting decider that I >> defined utterly circumvents the conventional halting problem trick >> that makes the halting problem undecidable. > > It's not a presumption. There are theorems that say you are wrong. You > don't yet have the program you claim you can write. It's you that is > presuming things: that the theorems are wrong and you will be able to > write the program. > > You once made a clear claim. That was wrong, and you've spent two years > walking that claim back. You've made another clear claim now. Don't > spend another two years reneging on it -- write the program. > As usual you make completely sure to totally ignore how I proved that I am correct. In any case my proof is now simple enough that most any bright high school student knowing nothing about computer science can fully understand exactly why it must be totally correct. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-30 02:16 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <87361wwj8k.fsf@bsb.me.uk> |
| In reply to | #24661 |
olcott <NoOne@NoWhere.com> writes: > On 10/29/2020 8:05 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >> <cut> >>>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>>> input and Rejects HALTING input as follows: >>>> >>>> No decider can accept all, and only all, non-halting inputs, while >>>> rejecting all, and only all, halting ones. >>>> >>>> See the difference? (a) I don't use MAGIC_CAPS but technical terms like >>>> halting and non-halting. (b) I say exactly what inputs are accepted and >>>> which rejected by saying "all, and only all" rather than "always". >>> >>> Yes that is the exactly kind of improvement in wording that I need to >>> make my presentation conform somewhat more closely to an academic >>> paper degree of professionalism. >>> >>> The non-halting decider that I defined accepts any and all non-halting >>> inputs and rejects any and all halting inputs. >> >> Excellent. Very clear (though there is always the worry that you are >> using your own meanings for some of the words). >> >> No such decider can be written (you can, of course, define what must >> do). There is no point in insisting over and over that it can be >> written -- just write it! It will make you famous. <cut> >> You once made a clear claim. That was wrong, and you've spent two years >> walking that claim back. You've made another clear claim now. Don't >> spend another two years reneging on it -- write the program. > > As usual you make completely sure to totally ignore how I proved that > I am correct Where is the program you claim you can write? The "proving you are right" is not working out. You should try the "writing the code you said you could" plan instead. Of course I'm fine with you endlessly saying "this is how it will work" and "this show I could do it" because, as you can imagine, I would prefer you /not/ to write the code I'm saying can't be written! But so far, it's going well for me. How's it going for you? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 21:36 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <676dnd-PppGz4QbCnZ2dnUU7-b3NnZ2d@giganews.com> |
| In reply to | #24662 |
On 10/29/2020 9:16 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/29/2020 8:05 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>> <cut> >>>>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>>>> input and Rejects HALTING input as follows: >>>>> >>>>> No decider can accept all, and only all, non-halting inputs, while >>>>> rejecting all, and only all, halting ones. >>>>> >>>>> See the difference? (a) I don't use MAGIC_CAPS but technical terms like >>>>> halting and non-halting. (b) I say exactly what inputs are accepted and >>>>> which rejected by saying "all, and only all" rather than "always". >>>> >>>> Yes that is the exactly kind of improvement in wording that I need to >>>> make my presentation conform somewhat more closely to an academic >>>> paper degree of professionalism. >>>> >>>> The non-halting decider that I defined accepts any and all non-halting >>>> inputs and rejects any and all halting inputs. >>> >>> Excellent. Very clear (though there is always the worry that you are >>> using your own meanings for some of the words). >>> >>> No such decider can be written (you can, of course, define what must >>> do). There is no point in insisting over and over that it can be >>> written -- just write it! It will make you famous. > <cut> >>> You once made a clear claim. That was wrong, and you've spent two years >>> walking that claim back. You've made another clear claim now. Don't >>> spend another two years reneging on it -- write the program. >> >> As usual you make completely sure to totally ignore how I proved that >> I am correct > > Where is the program you claim you can write? The "proving you are > right" is not working out. You should try the "writing the code you > said you could" plan instead. > > Of course I'm fine with you endlessly saying "this is how it will work" > and "this show I could do it" because, as you can imagine, I would > prefer you /not/ to write the code I'm saying can't be written! > > But so far, it's going well for me. How's it going for you? > If you are not a learned-by-rote dogmatist you can understand how the following non-halting decider that accepts any and all non-halting inputs and rejects any and all halting inputs defeats the: "do the opposite of whatever the halting decider decides" halting problem trick. (perhaps you were not aware of this trick?) When the first step that a halt decider does to indicate its non-halting decision is stop executing its input, its input can't do anything at all because it is already terminated. A non-halting decider can be defined that always Accepts NON_HALTING input and Rejects HALTING input as follows: The NON_HALTING decider UTM executes its subordinate TM/UTM one state transition at a time until it detects non-halting behavior or its subordinate TM/UTM has terminated normally. If the halt decider UTM detects non-halting behavior of its subordinate TM/UTM it simply stops executing the subordinate and transitions to its own final state of NON_TERMINATING_BEHAVIOR_DETECTED. If the subordinate TM/UTM terminates normally the halt decider UTM transitions to its own final state of SUBORDINATE_HAS_TERMINATED. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 21:51 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <_OqdnfMDfvQ24gbCnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #24663 |
On 10/29/2020 9:36 PM, olcott wrote: > On 10/29/2020 9:16 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/29/2020 8:05 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>> <cut> >>>>>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>>>>> input and Rejects HALTING input as follows: >>>>>> >>>>>> No decider can accept all, and only all, non-halting inputs, while >>>>>> rejecting all, and only all, halting ones. >>>>>> >>>>>> See the difference? (a) I don't use MAGIC_CAPS but technical >>>>>> terms like >>>>>> halting and non-halting. (b) I say exactly what inputs are >>>>>> accepted and >>>>>> which rejected by saying "all, and only all" rather than "always". >>>>> >>>>> Yes that is the exactly kind of improvement in wording that I need to >>>>> make my presentation conform somewhat more closely to an academic >>>>> paper degree of professionalism. >>>>> >>>>> The non-halting decider that I defined accepts any and all non-halting >>>>> inputs and rejects any and all halting inputs. >>>> >>>> Excellent. Very clear (though there is always the worry that you are >>>> using your own meanings for some of the words). >>>> >>>> No such decider can be written (you can, of course, define what must >>>> do). There is no point in insisting over and over that it can be >>>> written -- just write it! It will make you famous. >> <cut> >>>> You once made a clear claim. That was wrong, and you've spent two >>>> years >>>> walking that claim back. You've made another clear claim now. Don't >>>> spend another two years reneging on it -- write the program. >>> >>> As usual you make completely sure to totally ignore how I proved that >>> I am correct >> >> Where is the program you claim you can write? The "proving you are >> right" is not working out. You should try the "writing the code you >> said you could" plan instead. >> >> Of course I'm fine with you endlessly saying "this is how it will work" >> and "this show I could do it" because, as you can imagine, I would >> prefer you /not/ to write the code I'm saying can't be written! >> >> But so far, it's going well for me. How's it going for you? >> > > If you are not a learned-by-rote dogmatist you can understand how the > following non-halting decider that accepts any and all non-halting > inputs and rejects any and all halting inputs defeats the: > > "do the opposite of whatever the halting decider decides" halting > problem trick. (perhaps you were not aware of this trick?) > > When the first step that a halt decider does to indicate its non-halting > decision is stop executing its input, its input can't do anything at all > because it is already terminated. Since it continues to watch the execution of its input looking for non-halting behavior (infinite loops, and infinite recursion) eventually its input halts. At this point it reports HALTING. In both of these two possible cases it has totally defeated the "do the opposite of whatever the halting decider decides" halting problem trick: Because in both of these cases the input has already terminated. Below explains how this is done using Turing machines: > A non-halting decider can be defined that always Accepts NON_HALTING > input and Rejects HALTING input as follows: > > The NON_HALTING decider UTM executes its subordinate TM/UTM one state > transition at a time until it detects non-halting behavior or its > subordinate TM/UTM has terminated normally. > > If the halt decider UTM detects non-halting behavior of its subordinate > TM/UTM it simply stops executing the subordinate and transitions to its > own final state of NON_TERMINATING_BEHAVIOR_DETECTED. > > If the subordinate TM/UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. > > -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-30 03:44 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <f1cbcdab-50b7-4e33-bfcd-a3f15eae79f3n@googlegroups.com> |
| In reply to | #24664 |
On Friday, 30 October 2020 at 02:51:31 UTC, olcott wrote: > On 10/29/2020 9:36 PM, olcott wrote: > > On 10/29/2020 9:16 PM, Ben Bacarisse wrote: > >> olcott <No...@NoWhere.com> writes: > >> > >>> On 10/29/2020 8:05 PM, Ben Bacarisse wrote: > >>>> olcott <No...@NoWhere.com> writes: > >>>> > >>>>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: > >>>>>> olcott <No...@NoWhere.com> writes: > >>>> <cut> > >>>>>>> A non-halting decider can be defined that always Accepts NON_HALTING > >>>>>>> input and Rejects HALTING input as follows: > >>>>>> > >>>>>> No decider can accept all, and only all, non-halting inputs, while > >>>>>> rejecting all, and only all, halting ones. > >>>>>> > >>>>>> See the difference? (a) I don't use MAGIC_CAPS but technical > >>>>>> terms like > >>>>>> halting and non-halting. (b) I say exactly what inputs are > >>>>>> accepted and > >>>>>> which rejected by saying "all, and only all" rather than "always". > >>>>> > >>>>> Yes that is the exactly kind of improvement in wording that I need to > >>>>> make my presentation conform somewhat more closely to an academic > >>>>> paper degree of professionalism. > >>>>> > >>>>> The non-halting decider that I defined accepts any and all non-halting > >>>>> inputs and rejects any and all halting inputs. > >>>> > >>>> Excellent. Very clear (though there is always the worry that you are > >>>> using your own meanings for some of the words). > >>>> > >>>> No such decider can be written (you can, of course, define what must > >>>> do). There is no point in insisting over and over that it can be > >>>> written -- just write it! It will make you famous. > >> <cut> > >>>> You once made a clear claim. That was wrong, and you've spent two > >>>> years > >>>> walking that claim back. You've made another clear claim now. Don't > >>>> spend another two years reneging on it -- write the program. > >>> > >>> As usual you make completely sure to totally ignore how I proved that > >>> I am correct > >> > >> Where is the program you claim you can write? The "proving you are > >> right" is not working out. You should try the "writing the code you > >> said you could" plan instead. > >> > >> Of course I'm fine with you endlessly saying "this is how it will work" > >> and "this show I could do it" because, as you can imagine, I would > >> prefer you /not/ to write the code I'm saying can't be written! > >> > >> But so far, it's going well for me. How's it going for you? > >> > > > > If you are not a learned-by-rote dogmatist you can understand how the > > following non-halting decider that accepts any and all non-halting > > inputs and rejects any and all halting inputs defeats the: > > > > "do the opposite of whatever the halting decider decides" halting > > problem trick. (perhaps you were not aware of this trick?) > > > > When the first step that a halt decider does to indicate its non-halting > > decision is stop executing its input, its input can't do anything at all > > because it is already terminated. > Since it continues to watch the execution of its input looking for > non-halting behavior (infinite loops, and infinite recursion) eventually > its input halts. At this point it reports HALTING. > > In both of these two possible cases it has totally defeated the > "do the opposite of whatever the halting decider decides" halting > problem trick: Because in both of these cases the input has already > terminated. > I don't think you've thought this through. I've suggested stubbing the function. If you do this, and run two tests, Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) and H_Hat(H_Hat), you'll see the problem. You mustn't omit the second test. That's the whole point.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-30 06:32 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <Vc6dnVluR4Z7ZAbCnZ2dnUU7-SPNnZ2d@giganews.com> |
| In reply to | #24669 |
On 10/30/2020 5:44 AM, Malcolm McLean wrote: > On Friday, 30 October 2020 at 02:51:31 UTC, olcott wrote: >> On 10/29/2020 9:36 PM, olcott wrote: >>> On 10/29/2020 9:16 PM, Ben Bacarisse wrote: >>>> olcott <No...@NoWhere.com> writes: >>>> >>>>> On 10/29/2020 8:05 PM, Ben Bacarisse wrote: >>>>>> olcott <No...@NoWhere.com> writes: >>>>>> >>>>>>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>>>>>>> olcott <No...@NoWhere.com> writes: >>>>>> <cut> >>>>>>>>> A non-halting decider can be defined that always Accepts NON_HALTING >>>>>>>>> input and Rejects HALTING input as follows: >>>>>>>> >>>>>>>> No decider can accept all, and only all, non-halting inputs, while >>>>>>>> rejecting all, and only all, halting ones. >>>>>>>> >>>>>>>> See the difference? (a) I don't use MAGIC_CAPS but technical >>>>>>>> terms like >>>>>>>> halting and non-halting. (b) I say exactly what inputs are >>>>>>>> accepted and >>>>>>>> which rejected by saying "all, and only all" rather than "always". >>>>>>> >>>>>>> Yes that is the exactly kind of improvement in wording that I need to >>>>>>> make my presentation conform somewhat more closely to an academic >>>>>>> paper degree of professionalism. >>>>>>> >>>>>>> The non-halting decider that I defined accepts any and all non-halting >>>>>>> inputs and rejects any and all halting inputs. >>>>>> >>>>>> Excellent. Very clear (though there is always the worry that you are >>>>>> using your own meanings for some of the words). >>>>>> >>>>>> No such decider can be written (you can, of course, define what must >>>>>> do). There is no point in insisting over and over that it can be >>>>>> written -- just write it! It will make you famous. >>>> <cut> >>>>>> You once made a clear claim. That was wrong, and you've spent two >>>>>> years >>>>>> walking that claim back. You've made another clear claim now. Don't >>>>>> spend another two years reneging on it -- write the program. >>>>> >>>>> As usual you make completely sure to totally ignore how I proved that >>>>> I am correct >>>> >>>> Where is the program you claim you can write? The "proving you are >>>> right" is not working out. You should try the "writing the code you >>>> said you could" plan instead. >>>> >>>> Of course I'm fine with you endlessly saying "this is how it will work" >>>> and "this show I could do it" because, as you can imagine, I would >>>> prefer you /not/ to write the code I'm saying can't be written! >>>> >>>> But so far, it's going well for me. How's it going for you? >>>> >>> >>> If you are not a learned-by-rote dogmatist you can understand how the >>> following non-halting decider that accepts any and all non-halting >>> inputs and rejects any and all halting inputs defeats the: >>> >>> "do the opposite of whatever the halting decider decides" halting >>> problem trick. (perhaps you were not aware of this trick?) >>> >>> When the first step that a halt decider does to indicate its non-halting >>> decision is stop executing its input, its input can't do anything at all >>> because it is already terminated. >> Since it continues to watch the execution of its input looking for >> non-halting behavior (infinite loops, and infinite recursion) eventually >> its input halts. At this point it reports HALTING. >> >> In both of these two possible cases it has totally defeated the >> "do the opposite of whatever the halting decider decides" halting >> problem trick: Because in both of these cases the input has already >> terminated. >> > I don't think you've thought this through. > > I've suggested stubbing the function. If you do this, and run two tests, > Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) > and H_Hat(H_Hat), you'll see the problem. > > You mustn't omit the second test. That's the whole point. > I know these execution traces very well because I have done them over and over again in my own mind many times over the last two years. The outermost invocation of this function bool Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) always returns true no matter what function call it. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-30 06:40 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ! ] |
| Message-ID | <iv-dnf2KQNs5ZgbCnZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #24671 |
On 10/30/2020 6:32 AM, olcott wrote: > On 10/30/2020 5:44 AM, Malcolm McLean wrote: >> On Friday, 30 October 2020 at 02:51:31 UTC, olcott wrote: >>> On 10/29/2020 9:36 PM, olcott wrote: >>>> On 10/29/2020 9:16 PM, Ben Bacarisse wrote: >>>>> olcott <No...@NoWhere.com> writes: >>>>> >>>>>> On 10/29/2020 8:05 PM, Ben Bacarisse wrote: >>>>>>> olcott <No...@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/29/2020 5:51 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <No...@NoWhere.com> writes: >>>>>>> <cut> >>>>>>>>>> A non-halting decider can be defined that always Accepts >>>>>>>>>> NON_HALTING >>>>>>>>>> input and Rejects HALTING input as follows: >>>>>>>>> >>>>>>>>> No decider can accept all, and only all, non-halting inputs, while >>>>>>>>> rejecting all, and only all, halting ones. >>>>>>>>> >>>>>>>>> See the difference? (a) I don't use MAGIC_CAPS but technical >>>>>>>>> terms like >>>>>>>>> halting and non-halting. (b) I say exactly what inputs are >>>>>>>>> accepted and >>>>>>>>> which rejected by saying "all, and only all" rather than "always". >>>>>>>> >>>>>>>> Yes that is the exactly kind of improvement in wording that I >>>>>>>> need to >>>>>>>> make my presentation conform somewhat more closely to an academic >>>>>>>> paper degree of professionalism. >>>>>>>> >>>>>>>> The non-halting decider that I defined accepts any and all >>>>>>>> non-halting >>>>>>>> inputs and rejects any and all halting inputs. >>>>>>> >>>>>>> Excellent. Very clear (though there is always the worry that you are >>>>>>> using your own meanings for some of the words). >>>>>>> >>>>>>> No such decider can be written (you can, of course, define what must >>>>>>> do). There is no point in insisting over and over that it can be >>>>>>> written -- just write it! It will make you famous. >>>>> <cut> >>>>>>> You once made a clear claim. That was wrong, and you've spent two >>>>>>> years >>>>>>> walking that claim back. You've made another clear claim now. Don't >>>>>>> spend another two years reneging on it -- write the program. >>>>>> >>>>>> As usual you make completely sure to totally ignore how I proved that >>>>>> I am correct >>>>> >>>>> Where is the program you claim you can write? The "proving you are >>>>> right" is not working out. You should try the "writing the code you >>>>> said you could" plan instead. >>>>> >>>>> Of course I'm fine with you endlessly saying "this is how it will >>>>> work" >>>>> and "this show I could do it" because, as you can imagine, I would >>>>> prefer you /not/ to write the code I'm saying can't be written! >>>>> >>>>> But so far, it's going well for me. How's it going for you? >>>>> >>>> >>>> If you are not a learned-by-rote dogmatist you can understand how the >>>> following non-halting decider that accepts any and all non-halting >>>> inputs and rejects any and all halting inputs defeats the: >>>> >>>> "do the opposite of whatever the halting decider decides" halting >>>> problem trick. (perhaps you were not aware of this trick?) >>>> >>>> When the first step that a halt decider does to indicate its >>>> non-halting >>>> decision is stop executing its input, its input can't do anything at >>>> all >>>> because it is already terminated. >>> Since it continues to watch the execution of its input looking for >>> non-halting behavior (infinite loops, and infinite recursion) eventually >>> its input halts. At this point it reports HALTING. >>> >>> In both of these two possible cases it has totally defeated the >>> "do the opposite of whatever the halting decider decides" halting >>> problem trick: Because in both of these cases the input has already >>> terminated. >>> >> I don't think you've thought this through. >> >> I've suggested stubbing the function. If you do this, and run two tests, >> Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) >> and H_Hat(H_Hat), you'll see the problem. >> >> You mustn't omit the second test. That's the whole point. >> > > I know these execution traces very well because I have done them over > and over again in my own mind many times over the last two years. > > The outermost invocation of this function > bool Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) > always returns true no matter what function calls it. This is the key aspect of the execution trace that forms the basis for deciding H_Hat: (All two years of my work has this as its foundation) This is the exact same 2018-12-13 @ 7:00 PM solution Detect that the halt decider is invoked two times from the same machine address without any conditional branch instructions in the execution trace of H_Hat that would terminate this otherwise infinite recursion. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 9 of 25 — ← Prev page 1 … 7 8 [9] 10 11 … 25 Next page →
Back to top | Article view | comp.theory
csiph-web