Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #28957 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-03-09 16:56 -0600 |
| Last post | 2021-03-15 02:37 +0000 |
| Articles | 12 on this page of 452 — 20 participants |
Back to article view | Back to comp.theory
Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 16:56 -0600
Re: Refuting the halting problem proofs with fully operational code Siri Cruise <chine.bleu@yahoo.com> - 2021-03-09 15:39 -0800
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 18:49 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 18:02 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:35 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 20:49 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:10 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 21:12 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:27 +0000
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-10 00:29 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 18:42 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-10 00:57 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 19:05 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-10 01:49 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 20:39 -0600
Re: Refuting the halting problem proofs with fully operational code Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 18:48 -0800
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:18 -0500
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:39 +0000
Re: Refuting the halting problem proofs with fully operational code Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-10 03:59 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-09 22:04 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-09 22:20 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 20:36 -0800
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 05:06 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-10 00:12 -0800
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 09:23 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 09:27 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-10 15:41 +0000
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 09:55 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 08:46 -0700
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 10:12 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 09:55 -0700
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 16:03 +0000
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 10:23 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 17:16 +0000
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 12:01 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 12:11 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 12:14 -0700
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 14:05 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-10 22:02 +0000
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 15:08 -0700
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 16:38 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 15:53 -0700
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 17:07 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-10 23:40 +0000
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-10 17:10 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 16:16 -0500
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) olcott <NoOne@NoWhere.com> - 2021-03-13 15:37 -0600
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 15:18 -0400
Re: Refuting the halting problem proofs with fully operational code (Curry:1977) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 14:16 -0500
Re: Refuting the halting problem proofs with fully operational code (truth) Jeff Barnett <jbb@notatt.com> - 2021-03-10 11:49 -0700
Re: Refuting the halting problem proofs with fully operational code (truth) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 14:20 -0500
Re: Refuting the halting problem proofs with fully operational code (truth) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-10 20:18 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 23:51 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-11 00:38 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Jeff Barnett <jbb@notatt.com> - 2021-03-10 15:39 -0700
Re: Refuting the halting problem proofs with fully operational code (truth) Peter <peterxpercival@hotmail.com> - 2021-03-12 18:25 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 19:05 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 15:29 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 09:40 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 19:26 -0500
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 19:04 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 23:23 -0500
Re: Refuting the halting problem proofs with fully operational code [truth bearer defined] olcott <NoOne@NoWhere.com> - 2021-03-10 22:35 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 16:06 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 14:46 -0400
Re: Refuting the halting problem proofs with fully operational code (truth) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-10 15:25 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 09:38 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 15:42 +0000
Re: Refuting the halting problem proofs with fully operational code (truth) olcott <NoOne@NoWhere.com> - 2021-03-10 09:56 -0600
Re: Refuting the halting problem proofs with fully operational code (truth) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 11:33 -0500
Re: Refuting the halting problem proofs with fully operational code Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 20:11 -0800
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-11 01:45 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-10 20:10 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 00:03 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 18:08 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-14 15:20 -0400
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 08:15 -0600
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 08:31 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 00:15 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 18:22 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 01:02 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 20:35 -0600
Re: Refuting the halting problem proofs with fully operational code André G. Isaak <agisaak@gm.invalid> - 2021-03-11 19:36 -0700
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 20:48 -0600
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-11 20:13 -0700
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 21:22 -0600
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-11 21:16 -0700
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 22:24 -0600
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-11 22:20 -0700
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 23:36 -0600
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] Richard Damon <Richard@Damon-Family.org> - 2021-03-13 16:38 -0500
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 05:40 +0000
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 08:27 -0600
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 15:28 +0000
Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] Richard Damon <Richard@Damon-Family.org> - 2021-03-11 22:38 -0500
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-13 16:35 -0500
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 00:06 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 18:14 -0600
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 01:06 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 20:43 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 03:29 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-11 21:37 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 05:38 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 08:20 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 15:20 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 09:36 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 16:03 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 10:55 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 17:50 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 12:02 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 18:13 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 12:21 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-12 11:20 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 12:23 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 19:03 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 13:10 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-12 12:42 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 13:45 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 16:17 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-12 15:31 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-12 16:42 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-13 09:00 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-13 10:29 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-13 08:45 -0800
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-13 10:58 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-13 10:28 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-13 11:55 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-13 11:25 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] olcott <NoOne@NoWhere.com> - 2021-03-13 12:38 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] André G. Isaak <agisaak@gm.invalid> - 2021-03-13 12:51 -0700
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Richard Damon <Richard@Damon-Family.org> - 2021-03-14 16:00 -0400
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-12 16:39 -0800
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Richard Damon <Richard@Damon-Family.org> - 2021-03-12 23:20 -0500
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-13 00:34 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <NoOne@NoWhere.com> - 2021-03-12 20:10 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-13 04:08 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <NoOne@NoWhere.com> - 2021-03-12 22:51 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-13 23:53 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <polcott2@gmail.com> - 2021-03-13 18:20 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 21:54 -0500
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-14 16:34 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <polcott2@gmail.com> - 2021-03-14 13:17 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 13:27 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-14 11:35 -0700
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 13:43 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 17:43 -0400
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-14 18:43 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 14:05 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-14 19:22 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 14:47 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-14 21:22 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 16:46 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-15 00:00 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 19:43 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-15 01:12 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 20:24 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 21:50 -0400
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) R Kym Horsell <kym@kymhorsell.com> - 2021-03-15 01:53 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 21:20 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-14 19:29 -0700
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) R Kym Horsell <kym@kymhorsell.com> - 2021-03-15 03:30 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Jeff Barnett <jbb@notatt.com> - 2021-03-15 10:48 -0600
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-14 19:30 -0700
Re: Refuting the halting problem proofs [...]. Andy Walker <anw@cuboid.co.uk> - 2021-03-15 13:38 +0000
Re: Refuting the halting problem proofs [...]. olcott <NoOne@NoWhere.com> - 2021-03-15 09:03 -0500
Re: Refuting the halting problem proofs [...]. Alan Mackenzie <acm@muc.de> - 2021-03-15 14:22 +0000
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) olcott <NoOne@NoWhere.com> - 2021-03-15 09:44 -0500
Re: Refuting the halting problem proofs [...]. Richard Damon <Richard@Damon-Family.org> - 2021-03-16 07:33 -0400
Re: Refuting the halting problem proofs [...]. olcott <NoOne@NoWhere.com> - 2021-03-16 08:32 -0500
Re: Refuting the halting problem proofs [...]. Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:11 -0400
Re: Refuting the halting problem proofs [...]. olcott <NoOne@NoWhere.com> - 2021-03-18 22:15 -0500
Re: Refuting the halting problem proofs [...]. Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:50 -0400
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) olcott <NoOne@NoWhere.com> - 2021-03-15 09:09 -0500
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) David Brown <david.brown@hesbynett.no> - 2021-03-15 15:55 +0100
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) olcott <NoOne@NoWhere.com> - 2021-03-15 10:11 -0500
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) David Brown <david.brown@hesbynett.no> - 2021-03-15 16:38 +0100
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) olcott <NoOne@NoWhere.com> - 2021-03-15 12:01 -0500
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) David Brown <david.brown@hesbynett.no> - 2021-03-15 18:53 +0100
Re: Refuting the halting problem proofs [...]. (rebuttal has no basis) olcott <NoOne@NoWhere.com> - 2021-03-15 13:04 -0500
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) Jeff Barnett <jbb@notatt.com> - 2021-03-15 15:15 -0600
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) David Brown <david.brown@hesbynett.no> - 2021-03-16 09:35 +0100
Re: Refuting the halting problem proofs [...]. (I dare you to find the error) olcott <NoOne@NoWhere.com> - 2021-03-16 08:10 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-15 02:30 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 22:00 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-15 03:13 +0000
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) olcott <NoOne@NoWhere.com> - 2021-03-14 22:22 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-15 20:18 +0000
Re: Refuting the halting problem proofs with fully operational code (Kaz is getting it) olcott <NoOne@NoWhere.com> - 2021-03-15 15:41 -0500
Re: Refuting the halting problem proofs with fully operational code (Kaz is getting it) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 13:45 +0000
Re: Refuting the halting problem proofs with fully operational code (Kaz is getting it) olcott <NoOne@NoWhere.com> - 2021-03-16 09:59 -0500
Re: Refuting the halting problem proofs with fully operational code (Kaz is getting it) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 17:26 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 13:09 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 18:38 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 14:14 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 19:46 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 14:55 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:11 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 15:21 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:27 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 16:19 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 02:12 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 13:40 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 19:12 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 14:18 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-16 19:21 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 12:33 -0700
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 14:49 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:04 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 15:14 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:24 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 19:52 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 14:56 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 15:03 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:20 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 15:27 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:31 +0000
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) olcott <NoOne@NoWhere.com> - 2021-03-16 16:21 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 02:10 +0000
Re: Refuting the halting problem proofs with fully operational code (subordinate computation) olcott <NoOne@NoWhere.com> - 2021-03-17 09:11 -0500
Re: Refuting the halting problem proofs with fully operational code (It is not that hard.) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 12:17 -0700
Re: Refuting the halting problem proofs with fully operational code (simpler example) olcott <NoOne@NoWhere.com> - 2021-03-16 14:46 -0500
Re: Refuting the halting problem proofs with fully operational code (simpler example) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:10 +0000
Re: Refuting the halting problem proofs with fully operational code (simpler example) olcott <NoOne@NoWhere.com> - 2021-03-16 15:17 -0500
Re: Refuting the halting problem proofs with fully operational code (simpler example) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-16 20:22 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 16:16 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 14:38 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 16:52 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 15:25 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 17:38 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 16:03 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 18:34 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 18:35 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Jeff Barnett <jbb@notatt.com> - 2021-03-16 18:01 -0600
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 02:18 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing computable) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-16 23:42 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-16 17:06 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing computable) olcott <NoOne@NoWhere.com> - 2021-03-16 19:22 -0500
Halt Decider "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-16 18:29 -0700
Re: Halt Decider olcott <NoOne@NoWhere.com> - 2021-03-16 20:41 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 02:17 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing computable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 02:16 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing computable)[unconventional part] olcott <NoOne@NoWhere.com> - 2021-03-17 09:27 -0500
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 21:47 -0400
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 20:14 -0400
Re: Refuting the halting problem proofs with fully operational code (argument reframed on Ben's suggestion) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 20:09 -0400
Re: Refuting the halting problem proofs [...] Andy Walker <anw@cuboid.co.uk> - 2021-03-13 12:18 +0000
Re: Refuting the halting problem proofs [...](contradictory questions) olcott <NoOne@NoWhere.com> - 2021-03-13 08:18 -0600
Re: Refuting the halting problem proofs [...] (contradictory questions) olcott <NoOne@NoWhere.com> - 2021-03-13 08:23 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-14 02:10 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <NoOne@NoWhere.com> - 2021-03-13 20:21 -0600
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 21:59 -0500
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 02:30 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <NoOne@NoWhere.com> - 2021-03-14 22:15 -0500
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 03:33 +0000
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) olcott <NoOne@NoWhere.com> - 2021-03-14 22:40 -0500
Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) Richard Damon <Richard@Damon-Family.org> - 2021-03-15 08:25 -0400
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-11 22:51 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-11 22:08 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-13 12:39 -0500
Re: Refuting the halting problem proofs with fully operational code (switch statement not relevant) olcott <NoOne@NoWhere.com> - 2021-03-13 12:01 -0600
Re: Refuting the halting problem proofs with fully operational code (switch statement not relevant) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 16:56 -0500
Re: Refuting the halting problem proofs with fully operational code André G. Isaak <agisaak@gm.invalid> - 2021-03-13 11:01 -0700
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-13 12:33 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:55 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 21:07 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:34 +0000
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:16 -0500
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:47 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 20:55 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:27 +0000
Re: Refuting the halting problem proofs with fully operational code André G. Isaak <agisaak@gm.invalid> - 2021-03-09 20:38 -0700
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 21:42 -0600
Re: Refuting the halting problem proofs with fully operational code André G. Isaak <agisaak@gm.invalid> - 2021-03-09 21:24 -0700
Re: Refuting the halting problem proofs with fully operational code (UTM decider) olcott <NoOne@NoWhere.com> - 2021-03-09 22:30 -0600
Re: Refuting the halting problem proofs with fully operational code (UTM decider) André G. Isaak <agisaak@gm.invalid> - 2021-03-09 21:58 -0700
Re: Refuting the halting problem proofs with fully operational code (UTM decider) olcott <NoOne@NoWhere.com> - 2021-03-10 09:19 -0600
Re: Refuting the halting problem proofs with fully operational code (UTM decider) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 08:43 -0700
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-10 10:03 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 09:33 -0700
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-10 11:35 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 10:57 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 12:09 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 12:09 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 14:01 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 13:36 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 15:01 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 14:13 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 16:23 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 15:48 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 17:01 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 16:58 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 18:34 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 17:45 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 19:05 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-10 20:36 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 21:40 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 23:49 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 17:57 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 00:18 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 19:01 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 02:43 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 20:53 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 03:04 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 21:24 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 23:51 -0500
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-10 23:12 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 09:43 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 11:13 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 11:23 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 11:47 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 13:00 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 12:23 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 13:41 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:04 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:22 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-12 00:07 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:00 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:20 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:56 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 10:38 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 11:50 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 18:54 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 13:03 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 12:44 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 13:50 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 13:34 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-11 12:42 -0800
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:01 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) André G. Isaak <agisaak@gm.invalid> - 2021-03-11 14:12 -0700
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:26 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:54 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:52 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:46 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-11 23:41 +0000
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) olcott <NoOne@NoWhere.com> - 2021-03-11 17:56 -0600
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-12 00:52 +0000
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) olcott <NoOne@NoWhere.com> - 2021-03-11 19:10 -0600
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-13 00:21 +0000
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) olcott <NoOne@NoWhere.com> - 2021-03-12 19:57 -0600
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 16:59 -0500
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-14 01:50 +0000
Re: Refuting the halting problem proofs with fully operational code (tedious distinction) olcott <NoOne@NoWhere.com> - 2021-03-13 20:07 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 20:52 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) olcott <NoOne@NoWhere.com> - 2021-03-11 15:15 -0600
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 21:56 +0000
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Richard Damon <Richard@Damon-Family.org> - 2021-03-11 23:11 -0500
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Richard Damon <Richard@Damon-Family.org> - 2021-03-11 23:05 -0500
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-10 20:39 -0800
Re: Refuting the halting problem proofs with fully operational code (honest dialogue?) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 19:41 -0500
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 14:03 -0500
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-10 13:08 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 15:05 -0500
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 21:16 +0000
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-10 16:26 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-11 00:28 +0000
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-10 19:07 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Richard Damon <Richard@Damon-Family.org> - 2021-03-11 08:29 -0500
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-11 07:45 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Richard Damon <Richard@Damon-Family.org> - 2021-03-11 21:52 -0500
Re: Refuting the halting problem proofs with fully operational code (one point at a time) olcott <NoOne@NoWhere.com> - 2021-03-11 21:01 -0600
Re: Refuting the halting problem proofs with fully operational code (one point at a time) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 19:29 -0500
Re: Refuting the halting problem proofs with fully operational code (UTM decider) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 05:04 +0000
Re: Refuting the halting problem proofs with fully operational code (UTM decider) olcott <NoOne@NoWhere.com> - 2021-03-10 09:21 -0600
Re: Refuting the halting problem proofs with fully operational code (UTM decider) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 15:33 +0000
Re: Refuting the halting problem proofs with fully operational code (UTM decider) olcott <NoOne@NoWhere.com> - 2021-03-10 09:45 -0600
Re: Refuting the halting problem proofs with fully operational code (UTM decider) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 16:10 +0000
Re: Refuting the halting problem proofs with fully operational code (UTM decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-10 11:45 -0500
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:14 -0500
Re: Refuting the halting problem proofs with fully operational code "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-10 17:49 -0800
Re: Refuting the halting problem proofs with fully operational code Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-13 16:19 +0100
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-13 14:39 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-13 14:49 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-13 13:38 -0800
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-13 15:51 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-13 14:00 -0800
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-13 16:05 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 21:07 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-14 03:29 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <polcott2@gmail.com> - 2021-03-14 09:55 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-14 10:25 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 16:08 -0400
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 15:13 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) André G. Isaak <agisaak@gm.invalid> - 2021-03-14 14:44 -0600
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 16:02 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 16:06 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-14 23:58 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 19:27 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 03:15 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 22:24 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 03:39 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 22:43 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Richard Damon <Richard@Damon-Family.org> - 2021-03-15 08:30 -0400
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) R Kym Horsell <kym@kymhorsell.com> - 2021-03-15 03:27 +0000
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 12:51 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 15:20 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] André G. Isaak <agisaak@gm.invalid> - 2021-03-15 14:54 -0600
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 16:29 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] André G. Isaak <agisaak@gm.invalid> - 2021-03-15 15:33 -0600
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 17:00 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] André G. Isaak <agisaak@gm.invalid> - 2021-03-15 18:59 -0600
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 20:34 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] André G. Isaak <agisaak@gm.invalid> - 2021-03-15 20:53 -0600
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 22:22 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] André G. Isaak <agisaak@gm.invalid> - 2021-03-15 22:10 -0600
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] Richard Damon <Richard@Damon-Family.org> - 2021-03-16 08:04 -0400
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 14:33 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 16:56 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 15:01 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 15:04 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 15:11 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 17:28 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 16:01 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 20:47 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <NoOne@NoWhere.com> - 2021-03-15 22:58 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 21:36 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 21:39 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] olcott <polcott2@gmail.com> - 2021-03-16 00:00 -0500
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 22:08 -0700
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] Richard Damon <Richard@Damon-Family.org> - 2021-03-16 08:05 -0400
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] Richard Damon <Richard@Damon-Family.org> - 2021-03-16 08:18 -0400
Re: Refuting the halting problem proofs with fully operational code [bloody idiots] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-16 23:39 -0700
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) André G. Isaak <agisaak@gm.invalid> - 2021-03-14 15:09 -0600
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 16:12 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) André G. Isaak <agisaak@gm.invalid> - 2021-03-14 15:54 -0600
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 17:18 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) André G. Isaak <agisaak@gm.invalid> - 2021-03-14 17:02 -0600
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 20:31 -0400
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) olcott <NoOne@NoWhere.com> - 2021-03-14 17:43 -0500
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 18:01 -0400
Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) Richard Damon <Richard@Damon-Family.org> - 2021-03-14 17:55 -0400
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-14 17:38 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-14 19:54 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-15 03:05 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-15 08:09 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-15 13:37 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-15 15:52 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-15 14:09 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-15 16:22 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 14:37 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-14 02:26 +0000
Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) olcott <polcott2@gmail.com> - 2021-03-13 20:53 -0600
Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 03:07 +0000
Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) olcott <NoOne@NoWhere.com> - 2021-03-14 22:32 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-13 16:09 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 17:02 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) André G. Isaak <agisaak@gm.invalid> - 2021-03-13 16:05 -0700
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <NoOne@NoWhere.com> - 2021-03-13 17:33 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 21:09 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-14 02:10 +0000
Re: Refuting the halting problem proofs with fully operational code (revised answer) olcott <polcott2@gmail.com> - 2021-03-13 20:30 -0600
Re: Refuting the halting problem proofs with fully operational code (revised answer) Richard Damon <Richard@Damon-Family.org> - 2021-03-13 22:06 -0500
Re: Refuting the halting problem proofs with fully operational code (revised answer) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-15 02:37 +0000
Page 23 of 23 — ← Prev page 1 … 21 22 [23]
| From | olcott <polcott2@gmail.com> |
|---|---|
| Date | 2021-03-13 20:53 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) |
| Message-ID | <s2jtqs$c7n$1@dont-email.me> |
| In reply to | #29251 |
On 3/13/2021 8:26 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 3/13/2021 4:00 PM, Malcolm McLean wrote: >>> On Saturday, 13 March 2021 at 21:51:59 UTC, olcott wrote: > >>>> When the halt decider is based on adapting a UTM then nothing can slip >>>> past the analysis of the halt decider. >>>> >>> You can't solve the halting problem this way, e.g. determine the halting >>> status of a famous unknown problem. However you can pick up tight loops >>> or simple infinite recursion. >> >> The "do the opposite of whatever the halt decider decides" of the >> conventional proofs becomes decidable, they are decided as would not >> halt. > > There are an infinite number of inputs that represent computations that > do the same thing as H^. They form an undecidable set. You can spot a > few of them, but you can't catch them all. What you call "pathological > self-reference" can't be reliably detected. > > That's in abstract. Your practical approach -- simulate a computation > until it halts or until you detect that it won't -- is also impossible. I prove that it is possisble by doing it. > You "scam" to declare the wrong answer to be the correct answer is, in > fact pointless. If you really could detect those computations would not If you believe that this computation actually derives a wrong answer then you would have to point out a specific error and not merely dogmatically conclude that it must be wrong because you really really believe that it is wrong. http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > halt if not stopped, you'd have a conventional halt decider and you > should be boasting about that, not hiding your light under a "redefining > the criterion" bushel. That would be great. That would be much better. On 11/27/2020 9:02 PM, Ben Bacarisse wrote: > A computation that would not halt if its simulation were not > halted is indeed a non-halting computation. If we are literally answering the question: Does the input halt on its input? The precisely literal answer to that question is that both inputs that halt on their own and have to be aborted do halt either on their own or because they were aborted. Now that you point it out the faulty criteria stuff really is hogwash. Anyone that believes that a computation that never halts unless aborted is a halting computation is an idiot. If the only reason that it halts is that it was aborted IT IS A NON-HALTING COMPUTATION. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-15 03:07 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) |
| Message-ID | <87a6r58686.fsf@bsb.me.uk> |
| In reply to | #29253 |
olcott <polcott2@gmail.com> writes: > On 3/13/2021 8:26 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 3/13/2021 4:00 PM, Malcolm McLean wrote: >>>> On Saturday, 13 March 2021 at 21:51:59 UTC, olcott wrote: >> >>>>> When the halt decider is based on adapting a UTM then nothing can slip >>>>> past the analysis of the halt decider. >>>>> >>>> You can't solve the halting problem this way, e.g. determine the halting >>>> status of a famous unknown problem. However you can pick up tight loops >>>> or simple infinite recursion. >>> >>> The "do the opposite of whatever the halt decider decides" of the >>> conventional proofs becomes decidable, they are decided as would not >>> halt. >> >> There are an infinite number of inputs that represent computations that >> do the same thing as H^. They form an undecidable set. You can spot a >> few of them, but you can't catch them all. What you call "pathological >> self-reference" can't be reliably detected. >> >> That's in abstract. Your practical approach -- simulate a computation >> until it halts or until you detect that it won't -- is also impossible. > > I prove that it is possisble by doing it. You can not prove something about an infinite number of cases "by doing it". That's just about the silliest thing you've said in all these years (and that's saying something). >> You "scam" to declare the wrong answer to be the correct answer is, in >> fact pointless. If you really could detect those computations would not > > If you believe that this computation actually derives a wrong answer > then you would have to point out a specific error and not merely > dogmatically conclude that it must be wrong because you really really > believe that it is wrong. Why should we go over it again? I took your code (this was last year) and explained how what you yourself said about it meant that the answer was wrong. Your reply was that the wrong answer was correct because it was about another computation that "would not halt" rather than about the one that was stopped. It was all very clear. The two computations were distinguished by having different course code (line 15 was commented out in one of them). You are not retracting all that are you? Most of what you have done since has been to hide the two computation as much as possible. You've talked about inner and outer simulations, nested this and that, global a local deciders, supervisors and non-supervisors etc, etc. I have no idea what the latest words are but it remains the same scam: report non halting for a halting computation because it was halted when non-halting behaviour was detected. When you were considering only one case, you can get away with this scam because you can construct a case where you can detect non-halting and this report the wrong answer, declaring it to be the right one. But as soon as you consider your criterion to be general -- what halting really means -- it becomes silly. You might as well just report what the code the detects that an abort is needed. There's not need to report the wrong result. Your criterion implies you have a halt decider. You don't. > Now that you point it out the faulty criteria stuff really is hogwash. Oh! So you are retracting all that. Oh well. What are you now saying? That the correct answer to whether a computation halts or not is exactly what everyone else has been telling you all along? And that you can decide it because you can detect every and all cases where a computation "would have to be aborted"? That is at least honest. > Anyone that believes that a computation that never halts unless > aborted is a halting computation is an idiot. That depends on whether the computation halts or not. The one that wouldn't is not the same as the one that does. > If the only reason that it halts is that it was aborted IT IS A > NON-HALTING COMPUTATION. Could you really be this dumb? Do you really think that using "it" to refer to two different things will carry weight in a mathematical dispute? It was aborted so it is a halting computation. So, I still don't know if you are using your "faulty criteria stuff" or not. That's not a bad strategy. The worst error any Internet crank can make is to be clear. You were clear in Dec 2018 with the Big Lie. And you were clear about the two computations when you showed the code that had to change to get one from the other, but you have been admirably unclear since. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 22:32 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (is Ben's non-halting criteria correct?) |
| Message-ID | <BLednV_JkIDZSNP9nZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #29328 |
On 3/14/2021 10:07 PM, Ben Bacarisse wrote: > olcott <polcott2@gmail.com> writes: > >> On 3/13/2021 8:26 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 3/13/2021 4:00 PM, Malcolm McLean wrote: >>>>> On Saturday, 13 March 2021 at 21:51:59 UTC, olcott wrote: >>> >>>>>> When the halt decider is based on adapting a UTM then nothing can slip >>>>>> past the analysis of the halt decider. >>>>>> >>>>> You can't solve the halting problem this way, e.g. determine the halting >>>>> status of a famous unknown problem. However you can pick up tight loops >>>>> or simple infinite recursion. >>>> >>>> The "do the opposite of whatever the halt decider decides" of the >>>> conventional proofs becomes decidable, they are decided as would not >>>> halt. >>> >>> There are an infinite number of inputs that represent computations that >>> do the same thing as H^. They form an undecidable set. You can spot a >>> few of them, but you can't catch them all. What you call "pathological >>> self-reference" can't be reliably detected. >>> >>> That's in abstract. Your practical approach -- simulate a computation >>> until it halts or until you detect that it won't -- is also impossible. >> >> I prove that it is possisble by doing it. > > You can not prove something about an infinite number of cases "by doing > it". That's just about the silliest thing you've said in all these > years (and that's saying something). > >>> You "scam" to declare the wrong answer to be the correct answer is, in >>> fact pointless. If you really could detect those computations would not >> >> If you believe that this computation actually derives a wrong answer >> then you would have to point out a specific error and not merely >> dogmatically conclude that it must be wrong because you really really >> believe that it is wrong. > > Why should we go over it again? I took your code (this was last year) > and explained how what you yourself said about it meant that the answer > was wrong. Your reply was that the wrong answer was correct because it > was about another computation that "would not halt" rather than about > the one that was stopped. It was all very clear. The two computations > were distinguished by having different course code (line 15 was commented > out in one of them). You are not retracting all that are you? > > Most of what you have done since has been to hide the two computation as > much as possible. You've talked about inner and outer simulations, > nested this and that, global a local deciders, supervisors and > non-supervisors etc, etc. I have no idea what the latest words are but > it remains the same scam: report non halting for a halting computation > because it was halted when non-halting behaviour was detected. > > When you were considering only one case, you can get away with this scam > because you can construct a case where you can detect non-halting and > this report the wrong answer, declaring it to be the right one. But as > soon as you consider your criterion to be general -- what halting really > means -- it becomes silly. You might as well just report what the code > the detects that an abort is needed. There's not need to report the > wrong result. Your criterion implies you have a halt decider. You don't. > >> Now that you point it out the faulty criteria stuff really is hogwash. > > Oh! So you are retracting all that. Oh well. What are you now saying? > That the correct answer to whether a computation halts or not is exactly > what everyone else has been telling you all along? And that you can > decide it because you can detect every and all cases where a computation > "would have to be aborted"? That is at least honest. > >> Anyone that believes that a computation that never halts unless >> aborted is a halting computation is an idiot. > > That depends on whether the computation halts or not. The one that > wouldn't is not the same as the one that does. > >> If the only reason that it halts is that it was aborted IT IS A >> NON-HALTING COMPUTATION. > > Could you really be this dumb? Do you really think that using "it" to > refer to two different things will carry weight in a mathematical > dispute? It was aborted so it is a halting computation. > > So, I still don't know if you are using your "faulty criteria stuff" or > not. That's not a bad strategy. Thanks to you that it no longer needed for the halting problem proof so I am no longer using it. On 3/13/2021 8:26 PM, Ben Bacarisse wrote: > If you really could detect those computations would not > halt if not stopped, you'd have a conventional halt decider > and you should be boasting about that, not hiding your light > under a "redefining the criterion" bushel. People that believe that computations that only halt because their execution was aborted by the halt decider are halting computations can simply be dismissed as incorrect. No computer scientist would make that mistake so everything is down hill from here. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 16:09 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <yMqdnbFmIZyXpdD9nZ2dnUU7-atQAAAA@giganews.com> |
| In reply to | #29234 |
On 3/13/2021 4:00 PM, Malcolm McLean wrote:
> On Saturday, 13 March 2021 at 21:51:59 UTC, olcott wrote:
>> On 3/13/2021 3:38 PM, Malcolm McLean wrote:
>>> On Saturday, 13 March 2021 at 20:49:39 UTC, olcott wrote:
>>>> On 3/13/2021 10:49 AM, wij wrote:
>>>>> On Wednesday, 10 March 2021 at 06:56:40 UTC+8, olcott wrote:
>>>>>> Eliminating pathological self-reference error from the halting problem
>>>>>>
>>>>>> The pathological self reference error occurs whenever a question or
>>>>>> decision problem cannot be correctly answered because both of the yes/no
>>>>>> or true/false answers are contradicted.
>>>>>>
>>>>>> If we ask Jack[1] this question: Will your answer to this question be no?
>>>>>> Neither answer of yes or no is correct because they are both contradicted.
>>>>>>
>>>>>> When an input program is defined to do opposite of whatever the halt
>>>>>> decider decides about its halt status then we have the same pathological
>>>>>> self-reference error as Jack's question.
>>>>>>
>>>>>> If the halt decider Halts() returns a value of true to H_Hat() then
>>>>>> H_Hat() would go into an infinite loop and never halt. If the halt
>>>>>> decider Halts() returns a value of false to H_Hat() then H_Hat would
>>>>>> immediately stop running.
>>>>>>
>>>>>> The simplest way to define a halt decider is to make a program that
>>>>>> simply runs its input to see what it does. In technical terms this would
>>>>>> be a universal Turing machine (UTM) that has been adapted to become a
>>>>>> halt decider. This UTM would simply simulate the execution of its input
>>>>>> until its input halts on its own or the halt decider determines that its
>>>>>> input would never halt on its own and stops simulating it. In order for
>>>>>> the UTM to see what its input does it must keep track of an execution
>>>>>> trace of its input.
>>>>>>
>>>>>> Every (at least partial) halt decider that decides the halting status of
>>>>>> its input on the basis of its examination of the execution trace of its
>>>>>> own simulation of this input would correctly decide the conventional
>>>>>> halting problem counter-examples as not halting.
>>>>>>
>>>>>> The x86utm operating system was created so that halt deciders written in
>>>>>> the C programming language would be computationally equivalent to the
>>>>>> execution of actual Turing machines. These (at least partial) halt
>>>>>> deciders base their halting decision on examining the execution trace of
>>>>>> the x86 machine language of their input. The input is the COFF object
>>>>>> file output of a C compiler and is directly executed by the x86 emulator.
>>>>>>
>>>>>> The halt decider Halts() determines that H_Hat() called it in infinite
>>>>>> recursion, on the basis of the x86 machine language execution trace
>>>>>> shown below, stop simulating its input, and decide not halting on the
>>>>>> basis that its input would not halt.
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>> if (Input_Would_Halt)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>> }
>>>>>>
>>>>>> _H_Hat()
>>>>>> [0000088f](01) 55 push ebp
>>>>>> [00000890](02) 8bec mov ebp,esp
>>>>>> [00000892](01) 51 push ecx
>>>>>> [00000893](03) 8b4508 mov eax,[ebp+08]
>>>>>> [00000896](01) 50 push eax
>>>>>> [00000897](03) 8b4d08 mov ecx,[ebp+08]
>>>>>> [0000089a](01) 51 push ecx
>>>>>> [0000089b](05) e87ffeffff call 0000071f
>>>>>> [000008a0](03) 83c408 add esp,+08
>>>>>> [000008a3](03) 8945fc mov [ebp-04],eax
>>>>>> [000008a6](04) 837dfc00 cmp dword [ebp-04],+00
>>>>>> [000008aa](02) 7402 jz 000008ae
>>>>>> [000008ac](02) ebfe jmp 000008ac
>>>>>> [000008ae](02) 8be5 mov esp,ebp
>>>>>> [000008b0](01) 5d pop ebp
>>>>>> [000008b1](01) c3 ret
>>>>>>
>>>>>> _main()
>>>>>> [000008bf](01) 55 push ebp
>>>>>> [000008c0](02) 8bec mov ebp,esp
>>>>>> [000008c2](01) 51 push ecx
>>>>>> [000008c3](05) 688f080000 push 0000088f
>>>>>> [000008c8](05) 688f080000 push 0000088f
>>>>>> [000008cd](05) e84dfeffff call 0000071f
>>>>>> [000008d2](03) 83c408 add esp,+08
>>>>>> [000008d5](03) 8945fc mov [ebp-04],eax
>>>>>> [000008d8](03) 8b45fc mov eax,[ebp-04]
>>>>>> [000008db](01) 50 push eax
>>>>>> [000008dc](05) 680b030000 push 0000030b
>>>>>> [000008e1](05) e869faffff call 0000034f
>>>>>> [000008e6](03) 83c408 add esp,+08
>>>>>> [000008e9](02) 33c0 xor eax,eax
>>>>>> [000008eb](02) 8be5 mov esp,ebp
>>>>>> [000008ed](01) 5d pop ebp
>>>>>> [000008ee](01) c3 ret
>>>>>>
>>>>>> Columns
>>>>>> (1) Execution trace sequence number
>>>>>> (2) Machine address of instruction
>>>>>> (3) Machine address of top of stack
>>>>>> (4) Value of top of stack after instruction executed
>>>>>> (5) Number of bytes of machine code
>>>>>> (6) Machine language bytes
>>>>>> (7) Assembly language text
>>>>>>
>>>>>> (01)[000008bf][00011208][00000000](01) 55 push ebp
>>>>>> (02)[000008c0][00011208][00000000](02) 8bec mov ebp,esp
>>>>>> (03)[000008c2][00011204][00000000](01) 51 push ecx
>>>>>> (04)[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
>>>>>> (05)[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
>>>>>> (06)[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
>>>>>>
>>>>>> (07)[0000088f][00031288][0003128c](01) 55 push ebp
>>>>>> (08)[00000890][00031288][0003128c](02) 8bec mov ebp,esp
>>>>>> (09)[00000892][00031284][00021258](01) 51 push ecx
>>>>>> (10)[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
>>>>>> (11)[00000896][00031280][0000088f](01) 50 push eax
>>>>>> (12)[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>>>> (13)[0000089a][0003127c][0000088f](01) 51 push ecx
>>>>>> (14)[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
>>>>>>
>>>>>> Line(11) Push second parameter value: 0000088f to Halts()
>>>>>> Line(13) Push first parameter value: 0000088f to Halts()
>>>>>> Line(14) H_Halt() calls Halts(0000088f, 0000088f)
>>>>>>
>>>>>> (15)[0000088f][00042430][00042434](01) 55 push ebp
>>>>>> (16)[00000890][00042430][00042434](02) 8bec mov ebp,esp
>>>>>> (17)[00000892][0004242c][00032400](01) 51 push ecx
>>>>>> (18)[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
>>>>>> (19)[00000896][00042428][0000088f](01) 50 push eax
>>>>>> (20)[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>>>> (21)[0000089a][00042424][0000088f](01) 51 push ecx
>>>>>> (22)[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
>>>>>>
>>>>>> Line(19) Push second parameter value: 0000088f to Halts()
>>>>>> Line(21) Push first parameter value: 0000088f to Halts()
>>>>>> Line(22) H_Halt() calls Halts(0000088f, 0000088f)
>>>>>>
>>>>>> Infinite Recursion Detected Simulation Stopped on the basis that H_Hat()
>>>>>> calls Halts() with the same data a second time in sequence from the same
>>>>>> machine address.
>>>>>>
>>>>>> (23)[000008d2][00011204][00000000](03) 83c408 add esp,+08
>>>>>> (24)[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
>>>>>> (25)[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
>>>>>> (26)[000008db][00011200][00000000](01) 50 push eax
>>>>>> (27)[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
>>>>>> (28)[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
>>>>>> Input_Would_Halt = 0
>>>>>>
>>>>>> (29)[000008e6][00011204][00000000](03) 83c408 add esp,+08
>>>>>> (30)[000008e9][00011204][00000000](02) 33c0 xor eax,eax
>>>>>> (31)[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
>>>>>> (32)[000008ed][0001120c][00010000](01) 5d pop ebp
>>>>>> (33)[000008ee][00011210][00000080](01) c3 ret
>>>>>> Number_of_User_Instructions(33)
>>>>>>
>>>>>> Copyright 2021 PL Olcott
>>>>>>
>>>>>> [1] sci.logic --- Daryl McCullough --- Jun 25, 2004, 6:30:39 PM
>>>>>> [The Psychology of Self-Reference]
>>>>>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ
>>>>>>
>>>>>>
>>>>>>
>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>>>> --
>>>>>> Copyright 2021 Pete Olcott
>>>>>>
>>>>>> "Great spirits have always encountered violent opposition from mediocre
>>>>>> minds." Einstein
>>>>>
>>>>> There is no way to remove "the pathological self-reference", which you
>>>>> refer to as an error is also incorrect.
>>>> When the halting problem criteria is:
>>>> Does the input program halt on its input?
>>>> It is possible to define an input that does the opposite of whatever the
>>>> halt decider decides.
>>>>
>>>> When the halting problem criteria is:
>>>> Would the input program halt if the halt decider never stopped
>>>> simulating it?
>>>> Then any input that does the opposite of whatever the halt decider
>>>> decides becomes decidable.
>>>>
>>> OK, so we call H_Hat(H_Hat). It calls H, which detects what would be infinite
>>> recursion (because of the way H is written), and returns "no", this won't halt
>>> unless I halt it. So H_Hat doesn't go into the infinite loop, and halts.
>>>
>>> Now we call H(H_Hat, H_Hat). Same thing happens. H simulates H_Hat, causing
>>> an endless recursion, which H eventually terminates. So H returns "no": , this
>>> won't halt unless I halt it".
>>>
>>> But H has got it wrong. You've got to somehow flag that the H-directed halt in
>>> H_Hat doesn't count.
>>>
>>>
>> No not true. The global halt decider is called on main() so both
>> instances are correctly terminated because of what would otherwise be
>> infinite recursion.
>>
> RIght, so the supervisor is placed outside of H, and it is this which decides the
> halting / would not halt unless halted status of the program.
When the Halt decider is based on a UTM then the halt decider is the
supervisor of every computation.
>>
>> When the halt decider is based on adapting a UTM then nothing can slip
>> past the analysis of the halt decider.
>>
> You can't solve the halting problem this way, e.g. determine the halting
> status of a famous unknown problem. However you can pick up tight loops
> or simple infinite recursion.
>
The "do the opposite of whatever the halt decider decides" of the
conventional proofs becomes decidable, they are decided as would not halt.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 17:02 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <HDa3I.24942$cP6.8504@fx34.iad> |
| In reply to | #29231 |
On 3/13/21 4:51 PM, olcott wrote:
> On 3/13/2021 3:38 PM, Malcolm McLean wrote:
>> On Saturday, 13 March 2021 at 20:49:39 UTC, olcott wrote:
>>> On 3/13/2021 10:49 AM, wij wrote:
>>>> On Wednesday, 10 March 2021 at 06:56:40 UTC+8, olcott wrote:
>>>>> Eliminating pathological self-reference error from the halting problem
>>>>>
>>>>> The pathological self reference error occurs whenever a question or
>>>>> decision problem cannot be correctly answered because both of the
>>>>> yes/no
>>>>> or true/false answers are contradicted.
>>>>>
>>>>> If we ask Jack[1] this question: Will your answer to this question
>>>>> be no?
>>>>> Neither answer of yes or no is correct because they are both
>>>>> contradicted.
>>>>>
>>>>> When an input program is defined to do opposite of whatever the halt
>>>>> decider decides about its halt status then we have the same
>>>>> pathological
>>>>> self-reference error as Jack's question.
>>>>>
>>>>> If the halt decider Halts() returns a value of true to H_Hat() then
>>>>> H_Hat() would go into an infinite loop and never halt. If the halt
>>>>> decider Halts() returns a value of false to H_Hat() then H_Hat would
>>>>> immediately stop running.
>>>>>
>>>>> The simplest way to define a halt decider is to make a program that
>>>>> simply runs its input to see what it does. In technical terms this
>>>>> would
>>>>> be a universal Turing machine (UTM) that has been adapted to become a
>>>>> halt decider. This UTM would simply simulate the execution of its
>>>>> input
>>>>> until its input halts on its own or the halt decider determines
>>>>> that its
>>>>> input would never halt on its own and stops simulating it. In order
>>>>> for
>>>>> the UTM to see what its input does it must keep track of an execution
>>>>> trace of its input.
>>>>>
>>>>> Every (at least partial) halt decider that decides the halting
>>>>> status of
>>>>> its input on the basis of its examination of the execution trace of
>>>>> its
>>>>> own simulation of this input would correctly decide the conventional
>>>>> halting problem counter-examples as not halting.
>>>>>
>>>>> The x86utm operating system was created so that halt deciders
>>>>> written in
>>>>> the C programming language would be computationally equivalent to the
>>>>> execution of actual Turing machines. These (at least partial) halt
>>>>> deciders base their halting decision on examining the execution
>>>>> trace of
>>>>> the x86 machine language of their input. The input is the COFF object
>>>>> file output of a C compiler and is directly executed by the x86
>>>>> emulator.
>>>>>
>>>>> The halt decider Halts() determines that H_Hat() called it in infinite
>>>>> recursion, on the basis of the x86 machine language execution trace
>>>>> shown below, stop simulating its input, and decide not halting on the
>>>>> basis that its input would not halt.
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>> if (Input_Would_Halt)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>>> _H_Hat()
>>>>> [0000088f](01) 55 push ebp
>>>>> [00000890](02) 8bec mov ebp,esp
>>>>> [00000892](01) 51 push ecx
>>>>> [00000893](03) 8b4508 mov eax,[ebp+08]
>>>>> [00000896](01) 50 push eax
>>>>> [00000897](03) 8b4d08 mov ecx,[ebp+08]
>>>>> [0000089a](01) 51 push ecx
>>>>> [0000089b](05) e87ffeffff call 0000071f
>>>>> [000008a0](03) 83c408 add esp,+08
>>>>> [000008a3](03) 8945fc mov [ebp-04],eax
>>>>> [000008a6](04) 837dfc00 cmp dword [ebp-04],+00
>>>>> [000008aa](02) 7402 jz 000008ae
>>>>> [000008ac](02) ebfe jmp 000008ac
>>>>> [000008ae](02) 8be5 mov esp,ebp
>>>>> [000008b0](01) 5d pop ebp
>>>>> [000008b1](01) c3 ret
>>>>>
>>>>> _main()
>>>>> [000008bf](01) 55 push ebp
>>>>> [000008c0](02) 8bec mov ebp,esp
>>>>> [000008c2](01) 51 push ecx
>>>>> [000008c3](05) 688f080000 push 0000088f
>>>>> [000008c8](05) 688f080000 push 0000088f
>>>>> [000008cd](05) e84dfeffff call 0000071f
>>>>> [000008d2](03) 83c408 add esp,+08
>>>>> [000008d5](03) 8945fc mov [ebp-04],eax
>>>>> [000008d8](03) 8b45fc mov eax,[ebp-04]
>>>>> [000008db](01) 50 push eax
>>>>> [000008dc](05) 680b030000 push 0000030b
>>>>> [000008e1](05) e869faffff call 0000034f
>>>>> [000008e6](03) 83c408 add esp,+08
>>>>> [000008e9](02) 33c0 xor eax,eax
>>>>> [000008eb](02) 8be5 mov esp,ebp
>>>>> [000008ed](01) 5d pop ebp
>>>>> [000008ee](01) c3 ret
>>>>>
>>>>> Columns
>>>>> (1) Execution trace sequence number
>>>>> (2) Machine address of instruction
>>>>> (3) Machine address of top of stack
>>>>> (4) Value of top of stack after instruction executed
>>>>> (5) Number of bytes of machine code
>>>>> (6) Machine language bytes
>>>>> (7) Assembly language text
>>>>>
>>>>> (01)[000008bf][00011208][00000000](01) 55 push ebp
>>>>> (02)[000008c0][00011208][00000000](02) 8bec mov ebp,esp
>>>>> (03)[000008c2][00011204][00000000](01) 51 push ecx
>>>>> (04)[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
>>>>> (05)[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
>>>>> (06)[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
>>>>>
>>>>> (07)[0000088f][00031288][0003128c](01) 55 push ebp
>>>>> (08)[00000890][00031288][0003128c](02) 8bec mov ebp,esp
>>>>> (09)[00000892][00031284][00021258](01) 51 push ecx
>>>>> (10)[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
>>>>> (11)[00000896][00031280][0000088f](01) 50 push eax
>>>>> (12)[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>>> (13)[0000089a][0003127c][0000088f](01) 51 push ecx
>>>>> (14)[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
>>>>>
>>>>> Line(11) Push second parameter value: 0000088f to Halts()
>>>>> Line(13) Push first parameter value: 0000088f to Halts()
>>>>> Line(14) H_Halt() calls Halts(0000088f, 0000088f)
>>>>>
>>>>> (15)[0000088f][00042430][00042434](01) 55 push ebp
>>>>> (16)[00000890][00042430][00042434](02) 8bec mov ebp,esp
>>>>> (17)[00000892][0004242c][00032400](01) 51 push ecx
>>>>> (18)[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
>>>>> (19)[00000896][00042428][0000088f](01) 50 push eax
>>>>> (20)[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>>> (21)[0000089a][00042424][0000088f](01) 51 push ecx
>>>>> (22)[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
>>>>>
>>>>> Line(19) Push second parameter value: 0000088f to Halts()
>>>>> Line(21) Push first parameter value: 0000088f to Halts()
>>>>> Line(22) H_Halt() calls Halts(0000088f, 0000088f)
>>>>>
>>>>> Infinite Recursion Detected Simulation Stopped on the basis that
>>>>> H_Hat()
>>>>> calls Halts() with the same data a second time in sequence from the
>>>>> same
>>>>> machine address.
>>>>>
>>>>> (23)[000008d2][00011204][00000000](03) 83c408 add esp,+08
>>>>> (24)[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
>>>>> (25)[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
>>>>> (26)[000008db][00011200][00000000](01) 50 push eax
>>>>> (27)[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
>>>>> (28)[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
>>>>> Input_Would_Halt = 0
>>>>>
>>>>> (29)[000008e6][00011204][00000000](03) 83c408 add esp,+08
>>>>> (30)[000008e9][00011204][00000000](02) 33c0 xor eax,eax
>>>>> (31)[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
>>>>> (32)[000008ed][0001120c][00010000](01) 5d pop ebp
>>>>> (33)[000008ee][00011210][00000080](01) c3 ret
>>>>> Number_of_User_Instructions(33)
>>>>>
>>>>> Copyright 2021 PL Olcott
>>>>>
>>>>> [1] sci.logic --- Daryl McCullough --- Jun 25, 2004, 6:30:39 PM
>>>>> [The Psychology of Self-Reference]
>>>>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ
>>>>>
>>>>>
>>>>>
>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>>>
>>>>> --
>>>>> Copyright 2021 Pete Olcott
>>>>>
>>>>> "Great spirits have always encountered violent opposition from
>>>>> mediocre
>>>>> minds." Einstein
>>>>
>>>> There is no way to remove "the pathological self-reference", which you
>>>> refer to as an error is also incorrect.
>>> When the halting problem criteria is:
>>> Does the input program halt on its input?
>>> It is possible to define an input that does the opposite of whatever the
>>> halt decider decides.
>>>
>>> When the halting problem criteria is:
>>> Would the input program halt if the halt decider never stopped
>>> simulating it?
>>> Then any input that does the opposite of whatever the halt decider
>>> decides becomes decidable.
>>>
>> OK, so we call H_Hat(H_Hat). It calls H, which detects what would be
>> infinite
>> recursion (because of the way H is written), and returns "no", this
>> won't halt
>> unless I halt it. So H_Hat doesn't go into the infinite loop, and halts.
>>
>> Now we call H(H_Hat, H_Hat). Same thing happens. H simulates H_Hat,
>> causing
>> an endless recursion, which H eventually terminates. So H returns
>> "no": , this
>> won't halt unless I halt it".
>>
>> But H has got it wrong. You've got to somehow flag that the H-directed
>> halt in
>> H_Hat doesn't count.
>>
>>
>
> No not true. The global halt decider is called on main() so both
> instances are correctly terminated because of what would otherwise be
> infinite recursion.
>
> When the halt decider is based on adapting a UTM then nothing can slip
> past the analysis of the halt decider.
>
Which means that Halts is no longer an equivalent of a Turing Machine,
but that Turing Machine equivalent includes all the way to around main,
thus the proper way to build H_Hat is with a call to exec, which I
suspect you simulator can't handle (or at least won't handle right).
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-13 16:05 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <s2jgfi$lig$1@dont-email.me> |
| In reply to | #29231 |
On 2021-03-13 14:51, olcott wrote: > No not true. The global halt decider is called on main() so both > instances are correctly terminated because of what would otherwise be > infinite recursion. If your global halt decider is called on main(), then it isn't even answering the question for the correct input. Halts(main) != Halts(H_Hat, H_Hat) > When the halt decider is based on adapting a UTM then nothing can slip > past the analysis of the halt decider. You need to learn what a UTM is before making such nonsensical claims. You don't have, and never have had, a UTM. Nor have you had anything which is 'computationally equivalent' to a UTM. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 17:33 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <Mc-dnYnmjqMw1tD9nZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #29238 |
On 3/13/2021 5:05 PM, André G. Isaak wrote:
> On 2021-03-13 14:51, olcott wrote:
>
>> No not true. The global halt decider is called on main() so both
>> instances are correctly terminated because of what would otherwise be
>> infinite recursion.
>
> If your global halt decider is called on main(), then it isn't even
> answering the question for the correct input.
>
> Halts(main) != Halts(H_Hat, H_Hat)
>
>> When the halt decider is based on adapting a UTM then nothing can slip
>> past the analysis of the halt decider.
>
> You need to learn what a UTM is before making such nonsensical claims.
> You don't have, and never have had, a UTM. Nor have you had anything
> which is 'computationally equivalent' to a UTM.
>
> André
>
If the halt decider is based on a UTM such the the only computations are
simulations by this halt decider / UTM then no computations can sneak
past the halt decider's analysis.
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Calls the x86utm operating system Halts() and
Executes to completion.
int main()
{
HERE: goto HERE;
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Is terminated by the x86utm operating system Halts()
int main()
{
H_Hat((u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Is terminated by the x86utm operating system Halts()
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 21:09 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <Ife3I.151828$rU.144971@fx39.iad> |
| In reply to | #29239 |
On 3/13/21 6:33 PM, olcott wrote: > > If the halt decider is based on a UTM such the the only computations are > simulations by this halt decider / UTM then no computations can sneak > past the halt decider's analysis. THe issue is that when we run H^(H^) itself, there is NO computation running 'outside' that can affect it. Yes, when we do the computaton H(H^, H^), then H has full control of what happens in the analysis of that H^, but ZERO control of what happens to the answer it gives.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-14 02:10 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <87wnuaa3j5.fsf@bsb.me.uk> |
| In reply to | #29225 |
olcott <NoOne@NoWhere.com> writes: > When the halting problem criteria is: > Does the input program halt on its input? That is the halting problem. There is no other meaning for halting (in this context). Anything else is the PO xxx problem (you can, within reason, choose what xxx is). > When the halting problem criteria is: > Would the input program halt if the halt decider never stopped simulating it? > > Then any input that does the opposite of whatever the halt decider > decides becomes decidable. All instances of all decision problems, including yours, are decidable. They all have correct yes/no answers. Interestingly, the PO xxx problem is also undecidable, just like the halting problem is. You've avoided addressing this problem so far, but you can't write that paper without doing so. > The halt decider stops simulating this input on the basis that it is > calling the halt decider in what would otherwise be infinite recursion > then the halt decider reports that the input would not halt. That's not a general solution to the PO xxx problem. I could explain that in various ways, but I don't think any of them would get past your blinkers. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott2@gmail.com> |
|---|---|
| Date | 2021-03-13 20:30 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <s2jsgb$jae$1@dont-email.me> |
| In reply to | #29249 |
On 3/13/2021 8:10 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> When the halting problem criteria is:
>> Does the input program halt on its input?
>
> That is the halting problem. There is no other meaning for halting (in
> this context). Anything else is the PO xxx problem (you can, within
> reason, choose what xxx is).
>
>> When the halting problem criteria is:
>> Would the input program halt if the halt decider never stopped simulating it?
>>
>> Then any input that does the opposite of whatever the halt decider
>> decides becomes decidable.
>
> All instances of all decision problems, including yours, are decidable.
Inputs that are undecidable because they are defined to contradict every
decision that the decider makes are erroneous in the same way that the
liar paradox is erroneous. The reason that it does not resolve to a
truth value is that it is incorrect. You might as well ask whether or
not mud on your shirt is true or false.
> They all have correct yes/no answers. Interestingly, the PO xxx problem
> is also undecidable, just like the halting problem is. You've avoided
> addressing this problem so far, but you can't write that paper without
> doing so.
I have fully addressed every objection.
If the halt decider is based on a UTM such that the only computations
are simulations by this halt decider / UTM then no computations can
sneak past the halt decider's analysis.
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Calls the x86utm operating system Halts() and
Executes to completion.
int main()
{
HERE: goto HERE;
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Is terminated by the x86utm operating system Halts()
int main()
{
H_Hat((u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Is terminated by the x86utm operating system Halts()
>> The halt decider stops simulating this input on the basis that it is
>> calling the halt decider in what would otherwise be infinite recursion
>> then the halt decider reports that the input would not halt.
>
> That's not a general solution to the PO xxx problem. I could explain
> that in various ways, but I don't think any of them would get past your
> blinkers.
>
--
Copyright 2021 Pete Olcott "Great spirits have always encountered
violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 22:06 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <U4f3I.15245$ts5.14554@fx46.iad> |
| In reply to | #29252 |
On 3/13/21 9:30 PM, olcott wrote: > Inputs that are undecidable because they are defined to contradict every > decision that the decider makes are erroneous in the same way that the > liar paradox is erroneous. The reason that it does not resolve to a > truth value is that it is incorrect. You might as well ask whether or > not mud on your shirt is true or false. Inputs do not have a 'truth value' Yes, the question "What answer does H need to give to correctly answer the Halting Problem for H^"? is like the Liar's paradox, but that isn't the question fo the Halting Problem. The Halting Problem asks will the Computation P(I) halt or not, given a full definition of P and I. Since P is H^m and is based on H, before that question even comes into existence. Since we need to have a defined computation of H, we have the answer that H(H^, H^) will give, so we don't need to ask that question, instead we ask what does H compute given H^, H^, and then we can compare it to H^(H^) and see if it is corrent. The Paradox happens when you try to work out how to design an H that is always correct, and we hit that paradox because there is NO H that is always correct. Which is what the proofs say.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-15 02:37 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <87lfap87m1.fsf@bsb.me.uk> |
| In reply to | #29252 |
olcott <polcott2@gmail.com> writes: > On 3/13/2021 8:10 PM, Ben Bacarisse wrote: >> All instances of all decision problems, including yours, are decidable. > > Inputs that are undecidable... There are none. Stop saying that there are. Learn what these words mean. If the jargon words that have been agreed upon don't mean what you want, you have to find other ways to say it. And if you can't find other words to say it, then maybe you don't know what you are trying to say. -- Ben.
[toc] | [prev] | [standalone]
Page 23 of 23 — ← Prev page 1 … 21 22 [23]
Back to top | Article view | comp.theory
csiph-web