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 4 of 23 — ← Prev page 1 2 3 [4] 5 6 … 23 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-10 19:04 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <aNqdnX08AqU88dT9nZ2dnUU7-I3NnZ2d@giganews.com> |
| In reply to | #29078 |
On 3/10/2021 6:26 PM, Richard Damon wrote: > On 3/10/21 10:40 AM, olcott wrote: >> On 3/10/2021 9:29 AM, Kaz Kylheku wrote: >>> Can you prove that parallel lines never meet, from only the four >>> postulates of geometry? >>> >>> Yet if you regard that as true, it will not contradict those postulates. >>> >> By stipulated definition parallel lines never meet, whether or not this >> can be proven by geometry would at most be a short coming of geometry. >> > > Stipulation requires agreement. > That is not the way it works. https://en.wikipedia.org/wiki/Stipulative_definition Given that the line segment is on inch long allows for no room for disagreement on the length of the line segment. -- 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-10 23:23 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <PWg2I.371466$0W.247896@fx41.iad> |
| In reply to | #29086 |
On 3/10/21 8:04 PM, olcott wrote: > On 3/10/2021 6:26 PM, Richard Damon wrote: >> On 3/10/21 10:40 AM, olcott wrote: >>> On 3/10/2021 9:29 AM, Kaz Kylheku wrote: >>>> Can you prove that parallel lines never meet, from only the four >>>> postulates of geometry? >>>> >>>> Yet if you regard that as true, it will not contradict those >>>> postulates. >>>> >>> By stipulated definition parallel lines never meet, whether or not this >>> can be proven by geometry would at most be a short coming of geometry. >>> >> >> Stipulation requires agreement. >> > > That is not the way it works. > https://en.wikipedia.org/wiki/Stipulative_definition > > Given that the line segment is on inch long > allows for no room for disagreement on the length of the line segment. > But you don't get to use it in that way for the words OTHERS say. I will admit that I hadn't heard the word used that way before, I am more use to the concept of a stipulation being the agreement the parties work out in the preliminaries so the don't argue over points they don't disagree on. I think you don't really understand how logical arguments are supposed to work and you over (ab)use things like this.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-10 22:35 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code [truth bearer defined] |
| Message-ID | <qvGdnVjUlrG5A9T9nZ2dnUU7-UvNnZ2d@giganews.com> |
| In reply to | #29098 |
On 3/10/2021 10:23 PM, Richard Damon wrote: > On 3/10/21 8:04 PM, olcott wrote: >> On 3/10/2021 6:26 PM, Richard Damon wrote: >>> On 3/10/21 10:40 AM, olcott wrote: >>>> On 3/10/2021 9:29 AM, Kaz Kylheku wrote: >>>>> Can you prove that parallel lines never meet, from only the four >>>>> postulates of geometry? >>>>> >>>>> Yet if you regard that as true, it will not contradict those >>>>> postulates. >>>>> >>>> By stipulated definition parallel lines never meet, whether or not this >>>> can be proven by geometry would at most be a short coming of geometry. >>>> >>> >>> Stipulation requires agreement. >>> >> >> That is not the way it works. >> https://en.wikipedia.org/wiki/Stipulative_definition >> >> Given that the line segment is on inch long >> allows for no room for disagreement on the length of the line segment. >> > > But you don't get to use it in that way for the words OTHERS say. > > I will admit that I hadn't heard the word used that way before, I am > more use to the concept of a stipulation being the agreement the parties > work out in the preliminaries so the don't argue over points they don't > disagree on. > > I think you don't really understand how logical arguments are supposed > to work and you over (ab)use things like this. > Since [truth bearer] doesn't really have any good proper definition it seems reasonable (and perhaps self-evidently true) that we can define a [truth bearer] as a Decidable Propositions ...there exists an effective method for deriving the correct (true/false) answer. https://en.wikipedia.org/wiki/Decidability_(logic) By doing this we really only establish synonymity between the term [truth bearer] and [Decidable Proposition] thus providing an alternate name for the exact same set. Then it becomes easy as pie to correctly say that the cases of undecidable decision problems that prove their undecidability are not members of the set of [truth bearers]. -- 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-10 16:06 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <20210310080334.933@kylheku.com> |
| In reply to | #29016 |
On 2021-03-10, Kaz Kylheku <563-365-8930@kylheku.com> wrote: > On 2021-03-10, olcott <NoOne@NoWhere.com> wrote: >> On 3/9/2021 11:06 PM, Kaz Kylheku wrote: >>> On 2021-03-10, olcott <NoOne@NoWhere.com> wrote: >>>> So you think that mathematicians have deep insight into the >>>> philosophical underpinnings of the foundation of the generic notion of >>>> analytic truth? >>> >>> Probably: some have better philosophical insight than others (which >>> doesn't necessarily make them better, more productive mathematicians) >>> and all have scads of it more than you. >>> >> If mathematians did have sufficient philosophical insight they would >> never make the mistake of saying that anything can be true and unprovable. > > Can you prove that parallel lines never meet, from only the four > postulates of geometry? Oops, wrong person to ask; you probably think you can, and you have some program which uses a PostScript emulator to prove it. Just there is not enough space in one 8.5x11 sheet to see how the parallel lines never meet; you must see the whole 500 page trace. -- 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-14 14:46 -0400 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <PRs3I.82973$kYy5.28250@fx35.iad> |
| In reply to | #29013 |
On 3/10/21 10:23 AM, olcott wrote: > If mathematians did have sufficient philosophical insight they would > never make the mistake of saying that anything can be true and unprovable. Maybe if you had a bit more philosophical insight you would understand that smart philosophers understand the limits to the concept of the logic system that defines truth to be only what was provable, and accepts that such a system can not handle much of mathematics.
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2021-03-10 15:25 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <Y9ednQdxOv5IedX9nZ2dnUU78SnNnZ2d@brightview.co.uk> |
| In reply to | #29000 |
On 10/03/2021 04:04, olcott wrote:
> On 3/9/2021 9:59 PM, Mike Terry wrote:
>> On 10/03/2021 02:39, olcott wrote:
>>> 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 something that
>>> has been previously inexpressible because it lacked a term to to use
>>> to reference its meaning.
>>>
>>> When decision problems have more than one undecidable case then each
>>> one of these undecidable cases is stipulated to be an undecidable
>>> instance.
>>>
>>> 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.
>>>
>>> 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.
>>>
>>> Way too much for any learned-by-rote think-inside-the-box
>>> do-exactly-as-you-are-told person can ever begin to grasp.
>>
>> LOL, BIG elements of projection going on here!
>>
>> You really have no idea whether the people you denigrate actually have
>> learned "by rote" or by anything else - you don't understand what
>> they're explaining to you and are not in any position to assess them.
>>
>> Your constant harping on about "learned by rote" is one of the
>> give-away aspects of your delusional framework, constructed to hide
>> YOUR OWN failings [*] from yourself and maintaining the self-deception
>> that you're an unacknowledged genius.
>>
>> [*] Admit it: every time you have tried in the past to learn even the
>> basic concepts of a field (like logic/mathematics) in order to better
>> "refute" the theorems you can't understand, you get stuck on the first
>> page! Far from "PO the unacknowledged genius", you are "PO the
>> *deluded dumbo*". :)
>>
>>
>> Mike.
>>
>
> So you think that mathematicians have deep insight into the
> philosophical underpinnings of the foundation of the generic notion of
> analytic truth?
>
> Quine couldn't even understand that bachelors are unmarried.
> https://pdfs.semanticscholar.org/675b/0ac190985cb2a91f9c8b505af25bd5b10833.pdf?_ga=2.94076253.153026009.1586290224-1393250255.1585101085
>
You have no conception of what Quine understood or couldn't understand -
you're forgetting you're a *deluded dumbo*, incapable of understanding
what anyone else is saying to you. :)
Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-10 09:38 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <k8adnbk6np9GetX9nZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #29014 |
On 3/10/2021 9:25 AM, Mike Terry wrote:
> On 10/03/2021 04:04, olcott wrote:
>> On 3/9/2021 9:59 PM, Mike Terry wrote:
>>> On 10/03/2021 02:39, olcott wrote:
>>>> 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 something that
>>>> has been previously inexpressible because it lacked a term to to use
>>>> to reference its meaning.
>>>>
>>>> When decision problems have more than one undecidable case then each
>>>> one of these undecidable cases is stipulated to be an undecidable
>>>> instance.
>>>>
>>>> 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.
>>>>
>>>> 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.
>>>>
>>>> Way too much for any learned-by-rote think-inside-the-box
>>>> do-exactly-as-you-are-told person can ever begin to grasp.
>>>
>>> LOL, BIG elements of projection going on here!
>>>
>>> You really have no idea whether the people you denigrate actually
>>> have learned "by rote" or by anything else - you don't understand
>>> what they're explaining to you and are not in any position to assess
>>> them.
>>>
>>> Your constant harping on about "learned by rote" is one of the
>>> give-away aspects of your delusional framework, constructed to hide
>>> YOUR OWN failings [*] from yourself and maintaining the
>>> self-deception that you're an unacknowledged genius.
>>>
>>> [*] Admit it: every time you have tried in the past to learn even the
>>> basic concepts of a field (like logic/mathematics) in order to better
>>> "refute" the theorems you can't understand, you get stuck on the
>>> first page! Far from "PO the unacknowledged genius", you are "PO the
>>> *deluded dumbo*". :)
>>>
>>>
>>> Mike.
>>>
>>
>> So you think that mathematicians have deep insight into the
>> philosophical underpinnings of the foundation of the generic notion of
>> analytic truth?
>>
>> Quine couldn't even understand that bachelors are unmarried.
>> https://pdfs.semanticscholar.org/675b/0ac190985cb2a91f9c8b505af25bd5b10833.pdf?_ga=2.94076253.153026009.1586290224-1393250255.1585101085
>>
>
> You have no conception of what Quine understood or couldn't understand -
> you're forgetting you're a *deluded dumbo*, incapable of understanding
> what anyone else is saying to you. :)
>
>
> Mike.
>
Point to my exact mistake when I say that Quine could not understand the
synonymy of bachelor(X) and unmarried(X).
Quine is the one man that single-handedly destroyed correct
understanding of epistemological al foundationalism.
--
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-10 15:42 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <20210310074152.299@kylheku.com> |
| In reply to | #29018 |
On 2021-03-10, olcott <NoOne@NoWhere.com> wrote: > Quine is the one man that single-handedly destroyed correct > understanding of epistemological al foundationalism. Quine has self-reproducing programs named after him, and you're a nobody. -- 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-10 09:56 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <wt-dnQr3ptLXcdX9nZ2dnUU7-bOdnZ2d@giganews.com> |
| In reply to | #29021 |
On 3/10/2021 9:42 AM, Kaz Kylheku wrote: > On 2021-03-10, olcott <NoOne@NoWhere.com> wrote: >> Quine is the one man that single-handedly destroyed correct >> understanding of epistemological al foundationalism. > > Quine has self-reproducing programs named after him, and you're a nobody. > That you always resort to rhetoric when you run out of reasoning shows that you reasoning is woefully deficient. -- 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-10 11:33 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (truth) |
| Message-ID | <Ex62I.474349$S31.372853@fx47.iad> |
| In reply to | #29018 |
On 3/10/21 10:38 AM, olcott wrote: > > Point to my exact mistake when I say that Quine could not understand the > synonymy of bachelor(X) and unmarried(X). > > Quine is the one man that single-handedly destroyed correct > understanding of epistemological al foundationalism. > So did you get a Unmarried of Arts at University? (Maybe you didn't make it that far)
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-03-09 20:11 -0800 |
| Message-ID | <d66a46f4-e77c-42f4-a53c-d3c8837cf2c0n@googlegroups.com> |
| In reply to | #28999 |
i am seeking feedback from the yes it does halt community about bob
my program bob solves small pspace forms
here is a message i am composing
to send to the model counting competition
i would appreciate any comments
dear mccompetition dot org
here are my entries for mc2021.
summary: P=NP for moderate sizes.
every complete sat solver easily solves AllQBFs.
+++ my 2021 model counting benchmarks
With bob, general thought is encompassed by regular graph coloring (3,4,5 colors)
on degrees 5 thru 13, and several monotone cnfs.
Below, an attempt to add ___ for clarity is made. bob does twenty seven trillion
inferences per day, usually. bob does decomposition near the end of depth first search,
so #assumptions < #P, by small factors. There are standard #infers per assumption, for
each formula.
From my 2002 paper, Introduction to QSPACE, #P=#Q, the number of satisfying assignments
equals the number of valid quantifications, with any given variable ordering. So the #P
numbers are also #Q numbers. #assumptions=#backtracks. |one infer|=7+13 cpu cycles.
250MLIPS on 5GHz clock.
c3d5n240_6__c #P______524,469,054___#assumptions_______44,575,463__#infers___3,737,329,291,541
c4d6n42_1___c #P___44,940,880,680___#assumptions____8,488,639,509__#infers___8,636,206,822,267
c4d7n56_6___c #P____7,545,932,136___#assumptions____1,481,823,453__#infers___2,265,653,547,228
c4d8n88_1___c #P___23,940,729,024___#assumptions____1,655,366,338__#infers___4,728,513,192,123
c4d9n140_14_c #P________2,653,800___#assumptions_______78,318,652__#infers___3,498,868,589,020
c4d9n150_5__c #P______274,667,472___#assumptions______549,512,308__#infers__27,015,066,692,449
c4d9n160_0__c #P__________113,448___#assumptions______701,352,451__#infers__37,570,079,470,750
c4d9n160_1__c #P________7,131,816___#assumptions______706,643,722__#infers__38,306,908,698,704
c4d9n160_2__c #P___________74,208___#assumptions______528,755,645__#infers__28,241,835,111,857
c7d20n50_0.cnf #P___15,654,774,240___#assumptions____8,740,055,650__#infers_111,084,371,890,331
For moderate sizes, P=NP=#P=PSPACE=QSPACE.
sincerely daniel
ps
+++
about monotonicity
since the formula is monotone
satisfying assignments are
identical to
satisfying quantifications
with monotone formulas
validating a quantification
is identical to
evaluating
an assignment
that is to say
monotone qbf validity
is linearly decidable
or say
monotone reason is linear
+++ bobs algorithm +++
code for transforming sets of satisfying assignments
into sets of valid quantifications is quite brief.
every complete sat solver easily solves AllQBFs
typedef unsigned int num;
typedef trunk<num> nums;
typedef trunk<nums*> numnums;
{ // converts tree of satisfying assignments to tree of valid quantifications
static numnums solutions; // the finite set of all satisfying solutions then all valid quantifications
static void zerotoone /*bit on*/ (nums& s, num b) { (s[ b >> five ] += (one << (b & tau[five] )));}
static num be /*is bit on*/ (nums& s, num b) { return (s[ b >> five ] & (one << (b & tau[five] )));} /*60*/
static void oldybutgoody /*if on turn bit off*/(nums& s, num b) { if (be(s, b)) s[b >> five] &= diagovreason[b & tau[five]]; else; }
staticj void spread /*leftright around bit*/ (num b, numnums& s, numnums& l, numnums& r)
{ for (num g = zero; g < s.size(); g++) if (be( (*s[g]), b )) r.add(s[g]); else l.add(s[g]); }
static void qtree /* quantifications */ (num v, numnums& s) { if (zero == s.size()) return; if (v == env::N()) return;
numnums l; numnums r; spread (v, s, l, r); s.setsize(zero);
qtree (v + one, l); qtree (v + one, r); utree (v, l, r); // leftright sortset
for (num g = zero; g < l.size (); g++) { oldybutgoody (*(l[g]), v); s.add (l[g]); } /*add left*/ l.setsize(zero);
for (num g = zero; g < r.size (); g++) { s.add (r[g]); } /*add right*/ r.setsize(zero); }
static void utree /*33*/ (num v, numnums& l, numnums& r) // union left with right
{ if (v == env::N()) return;
if (zero == l.size()) { for (num g = zero; g < r.size(); g++) l.add(r[g]);/* essence of universal right */ r.setsize(zero); return; }
numnums al; numnums ar; spread (v + one, l, al, ar); /*left*/ l.setsize(zero);
numnums bl; numnums br; spread (v + one, r, bl, br); /*right*/ r.setsize(zero);
utree (v + one, al, bl); utree (v + one, ar, br); /*essence*/
for (num g = zero; g < al.size(); g++) { l.add (al[g]); } /*left*/ al.setsize(zero);
for (num g = zero; g < ar.size(); g++) { l.add (ar[g]); } /*left*/ ar.setsize(zero);
for (num g = zero; g < bl.size(); g++) { r.add (bl[g]); } /*right*/ bl.setsize(zero);
for (num g = zero; g < br.size(); g++) { r.add (br[g]); } /*right*/ br.setsize(zero); }
};// twenty three lines
entry point: qtree(zero, solutions); with zero based numbering of variables
and solutions is a set of Nbit strings encoded as vecrors of 32bit numbers
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-11 01:45 +0000 |
| Message-ID | <87o8fqea3x.fsf@bsb.me.uk> |
| In reply to | #28975 |
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.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-10 20:10 -0600 |
| Message-ID | <WaSdnUcKmK6d4dT9nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #29089 |
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.
>
In computability theory and computational complexity theory, an
undecidable problem is a decision problem for which it is proved to be
impossible to construct an algorithm that always leads to a correct
yes-or-no answer. https://en.wikipedia.org/wiki/Undecidable_problem
If we simply call the set of decidable propositions [truth-bearers] then
the individual instances of undecidable decision problem that prove
undecidability can simply be excluded from the set of [truth-bearers].
--
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 00:03 +0000 |
| Message-ID | <87zgz9ck6v.fsf@bsb.me.uk> |
| In reply to | #29091 |
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. You still can't bring yourself to deny this, though you really want to! > In computability theory and computational complexity theory, an > undecidable problem is a decision problem for which it is proved to be > impossible to construct an algorithm that always leads to a correct > yes-or-no answer. https://en.wikipedia.org/wiki/Undecidable_problem That's not a very good definition, but it'll do. However, It does not address the point about there always being a correct yes/no answer, so I'm not sure why you posted it. I know you can use a search engine. > If we simply call the set of decidable propositions [truth-bearers] > then the individual instances of undecidable decision problem that > prove undecidability can simply be excluded from the set of > [truth-bearers]. There are none. There are no instances of any of these decision problems without a correct yes/no answer. If you were a student, I'd simply ask you to produce one. Show me a context-free grammar that is not either ambiguous or not ambiguous. Show me two TMs that are neither computationally equivalent nor computationally different. Show me a TM computation that neither halts nor does not halt. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 18:08 -0600 |
| Message-ID | <1PWdnbSu77qFLNf9nZ2dnUU7-cmdnZ2d@giganews.com> |
| In reply to | #29139 |
On 3/11/2021 6:03 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. > > You still can't bring yourself to deny this, though you really want to! > >> In computability theory and computational complexity theory, an >> undecidable problem is a decision problem for which it is proved to be >> impossible to construct an algorithm that always leads to a correct >> yes-or-no answer. https://en.wikipedia.org/wiki/Undecidable_problem > > That's not a very good definition, but it'll do. However, It does not > address the point about there always being a correct yes/no answer, so > I'm not sure why you posted it. I know you can use a search engine. > >> If we simply call the set of decidable propositions [truth-bearers] >> then the individual instances of undecidable decision problem that >> prove undecidability can simply be excluded from the set of >> [truth-bearers]. > > There are none. There are no instances of any of these decision > problems without a correct yes/no answer. If you were a student, I'd > simply ask you to produce one. Show me a context-free grammar that is > not either ambiguous or not ambiguous. Show me two TMs that are neither > computationally equivalent nor computationally different. Show me a TM > computation that neither halts nor does not halt. > After going over this again and again and doing more research on the terminology: 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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-14 15:20 -0400 |
| Message-ID | <tmt3I.15707$HA4.864@fx04.iad> |
| In reply to | #29091 |
On 3/10/21 9:10 PM, olcott wrote: >> > > In computability theory and computational complexity theory, an > undecidable problem is a decision problem for which it is proved to be > impossible to construct an algorithm that always leads to a correct > yes-or-no answer. https://en.wikipedia.org/wiki/Undecidable_problem > > If we simply call the set of decidable propositions [truth-bearers] then > the individual instances of undecidable decision problem that prove > undecidability can simply be excluded from the set of [truth-bearers]. > > But is it always decidable if a proposition is a truth-bearer or not? Can you prove that?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 08:15 -0600 |
| Message-ID | <AJCdnaDe97GKu9f9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #29089 |
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.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 08:31 -0600 |
| Message-ID | <eoSdneGLV7FFtNf9nZ2dnUU7-XnNnZ2d@giganews.com> |
| In reply to | #29105 |
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.
--
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 00:15 +0000 |
| Message-ID | <87lfatcjm1.fsf@bsb.me.uk> |
| In reply to | #29106 |
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. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-11 18:22 -0600 |
| Message-ID | <0fKdnTZm_qbJKdf9nZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #29144 |
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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 4 of 23 — ← Prev page 1 2 3 [4] 5 6 … 23 Next page →
Back to top | Article view | comp.theory
csiph-web