Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #155812 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-10-20 11:33 -0500 |
| Last post | 2020-11-06 20:34 -0800 |
| Articles | 20 on this page of 256 — 15 participants |
Back to article view | Back to comp.lang.c
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 ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-20 14:26 -0700
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:41 +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 ] 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 ] 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 ] 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 ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-10-22 17:21 -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: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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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) [ 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 ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 03:28 -0700
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 ] 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 ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 08:07 -0700
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] olcott <NoOne@NoWhere.com> - 2020-10-22 19:09 -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-22 21: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-22 23:31 -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 20:36 -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 22:18 -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-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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 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 ] 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 ] 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 ] 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 ] 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 ] olcott <NoOne@NoWhere.com> - 2020-10-27 14:44 -0500
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 ] 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 ] 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 ] 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 ] 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 ] olcott <NoOne@NoWhere.com> - 2020-10-29 12:48 -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 13:57 -0600
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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-23 18:14 -0500
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] olcott <NoOne@NoWhere.com> - 2020-10-25 10:33 -0500
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] olcott <NoOne@NoWhere.com> - 2020-10-25 16:07 -0500
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 ] 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 ] 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 ] 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 ] 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 ] 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-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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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-26 16:35 -0500
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-27 03:18 -0700
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 ] 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-24 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 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 ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-25 01:07 -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:07 -0500
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 ] 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 ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-22 09:09 -0700
Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] olcott <NoOne@NoWhere.com> - 2020-10-22 11: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-22 20:41 +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 ] 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 ] 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 ] olcott <NoOne@NoWhere.com> - 2020-10-23 12:40 -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-21 22:42 +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 16:56 -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:25 +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 23:26 +0100
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 [ 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) [ 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
Re: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ definition of H ] audating801@gmail.com - 2020-11-06 20:34 -0800
Page 8 of 13 — ← Prev page 1 … 6 7 [8] 9 10 … 13 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 14:44 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <sJidnZrphpko5QXCnZ2dnUU7-ImdnZ2d@giganews.com> |
| In reply to | #156162 |
On 10/27/2020 2:05 PM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 18:36:55 UTC, olcott wrote: >> On 10/27/2020 11:53 AM, Malcolm McLean wrote: >>> On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: >>>> On 10/27/2020 10:45 AM, Malcolm McLean wrote: >>>>> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >>>>>> >>>>>>> Here's the code >>>>>> Is this code from PO, or is it your code? >>>>>> >>>>>> It is hard enough work dealing with PO, and I don't want to spend much >>>>>> time on /your/ arguments, even if you believe you are making the same >>>>>> argument as PO. If you feel that you have some insight into PO's >>>>>> thinking, by all means respond to my posts saying what you think, but I >>>>>> will probably not seriously engage with you. (I will read what you say >>>>>> at least, and might respond sometimes.) >>>>>> >>>>> It's my code. But based on what PO posted. The key difference is that PO >>>>> hasn't realised that you can stub the detector / abort function, because >>>>> it is a function and it only has to deal with an input set with one member. >>>>> >>>>> To be fair, this isn't obvious because the input set makes reference to >>>>> the function itself. You yourself seem to have made this error. You forgot >>>>> the word "if". It will cause an infinite recursion IF we don't take action. >>>>> But we do take action. >>>>> >>>>> To make this a bit more obvious, replace >>>>> if (M == H_Hatsrc && N == Hatsrc) >>>>> with >>>>> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) >>>>> >>>>> That has the same effect, but now it's clearer that we're detecting >>>>> what would be an infinite recursion, and taking action against it. >>>>> >>>>> I'm trying to get an insight into why PO is convinced that he has refuted >>>>> the Linz proof. I might be wrong - I'm not him, I can't read his mind, and >>>>> he's not been entirely consistent. But I think I've identified it. >>>>> >>>> The Linz proof** claims to have proved the the halting problem is >>>> undecidable. It has not actually proved this. All of these proofs merely >>>> show one architectural design of a halt decider that gets the wrong >>>> answer some of the time. My architectural design of a halt decider >>>> cannot be shown to get the wrong answer any of the time. >>>> >>>> ** And all of the conventional self-referential halting problem proofs. >>>> >>> I'm not quite sure what you've shown yet because you haven't been absolutely >>> clear. >>> Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be >>> stubbed to deal only with the input H_Hat, H_Hat? Or does this change >>> somethin fundamental? >> It is no good to merely stub this function when the complete description >> of the execution trace showing exactly how (H_Hat, H_Hat) is decided >> correctly has already been provided. >> >> Instead of a stub function we could simply assume that: >> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 N, u32 M); >> always returns a correct result meaning that it: >> >> "only aborts its input and returns true when it detects the non halting >> behavior of its input" and otherwise returns false. >> > I think you need to stub the function. People need some concrete code > to reason about. But let's see if anyone else agrees that thhis would be > a way forwards. >> >> Then we try to do the same thing as the conventional halting problem >> proofs and see if there is any input that it cannot correctly decide. >> > As I understand it, instead of HALTS / RUNSFOREVER it returns > HALTS / ABORTED. We can explore the difference. > New thread: (explores the difference) [Architectural design of a halting problem solution] -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-28 18:31 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <VbKdncSdWaHKYgTCnZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #156162 |
On 10/28/2020 4:57 AM, Malcolm McLean wrote: > On Wednesday, 28 October 2020 at 03:41:33 UTC, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >>> As I understand it, instead of HALTS / RUNSFOREVER it returns >>> HALTS / ABORTED. We can explore the difference. >> Lets call the second pair NOT_ABORTED / ABORTED so as to eliminate >> confusion, and lets write C(r) for the set of computations that result >> in a particular return code. >> >> C(HALTS) are all (and only) the halting computations. >> C(RUNSFOREVER) are all (and only) the non-halting computations. >> >> If C(RUNSFOREVER) = C(ABORTED) then all we've done is change the names >> because we must also have C(HALTS) = C(NOT_ABORTED). >> >> Despite the fact that much of what PO has written about the internals >> his magic function suggests that C(RUNSFOREVER) = C(ABORTED), he has >> been clear that they are not equal (that's the "re-definition of the >> problem" part). However, all attempts to get him to say which >> computations are either in C(ABORTED) but not in C(RUNSFOREVER), or >> which are in C(RUNSFOREVER) but not in C(ABORTED) have been stonewalled. >> > I've suggested a difference between C(ABORTED) and C(RUNSFOREVER) > which indeed allows you to claim that the results are self-consistent. > However it doesn't seem to have been taken up. I can try to understand > where PO is coming from, but ultimately I cannot speak for him. >> >> These questions are only asked to get him to see (or admit) what he's >> really doing. I don't think anyone cares about exactly what sort of >> almost-halt decider he actually plans to write. >> > With my solution, although you do indeed provide a counter-example to the > Linz proof, really what you are doing is exposing that the proof only applies > to deciders which are Turing machines. And it's possible to trivially modify > the proof to show that the halt-decider element of the almost-halt decider > has a case it can't decide. I defined a NON_HALTING decider that always Accepts NON_HALTING input and Rejects HALTING input. The NON_HALTING decider UTM executes its subordinate UTM one state transition at a time until it detects non-halting behavior or its subordinate UTM has terminated normally. If the halt decider UTM detects non-halting behavior of its subordinate UTM it simply stops executing the subordinate and transitions to its own final state of ABORTED_NON_TERMINATING_BEHAVIOR. If the subordinate UTM terminates normally the halt decider UTM transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >> There is a separate argument about the specific claim that he can >> provide two programs or functions, H and H_Hat, related to each other as >> in Linz, where H(H_Hat, H_Hat) reports the correct answer about the >> halting/non-halting of H_Hat(H_Hat). His suggested H and H_Hat fail in >> this regard. >> > It's unclear whether PO regards Aborted_Because_Non_Halting_Behaviour_Detected > to be sufficiently similar to H as to be effectively H for the purpose of refuting > Linz, or if it is a component of H. We haven't actually had a H, H_Hat pair. I've > suggested stubbing Aborted_Beacuse_Non_Halting_Behaviour_Detected, but the > suggestion hasn't been taken up. Maybe my latest words are easier to understand (see above). >> PO has less now than he said he had two years ago when he (untruthfully) >> claimed to have two actual Turing machines, exactly and precisely as in >> Linz but with H(<[H_Hat], [H_Hat]>) being correct about H_Hat([H_Hat]). >> (Here, because the claim is about fully encoded Turing machines, I've >> written the claim as it should be written -- in terms of encoded >> machines [...] and encoded pairs <...>.) >> > Two actual Turing machines would be more impressive. If you make H subtly > different from a Turing machine, then Linz's proof doesn't apply. Not having random access makes Turing machines much more tedious than mowing five acres of grass with finger nail clippers. x86 language ≡ von Neumann architecture ≡ UTM >> >> There's been the most extraordinary amount of hot air about nothing. >> > I think that at root what PO is doing and why he's convinced that he has > refuted Linz is quite simple. However other people don't agree with me. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 07:55 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <IaWdna0UhKw2JgfCnZ2dnUU7-RPNnZ2d@giganews.com> |
| In reply to | #156235 |
On 10/28/2020 7:02 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/28/2020 4:57 AM, Malcolm McLean wrote: > <cut> >>> With my solution, although you do indeed provide a counter-example to the >>> Linz proof, really what you are doing is exposing that the proof only applies >>> to deciders which are Turing machines. And it's possible to trivially modify >>> the proof to show that the halt-decider element of the almost-halt decider >>> has a case it can't decide. >> >> I defined a NON_HALTING decider that always Accepts NON_HALTING input >> and Rejects HALTING input. > > And again you are vague! It's not clear if this is deliberate or simply > a consequence of the fact that you have trouble being precise. This is not vague: Intuitively, a decider should be a Turing machine that given an input, halts and either accepts or rejects, relaying its answer in one of many equivalent ways, such as halting at an ACCEPT or REJECT state, or leaving its answer on the output tape.Yuval Filmus https://cs.stackexchange.com/questions/84433/what-is-decider Yuval Filmus top 0.04% overall Assistant Professor in the Department of Computer Science at the Technion. A non-halting decider can be defined that always Accepts NON_HALTING input and Rejects HALTING input as follows: The NON_HALTING decider UTM executes its subordinate TM/UTM one state transition at a time until it detects non-halting behavior or its subordinate UTM has terminated normally. If the halt decider UTM detects non-halting behavior of its subordinate TM/UTM it simply stops executing the subordinate and transitions to its own final state of NON_TERMINATING_BEHAVIOR_DETECTED. If the subordinate TM/UTM terminates normally the halt decider UTM transitions to its own final state of SUBORDINATE_HAS_TERMINATED. >>> Two actual Turing machines would be more impressive. If you make H subtly >>> different from a Turing machine, then Linz's proof doesn't apply. >> >> Not having random access makes Turing machines much more tedious than >> mowing five acres of grass with finger nail clippers. > > But you've already done all the work. You had them "fully encoded" two > years ago. They would avoid all ambiguity. Except of course you never > did have them. That's what the last two years of back-peddling have all > been about. > >> x86 language ≡ von Neumann architecture ≡ UTM > > No. A UTM is a Turing machine. And it's universal. And its input is > an encoded TM computation. The first are mote true of "x86 language", > and the third could be true of an x86 program but is not true for yours. > > (And you are using the equivalence symbol poetically. While the x86 is > a von Neumann architecture, the reverse is not true.) > x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded (infinite in capacity); whether the number of registers is finite is model-specific. Thus the RASP is to the RAM as the Universal Turing machine is to the Turing machine. The RASP is an example of the von Neumann architecture whereas the RAM is an example of the Harvard architecture. https://en.wikipedia.org/wiki/Random-access_stored-program_machine -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 10:49 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <PM-dnemqwOc5eQfCnZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #156244 |
On 10/29/2020 8:28 AM, Richard Damon wrote:
> On 10/29/20 8:55 AM, olcott wrote:
>>>
>>
>> This is not vague:
>> Intuitively, a decider should be a Turing machine that given an input,
>> halts and either accepts or rejects, relaying its answer in one of many
>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>> leaving its answer on the output tape.Yuval Filmus
>>
>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>
>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>> Computer Science at the Technion.
>>
>> A non-halting decider can be defined that always Accepts NON_HALTING
>> input and Rejects HALTING input as follows:
>>
>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>> transition at a time until it detects non-halting behavior or its
>> subordinate UTM has terminated normally.
>>
>> If the halt decider UTM detects non-halting behavior of its subordinate
>> TM/UTM it simply stops executing the subordinate and transitions to its
>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>
>> If the subordinate TM/UTM terminates normally the halt decider UTM
>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>
> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
> is the core issue that has been problem that has been proven to not be
> possible to build for the universal case.
Yet if you are paying attention to what I am saying you will see that
the conventional halting problem trick cannot possibly be applied to do
the opposite of what ever the halt decider decides because in my
definition of a halt decider the first thing that the halt decider does
to indicate its decision is to terminate the execution of the input program.
This have been reviewed for more tan one week on there have been no
correct rebuttals.
> Yes, you can detect a number of cases of detectable non-halting
> behavior, but some Machine/Input combinations are not decidable as to if
> they will halt or not.
You cannot use examples of undecided problems and called them
undecidable. These example remain undecided and thus not undecidable.
You can imagine a program that never repeats the same state and never
halts. As soon as you prove that such an example exists you have made it
decidable.
> Basically, YOUR definition of a Halting Decider just went into infinite
> recursion of definition, so until you can provide a non-recursive
> definition of this non-halting behavior detection, you don't have a
> detector.
>
Not at all and not in the least, Infinite recursion is one function
calling itself directly or through a sequence of other function calls
and there is no recursion termination condition in the execution trace
in-between.
void H_Hat(u32 P)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
MOV_EAX_1 // Execution of P(P) has been aborted
else
{
MOV_EAX_0 // P(P) has halted
HERE: goto HERE;
}
HALT
}
void H(u32 P, u32 I)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(P, I))
MOV_EAX_1 // Execution of P(I) has been aborted
else
MOV_EAX_0 // P(I) has halted
HALT
}
int main()
{
u32 P = (u32)H_Hat;
H(P, P);
HALT
}
When-so-ever any code executed by this function would not otherwise halt
unless this function stops executing it, the code has been decided to
have NON_TERMINATING_BEHAVIOR.
u32 Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-29 12:41 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ defining a non-halting decider ] |
| Message-ID | <ldSdnca0gN1cYwfCnZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #156252 |
On 10/29/2020 11:32 AM, Richard Damon wrote:
> On 10/29/20 11:49 AM, olcott wrote:
>> On 10/29/2020 8:28 AM, Richard Damon wrote:
>>> On 10/29/20 8:55 AM, olcott wrote:
>>>>>
>>>>
>>>> This is not vague:
>>>> Intuitively, a decider should be a Turing machine that given an input,
>>>> halts and either accepts or rejects, relaying its answer in one of many
>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>> leaving its answer on the output tape.Yuval Filmus
>>>>
>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>
>>>> Yuval Filmus top 0.04% overall Assistant Professor in the Department of
>>>> Computer Science at the Technion.
>>>>
>>>> A non-halting decider can be defined that always Accepts NON_HALTING
>>>> input and Rejects HALTING input as follows:
>>>>
>>>> The NON_HALTING decider UTM executes its subordinate TM/UTM one state
>>>> transition at a time until it detects non-halting behavior or its
>>>> subordinate UTM has terminated normally.
>>>>
>>>> If the halt decider UTM detects non-halting behavior of its subordinate
>>>> TM/UTM it simply stops executing the subordinate and transitions to its
>>>> own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
>>>>
>>>> If the subordinate TM/UTM terminates normally the halt decider UTM
>>>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>>
>>> Yes, you 'Halt Decider' needs a 'Non-Halting Behavior Detector', which
>>> is the core issue that has been problem that has been proven to not be
>>> possible to build for the universal case.
>>
>> Yet if you are paying attention to what I am saying you will see that
>> the conventional halting problem trick cannot possibly be applied to do
>> the opposite of what ever the halt decider decides because in my
>> definition of a halt decider the first thing that the halt decider does
>> to indicate its decision is to terminate the execution of the input
>> program.
>>
>> This have been reviewed for more tan one week on there have been no
>> correct rebuttals.
>>
>
> You OBVIOUSLY are reading a different feed then I am, as almost
> universally people people are finding flaws in your work,
Every "flaw" has been proved to be incorrect and then this proof is
simply ignored.
>>> Yes, you can detect a number of cases of detectable non-halting
>>> behavior, but some Machine/Input combinations are not decidable as to if
>>> they will halt or not.
>>
>> You cannot use examples of undecided problems and called them
>> undecidable. These example remain undecided and thus not undecidable.
>
> I can use a very decided problem and give them to your machine and it
> will not be able to correctly decide on them, at least from every thing
> you have said.
So you have a problem that has been provably decided and also provably
undecidable by a machine. At most this would simply show that software
technology has not caught up to the capability of the human mind.
> My H_Hat2 that always halts after using H(H_Hat2, H_Hat2) will be
> decided as 'aborted' when it clearly doesn't
Please give me the cite on this in a form like this:
On 10/29/2020 11:32 AM, Richard Damon wrote:
>>
>> You can imagine a program that never repeats the same state and never
>> halts. As soon as you prove that such an example exists you have made it
>> decidable.
>
> Yes, you can make the proof that it will never halt, but your machine
> will not be able to get the answer.
If there is any proof that it will never halt then the machine can use
this same proof making it decidable for this machine.
> A halt decider machine that can only tell you if the machine will halt
> or not if you already know the answer is WORTHLESS. If that is really
> your basis, then you are in the wrong field.
That is NOT my basis.
I have already provided my complete basis at least 20 times now:
A non-halting decider can be defined that always Accepts NON_HALTING
input and Rejects HALTING input as follows:
The NON_HALTING decider UTM executes its subordinate TM/UTM one state
transition at a time until it detects non-halting behavior or its
subordinate TM/UTM has terminated normally.
If the halt decider UTM detects non-halting behavior of its subordinate
TM/UTM it simply stops executing the subordinate and transitions to its
own final state of NON_TERMINATING_BEHAVIOR_DETECTED.
If the subordinate TM/UTM terminates normally the halt decider UTM
transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>
>>> Basically, YOUR definition of a Halting Decider just went into infinite
>>> recursion of definition, so until you can provide a non-recursive
>>> definition of this non-halting behavior detection, you don't have a
>>> detector.
>>>
>>
>> Not at all and not in the least, Infinite recursion is one function
>> calling itself directly or through a sequence of other function calls
>> and there is no recursion termination condition in the execution trace
>> in-between.
>>
>>
>> void H_Hat(u32 P)
>> {
>> if (Aborted_Because_Non_Halting_Behavior_Detected(P, P))
>> MOV_EAX_1 // Execution of P(P) has been aborted
>> else
>> {
>> MOV_EAX_0 // P(P) has halted
>> HERE: goto HERE;
>> }
>> HALT
>> }
>>
>>
>> void H(u32 P, u32 I)
>> {
>> if (Aborted_Because_Non_Halting_Behavior_Detected(P, I))
>> MOV_EAX_1 // Execution of P(I) has been aborted
>> else
>> MOV_EAX_0 // P(I) has halted
>> HALT
>> }
>>
>>
>> int main()
>> {
>> u32 P = (u32)H_Hat;
>> H(P, P);
>> HALT
>> }
>>
>> When-so-ever any code executed by this function would not otherwise halt
>> unless this function stops executing it, the code has been decided to
>> have NON_TERMINATING_BEHAVIOR.
>> u32 Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I);
>>
>>
>
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| 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 | #156244 |
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 | 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 | #156253 |
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 | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-27 13:57 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <rn9u33$ghu$1@dont-email.me> |
| In reply to | #156149 |
On 2020-10-27 10:05, olcott wrote: > On 10/27/2020 10:45 AM, Malcolm McLean wrote: >> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >>> >>>> Here's the code >>> Is this code from PO, or is it your code? >>> >>> It is hard enough work dealing with PO, and I don't want to spend much >>> time on /your/ arguments, even if you believe you are making the same >>> argument as PO. If you feel that you have some insight into PO's >>> thinking, by all means respond to my posts saying what you think, but I >>> will probably not seriously engage with you. (I will read what you say >>> at least, and might respond sometimes.) >>> >> It's my code. But based on what PO posted. The key difference is that PO >> hasn't realised that you can stub the detector / abort function, because >> it is a function and it only has to deal with an input set with one >> member. >> >> To be fair, this isn't obvious because the input set makes reference to >> the function itself. You yourself seem to have made this error. You >> forgot >> the word "if". It will cause an infinite recursion IF we don't take >> action. >> But we do take action. >> >> To make this a bit more obvious, replace >> if (M == H_Hatsrc && N == Hatsrc) >> with >> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) >> >> That has the same effect, but now it's clearer that we're detecting >> what would be an infinite recursion, and taking action against it. >> >> I'm trying to get an insight into why PO is convinced that he has refuted >> the Linz proof. I might be wrong - I'm not him, I can't read his mind, >> and >> he's not been entirely consistent. But I think I've identified it. >> > > The Linz proof** claims to have proved the the halting problem is > undecidable. It has not actually proved this. All of these proofs merely > show one architectural design of a halt decider that gets the wrong > answer some of the time. My architectural design of a halt decider > cannot be shown to get the wrong answer any of the time. Linz doesn't specify anything at all about the 'architectural design' of H. All he does is claim that H is a halt decider; it's internal workings are left entirely unspecified. He shows that for *any* given H it is possible to derive a second TM, H_Hat, such that if the description of H_Hat is used as the input to H, H will not be able to correctly decide whether H_Hat halts. There's absolutely *no* assumptions made about the internal workings / 'architectural design' of H. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 23:02 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <rpudnQoSPo5YyA_CnZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #155899 |
On 10/22/2020 10:41 PM, Richard Damon wrote: > On 10/22/20 4:24 PM, olcott wrote: >> >> The more general claim that I made is that I would show exactly how the >> conventional self-referential halting problem proof counter-examples do >> not prove that the halting problem is undecidable. >> >> This has now been totally fulfilled. >> >> As soon as you acknowledge this we can move on to talking about other >> aspects. > > You ave done NO such thing. You have shown that a DIFFERENT, > non-equivalent sort of halting problem statement can't be disproven by a > Linz like system. > > Unfortunately, the original halting problem (that you haven't touched, > and even seems to be that you admit the proof is actually valid for) has > some mathematical interesting uses, while your revised statement has > know known use, and without some major tightening of the conditions in > it, is almost assuredly not to be mathematically interesting. > When I said that the original proof is correct yet was based on a fundamentally incorrect assumption it is exactly the same thing as the statement that "cats bark" is correct when we assume that all cats are dogs. Perhaps it is easier to understand it when I say that the original proof is fundamentally incorrect because it is based on fundmentally incorrect assumptions. > A big part of this lack of interest is that detecting halting by > simulating adds no information about the halting behavior above simply > running the orginal machine and observing if it has halted. > This statement is incorrect. A halt decider can easily detect infinite loops when the program under test is executed in debug step mode. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Tim Woodall <news001@woodall.me.uk> |
|---|---|
| Date | 2020-10-23 07:05 +0000 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <rmtvc7$t4g$1@einstein.home.woodall.me.uk> |
| In reply to | #155916 |
On 2020-10-23, olcott <NoOne@NoWhere.com> wrote:
>
> This statement is incorrect. A halt decider can easily detect infinite
> loops when the program under test is executed in debug step mode.
>
Does the below function g() terminate?
N.B. this code is meant to be simple, not efficient.
int p(int n)
{
int p = 0;
int d;
if(n<=2)
return 0;
n--; //n is never increased therefore this function always returns a value less than its input
d = n;
while(d>2) //This loop always terminates as d or n decreases with each iteration and d<=n
{
d--;
p = n;
while(p >= d) //This loop always terminates as p decreases with each iteration
p -= d;
if(!p)
{
n--;
d = n;
}
}
return n;
}
void g()
{
int n = 6;
int p1 = n;
while( p(p1) + p(p1) >=n ) //Does this loop terminate?
{
p1 = p(p1); //p1 is always less than n
int p2 = p1;
while(p1 + p2 > n) //p2 monotonically decreases to zero and p1<n therefore this loop always terminates
p2 = p(p2);
if(p1+p2 == n)
{
n = n + 2;
p1 = n;
}
}
}
Does g terminate? (assuming ints never overflow)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 08:38 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <wpGdndtdy4JAQQ_CnZ2dnUU7-cudnZ2d@giganews.com> |
| In reply to | #155920 |
On 10/23/2020 2:05 AM, Tim Woodall wrote:
> On 2020-10-23, olcott <NoOne@NoWhere.com> wrote:
>
>>
>> This statement is incorrect. A halt decider can easily detect infinite
>> loops when the program under test is executed in debug step mode.
>>
>
> Does the below function g() terminate?
>
> N.B. this code is meant to be simple, not efficient.
>
> int p(int n)
> {
> int p = 0;
> int d;
>
> if(n<=2)
> return 0;
>
> n--; //n is never increased therefore this function always returns a value less than its input
> d = n;
>
> while(d>2) //This loop always terminates as d or n decreases with each iteration and d<=n
> {
> d--;
>
> p = n;
>
> while(p >= d) //This loop always terminates as p decreases with each iteration
> p -= d;
>
> if(!p)
> {
> n--;
> d = n;
> }
> }
>
> return n;
> }
>
> void g()
> {
> int n = 6;
>
> int p1 = n;
>
> while( p(p1) + p(p1) >=n ) //Does this loop terminate?
> {
> p1 = p(p1); //p1 is always less than n
>
> int p2 = p1;
> while(p1 + p2 > n) //p2 monotonically decreases to zero and p1<n therefore this loop always terminates
> p2 = p(p2);
>
> if(p1+p2 == n)
> {
> n = n + 2;
> p1 = n;
> }
>
> }
> }
>
> Does g terminate? (assuming ints never overflow)
>
All that I have done is refuted the conventional self-referential
halting problem proofs that show that a universal halt decider is
impossible. I don't handle any difficult cases. I only handle the
impossible cases.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 08:45 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <F46dnTLTdo8XQw_CnZ2dnUU7-L-dnZ2d@giganews.com> |
| In reply to | #155916 |
On 10/23/2020 5:02 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> A halt decider can easily detect infinite loops when the program under >> test is executed in debug step mode. > > For the simple (and common) definition of "infinite loops" that's right. > A program loops (in this simple sense) when it enters a configuration it > has previously been in (the configuration being the sum total of all the > state that can affect the outcome). But a halt decider must be able to > decide computations that don't terminate, but which don't "loop" in this > naive sense. > > The word is also used as a slightly clumsy synonym for non-terminating, > so if you want to be clear (ha!) you should avoid the word or specify > the meaning when you use it as one form of "looping" is easily > detectable but the other is impossible to detect. > What form of looping is literally impossible to detect? -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 10:30 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <OcadnU_Id868ag_CnZ2dnUU7-WnNnZ2d@giganews.com> |
| In reply to | #155924 |
On 10/23/2020 9:56 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/23/2020 5:02 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> A halt decider can easily detect infinite loops when the program under >>>> test is executed in debug step mode. >>> >>> For the simple (and common) definition of "infinite loops" that's right. >>> A program loops (in this simple sense) when it enters a configuration it >>> has previously been in (the configuration being the sum total of all the >>> state that can affect the outcome). But a halt decider must be able to >>> decide computations that don't terminate, but which don't "loop" in this >>> naive sense. >>> >>> The word is also used as a slightly clumsy synonym for non-terminating, >>> so if you want to be clear (ha!) you should avoid the word or specify >>> the meaning when you use it as one form of "looping" is easily >>> detectable but the other is impossible to detect. >> >> What form of looping is literally impossible to detect? > > The sort where the computation never enters a configuration it has been > in before. /Some/ instances of this type can be detected, but there is > no effective procedure to detect them all. There /is/ an effective > procedure for the other kind where a previously entered configuration is > entered again. > None-the-less I have refuted all of the conventional self-referential halting problem proof counter-examples. Also it is well known that machines such as this cannot physically exist. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-10-23 13:03 -0700 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <87d01890cp.fsf@nosuchdomain.example.com> |
| In reply to | #155916 |
olcott <NoOne@NoWhere.com> writes:
[SNIP]
The parent article was posted only to comp.theory. You deliberately
cross-posted your followup to comp.theory, comp.lang.c,
comp.lang.prolog, and comp.lang.c++. You've done that multiple
times.
Please stop doing that. You've already taken over comp.theory.
You're not discussing programming languages. Please stop polluting
other newsgroups where people are still trying to discuss programming
languages.
I expect you'll reply to this with some ridiculous excuse and
continue your misbehavior. If so, I will resume ignoring you.
And again, I ask everyone else replying to olcott's posts to remove
irrelevant newsgroups from your followups. I know it's annoying
to have to do that.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 15:24 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <NqKdnWVNUZd6pg7CnZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #155958 |
On 10/23/2020 3:03 PM, Keith Thompson wrote: > olcott <NoOne@NoWhere.com> writes: > [SNIP] > > The parent article was posted only to comp.theory. You deliberately > cross-posted your followup to comp.theory, comp.lang.c, > comp.lang.prolog, and comp.lang.c++. You've done that multiple > times. > > Please stop doing that. You've already taken over comp.theory. > You're not discussing programming languages. Please stop polluting > other newsgroups where people are still trying to discuss programming > languages. > > I expect you'll reply to this with some ridiculous excuse and > continue your misbehavior. If so, I will resume ignoring you. > > And again, I ask everyone else replying to olcott's posts to remove > irrelevant newsgroups from your followups. I know it's annoying > to have to do that. > I will stop cross-posting as soon as: (1) It is accepted that I just correctly refuted the halting problem proofs. (2) It is proven that I did not correctly refute the halting problem proofs. This latter proof would be very easy if and only if I am incorrect and utterly impossible if I am correct. If a halt decider is defined to return a value that indicates that its input program halts and input program can be defined on the basis of the halt decider that does the opposite of whatever the halt decider decides. If a UTM executes an (already on the tape) input UTM. The halt decider UTM could execute its (already on the tape) input UTM one state transition at a time. As soon as the halt decider UTM detects that its (already on the tape) input UTM would not halt, the halt decider UTM stops executing its (already on the tape) input UTM and transitions to its own final state indicating: Aborted_Because_Non_Halting_Behavior_Detected. In this case the (already on the tape) input UTM cannot possibly do the opposite of what the halt decider UTM decided because it is no longer executing. This redefinition of the halt decider eliminates the undecidability of the halting problem. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 08:43 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <F46dnTPTdo-AQw_CnZ2dnUU7-L_NnZ2d@giganews.com> |
| In reply to | #155899 |
On 10/23/2020 4:29 AM, Malcolm McLean wrote: > On Friday, 23 October 2020 at 04:41:59 UTC+1, Richard Damon wrote: >> >> A big part of this lack of interest is that detecting halting by >> simulating adds no information about the halting behavior above simply >> running the orginal machine and observing if it has halted. >> > Exactly. What happens if we have a physical Turing machine? > > It's set up by a human supervisor, who waits to see if it halts. One > possibility is that it will run out of tape, in which case he, probably rightly, > concludes that it has got stuck in an infinite loop. Another possibility > is that it takes a long time and he gets bored. Another possibility is that > it halts normally. > > Assuming it doesn't halt normally, the machine is destroyed or switched > off in some manner. It never runs forever. > > So in fact we have a pretty good, though not perfect, halt detector. But > it's not a Turing machine. A Turing machine can't abort. A UTM can run its TM until it decides that its TM is would not halt. Then the UTM stops running its TM and reports non-halting behavior. The TM cannot then do the opposite of whatever the UTM decided because it is no longer running. Bingo halting is decidable ! > PO is trying to > get round this problem by saying that DebugTrace aborts the program > this stepping through (which is possible), then shunts up the "abortion" > state to H_Hat, which then aborts. That's not valid, of course. H_Hat can't > abort itself or it's not a Turing machine. > > Remove the requirement that the halt detector be a Turing machine and > the Linz proof fails. That's the basic point that seems to have been missed, > and that's what PO is doing, though not so blatantly that most people > have spotted the error. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-23 10:19 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <ho-dneFBLbQRaQ_CnZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #155899 |
On 10/23/2020 9:51 AM, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>
>> So in fact we have a pretty good, though not perfect, halt detector. But
>> it's not a Turing machine. A Turing machine can't abort.
>
> That's a red herring. An abort is not magic. It's just another way of
> halting which we give an special name to. A TM can abort by halting in
> state we interpret as aborting.
>
>> PO is trying to
>> get round this problem by saying that DebugTrace aborts the program
>> this stepping through (which is possible), then shunts up the "abortion"
>> state to H_Hat, which then aborts. That's not valid, of course. H_Hat can't
>> abort itself or it's not a Turing machine.
>
> H_Hat is not a Turing machine because it is x86 code. Aborting has
> nothing to do with that.
>
>> Remove the requirement that the halt detector be a Turing machine and
>> the Linz proof fails. That's the basic point that seems to have been missed,
>> and that's what PO is doing, though not so blatantly that most people
>> have spotted the error.
>
> Of course Linz's proof fails. It fails for Turing machines if they are
> defined even slightly differently from the way Linz defines them!
> That's how proofs work. Why should anyone point that out?
>
> He's not simply relying on a poof literally not applying to some other
> model of computation. He's trying to invalidate the method behind the
> proof. What he is claiming is that he can make two computations,
> related in the same as the two in Linz's proof (and in other similar
> proofs), that do not fall foul of the obvious logic. He has not done
> that. It can't be done. It can't be done even in models where halting
> is decidable.
>
If we take my redefined halting decider and interpret its return value
using the conventional interpretation:
DebugTrace() executes H_Hat() and decides that it would not otherwise
halt so it terminates the execution of H_Hat() and reports:
(1) Not_Halting.
Decision:Not_Halting
Behavior:Halting
a contradiction DebugTrace() got the wrong answer.
If we take my redefined halting decider and interpret its return value
using the redefined interpretation:
(2) Aborted_Because_Non_Halting_Behavior_Detected
Decision:Aborted_Because_Non_Halting_Behavior_Detected
Behavior:Aborted_Because_Non_Halting_Behavior_Detected
Not a contradiction and the right answer!
Instead of the C function DebugTrace() we could simply have a UTM that
executes an (already on the tape) input UTM. This halt decider UTM would
execute its (already on the tape) input UTM one state transition at a
time. As soon as the halt decider UTM detects that its (already on the
tape) input UTM would not halt, the halt decider UTM stops executing its
(already on the tape) input UTM and transitions to its own final state
indicating Aborted_Because_Non_Halting_Behavior_Detected.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 18:05 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <vMadnaxSWr-njQ_CnZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #155866 |
On 10/22/2020 5:14 PM, Mike Terry wrote: > On 22/10/2020 17:38, olcott wrote: >> On 10/22/2020 10:25 AM, Mike Terry wrote: >>> On 22/10/2020 15:36, olcott wrote: >>>> On 10/22/2020 7:00 AM, Richard Damon wrote: >>>>> On 10/22/20 12:33 AM, olcott wrote: >>>>>> >>>>>> The difference is that it is no longer possible for H_Hat() to do the >>>>>> opposite of what H() decides. This transforms an undecidable problem >>>>>> into a decidable problem. >>>>> >>>>> If H_Hat no longer does what the proof defined, then your >>>>> demonstration >>>>> is no longer applicable to the proof. >>>>> >>>> >>>> If the halt decider is to report whether or not its input halts another >>>> program can be constructed on the the basis of this halt decider that >>>> does the opposite of whatever the halt decider decides. >>>> >>>> This is how H() and H_Hat() are defined in the Linz proof. >>>> >>>> If the halt decider is to report whether or not it aborted its input >>>> program because its input program would otherwise cause the halt >>>> decider >>>> to get stuck in infinite execution then this other program can no >>>> longer >>>> fool its halt decider and do the opposite of whatever it decides. >>>> >>>> If H() aborts the execution of H_Hat() then H_Hat() cannot continue to >>>> execute because H() has complete control over H_Hat. >>>> >>>> The end result of this slight change is that the halting problem can no >>>> longer be shown to be undecidable. >>>> >>> >>> It is suspicious that in none of this have you ever stated what is >>> actually wrong in the Linz proof. >> >> When the halting problem is defined as: >> bool Does_It_Halt(u32 P, u32 I) >> another program can be constructed on the basis of Does_It_Halt() that >> does the opposite of whatever Does_It_Halt() decides. >> > > Yes, regardless of the internal details of Does_It_Halt(). > >> When the halting problem is defined as: >> bool Was_Its_Execution_Aborted(u32 P, u32 I) >> >> another program CANNOT be constructed on the basis of >> Was_Its_Execution_Aborted() that does the opposite of whatever >> Was_Its_Execution_Aborted() decides. > > Sure, if you interpret your question literally as asking whether P would > actually be aborted if it executes under the UTM within > Was_Its_Execution_Aborted()! > > However, another program CAN be constructed on the basis of > Was_Its_Execution_Aborted() that: > - halts if Was_Its_Execution_Aborted() decides "aborted" > - loops if Was_Its_Execution_Aborted() decides "halted" > > (right?) Wrong. There is no way to make the revised halting question contradictory. DebugTrace() either reports that it has aborted the execution of its input or it reports that its input has not been aborted after its input has terminated. > So your new question literally interpreted is irrelevant to the "does it > /actually/ halt" problem. (I.e. the one discussed in the literature and > specifically the Linz proof.) > > Let me give an example which makes that obvious... > > Suppose I wrote an implementation of bool Was_Its_Execution_Aborted(u32 > P, u32 I) which works like this: > 1. Run P in our UTM until either it halts by itself, > or 5 instructions have been executed. > 2. If P halted by itself, report back that P halted. > 3. Otherwise abort P, and report back that P was aborted. > > As you say, Was_Its_Execution_Aborted() can (will!) give a correct > answer to the question "Would P's execution under the UTM within > Was_Its_Execution_Aborted() be aborted?" > > For example, let's suppose that P actually does halt but it takes 500 > instructions. OK, we now have to perform two experiments to check > whether Was_Its_Execution_Aborted() is answering correctly: > - first we run Was_Its_Execution_Aborted(P, I) and > note that it returns "execution was aborted". > - next we trace step by step through > Was_Its_Execution_Aborted(H_Hat, H_Hat), and note that > indeed the execution of H_Hat WAS aborted! > > Was_Its_Execution_Aborted() managed to answer correctly! Yipeee. > > (Alternatively we could combine both of these experiments into one, > looking for two things at once, but conceptually we have two separate > experiments.) > > Unfortunately, it is now obvious that asking the question "Would P's > execution under the UTM within Was_Its_Execution_Aborted() be aborted?" > is not equivalent to the halting question, and the fact that such a new > question can be correctly answered has no relevence to the HP question > or to Linz proof. > That you can define a halt decider that does not meet the conventional specs of a halt decider provide zero rebuttal what-so-ever. > In fact doesn't the new question, literally interpreted as above, seem a > little facile? > > The only way to make your new question relevant to the Linz proof would > be if your implementation of Was_Its_Execution_Aborted() had the > additional characteristics: > > a) if Was_Its_Execution_Aborted() returns "program halted" > then H_Hat(H_Hat) [IF RUN NATIVELY] will actually terminate YES > b) if Was_Its_Execution_Aborted() returns "program aborted" > then H_Hat(H_Hat) [IF RUN NATIVELY] will never halt Not really because H_Hat() has the same halt decider as H() so when we run H_Hat() on itself it aborts itself. > If Was_Its_Execution_Aborted() had those properties, it could just be > name-changed to Does_It_Halt() and I think you've already admitted > elsewhere the Linz argument is correct with the [IF RUN NATIVELY] > proviso, and so this can't be possible. We could say that the Linz proof is correct on the basis of its terribly incorrect basic assumptions or we cold say that the Linz proof is fundamentally incorrect because its foundational basis is incorrect. These are two different ways of saying the same thing. >> >> All of the cases where Was_Its_Execution_Aborted() returns true are >> cases of non-halting behavior. >> >> All of the cases where Was_Its_Execution_Aborted() returns false are >> cases of halting behavior. >> > > Um, ok, that /sounds/ like you're saying it has characteristics (a) and > (b) above? In which case although it may be answering your new > question, IT WOULD AT THE SAME TIME BE CORRECTLY ANSWERING THE OLD > QUESTION! No because in the case where DebugTrace() decides to abort its input in the prior language this would be a case where H() decides not halting and then H_Hat() halts. > ..And it can't be doing that, because then H_Hat could employ the "do > the opposite of what H() says strategy, which I think you've agreed > elsewhere works for the OLD question. > > Is the issue here that when you say "cases of non-halting behavior", you > mean something other than "cases where P run with input I never halts > [when run natively]"? > Not exactly. Since the invocation of DebugTrace() by H_Hat() aborts H_Hat() we can't really say that when it runs natively it never halts. We can say that unless H_Hat() is aborted it would never halt. > Thinking about it, your use of the term "non-halting *behavior*" seems a > likely area of confusion! > > What exactly do you mean by "cases of non-halting behavior"? The obvious one is infinite loop. Can you think of the other one? > And just to be doubly clear, does this /mean/ the same as "program run > /natively/ with given input never halts"? (I.e. in the usual sense of > "non-halting TMs" in the literature and HP proof?) > If H_Hat() is run and never aborted it would never halt. If it is executed with itself as input its invocation of DebugTrace() would abort this input. >>> It's almost as though you accept there is nothing wrong with it, and >>> yet you still think its conclusion is incorrect! Or that you can't >>> see anything wrong with it, and in your head the mistake in the proof >>> is that its conclusion is wrong? (Thinking a conclusion is wrong does >>> not refute anything...) >>> >>> Anyhow, you talk about the halt decider reporting that it "aborted its >>> input program, because blah blah". If you read the Linz proof, you'll >>> notice that it is completely unaffected of any internal reasoning as >>> to WHY H might have made whatever decision it made. All it depends on >>> is that H actually makes a decision! >>> >> >> In the Linz case if a program would not halt and we are asking would it >> halt and we abort the execution of H_Hat() then H() gets the wrong >> answer because H() says that it would not halt and it does halt. >> >> If we keep everything else the same except change the question to: >> Was the input program aborted because it would not otherwise terminate? >> >> Now when we answer yes we get the right answer. H_hat() cannot possibly >> do the opposite of what H() decides because H_Hat() is under the >> complete control of H(). >> > > ..but as explained above, H_Hat CAN have the behaviour that it halts if > H() decides it was aborted, and it loops if H() decides it terminated. As soon as H_Hat() is terminated and DebugTrace() returns a value the H_Hat() process ceases to exist in memory because it was stored on the DebugTrace() stack. > (The H_Hat in your skeleton code is designed exactly this way.) It is designed to precisely match the Linz templates. > [... snip ...] >>> So... this was to be the culmination of your life's work, and now >>> you're simply not going to publish it? I thought the whole purpose of >> >> I didn't say that. As soon as people pay enough attention they will see >> that I am correct. > > I fear this is one of your delusions! Your proof is almost nonexistent My proof is very very concise yet infinitely more elborate than any rebuttals of it. Try and show how a non existent H_Hat() that no longer exists as a process in memory can do anything at all and you will start to begin to see that changing the halt deciding question converts an undecidable problem into a decidable one. > - stepping back a bit I can cast it as another version of your numerous > attempts to refute various proofs by redefining key terms in the proof, > then pointing out that the proof no longer works using those new terms. > I don't believe /anyone/ has ever agreed with /any/ of those attempts, > so I can't see them starting now. > That no one agrees with me is zero rebuttal at all. > In the end you will be left with the choice of "proving them wrong" by > publishing the code anyway (and I think you can see by now that will get > you nowhere), or abandoning your life's work, having wasted 12,000 hours > (your own reckoning) unnecessarily. > Take my challenge and show how the H_Hat() process that no longer exists in memory can do anything at all that is the opposite of what DebugTrace() decided. > It's slightly interesting that 12,000 is exactly the figure Dudley > quotes that one of his Trisectors spent on the trisection problem in his > essay: > > <http://web.mst.edu/~lmhall/WhatToDoWhenTrisectorComes.pdf> > > He remarks (of the trisector of course, not of you): > > "Twelve thousand working hours! Full time is forty hours a week for > fifty weeks, so the poor deluded man had devoted the equivalent of six > years of his life to something as useless as finding two even numbers > whose sum is odd. What wouldn't you or I give for an extra six years of > time? What couldn't we accomplish? What a deplorable waste!" > > In your case it must seem doubly wasteful, in that you could be exactly > where you are now if you had simply published your high level design at > the start of all this. (Well, I suppose then you wouldn't have your x86 > emulator program, so there's some compensation...) > > Mike. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 19:29 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <z_OdnS-iof9Ovg_CnZ2dnUU7-bPNnZ2d@giganews.com> |
| In reply to | #155904 |
On 10/22/2020 6:55 PM, Malcolm McLean wrote: > On Friday, 23 October 2020 at 00:05:38 UTC+1, olcott wrote: >> On 10/22/2020 5:14 PM, Mike Terry wrote: > >>> Is the issue here that when you say "cases of non-halting behavior", you >>> mean something other than "cases where P run with input I never halts >>> [when run natively]"? >>> >> Not exactly. >> Since the invocation of DebugTrace() by H_Hat() aborts H_Hat() we can't >> really say that when it runs natively it never halts. We can say that >> unless H_Hat() is aborted it would never halt. >> > Abortion is sticky. So one there is an abortion anywhere in the system, the > whole thing aborts. If you are running DebugTrace, this isn't a problem - > just shunt the "abortion" condition up the instances. > However a Turing machine can't abort itself. H() executes DebugTrace() that creates a separate virtual machine process and executes H_Hat() that executes DebugTrace() that creates a separate virtual machine process and executes another H_Hat() process. If DebugTrace() returns a value where 1 == Halts and 0 == ~Halts then the conventional self-referential halting problem proof counter-example can be created where H_Hat() does the opposite of whatever H() decides. H() decides Halts so H_Hat Loops H() decides Loops so H_Hat Halts If DebugTrace() returns a value where 1 == Aborted and 0 == ~Aborted then the conventional self-referential halting problem proof counter-example CANNOT be created and H_Hat() CANNOT do the opposite of whatever H() decides. H() decides Aborted so H_Hat has already ceased to exist. H() decides ~Aborted so H_Hat is allowed to execute to completion. There are no longer any halting problem cases that can be shown to be undecidable with the revised definition of the halt decider. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-22 20:26 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ HP proof refutation has been provided ] |
| Message-ID | <CsKdnR6NKOrHrA_CnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #155908 |
On 10/22/2020 8:06 PM, Malcolm McLean wrote: > On Friday, 23 October 2020 at 01:29:15 UTC+1, olcott wrote: >> On 10/22/2020 6:55 PM, Malcolm McLean wrote: >>> On Friday, 23 October 2020 at 00:05:38 UTC+1, olcott wrote: >>>> On 10/22/2020 5:14 PM, Mike Terry wrote: >>> >>>>> Is the issue here that when you say "cases of non-halting behavior", you >>>>> mean something other than "cases where P run with input I never halts >>>>> [when run natively]"? >>>>> >>>> Not exactly. >>>> Since the invocation of DebugTrace() by H_Hat() aborts H_Hat() we can't >>>> really say that when it runs natively it never halts. We can say that >>>> unless H_Hat() is aborted it would never halt. >>>> >>> Abortion is sticky. So one there is an abortion anywhere in the system, the >>> whole thing aborts. If you are running DebugTrace, this isn't a problem - >>> just shunt the "abortion" condition up the instances. >>> However a Turing machine can't abort itself. >> H() executes DebugTrace() that creates a separate virtual machine >> process and executes H_Hat() that executes DebugTrace() that creates a >> separate virtual machine process and executes another H_Hat() process. >> >> If DebugTrace() returns a value where 1 == Halts and 0 == ~Halts then >> the conventional self-referential halting problem proof counter-example >> can be created where H_Hat() does the opposite of whatever H() decides. >> >> H() decides Halts so H_Hat Loops >> H() decides Loops so H_Hat Halts >> >> If DebugTrace() returns a value where 1 == Aborted and 0 == ~Aborted >> then the conventional self-referential halting problem proof >> counter-example CANNOT be created and H_Hat() CANNOT do the opposite of >> whatever H() decides. >> >> H() decides Aborted so H_Hat has already ceased to exist. >> H() decides ~Aborted so H_Hat is allowed to execute to completion. >> >> There are no longer any halting problem cases that can be shown to be >> undecidable with the revised definition of the halt decider. >> > If we call H_Hat directly, there are two instances of H_Hat. > > There are several ways of looking at what you are doing, depending > on the exact details of the "abort" logic. One is to say that the Halt decider > isn't a Turing machine because it can destroy its own execution environment. Think of it in terms of a UTM the simply decides to stop executing its TM. > Then Linz's proof doesn't apply. Another way of looking at it is to say that > you've a hidden parameter (the number of live instances of H_Hat) which > allows you to toggle the behaviour. > x86utm execute main() that executes H() that executes DebugTrace() that creates a whole new process that executes H_Hat() in DebugStep() mode that executes DebugTrace() that creates a whole new process that executes H_hat() in DebugStep() mode. Nothing is hidden DebugStep() can see every single detail of every process that it executes and it can store some (or all) of these details to be used later. Since DebugTrace() itself is executed in its own process it can keep the details of its own slave process separate from every other invocation of every other slave process. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 8 of 13 — ← Prev page 1 … 6 7 [8] 9 10 … 13 Next page →
Back to top | Article view | comp.lang.c
csiph-web