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 7 of 13 — ← Prev page 1 … 5 6 [7] 8 9 … 13 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 14:08 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <htidnSdDk4FV5gnCnZ2dnUU7-QnNnZ2d@giganews.com> |
| In reply to | #155985 |
On 10/24/2020 12:27 PM, Richard Damon wrote: > On 10/23/20 11:28 PM, olcott wrote: > >> That is why we have to change the question. >> If the halt decider executes its input in DebugStep() mode, aborts the >> execution of this input, and reports not halting, then is gets the wrong >> answer because it decided not halting and it halted. >> >> With exact same situation except that the halt decider reports: >> Aborted_Because_Non_Halting_Behavior_Detected. >> Now it correctly decided halting AND got the correct answer. >> > And since you changed the question to something different, you CAN'T say > anything about the original question! > I can say that the halting problem, cannot be shown to be undecidable when we simply rephrase the question to a question that is not subject to a cheap trick: Does the input have to be aborted to prevent infinite execution? This question correctly divides the set of all programs into correct and incorrect and it cannot be fooled by any cheap trick. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 15:48 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <UIqdnWvQQ76fDgnCnZ2dnUU7-XHNnZ2d@giganews.com> |
| In reply to | #156027 |
On 10/24/2020 2:54 PM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 10/24/2020 12:27 PM, Richard Damon wrote: > > [ .... ] > >>> And since you changed the question to something different, you CAN'T say >>> anything about the original question! > >> I can say that the halting problem, cannot be shown to be undecidable >> when we simply rephrase the question to a question that is not subject >> to a cheap trick: > > The use of emotional language says more about you that about the maths > involved. > >> Does the input have to be aborted to prevent infinite execution? > > Even after following this thread, more or less, I can't see how that > question is essentially different from the proper halting problem > question. > The difference is that the revised question cannot be contradicted to make the halting problem undecidable: Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true means that the input has infinite execution. Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false means that the input DOES NOT HAVE infinite execution. There is no input that the redefined halt decider cannot decide. Every input is divided into: (a) Has infinite execution. (b) DOES NOT HAVE infinite execution. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-24 17:20 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <Ts-dne-Gy7xVNQnCnZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #156034 |
On 10/24/2020 4:41 PM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 10/24/2020 2:54 PM, Alan Mackenzie wrote: >>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>> On 10/24/2020 12:27 PM, Richard Damon wrote: > >>> [ .... ] > >>>>> And since you changed the question to something different, you CAN'T say >>>>> anything about the original question! > >>>> I can say that the halting problem, cannot be shown to be undecidable >>>> when we simply rephrase the question to a question that is not subject >>>> to a cheap trick: > >>> The use of emotional language says more about you that about the maths >>> involved. > >>>> Does the input have to be aborted to prevent infinite execution? > >>> Even after following this thread, more or less, I can't see how that >>> question is essentially different from the proper halting problem >>> question. > >> The difference is that the revised question cannot be contradicted to >> make the halting problem undecidable: > > I can't see that at all. The two questions are essentially the same, > aren't they, so your modified question will be just as applicable to the > Halting problem proofs as the original, won't it? > > Or, put another way, could you give a clear example of something for > which the HP question and your question give different answers? > >> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true >> means that the input has infinite execution. > > Or for which a halting program would say "doesn't halt". No, not at all. Not in the least little bit. Was forced to halt is not the same thing at all as does not ever halt. >> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == false >> means that the input DOES NOT HAVE infinite execution. > > Or for which a halting program would say "does halt". Yes there is it the same. >> There is no input that the redefined halt decider cannot decide. > > That seems very unlikely. One could program a brute force search for a > counterexample to Goldbach's conjecture. Your redefined halt decider > would likely be unable to say if the brute force search would ever > terminate. That is merely undecided which it not at all the same thing as undecidable. The way that the technical nature of what is called undecidable works is that someone asks a (yes or no) question that has no (yes or no) answer and no one notices that the problem is the this question itself is incorrect. The The logical law of polar questions copyright PL olcott 2015 https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ >> Every input is divided into: >> (a) Has infinite execution. >> (b) DOES NOT HAVE infinite execution. > > and (c) it is unknown whether there's infinite execution. It is no longer possible to derive a counter-example that proves that the halting problem is undecidable. > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 11:30 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <CPWdnUoIK_IhZAvCnZ2dnUU7-XnNnZ2d@giganews.com> |
| In reply to | #156045 |
On 10/26/2020 8:37 AM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 10/24/2020 4:41 PM, Alan Mackenzie wrote: >>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>> On 10/24/2020 2:54 PM, Alan Mackenzie wrote: >>>>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>>>> On 10/24/2020 12:27 PM, Richard Damon wrote: > > [ .... ] > >>>> The difference is that the revised question cannot be contradicted to >>>> make the halting problem undecidable: > >>> I can't see that at all. The two questions are essentially the same, >>> aren't they, so your modified question will be just as applicable to >>> the Halting problem proofs as the original, won't it? > >>> Or, put another way, could you give a clear example of something for >>> which the HP question and your question give different answers? > >>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true >>>> means that the input has infinite execution. > > It also means a fairy-tale halting decider would return "doesn't halt" in > exactly the same circumstances. No. Not at all. Not in the least little bit. It is not a fairy-tale at all. The redefined halt 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. The redefined halt decider is not subject to the conventional halting problem trick. Its input cannot possibly do the opposite of whatever it decides because the input has already terminated before the halt decider makes its decision. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-26 10:43 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <rn6ub4$orf$1@dont-email.me> |
| In reply to | #156106 |
On 2020-10-26 10:30, olcott wrote: > On 10/26/2020 8:37 AM, Alan Mackenzie wrote: >> In comp.theory olcott <NoOne@nowhere.com> wrote: >>> On 10/24/2020 4:41 PM, Alan Mackenzie wrote: >>>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>>> On 10/24/2020 2:54 PM, Alan Mackenzie wrote: >>>>>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>>>>> On 10/24/2020 12:27 PM, Richard Damon wrote: >> >> [ .... ] >> >>>>> The difference is that the revised question cannot be contradicted to >>>>> make the halting problem undecidable: >> >>>> I can't see that at all. The two questions are essentially the same, >>>> aren't they, so your modified question will be just as applicable to >>>> the Halting problem proofs as the original, won't it? >> >>>> Or, put another way, could you give a clear example of something for >>>> which the HP question and your question give different answers? >> >>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true >>>>> means that the input has infinite execution. >> >> It also means a fairy-tale halting decider would return "doesn't halt" in >> exactly the same circumstances. > > No. Not at all. Not in the least little bit. > It is not a fairy-tale at all. > > The redefined halt 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. And the difference between 'non-terminating behaviour' and 'does not halt' is... > If the subordinate UTM terminates normally the halt decider UTM > transitions to its own final state of SUBORDINATE_HAS_TERMINATED. > > The redefined halt decider is not subject to the conventional halting > problem trick. Its input cannot possibly do the opposite of whatever it > decides because the input has already terminated before the halt decider > makes its decision. I have no idea what difference this is supposed to make. Linz's H (ex hypothesi) answers the question 'will my input Turing Machine description halt with the specified input'. So whatever answer it gives must conform to what happens when H_Hat(H_Hat-description) is run as a Turing Machine. Whether it will be aborted prematurely or not in your debug-mode isn't relevant to this question. So what happens if you run your H_Hat with a description of H_Hat as it's input? i.e. when you don't run it inside 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-26 12:44 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <TMOdnVf4TI6SlgrCnZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #156107 |
On 10/26/2020 11:43 AM, André G. Isaak wrote:
> On 2020-10-26 10:30, olcott wrote:
>> On 10/26/2020 8:37 AM, Alan Mackenzie wrote:
>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>> On 10/24/2020 4:41 PM, Alan Mackenzie wrote:
>>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>>> On 10/24/2020 2:54 PM, Alan Mackenzie wrote:
>>>>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>>>>> On 10/24/2020 12:27 PM, Richard Damon wrote:
>>>
>>> [ .... ]
>>>
>>>>>> The difference is that the revised question cannot be contradicted to
>>>>>> make the halting problem undecidable:
>>>
>>>>> I can't see that at all. The two questions are essentially the same,
>>>>> aren't they, so your modified question will be just as applicable to
>>>>> the Halting problem proofs as the original, won't it?
>>>
>>>>> Or, put another way, could you give a clear example of something for
>>>>> which the HP question and your question give different answers?
>>>
>>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true
>>>>>> means that the input has infinite execution.
>>>
>>> It also means a fairy-tale halting decider would return "doesn't
>>> halt" in
>>> exactly the same circumstances.
>>
>> No. Not at all. Not in the least little bit.
>> It is not a fairy-tale at all.
>>
>> The redefined halt 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.
>
> And the difference between 'non-terminating behaviour' and 'does not
> halt' is...
>
>> If the subordinate UTM terminates normally the halt decider UTM
>> transitions to its own final state of SUBORDINATE_HAS_TERMINATED.
>>
>> The redefined halt decider is not subject to the conventional halting
>> problem trick. Its input cannot possibly do the opposite of whatever
>> it decides because the input has already terminated before the halt
>> decider makes its decision.
>
> I have no idea what difference this is supposed to make.
void H_Hat(u32 M)
{
if (!Halts(M, M))
MOV_EAX_0 // Does not Halt
else
{
MOV_EAX_1 // Halts
HERE: goto HERE;
}
HALT
}
void H(u32 M, u32 N)
{
if (!Halts(M, M))
MOV_EAX_0 // Does not Halt
else
MOV_EAX_1 // Halts
HALT
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT
}
To the question:
Does H_Hat halt on it input H_Hat?
Both Yes and No are the wrong final state to transition to.
void H_Hat(u32 M)
if (Aborted_Because_Non_Halting_Behavior_Detected(M, M))
MOV_EAX_1 // Execution of M(N) has been aborted
else
{
MOV_EAX_0 // M(N) has halted
HERE: goto HERE;
}
HALT
}
void H(u32 M, u32 N)
{
if (Aborted_Because_Non_Halting_Behavior_Detected(M, M))
MOV_EAX_1 // Execution of M(N) has been aborted
else
MOV_EAX_0 // M(N) has halted
HALT
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT
}
The redefined halt 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.
The redefined halt decider is not subject to the conventional halting
problem trick. Its input cannot possibly do the opposite of whatever it
decides because the input has already terminated before the halt decider
makes its decision.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 13:13 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <qu-dnW7PetBXjArCnZ2dnUU7-KHNnZ2d@giganews.com> |
| In reply to | #156106 |
On 10/26/2020 12:38 PM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 10/26/2020 8:37 AM, Alan Mackenzie wrote: >>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>> On 10/24/2020 4:41 PM, Alan Mackenzie wrote: >>>>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>>>> On 10/24/2020 2:54 PM, Alan Mackenzie wrote: > >>>>>> The difference is that the revised question cannot be contradicted >>>>>> to make the halting problem undecidable: > >>>>> I can't see that at all. The two questions are essentially the >>>>> same, aren't they, so your modified question will be just as >>>>> applicable to the Halting problem proofs as the original, won't it? > >>>>> Or, put another way, could you give a clear example of something for >>>>> which the HP question and your question give different answers? > >>>>>> Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) == true >>>>>> means that the input has infinite execution. > >>> It also means a fairy-tale halting decider would return "doesn't halt" in >>> exactly the same circumstances. > >> No. Not at all. Not in the least little bit. >> It is not a fairy-tale at all. > > Yes, totally. For the third time of asking, your A_B_N_H_B_D function's > return value would correspond exactly with the return of my posited > fairy-tale halt detector. > > You deny this without giving any reasoning or justification. You are > either being evasive and dishonest, or you are thoroughly confused. I > think the latter is more likely. > > If your A_B_N_H_B_D's output doesn't correspond exactly with the > fairy-tail halt detector's output, please identify an input program for > which they would differ. > In both cases the input H_Hat would not halt unless it has been aborted: H_Hat(H_Hat) H(H_Hat, H_Hat) That is why this is the correct halt decider function: bool Aborted_Because_Non_Halting_Behavior_Detected(M, N) When the return value of true is provided for the (M, N) input this return value is correct. Every other return value from bool Aborted_Because_Non_Halting_Behavior_Detected(M, N) does not occur because every other bool Aborted_Because_Non_Halting_Behavior_Detected(M, N) has had its execution terminated before it ever returns any value. Therefore we can conclude that bool Aborted_Because_Non_Halting_Behavior_Detected(M, N) Is a halt decider function that cannot be shown to be incorrect. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 14:46 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <HMadnccePsczugrCnZ2dnUU7-VGdnZ2d@giganews.com> |
| In reply to | #156114 |
On 10/26/2020 2:28 PM, Alan Mackenzie wrote:
> In comp.theory olcott <NoOne@nowhere.com> wrote:
>> On 10/26/2020 12:38 PM, Alan Mackenzie wrote:
>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>> On 10/26/2020 8:37 AM, Alan Mackenzie wrote:
>
> [ .... ]
>
>>>>> It also means a fairy-tale halting decider would return "doesn't
>>>>> halt" in exactly the same circumstances.
>
>>>> No. Not at all. Not in the least little bit. It is not a fairy-tale
>>>> at all.
>
>>> Yes, totally. For the third time of asking, your A_B_N_H_B_D
>>> function's return value would correspond exactly with the return of my
>>> posited fairy-tale halt detector.
>
>>> You deny this without giving any reasoning or justification. You are
>>> either being evasive and dishonest, or you are thoroughly confused. I
>>> think the latter is more likely.
>
>>> If your A_B_N_H_B_D's output doesn't correspond exactly with the
>>> fairy-tail halt detector's output, please identify an input program
>>> for which they would differ.
>
>> In both cases the input H_Hat would not halt unless it has been aborted:
>> H_Hat(H_Hat)
>> H(H_Hat, H_Hat)
>
> Why are you being so damned evasive and dishonest? My question was not
> about comparing H_Hat with H. It was about comparing your A_B_N_H_B_D
> with a putative halt decider. They both give the same results.
void H_Hat(u32 M)
{
if (!Halts(M, M))
MOV_EAX_0 // Does not Halt
else
{
MOV_EAX_1 // Halts
HERE: goto HERE;
}
HALT
}
void H(u32 M, u32 N)
{
if (!Halts(M, M))
MOV_EAX_0 // Does not Halt
else
MOV_EAX_1 // Halts
HALT
}
int main()
{
u32 M = (u32)H_Hat;
H(M, M);
HALT
}
OK then: Let me know which of (a) or (b) is correct and explain why it
is correct:
(a) H.MOV_EAX_0 // in Linz it is a transition to a final state of ((qn))
(b) H.MOV_EAX_1 // in Linz it is a transition to a final state of ((qy))
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 15:43 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <L7adnVRuPZt6qQrCnZ2dnUU7-TOdnZ2d@giganews.com> |
| In reply to | #156120 |
On 10/26/2020 2:46 PM, olcott wrote:
> On 10/26/2020 2:28 PM, Alan Mackenzie wrote:
>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>> On 10/26/2020 12:38 PM, Alan Mackenzie wrote:
>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>> On 10/26/2020 8:37 AM, Alan Mackenzie wrote:
>>
>> [ .... ]
>>
>>>>>> It also means a fairy-tale halting decider would return "doesn't
>>>>>> halt" in exactly the same circumstances.
>>
>>>>> No. Not at all. Not in the least little bit. It is not a fairy-tale
>>>>> at all.
>>
>>>> Yes, totally. For the third time of asking, your A_B_N_H_B_D
>>>> function's return value would correspond exactly with the return of my
>>>> posited fairy-tale halt detector.
>>
>>>> You deny this without giving any reasoning or justification. You are
>>>> either being evasive and dishonest, or you are thoroughly confused. I
>>>> think the latter is more likely.
>>
>>>> If your A_B_N_H_B_D's output doesn't correspond exactly with the
>>>> fairy-tail halt detector's output, please identify an input program
>>>> for which they would differ.
>>
>>> In both cases the input H_Hat would not halt unless it has been aborted:
>>> H_Hat(H_Hat)
>>> H(H_Hat, H_Hat)
>>
>> Why are you being so damned evasive and dishonest? My question was not
>> about comparing H_Hat with H. It was about comparing your A_B_N_H_B_D
>> with a putative halt decider. They both give the same results.
>
>
> void H_Hat(u32 M)
> {
> if (!Halts(M, M))
> MOV_EAX_0 // Does not Halt
> else
> {
> MOV_EAX_1 // Halts
> HERE: goto HERE;
> }
> HALT
> }
>
>
> void H(u32 M, u32 N)
> {
> if (!Halts(M, M))
> MOV_EAX_0 // Does not Halt
> else
> MOV_EAX_1 // Halts
> HALT
> }
>
> int main()
> {
> u32 M = (u32)H_Hat;
> H(M, M);
> HALT
> }
>
>
> OK then: Let me know which of (a) or (b) is correct and explain why it
> is correct:
>
> (a) H.MOV_EAX_0 // in Linz it is a transition to a final state of ((qn))
> (b) H.MOV_EAX_1 // in Linz it is a transition to a final state of ((qy))
>
>
> Copyright 2020 Pete Olcott
This answer may be too difficult to understand without an actual
execution trace of fully operational code. I have already explained it
again and again and no one has understood.
The key summation of all of these execution trace answers is that
bool Aborted_Because_Non_Halting_Behavior_Detected(M, M)
always decides its input correctly and cannot be shown otherwise.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 16:27 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <g-adnRutsovUogrCnZ2dnUU7-XvNnZ2d@giganews.com> |
| In reply to | #156122 |
On 10/26/2020 4:07 PM, Alan Mackenzie wrote:
> In comp.theory olcott <NoOne@nowhere.com> wrote:
>> On 10/26/2020 2:46 PM, olcott wrote:
>>> On 10/26/2020 2:28 PM, Alan Mackenzie wrote:
>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>> On 10/26/2020 12:38 PM, Alan Mackenzie wrote:
>>>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>>>> On 10/26/2020 8:37 AM, Alan Mackenzie wrote:
>
>>>> [ .... ]
>
>>>>>>>> It also means a fairy-tale halting decider would return "doesn't
>>>>>>>> halt" in exactly the same circumstances.
>
>>>>>>> No. Not at all. Not in the least little bit.? It is not a fairy-tale
>>>>>>> at all.
>
>>>>>> Yes, totally.? For the third time of asking, your A_B_N_H_B_D
>>>>>> function's return value would correspond exactly with the return of my
>>>>>> posited fairy-tale halt detector.
>
>>>>>> You deny this without giving any reasoning or justification.? You are
>>>>>> either being evasive and dishonest, or you are thoroughly confused.? I
>>>>>> think the latter is more likely.
>
>>>>>> If your A_B_N_H_B_D's output doesn't correspond exactly with the
>>>>>> fairy-tail halt detector's output, please identify an input program
>>>>>> for which they would differ.
>
>>>>> In both cases the input H_Hat would not halt unless it has been aborted:
>>>>> H_Hat(H_Hat)
>>>>> H(H_Hat, H_Hat)
>
>>>> Why are you being so damned evasive and dishonest?? My question was not
>>>> about comparing H_Hat with H.? It was about comparing your A_B_N_H_B_D
>>>> with a putative halt decider.? They both give the same results.
>
>>> void H_Hat(u32 M)
>>> {
>>> ? if (!Halts(M, M))
>>> ??? MOV_EAX_0? // Does not Halt
>>> ? else
>>> ? {
>>> ??? MOV_EAX_1? // Halts
>>> ??? HERE: goto HERE;
>>> ? }
>>> ? HALT
>>> }
>
>
>>> void H(u32 M, u32 N)
>>> {
>>> ? if (!Halts(M, M))
>>> ??? MOV_EAX_0? // Does not Halt
>>> ? else
>>> ??? MOV_EAX_1? // Halts
>>> ? HALT
>>> }
>
>>> int main()
>>> {
>>> ? u32 M = (u32)H_Hat;
>>> ? H(M, M);
>>> ? HALT
>>> }
>
>
>>> OK then: Let me know which of (a) or (b) is correct and explain why it
>>> is correct:
>
>>> (a) H.MOV_EAX_0 // in Linz it is a transition to a final state of ((qn))
>>> (b) H.MOV_EAX_1 // in Linz it is a transition to a final state of ((qy))
>
>
>>> Copyright 2020 Pete Olcott
>
>> This answer ....
>
> You haven't given an answer. You continue to evade.
>
>> .... may be too difficult to understand without an actual execution
>> trace of fully operational code. I have already explained it again and
>> again and no one has understood.
>
> That suggests that your explanation is poor, or that you fail yourself to
> understand what you're trying to explain.
Tracing hundreds of steps of recursive invocation cannot not be
explained in any simple way. I have given the answer many times.
It is (apparently) too difficult to understand without an actual
execution trace.
>> The key summation of all of these execution trace answers is that
>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, M)
>> always decides its input correctly and cannot be shown otherwise.
>
> It does not, and it has been shown otherwise.
I am not saying the code always gets the right answer to do this I have
to provide an infinite proof.
I am saying that unlike the conventional self-referential halting
problem proofs no counter-example can be provided that shows that it
necessarily gets the wrong answer.
If you really think that I must be wrong then try and find such a
counter-example proving that I am wrong. As soon as you find out that
this is logically impossible it might begin to occur to you that I might
be right.
> Your problem is that you do not understand the maths, that you refuse to
> understand the maths, and that you do not take advice and help from
> people who do understand it.
It is not about the math. It is about the computer science.
> This has all been a waste of time. A waste of several hours for me, a
> waste of two decades for you. Don't you think it's time to cut your
> losses and move on to something more fruitful and enjoyable?
>
>> --
>> Copyright 2020 Pete Olcott
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 09:53 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <us2dnbMUncfPqQXCnZ2dnUU7-UPNnZ2d@giganews.com> |
| In reply to | #156125 |
On 10/27/2020 2:03 AM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 10/26/2020 4:07 PM, Alan Mackenzie wrote: >>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>> On 10/26/2020 2:46 PM, olcott wrote: >>>>> On 10/26/2020 2:28 PM, Alan Mackenzie wrote: > > [ .... ] > >>>>>> Why are you being so damned evasive and dishonest?? My question was not >>>>>> about comparing H_Hat with H.? It was about comparing your A_B_N_H_B_D >>>>>> with a putative halt decider.? They both give the same results. > > [ .... ] > >>>> This answer .... > >>> You haven't given an answer. You continue to evade. > >>>> .... may be too difficult to understand without an actual execution >>>> trace of fully operational code. I have already explained it again >>>> and again and no one has understood. > >>> That suggests that your explanation is poor, or that you fail yourself >>> to understand what you're trying to explain. > >> Tracing hundreds of steps of recursive invocation cannot not be >> explained in any simple way. I have given the answer many times. >> It is (apparently) too difficult to understand without an actual >> execution trace. > > Or your idea is simply incoherent. You can't show any incoherence with this because there is none. You can dogmatically assert incoherence yet can not show it proving that your assertion is merely vacuous. I will soon have fully operational code that shows this: bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) decides its input correctly. It creates another process context and executes H-Hat(H_Hat) in this process context in DebugStep() mode. This instance of H_Hat() executes another instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) in its own process context. This instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) creates another process context and executes yet another H-Hat(H_Hat) in this third process context in DebugStep() mode. // 2018-12-13 @7:00 PM solution As soon as H_Hat's second invocation executes bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) a second time from the same machine address and there is no conditional code in the execution trace of H_Hat that would terminate this otherwise infinite recursion then the first instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) stops executing H_Hat() in DebugStep() mode and reports true. This same process can be implemented as UTMs executing subordinate UTMs one state transition at a time where each subordinate UTM has its own portion of the master UTM tape. >>>> The key summation of all of these execution trace answers is that >>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, M) >>>> always decides its input correctly and cannot be shown otherwise. > >>> It does not, and it has been shown otherwise. > >> I am not saying the code always gets the right answer .... > > Let's see: this is what you wrote in an answer to somebody else: > >>>> The key summation of all of these execution trace answers is that >>>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, M) always >>>> decides its input correctly and cannot be shown otherwise. > > So you're either confused or a liar. Here it is much more accurately: It is a partial WOULD_NOT_HALT decider that cannot be shown to have any undecidable input. I say things imprecisely initially so that people can get the gist of the idea before narrowing it down to a more precise statement. >> .... to do this I have to provide an infinite proof. > > For which you'd need to learn some mathematics. By merely providing all the steps (see above) of deciding bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) I have already proved my point. >> I am saying that unlike the conventional self-referential halting >> problem proofs no counter-example can be provided that shows that it >> necessarily gets the wrong answer. > > Your A_B_N_H_B_D function is (or will be) a purported halting detector > returning one of two values, "halts", "doesn't halt". Such functions > have been shown to be impossible. The precise internal details are > unimportant, and I'm not that much interested in them. If we try to return those two values then the input program can do the opposite of whatever the halt decider decides, making halting undecidable. So instead we return these two values: (a) Aborted_Because_Non_Halting_Behavior_Detected (b) Has_Already_Terminated_Normally >> If you really think that I must be wrong then try and find such a >> counter-example proving that I am wrong. > > I've already done that - a brute force search for a counter-example to > Goldbach's Conjecture. No that example merely shows that you have failed to distinguish between undecided and undecidable. GC is the former and not the latter. In any case I have shown that all of the conventional halting problem proofs do not show that the halting problem is undecidable >> As soon as you find out that this is logically impossible it might >> begin to occur to you that I might be right. > > It is logically impossible for you to be right, but for some reason you > assume that logic that is beyond your capabilities doesn't apply to you. Or the only reason why no one has correctly shown any mistake in my work is that there is no mistake in my work and I am correct. >>> Your problem is that you do not understand the maths, that you refuse >>> to understand the maths, and that you do not take advice and help from >>> people who do understand it. > >> It is not about the math. It is about the computer science. > > That is a truly ignorant remark. Math defines some of its terms differently. I am not referring to those definitions. >>> This has all been a waste of time. A waste of several hours for me, a >>> waste of two decades for you. Don't you think it's time to cut your >>> losses and move on to something more fruitful and enjoyable? > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <janburse@fastmail.fm> |
|---|---|
| Date | 2020-10-27 21:07 +0100 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <rn9ull$sp6$2@solani.org> |
| In reply to | #156145 |
In what parallel universum does your nonsense have anything to do with Prolog? You fucking inhibited cross posting moron? No need to post responses on comp.lang.prolog. olcott schrieb: > my prostata hurts therefore I vomit on usenet > Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-26 16:57 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <b8ydneaiavel2wrCnZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #156122 |
On 10/26/2020 4:07 PM, Alan Mackenzie wrote:
> In comp.theory olcott <NoOne@nowhere.com> wrote:
>> On 10/26/2020 2:46 PM, olcott wrote:
>>> On 10/26/2020 2:28 PM, Alan Mackenzie wrote:
>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>> On 10/26/2020 12:38 PM, Alan Mackenzie wrote:
>>>>>> In comp.theory olcott <NoOne@nowhere.com> wrote:
>>>>>>> On 10/26/2020 8:37 AM, Alan Mackenzie wrote:
>
>>>> [ .... ]
>
>>>>>>>> It also means a fairy-tale halting decider would return "doesn't
>>>>>>>> halt" in exactly the same circumstances.
>
>>>>>>> No. Not at all. Not in the least little bit.? It is not a fairy-tale
>>>>>>> at all.
>
>>>>>> Yes, totally.? For the third time of asking, your A_B_N_H_B_D
>>>>>> function's return value would correspond exactly with the return of my
>>>>>> posited fairy-tale halt detector.
>
>>>>>> You deny this without giving any reasoning or justification.? You are
>>>>>> either being evasive and dishonest, or you are thoroughly confused.? I
>>>>>> think the latter is more likely.
>
>>>>>> If your A_B_N_H_B_D's output doesn't correspond exactly with the
>>>>>> fairy-tail halt detector's output, please identify an input program
>>>>>> for which they would differ.
>
>>>>> In both cases the input H_Hat would not halt unless it has been aborted:
>>>>> H_Hat(H_Hat)
>>>>> H(H_Hat, H_Hat)
>
>>>> Why are you being so damned evasive and dishonest?? My question was not
>>>> about comparing H_Hat with H.? It was about comparing your A_B_N_H_B_D
>>>> with a putative halt decider.? They both give the same results.
>
>>> void H_Hat(u32 M)
>>> {
>>> ? if (!Halts(M, M))
>>> ??? MOV_EAX_0? // Does not Halt
>>> ? else
>>> ? {
>>> ??? MOV_EAX_1? // Halts
>>> ??? HERE: goto HERE;
>>> ? }
>>> ? HALT
>>> }
>
>
>>> void H(u32 M, u32 N)
>>> {
>>> ? if (!Halts(M, M))
>>> ??? MOV_EAX_0? // Does not Halt
>>> ? else
>>> ??? MOV_EAX_1? // Halts
>>> ? HALT
>>> }
>
>>> int main()
>>> {
>>> ? u32 M = (u32)H_Hat;
>>> ? H(M, M);
>>> ? HALT
>>> }
>
>
>>> OK then: Let me know which of (a) or (b) is correct and explain why it
>>> is correct:
>
>>> (a) H.MOV_EAX_0 // in Linz it is a transition to a final state of ((qn))
>>> (b) H.MOV_EAX_1 // in Linz it is a transition to a final state of ((qy))
>
>
>>> Copyright 2020 Pete Olcott
>
>> This answer ....
>
> You haven't given an answer. You continue to evade.
>
>> .... may be too difficult to understand without an actual execution
>> trace of fully operational code. I have already explained it again and
>> again and no one has understood.
>
> That suggests that your explanation is poor, or that you fail yourself to
> understand what you're trying to explain.
>
>> The key summation of all of these execution trace answers is that
>> bool Aborted_Because_Non_Halting_Behavior_Detected(M, M)
>> always decides its input correctly and cannot be shown otherwise.
>
> It does not, and it has been shown otherwise.
If you were paying very close enough attention rather than merely
glancing at a few words here and there under the presumption that I must
be incorrect you would notice that none of the examples ever showed a
single case where:
bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N)
ever returned an incorrect value for its input.
When there are two or three simultaneous instances of H_Hat and two
different instances of the halt decider each one being executed in its
own process context it may be a little difficult to see which halt
decider makes the decision and which H_Hat is the input basis for its
decision.
A full execution trace will solve this problem.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-27 04:53 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <rn8u82$va9$1@dont-email.me> |
| In reply to | #156128 |
On 2020-10-26 15:57, olcott wrote: > If you were paying very close enough attention rather than merely > glancing at a few words here and there under the presumption that I must > be incorrect you would notice that none of the examples ever showed a > single case where: > > bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N) > ever returned an incorrect value for its input. Can we get you to commit the following more precise set of claims? (1) In every instance where its input would not halt when run independently, you ABNHBD function will always return 'non halting behavior detected - aborted' (2) In every instance where its input would halt when run independently, your ABNHBD will return 'terminated normally' (3) Your ABNHBD function is actually guaranteed to return one of the above two values for every input. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 10:20 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] key definitions provided |
| Message-ID | <GrGdnenXStlEpwXCnZ2dnUU7-UvNnZ2d@giganews.com> |
| In reply to | #156144 |
On 10/27/2020 5:53 AM, André G. Isaak wrote: > On 2020-10-26 15:57, olcott wrote: > >> If you were paying very close enough attention rather than merely >> glancing at a few words here and there under the presumption that I >> must be incorrect you would notice that none of the examples ever >> showed a single case where: >> >> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N) >> ever returned an incorrect value for its input. > > Can we get you to commit the following more precise set of claims? > > (1) In every instance where its input would not halt when run > independently, you ABNHBD function will always return 'non halting > behavior detected - aborted' Here is what I can commit to: There is no input to this function that can be shown to be undecidable: bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) > (2) In every instance where its input would halt when run independently, > your ABNHBD will return 'terminated normally' H_Hat(H_Hat) only terminates because one of the instances of this recursive invocation was aborted. If none of the instances of its recursive invocation were aborted then H_Hat(H_Hat) would never terminate. H_Hat(H_Hat) is yet another example where bool Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) decides its input correctly. > (3) Your ABNHBD function is actually guaranteed to return one of the > above two values for every input. bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) is a partial WOULD_NOT_HALT decider that will initially only decide (H_Hat, H_Hat). The design for it to correctly decide two other infinite classes of computations is already complete. At no point in my presentation of it will it ever be all knowing. Once it is accepted that this design proves that the conventional self-referential halting problem proofs do not show that the halting problem is undecidable funding may be allocated to enhance the robustness of the halt decider design using deep learning. I would not be interested in this project myself. My interest in in perfecting the upper knowledge ontology of natural language. https://en.wikipedia.org/wiki/Upper_ontology One of the key purposes of this halting problem project is to gain very significant credibility to be able to work on the architecture of the upper knowledge ontology of AI projects like Cyc. The key thing that these projects need is an automated self-validating process to self populate their knowledge base. My upper ontology work would be focused on solving this problem. > > André > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-27 12:53 -0600 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] key definitions provided |
| Message-ID | <rn9qb2$kgt$1@dont-email.me> |
| In reply to | #156146 |
On 2020-10-27 09:20, olcott wrote: > On 10/27/2020 5:53 AM, André G. Isaak wrote: >> On 2020-10-26 15:57, olcott wrote: >> >>> If you were paying very close enough attention rather than merely >>> glancing at a few words here and there under the presumption that I >>> must be incorrect you would notice that none of the examples ever >>> showed a single case where: >>> >>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N) >>> ever returned an incorrect value for its input. >> >> Can we get you to commit the following more precise set of claims? >> >> (1) In every instance where its input would not halt when run >> independently, you ABNHBD function will always return 'non halting >> behavior detected - aborted' > > Here is what I can commit to: > There is no input to this function that can be shown to be undecidable: > bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) Are you attempting to answer my first question or my third question here? Saying no input is undecidable would seem to be an answer to my third question. It doesn't seem to have any relevance to my first question. >> (2) In every instance where its input would halt when run >> independently, your ABNHBD will return 'terminated normally' > > H_Hat(H_Hat) only terminates because one of the instances of this > recursive invocation was aborted. If none of the instances of its > recursive invocation were aborted then H_Hat(H_Hat) would never > terminate. H_Hat(H_Hat) is yet another example where > bool Aborted_Because_Non_Halting_Behavior_Detected(H_Hat, H_Hat) > decides its input correctly. So when we consider H(H_Hat, H_HAT) what are you claiming is the output of: (1) Your ABNHBD contained in H (2) Your ABNHBD contained in the outermost instance of H_Hat? >> (3) Your ABNHBD function is actually guaranteed to return one of the >> above two values for every input. > > bool Aborted_Because_Non_Halting_Behavior_Detected(u32 P, u32 I) > is a partial WOULD_NOT_HALT decider that will initially only decide > (H_Hat, H_Hat). This contradicts your earlier claim that no input to this function can be undecidable. Are you here claiming that there *are* inputs that aren't decidable, or that there are currently inputs that are not *correctly* decidable? 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-27 10:28 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <74mdnUqMnuc-oQXCnZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #156144 |
On 10/27/2020 9:52 AM, Malcolm McLean wrote:
> On Tuesday, 27 October 2020 at 14:31:03 UTC, Mike Terry wrote:
>> On 27/10/2020 10:53, André G. Isaak wrote:
>>> On 2020-10-26 15:57, olcott wrote:
>>>
>>>> If you were paying very close enough attention rather than merely
>>>> glancing at a few words here and there under the presumption that I
>>>> must be incorrect you would notice that none of the examples ever
>>>> showed a single case where:
>>>>
>>>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N)
>>>> ever returned an incorrect value for its input.
>>>
>>> Can we get you to commit the following more precise set of claims?
>>>
>>> (1) In every instance where its input would not halt when run
>>> independently, you ABNHBD function will always return 'non halting
>>> behavior detected - aborted'
>>>
>>> (2) In every instance where its input would halt when run independently,
>>> your ABNHBD will return 'terminated normally'
>>>
>>> (3) Your ABNHBD function is actually guaranteed to return one of the
>>> above two values for every input.
>>>
>>> André
>>>
>> This is what I've been trying to get PO to clarify in my last few posts.
>> He steadfastly declines to provide an actual specification for what
>> his ABNHDB() function, or even to clarify anything about what it does,
>> saying that he's given a "trace" that shows it making the right decision
>> (whatever that means!). (He refuses to say define what the "right
>> decision" is, when it's called with an input pair (Pgm, Data).)
>>
>> The most I've ever seen him say is that ABNHDB() steps through its input
>> program's execution until either it halts, or it "detects non-halting
>> behaviour", but he WON'T clarify "non-halting behaviour", even to the
>> point of saying whether a halting calculation P(I) can exhibit
>> non-halting behaviour! I think that's what you're trying to pin him
>> down on. (It's my focus anyway.)
>>
>> The problem with your questions as worded is that he can/will reply "my
>> decider isn't all-knowing, and it may not work with /every/ input".
>> Fine, we know it only has to work with his H_Hat(H_Hat) calculation.
>> All my attempts to get him to talk about that specific case come to nothing.
>>
>> Anyway, I suggest that your wording above will need to have filters
>> added so that it only talks about the one case his H actually has to
>> deal with. Also to avoid the "my code is not all-knowing" response,
>> perhaps (1) should say something like "ABNHDB() returns ABORTED for
>> input pair (H_Hat, H_Hat) only if it is the case that calculation
>> H_Hat(H_Hat) is non-halting" ... Hope you have more success than me!
>>
> Here's the code
>
> int eax = 1; // seto to zero means "abort".
>
> int AbortedBecauseNonHaltingBehaviourDetected(char *M, char *N)
> {
> if (M == H_Hatsrc && N == H_Hatsrc)
> {
> // we know that this will cause an infinite recursion of debug traces if we
> // don't take action, so detect it and take action here
> eax = 0; // aborted
> return 1;
> }
> // a real halt decider would have to to more, but because we only need one case
> // we don't have to give the rest of the logic
> }
>
> void H_Hat(char *input)
> {
> if (!AbortedBecauseNonHaltingBehaviourDetected(input, input))
> while(1); // loop forever if not aborted
> }
>
> char *H_Hatsrc = "void H_Hat ..."; // Don't actually ned this because detect function is a stub.
>
> int main(void)
> {
> AbortedBecauseNonHaltingBehaviourDetected(H_Hatsrc, H_Hatsrc);
> if (eax == 0)
> printf("aborted\n");
> else
> printf("Not aborted\n");
>
> eax = 1; // reset
> H_Hat(H_Hatsrc);
> if (eax == 0)
> printf("aborted\n");
> else
> printf("not aborted\n");
> }
>
> Can't you see what PO is saying? The contradiction no longer exists when we change the function
> from "halts" to "AbortedBecauseNonHaltingBehaviourDetected.
>
Yes that is the correct key conclusion.
u32 AbortedBecauseNonHaltingBehaviourDetected(u32 P, u32 I)
already does a multi level recursive DebugStep().
I have already posted the every single step detailed design of exactly
how u32 AbortedBecauseNonHaltingBehaviourDetected(H_Hat, H_Hat)
is decided.
So I have already proved my point that (H_Hat, H_Hat) is decidable.
The last step is writing the code that decides (H_Hat, H_Hat).
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 11:00 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <H82dnWfLGtWe2QXCnZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #156144 |
On 10/27/2020 9:30 AM, Mike Terry wrote: > On 27/10/2020 10:53, André G. Isaak wrote: >> On 2020-10-26 15:57, olcott wrote: >> >>> If you were paying very close enough attention rather than merely >>> glancing at a few words here and there under the presumption that I >>> must be incorrect you would notice that none of the examples ever >>> showed a single case where: >>> >>> bool Aborted_Because_Non_Halting_Behavior_Detected(u32 M, u32 N) >>> ever returned an incorrect value for its input. >> >> Can we get you to commit the following more precise set of claims? >> >> (1) In every instance where its input would not halt when run >> independently, you ABNHBD function will always return 'non halting >> behavior detected - aborted' >> >> (2) In every instance where its input would halt when run independently, >> your ABNHBD will return 'terminated normally' >> >> (3) Your ABNHBD function is actually guaranteed to return one of the >> above two values for every input. >> >> André >> > > This is what I've been trying to get PO to clarify in my last few posts. > He steadfastly declines to provide an actual specification for what > his ABNHDB() function, or even to clarify anything about what it does, This is about ten times now that I have provided a complete description of the full execution trace of how (H_Hat, H_Hat) is decided: (Your claim that I have never answered this question now seems dishonest). bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) decides its input correctly. It creates another process context and executes H-Hat(H_Hat) in this process context in DebugStep() mode. This instance of H_Hat() executes another instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) in its own process context. This instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) creates another process context and executes yet another H-Hat(H_Hat) in this third process context in DebugStep() mode. // 2018-12-13 @7:00 PM solution As soon as H_Hat's second invocation executes bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) a second time from the same machine address and there is no conditional code in the execution trace of H_Hat that would terminate this otherwise infinite recursion then the first instance of bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) stops executing H_Hat() in DebugStep() mode and reports true. This same process can be implemented as UTMs executing subordinate UTMs one state transition at a time where each subordinate UTM has its own portion of the master UTM tape. > saying that he's given a "trace" that shows it making the right decision > (whatever that means!). (He refuses to say define what the "right > decision" is, when it's called with an input pair (Pgm, Data).) That is such a foolish thing to say. You are being as dishonest as Ben. bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) if the above function did detect non halting behavior then Non_Halting_Behavior_Detected is true. if the above function did abort the execution of its input then Aborted_ is true. If the above function detected non halting behavior and aborted the execution of its input because it detected non halting behavior then Aborted_Because_Non_Halting_Behavior_Detected is true. > The most I've ever seen him say is that ABNHDB() steps through its input > program's execution until either it halts, or it "detects non-halting > behaviour", but he WON'T clarify "non-halting behaviour", even to the Yet another dishonesty. The above detailed description of the execution trace of (H_Hat, H_Hat) is terminated as soon as bool Aborted_Because_Non_Halting_Behavior_Detected(H-Hat, H_Hat) is invoked from the same machine address of H_Hat without any conditional branch instruction in H_Hat that would terminate this otherwise infinite recursion. This is my 2018-12-13 @ 7:00 PM solution. > point of saying whether a halting calculation P(I) can exhibit > non-halting behaviour! I think that's what you're trying to pin him > down on. (It's my focus anyway.) > > The problem with your questions as worded is that he can/will reply "my > decider isn't all-knowing, and it may not work with /every/ input". > Fine, we know it only has to work with his H_Hat(H_Hat) calculation. All > my attempts to get him to talk about that specific case come to nothing. Intuitively, a decider should be a Turing machine that given an input, halts and either accepts or rejects, relaying its answer in one of many equivalent ways, such as halting at an ACCEPT or REJECT state, or leaving its answer on the output tape.Yuval Filmus https://cs.stackexchange.com/questions/84433/what-is-decider Yuval Filmus top 0.04% overall Assistant Professor in the Department of Computer Science at the Technion. The architectural design that I provide is of a halt decider that divides all of its input into: (a) ABORTED_BECAUSE_NON_HALTING_BEHAVIOR_DETECTED (b) HAS_ALREADY_HALTED The actual fully operational software that I will provide will be a partial ABORTED_BECAUSE_NON_HALTING_BEHAVIOR_DETECTED decider. > Anyway, I suggest that your wording above will need to have filters > added so that it only talks about the one case his H actually has to > deal with. Also to avoid the "my code is not all-knowing" response, > perhaps (1) should say something like "ABNHDB() returns ABORTED for > input pair (H_Hat, H_Hat) only if it is the case that calculation > H_Hat(H_Hat) is non-halting" ... Hope you have more success than me! > > Mike. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 11:05 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <QM-dnXd6lMf42AXCnZ2dnUU7-d_NnZ2d@giganews.com> |
| In reply to | #156144 |
On 10/27/2020 10:45 AM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >> >>> Here's the code >> Is this code from PO, or is it your code? >> >> It is hard enough work dealing with PO, and I don't want to spend much >> time on /your/ arguments, even if you believe you are making the same >> argument as PO. If you feel that you have some insight into PO's >> thinking, by all means respond to my posts saying what you think, but I >> will probably not seriously engage with you. (I will read what you say >> at least, and might respond sometimes.) >> > It's my code. But based on what PO posted. The key difference is that PO > hasn't realised that you can stub the detector / abort function, because > it is a function and it only has to deal with an input set with one member. > > To be fair, this isn't obvious because the input set makes reference to > the function itself. You yourself seem to have made this error. You forgot > the word "if". It will cause an infinite recursion IF we don't take action. > But we do take action. > > To make this a bit more obvious, replace > if (M == H_Hatsrc && N == Hatsrc) > with > if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) > > That has the same effect, but now it's clearer that we're detecting > what would be an infinite recursion, and taking action against it. > > I'm trying to get an insight into why PO is convinced that he has refuted > the Linz proof. I might be wrong - I'm not him, I can't read his mind, and > he's not been entirely consistent. But I think I've identified it. > The Linz proof** claims to have proved the the halting problem is undecidable. It has not actually proved this. All of these proofs merely show one architectural design of a halt decider that gets the wrong answer some of the time. My architectural design of a halt decider cannot be shown to get the wrong answer any of the time. ** And all of the conventional self-referential halting problem proofs. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-27 13:36 -0500 |
| Subject | Re: The key aspects of x86utm are now finally complete [ I dare you to prove that I am wrong ] |
| Message-ID | <eeadnQAbUKYi9QXCnZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #156149 |
On 10/27/2020 11:53 AM, Malcolm McLean wrote: > On Tuesday, 27 October 2020 at 16:06:05 UTC, olcott wrote: >> On 10/27/2020 10:45 AM, Malcolm McLean wrote: >>> On Tuesday, 27 October 2020 at 15:30:51 UTC, Mike Terry wrote: >>>> >>>>> Here's the code >>>> Is this code from PO, or is it your code? >>>> >>>> It is hard enough work dealing with PO, and I don't want to spend much >>>> time on /your/ arguments, even if you believe you are making the same >>>> argument as PO. If you feel that you have some insight into PO's >>>> thinking, by all means respond to my posts saying what you think, but I >>>> will probably not seriously engage with you. (I will read what you say >>>> at least, and might respond sometimes.) >>>> >>> It's my code. But based on what PO posted. The key difference is that PO >>> hasn't realised that you can stub the detector / abort function, because >>> it is a function and it only has to deal with an input set with one member. >>> >>> To be fair, this isn't obvious because the input set makes reference to >>> the function itself. You yourself seem to have made this error. You forgot >>> the word "if". It will cause an infinite recursion IF we don't take action. >>> But we do take action. >>> >>> To make this a bit more obvious, replace >>> if (M == H_Hatsrc && N == Hatsrc) >>> with >>> if (strstr(M, "AbortedBecauseNonHaltingBehaviourDetected")) >>> >>> That has the same effect, but now it's clearer that we're detecting >>> what would be an infinite recursion, and taking action against it. >>> >>> I'm trying to get an insight into why PO is convinced that he has refuted >>> the Linz proof. I might be wrong - I'm not him, I can't read his mind, and >>> he's not been entirely consistent. But I think I've identified it. >>> >> The Linz proof** claims to have proved the the halting problem is >> undecidable. It has not actually proved this. All of these proofs merely >> show one architectural design of a halt decider that gets the wrong >> answer some of the time. My architectural design of a halt decider >> cannot be shown to get the wrong answer any of the time. >> >> ** And all of the conventional self-referential halting problem proofs. >> > I'm not quite sure what you've shown yet because you haven't been absolutely > clear. > Do you agree that AbortedBecauseNonHaltingBehaviourDetected() can be > stubbed to deal only with the input H_Hat, H_Hat? Or does this change > somethin fundamental? It is no good to merely stub this function when the complete description of the execution trace showing exactly how (H_Hat, H_Hat) is decided correctly has already been provided. Instead of a stub function we could simply assume that: bool Aborted_Because_Non_Halting_Behavior_Detected(u32 N, u32 M); always returns a correct result meaning that it: "only aborts its input and returns true when it detects the non halting behavior of its input" and otherwise returns false. Then we try to do the same thing as the conventional halting problem proofs and see if there is any input that it cannot correctly decide. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 7 of 13 — ← Prev page 1 … 5 6 [7] 8 9 … 13 Next page →
Back to top | Article view | comp.lang.c
csiph-web