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 22 of 23 — ← Prev page 1 … 20 21 [22] 23 Next page →
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-16 23:39 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [bloody idiots] |
| Message-ID | <s2s87a$ge$1@gioia.aioe.org> |
| In reply to | #29405 |
On 3/16/2021 5:18 AM, Richard Damon wrote:
> On 3/16/21 1:00 AM, olcott wrote:
>>>
>>
>> The input to my halt decider is the COFF object file output of the
>> Microsoft C compiler.
>
> Suggestion, change your Halt program to actually work this way, the
> inputs to Halts are a string that specifies a COFF file, and a string
> that represents the input to the program.
>
> so we have a bool Halt(char const*, char const*)
>
> Make Halts actually load that program and call it with the input string.
>
> We can then create a H_Hat function:
>
> void H_Hat(char const* input) {
> bool halted = Halts(input, input);
> while(halted) continue;
> }
>
> Technically, H_Hat should probably actual make a copy of the input, but
> if Halts doesn't cheat and check that we are in the special case of
> program = input, we should be ok. (So basically Halts can't process
> based on the name of the input, just what is in the input)
>
> At worse we need to create a copy of the input file, which is trivial.
>
> See if you can make your Halts actually work with this description.
> Remember, it does still need to be a computation, so every copy of
> Halts, when given the same inputs must return the same answer, as long
> as it allowed to complete, and there can be no global operation that
> stops a computation not inside a call to Halts.
>
>
>
Shared libs come to mind, in a plug-in scenario. The decider can load up
its plug-in test cases, and execute them at will. If the input is source
code, the decider can invoke a C compiler and generate an executable,
then run it in a sandbox.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-14 15:09 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2lu1f$pu6$1@dont-email.me> |
| In reply to | #29286 |
On 2021-03-14 15:02, 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/ Not everything which an x86 program does qualifies as an effective computation. There's no point citing things that you don't actually understand. 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:12 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <z_KdnUBFzO-s4dP9nZ2dnUU7-SednZ2d@giganews.com> |
| In reply to | #29288 |
On 3/14/2021 4:09 PM, André G. Isaak wrote: > On 2021-03-14 15:02, 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/ > > Not everything which an x86 program does qualifies as an effective > computation. There's no point citing things that you don't actually > understand. > > André > 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 Perhaps you are thinking about "fake-world" computations? -- 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 15:54 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2m0m5$gn3$1@dont-email.me> |
| In reply to | #29289 |
On 2021-03-14 15:12, olcott wrote: > On 3/14/2021 4:09 PM, André G. Isaak wrote: >> On 2021-03-14 15:02, 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/ >> >> Not everything which an x86 program does qualifies as an effective >> computation. There's no point citing things that you don't actually >> understand. >> >> André >> > > 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 > > Perhaps you are thinking about "fake-world" computations? Why don't you read the Stanford encyclopedia article which you keep citing, paying careful attention to the definition of 'effective computation' and the section called "Misunderstandings of the Thesis". All kinds of computer programs do not perform computations in the theoretical sense used by Church and Turing. Just to give some C examples, the functions defined in math.h implement computations. On the other hand, few, if any, of the function defined in stdio.h qualify as computations. 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 17:18 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <8I6dnWzTvOgGFtP9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #29297 |
On 3/14/2021 4:54 PM, André G. Isaak wrote: > On 2021-03-14 15:12, olcott wrote: >> On 3/14/2021 4:09 PM, André G. Isaak wrote: >>> On 2021-03-14 15:02, 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/ >>> >>> Not everything which an x86 program does qualifies as an effective >>> computation. There's no point citing things that you don't actually >>> understand. >>> >>> André >>> >> >> 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 >> >> Perhaps you are thinking about "fake-world" computations? > > Why don't you read the Stanford encyclopedia article which you keep > citing, paying careful attention to the definition of 'effective > computation' and the section called "Misunderstandings of the Thesis". > > All kinds of computer programs do not perform computations in the > theoretical sense used by Church and Turing. > > Just to give some C examples, the functions defined in math.h implement > computations. On the other hand, few, if any, of the function defined in > stdio.h qualify as computations. > > André > None of this is relevant to 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. If this is not true: Universal Turing machine can compute any function that any computer, with any architecture, can compute (1991: 215) and it is instead based on the circular definition: In reality Turing proved that his universal machine can compute any function that any Turing machine can compute; then the Church-Turing thesis is not very useful. We might as well define "cows" as things that are cows. -- 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 17:02 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <s2m4lc$h1b$1@dont-email.me> |
| In reply to | #29301 |
On 2021-03-14 16:18, olcott wrote: > On 3/14/2021 4:54 PM, André G. Isaak wrote: >> On 2021-03-14 15:12, olcott wrote: >>> On 3/14/2021 4:09 PM, André G. Isaak wrote: >>>> On 2021-03-14 15:02, 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/ >>>> >>>> Not everything which an x86 program does qualifies as an effective >>>> computation. There's no point citing things that you don't actually >>>> understand. >>>> >>>> André >>>> >>> >>> 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 >>> >>> Perhaps you are thinking about "fake-world" computations? >> >> Why don't you read the Stanford encyclopedia article which you keep >> citing, paying careful attention to the definition of 'effective >> computation' and the section called "Misunderstandings of the Thesis". >> >> All kinds of computer programs do not perform computations in the >> theoretical sense used by Church and Turing. >> >> Just to give some C examples, the functions defined in math.h >> implement computations. On the other hand, few, if any, of the >> function defined in stdio.h qualify as computations. >> >> André >> > > None of this is relevant to 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. > > If this is not true: > Universal Turing machine can compute any function that any computer, > with any architecture, can compute (1991: 215) > > and it is instead based on the circular definition: > In reality Turing proved that his universal machine can compute any > function that any Turing machine can compute; > > then the Church-Turing thesis is not very useful. > We might as well define "cows" as things that are cows. In other words you have no interest in learning what the Church-Turing thesis actually says. You're simply going to assume it says what you *want* it to say, much as you do with almost every other thing you come across. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-14 20:31 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <wVx3I.22950$mG3.21669@fx38.iad> |
| In reply to | #29301 |
On 3/14/21 6:18 PM, olcott wrote: > On 3/14/2021 4:54 PM, André G. Isaak wrote: >> On 2021-03-14 15:12, olcott wrote: >>> On 3/14/2021 4:09 PM, André G. Isaak wrote: >>>> On 2021-03-14 15:02, 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/ >>>> >>>> Not everything which an x86 program does qualifies as an effective >>>> computation. There's no point citing things that you don't actually >>>> understand. >>>> >>>> André >>>> >>> >>> 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 >>> >>> Perhaps you are thinking about "fake-world" computations? >> >> Why don't you read the Stanford encyclopedia article which you keep >> citing, paying careful attention to the definition of 'effective >> computation' and the section called "Misunderstandings of the Thesis". >> >> All kinds of computer programs do not perform computations in the >> theoretical sense used by Church and Turing. >> >> Just to give some C examples, the functions defined in math.h >> implement computations. On the other hand, few, if any, of the >> function defined in stdio.h qualify as computations. >> >> André >> > > None of this is relevant to 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. > > If this is not true: > Universal Turing machine can compute any function that any computer, > with any architecture, can compute (1991: 215) > > and it is instead based on the circular definition: > In reality Turing proved that his universal machine can compute any > function that any Turing machine can compute; > > then the Church-Turing thesis is not very useful. > We might as well define "cows" as things that are cows. > Key note, Your ultimate problem is that you are trying to define Halts in a way that is NOT an actual computation. The circular arguement is that you have defined Halts as a machine that gets its answer right, as opposed to be a computation on the input that generates an output. Also, I still don't think you understand what that theory says. A Turing Machine is a fixed computation that can be given an input and it produces an output. A Universal Turing Machine, is an example of some such fixed computation, that by providing on the input a description of ANY Turing Machine, and a description of its Input Tape, is able to produce as an output an exact replica of the description of the output that would have happened if we had actually run the program. Because of Church-Turing, any computation that can be represented on any other architecture, CAN be converted into an equivalent Turing Machine. Since they can be converted into a Turing Machine, that representation can be given to the UTM and we can get the answer. Note, one key is this is for COMPUTATIONS, not 'functions'. If we consider just the formal parameters to the function its input, then many C functions are not computations, as they get inputs from elsewhere. We can turn them into computations by gathering ALL the external information they use and add that into the definition of the input. Note, that UTMs are actually very marvelous machines, because given one you don't need to find or build the right Turing Machine for a given computation, but can just feed ANY program into it. It would be like taking your PC, and then putting into it the program that was supposed to run on a PDP-11, and it just ran right. Remember also, Turing Machines aren't 'reprogrammable' in the same way as your PC. A given Turing Machine would be more like a program burned into rom on the machine, so it ran just that program.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 17:43 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <saKdncRui8IcDNP9nZ2dnUU7-UPNnZ2d@giganews.com> |
| In reply to | #29297 |
On 3/14/2021 4:54 PM, André G. Isaak wrote: > On 2021-03-14 15:12, olcott wrote: >> On 3/14/2021 4:09 PM, André G. Isaak wrote: >>> On 2021-03-14 15:02, 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/ >>> >>> Not everything which an x86 program does qualifies as an effective >>> computation. There's no point citing things that you don't actually >>> understand. >>> >>> André >>> >> >> 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 >> >> Perhaps you are thinking about "fake-world" computations? > > Why don't you read the Stanford encyclopedia article which you keep > citing, paying careful attention to the definition of 'effective > computation' and the section called "Misunderstandings of the Thesis". > > All kinds of computer programs do not perform computations in the > theoretical sense used by Church and Turing. > > Just to give some C examples, the functions defined in math.h implement > computations. On the other hand, few, if any, of the function defined in > stdio.h qualify as computations. > > André > None of this is relevant to 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. These are my own (self-evidently correct) words: Any computation based on finite string transformation rules is Turing computable. -- 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-14 18:01 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <cJv3I.77145$Dw4.807@fx40.iad> |
| In reply to | #29288 |
On 3/14/21 5:09 PM, André G. Isaak wrote: > On 2021-03-14 15:02, 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/ > > Not everything which an x86 program does qualifies as an effective > computation. There's no point citing things that you don't actually > understand. > > André > Everything the x86 does can be converted into an effective computation. It does require a LOT of details that 'just happen' in the x86 become data on the input tape. Things get complicated, and in the presence of some of these things, some things that might seem obvious just don't map in clear ways.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-14 17:55 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (Turing equivalence) |
| Message-ID | <ADv3I.76907$Dw4.7247@fx40.iad> |
| In reply to | #29284 |
On 3/14/21 4:13 PM, olcott wrote: > On 3/14/2021 3:08 PM, Richard Damon wrote: >> 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. > > No it isn't. By your rules of logic, can you prove it? Your presence of the global halt decider has crippled your machine so you are no longer the equivalent to a Turing Machine. The case of H_Hat is actual proof of that. Given: 1) Halts is claimed to be the equivalent of a Turing Halt Decider 2) H_Hat is claimed to be the equivalent of the H^ defined by Linz 3) Halts is claimed to decide that H_Hat(H_Hat) is a non-Halting Computation. 4) It is claimed that your system needs to abort H_Hat(H_Hat) as it is non-halting when run. We take these as stipulated definition. By 1 & 3, when the code for H_Hat calls Halts(H_Hat, H_Hat) then since Halts is a computation and thus always gives the same result for a given input and we have that at least one time when asked to computer Halts(H_Hat, H_Hat) it returned non-halt, then the code in H_Hat that makes the exact same computation, it will get the same answer. By the definition of Linz's H^, when H returns non-halting, then H^ will halt. By 4, when we do this in your system, it says that H_Hat is non-halting. Halting is NOT the same an non-Halting, thus the system has NOT created the equivalent action to the Turing Machines so claimed.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-14 17:38 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <c3603902-ed58-4548-a737-f64938064f6an@googlegroups.com> |
| In reply to | #29283 |
On Sunday, 14 March 2021 at 20:09:03 UTC, 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. > The whole system can be implemented as a Turing machine. But H and H_Hat cannot. They have to run under the supervisor, which decides halting. So they must be representations of Turing machines, not Turing machines themselves. By making the representations executable x86 code, this point is obscured.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-14 19:54 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <yL2dnV8BmMXJLdP9nZ2dnUU7-LfNnZ2d@giganews.com> |
| In reply to | #29311 |
On 3/14/2021 7:38 PM, Malcolm McLean wrote: > On Sunday, 14 March 2021 at 20:09:03 UTC, 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. >> > The whole system can be implemented as a Turing machine. But H and H_Hat > cannot. They have to run under the supervisor, which decides halting. > So they must be representations of Turing machines, not Turing machines > themselves. > By making the representations executable x86 code, this point is obscured. > So in other words you are saying that it is just as impossible to define a halt decider based on a UTM as it is to make a square circle? This seems like a rather glaring error on your part, your analysis had previously been quite reliable. H would be the halt decider subroutine of this UTM and H_Hat would simply be a finite string Turing machine description. Since my own criteria of the Church-Turing thesis is very simple and self-evidently correct we can know that the above halt decider is Turing equivalent on the basis that it can be defined as finite string transformation rules. Any computation that can be specified as finite string transformation rules applied to finite strings can be computed on a Turing Machine. The RASP equivalent subset of the x86 language that I use is already known to be Turing equivalent. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-15 03:05 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <1ffe9b27-d3bc-4ba6-ae0c-012728b8cc5en@googlegroups.com> |
| In reply to | #29314 |
On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote: > On 3/14/2021 7:38 PM, Malcolm McLean wrote: > > > The whole system can be implemented as a Turing machine. But H and H_Hat > > cannot. They have to run under the supervisor, which decides halting. > > So they must be representations of Turing machines, not Turing machines > > themselves. > > By making the representations executable x86 code, this point is obscured. > > > So in other words you are saying that it is just as impossible to define > a halt decider based on a UTM as it is to make a square circle? > That's an example of an illegitimate question. > > This seems like a rather glaring error on your part, your analysis had > previously been quite reliable. > > H would be the halt decider subroutine of this UTM and H_Hat would > simply be a finite string Turing machine description. > This is why you need to separate out the representations from the machines. The machines are physical things. They can really be built. Unfortunately modern technology means that the only practical way to build a Turing machine is virtually, and the input tape is also held virtually. The challenge is to build H, and run it with H_Hat, H_Hat. Then build H_Hat and run it with H_Hat. And show that H correctly predicts the halting behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat is non halting?" but that issue hasn't be raised yet). But in your system, there is a supervisor, which you call a UTM. So H and H_Hat cannot actually be built. They are representations fed to the supervisor. > > Since my own criteria of the Church-Turing thesis is very simple and > self-evidently correct we can know that the above halt decider is Turing > equivalent on the basis that it can be defined as finite string > transformation rules. > > Any computation that can be specified as finite string transformation > rules applied to finite strings can be computed on a Turing Machine. > > The RASP equivalent subset of the x86 language that I use is already > known to be Turing equivalent. >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-15 08:09 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <DrudnQSNHs_rwdL9nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #29342 |
On 3/15/2021 5:05 AM, Malcolm McLean wrote: > On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote: >> On 3/14/2021 7:38 PM, Malcolm McLean wrote: >> >>> The whole system can be implemented as a Turing machine. But H and H_Hat >>> cannot. They have to run under the supervisor, which decides halting. >>> So they must be representations of Turing machines, not Turing machines >>> themselves. >>> By making the representations executable x86 code, this point is obscured. >>> >> So in other words you are saying that it is just as impossible to define >> a halt decider based on a UTM as it is to make a square circle? >> > That's an example of an illegitimate question. >> >> This seems like a rather glaring error on your part, your analysis had >> previously been quite reliable. >> >> H would be the halt decider subroutine of this UTM and H_Hat would >> simply be a finite string Turing machine description. >> > This is why you need to separate out the representations from the > machines. The machines are physical things. They can really be built. > Unfortunately modern technology means that the only practical way to > build a Turing machine is virtually, and the input tape is also held > virtually. > The challenge is to build H, and run it with H_Hat, H_Hat. Then build > H_Hat and run it with H_Hat. And show that H correctly predicts the halting > behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat > is non halting?" but that issue hasn't be raised yet). > But in your system, there is a supervisor, which you call a UTM. So H and > H_Hat cannot actually be built. They are representations fed to the > supervisor. That seems somewhat incoherent. There is nothing illegitimate about a virtual machine: https://www.virtualbox.org/ >> >> Since my own criteria of the Church-Turing thesis is very simple and >> self-evidently correct we can know that the above halt decider is Turing >> equivalent on the basis that it can be defined as finite string >> transformation rules. >> >> Any computation that can be specified as finite string transformation >> rules applied to finite strings can be computed on a Turing Machine. >> >> The RASP equivalent subset of the x86 language that I use is already >> known to be Turing equivalent. >> -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-15 13:37 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <dccd2e21-0395-4e61-a815-c86aa351155bn@googlegroups.com> |
| In reply to | #29345 |
On Monday, 15 March 2021 at 13:09:17 UTC, olcott wrote: > On 3/15/2021 5:05 AM, Malcolm McLean wrote: > > On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote: > >> On 3/14/2021 7:38 PM, Malcolm McLean wrote: > >> > >>> The whole system can be implemented as a Turing machine. But H and H_Hat > >>> cannot. They have to run under the supervisor, which decides halting. > >>> So they must be representations of Turing machines, not Turing machines > >>> themselves. > >>> By making the representations executable x86 code, this point is obscured. > >>> > >> So in other words you are saying that it is just as impossible to define > >> a halt decider based on a UTM as it is to make a square circle? > >> > > That's an example of an illegitimate question. > >> > >> This seems like a rather glaring error on your part, your analysis had > >> previously been quite reliable. > >> > >> H would be the halt decider subroutine of this UTM and H_Hat would > >> simply be a finite string Turing machine description. > >> > > This is why you need to separate out the representations from the > > machines. The machines are physical things. They can really be built. > > Unfortunately modern technology means that the only practical way to > > build a Turing machine is virtually, and the input tape is also held > > virtually. > > The challenge is to build H, and run it with H_Hat, H_Hat. Then build > > H_Hat and run it with H_Hat. And show that H correctly predicts the halting > > behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat > > is non halting?" but that issue hasn't be raised yet). > > But in your system, there is a supervisor, which you call a UTM. So H and > > H_Hat cannot actually be built. They are representations fed to the > > supervisor. > That seems somewhat incoherent. There is nothing illegitimate about a > virtual machine: https://www.virtualbox.org/ > It's only a virtual machine if, in principle at least, it can be implemented as a physical machine. However if you do that, you're back to the claim to have a H / H_Hat pair, which is impossible. You need the halt deciding logic in the "virtual machine" for your system to work.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-15 15:52 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <JcWdnatB_feKVNL9nZ2dnUU7-SPNnZ2d@giganews.com> |
| In reply to | #29364 |
On 3/15/2021 3:37 PM, Malcolm McLean wrote:
> On Monday, 15 March 2021 at 13:09:17 UTC, olcott wrote:
>> On 3/15/2021 5:05 AM, Malcolm McLean wrote:
>>> On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote:
>>>> On 3/14/2021 7:38 PM, Malcolm McLean wrote:
>>>>
>>>>> The whole system can be implemented as a Turing machine. But H and H_Hat
>>>>> cannot. They have to run under the supervisor, which decides halting.
>>>>> So they must be representations of Turing machines, not Turing machines
>>>>> themselves.
>>>>> By making the representations executable x86 code, this point is obscured.
>>>>>
>>>> So in other words you are saying that it is just as impossible to define
>>>> a halt decider based on a UTM as it is to make a square circle?
>>>>
>>> That's an example of an illegitimate question.
>>>>
>>>> This seems like a rather glaring error on your part, your analysis had
>>>> previously been quite reliable.
>>>>
>>>> H would be the halt decider subroutine of this UTM and H_Hat would
>>>> simply be a finite string Turing machine description.
>>>>
>>> This is why you need to separate out the representations from the
>>> machines. The machines are physical things. They can really be built.
>>> Unfortunately modern technology means that the only practical way to
>>> build a Turing machine is virtually, and the input tape is also held
>>> virtually.
>>> The challenge is to build H, and run it with H_Hat, H_Hat. Then build
>>> H_Hat and run it with H_Hat. And show that H correctly predicts the halting
>>> behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat
>>> is non halting?" but that issue hasn't be raised yet).
>>> But in your system, there is a supervisor, which you call a UTM. So H and
>>> H_Hat cannot actually be built. They are representations fed to the
>>> supervisor.
>> That seems somewhat incoherent. There is nothing illegitimate about a
>> virtual machine: https://www.virtualbox.org/
>>
> It's only a virtual machine if, in principle at least, it can be implemented
> as a physical machine. However if you do that, you're back to the claim
> to have a H / H_Hat pair, which is impossible. You need the halt deciding
> logic in the "virtual machine" for your system to work.
>
Which key element of my proof do you have a problem with:
(1) My code does accurately represent the key basis of the proofs.
(The proof of this is shown below)
(2) I do show the complete x86 machine language execution trace basis
for correctly deciding infinite recursion of my code's input here:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
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);
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-15 14:09 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <b898a4ed-504d-4b49-90b3-1d268f6fc815n@googlegroups.com> |
| In reply to | #29366 |
On Monday, 15 March 2021 at 20:52:47 UTC, olcott wrote:
> On 3/15/2021 3:37 PM, Malcolm McLean wrote:
> > On Monday, 15 March 2021 at 13:09:17 UTC, olcott wrote:
> >> On 3/15/2021 5:05 AM, Malcolm McLean wrote:
> >>> On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote:
> >>>> On 3/14/2021 7:38 PM, Malcolm McLean wrote:
> >>>>
> >>>>> The whole system can be implemented as a Turing machine. But H and H_Hat
> >>>>> cannot. They have to run under the supervisor, which decides halting.
> >>>>> So they must be representations of Turing machines, not Turing machines
> >>>>> themselves.
> >>>>> By making the representations executable x86 code, this point is obscured.
> >>>>>
> >>>> So in other words you are saying that it is just as impossible to define
> >>>> a halt decider based on a UTM as it is to make a square circle?
> >>>>
> >>> That's an example of an illegitimate question.
> >>>>
> >>>> This seems like a rather glaring error on your part, your analysis had
> >>>> previously been quite reliable.
> >>>>
> >>>> H would be the halt decider subroutine of this UTM and H_Hat would
> >>>> simply be a finite string Turing machine description.
> >>>>
> >>> This is why you need to separate out the representations from the
> >>> machines. The machines are physical things. They can really be built.
> >>> Unfortunately modern technology means that the only practical way to
> >>> build a Turing machine is virtually, and the input tape is also held
> >>> virtually.
> >>> The challenge is to build H, and run it with H_Hat, H_Hat. Then build
> >>> H_Hat and run it with H_Hat. And show that H correctly predicts the halting
> >>> behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat
> >>> is non halting?" but that issue hasn't be raised yet).
> >>> But in your system, there is a supervisor, which you call a UTM. So H and
> >>> H_Hat cannot actually be built. They are representations fed to the
> >>> supervisor.
> >> That seems somewhat incoherent. There is nothing illegitimate about a
> >> virtual machine: https://www.virtualbox.org/
> >>
> > It's only a virtual machine if, in principle at least, it can be implemented
> > as a physical machine. However if you do that, you're back to the claim
> > to have a H / H_Hat pair, which is impossible. You need the halt deciding
> > logic in the "virtual machine" for your system to work.
> >
> Which key element of my proof do you have a problem with:
> (1) My code does accurately represent the key basis of the proofs.
> (The proof of this is shown below)
>
> (2) I do show the complete x86 machine language execution trace basis
> for correctly deciding infinite recursion of my code's input here:
>
01 int main()
02 {
03 H_Hat((u32)H_Hat);
04 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
05 Output("Input_Would_Halt = ", Input_Would_Halt);
06 }
Is terminated at line 03 by the x86utm operating system Halts()
There's our problem.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-15 16:22 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <_oWdncchAL6-TdL9nZ2dnUU7-Q_NnZ2d@giganews.com> |
| In reply to | #29368 |
On 3/15/2021 4:09 PM, Malcolm McLean wrote:
> On Monday, 15 March 2021 at 20:52:47 UTC, olcott wrote:
>> On 3/15/2021 3:37 PM, Malcolm McLean wrote:
>>> On Monday, 15 March 2021 at 13:09:17 UTC, olcott wrote:
>>>> On 3/15/2021 5:05 AM, Malcolm McLean wrote:
>>>>> On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote:
>>>>>> On 3/14/2021 7:38 PM, Malcolm McLean wrote:
>>>>>>
>>>>>>> The whole system can be implemented as a Turing machine. But H and H_Hat
>>>>>>> cannot. They have to run under the supervisor, which decides halting.
>>>>>>> So they must be representations of Turing machines, not Turing machines
>>>>>>> themselves.
>>>>>>> By making the representations executable x86 code, this point is obscured.
>>>>>>>
>>>>>> So in other words you are saying that it is just as impossible to define
>>>>>> a halt decider based on a UTM as it is to make a square circle?
>>>>>>
>>>>> That's an example of an illegitimate question.
>>>>>>
>>>>>> This seems like a rather glaring error on your part, your analysis had
>>>>>> previously been quite reliable.
>>>>>>
>>>>>> H would be the halt decider subroutine of this UTM and H_Hat would
>>>>>> simply be a finite string Turing machine description.
>>>>>>
>>>>> This is why you need to separate out the representations from the
>>>>> machines. The machines are physical things. They can really be built.
>>>>> Unfortunately modern technology means that the only practical way to
>>>>> build a Turing machine is virtually, and the input tape is also held
>>>>> virtually.
>>>>> The challenge is to build H, and run it with H_Hat, H_Hat. Then build
>>>>> H_Hat and run it with H_Hat. And show that H correctly predicts the halting
>>>>> behaviour of H_Hat. (Of course you might ask, "how do we know if H_Hat
>>>>> is non halting?" but that issue hasn't be raised yet).
>>>>> But in your system, there is a supervisor, which you call a UTM. So H and
>>>>> H_Hat cannot actually be built. They are representations fed to the
>>>>> supervisor.
>>>> That seems somewhat incoherent. There is nothing illegitimate about a
>>>> virtual machine: https://www.virtualbox.org/
>>>>
>>> It's only a virtual machine if, in principle at least, it can be implemented
>>> as a physical machine. However if you do that, you're back to the claim
>>> to have a H / H_Hat pair, which is impossible. You need the halt deciding
>>> logic in the "virtual machine" for your system to work.
>>>
>> Which key element of my proof do you have a problem with:
>> (1) My code does accurately represent the key basis of the proofs.
>> (The proof of this is shown below)
>>
>> (2) I do show the complete x86 machine language execution trace basis
>> for correctly deciding infinite recursion of my code's input here:
>>
> 01 int main()
> 02 {
> 03 H_Hat((u32)H_Hat);
> 04 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> 05 Output("Input_Would_Halt = ", Input_Would_Halt);
> 06 }
> Is terminated at line 03 by the x86utm operating system Halts()
>
> There's our problem.
>
The execution trace proves that it must be terminated because it meets
the infinite execution criteria.
When a UTM is the only way that any Turing machine description can be
executed then the halt decider functionality that was added to this UTM
can examine the complete execution trace of every executable.
When the local halt decider did not terminate the execution of line 03,
it was because line 03 could do sneaky things behind the back of the
halt decider. As soon as we get rid of this subterfuge this issue goes
away. Sneaky things are no longer allowed.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-15 14:37 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <s2ok3e$1ejs$2@gioia.aioe.org> |
| In reply to | #29370 |
On 3/15/2021 2:22 PM, olcott wrote:
> On 3/15/2021 4:09 PM, Malcolm McLean wrote:
>> On Monday, 15 March 2021 at 20:52:47 UTC, olcott wrote:
>>> On 3/15/2021 3:37 PM, Malcolm McLean wrote:
>>>> On Monday, 15 March 2021 at 13:09:17 UTC, olcott wrote:
>>>>> On 3/15/2021 5:05 AM, Malcolm McLean wrote:
>>>>>> On Monday, 15 March 2021 at 00:54:51 UTC, olcott wrote:
>>>>>>> On 3/14/2021 7:38 PM, Malcolm McLean wrote:
>>>>>>>
>>>>>>>> The whole system can be implemented as a Turing machine. But H
>>>>>>>> and H_Hat
>>>>>>>> cannot. They have to run under the supervisor, which decides
>>>>>>>> halting.
>>>>>>>> So they must be representations of Turing machines, not Turing
>>>>>>>> machines
>>>>>>>> themselves.
>>>>>>>> By making the representations executable x86 code, this point is
>>>>>>>> obscured.
>>>>>>>>
>>>>>>> So in other words you are saying that it is just as impossible to
>>>>>>> define
>>>>>>> a halt decider based on a UTM as it is to make a square circle?
>>>>>>>
>>>>>> That's an example of an illegitimate question.
>>>>>>>
>>>>>>> This seems like a rather glaring error on your part, your
>>>>>>> analysis had
>>>>>>> previously been quite reliable.
>>>>>>>
>>>>>>> H would be the halt decider subroutine of this UTM and H_Hat would
>>>>>>> simply be a finite string Turing machine description.
>>>>>>>
>>>>>> This is why you need to separate out the representations from the
>>>>>> machines. The machines are physical things. They can really be built.
>>>>>> Unfortunately modern technology means that the only practical way to
>>>>>> build a Turing machine is virtually, and the input tape is also held
>>>>>> virtually.
>>>>>> The challenge is to build H, and run it with H_Hat, H_Hat. Then build
>>>>>> H_Hat and run it with H_Hat. And show that H correctly predicts
>>>>>> the halting
>>>>>> behaviour of H_Hat. (Of course you might ask, "how do we know if
>>>>>> H_Hat
>>>>>> is non halting?" but that issue hasn't be raised yet).
>>>>>> But in your system, there is a supervisor, which you call a UTM.
>>>>>> So H and
>>>>>> H_Hat cannot actually be built. They are representations fed to the
>>>>>> supervisor.
>>>>> That seems somewhat incoherent. There is nothing illegitimate about a
>>>>> virtual machine: https://www.virtualbox.org/
>>>>>
>>>> It's only a virtual machine if, in principle at least, it can be
>>>> implemented
>>>> as a physical machine. However if you do that, you're back to the claim
>>>> to have a H / H_Hat pair, which is impossible. You need the halt
>>>> deciding
>>>> logic in the "virtual machine" for your system to work.
>>>>
>>> Which key element of my proof do you have a problem with:
>>> (1) My code does accurately represent the key basis of the proofs.
>>> (The proof of this is shown below)
>>>
>>> (2) I do show the complete x86 machine language execution trace basis
>>> for correctly deciding infinite recursion of my code's input here:
>>>
>> 01 int main()
>> 02 {
>> 03 H_Hat((u32)H_Hat);
>> 04 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> 05 Output("Input_Would_Halt = ", Input_Would_Halt);
>> 06 }
>> Is terminated at line 03 by the x86utm operating system Halts()
>>
>> There's our problem.
>>
>
> The execution trace proves that it must be terminated because it meets
> the infinite execution criteria.
I can see it now... A program has been running for 25 years, and you
terminate it. The program says, why did you do that to me, ahole! I
could have run for infinity! You decider failed to observe a critical
aspect that allows it to run forever.
>
> When a UTM is the only way that any Turing machine description can be
> executed then the halt decider functionality that was added to this UTM
> can examine the complete execution trace of every executable.
>
> When the local halt decider did not terminate the execution of line 03,
> it was because line 03 could do sneaky things behind the back of the
> halt decider. As soon as we get rid of this subterfuge this issue goes
> away. Sneaky things are no longer allowed.
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-14 02:26 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (revised answer) |
| Message-ID | <87pn02a2td.fsf@bsb.me.uk> |
| In reply to | #29236 |
olcott <NoOne@NoWhere.com> writes: > On 3/13/2021 4:00 PM, Malcolm McLean wrote: >> On Saturday, 13 March 2021 at 21:51:59 UTC, olcott wrote: >>> When the halt decider is based on adapting a UTM then nothing can slip >>> past the analysis of the halt decider. >>> >> You can't solve the halting problem this way, e.g. determine the halting >> status of a famous unknown problem. However you can pick up tight loops >> or simple infinite recursion. > > The "do the opposite of whatever the halt decider decides" of the > conventional proofs becomes decidable, they are decided as would not > halt. There are an infinite number of inputs that represent computations that do the same thing as H^. They form an undecidable set. You can spot a few of them, but you can't catch them all. What you call "pathological self-reference" can't be reliably detected. That's in abstract. Your practical approach -- simulate a computation until it halts or until you detect that it won't -- is also impossible. You "scam" to declare the wrong answer to be the correct answer is, in fact pointless. If you really could detect those computations would not halt if not stopped, you'd have a conventional halt decider and you should be boasting about that, not hiding your light under a "redefining the criterion" bushel. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 22 of 23 — ← Prev page 1 … 20 21 [22] 23 Next page →
Back to top | Article view | comp.theory
csiph-web