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 5 of 23 — ← Prev page 1 … 3 4 [5] 6 7 … 23 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-12 01:02 +0000 |
| Message-ID | <87a6r9chge.fsf@bsb.me.uk> |
| In reply to | #29145 |
olcott <NoOne@NoWhere.com> writes: > On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> When a decision problem is defined such that both truth values are >>> contradicted for certain inputs these inputs are not truth bearers for >>> this decision problem. >> >> Problems don't have "inputs" they have instances, and for all the >> undecidable problems I listed, every "input" (AKA instance) has a >> correct yes/no answer. Calling this these non-existent things "not >> truth bearers" just shows you don't know what you are talking about. > > The whole Halts/H_Hat thing is an instance of H_Hat being defined to > contradict whatever decision that Halts makes thus making whatever > this Halts/H_Hat thing is called not a truth bearer thing. That's a misuse of the term "truth bearer" but I don't want to argue about words with you; you will never stop abusing technical terms. What matters is that, regardless of what /you/ call some of them, all instances of the halting problem have a correct yes/no answer. Will you ever agree with this simple fact? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 20:35 -0600 |
| Message-ID | <Fa2dnScoDZwaTtf9nZ2dnUU78KXNnZ2d@giganews.com> |
| In reply to | #29147 |
On 3/11/2021 7:02 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> When a decision problem is defined such that both truth values are >>>> contradicted for certain inputs these inputs are not truth bearers for >>>> this decision problem. >>> >>> Problems don't have "inputs" they have instances, and for all the >>> undecidable problems I listed, every "input" (AKA instance) has a >>> correct yes/no answer. Calling this these non-existent things "not >>> truth bearers" just shows you don't know what you are talking about. >> >> The whole Halts/H_Hat thing is an instance of H_Hat being defined to >> contradict whatever decision that Halts makes thus making whatever >> this Halts/H_Hat thing is called not a truth bearer thing. > > That's a misuse of the term "truth bearer" but I don't want to argue > about words with you; you will never stop abusing technical terms. What > matters is that, regardless of what /you/ call some of them, all > instances of the halting problem have a correct yes/no answer. Will you > ever agree with this simple fact? > https://en.wikipedia.org/wiki/Stipulative_definition It will be stipulated that a Jabberwocky is: the whole Halts/H_Hat thing where H_Hat is defined to do the opposite of whatever Halts decides. If there is a preexisitng technical name for this I will use that as soon as I know what it is. -- 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-11 19:36 -0700 |
| Message-ID | <s2ek47$ofq$1@dont-email.me> |
| In reply to | #29145 |
On 2021-03-11 17:22, olcott wrote: > On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> When a decision problem is defined such that both truth values are >>> contradicted for certain inputs these inputs are not truth bearers for >>> this decision problem. >> >> Problems don't have "inputs" they have instances, and for all the >> undecidable problems I listed, every "input" (AKA instance) has a >> correct yes/no answer. Calling this these non-existent things "not >> truth bearers" just shows you don't know what you are talking about. >> > > The whole Halts/H_Hat thing is an instance of H_Hat being defined to > contradict whatever decision that Halts makes thus making whatever this > Halts/H_Hat thing is called not a truth bearer thing. > > When any expression of formal or natural language is not a truth bearer > this excludes this expression of language from membership in any formal > or informal logical system. You're descending into gibberish here. A 'truth-bearer' is simply a statement, i.e. a declarative sentence, i.e. a proposition. I can't make heads or tails of exactly what it is that you want to exclude from the set of truth-bearers, but all of the possibilities I can come up with are things that no one has ever claimed are truth-bearers to begin with. Turing Machines are not truth bearers. No one has claimed they are. Problems are not truth bearers. No one has claimed they are. Problem instances are not truth bearers. No one has claimed they are. The relationship between H and H_Hat is not a truth bearer. No one has claimed it is. So what exactly is it that you are attempting to exclude from the set of truth bearers? 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-11 20:48 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <Nr2dnVpVNbgPS9f9nZ2dnUU7-U3NnZ2d@giganews.com> |
| In reply to | #29151 |
On 3/11/2021 8:36 PM, André G. Isaak wrote: > On 2021-03-11 17:22, olcott wrote:S >> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> When a decision problem is defined such that both truth values are >>>> contradicted for certain inputs these inputs are not truth bearers for >>>> this decision problem. >>> >>> Problems don't have "inputs" they have instances, and for all the >>> undecidable problems I listed, every "input" (AKA instance) has a >>> correct yes/no answer. Calling this these non-existent things "not >>> truth bearers" just shows you don't know what you are talking about. >>> >> >> The whole Halts/H_Hat thing is an instance of H_Hat being defined to >> contradict whatever decision that Halts makes thus making whatever >> this Halts/H_Hat thing is called not a truth bearer thing. >> >> When any expression of formal or natural language is not a truth >> bearer this excludes this expression of language from membership in >> any formal or informal logical system. > > You're descending into gibberish here. > > A 'truth-bearer' is simply a statement, i.e. a declarative sentence, > i.e. a proposition. > > I can't make heads or tails of exactly what it is that you want to > exclude from the set of truth-bearers, but all of the possibilities I > can come up with are things that no one has ever claimed are > truth-bearers to begin with. > > Turing Machines are not truth bearers. No one has claimed they are. > > Problems are not truth bearers. No one has claimed they are. > > Problem instances are not truth bearers. No one has claimed they are. > > The relationship between H and H_Hat is not a truth bearer. No one has > claimed it is. > > So what exactly is it that you are attempting to exclude from the set of > truth bearers? > > André > 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. Self-contradictory inputs are erroneous inputs. -- 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-11 20:13 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <s2em88$9ar$1@dont-email.me> |
| In reply to | #29153 |
On 2021-03-11 19:48, olcott wrote: > On 3/11/2021 8:36 PM, André G. Isaak wrote: >> On 2021-03-11 17:22, olcott wrote:S >>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> When a decision problem is defined such that both truth values are >>>>> contradicted for certain inputs these inputs are not truth bearers for >>>>> this decision problem. >>>> >>>> Problems don't have "inputs" they have instances, and for all the >>>> undecidable problems I listed, every "input" (AKA instance) has a >>>> correct yes/no answer. Calling this these non-existent things "not >>>> truth bearers" just shows you don't know what you are talking about. >>>> >>> >>> The whole Halts/H_Hat thing is an instance of H_Hat being defined to >>> contradict whatever decision that Halts makes thus making whatever >>> this Halts/H_Hat thing is called not a truth bearer thing. >>> >>> When any expression of formal or natural language is not a truth >>> bearer this excludes this expression of language from membership in >>> any formal or informal logical system. >> >> You're descending into gibberish here. >> >> A 'truth-bearer' is simply a statement, i.e. a declarative sentence, >> i.e. a proposition. >> >> I can't make heads or tails of exactly what it is that you want to >> exclude from the set of truth-bearers, but all of the possibilities I >> can come up with are things that no one has ever claimed are >> truth-bearers to begin with. >> >> Turing Machines are not truth bearers. No one has claimed they are. >> >> Problems are not truth bearers. No one has claimed they are. >> >> Problem instances are not truth bearers. No one has claimed they are. >> >> The relationship between H and H_Hat is not a truth bearer. No one has >> claimed it is. >> >> So what exactly is it that you are attempting to exclude from the set >> of truth bearers? >> >> André >> > > 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. And I will stipulate that any integer larger than 12 will be called an irrational number. Stipulating that X is Y does not make X Y. > Self-contradictory inputs are erroneous inputs. What exactly does it mean for an 'input' to be self-contradictory? The input to H is simply any computation. I have no idea what it would mean for a computation to be self-contradictory. 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-11 21:22 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <ebydnYEEa__kQ9f9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #29156 |
On 3/11/2021 9:13 PM, André G. Isaak wrote: > On 2021-03-11 19:48, olcott wrote: >> On 3/11/2021 8:36 PM, André G. Isaak wrote: >>> On 2021-03-11 17:22, olcott wrote:S >>>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> When a decision problem is defined such that both truth values are >>>>>> contradicted for certain inputs these inputs are not truth bearers >>>>>> for >>>>>> this decision problem. >>>>> >>>>> Problems don't have "inputs" they have instances, and for all the >>>>> undecidable problems I listed, every "input" (AKA instance) has a >>>>> correct yes/no answer. Calling this these non-existent things "not >>>>> truth bearers" just shows you don't know what you are talking about. >>>>> >>>> >>>> The whole Halts/H_Hat thing is an instance of H_Hat being defined to >>>> contradict whatever decision that Halts makes thus making whatever >>>> this Halts/H_Hat thing is called not a truth bearer thing. >>>> >>>> When any expression of formal or natural language is not a truth >>>> bearer this excludes this expression of language from membership in >>>> any formal or informal logical system. >>> >>> You're descending into gibberish here. >>> >>> A 'truth-bearer' is simply a statement, i.e. a declarative sentence, >>> i.e. a proposition. >>> >>> I can't make heads or tails of exactly what it is that you want to >>> exclude from the set of truth-bearers, but all of the possibilities I >>> can come up with are things that no one has ever claimed are >>> truth-bearers to begin with. >>> >>> Turing Machines are not truth bearers. No one has claimed they are. >>> >>> Problems are not truth bearers. No one has claimed they are. >>> >>> Problem instances are not truth bearers. No one has claimed they are. >>> >>> The relationship between H and H_Hat is not a truth bearer. No one >>> has claimed it is. >>> >>> So what exactly is it that you are attempting to exclude from the set >>> of truth bearers? >>> >>> André >>> >> >> 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. > > And I will stipulate that any integer larger than 12 will be called an > irrational number. > > Stipulating that X is Y does not make X Y. > >> Self-contradictory inputs are erroneous inputs. > > What exactly does it mean for an 'input' to be self-contradictory? > > The input to H is simply any computation. I have no idea what it would > mean for a computation to be self-contradictory. > > André > I already explained it and you very obviously don't want to get it. The combination where H_Hat (or any other other input) is defined to do the opposite of whatever Halts (or any other decider) decides is a self-contradictory input. Self-contradictory inputs are erroneous inputs. -- 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-11 21:16 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <s2epvq$2fq$1@dont-email.me> |
| In reply to | #29157 |
On 2021-03-11 20:22, olcott wrote: > On 3/11/2021 9:13 PM, André G. Isaak wrote: >> On 2021-03-11 19:48, olcott wrote: >>> On 3/11/2021 8:36 PM, André G. Isaak wrote: >>>> On 2021-03-11 17:22, olcott wrote:S >>>>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> When a decision problem is defined such that both truth values are >>>>>>> contradicted for certain inputs these inputs are not truth >>>>>>> bearers for >>>>>>> this decision problem. >>>>>> >>>>>> Problems don't have "inputs" they have instances, and for all the >>>>>> undecidable problems I listed, every "input" (AKA instance) has a >>>>>> correct yes/no answer. Calling this these non-existent things "not >>>>>> truth bearers" just shows you don't know what you are talking about. >>>>>> >>>>> >>>>> The whole Halts/H_Hat thing is an instance of H_Hat being defined >>>>> to contradict whatever decision that Halts makes thus making >>>>> whatever this Halts/H_Hat thing is called not a truth bearer thing. >>>>> >>>>> When any expression of formal or natural language is not a truth >>>>> bearer this excludes this expression of language from membership in >>>>> any formal or informal logical system. >>>> >>>> You're descending into gibberish here. >>>> >>>> A 'truth-bearer' is simply a statement, i.e. a declarative sentence, >>>> i.e. a proposition. >>>> >>>> I can't make heads or tails of exactly what it is that you want to >>>> exclude from the set of truth-bearers, but all of the possibilities >>>> I can come up with are things that no one has ever claimed are >>>> truth-bearers to begin with. >>>> >>>> Turing Machines are not truth bearers. No one has claimed they are. >>>> >>>> Problems are not truth bearers. No one has claimed they are. >>>> >>>> Problem instances are not truth bearers. No one has claimed they are. >>>> >>>> The relationship between H and H_Hat is not a truth bearer. No one >>>> has claimed it is. >>>> >>>> So what exactly is it that you are attempting to exclude from the >>>> set of truth bearers? >>>> >>>> André >>>> >>> >>> 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. >> >> And I will stipulate that any integer larger than 12 will be called an >> irrational number. >> >> Stipulating that X is Y does not make X Y. >> >>> Self-contradictory inputs are erroneous inputs. >> >> What exactly does it mean for an 'input' to be self-contradictory? >> >> The input to H is simply any computation. I have no idea what it would >> mean for a computation to be self-contradictory. >> >> André >> > > I already explained it and you very obviously don't want to get it. You have attempted to explain it. That's not the same as explaining it. > The combination where H_Hat (or any other other input) is defined to do > the opposite of whatever Halts (or any other decider) decides is a > self-contradictory input. Self-contradictory inputs are erroneous inputs. So what exactly is it that you claim to be ruling out as 'incorrect'? H_Hat? Claiming that that is somehow an 'incorrect' computation would make no sense. After all, it is perfectly possible to construct it, to run it on various inputs, and so forth. The question 'Does H_Hat(H_Hat) halt?'. Ruling that out also makes no sense since it is a perfectly valid question with a correct answer which can be decided by any number of partial halt deciders, which can be easily decided by a person, etc. It just cannot be decided correctly by H. The operation which derives H_Hat from H? That operation is simply to copy the state transitions from H and modify them by appending a additional state transitions, both of which are perfectly possible operations. If you duplicate a TM and make changes to it you won't be struck by lightning or anything like that. The standard (and only logically valid) response to the 'conundrum' you seem so bothered by is to simply reject the possibility of constructing an H which actually does what it claims to do, i.e. correctly decide halting for *all* inputs. I don't get why you have such a problem accepting this claim, but have no problems with claiming that certain questions shouldn't be asked or that certain pairings of TMs shouldn't be allowed to exist in the same universe, or whatever it is that you are trying to claim. 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-11 22:24 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <brSdnZRJNL9rcdf9nZ2dnUU7-c_NnZ2d@giganews.com> |
| In reply to | #29165 |
On 3/11/2021 10:16 PM, André G. Isaak wrote: > On 2021-03-11 20:22, olcott wrote: >> On 3/11/2021 9:13 PM, André G. Isaak wrote: >>> On 2021-03-11 19:48, olcott wrote: >>>> On 3/11/2021 8:36 PM, André G. Isaak wrote: >>>>> On 2021-03-11 17:22, olcott wrote:S >>>>>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> When a decision problem is defined such that both truth values are >>>>>>>> contradicted for certain inputs these inputs are not truth >>>>>>>> bearers for >>>>>>>> this decision problem. >>>>>>> >>>>>>> Problems don't have "inputs" they have instances, and for all the >>>>>>> undecidable problems I listed, every "input" (AKA instance) has a >>>>>>> correct yes/no answer. Calling this these non-existent things "not >>>>>>> truth bearers" just shows you don't know what you are talking about. >>>>>>> >>>>>> >>>>>> The whole Halts/H_Hat thing is an instance of H_Hat being defined >>>>>> to contradict whatever decision that Halts makes thus making >>>>>> whatever this Halts/H_Hat thing is called not a truth bearer thing. >>>>>> >>>>>> When any expression of formal or natural language is not a truth >>>>>> bearer this excludes this expression of language from membership >>>>>> in any formal or informal logical system. >>>>> >>>>> You're descending into gibberish here. >>>>> >>>>> A 'truth-bearer' is simply a statement, i.e. a declarative >>>>> sentence, i.e. a proposition. >>>>> >>>>> I can't make heads or tails of exactly what it is that you want to >>>>> exclude from the set of truth-bearers, but all of the possibilities >>>>> I can come up with are things that no one has ever claimed are >>>>> truth-bearers to begin with. >>>>> >>>>> Turing Machines are not truth bearers. No one has claimed they are. >>>>> >>>>> Problems are not truth bearers. No one has claimed they are. >>>>> >>>>> Problem instances are not truth bearers. No one has claimed they are. >>>>> >>>>> The relationship between H and H_Hat is not a truth bearer. No one >>>>> has claimed it is. >>>>> >>>>> So what exactly is it that you are attempting to exclude from the >>>>> set of truth bearers? >>>>> >>>>> André >>>>> >>>> >>>> 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. >>> >>> And I will stipulate that any integer larger than 12 will be called >>> an irrational number. >>> >>> Stipulating that X is Y does not make X Y. >>> >>>> Self-contradictory inputs are erroneous inputs. >>> >>> What exactly does it mean for an 'input' to be self-contradictory? >>> >>> The input to H is simply any computation. I have no idea what it >>> would mean for a computation to be self-contradictory. >>> >>> André >>> >> >> I already explained it and you very obviously don't want to get it. > > You have attempted to explain it. That's not the same as explaining it. > >> The combination where H_Hat (or any other other input) is defined to >> do the opposite of whatever Halts (or any other decider) decides is a >> self-contradictory input. Self-contradictory inputs are erroneous inputs. > > So what exactly is it that you claim to be ruling out as 'incorrect'? > > H_Hat? Claiming that that is somehow an 'incorrect' computation would > make no sense. After all, it is perfectly possible to construct it, to > run it on various inputs, and so forth. The fact that H_Hat is defined to do the opposite of whatever the halt decider decides about its halt status essentially makes it a self-contradictory input to halts. Here is what I said about it in 2004: https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ By calling it a self-contradictory input it is more clearly erroneous. -- 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-11 22:20 -0700 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <s2etm9$2fk$1@dont-email.me> |
| In reply to | #29166 |
On 2021-03-11 21:24, olcott wrote: > On 3/11/2021 10:16 PM, André G. Isaak wrote: >> On 2021-03-11 20:22, olcott wrote: >>> On 3/11/2021 9:13 PM, André G. Isaak wrote: >>>> On 2021-03-11 19:48, olcott wrote: >>>>> On 3/11/2021 8:36 PM, André G. Isaak wrote: >>>>>> On 2021-03-11 17:22, olcott wrote:S >>>>>>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> When a decision problem is defined such that both truth values are >>>>>>>>> contradicted for certain inputs these inputs are not truth >>>>>>>>> bearers for >>>>>>>>> this decision problem. >>>>>>>> >>>>>>>> Problems don't have "inputs" they have instances, and for all the >>>>>>>> undecidable problems I listed, every "input" (AKA instance) has a >>>>>>>> correct yes/no answer. Calling this these non-existent things "not >>>>>>>> truth bearers" just shows you don't know what you are talking >>>>>>>> about. >>>>>>>> >>>>>>> >>>>>>> The whole Halts/H_Hat thing is an instance of H_Hat being defined >>>>>>> to contradict whatever decision that Halts makes thus making >>>>>>> whatever this Halts/H_Hat thing is called not a truth bearer thing. >>>>>>> >>>>>>> When any expression of formal or natural language is not a truth >>>>>>> bearer this excludes this expression of language from membership >>>>>>> in any formal or informal logical system. >>>>>> >>>>>> You're descending into gibberish here. >>>>>> >>>>>> A 'truth-bearer' is simply a statement, i.e. a declarative >>>>>> sentence, i.e. a proposition. >>>>>> >>>>>> I can't make heads or tails of exactly what it is that you want to >>>>>> exclude from the set of truth-bearers, but all of the >>>>>> possibilities I can come up with are things that no one has ever >>>>>> claimed are truth-bearers to begin with. >>>>>> >>>>>> Turing Machines are not truth bearers. No one has claimed they are. >>>>>> >>>>>> Problems are not truth bearers. No one has claimed they are. >>>>>> >>>>>> Problem instances are not truth bearers. No one has claimed they are. >>>>>> >>>>>> The relationship between H and H_Hat is not a truth bearer. No one >>>>>> has claimed it is. >>>>>> >>>>>> So what exactly is it that you are attempting to exclude from the >>>>>> set of truth bearers? >>>>>> >>>>>> André >>>>>> >>>>> >>>>> 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. >>>> >>>> And I will stipulate that any integer larger than 12 will be called >>>> an irrational number. >>>> >>>> Stipulating that X is Y does not make X Y. >>>> >>>>> Self-contradictory inputs are erroneous inputs. >>>> >>>> What exactly does it mean for an 'input' to be self-contradictory? >>>> >>>> The input to H is simply any computation. I have no idea what it >>>> would mean for a computation to be self-contradictory. >>>> >>>> André >>>> >>> >>> I already explained it and you very obviously don't want to get it. >> >> You have attempted to explain it. That's not the same as explaining it. >> >>> The combination where H_Hat (or any other other input) is defined to >>> do the opposite of whatever Halts (or any other decider) decides is a >>> self-contradictory input. Self-contradictory inputs are erroneous >>> inputs. >> >> So what exactly is it that you claim to be ruling out as 'incorrect'? >> >> H_Hat? Claiming that that is somehow an 'incorrect' computation would >> make no sense. After all, it is perfectly possible to construct it, to >> run it on various inputs, and so forth. > > The fact that H_Hat is defined to do the opposite of whatever the halt > decider decides about its halt status essentially makes it a > self-contradictory input to halts. So let's see if I've got this straight. You are not claiming that there is a problem with H_Hat, nor are you claiming that there is a problem with H, nor are you claiming that there is a problem with the question 'does H_Hat(H_Hat)' halt?'. What you're claiming is essentially that you are not allowed to ask H about H_Hat? So instead of acknowledging that the response which H(H_Hat, H_Hat) generates demonstrates that the computation performed by H doesn't actually decide halting universally, you'd rather forbid certain questions from being asked of it? There are religions which act this way and ban certain questions which are not deemed 'faith-promoting'. Logicians and mathematicians, however, tend not to adopt such strategies. 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-11 23:36 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <GK2dnUpFIfd8YNf9nZ2dnUU7-UvNnZ2d@giganews.com> |
| In reply to | #29167 |
On 3/11/2021 11:20 PM, André G. Isaak wrote: > On 2021-03-11 21:24, olcott wrote: >> On 3/11/2021 10:16 PM, André G. Isaak wrote: >>> On 2021-03-11 20:22, olcott wrote: >>>> On 3/11/2021 9:13 PM, André G. Isaak wrote: >>>>> On 2021-03-11 19:48, olcott wrote: >>>>>> On 3/11/2021 8:36 PM, André G. Isaak wrote: >>>>>>> On 2021-03-11 17:22, olcott wrote:S >>>>>>>> On 3/11/2021 6:15 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> When a decision problem is defined such that both truth values >>>>>>>>>> are >>>>>>>>>> contradicted for certain inputs these inputs are not truth >>>>>>>>>> bearers for >>>>>>>>>> this decision problem. >>>>>>>>> >>>>>>>>> Problems don't have "inputs" they have instances, and for all the >>>>>>>>> undecidable problems I listed, every "input" (AKA instance) has a >>>>>>>>> correct yes/no answer. Calling this these non-existent things >>>>>>>>> "not >>>>>>>>> truth bearers" just shows you don't know what you are talking >>>>>>>>> about. >>>>>>>>> >>>>>>>> >>>>>>>> The whole Halts/H_Hat thing is an instance of H_Hat being >>>>>>>> defined to contradict whatever decision that Halts makes thus >>>>>>>> making whatever this Halts/H_Hat thing is called not a truth >>>>>>>> bearer thing. >>>>>>>> >>>>>>>> When any expression of formal or natural language is not a truth >>>>>>>> bearer this excludes this expression of language from membership >>>>>>>> in any formal or informal logical system. >>>>>>> >>>>>>> You're descending into gibberish here. >>>>>>> >>>>>>> A 'truth-bearer' is simply a statement, i.e. a declarative >>>>>>> sentence, i.e. a proposition. >>>>>>> >>>>>>> I can't make heads or tails of exactly what it is that you want >>>>>>> to exclude from the set of truth-bearers, but all of the >>>>>>> possibilities I can come up with are things that no one has ever >>>>>>> claimed are truth-bearers to begin with. >>>>>>> >>>>>>> Turing Machines are not truth bearers. No one has claimed they are. >>>>>>> >>>>>>> Problems are not truth bearers. No one has claimed they are. >>>>>>> >>>>>>> Problem instances are not truth bearers. No one has claimed they >>>>>>> are. >>>>>>> >>>>>>> The relationship between H and H_Hat is not a truth bearer. No >>>>>>> one has claimed it is. >>>>>>> >>>>>>> So what exactly is it that you are attempting to exclude from the >>>>>>> set of truth bearers? >>>>>>> >>>>>>> André >>>>>>> >>>>>> >>>>>> 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. >>>>> >>>>> And I will stipulate that any integer larger than 12 will be called >>>>> an irrational number. >>>>> >>>>> Stipulating that X is Y does not make X Y. >>>>> >>>>>> Self-contradictory inputs are erroneous inputs. >>>>> >>>>> What exactly does it mean for an 'input' to be self-contradictory? >>>>> >>>>> The input to H is simply any computation. I have no idea what it >>>>> would mean for a computation to be self-contradictory. >>>>> >>>>> André >>>>> >>>> >>>> I already explained it and you very obviously don't want to get it. >>> >>> You have attempted to explain it. That's not the same as explaining it. >>> >>>> The combination where H_Hat (or any other other input) is defined to >>>> do the opposite of whatever Halts (or any other decider) decides is >>>> a self-contradictory input. Self-contradictory inputs are erroneous >>>> inputs. >>> >>> So what exactly is it that you claim to be ruling out as 'incorrect'? >>> >>> H_Hat? Claiming that that is somehow an 'incorrect' computation would >>> make no sense. After all, it is perfectly possible to construct it, >>> to run it on various inputs, and so forth. >> >> The fact that H_Hat is defined to do the opposite of whatever the halt >> decider decides about its halt status essentially makes it a >> self-contradictory input to halts. > > So let's see if I've got this straight. You are not claiming that there > is a problem with H_Hat, nor are you claiming that there is a problem > with H, nor are you claiming that there is a problem with the question > 'does H_Hat(H_Hat)' halt?'. What you're claiming is essentially that you > are not allowed to ask H about H_Hat? The Halts/H_Hat pair defines an instance of self-contradictory inputs, like all self-contradiction is erroneous. By changing the halt deciding criteria from: Does the input program halt on its input? to Would the input program halt if the halt decider never stopped simulating it? The self contradiction goes away and the Halts/H_Hat pair becomes decidable. > So instead of acknowledging that the response which H(H_Hat, H_Hat) > generates demonstrates that the computation performed by H doesn't > actually decide halting universally, you'd rather forbid certain > questions from being asked of it? > > There are religions which act this way and ban certain questions which > are not deemed 'faith-promoting'. Logicians and mathematicians, however, > tend not to adopt such strategies. > > André > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 16:38 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <tha3I.73623$Dw4.24344@fx40.iad> |
| In reply to | #29168 |
On 3/12/21 12:36 AM, olcott wrote: > > The Halts/H_Hat pair defines an instance of self-contradictory inputs, > like all self-contradiction is erroneous. > > By changing the halt deciding criteria from: > Does the input program halt on its input? > to > Would the input program halt if the halt decider never stopped > simulating it? > > The self contradiction goes away and the Halts/H_Hat pair becomes > decidable. Which means answering the wrong question. Trying to prove something by asking the wrong question doesn't work.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-12 05:40 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <20210311213838.758@kylheku.com> |
| In reply to | #29166 |
On 2021-03-12, olcott <NoOne@NoWhere.com> wrote: > On 3/11/2021 10:16 PM, André G. Isaak wrote: >> So what exactly is it that you claim to be ruling out as 'incorrect'? >> >> H_Hat? Claiming that that is somehow an 'incorrect' computation would >> make no sense. After all, it is perfectly possible to construct it, to >> run it on various inputs, and so forth. > > The fact that H_Hat is defined to do the opposite of whatever the halt > decider decides about its halt status essentially makes it a > self-contradictory input to halts. That is false; H_Hat is defined to "do the opposite" of whatever Halts decides about a function P that comes in as a parameter to H_Hat. That parameter could be by-value; it is not necessarily a reference, and therefore even if it is equivalent to H_Hat, it is not necessarily a self-reference. Furthermore, even if we wanted to banish the situation that H_Hat receives as an argument a copy of a function equivalent to itself, deciding this equivalence in order to reject it has the same difficulty as halting. Calculating whether two functions are equivalent is undecidable, and thus a halting-level difficulty. -- 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 08:27 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <VpCdnReIn-fZ59b9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #29170 |
On 3/11/2021 11:40 PM, Kaz Kylheku wrote: > On 2021-03-12, olcott <NoOne@NoWhere.com> wrote: >> On 3/11/2021 10:16 PM, André G. Isaak wrote: >>> So what exactly is it that you claim to be ruling out as 'incorrect'? >>> >>> H_Hat? Claiming that that is somehow an 'incorrect' computation would >>> make no sense. After all, it is perfectly possible to construct it, to >>> run it on various inputs, and so forth. >> >> The fact that H_Hat is defined to do the opposite of whatever the halt >> decider decides about its halt status essentially makes it a >> self-contradictory input to halts. > > That is false; H_Hat is defined to "do the opposite" of whatever > Halts decides about a function P that comes in as a parameter to H_Hat. > Yet the test case proving halting undecidability is when the input is a finite string of itself. > That parameter could be by-value; it is not necessarily a reference, and > therefore even if it is equivalent to H_Hat, it is not necessarily a > self-reference. > It has the computational equivalent of self reference so it <is> self reference. > Furthermore, even if we wanted to banish the situation that H_Hat > receives as an argument a copy of a function equivalent to itself, > deciding this equivalence in order to reject it has the same difficulty > as halting. > We simply change the halt deciding criteria so that self-referrnce is no longer pathological: Would the input program halt if the halt decider never stopped simulating it? > Calculating whether two functions are equivalent is undecidable, and > thus a halting-level difficulty. > Only if Rice's theorem still holds and it does not still hold. The same inputs that were undecidable under the incorrect criteria are decidable under the corrected criteria. -- 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-12 15:28 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <20210312072110.258@kylheku.com> |
| In reply to | #29172 |
On 2021-03-12, olcott <NoOne@NoWhere.com> wrote: > On 3/11/2021 11:40 PM, Kaz Kylheku wrote: >> On 2021-03-12, olcott <NoOne@NoWhere.com> wrote: >>> On 3/11/2021 10:16 PM, André G. Isaak wrote: >>>> So what exactly is it that you claim to be ruling out as 'incorrect'? >>>> >>>> H_Hat? Claiming that that is somehow an 'incorrect' computation would >>>> make no sense. After all, it is perfectly possible to construct it, to >>>> run it on various inputs, and so forth. >>> >>> The fact that H_Hat is defined to do the opposite of whatever the halt >>> decider decides about its halt status essentially makes it a >>> self-contradictory input to halts. >> >> That is false; H_Hat is defined to "do the opposite" of whatever >> Halts decides about a function P that comes in as a parameter to H_Hat. >> > > Yet the test case proving halting undecidability is when the input is a > finite string of itself. Not itself; equivalent to itself. > >> That parameter could be by-value; it is not necessarily a reference, and >> therefore even if it is equivalent to H_Hat, it is not necessarily a >> self-reference. >> > > It has the computational equivalent of self reference so it <is> self > reference. There is no "reference". Equivalence is not reference. Two entities that someone arranged to be equivalent do not amount to self-reference, let alone if those things are not references at all. > We simply change the halt deciding criteria so that self-referrnce is no > longer pathological: Can we first change the definition of square root so it no longer puts out these bothersome irrational and imaginary numbers? Thanks. > Would the input program halt if the halt decider never stopped > simulating it? > >> Calculating whether two functions are equivalent is undecidable, and >> thus a halting-level difficulty. >> > > Only if Rice's theorem still holds and it does not still hold. I will believe it if you can demonstrate an algorithm that decides function equivalence for any pair of functions in a finite number of steps. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-11 22:38 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [Self-contradictory inputs] |
| Message-ID | <MmB2I.46114$TM.25734@fx44.iad> |
| In reply to | #29153 |
On 3/11/21 9:48 PM, olcott wrote: > > 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. > > Self-contradictory inputs are erroneous inputs. > You may want to 'Stipulate' That, but it is sort of nonsense. One issue with defining something by stipulation is that once you have done that, you can't use that term in any other meaning. Thus, since you have just applied a 'stipulated' definition that used the words self-contradictory, tp something, NO theory based on another definition of self-contradictory applies. It as been moved out of the definition space by the stipulation. Note, 'Inputs' (particularly for Turing Machines) can not be self-contradictory, as the input for a Turing Machine is just a string of symbols that the machine will use as its input to compute on. If we have defined a machine to be 'Universal', then NO input can be 'erroneous' as that is the whole meaning of Universal. It does need to use the alphabet of the machine, so a machine whose tape is defined as a string of digits and spaces, can't have letters on it. Self-contradiction generally applies to STATEMENTS, claiming to be a truth-bearer, that when examined, turns out can not be a truth-bearer as it can neither be True of False. Note, the Halts/H_Hat is NOT such a case. Halts is a finite computation, that by some algorithm processes an input representing a Turing Machine and its input, and makes a prediction ro statement on what it says that calculation will do, either Halt or be non-Halting. H_Hat is a machine built on that Computation, so that it does the oposite of what Halts predicts its input would do if run. So far, no contradiction or even Self-Reference. We now perform a specific computation, feeding the representation of H_Hat into H_Hat. This is self-referential, but entirely permissible, Halts was defined as a computation that could compute for the representation of any Turing Machine, which H_Hat is one, so its representation is a proper input, and a proper input as its input. Halts, being a finite computation WILL produce some answer as its answer, and H_Hat will then do the opposite. All perfectly well define behavior. When we look at the results, when we inspect the results, we see that Halts gave the wrong answer. And this is a perfectly logical results. When we build computations, we understand that not every computation will always be 100% correct, and that at times they will be in error. So maybe we will try to improve it and make its algorithm 'smarter' so it is wrong less oftern. Only if we add a presumption that Halts HAD to be right, do we get into the state of a contradiction. We don't even have a 'provability' issue here, it is easily provable that Halts WILL get the wrong answer. In fact, it is the fact that we get the contradiction when we add that assumption that we can use to PROVE that this means that there can not exist a computation that can correctly predict the halting status on ALL computations for all its inputs, as we have a formula to construct a computation/input that it can not get right. This doesn't mean the question of does a given machine given a given input halt is an improper question. In fact for many cases, the answer to that question for H_Hat is easily proven, just not by the computation Halts.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-13 16:35 -0500 |
| Message-ID | <Lea3I.73622$Dw4.30636@fx40.iad> |
| In reply to | #29106 |
On 3/11/21 9:31 AM, olcott wrote:
> On 3/11/2021 8:15 AM, olcott wrote:
>> On 3/10/2021 7:45 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 3/9/2021 7:49 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 3/9/2021 6:57 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> When-so-ever any question or decision problem instance lacks a
>>>>>>>> correct
>>>>>>>> yes/no answer or true/false resolution because both of these values
>>>>>>>> are contradicted then the question / decision problem instance is
>>>>>>>> incorrect.
>>>>>>>
>>>>>>> Every instance of every decision problem has a correct yes/no
>>>>>>> answer.
>>>>>>> How many more years will it be before you learn this simple fact?
>>>>>>
>>>>>> I am defining instance more narrowly that you are.
>>>>>
>>>>> An instance of the halting problem is a natural number that can
>>>>> encode a
>>>>> TM/input pair. What is your "narrower" definition?
>>>>>
>>>>> While we wait for you not to define "instance", do you now accept
>>>>> that,
>>>>> for the broader definition everyone else uses, that every instance of
>>>>> every decision problem has a correct yes/no answer?
>>>>>
>>>>>>> How many more years will it be before you learn this simple fact?
>>>>>
>>>>>> Which return value could Halts() return to H_Hat() that is not
>>>>>> contradicted by the behavior of _H_Hat() ?
>>>>>
>>>>> There's no need to reiterate why there is no effective procedure to
>>>>> decide halting. We all know how the argument goes.
>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>> if (Input_Would_Halt)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32) H_Hat, (u32) H_Hat);
>>>>>> }
>>>>>
>>>>> There is no instance of the halting problem here.
>>>>
>>>> I am stipulating the meaning of a new term to cover...
>>>
>>> Apparently not. You are giving a new meaning to an old term -- one with
>>> a well-defined meaning already. That's a dumb thing to do but you do it
>>> all the time. I suspect you start off using the usual meaning, but when
>>> you find your self stuck, you state you are "stipulating a new meaning".
>>>
>>>> been previously inexpressible because it lacked a term to to use to
>>>> reference its meaning.
>>>
>>> Then you should introduce a new term.
>>>
>>>> When decision problems have more than one undecidable case then each
>>>> one of these undecidable cases is stipulated to be an undecidable
>>>> instance.
>>>
>>> None of the decision problems I listed have any undecidable cases. The
>>> case you referenced (H_Hat((u32)H_Hat)) is decidable.
>>>
>>>> The key reason that the halting problem has been determined to be
>>>> undecidable is that it is possible to define an input to what would
>>>> otherwise be a correct partial halt decider that does the opposite of
>>>> whatever the halt decider decides.
>>>
>>> Sounds like waffle but the maybe you saying what the rest of the world
>>> is saying. After all, the reason the halting problem has been
>>> determined to be undecidable is not at all complicated.
>>>
>>>> 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.
>>
>
> When a decision problem is defined such that both truth values are
> contradicted for certain inputs these inputs are not truth bearers for
> this decision problem.
>
First, the inputs are DATA, not truth-bearers. If I ask the square root
function to compute the square root of 4, is 4 a 'truth-bearer'? No.
Inputs can be in the domain of the computation or outside/invalid. For
example, in the domains of the Reals, asking for the square root of -4
would be invalid.
For a computation trying to be a Universal Halt Detector, its input
domain would be the description of ANY Turing Machine, and a description
of its input. Given a defined Turing Machine H, H^ IS a Turing Machine,
and its description is a valid input.
The Question asked of H is "What does H compute given the program P and
input I"? THAT is the answer that H needs to provide. Asking what the
right answer should be is NOT a computation. H doesn't get to 'adjust'
itself based on its input, except by what decisions were originally
encoded into its computation, so it is THAT question which is invalid to
use as a design for H.
ONCE H has been designed, we can then build H^ and test to see if H got
it right, which it won't.
The answer to will H^ halt or not has a definite value, and if H can be
shown to always answer, then that answer is decidable. (H might be a
computation that is undecidable in its halting, in which case the
Halting status of H^ would also be undecidable).
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-12 00:06 +0000 |
| Message-ID | <87r1klck11.fsf@bsb.me.uk> |
| In reply to | #29105 |
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".) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 18:14 -0600 |
| Message-ID | <N-2dnT1U6JUeL9f9nZ2dnUU7-aPNnZ2d@giganews.com> |
| In reply to | #29140 |
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. 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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-12 01:06 +0000 |
| Message-ID | <874khhch9c.fsf@bsb.me.uk> |
| In reply to | #29143 |
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. > 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. If so, great, you've got it! If you are still trying to find words to deny the fact that every instance has a correct yes/no answer then you are wasting your time. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 20:43 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [self-contradictory inputs] |
| Message-ID | <HOKdneGvNZH4SNf9nZ2dnUU7-VOdnZ2d@giganews.com> |
| In reply to | #29148 |
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. >> 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. > If so, > great, you've got it! If you are still trying to find words to deny > the fact that every instance has a correct yes/no answer then you are > wasting your time. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 5 of 23 — ← Prev page 1 … 3 4 [5] 6 7 … 23 Next page →
Back to top | Article view | comp.theory
csiph-web