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 7 of 23 — ← Prev page 1 … 5 6 [7] 8 9 … 23 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-12 16:42 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <k4mdnQNZoJamc9b9nZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #29193 |
On 3/12/2021 4:31 PM, André G. Isaak wrote:
> On 2021-03-12 15:17, olcott wrote:
>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>> On 2021-03-12 11:23, olcott wrote:
>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>
>>>>>> When Jack is asked the question:
>>>>>> Will your answer to this question be no?
>>>>>
>>>>> You keep invoking these natural language examples as if they were
>>>>> somehow pertinent. The paradoxical nature of the above results from
>>>>> the deictic expression 'this'. No such expression occurs anywhere
>>>>> in the Linz proof,
>>>>
>>>> Halts is asked to decide whether or not H_Hat would halt on itself
>>>> as input.
>>>
>>> Halts is being asked to descide whether H_Hat would halt when given a
>>> description of a TM which happens to describe itself. Why should that
>>> be a problem?
>>
>> You know damn well that the problem is that H_Hat is defined to do the
>> opposite of whatever the halt decider decides thus proving that H_Hat
>> is a self-contradictory input whenever it is its own input.
>
> H_Hat isn't the halt decider, so why would it be 'self-contradictory' to
> give H_Hat a description of itself as input?
You already know why quit being a damned liar.
> And your claim that 'H_Hat is defined to do the opposite of whatever the
> halt decider decides' is a bit misleading.
Not to people that are not damned liars:
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
> H_Hat is derived from H, but once we have created H and H_Hat, they are
> fixed computations. Whatever H_Hat does is entirely independent of H.
> What it does is not a response to what H does and it cannot 'change'
> what it does based on what H does.
H_Hat is a fixed computation that is defined to do the opposite of
whatever the halt decider decides.
>
>> What is your motive for being deceitful about this?
>
> I am not being deceitful. You are simply failing to grasp what I am saying.
>
>
--
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-13 09:00 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <s2inj2$1i4$1@dont-email.me> |
| In reply to | #29195 |
On 2021-03-12 15:42, olcott wrote:
> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>> On 2021-03-12 15:17, olcott wrote:
>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>> On 2021-03-12 11:23, olcott wrote:
>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>
>>>>>>> When Jack is asked the question:
>>>>>>> Will your answer to this question be no?
>>>>>>
>>>>>> You keep invoking these natural language examples as if they were
>>>>>> somehow pertinent. The paradoxical nature of the above results
>>>>>> from the deictic expression 'this'. No such expression occurs
>>>>>> anywhere in the Linz proof,
>>>>>
>>>>> Halts is asked to decide whether or not H_Hat would halt on itself
>>>>> as input.
>>>>
>>>> Halts is being asked to descide whether H_Hat would halt when given
>>>> a description of a TM which happens to describe itself. Why should
>>>> that be a problem?
>>>
>>> You know damn well that the problem is that H_Hat is defined to do
>>> the opposite of whatever the halt decider decides thus proving that
>>> H_Hat is a self-contradictory input whenever it is its own input.
>>
>> H_Hat isn't the halt decider, so why would it be 'self-contradictory'
>> to give H_Hat a description of itself as input?
>
> You already know why quit being a damned liar.
>
>> And your claim that 'H_Hat is defined to do the opposite of whatever
>> the halt decider decides' is a bit misleading.
>
> Not to people that are not damned liars:
>
> void H_Hat(u32 P)
> {
> u32 Input_Would_Halt = Halts(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
>> H_Hat is derived from H, but once we have created H and H_Hat, they
>> are fixed computations. Whatever H_Hat does is entirely independent of
>> H. What it does is not a response to what H does and it cannot
>> 'change' what it does based on what H does.
>
> H_Hat is a fixed computation that is defined to do the opposite of
> whatever the halt decider decides.
No. H_Hat is a computation which takes an input string and then performs
certain actions in response to that input string. As far as H_Hat is
concerned, its input is simply a string of symbols.
Similarly, H is a computation which takes an input string and then
performs certain actions in response to that input string. Again, its
input is just a string of symbols.
To clarify this with an example not involving halting, consider a TM
which takes as its input two integers expressed as strings of ones and
zeros separated by a space. This TM appends to the tape the sum of these
two integers, again as a string of ones and zeros, and then halts.
We could refer to the above TM as an 'adder'. But what the TM is doing
is simply reading symbols from a tape and then printing some additional
symbols to that tape according to the rules defined by its
state-transition table. We call the computation 'addition' because when
*we* (not the TM) interpret the input and output symbols as integers
expressed in binary, then the output of the TM corresponds to the sum of
the inputs to the TM. But that is *us* imposing an interpretation upon
these symbols. The TM is completely unaware of what meaning these
symbols might have.
Similarly, the computation which H performs is defined entirely the
state transitions contained within H. Given an input of H_Hat, the TM
simply sees a string of symbols. It then performs the computation
defined by its state transition rules and halts in one of two states.
So let's say we give H an input string corresponding to H_Hat H_Hat.
H will perform its computation and halt in one of its final states, call
that state Q.
If we run the TM H_Hat with an input string corresponding to H_Hat, this
TM *doesn't* contradict the computation performed by H. What it
contradicts is the *interpretation* of the computation performed by H in
which its input is interpreted to be the description of a Turing Machine
and its input and the final state Q is interpreted to signify whether
that particular Turing Machine halts on that particular input.
That contradiction demonstrates is that this particular interpretation
of what H does is not valid. The computation performed by H cannot
consistently be described as 'universally deciding halting'. But this
interpretation is one which someone has imposed on the TM. It isn't an
integral part of the TM.
Just because we can describe something doesn't mean it is possible.
There is no TM which actually satisfies the description 'universal halt
decider' just as there is no person who satisfies the description
'person who is taller than the tallest person'.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 10:29 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <OaydnRIDcpbwddH9nZ2dnUU7-VHNnZ2d@giganews.com> |
| In reply to | #29209 |
On 3/13/2021 10:00 AM, André G. Isaak wrote:
> On 2021-03-12 15:42, olcott wrote:
>> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>>> On 2021-03-12 15:17, olcott wrote:
>>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>>> On 2021-03-12 11:23, olcott wrote:
>>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>>
>>>>>>>> When Jack is asked the question:
>>>>>>>> Will your answer to this question be no?
>>>>>>>
>>>>>>> You keep invoking these natural language examples as if they were
>>>>>>> somehow pertinent. The paradoxical nature of the above results
>>>>>>> from the deictic expression 'this'. No such expression occurs
>>>>>>> anywhere in the Linz proof,
>>>>>>
>>>>>> Halts is asked to decide whether or not H_Hat would halt on itself
>>>>>> as input.
>>>>>
>>>>> Halts is being asked to descide whether H_Hat would halt when given
>>>>> a description of a TM which happens to describe itself. Why should
>>>>> that be a problem?
>>>>
>>>> You know damn well that the problem is that H_Hat is defined to do
>>>> the opposite of whatever the halt decider decides thus proving that
>>>> H_Hat is a self-contradictory input whenever it is its own input.
>>>
>>> H_Hat isn't the halt decider, so why would it be 'self-contradictory'
>>> to give H_Hat a description of itself as input?
>>
>> You already know why quit being a damned liar.
>>
>>> And your claim that 'H_Hat is defined to do the opposite of whatever
>>> the halt decider decides' is a bit misleading.
>>
>> Not to people that are not damned liars:
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Would_Halt = Halts(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>>> H_Hat is derived from H, but once we have created H and H_Hat, they
>>> are fixed computations. Whatever H_Hat does is entirely independent
>>> of H. What it does is not a response to what H does and it cannot
>>> 'change' what it does based on what H does.
>>
>> H_Hat is a fixed computation that is defined to do the opposite of
>> whatever the halt decider decides.
>
> No. H_Hat is a computation which takes an input string and then performs
> certain actions in response to that input string. As far as H_Hat is
> concerned, its input is simply a string of symbols.
A fixed computation is a code/input pair.
Since there is no correct decision that Halts can make on H_Hat because
H_Hat contradicts whatever decision that Halts makes the Halts/H_Hat
decision problem / input pair is incorrect.
Contradictory decision problem / input pairs are erroneous in the same
way that contradictory questions are erroneous.
The question: Does the input halt on its input? is a contradictory
question for Halts/H_Hat pair.
The question: Would the input program halt if the halt decider never
stopped simulating it? is not a contradictory question for the
Halts/H_Hat pair.
--
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-13 08:45 -0800 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <6fb3dbea-7e51-43c6-bf7e-08aa90c2a17bn@googlegroups.com> |
| In reply to | #29211 |
On Saturday, 13 March 2021 at 16:29:40 UTC, olcott wrote:
> On 3/13/2021 10:00 AM, André G. Isaak wrote:
> > On 2021-03-12 15:42, olcott wrote:
> >> On 3/12/2021 4:31 PM, André G. Isaak wrote:
> >>> On 2021-03-12 15:17, olcott wrote:
> >>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
> >>>>> On 2021-03-12 11:23, olcott wrote:
> >>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
> >>>>>>> On 2021-03-12 11:02, olcott wrote:
> >>>>>>>
> >>>>>>>> When Jack is asked the question:
> >>>>>>>> Will your answer to this question be no?
> >>>>>>>
> >>>>>>> You keep invoking these natural language examples as if they were
> >>>>>>> somehow pertinent. The paradoxical nature of the above results
> >>>>>>> from the deictic expression 'this'. No such expression occurs
> >>>>>>> anywhere in the Linz proof,
> >>>>>>
> >>>>>> Halts is asked to decide whether or not H_Hat would halt on itself
> >>>>>> as input.
> >>>>>
> >>>>> Halts is being asked to descide whether H_Hat would halt when given
> >>>>> a description of a TM which happens to describe itself. Why should
> >>>>> that be a problem?
> >>>>
> >>>> You know damn well that the problem is that H_Hat is defined to do
> >>>> the opposite of whatever the halt decider decides thus proving that
> >>>> H_Hat is a self-contradictory input whenever it is its own input.
> >>>
> >>> H_Hat isn't the halt decider, so why would it be 'self-contradictory'
> >>> to give H_Hat a description of itself as input?
> >>
> >> You already know why quit being a damned liar.
> >>
> >>> And your claim that 'H_Hat is defined to do the opposite of whatever
> >>> the halt decider decides' is a bit misleading.
> >>
> >> Not to people that are not damned liars:
> >>
> >> void H_Hat(u32 P)
> >> {
> >> u32 Input_Would_Halt = Halts(P, P);
> >> if (Input_Would_Halt)
> >> HERE: goto HERE;
> >> }
> >>
> >>> H_Hat is derived from H, but once we have created H and H_Hat, they
> >>> are fixed computations. Whatever H_Hat does is entirely independent
> >>> of H. What it does is not a response to what H does and it cannot
> >>> 'change' what it does based on what H does.
> >>
> >> H_Hat is a fixed computation that is defined to do the opposite of
> >> whatever the halt decider decides.
> >
> > No. H_Hat is a computation which takes an input string and then performs
> > certain actions in response to that input string. As far as H_Hat is
> > concerned, its input is simply a string of symbols.
> A fixed computation is a code/input pair.
>
The tape is a physical object, and the machine is another physical object.
Unlike with a human, there's nothing in the behaviour of the system that
we don't understand.
>
> Since there is no correct decision that Halts can make on H_Hat because
> H_Hat contradicts whatever decision that Halts makes the Halts/H_Hat
> decision problem / input pair is incorrect.
>
Say that instead of an adder, we build a divider. Now we input "0 / 0". That
input is incorrect, in the human interpretation. But to the machine, it's just
another input that it will respond to somehow, maybe by going into an
infinite exapnsion of its output symbol. But it has to behave somehow
because it is a physical object.
>
> Contradictory decision problem / input pairs are erroneous in the same
> way that contradictory questions are erroneous.
>
> The question: Does the input halt on its input? is a contradictory
> question for Halts/H_Hat pair.
>
> The question: Would the input program halt if the halt decider never
> stopped simulating it? is not a contradictory question for the
> Halts/H_Hat pair.
>
No, that doesn't buy you anything. H in Linz's scheme has to return a
value. Now whether you interpret that value as "input never halts" or
"input would never halt if halt's internal simulator didn't halt it" is just
different ways of saying the same thing. To get round Linz's scheme,
you've got to place the simulator outside of H and therefore of H_Hat.
But that's cheating, of course.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 10:58 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <DtWdnaAHEfWBctH9nZ2dnUU7-YfNnZ2d@giganews.com> |
| In reply to | #29212 |
On 3/13/2021 10:45 AM, Malcolm McLean wrote:
> On Saturday, 13 March 2021 at 16:29:40 UTC, olcott wrote:
>> On 3/13/2021 10:00 AM, André G. Isaak wrote:
>>> On 2021-03-12 15:42, olcott wrote:
>>>> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>>>>> On 2021-03-12 15:17, olcott wrote:
>>>>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-12 11:23, olcott wrote:
>>>>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>>>>
>>>>>>>>>> When Jack is asked the question:
>>>>>>>>>> Will your answer to this question be no?
>>>>>>>>>
>>>>>>>>> You keep invoking these natural language examples as if they were
>>>>>>>>> somehow pertinent. The paradoxical nature of the above results
>>>>>>>>> from the deictic expression 'this'. No such expression occurs
>>>>>>>>> anywhere in the Linz proof,
>>>>>>>>
>>>>>>>> Halts is asked to decide whether or not H_Hat would halt on itself
>>>>>>>> as input.
>>>>>>>
>>>>>>> Halts is being asked to descide whether H_Hat would halt when given
>>>>>>> a description of a TM which happens to describe itself. Why should
>>>>>>> that be a problem?
>>>>>>
>>>>>> You know damn well that the problem is that H_Hat is defined to do
>>>>>> the opposite of whatever the halt decider decides thus proving that
>>>>>> H_Hat is a self-contradictory input whenever it is its own input.
>>>>>
>>>>> H_Hat isn't the halt decider, so why would it be 'self-contradictory'
>>>>> to give H_Hat a description of itself as input?
>>>>
>>>> You already know why quit being a damned liar.
>>>>
>>>>> And your claim that 'H_Hat is defined to do the opposite of whatever
>>>>> the halt decider decides' is a bit misleading.
>>>>
>>>> Not to people that are not damned liars:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>>> H_Hat is derived from H, but once we have created H and H_Hat, they
>>>>> are fixed computations. Whatever H_Hat does is entirely independent
>>>>> of H. What it does is not a response to what H does and it cannot
>>>>> 'change' what it does based on what H does.
>>>>
>>>> H_Hat is a fixed computation that is defined to do the opposite of
>>>> whatever the halt decider decides.
>>>
>>> No. H_Hat is a computation which takes an input string and then performs
>>> certain actions in response to that input string. As far as H_Hat is
>>> concerned, its input is simply a string of symbols.
>> A fixed computation is a code/input pair.
>>
> The tape is a physical object, and the machine is another physical object.
> Unlike with a human, there's nothing in the behaviour of the system that
> we don't understand.
>>
>> Since there is no correct decision that Halts can make on H_Hat because
>> H_Hat contradicts whatever decision that Halts makes the Halts/H_Hat
>> decision problem / input pair is incorrect.
>>
> Say that instead of an adder, we build a divider. Now we input "0 / 0". That
> input is incorrect, in the human interpretation. But to the machine, it's just
> another input that it will respond to somehow, maybe by going into an
> infinite exapnsion of its output symbol. But it has to behave somehow
> because it is a physical object.
>>
>> Contradictory decision problem / input pairs are erroneous in the same
>> way that contradictory questions are erroneous.
>>
>> The question: Does the input halt on its input? is a contradictory
>> question for Halts/H_Hat pair.
>>
>> The question: Would the input program halt if the halt decider never
>> stopped simulating it? is not a contradictory question for the
>> Halts/H_Hat pair.
>>
> No, that doesn't buy you anything.
I have already proven otherwise with a complete execution trace:
http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
> H in Linz's scheme has to return a
> value. Now whether you interpret that value as "input never halts" or
> "input would never halt if halt's internal simulator didn't halt it" is just
> different ways of saying the same thing. To get round Linz's scheme,
> you've got to place the simulator outside of H and therefore of H_Hat.
>
> But that's cheating, of course.
>
--
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-13 10:28 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <s2isoa$7sv$1@dont-email.me> |
| In reply to | #29211 |
On 2021-03-13 09:29, olcott wrote:
> On 3/13/2021 10:00 AM, André G. Isaak wrote:
>> On 2021-03-12 15:42, olcott wrote:
>>> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>>>> On 2021-03-12 15:17, olcott wrote:
>>>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>>>> On 2021-03-12 11:23, olcott wrote:
>>>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>>>
>>>>>>>>> When Jack is asked the question:
>>>>>>>>> Will your answer to this question be no?
>>>>>>>>
>>>>>>>> You keep invoking these natural language examples as if they
>>>>>>>> were somehow pertinent. The paradoxical nature of the above
>>>>>>>> results from the deictic expression 'this'. No such expression
>>>>>>>> occurs anywhere in the Linz proof,
>>>>>>>
>>>>>>> Halts is asked to decide whether or not H_Hat would halt on
>>>>>>> itself as input.
>>>>>>
>>>>>> Halts is being asked to descide whether H_Hat would halt when
>>>>>> given a description of a TM which happens to describe itself. Why
>>>>>> should that be a problem?
>>>>>
>>>>> You know damn well that the problem is that H_Hat is defined to do
>>>>> the opposite of whatever the halt decider decides thus proving that
>>>>> H_Hat is a self-contradictory input whenever it is its own input.
>>>>
>>>> H_Hat isn't the halt decider, so why would it be
>>>> 'self-contradictory' to give H_Hat a description of itself as input?
>>>
>>> You already know why quit being a damned liar.
>>>
>>>> And your claim that 'H_Hat is defined to do the opposite of whatever
>>>> the halt decider decides' is a bit misleading.
>>>
>>> Not to people that are not damned liars:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>>> H_Hat is derived from H, but once we have created H and H_Hat, they
>>>> are fixed computations. Whatever H_Hat does is entirely independent
>>>> of H. What it does is not a response to what H does and it cannot
>>>> 'change' what it does based on what H does.
>>>
>>> H_Hat is a fixed computation that is defined to do the opposite of
>>> whatever the halt decider decides.
>>
>> No. H_Hat is a computation which takes an input string and then
>> performs certain actions in response to that input string. As far as
>> H_Hat is concerned, its input is simply a string of symbols.
>
> A fixed computation is a code/input pair.
>
> Since there is no correct decision that Halts can make on H_Hat because
> H_Hat contradicts whatever decision that Halts makes the Halts/H_Hat
> decision problem / input pair is incorrect.
>
> Contradictory decision problem / input pairs are erroneous in the same
> way that contradictory questions are erroneous.
>
> The question: Does the input halt on its input? is a contradictory
> question for Halts/H_Hat pair.
Notice that you entirely cut the entire substance of my post. If you go
back and actually read it you will see that there is no contradiction
between Halts and H_Hat. There is a contradiction between one particular
interpetation of what Halts does and H_Hat, indicating that that
particular interpretation is wrong.
> The question: Would the input program halt if the halt decider never
> stopped simulating it? is not a contradictory question for the
> Halts/H_Hat pair.
Nor is it the halting question, nor is it a well-defined question given
that you use the term 'halt decider' to refer variously to the actual
halt decider and some subset of the transitions in H_Halt which are not
the halt decider and don't purport to be one.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 11:55 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <bsGdnZROP-cUYdH9nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #29215 |
On 3/13/2021 11:28 AM, André G. Isaak wrote:
> On 2021-03-13 09:29, olcott wrote:
>> On 3/13/2021 10:00 AM, André G. Isaak wrote:
>>> On 2021-03-12 15:42, olcott wrote:
>>>> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>>>>> On 2021-03-12 15:17, olcott wrote:
>>>>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-12 11:23, olcott wrote:
>>>>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>>>>
>>>>>>>>>> When Jack is asked the question:
>>>>>>>>>> Will your answer to this question be no?
>>>>>>>>>
>>>>>>>>> You keep invoking these natural language examples as if they
>>>>>>>>> were somehow pertinent. The paradoxical nature of the above
>>>>>>>>> results from the deictic expression 'this'. No such expression
>>>>>>>>> occurs anywhere in the Linz proof,
>>>>>>>>
>>>>>>>> Halts is asked to decide whether or not H_Hat would halt on
>>>>>>>> itself as input.
>>>>>>>
>>>>>>> Halts is being asked to descide whether H_Hat would halt when
>>>>>>> given a description of a TM which happens to describe itself. Why
>>>>>>> should that be a problem?
>>>>>>
>>>>>> You know damn well that the problem is that H_Hat is defined to do
>>>>>> the opposite of whatever the halt decider decides thus proving
>>>>>> that H_Hat is a self-contradictory input whenever it is its own
>>>>>> input.
>>>>>
>>>>> H_Hat isn't the halt decider, so why would it be
>>>>> 'self-contradictory' to give H_Hat a description of itself as input?
>>>>
>>>> You already know why quit being a damned liar.
>>>>
>>>>> And your claim that 'H_Hat is defined to do the opposite of
>>>>> whatever the halt decider decides' is a bit misleading.
>>>>
>>>> Not to people that are not damned liars:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>>> H_Hat is derived from H, but once we have created H and H_Hat, they
>>>>> are fixed computations. Whatever H_Hat does is entirely independent
>>>>> of H. What it does is not a response to what H does and it cannot
>>>>> 'change' what it does based on what H does.
>>>>
>>>> H_Hat is a fixed computation that is defined to do the opposite of
>>>> whatever the halt decider decides.
>>>
>>> No. H_Hat is a computation which takes an input string and then
>>> performs certain actions in response to that input string. As far as
>>> H_Hat is concerned, its input is simply a string of symbols.
>>
>> A fixed computation is a code/input pair.
>>
>> Since there is no correct decision that Halts can make on H_Hat
>> because H_Hat contradicts whatever decision that Halts makes the
>> Halts/H_Hat decision problem / input pair is incorrect.
>>
>> Contradictory decision problem / input pairs are erroneous in the same
>> way that contradictory questions are erroneous.
>>
>> The question: Does the input halt on its input? is a contradictory
>> question for Halts/H_Hat pair.
>
> Notice that you entirely cut the entire substance of my post. If you go
> back and actually read it you will see that there is no contradiction
> between Halts and H_Hat.
Since I just proved that there is your psychological denial of my proof
does not actually form any rebuttal.
I rewrote all of the prose of this post from scratch and also changed
the infinite recursion detection criteria back to its original.
http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-13 11:25 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <s2j03j$1r0$1@dont-email.me> |
| In reply to | #29217 |
On 2021-03-13 10:55, olcott wrote: > On 3/13/2021 11:28 AM, André G. Isaak wrote: >> Notice that you entirely cut the entire substance of my post. If you >> go back and actually read it you will see that there is no >> contradiction between Halts and H_Hat. Wow! What a dishonest place to cut, especially given that I was commenting on your previous cut. You rather deliberately omitted the immediately following sentence which read: "There is a contradiction between one particular interpetation of what Halts does and H_Hat, indicating that that particular interpretation is wrong. " Perhaps you'd like to comment on that line rather than accuse me of "pathological denial". André > Since I just proved that there is your psychological denial of my proof > does not actually form any rebuttal. > > I rewrote all of the prose of this post from scratch and also changed > the infinite recursion detection criteria back to its original. > > http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-13 12:38 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <cIudnUQebfAxm9D9nZ2dnUU78avNnZ2d@giganews.com> |
| In reply to | #29220 |
On 3/13/2021 12:25 PM, André G. Isaak wrote: > On 2021-03-13 10:55, olcott wrote: >> On 3/13/2021 11:28 AM, André G. Isaak wrote: > >>> Notice that you entirely cut the entire substance of my post. If you >>> go back and actually read it you will see that there is no >>> contradiction between Halts and H_Hat. > > Wow! What a dishonest place to cut, especially given that I was > commenting on your previous cut. You rather deliberately omitted the > immediately following sentence which read: > You are basically say that I ignored your necessarily (modal logic) incorrect reasoning. If your reasoning concludes that dogs are cats I don't have to look at any of the details to know it is wrong. > "There is a contradiction between one particular interpetation of what > Halts does and H_Hat, indicating that that particular interpretation is > wrong. " Weasel words. Halts only gets the wrong answer because the question is defined to contradict every answer that halt can provide. I explain all these detail more thoroughly here: http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > Perhaps you'd like to comment on that line rather than accuse me of > "pathological denial". > > André > >> Since I just proved that there is your psychological denial of my >> proof does not actually form any rebuttal. >> >> I rewrote all of the prose of this post from scratch and also changed >> the infinite recursion detection criteria back to its original. >> >> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >> >> > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-13 12:51 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <s2j53h$56r$1@dont-email.me> |
| In reply to | #29222 |
On 2021-03-13 11:38, olcott wrote: > On 3/13/2021 12:25 PM, André G. Isaak wrote: >> On 2021-03-13 10:55, olcott wrote: >>> On 3/13/2021 11:28 AM, André G. Isaak wrote: >> >>>> Notice that you entirely cut the entire substance of my post. If you >>>> go back and actually read it you will see that there is no >>>> contradiction between Halts and H_Hat. >> >> Wow! What a dishonest place to cut, especially given that I was >> commenting on your previous cut. You rather deliberately omitted the >> immediately following sentence which read: >> > > You are basically say that I ignored your necessarily (modal logic) > incorrect reasoning. If your reasoning concludes that dogs are cats I > don't have to look at any of the details to know it is wrong. Nothing in my post involved modal logic. Stop throwing around terms that you don't understand. If you have some specific objection to my argument then state it. Simply claiming that it is 'necessarily incorrect reasoning' says absolutely nothing. >> "There is a contradiction between one particular interpetation of what >> Halts does and H_Hat, indicating that that particular interpretation >> is wrong. " > > Weasel words. > Halts only gets the wrong answer because the question is defined to > contradict every answer that halt can provide. Halts performs the computation that it performs. It gives the correct answer to that computation. Whether that computation actually corresponds to some desired question is an independent matter. André > I explain all these detail more thoroughly here: > > http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > > >> Perhaps you'd like to comment on that line rather than accuse me of >> "pathological denial". >> >> André >> >>> Since I just proved that there is your psychological denial of my >>> proof does not actually form any rebuttal. >>> >>> I rewrote all of the prose of this post from scratch and also changed >>> the infinite recursion detection criteria back to its original. >>> >>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>> >>> >> >> > > -- 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 16:00 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <WXt3I.28767$Ql5.18128@fx33.iad> |
| In reply to | #29211 |
On 3/13/21 11:29 AM, olcott wrote:
> On 3/13/2021 10:00 AM, André G. Isaak wrote:
>> On 2021-03-12 15:42, olcott wrote:
>>> On 3/12/2021 4:31 PM, André G. Isaak wrote:
>>>> On 2021-03-12 15:17, olcott wrote:
>>>>> On 3/12/2021 1:42 PM, André G. Isaak wrote:
>>>>>> On 2021-03-12 11:23, olcott wrote:
>>>>>>> On 3/12/2021 12:20 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-12 11:02, olcott wrote:
>>>>>>>>
>>>>>>>>> When Jack is asked the question:
>>>>>>>>> Will your answer to this question be no?
>>>>>>>>
>>>>>>>> You keep invoking these natural language examples as if they
>>>>>>>> were somehow pertinent. The paradoxical nature of the above
>>>>>>>> results from the deictic expression 'this'. No such expression
>>>>>>>> occurs anywhere in the Linz proof,
>>>>>>>
>>>>>>> Halts is asked to decide whether or not H_Hat would halt on
>>>>>>> itself as input.
>>>>>>
>>>>>> Halts is being asked to descide whether H_Hat would halt when
>>>>>> given a description of a TM which happens to describe itself. Why
>>>>>> should that be a problem?
>>>>>
>>>>> You know damn well that the problem is that H_Hat is defined to do
>>>>> the opposite of whatever the halt decider decides thus proving that
>>>>> H_Hat is a self-contradictory input whenever it is its own input.
>>>>
>>>> H_Hat isn't the halt decider, so why would it be
>>>> 'self-contradictory' to give H_Hat a description of itself as input?
>>>
>>> You already know why quit being a damned liar.
>>>
>>>> And your claim that 'H_Hat is defined to do the opposite of whatever
>>>> the halt decider decides' is a bit misleading.
>>>
>>> Not to people that are not damned liars:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>>> H_Hat is derived from H, but once we have created H and H_Hat, they
>>>> are fixed computations. Whatever H_Hat does is entirely independent
>>>> of H. What it does is not a response to what H does and it cannot
>>>> 'change' what it does based on what H does.
>>>
>>> H_Hat is a fixed computation that is defined to do the opposite of
>>> whatever the halt decider decides.
>>
>> No. H_Hat is a computation which takes an input string and then
>> performs certain actions in response to that input string. As far as
>> H_Hat is concerned, its input is simply a string of symbols.
>
> A fixed computation is a code/input pair.
>
> Since there is no correct decision that Halts can make on H_Hat because
> H_Hat contradicts whatever decision that Halts makes the Halts/H_Hat
> decision problem / input pair is incorrect.
>
> Contradictory decision problem / input pairs are erroneous in the same
> way that contradictory questions are erroneous.
As I have said, there is no such thing as an erroneous input the way you
are using it. Inputs are either within the domain of the computation or
not. You might call inputs not within the domain of the computation as
erroneous, but for the computation in question, the domain is
specifically defined as ALL Turing Machines. H^ IS a Turing Machine (at
least if H is). Thus it is in the domain.
Basically, you are trying to redefine 'Universal' to mean, rather than
ANY Turing Machine, to be any machine I can answer right. That makes the
definition worthless, as ANY decider could be called a Universally
Correct Decider if it could constrain the input domain to only those
answers it gets right.
>
> The question: Does the input halt on its input? is a contradictory
> question for Halts/H_Hat pair.
>
> The question: Would the input program halt if the halt decider never
> stopped simulating it? is not a contradictory question for the
> Halts/H_Hat pair.
>
>
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-12 16:39 -0800 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <6e6b42a8-8bc9-435c-b16c-ff2c388c1c99n@googlegroups.com> |
| In reply to | #29188 |
On Friday, 12 March 2021 at 19:42:23 UTC, André G. Isaak wrote: > On 2021-03-12 11:23, olcott wrote: > > On 3/12/2021 12:20 PM, André G. Isaak wrote: > >> On 2021-03-12 11:02, olcott wrote: > >> > >>> When Jack is asked the question: > >>> Will your answer to this question be no? > >> > >> You keep invoking these natural language examples as if they were > >> somehow pertinent. The paradoxical nature of the above results from > >> the deictic expression 'this'. No such expression occurs anywhere in > >> the Linz proof, > > > > Halts is asked to decide whether or not H_Hat would halt on itself as > > input. > Halts is being asked to descide whether H_Hat would halt when given a > description of a TM which happens to describe itself. Why should that be > a problem? > > A compiler can compile its own source code. Why should H_Hat not be > given a description which describes a TM which is identical to itself? > Let's say the compiler puts executables directly into the /bin directory. Let's also say that the system doesn't allow us to overwrite a program which is running. Now we've set up an insoluble problem.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-12 23:20 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <G4X2I.31692$GI5.16481@fx43.iad> |
| In reply to | #29183 |
On 3/12/21 1:23 PM, olcott wrote: > > Halts is asked to decide whether or not H_Hat would halt on itself as > input. No it isn't First we build a Turing Machine H^ from the definition of Halts Then we take the Halts Turing machine and prepare a tape on which we first put the representation of H^ (in the form specified by Halts for its input) and then we put a second copy of the representaton of H^ There is no 'this' in the description or two things that need to be kept the same by Halts, we just give it two copies of something. No Self-Reference in the problem provided. Halts is just asked to perform its calculation on a data string. It doesn't need to know that the string was built based on its design (and in fact, that would actualy be very hard for it to discover) H^ doesn't care that the second copy matches itself, it is just going to process it like any other input. The only effect of the 'Self-Reference' was in how we constructed things, and that doesn't present any difficulties for making the representation.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-13 00:34 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <87mtv7c2mt.fsf@bsb.me.uk> |
| In reply to | #29152 |
olcott <NoOne@NoWhere.com> writes:
> On 3/11/2021 7:06 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 3/11/2021 6:06 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 3/10/2021 7:45 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>>>> When-so-ever any question or undecidable instance of a decision
>>>>>>> problem lacks a correct answer / return value because every answer
>>>>>>> provided or value returned is contradicted, this question /
>>>>>>> undecidable instance is erroneous.
>>>>>>
>>>>>> None of the undecidable problems has any undecidable cases. Every
>>>>>> instance (AKA case) of every decision problem has a correct yes/no answer.
>>>>>
>>>>> Now I can use proper terms. Undecidable inputs to a decision problems
>>>>> are not a truth bearers.
>>>>
>>>> There are no undecidable inputs to any of decision problems I listed.
>>>> (And you are misusing the term "truth bearer".)
>>>
>>> Inputs to decision problems that cannot be resolved to be true or
>>> false because they are defined to be self-contradictory would not be
>>> truth bearers.
>>
>> Saying words does not alter facts. Even saying Very Technical Sounding
>> Words does not alter facts. There are no undecidable inputs to any of
>> decision problems I listed; every instance has a correct yes/no answer.
>>
>
> https://en.wikipedia.org/wiki/Stipulative_definition
>
> I am stipulating that the whole Halts/H_Hat thing where H_Hat is
> defined to do the opposite of whatever Halts decides will be called
> self-contradictory inputs.
Be my guest. No one will care, but unfortunately, you won't be able to
understand why they won't care. And though I'm not inclined to try to
explain, the key fact is that this set of cases is also undecidable.
>>> I may have not used exactly the right terminology none-the-less the
>>> whole idea that Halts() cannot correctly decide H_Hat() because H_Hat
>>> has been defined to do the opposite of whatever Halts() decides is an
>>> instance of a THING_X that has been defined to contradict whatever
>>> decision that THING_Y makes, thus making this instance of THING_Z not
>>> a bearer of truth.
>>
>> I think you may just be saying that Halts gets the wrong answer.
>
> No that is not freaking what I have been frigging say to you since 2006.
> self-contradictory inputs are errors.
Yet every input has a correct yes/no answer! The fact that some TM that
is not a halt-decider (there are no halt deciders) gets the wrong answer
does not change the fact that there /is/ a correct answer. The cases
you don't like all either halt or don't halt. Changing what you will
call "the right answer" for some instances has no effect on the question
of whether that instance is a halting computation or not. All you've
done is give a new undecidable set ("incorrect inputs") a silly name.
No one will care. If you want to write a paper, choose a journal of
theology and explain why you think you are god.
And, yes, you've been saying pretty much the same sill things for years.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-12 20:10 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <JImdnYIgA-O6gtH9nZ2dnUU7-XvNnZ2d@giganews.com> |
| In reply to | #29198 |
On 3/12/2021 6:34 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 3/11/2021 7:06 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 3/11/2021 6:06 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 3/10/2021 7:45 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>>>> When-so-ever any question or undecidable instance of a decision >>>>>>>> problem lacks a correct answer / return value because every answer >>>>>>>> provided or value returned is contradicted, this question / >>>>>>>> undecidable instance is erroneous. >>>>>>> >>>>>>> None of the undecidable problems has any undecidable cases. Every >>>>>>> instance (AKA case) of every decision problem has a correct yes/no answer. >>>>>> >>>>>> Now I can use proper terms. Undecidable inputs to a decision problems >>>>>> are not a truth bearers. >>>>> >>>>> There are no undecidable inputs to any of decision problems I listed. >>>>> (And you are misusing the term "truth bearer".) >>>> >>>> Inputs to decision problems that cannot be resolved to be true or >>>> false because they are defined to be self-contradictory would not be >>>> truth bearers. >>> >>> Saying words does not alter facts. Even saying Very Technical Sounding >>> Words does not alter facts. There are no undecidable inputs to any of >>> decision problems I listed; every instance has a correct yes/no answer. >>> >> >> https://en.wikipedia.org/wiki/Stipulative_definition >> >> I am stipulating that the whole Halts/H_Hat thing where H_Hat is >> defined to do the opposite of whatever Halts decides will be called >> self-contradictory inputs. > > Be my guest. No one will care, but unfortunately, you won't be able to > understand why they won't care. And though I'm not inclined to try to > explain, the key fact is that this set of cases is also undecidable. > >>>> I may have not used exactly the right terminology none-the-less the >>>> whole idea that Halts() cannot correctly decide H_Hat() because H_Hat >>>> has been defined to do the opposite of whatever Halts() decides is an >>>> instance of a THING_X that has been defined to contradict whatever >>>> decision that THING_Y makes, thus making this instance of THING_Z not >>>> a bearer of truth. >>> >>> I think you may just be saying that Halts gets the wrong answer. >> >> No that is not freaking what I have been frigging say to you since 2006. >> self-contradictory inputs are errors. > > Yet every input has a correct yes/no answer! You just really really want to be a jackass. When we ask Jack the question: Will your answer to this question be no? (1) There is no possible correct answer Jack can provide. (2) There is a possible correct answer from anyone besides Jack. (3) Thus proving that the context of who answers the question defines distinctly different questions. When Halts is asked: Does H_Hat halt on its input? This is analogous to the question posed to Jack. (1) There is no possible correct answer Halts can provide. (2) There is a possible correct answer from other functions besides Halts. You keep saying that (1) and (2) are exactly the same thing and at this point I can't count it as anything besides intentional dishonestly on the basis of malevolence. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-13 04:08 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <20210312195351.270@kylheku.com> |
| In reply to | #29201 |
On 2021-03-13, olcott <NoOne@NoWhere.com> wrote: > When Halts is asked: > Does H_Hat halt on its input? > This is analogous to the question posed to Jack. > (1) There is no possible correct answer Halts can provide. Since Halts is a function, it can provide exactly one answer. > (2) There is a possible correct answer from other functions besides Halts. Well, at least you finally accept (2). But of those other functions, those which return the correct answer also cannot possibly return any other answer but the correct one! And those that return the wrong answer also cannot return any other answer but that wrong one. Every function is stuck with the answer that it provides, by the definition of function. That is why Halt's situation isn't special in any way; it's just a function that is wrong, and stuck that way, just like every other function that is stuck with its particular answer. The halting problem proof just says that something is the way it is. If we make this H_Hat program which is based on the decider in a particular way based on the recipe, then we reliably obtain a test case that reproduces a wrong answer. This can all be constructed in working code. You cannot disagree with the *existence* of real objects object involved in a real situation that can be constructed in the real world. It's like shaking your fist at 13 being prime. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-12 22:51 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <JPydnTDGWeJ82dH9nZ2dnUU7-fXNnZ2d@giganews.com> |
| In reply to | #29202 |
On 3/12/2021 10:08 PM, Kaz Kylheku wrote:
> On 2021-03-13, olcott <NoOne@NoWhere.com> wrote:
>> When Halts is asked:
>> Does H_Hat halt on its input?
>> This is analogous to the question posed to Jack.
>> (1) There is no possible correct answer Halts can provide.
>
> Since Halts is a function, it can provide exactly one answer.
If Halts returns True it is wrong
If Halts returns False it is wrong
Because H_Hat() is defined to do the opposite of whatever Halts decides.
>> (2) There is a possible correct answer from other functions besides Halts.
>
> Well, at least you finally accept (2).
>
> But of those other functions, those which return the correct answer also
> cannot possibly return any other answer but the correct one!
You are defining your terms differently that I am.
If we are using your definitions then Add() can only return a single
value. I say that Add returns 2^32 different values.
u32 Add(u32 X, u32 Y)
{
return X + Y;
}
> And those that return the wrong answer also cannot return any other
> answer but that wrong one.
Every decision problem that has certain inputs that contradict the
decision of the decider are incorrect inputs.
That you cannot look this up in a book does not make me wrong.
> Every function is stuck with the answer that it provides, by the
> definition of function.
You are saying that a function and its inputs are a function.
That is not the way that software engineering does it.
> That is why Halt's situation isn't special in any way; it's just a
> function that is wrong,
It is wrong in the same (incorrect question) way that both yes and no
are both wrong annwers to the question: What time is it (yes or no)?
When yes and no are the wrong answer to any yes/no question then the
question is incorrect.
The fact that both yes and not are the wrong answer for Halts/H_Hat and
other computations can get the right answer for Halts/H_Hat conclusively
proves that "Does the input halt on its input?"
IS NOT THE SAME QUESTION for Halts as it is for other computations.
Ben say of course it is because they have the exact same words.
I say they are not because they don't have the same correct answer.
I say they are not because they don't have the same correct answer.
I say they are not because they don't have the same correct answer.
I say they are not because they don't have the same correct answer.
I say they are not because they don't have the same correct answer.
The question: "Does the input program halt on its input?"
is not the same question for Halts as it is for other computations
because this "same question" has different correct answers.
The question: "Does the input program halt on its input?"
is not the same question for Halts as it is for other computations
because this "same question" has different correct answers.
The question: "Does the input program halt on its input?"
is not the same question for Halts as it is for other computations
because this "same question" has different correct answers.
The question: "Does the input program halt on its input?"
is not the same question for Halts as it is for other computations
because this "same question" has different correct answers.
> and stuck that way, just like every other
> function that is stuck with its particular answer.
>
> The halting problem proof just says that something is the way it is.
> If we make this H_Hat program which is based on the decider in
> a particular way based on the recipe, then we reliably obtain
> a test case that reproduces a wrong answer.
Only because the question is incorrect.
> This can all be constructed in working code.
>
> You cannot disagree with the *existence* of real objects object involved
> in a real situation that can be constructed in the real world.
>
> It's like shaking your fist at 13 being prime.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-13 23:53 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <20210313121906.371@kylheku.com> |
| In reply to | #29204 |
On 2021-03-13, olcott <NoOne@NoWhere.com> wrote:
> On 3/12/2021 10:08 PM, Kaz Kylheku wrote:
>> On 2021-03-13, olcott <NoOne@NoWhere.com> wrote:
>>> When Halts is asked:
>>> Does H_Hat halt on its input?
>>> This is analogous to the question posed to Jack.
>>> (1) There is no possible correct answer Halts can provide.
>>
>> Since Halts is a function, it can provide exactly one answer.
>
> If Halts returns True it is wrong
> If Halts returns False it is wrong
> Because H_Hat() is defined to do the opposite of whatever Halts decides.
>
>>> (2) There is a possible correct answer from other functions besides Halts.
>>
>> Well, at least you finally accept (2).
>>
>> But of those other functions, those which return the correct answer also
>> cannot possibly return any other answer but the correct one!
>
> You are defining your terms differently that I am.
>
> If we are using your definitions then Add() can only return a single
> value. I say that Add returns 2^32 different values.
>
> u32 Add(u32 X, u32 Y)
> {
> return X + Y;
> }
Obviously, what I mean is that the function returns a specific
value for a specific set of inputs. Add(1, 3) returns 4,
and cannot return anything else. If we have some F such that F(1, 3)
returns 5, it cannot be that F = Add. Returning 5 isn't something
Add(1, 3) "can" do.
Same as Halts(H_Hat, H_Hat).
When the arguments are all determined, the output of the
fucntion is determined; all questions of what it "can"
return are settled.
>
>> And those that return the wrong answer also cannot return any other
>> answer but that wrong one.
>
> Every decision problem that has certain inputs that contradict the
> decision of the decider are incorrect inputs.
You need to make up your mind: are the inputs "incorrect" or
is decision problem "incorrect"?
You don't have a convincing argument that there is anything wrong
with "does program P halt on input I?"
Just because a program written to answer the question can always be
provided with a sure-fire counterexample doesn't mean that the question
is poor.
THis is just the nature of the game. The question is *about* computation,
right? And the decider algorithms are *made of* computation. So that is
why the situation arises. The algorithms are computing something that
is about computation, which means that htey fall into the domain of the
question they are trying to answer.
This entanglement is inextricable.
> That you cannot look this up in a book does not make me wrong.
>
>> Every function is stuck with the answer that it provides, by the
>> definition of function.
>
> You are saying that a function and its inputs are a function.
(Although that is true, at the present I am not.
Whenever we determine an input to a function, we get a new function
whose arity is one lower.
If we take Add(x, y) and determine the argument x as being 1,
we get new one-argument function lambda(y), which adds 1 to y.
If we determine the y, we get a zero-argument function, which just
denotes one specific value.)
>> That is why Halt's situation isn't special in any way; it's just a
>> function that is wrong,
>
> It is wrong in the same (incorrect question) way that both yes and no
> are both wrong annwers to the question: What time is it (yes or no)?
I don't see any sort of such type problem anywhere. The halting question
is Boolean and so are the deciders trying to calculate it.
> When yes and no are the wrong answer to any yes/no question then the
> question is incorrect.
They aren't; one of those is always the right answer. P either halts on
its input, or else it doesn't.
> The fact that both yes and not are the wrong answer for Halts/H_Hat and
Exactly one of those is the right answer.
You're confusing yourself by imaginging changing definitions of
Halts and H_Hat, but calling them by all the same names.
Nobody in CS academia will even begin to take your so-called "work"
seriously until you either start using different names for different
instances of entities, or else formalize those names as denoting *sets*,
and give those sets the proper treatment, rather than pretending
that sets are instances.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott2@gmail.com> |
|---|---|
| Date | 2021-03-13 18:20 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <s2jkst$gkv$1@dont-email.me> |
| In reply to | #29240 |
On 3/13/2021 5:53 PM, Kaz Kylheku wrote:
> On 2021-03-13, olcott <NoOne@NoWhere.com> wrote:
>> On 3/12/2021 10:08 PM, Kaz Kylheku wrote:
>>> On 2021-03-13, olcott <NoOne@NoWhere.com> wrote:
>>>> When Halts is asked:
>>>> Does H_Hat halt on its input?
>>>> This is analogous to the question posed to Jack.
>>>> (1) There is no possible correct answer Halts can provide.
>>>
>>> Since Halts is a function, it can provide exactly one answer.
>>
>> If Halts returns True it is wrong
>> If Halts returns False it is wrong
>> Because H_Hat() is defined to do the opposite of whatever Halts decides.
>>
>>>> (2) There is a possible correct answer from other functions besides Halts.
>>>
>>> Well, at least you finally accept (2).
>>>
>>> But of those other functions, those which return the correct answer also
>>> cannot possibly return any other answer but the correct one!
>>
>> You are defining your terms differently that I am.
>>
>> If we are using your definitions then Add() can only return a single
>> value. I say that Add returns 2^32 different values.
>>
>> u32 Add(u32 X, u32 Y)
>> {
>> return X + Y;
>> }
>
> Obviously, what I mean is that the function returns a specific
> value for a specific set of inputs. Add(1, 3) returns 4,
> and cannot return anything else. If we have some F such that F(1, 3)
> returns 5, it cannot be that F = Add. Returning 5 isn't something
> Add(1, 3) "can" do.
>
> Same as Halts(H_Hat, H_Hat).
>
> When the arguments are all determined, the output of the
> fucntion is determined; all questions of what it "can"
> return are settled.
>>
>>> And those that return the wrong answer also cannot return any other
>>> answer but that wrong one.
>>
>> Every decision problem that has certain inputs that contradict the
>> decision of the decider are incorrect inputs.
>
> You need to make up your mind: are the inputs "incorrect" or
> is decision problem "incorrect"?
>
> You don't have a convincing argument that there is anything wrong
> with "does program P halt on input I?"
>
> Just because a program written to answer the question can always be
> provided with a sure-fire counterexample doesn't mean that the question
> is poor.
>
> THis is just the nature of the game. The question is *about* computation,
> right? And the decider algorithms are *made of* computation. So that is
> why the situation arises. The algorithms are computing something that
> is about computation, which means that htey fall into the domain of the
> question they are trying to answer.
>
> This entanglement is inextricable.
>
>> That you cannot look this up in a book does not make me wrong.
>>
>>> Every function is stuck with the answer that it provides, by the
>>> definition of function.
>>
>> You are saying that a function and its inputs are a function.
>
> (Although that is true, at the present I am not.
>
> Whenever we determine an input to a function, we get a new function
> whose arity is one lower.
>
> If we take Add(x, y) and determine the argument x as being 1,
> we get new one-argument function lambda(y), which adds 1 to y.
>
> If we determine the y, we get a zero-argument function, which just
> denotes one specific value.)
>
>>> That is why Halt's situation isn't special in any way; it's just a
>>> function that is wrong,
>>
>> It is wrong in the same (incorrect question) way that both yes and no
>> are both wrong annwers to the question: What time is it (yes or no)?
>
> I don't see any sort of such type problem anywhere. The halting question
> is Boolean and so are the deciders trying to calculate it.
>
>> When yes and no are the wrong answer to any yes/no question then the
>> question is incorrect.
>
> They aren't; one of those is always the right answer. P either halts on
> its input, or else it doesn't.
>
>> The fact that both yes and not are the wrong answer for Halts/H_Hat and
>
> Exactly one of those is the right answer.
There is no correct yes/no value that any decider can ever return to an
input that does the opposite of whatever the decider decides.
You know this I know this so I don't understand why you lie about this.
>
> You're confusing yourself by imaginging changing definitions of
> Halts and H_Hat, but calling them by all the same names.
>
> Nobody in CS academia will even begin to take your so-called "work"
> seriously until you either start using different names for different
> instances of entities, or else formalize those names as denoting *sets*,
> and give those sets the proper treatment, rather than pretending
> that sets are instances.
>
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 21:54 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs](Jack's question) |
| Message-ID | <lVe3I.1476$hS4.235@fx09.iad> |
| In reply to | #29242 |
On 3/13/21 7:20 PM, olcott wrote: > There is no correct yes/no value that any decider can ever return to an > input that does the opposite of whatever the decider decides. > Yes, if a decider needs to decide on something that has the ability to act counter to it, is one way to prove that such a decider can't exist. The is in part due to the general need to actually define the computation of the decider before you need to create the problem to solve, so the problem may be able to 'rig' the game. If you can create such problem, for any given decider, then you have shown that for all possible deciders there is something they can't decide, and thus no decider can be correct for all problems. There is NO rule that says any given decider question needs to be able to be decided for all questions. Now, if you are working in a logic system where things are only true if you can prove the answer (and thus are decidable) then that logic system can't fully handle that problem. If the question is one you want answered, then the fault isn't the problem but the logic system. To note, the system you are trying to use is know to not to be able to handle this level of problem, it can't fully decribe the properties of the whole numbers, so it can't handle computaton theory, so no halting problem. Not the problem of the halting problem, but the attempting to use too weak of a tool for a tough problem.
[toc] | [prev] | [next] | [standalone]
Page 7 of 23 — ← Prev page 1 … 5 6 [7] 8 9 … 23 Next page →
Back to top | Article view | comp.theory
csiph-web