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 | 20 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 20 of 23 — ← Prev page 1 … 18 19 [20] 21 22 23 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-14 16:08 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <w3u3I.32263$2y.19046@fx05.iad> |
| In reply to | #29258 |
On 3/14/21 10:55 AM, olcott wrote: > On 3/14/2021 5:29 AM, Malcolm McLean wrote: >> On Sunday, 14 March 2021 at 02:07:06 UTC, Richard Damon wrote: >>> On 3/13/21 5:05 PM, olcott wrote: >>>>> >>>> >>>> When the Halt decider is based on a UTM then the halt decider is the >>>> supervisor of every computation. >>> Nonsense. In a Turing Machine Model of computation there is no such >>> things as a 'supervisor'. >>> >> You can write a near-UTM, which steps through the test machine, and has >> some loop detction logic to detect if it gets stuck.Then it breaks out >> of the loop and reports "non-halting". That's a reasonable approach to >> writing a decider which might even be practically useful, as most >> programming >> errors which cause hangs put the program into a tight loop. >> You can scale it up to detect more complex looping behaviour. But you >> will >> soon get into a mess of complexity. It can't detect all non-halting >> machines. >> >> However PO has added another step, which is that the supervisor runs >> "main". >>> >>> THe UTM will be a self-contained computation, which apparently you plan >>> to modify to make it a Halt Decider. That Halt Decider now becomes a >>> fully self-contained computation, which gets modified when H^ is built. >>> Nothing in H gets to be 'outside' H^, H^ is based on the TOTAL >>> computation of H. >>> >> That's how Linz specified the problem. That's not how PO has laid out his >> system. In order to get round Linz's proof you have to change Linz's >> system >> somehow, as PO acknowledges. The solution he has chosen, based on >> what he has said recently, is to wrap main() in a supervisor. >> > > We are not wrapping main() in a supervisor exactly. > More accurately the x86utm operating system is the master UTM that > applies its system level halt decider to every user computation. > > The program under test:H_Hat() and the tester:Halts() are distinctly > different computations. It is the conflation of these two that creates > the pathological self-reference error. > > The teacher does not share the students grade. > When the halt decider determines that the simulation of its input must > be aborted to prevent its infinite execution the input <is> a > non-halting computation. As Ben pointed out its ridiculous to construe > that a computation is a halting computation if the only reason that it > halts is that its exection was aborted. > That means you have created a computational environment with is NOT Turing compatible, and likely not Turing Complete. Thus ALL arguments that you have Turing Equivalents are incorrect. If you system can NOT create the equivalent of every Turing Machine, then you can no longer work with the assumption of Turing Equivalents. Since, by definition, you are aborting any computation that you decide is infinite, you can not properly create the equivalent of those machines.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 15:13 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <Qqednd6w0N0Z89P9nZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #29283 |
On 3/14/2021 3:08 PM, Richard Damon wrote: > On 3/14/21 10:55 AM, olcott wrote: >> On 3/14/2021 5:29 AM, Malcolm McLean wrote: >>> On Sunday, 14 March 2021 at 02:07:06 UTC, Richard Damon wrote: >>>> On 3/13/21 5:05 PM, olcott wrote: >>>>>> >>>>> >>>>> When the Halt decider is based on a UTM then the halt decider is the >>>>> supervisor of every computation. >>>> Nonsense. In a Turing Machine Model of computation there is no such >>>> things as a 'supervisor'. >>>> >>> You can write a near-UTM, which steps through the test machine, and has >>> some loop detction logic to detect if it gets stuck.Then it breaks out >>> of the loop and reports "non-halting". That's a reasonable approach to >>> writing a decider which might even be practically useful, as most >>> programming >>> errors which cause hangs put the program into a tight loop. >>> You can scale it up to detect more complex looping behaviour. But you >>> will >>> soon get into a mess of complexity. It can't detect all non-halting >>> machines. >>> >>> However PO has added another step, which is that the supervisor runs >>> "main". >>>> >>>> THe UTM will be a self-contained computation, which apparently you plan >>>> to modify to make it a Halt Decider. That Halt Decider now becomes a >>>> fully self-contained computation, which gets modified when H^ is built. >>>> Nothing in H gets to be 'outside' H^, H^ is based on the TOTAL >>>> computation of H. >>>> >>> That's how Linz specified the problem. That's not how PO has laid out his >>> system. In order to get round Linz's proof you have to change Linz's >>> system >>> somehow, as PO acknowledges. The solution he has chosen, based on >>> what he has said recently, is to wrap main() in a supervisor. >>> >> >> We are not wrapping main() in a supervisor exactly. >> More accurately the x86utm operating system is the master UTM that >> applies its system level halt decider to every user computation. >> >> The program under test:H_Hat() and the tester:Halts() are distinctly >> different computations. It is the conflation of these two that creates >> the pathological self-reference error. >> >> The teacher does not share the students grade. >> When the halt decider determines that the simulation of its input must >> be aborted to prevent its infinite execution the input <is> a >> non-halting computation. As Ben pointed out its ridiculous to construe >> that a computation is a halting computation if the only reason that it >> halts is that its exection was aborted. >> > > That means you have created a computational environment with is NOT > Turing compatible, and likely not Turing Complete. > > Thus ALL arguments that you have Turing Equivalents are incorrect. > > If you system can NOT create the equivalent of every Turing Machine, > then you can no longer work with the assumption of Turing Equivalents. > > Since, by definition, you are aborting any computation that you decide > is infinite, you can not properly create the equivalent of those machines. > Every x86utm computation that has all the memory that it needs <is> equivalent to a Turing machine computation. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-14 14:44 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2lsii$csr$1@dont-email.me> |
| In reply to | #29284 |
On 2021-03-14 14:13, olcott wrote: > Every x86utm computation that has all the memory that it needs <is> > equivalent to a Turing machine computation. No. There's all sorts of things that an x86 can do that a Turing Machine cannot. An x86, for example, can respond to interrupts, which a Turing Machine cannot. There's no equivalent to the INT1 interrupt which the step-trace mode you make use of depends on when talking about actual Turing Machines. So why not simply stop talking about UTMs and Turing Machines. You don't have one. You aren't framing your 'solution' in terms of them. And you haven't demonstrated the equivalence which you keep baselessly asserting. 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-14 16:02 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <z_KdnUZFzO9u5NP9nZ2dnUU7-SfNnZ2d@giganews.com> |
| In reply to | #29285 |
On 3/14/2021 3:44 PM, André G. Isaak wrote: > On 2021-03-14 14:13, olcott wrote: > >> Every x86utm computation that has all the memory that it needs <is> >> equivalent to a Turing machine computation. > > No. There's all sorts of things that an x86 can do that a Turing Machine > cannot. every effective computation can be carried out by a Turing machine. https://plato.stanford.edu/entries/church-turing/ -- 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-14 16:06 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <z_KdnUFFzO9O59P9nZ2dnUU7-SednZ2d@giganews.com> |
| In reply to | #29286 |
On 3/14/2021 4:02 PM, olcott wrote: > On 3/14/2021 3:44 PM, André G. Isaak wrote: >> On 2021-03-14 14:13, olcott wrote: >> >>> Every x86utm computation that has all the memory that it needs <is> >>> equivalent to a Turing machine computation. >> >> No. There's all sorts of things that an x86 can do that a Turing >> Machine cannot. > > every effective computation can be carried out by a Turing machine. > https://plato.stanford.edu/entries/church-turing/ > Church-Turing Thesis The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a Turing machine. https://mathworld.wolfram.com/Church-TuringThesis.html -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2021-03-14 23:58 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <8MCdneYl1pOvPtP9nZ2dnUU78bGdnZ2d@brightview.co.uk> |
| In reply to | #29287 |
On 14/03/2021 21:06, olcott wrote: > On 3/14/2021 4:02 PM, olcott wrote: >> On 3/14/2021 3:44 PM, André G. Isaak wrote: >>> On 2021-03-14 14:13, olcott wrote: >>> >>>> Every x86utm computation that has all the memory that it needs <is> >>>> equivalent to a Turing machine computation. >>> >>> No. There's all sorts of things that an x86 can do that a Turing >>> Machine cannot. >> >> every effective computation can be carried out by a Turing machine. >> https://plato.stanford.edu/entries/church-turing/ >> > > > Church-Turing Thesis > The Church-Turing thesis (formerly commonly known simply as Church's > thesis) says that any real-world computation can be translated into an > equivalent computation involving a Turing machine. > > https://mathworld.wolfram.com/Church-TuringThesis.html > This is just one of your "magical incantations" that you use with no real understanding, to try to ward off objections to your arguments without having to actually reason about them. Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 19:27 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <NuCdnfu3JupBNNP9nZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #29305 |
On 3/14/2021 6:58 PM, Mike Terry wrote: > On 14/03/2021 21:06, olcott wrote: >> On 3/14/2021 4:02 PM, olcott wrote: >>> On 3/14/2021 3:44 PM, André G. Isaak wrote: >>>> On 2021-03-14 14:13, olcott wrote: >>>> >>>>> Every x86utm computation that has all the memory that it needs <is> >>>>> equivalent to a Turing machine computation. >>>> >>>> No. There's all sorts of things that an x86 can do that a Turing >>>> Machine cannot. >>> >>> every effective computation can be carried out by a Turing machine. >>> https://plato.stanford.edu/entries/church-turing/ >>> >> >> >> Church-Turing Thesis >> The Church-Turing thesis (formerly commonly known simply as Church's >> thesis) says that any real-world computation can be translated into an >> equivalent computation involving a Turing machine. >> >> https://mathworld.wolfram.com/Church-TuringThesis.html >> > > This is just one of your "magical incantations" that you use with no > real understanding, to try to ward off objections to your arguments > without having to actually reason about them. > > > Mike. > These are my own (self-evidently correct) words: Any computation based on finite string transformation rules is Turing computable. The fact that the case where a computation examines a finite string to determine whether or not that finite string represents a computation that would halt on its input <is> a finite string transformation computation. The input string is transformed into "1" or "0". -- 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:15 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <874khd85uy.fsf@bsb.me.uk> |
| In reply to | #29309 |
olcott <NoOne@NoWhere.com> writes: > These are my own (self-evidently correct) words: > Any computation based on finite string transformation rules is Turing > computable. Not self-evidently correct. You even give a counter example: > The fact that the case where a computation examines a finite string to > determine whether or not that finite string represents a computation > that would halt on its input <is> a finite string transformation > computation. The input string is transformed into "1" or "0". Well done. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 22:24 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <lrOdncPOD8bxTtP9nZ2dnUU7-e-dnZ2d@giganews.com> |
| In reply to | #29330 |
On 3/14/2021 10:15 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> These are my own (self-evidently correct) words: >> Any computation based on finite string transformation rules is Turing >> computable. > > Not self-evidently correct. You even give a counter example: > >> The fact that the case where a computation examines a finite string to >> determine whether or not that finite string represents a computation >> that would halt on its input <is> a finite string transformation >> computation. The input string is transformed into "1" or "0". > > Well done. > The finite string input is transformed into the finite string "1" or the finite string "0". -- 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:39 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <87sg4x6q6b.fsf@bsb.me.uk> |
| In reply to | #29333 |
olcott <NoOne@NoWhere.com> writes: > On 3/14/2021 10:15 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> These are my own (self-evidently correct) words: >>> Any computation based on finite string transformation rules is Turing >>> computable. >> >> Not self-evidently correct. You even give a counter example: >> >>> The fact that the case where a computation examines a finite string to >>> determine whether or not that finite string represents a computation >>> that would halt on its input <is> a finite string transformation >>> computation. The input string is transformed into "1" or "0". >> >> Well done. > > The finite string input is transformed into the finite string "1" or > the finite string "0". Yes. Did you think I did not know you meant exactly that? Can you not see that you have provided a counter-example to your own claim? Here's another example that is not Turing computable. Transform the finite string describing a context-free grammar into the string "0" if the grammar is ambiguous and into "0" otherwise. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 22:43 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <1Judnbc0b7V1StP9nZ2dnUU7-d-dnZ2d@giganews.com> |
| In reply to | #29338 |
On 3/14/2021 10:39 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 3/14/2021 10:15 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> These are my own (self-evidently correct) words: >>>> Any computation based on finite string transformation rules is Turing >>>> computable. >>> >>> Not self-evidently correct. You even give a counter example: >>> >>>> The fact that the case where a computation examines a finite string to >>>> determine whether or not that finite string represents a computation >>>> that would halt on its input <is> a finite string transformation >>>> computation. The input string is transformed into "1" or "0". >>> >>> Well done. >> >> The finite string input is transformed into the finite string "1" or >> the finite string "0". > > Yes. Did you think I did not know you meant exactly that? Can you not > see that you have provided a counter-example to your own claim? > > Here's another example that is not Turing computable. Transform the > finite string describing a context-free grammar into the string "0" if > the grammar is ambiguous and into "0" otherwise. > I say that computations are X if they have Y. I prove that they have Y therefore they are X. Try and use weasel words on that. -- 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-15 08:30 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <mrI3I.39735$mG3.30290@fx38.iad> |
| In reply to | #29340 |
On 3/14/21 11:43 PM, olcott wrote: > On 3/14/2021 10:39 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 3/14/2021 10:15 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> These are my own (self-evidently correct) words: >>>>> Any computation based on finite string transformation rules is Turing >>>>> computable. >>>> >>>> Not self-evidently correct. You even give a counter example: >>>> >>>>> The fact that the case where a computation examines a finite string to >>>>> determine whether or not that finite string represents a computation >>>>> that would halt on its input <is> a finite string transformation >>>>> computation. The input string is transformed into "1" or "0". >>>> >>>> Well done. >>> >>> The finite string input is transformed into the finite string "1" or >>> the finite string "0". >> >> Yes. Did you think I did not know you meant exactly that? Can you not >> see that you have provided a counter-example to your own claim? >> >> Here's another example that is not Turing computable. Transform the >> finite string describing a context-free grammar into the string "0" if >> the grammar is ambiguous and into "0" otherwise. >> > > I say that computations are X if they have Y. > I prove that they have Y therefore they are X. > Try and use weasel words on that. > But that presumes that testing that "have Y" is a finitely computable proposition. Not all propositions are finite computable. Using True is Provable doesn't work here as that system goes inconsistent in situations like this, that is where a number of the famous paradoxes come about, the use of True is Provable beyond its operational domain.
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2021-03-15 03:27 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2mk6u$i8q$1@gioia.aioe.org> |
| In reply to | #29330 |
Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > olcott <NoOne@NoWhere.com> writes: >> These are my own (self-evidently correct) words: >> Any computation based on finite string transformation rules is Turing >> computable. > Not self-evidently correct. You even give a counter example: >> The fact that the case where a computation examines a finite string to >> determine whether or not that finite string represents a computation >> that would halt on its input <is> a finite string transformation >> computation. The input string is transformed into "1" or "0". > Well done. How is it some people have an apparent infinite capacity to listen to a stream of nonsense without choking on vomit?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-15 12:51 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2odrr$2tn$2@gioia.aioe.org> |
| In reply to | #29334 |
On 3/14/2021 8:27 PM, R Kym Horsell wrote: > Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >> olcott <NoOne@NoWhere.com> writes: >>> These are my own (self-evidently correct) words: >>> Any computation based on finite string transformation rules is Turing >>> computable. >> Not self-evidently correct. You even give a counter example: >>> The fact that the case where a computation examines a finite string to >>> determine whether or not that finite string represents a computation >>> that would halt on its input <is> a finite string transformation >>> computation. The input string is transformed into "1" or "0". >> Well done. > > > How is it some people have an apparent infinite capacity to listen to a > stream of nonsense without choking on vomit? > Humm.... Good point! Damn. Perhaps they think there is hope? ;^o
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-15 15:20 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <3-idnaUmnt0-XNL9nZ2dnUU7-X_NnZ2d@giganews.com> |
| In reply to | #29361 |
On 3/15/2021 2:51 PM, Chris M. Thomasson wrote:
> On 3/14/2021 8:27 PM, R Kym Horsell wrote:
>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>> These are my own (self-evidently correct) words:
>>>> Any computation based on finite string transformation rules is Turing
>>>> computable.
>>> Not self-evidently correct. You even give a counter example:
>>>> The fact that the case where a computation examines a finite string to
>>>> determine whether or not that finite string represents a computation
>>>> that would halt on its input <is> a finite string transformation
>>>> computation. The input string is transformed into "1" or "0".
>>> Well done.
>>
>>
>> How is it some people have an apparent infinite capacity to listen to a
>> stream of nonsense without choking on vomit?
>>
>
> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o
If you simply assume that I am wrong you will not see that I am correct.
I updated these two pages of the textbook proofs:
http://www.liarparadox.org/sipser_165.pdf
http://www.liarparadox.org/kozen_233.pdf
to YELLOW HIGHLIGHT the portions that show the key basis of both of
these proofs is defining an input to the halt decider that:
"does the opposite of whatever the halt decider decides"
The following does correctly encode this same key basis and no one can
point out why it does not:
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);
}
Then I provide the complete execution trace of the x86 machine language
of the above code:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
Showing exactly <how> this halting status of the above code is correctly
decided as infinitely recursive. No one can point to any error.
Any bloody idiot can play the role of a mindless naysayer, even a bot
can do this. No one can point to any error in any of the above BECAUSE
THERE IS NO ERROR!
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-15 14:54 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <s2ohik$a0v$1@dont-email.me> |
| In reply to | #29363 |
On 2021-03-15 14:20, olcott wrote:
> On 3/15/2021 2:51 PM, Chris M. Thomasson wrote:
>> On 3/14/2021 8:27 PM, R Kym Horsell wrote:
>>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>> These are my own (self-evidently correct) words:
>>>>> Any computation based on finite string transformation rules is Turing
>>>>> computable.
>>>> Not self-evidently correct. You even give a counter example:
>>>>> The fact that the case where a computation examines a finite string to
>>>>> determine whether or not that finite string represents a computation
>>>>> that would halt on its input <is> a finite string transformation
>>>>> computation. The input string is transformed into "1" or "0".
>>>> Well done.
>>>
>>>
>>> How is it some people have an apparent infinite capacity to listen to a
>>> stream of nonsense without choking on vomit?
>>>
>>
>> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o
>
>
> If you simply assume that I am wrong you will not see that I am correct.
>
> I updated these two pages of the textbook proofs:
> http://www.liarparadox.org/sipser_165.pdf
> http://www.liarparadox.org/kozen_233.pdf
>
> to YELLOW HIGHLIGHT the portions that show the key basis of both of
> these proofs is defining an input to the halt decider that:
> "does the opposite of whatever the halt decider decides"
You keep talking about the 'key basis' of these proofs. If you want to
refute a proof, you need to consider the *entirety* of the proof, not
just some part of it which you consider to be the 'key basis'.
In all of the proofs which you consider, we begin with some Turing
Machine, H. We then construct a second Turing Machine, H_Hat, which
serves to show that whatever computation H performs, H is not a
universal halt decider.
H_Hat is constructed by making a copy of H and then appending some
additional state transitions.
Note that H_Hat is an entirely separate Turing Machine from H. As such,
it must be a self-contained entity. It cannot 'call upon' routines in H,
or in your 'x86utm operating system' since that's not the way in which
Turing Machines work. Any instructions upon which H_Hat relies *must* be
contained within H_Hat. It also cannot make use of any global variables
which can be manipulated by H, nor any persistent variables which retain
values across calls to H_Hat. Otherwise you are not modelling a Turing
Machine.
Your 'proof' does not construct H_Hat in the above manner, and, unless
you can show that your halt detector is capable of correctly deciding
halting for a machine which actually *is* constructed in the above
manner, then you have failed to address the proof.
Note that H refers to the purported halt detector; In the case of your
'decider' that is not 'Input_Would_Halt'. It is the *entirety* of your
halt detector, including the 'supervisor' which you claim that
everything runs in. Your 'Input_Would_Halt' is simply one part of your
H. It isn't what we use to construct H_Hat from when following the Linz
proof.
Note also that once you have *correctly* constructed H_Hat, then when
discussing the following:
Halt(H_Hat, H_Hat)
The *only* thing being considered as a candidate for a universal Halt
decider is Halt. Not H_Hat nor any of the code contained within H_Hat.
So when you use your subjective 'would not have halted unless Halts had
stopped executing it', 'Halts' can only refer to Halt, not to any
embedded code within H_Hat. You instead seem to use the term 'halt
decider' to indiscriminately refer to either H or code within H_Hat.
> The following does correctly encode this same key basis and no one can
> point out why it does not:
>
> 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);
> }
>
> Then I provide the complete execution trace of the x86 machine language
> of the above code:
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
> Showing exactly <how> this halting status of the above code is correctly
> decided as infinitely recursive. No one can point to any error.
>
> Any bloody idiot can play the role of a mindless naysayer, even a bot
> can do this. No one can point to any error in any of the above BECAUSE
> THERE IS NO ERROR!
Yes, there is a blatant error. Your H_Hat is not actually constructed in
the manner described in the proof.
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-15 16:29 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <-d-dnTUVeORTTNL9nZ2dnUU7-cPNnZ2d@giganews.com> |
| In reply to | #29367 |
On 3/15/2021 3:54 PM, André G. Isaak wrote: > On 2021-03-15 14:20, olcott wrote: >> On 3/15/2021 2:51 PM, Chris M. Thomasson wrote: >>> On 3/14/2021 8:27 PM, R Kym Horsell wrote: >>>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> These are my own (self-evidently correct) words: >>>>>> Any computation based on finite string transformation rules is Turing >>>>>> computable. >>>>> Not self-evidently correct. You even give a counter example: >>>>>> The fact that the case where a computation examines a finite >>>>>> string to >>>>>> determine whether or not that finite string represents a computation >>>>>> that would halt on its input <is> a finite string transformation >>>>>> computation. The input string is transformed into "1" or "0". >>>>> Well done. >>>> >>>> >>>> How is it some people have an apparent infinite capacity to listen to a >>>> stream of nonsense without choking on vomit? >>>> >>> >>> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o >> >> >> If you simply assume that I am wrong you will not see that I am correct. >> >> I updated these two pages of the textbook proofs: >> http://www.liarparadox.org/sipser_165.pdf >> http://www.liarparadox.org/kozen_233.pdf >> >> to YELLOW HIGHLIGHT the portions that show the key basis of both of >> these proofs is defining an input to the halt decider that: >> "does the opposite of whatever the halt decider decides" > > You keep talking about the 'key basis' of these proofs. If you want to > refute a proof, you need to consider the *entirety* of the proof, not > just some part of it which you consider to be the 'key basis'. OK so you are under the impression that when the basis of a proof is eliminated then the proof still proves its point? For example Trump really hates the fact his net approval rating was almost always -10%. https://projects.fivethirtyeight.com/trump-approval-ratings/ So he makes up some Joseph Goebbels "big lie" that the only reason that he lost was that he was cheated. According to your reasoning this Joseph Goebbels "big lie" is proven even though no evidence supporting it exists. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-15 15:33 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <s2ojs2$q49$1@dont-email.me> |
| In reply to | #29371 |
On 2021-03-15 15:29, olcott wrote: > On 3/15/2021 3:54 PM, André G. Isaak wrote: >> On 2021-03-15 14:20, olcott wrote: >>> On 3/15/2021 2:51 PM, Chris M. Thomasson wrote: >>>> On 3/14/2021 8:27 PM, R Kym Horsell wrote: >>>>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> These are my own (self-evidently correct) words: >>>>>>> Any computation based on finite string transformation rules is >>>>>>> Turing >>>>>>> computable. >>>>>> Not self-evidently correct. You even give a counter example: >>>>>>> The fact that the case where a computation examines a finite >>>>>>> string to >>>>>>> determine whether or not that finite string represents a computation >>>>>>> that would halt on its input <is> a finite string transformation >>>>>>> computation. The input string is transformed into "1" or "0". >>>>>> Well done. >>>>> >>>>> >>>>> How is it some people have an apparent infinite capacity to listen >>>>> to a >>>>> stream of nonsense without choking on vomit? >>>>> >>>> >>>> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o >>> >>> >>> If you simply assume that I am wrong you will not see that I am correct. >>> >>> I updated these two pages of the textbook proofs: >>> http://www.liarparadox.org/sipser_165.pdf >>> http://www.liarparadox.org/kozen_233.pdf >>> >>> to YELLOW HIGHLIGHT the portions that show the key basis of both of >>> these proofs is defining an input to the halt decider that: >>> "does the opposite of whatever the halt decider decides" >> >> You keep talking about the 'key basis' of these proofs. If you want to >> refute a proof, you need to consider the *entirety* of the proof, not >> just some part of it which you consider to be the 'key basis'. > OK so you are under the impression that when the basis of a proof is > eliminated then the proof still proves its point? No. My point is that your ability to recognize what constitutes the 'key basis' of a proof is not reliable. Can your 'halt decider' cope with an input which is *actually* constructed in the way dictated by the proof? If the answer is 'no' (which it is) then you have not actually addressed the proof. 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-15 17:00 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <LIadnSTVUdR0RdL9nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #29373 |
On 3/15/2021 4:33 PM, André G. Isaak wrote: > On 2021-03-15 15:29, olcott wrote: >> On 3/15/2021 3:54 PM, André G. Isaak wrote: >>> On 2021-03-15 14:20, olcott wrote: >>>> On 3/15/2021 2:51 PM, Chris M. Thomasson wrote: >>>>> On 3/14/2021 8:27 PM, R Kym Horsell wrote: >>>>>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> These are my own (self-evidently correct) words: >>>>>>>> Any computation based on finite string transformation rules is >>>>>>>> Turing >>>>>>>> computable. >>>>>>> Not self-evidently correct. You even give a counter example: >>>>>>>> The fact that the case where a computation examines a finite >>>>>>>> string to >>>>>>>> determine whether or not that finite string represents a >>>>>>>> computation >>>>>>>> that would halt on its input <is> a finite string transformation >>>>>>>> computation. The input string is transformed into "1" or "0". >>>>>>> Well done. >>>>>> >>>>>> >>>>>> How is it some people have an apparent infinite capacity to listen >>>>>> to a >>>>>> stream of nonsense without choking on vomit? >>>>>> >>>>> >>>>> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o >>>> >>>> >>>> If you simply assume that I am wrong you will not see that I am >>>> correct. >>>> >>>> I updated these two pages of the textbook proofs: >>>> http://www.liarparadox.org/sipser_165.pdf >>>> http://www.liarparadox.org/kozen_233.pdf >>>> >>>> to YELLOW HIGHLIGHT the portions that show the key basis of both of >>>> these proofs is defining an input to the halt decider that: >>>> "does the opposite of whatever the halt decider decides" >>> >>> You keep talking about the 'key basis' of these proofs. If you want >>> to refute a proof, you need to consider the *entirety* of the proof, >>> not just some part of it which you consider to be the 'key basis'. >> OK so you are under the impression that when the basis of a proof is >> eliminated then the proof still proves its point? > > No. My point is that your ability to recognize what constitutes the 'key > basis' of a proof is not reliable. None-the-less the verifiable fact that this is indeed the key basis can't possibly be refuted. It can however be confirmed by the yellow highlighted portions of the textbook proofs. It is self-evident that these proofs cannot possibly succeed once this key basis is eliminated. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-15 18:59 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <s2ovtj$9ph$1@dont-email.me> |
| In reply to | #29376 |
On 2021-03-15 16:00, olcott wrote: > On 3/15/2021 4:33 PM, André G. Isaak wrote: >> On 2021-03-15 15:29, olcott wrote: >>> On 3/15/2021 3:54 PM, André G. Isaak wrote: >>>> On 2021-03-15 14:20, olcott wrote: >>>>> On 3/15/2021 2:51 PM, Chris M. Thomasson wrote: >>>>>> On 3/14/2021 8:27 PM, R Kym Horsell wrote: >>>>>>> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> These are my own (self-evidently correct) words: >>>>>>>>> Any computation based on finite string transformation rules is >>>>>>>>> Turing >>>>>>>>> computable. >>>>>>>> Not self-evidently correct. You even give a counter example: >>>>>>>>> The fact that the case where a computation examines a finite >>>>>>>>> string to >>>>>>>>> determine whether or not that finite string represents a >>>>>>>>> computation >>>>>>>>> that would halt on its input <is> a finite string transformation >>>>>>>>> computation. The input string is transformed into "1" or "0". >>>>>>>> Well done. >>>>>>> >>>>>>> >>>>>>> How is it some people have an apparent infinite capacity to >>>>>>> listen to a >>>>>>> stream of nonsense without choking on vomit? >>>>>>> >>>>>> >>>>>> Humm.... Good point! Damn. Perhaps they think there is hope? ;^o >>>>> >>>>> >>>>> If you simply assume that I am wrong you will not see that I am >>>>> correct. >>>>> >>>>> I updated these two pages of the textbook proofs: >>>>> http://www.liarparadox.org/sipser_165.pdf >>>>> http://www.liarparadox.org/kozen_233.pdf >>>>> >>>>> to YELLOW HIGHLIGHT the portions that show the key basis of both of >>>>> these proofs is defining an input to the halt decider that: >>>>> "does the opposite of whatever the halt decider decides" >>>> >>>> You keep talking about the 'key basis' of these proofs. If you want >>>> to refute a proof, you need to consider the *entirety* of the proof, >>>> not just some part of it which you consider to be the 'key basis'. >>> OK so you are under the impression that when the basis of a proof is >>> eliminated then the proof still proves its point? >> >> No. My point is that your ability to recognize what constitutes the >> 'key basis' of a proof is not reliable. > > None-the-less the verifiable fact that this is indeed the key basis > can't possibly be refuted. It can however be confirmed by the yellow > highlighted portions of the textbook proofs. It is self-evident that > these proofs cannot possibly succeed once this key basis is eliminated. I have no idea which 'yellow-highlighted portions' you are referring to. But you haven't done anything remotely relevant to these proofs. The proofs state that for any program H, it is possible to construct a second program, H_Hat, which H cannot decide halting for. It doesn't make any claims that there is no program which can solve halting for H_Hat, only that H cannot. You have created a program which you call H_Hat but which is *not* the H_Hat which corresponds to your Halt Decider. Even if your halt-decider could correctly decide this it would tell us nothing. As I said, nothing in the Linz proof claims that no program can determine whether H_Hat halts; only the the H from which it is derived cannot. What you're doing is equivalent to deriving H_Hat from some program H, then discarding H and showing that some other program Y can solve halting for H_Hat, which in no way contradicts the proof. And you don't even get that right since your 'solution' relies on abuse of the subjunctive. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
Page 20 of 23 — ← Prev page 1 … 18 19 [20] 21 22 23 Next page →
Back to top | Article view | comp.theory
csiph-web