Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #28957 > unrolled thread

Refuting the halting problem proofs with fully operational code

Started byolcott <NoOne@NoWhere.com>
First post2021-03-09 16:56 -0600
Last post2021-03-15 02:37 +0000
Articles 20 on this page of 452 — 20 participants

Back to article view | Back to comp.theory


Contents

  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 15 of 23 — ← Prev page 1 … 13 14 [15] 16 17 … 23  Next page →


#29039 — Re: Refuting the halting problem proofs with fully operational code (one point at a time)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 10:57 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (one point at a time)
Message-ID<s2b19q$qm8$1@dont-email.me>
In reply to#29038
On 2021-03-10 10:35, olcott wrote:
> On 3/10/2021 10:33 AM, André G. Isaak wrote:
>> On 2021-03-10 09:03, olcott wrote:
>>> On 3/10/2021 9:43 AM, André G. Isaak wrote:
>>>> On 2021-03-10 08:19, olcott wrote:
>>>>> On 3/9/2021 10:58 PM, André G. Isaak wrote:
>>>>
>>>> <snippage>
>>>>
>>>>>> As I pointed out in a previous post (which you ignored), your 
>>>>>> Halts() cannot correctly decide an H_Hat which is derived from 
>>>>>> Halts() according to the actual rules set out by Linz, i.e. one in 
>>>>>> which H_Hat contains a *complete copy* of Halts with some 
>>>>>> additional state-transitions appended. Your strategy of looking 
>>>>>> for a routine calling itself isn't going to work here since each 
>>>>>> instance of Halts (the uppermost one, the one in the uppermost 
>>>>>> H_Hat, etc.) will have separate addresses.
>>>>>>
>>>>>> Even using your construction with function pointers passed, it 
>>>>>> doesn't work for the *actual* halting problem as opposed to your 
>>>>>> weird redefined-with-subjunctives versions of it.
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> The actual rules by Linz to not make a difference, Sipser does not 
>>>>> use them. Once you acknowledge that I have refuted the simplest 
>>>>> example of the halting problem counter-examples then and only then 
>>>>> will I work on the more complex ones. I will not tolerate endless 
>>>>> disgression from the point.
>>>>
>>>> Of course it matters. And Sipser uses the exact same rules. You're 
>>>> hung-up on Sipser's use of the term 'subroutine' because you don't 
>>>> grasp how Turing Machines work.
>>>
>>> The key element of the halting problem counter-examples that makes 
>>> them undecidable is that the input program does the opposite if 
>>> whatever the halt decider decides.
>>>
>>>     Once D has determined this information, it does the
>>>     opposite. That is, it rejects if M accepts and accepts
>>>     if M does not accept. (Sipser 1997:165)
>>>
>>> Once you acknowledge that I have conquered that then I will allow the 
>>> conversation to digress to other points. Prior to acknowledgement of 
>>> that I will only consider these digressions as dishonest dodges used 
>>> as a mere tactic to make sure that the point is never addressed.
>>
>>
>> I can't acknowledge something which is false.
> 
> If you cannot acknowledge that I have refuted every conventional halting 
> problem counter-example that does not copy its input then you are 
> dishonestly dodging the point and there is no sense proceeding.
>
> At the point in time that you acknowledge that my halt decider does 
> correctly decide the conventional halting problem counter-examples that 
> do not copy their input then I will begin to address the ones that do 
> copy their input. Until that time I will simply assume that you are a 
> mere naysayer that will always disagree with whatever I say.

This has nothing to do with whether the input is copied. It has to do 
with whether H_Hat is constructed by making a copy of the 
state-transitions of H rather than calling some external subroutine 
(which wouldn't even be possible for actual Turing Machines).

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29041 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 12:09 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<o42dnbVP6YPaltT9nZ2dnUU7-T3NnZ2d@giganews.com>
In reply to#29039
On 3/10/2021 11:57 AM, André G. Isaak wrote:
> On 2021-03-10 10:35, olcott wrote:
>> On 3/10/2021 10:33 AM, André G. Isaak wrote:
>>> On 2021-03-10 09:03, olcott wrote:
>>>> On 3/10/2021 9:43 AM, André G. Isaak wrote:
>>>>> On 2021-03-10 08:19, olcott wrote:
>>>>>> On 3/9/2021 10:58 PM, André G. Isaak wrote:
>>>>>
>>>>> <snippage>
>>>>>
>>>>>>> As I pointed out in a previous post (which you ignored), your 
>>>>>>> Halts() cannot correctly decide an H_Hat which is derived from 
>>>>>>> Halts() according to the actual rules set out by Linz, i.e. one 
>>>>>>> in which H_Hat contains a *complete copy* of Halts with some 
>>>>>>> additional state-transitions appended. Your strategy of looking 
>>>>>>> for a routine calling itself isn't going to work here since each 
>>>>>>> instance of Halts (the uppermost one, the one in the uppermost 
>>>>>>> H_Hat, etc.) will have separate addresses.
>>>>>>>
>>>>>>> Even using your construction with function pointers passed, it 
>>>>>>> doesn't work for the *actual* halting problem as opposed to your 
>>>>>>> weird redefined-with-subjunctives versions of it.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> The actual rules by Linz to not make a difference, Sipser does not 
>>>>>> use them. Once you acknowledge that I have refuted the simplest 
>>>>>> example of the halting problem counter-examples then and only then 
>>>>>> will I work on the more complex ones. I will not tolerate endless 
>>>>>> disgression from the point.
>>>>>
>>>>> Of course it matters. And Sipser uses the exact same rules. You're 
>>>>> hung-up on Sipser's use of the term 'subroutine' because you don't 
>>>>> grasp how Turing Machines work.
>>>>
>>>> The key element of the halting problem counter-examples that makes 
>>>> them undecidable is that the input program does the opposite if 
>>>> whatever the halt decider decides.
>>>>
>>>>     Once D has determined this information, it does the
>>>>     opposite. That is, it rejects if M accepts and accepts
>>>>     if M does not accept. (Sipser 1997:165)
>>>>
>>>> Once you acknowledge that I have conquered that then I will allow 
>>>> the conversation to digress to other points. Prior to 
>>>> acknowledgement of that I will only consider these digressions as 
>>>> dishonest dodges used as a mere tactic to make sure that the point 
>>>> is never addressed.
>>>
>>>
>>> I can't acknowledge something which is false.
>>
>> If you cannot acknowledge that I have refuted every conventional 
>> halting problem counter-example that does not copy its input then you 
>> are dishonestly dodging the point and there is no sense proceeding.
>>
>> At the point in time that you acknowledge that my halt decider does 
>> correctly decide the conventional halting problem counter-examples 
>> that do not copy their input then I will begin to address the ones 
>> that do copy their input. Until that time I will simply assume that 
>> you are a mere naysayer that will always disagree with whatever I say.
> 
> This has nothing to do with whether the input is copied. It has to do 
> with whether H_Hat is constructed by making a copy of the 
> state-transitions of H rather than calling some external subroutine 
> (which wouldn't even be possible for actual Turing Machines).
> 
> André
> 

If you cannot acknowledge that Halts correctly decides that H_Hat() 
would not halt unless Halts() stops simulating H_Hat() then you have 
proven that you have no interest in an honest dialogue.

void H_Hat(u32 P)
{
   u32 Input_Halts = Halts(P, P);
   if (Input_Would_Halt)
     HERE: goto HERE;
}

int main()
{
   u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
   Output("Input_Would_Halt = ", Input_Would_Halt);
}

All of the details of the halting decision are provided on this link:

http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29048 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 12:09 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2b5h5$f40$1@dont-email.me>
In reply to#29041
On 2021-03-10 11:09, olcott wrote:
> On 3/10/2021 11:57 AM, André G. Isaak wrote:
>> On 2021-03-10 10:35, olcott wrote:
>>> On 3/10/2021 10:33 AM, André G. Isaak wrote:
>>>> On 2021-03-10 09:03, olcott wrote:
>>>>> On 3/10/2021 9:43 AM, André G. Isaak wrote:
>>>>>> On 2021-03-10 08:19, olcott wrote:
>>>>>>> On 3/9/2021 10:58 PM, André G. Isaak wrote:
>>>>>>
>>>>>> <snippage>
>>>>>>
>>>>>>>> As I pointed out in a previous post (which you ignored), your 
>>>>>>>> Halts() cannot correctly decide an H_Hat which is derived from 
>>>>>>>> Halts() according to the actual rules set out by Linz, i.e. one 
>>>>>>>> in which H_Hat contains a *complete copy* of Halts with some 
>>>>>>>> additional state-transitions appended. Your strategy of looking 
>>>>>>>> for a routine calling itself isn't going to work here since each 
>>>>>>>> instance of Halts (the uppermost one, the one in the uppermost 
>>>>>>>> H_Hat, etc.) will have separate addresses.
>>>>>>>>
>>>>>>>> Even using your construction with function pointers passed, it 
>>>>>>>> doesn't work for the *actual* halting problem as opposed to your 
>>>>>>>> weird redefined-with-subjunctives versions of it.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> The actual rules by Linz to not make a difference, Sipser does 
>>>>>>> not use them. Once you acknowledge that I have refuted the 
>>>>>>> simplest example of the halting problem counter-examples then and 
>>>>>>> only then will I work on the more complex ones. I will not 
>>>>>>> tolerate endless disgression from the point.
>>>>>>
>>>>>> Of course it matters. And Sipser uses the exact same rules. You're 
>>>>>> hung-up on Sipser's use of the term 'subroutine' because you don't 
>>>>>> grasp how Turing Machines work.
>>>>>
>>>>> The key element of the halting problem counter-examples that makes 
>>>>> them undecidable is that the input program does the opposite if 
>>>>> whatever the halt decider decides.
>>>>>
>>>>>     Once D has determined this information, it does the
>>>>>     opposite. That is, it rejects if M accepts and accepts
>>>>>     if M does not accept. (Sipser 1997:165)
>>>>>
>>>>> Once you acknowledge that I have conquered that then I will allow 
>>>>> the conversation to digress to other points. Prior to 
>>>>> acknowledgement of that I will only consider these digressions as 
>>>>> dishonest dodges used as a mere tactic to make sure that the point 
>>>>> is never addressed.
>>>>
>>>>
>>>> I can't acknowledge something which is false.
>>>
>>> If you cannot acknowledge that I have refuted every conventional 
>>> halting problem counter-example that does not copy its input then you 
>>> are dishonestly dodging the point and there is no sense proceeding.
>>>
>>> At the point in time that you acknowledge that my halt decider does 
>>> correctly decide the conventional halting problem counter-examples 
>>> that do not copy their input then I will begin to address the ones 
>>> that do copy their input. Until that time I will simply assume that 
>>> you are a mere naysayer that will always disagree with whatever I say.
>>
>> This has nothing to do with whether the input is copied. It has to do 
>> with whether H_Hat is constructed by making a copy of the 
>> state-transitions of H rather than calling some external subroutine 
>> (which wouldn't even be possible for actual Turing Machines).
>>
>> André
>>
> 
> If you cannot acknowledge that Halts correctly decides that H_Hat() 
> would not halt unless Halts() stops simulating H_Hat() then you have 
> proven that you have no interest in an honest dialogue.

I cannot acknowledge that because it is simply false. You haven't 
defined 'would not have halted' adequately, but under any interpretation 
I can come up with, your Halts() fails to produce the correct answer. 
Your Halts(H_Hat, H_Hat) claims that H_Hat(H_Hat) won't halt. Your 
(misnamed) H_Hat(H_Hat) does in fact halt. It therefore would have 
halted even if Halts() hadn't halted it.

André

> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Would_Halt)
>      HERE: goto HERE;
> }
> 
> int main()
> {
>    u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>    Output("Input_Would_Halt = ", Input_Would_Halt);
> }
> 
> All of the details of the halting decision are provided on this link:
> 
> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
> 
> 


-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29052 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 14:01 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<0p-dnXxplKwHuNT9nZ2dnUU7-aOdnZ2d@giganews.com>
In reply to#29048
On 3/10/2021 1:09 PM, André G. Isaak wrote:
> On 2021-03-10 11:09, olcott wrote:
>> On 3/10/2021 11:57 AM, André G. Isaak wrote:
>>> On 2021-03-10 10:35, olcott wrote:
>>>> On 3/10/2021 10:33 AM, André G. Isaak wrote:
>>>>> On 2021-03-10 09:03, olcott wrote:
>>>>>> On 3/10/2021 9:43 AM, André G. Isaak wrote:
>>>>>>> On 2021-03-10 08:19, olcott wrote:
>>>>>>>> On 3/9/2021 10:58 PM, André G. Isaak wrote:
>>>>>>>
>>>>>>> <snippage>
>>>>>>>
>>>>>>>>> As I pointed out in a previous post (which you ignored), your 
>>>>>>>>> Halts() cannot correctly decide an H_Hat which is derived from 
>>>>>>>>> Halts() according to the actual rules set out by Linz, i.e. one 
>>>>>>>>> in which H_Hat contains a *complete copy* of Halts with some 
>>>>>>>>> additional state-transitions appended. Your strategy of looking 
>>>>>>>>> for a routine calling itself isn't going to work here since 
>>>>>>>>> each instance of Halts (the uppermost one, the one in the 
>>>>>>>>> uppermost H_Hat, etc.) will have separate addresses.
>>>>>>>>>
>>>>>>>>> Even using your construction with function pointers passed, it 
>>>>>>>>> doesn't work for the *actual* halting problem as opposed to 
>>>>>>>>> your weird redefined-with-subjunctives versions of it.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> The actual rules by Linz to not make a difference, Sipser does 
>>>>>>>> not use them. Once you acknowledge that I have refuted the 
>>>>>>>> simplest example of the halting problem counter-examples then 
>>>>>>>> and only then will I work on the more complex ones. I will not 
>>>>>>>> tolerate endless disgression from the point.
>>>>>>>
>>>>>>> Of course it matters. And Sipser uses the exact same rules. 
>>>>>>> You're hung-up on Sipser's use of the term 'subroutine' because 
>>>>>>> you don't grasp how Turing Machines work.
>>>>>>
>>>>>> The key element of the halting problem counter-examples that makes 
>>>>>> them undecidable is that the input program does the opposite if 
>>>>>> whatever the halt decider decides.
>>>>>>
>>>>>>     Once D has determined this information, it does the
>>>>>>     opposite. That is, it rejects if M accepts and accepts
>>>>>>     if M does not accept. (Sipser 1997:165)
>>>>>>
>>>>>> Once you acknowledge that I have conquered that then I will allow 
>>>>>> the conversation to digress to other points. Prior to 
>>>>>> acknowledgement of that I will only consider these digressions as 
>>>>>> dishonest dodges used as a mere tactic to make sure that the point 
>>>>>> is never addressed.
>>>>>
>>>>>
>>>>> I can't acknowledge something which is false.
>>>>
>>>> If you cannot acknowledge that I have refuted every conventional 
>>>> halting problem counter-example that does not copy its input then 
>>>> you are dishonestly dodging the point and there is no sense proceeding.
>>>>
>>>> At the point in time that you acknowledge that my halt decider does 
>>>> correctly decide the conventional halting problem counter-examples 
>>>> that do not copy their input then I will begin to address the ones 
>>>> that do copy their input. Until that time I will simply assume that 
>>>> you are a mere naysayer that will always disagree with whatever I say.
>>>
>>> This has nothing to do with whether the input is copied. It has to do 
>>> with whether H_Hat is constructed by making a copy of the 
>>> state-transitions of H rather than calling some external subroutine 
>>> (which wouldn't even be possible for actual Turing Machines).
>>>
>>> André
>>>
>>
>> If you cannot acknowledge that Halts correctly decides that H_Hat() 
>> would not halt unless Halts() stops simulating H_Hat() then you have 
>> proven that you have no interest in an honest dialogue.
> 
> I cannot acknowledge that because it is simply false. You haven't 
> defined 'would not have halted' adequately, 

Sure I have right here:
http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29056 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 13:36 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2bak1$cdf$1@dont-email.me>
In reply to#29052
On 2021-03-10 13:01, olcott wrote:
> On 3/10/2021 1:09 PM, André G. Isaak wrote:

>> I cannot acknowledge that because it is simply false. You haven't 
>> defined 'would not have halted' adequately, 
> 
> Sure I have right here:
> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 

Nothing in there defines your subjunctive 'would have'.

The subjunctive entails some set of alternatives. Nowhere do you specify 
what that set of alternatives actually is.

You claim that Halts() must terminate H_Hat(H_Hat) since it 'would not 
otherwise' halt.

Except AFAICT if Halts() didn't terminate H_Hat(H_Hat), then the 
outermost H_Hat would terminate the inner H_Hat after which it would 
terminate. So in what sense would H_Hat(H_Hat) not have halted had 
Halts() not terminated it?

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29057 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 15:01 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<ufWdnexsjJcArtT9nZ2dnUU7-LPNnZ2d@giganews.com>
In reply to#29056
On 3/10/2021 2:36 PM, André G. Isaak wrote:
> On 2021-03-10 13:01, olcott wrote:
>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
> 
>>> I cannot acknowledge that because it is simply false. You haven't 
>>> defined 'would not have halted' adequately, 
>>
>> Sure I have right here:
>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
> 
> 
> Nothing in there defines your subjunctive 'would have'.
> 
> The subjunctive entails some set of alternatives. Nowhere do you specify 
> what that set of alternatives actually is.

As soon as Halts() detects that the execution trace of H_Hat() indicates 
that it is calling Halts() twice with the same data, the "would have" 
condition is met.

Only a person that is trying as hard as they possibly can to make sure 
that they do not understand this can through a pure ruse act as if they 
don't understand this.

This is from "possible worlds" semantics of modal logic.
https://plato.stanford.edu/entries/possible-worlds/

In one possible world Halts() stops simulating H_Hat().
In this possible world H_Hat() is not infinitely recursive.

In another possible world Halts() does not stop simulating H_Hat().
In this possible world H_Hat() is infinitely recursive.

This proves H_Hat() is infinitely recursive unless Halts() stops 
simulating it.

> You claim that Halts() must terminate H_Hat(H_Hat) since it 'would not 
> otherwise' halt.
> 
> Except AFAICT if Halts() didn't terminate H_Hat(H_Hat), then the 
> outermost H_Hat would terminate the inner H_Hat after which it would 
> terminate. So in what sense would H_Hat(H_Hat) not have halted had 
> Halts() not terminated it?
> 
> André
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29058 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 14:13 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2bcqn$noa$1@dont-email.me>
In reply to#29057
On 2021-03-10 14:01, olcott wrote:
> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>> On 2021-03-10 13:01, olcott wrote:
>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>
>>>> I cannot acknowledge that because it is simply false. You haven't 
>>>> defined 'would not have halted' adequately, 
>>>
>>> Sure I have right here:
>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>
>>
>>
>> Nothing in there defines your subjunctive 'would have'.
>>
>> The subjunctive entails some set of alternatives. Nowhere do you 
>> specify what that set of alternatives actually is.
> 
> As soon as Halts() detects that the execution trace of H_Hat() indicates 
> that it is calling Halts() twice with the same data, the "would have" 
> condition is met.
> 
> Only a person that is trying as hard as they possibly can to make sure 
> that they do not understand this can through a pure ruse act as if they 
> don't understand this.
> 
> This is from "possible worlds" semantics of modal logic.
> https://plato.stanford.edu/entries/possible-worlds/

You've never actually used modal logic, have you? Without specifying a 
set of worlds and some accessibility relation between those worlds it is 
entirely unclear what is meant by 'possible'.

> In one possible world Halts() stops simulating H_Hat().
> In this possible world H_Hat() is not infinitely recursive.
> 
> In another possible world Halts() does not stop simulating H_Hat().
> In this possible world H_Hat() is infinitely recursive.

Only one of the above worlds is actually a possible world if Halts() is 
constant across worlds.

And which Halts() are you talking about? The outermost one? the one 
embedded in the uppermost H_Hat? The one embedded in some other, lower 
H_Hat?

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29062 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 16:23 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<dNednVpzMthA29T9nZ2dnUU7-e3NnZ2d@giganews.com>
In reply to#29058
On 3/10/2021 3:13 PM, André G. Isaak wrote:
> On 2021-03-10 14:01, olcott wrote:
>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>> On 2021-03-10 13:01, olcott wrote:
>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>
>>>>> I cannot acknowledge that because it is simply false. You haven't 
>>>>> defined 'would not have halted' adequately, 
>>>>
>>>> Sure I have right here:
>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>
>>>
>>>
>>>
>>> Nothing in there defines your subjunctive 'would have'.
>>>
>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>> specify what that set of alternatives actually is.
>>
>> As soon as Halts() detects that the execution trace of H_Hat() 
>> indicates that it is calling Halts() twice with the same data, the 
>> "would have" condition is met.
>>
>> Only a person that is trying as hard as they possibly can to make sure 
>> that they do not understand this can through a pure ruse act as if 
>> they don't understand this.
>>
>> This is from "possible worlds" semantics of modal logic.
>> https://plato.stanford.edu/entries/possible-worlds/
> 
> You've never actually used modal logic, have you? Without specifying a 
> set of worlds and some accessibility relation between those worlds it is 
> entirely unclear what is meant by 'possible'.
> 
>> In one possible world Halts() stops simulating H_Hat().
>> In this possible world H_Hat() is not infinitely recursive.
>>
>> In another possible world Halts() does not stop simulating H_Hat().
>> In this possible world H_Hat() is infinitely recursive.
> 
> Only one of the above worlds is actually a possible world if Halts() is 
> constant across worlds.
That is not the way that possible world's works.
There is one possible world where Halts() is a pinball game simulation.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29067 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 15:48 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2bicp$au3$1@dont-email.me>
In reply to#29062
On 2021-03-10 15:23, olcott wrote:
> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>> On 2021-03-10 14:01, olcott wrote:
>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>> On 2021-03-10 13:01, olcott wrote:
>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>
>>>>>> I cannot acknowledge that because it is simply false. You haven't 
>>>>>> defined 'would not have halted' adequately, 
>>>>>
>>>>> Sure I have right here:
>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>
>>>>
>>>>
>>>>
>>>>
>>>> Nothing in there defines your subjunctive 'would have'.
>>>>
>>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>>> specify what that set of alternatives actually is.
>>>
>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>> indicates that it is calling Halts() twice with the same data, the 
>>> "would have" condition is met.
>>>
>>> Only a person that is trying as hard as they possibly can to make 
>>> sure that they do not understand this can through a pure ruse act as 
>>> if they don't understand this.
>>>
>>> This is from "possible worlds" semantics of modal logic.
>>> https://plato.stanford.edu/entries/possible-worlds/
>>
>> You've never actually used modal logic, have you? Without specifying a 
>> set of worlds and some accessibility relation between those worlds it 
>> is entirely unclear what is meant by 'possible'.
>>
>>> In one possible world Halts() stops simulating H_Hat().
>>> In this possible world H_Hat() is not infinitely recursive.
>>>
>>> In another possible world Halts() does not stop simulating H_Hat().
>>> In this possible world H_Hat() is infinitely recursive.
>>
>> Only one of the above worlds is actually a possible world if Halts() 
>> is constant across worlds.
> That is not the way that possible world's works.

You have no idea how possible world's work.

> There is one possible world where Halts() is a pinball game simulation.

And by that reasoning there is also a possible world in which H_Hat is 
simply a 'Hello World' program and in which Halts() doesn't stop 
simulating H_Hat. In that possible world, H_Hat halts despite not being 
halted by Halts(). So you can't claim that H_Hat would not have halted 
unless terminated by Halts.

If your worlds are not constrained in any way, then you cannot base any 
argument on such possible worlds. Modal logic is useless without some 
actual model specified.

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29069 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 17:01 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<Q-SdnaL05M1K0tT9nZ2dnUU78RHNnZ2d@giganews.com>
In reply to#29067
On 3/10/2021 4:48 PM, André G. Isaak wrote:
> On 2021-03-10 15:23, olcott wrote:
>> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>>> On 2021-03-10 14:01, olcott wrote:
>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>
>>>>>>> I cannot acknowledge that because it is simply false. You haven't 
>>>>>>> defined 'would not have halted' adequately, 
>>>>>>
>>>>>> Sure I have right here:
>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>>
>>>>>
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>
>>>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>>>> specify what that set of alternatives actually is.
>>>>
>>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>>> indicates that it is calling Halts() twice with the same data, the 
>>>> "would have" condition is met.
>>>>
>>>> Only a person that is trying as hard as they possibly can to make 
>>>> sure that they do not understand this can through a pure ruse act as 
>>>> if they don't understand this.
>>>>
>>>> This is from "possible worlds" semantics of modal logic.
>>>> https://plato.stanford.edu/entries/possible-worlds/
>>>
>>> You've never actually used modal logic, have you? Without specifying 
>>> a set of worlds and some accessibility relation between those worlds 
>>> it is entirely unclear what is meant by 'possible'.
>>>
>>>> In one possible world Halts() stops simulating H_Hat().
>>>> In this possible world H_Hat() is not infinitely recursive.
>>>>
>>>> In another possible world Halts() does not stop simulating H_Hat().
>>>> In this possible world H_Hat() is infinitely recursive.
>>>
>>> Only one of the above worlds is actually a possible world if Halts() 
>>> is constant across worlds.
>> That is not the way that possible world's works.
> 
> You have no idea how possible world's work.
> 
>> There is one possible world where Halts() is a pinball game simulation.
> 
> And by that reasoning there is also a possible world in which H_Hat is 
> simply a 'Hello World' program and in which Halts() doesn't stop 
> simulating H_Hat. In that possible world, H_Hat halts despite not being 
> halted by Halts(). So you can't claim that H_Hat would not have halted 
> unless terminated by Halts.
> 
> If your worlds are not constrained in any way, then you cannot base any 
> argument on such possible worlds. Modal logic is useless without some 
> actual model specified.
> 
> André
> 

Of all of the possibilities that can possibly be there are at least 
these two:

(1) Halts stops simulating H_Hat() because H_Hat() specifies what would 
otherwise be infinite recursion if Halts() did not stop simulating it.

(2) Halts does not stops simulating H_Hat() thus H_Hat() continues to 
invoke Halts() in infinite recursion.

I am not going to keep playing whack-a-mole with you much longer.
I will simply write you off a dishonest.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29076 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 16:58 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2bmeu$em8$1@dont-email.me>
In reply to#29069
On 2021-03-10 16:01, olcott wrote:
> On 3/10/2021 4:48 PM, André G. Isaak wrote:
>> On 2021-03-10 15:23, olcott wrote:
>>> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>>>> On 2021-03-10 14:01, olcott wrote:
>>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>>
>>>>>>>> I cannot acknowledge that because it is simply false. You 
>>>>>>>> haven't defined 'would not have halted' adequately, 
>>>>>>>
>>>>>>> Sure I have right here:
>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>>
>>>>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>>>>> specify what that set of alternatives actually is.
>>>>>
>>>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>>>> indicates that it is calling Halts() twice with the same data, the 
>>>>> "would have" condition is met.
>>>>>
>>>>> Only a person that is trying as hard as they possibly can to make 
>>>>> sure that they do not understand this can through a pure ruse act 
>>>>> as if they don't understand this.
>>>>>
>>>>> This is from "possible worlds" semantics of modal logic.
>>>>> https://plato.stanford.edu/entries/possible-worlds/
>>>>
>>>> You've never actually used modal logic, have you? Without specifying 
>>>> a set of worlds and some accessibility relation between those worlds 
>>>> it is entirely unclear what is meant by 'possible'.
>>>>
>>>>> In one possible world Halts() stops simulating H_Hat().
>>>>> In this possible world H_Hat() is not infinitely recursive.
>>>>>
>>>>> In another possible world Halts() does not stop simulating H_Hat().
>>>>> In this possible world H_Hat() is infinitely recursive.
>>>>
>>>> Only one of the above worlds is actually a possible world if Halts() 
>>>> is constant across worlds.
>>> That is not the way that possible world's works.
>>
>> You have no idea how possible world's work.
>>
>>> There is one possible world where Halts() is a pinball game simulation.
>>
>> And by that reasoning there is also a possible world in which H_Hat is 
>> simply a 'Hello World' program and in which Halts() doesn't stop 
>> simulating H_Hat. In that possible world, H_Hat halts despite not 
>> being halted by Halts(). So you can't claim that H_Hat would not have 
>> halted unless terminated by Halts.
>>
>> If your worlds are not constrained in any way, then you cannot base 
>> any argument on such possible worlds. Modal logic is useless without 
>> some actual model specified.
>>
>> André
>>
> 
> Of all of the possibilities that can possibly be there are at least 
> these two:
> 
> (1) Halts stops simulating H_Hat() because H_Hat() specifies what would 
> otherwise be infinite recursion if Halts() did not stop simulating it.
> 
> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues to 
> invoke Halts() in infinite recursion.

And what does that show? With unconstrained possibilities, we also have

(3) Halts does not stop simulating H_Hat() and H_Hat terminates normally.

(4) Halts attempts to stop the simulation but fails because Halts is 
broken in that world, but H_Hat stops anyways.

(5) Halts attempts to stop the simulation but fails and H_Hat gets stuck 
in an infinite loop

(6) H_Hat prints 'hello world' on the screen and halts. Halts() is a 
block of cheese.

If all of the above are also 'possible worlds' how can you meaningfully 
claim that H_Hat would not have halted unless Halts() had stopped 
simulating it?

Claiming that certain things are *possible* in some model doesn't 
demonstrate anything. To make an argument you'd need to actually express 
some sort of relationship between possibilities.

Of course to do that, you'd need to learn modal logic, which you're not 
going to be able to do using only a short Stanford Encyclopaedia article.

If you really think modal logic somehow clarifies your argument, then 
present an actual argument using modal logic. It might be easier, 
though, for you to simply admit that you threw out the term 'modal 
logic' because you thought it sounded good despite having no actual idea 
of what it is.

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29081 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 18:34 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<j4GdnQFfFPAa-NT9nZ2dnUU7-VfNnZ2d@giganews.com>
In reply to#29076
On 3/10/2021 5:58 PM, André G. Isaak wrote:
> On 2021-03-10 16:01, olcott wrote:
>> On 3/10/2021 4:48 PM, André G. Isaak wrote:
>>> On 2021-03-10 15:23, olcott wrote:
>>>> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>>>>> On 2021-03-10 14:01, olcott wrote:
>>>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>>>
>>>>>>>>> I cannot acknowledge that because it is simply false. You 
>>>>>>>>> haven't defined 'would not have halted' adequately, 
>>>>>>>>
>>>>>>>> Sure I have right here:
>>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>>>
>>>>>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>>>>>> specify what that set of alternatives actually is.
>>>>>>
>>>>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>>>>> indicates that it is calling Halts() twice with the same data, the 
>>>>>> "would have" condition is met.
>>>>>>
>>>>>> Only a person that is trying as hard as they possibly can to make 
>>>>>> sure that they do not understand this can through a pure ruse act 
>>>>>> as if they don't understand this.
>>>>>>
>>>>>> This is from "possible worlds" semantics of modal logic.
>>>>>> https://plato.stanford.edu/entries/possible-worlds/
>>>>>
>>>>> You've never actually used modal logic, have you? Without 
>>>>> specifying a set of worlds and some accessibility relation between 
>>>>> those worlds it is entirely unclear what is meant by 'possible'.
>>>>>
>>>>>> In one possible world Halts() stops simulating H_Hat().
>>>>>> In this possible world H_Hat() is not infinitely recursive.
>>>>>>
>>>>>> In another possible world Halts() does not stop simulating H_Hat().
>>>>>> In this possible world H_Hat() is infinitely recursive.
>>>>>
>>>>> Only one of the above worlds is actually a possible world if 
>>>>> Halts() is constant across worlds.
>>>> That is not the way that possible world's works.
>>>
>>> You have no idea how possible world's work.
>>>
>>>> There is one possible world where Halts() is a pinball game simulation.
>>>
>>> And by that reasoning there is also a possible world in which H_Hat 
>>> is simply a 'Hello World' program and in which Halts() doesn't stop 
>>> simulating H_Hat. In that possible world, H_Hat halts despite not 
>>> being halted by Halts(). So you can't claim that H_Hat would not have 
>>> halted unless terminated by Halts.
>>>
>>> If your worlds are not constrained in any way, then you cannot base 
>>> any argument on such possible worlds. Modal logic is useless without 
>>> some actual model specified.
>>>
>>> André
>>>
>>
>> Of all of the possibilities that can possibly be there are at least 
>> these two:
>>
>> (1) Halts stops simulating H_Hat() because H_Hat() specifies what 
>> would otherwise be infinite recursion if Halts() did not stop 
>> simulating it.
>>
>> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues to 
>> invoke Halts() in infinite recursion.
> 
> And what does that show? 

It proves that If halts does not stop simulating H_Hat() that H_Hat() 
would be infinitely recursive.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29084 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 17:45 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2bp7e$1l0$1@dont-email.me>
In reply to#29081
On 2021-03-10 17:34, olcott wrote:
> On 3/10/2021 5:58 PM, André G. Isaak wrote:
>> On 2021-03-10 16:01, olcott wrote:
>>> On 3/10/2021 4:48 PM, André G. Isaak wrote:
>>>> On 2021-03-10 15:23, olcott wrote:
>>>>> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>>>>>> On 2021-03-10 14:01, olcott wrote:
>>>>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>>>>
>>>>>>>>>> I cannot acknowledge that because it is simply false. You 
>>>>>>>>>> haven't defined 'would not have halted' adequately, 
>>>>>>>>>
>>>>>>>>> Sure I have right here:
>>>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>>>>
>>>>>>>> The subjunctive entails some set of alternatives. Nowhere do you 
>>>>>>>> specify what that set of alternatives actually is.
>>>>>>>
>>>>>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>>>>>> indicates that it is calling Halts() twice with the same data, 
>>>>>>> the "would have" condition is met.
>>>>>>>
>>>>>>> Only a person that is trying as hard as they possibly can to make 
>>>>>>> sure that they do not understand this can through a pure ruse act 
>>>>>>> as if they don't understand this.
>>>>>>>
>>>>>>> This is from "possible worlds" semantics of modal logic.
>>>>>>> https://plato.stanford.edu/entries/possible-worlds/
>>>>>>
>>>>>> You've never actually used modal logic, have you? Without 
>>>>>> specifying a set of worlds and some accessibility relation between 
>>>>>> those worlds it is entirely unclear what is meant by 'possible'.
>>>>>>
>>>>>>> In one possible world Halts() stops simulating H_Hat().
>>>>>>> In this possible world H_Hat() is not infinitely recursive.
>>>>>>>
>>>>>>> In another possible world Halts() does not stop simulating H_Hat().
>>>>>>> In this possible world H_Hat() is infinitely recursive.
>>>>>>
>>>>>> Only one of the above worlds is actually a possible world if 
>>>>>> Halts() is constant across worlds.
>>>>> That is not the way that possible world's works.
>>>>
>>>> You have no idea how possible world's work.
>>>>
>>>>> There is one possible world where Halts() is a pinball game 
>>>>> simulation.
>>>>
>>>> And by that reasoning there is also a possible world in which H_Hat 
>>>> is simply a 'Hello World' program and in which Halts() doesn't stop 
>>>> simulating H_Hat. In that possible world, H_Hat halts despite not 
>>>> being halted by Halts(). So you can't claim that H_Hat would not 
>>>> have halted unless terminated by Halts.
>>>>
>>>> If your worlds are not constrained in any way, then you cannot base 
>>>> any argument on such possible worlds. Modal logic is useless without 
>>>> some actual model specified.
>>>>
>>>> André
>>>>
>>>
>>> Of all of the possibilities that can possibly be there are at least 
>>> these two:
>>>
>>> (1) Halts stops simulating H_Hat() because H_Hat() specifies what 
>>> would otherwise be infinite recursion if Halts() did not stop 
>>> simulating it.
>>>
>>> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues to 
>>> invoke Halts() in infinite recursion.
>>
>> And what does that show? 
> 
> It proves that If halts does not stop simulating H_Hat() that H_Hat() 
> would be infinitely recursive.

It would only show that if those were the *only* two possibilities. You 
conveniently cut the rest of my post where I outlined other 
possibilities. I'll add the critical one back.

(3) Halts does not stop simulating H_Hat() and H_Hat terminates normally.

Unless you can exclude (3) from the set of possible worlds, you haven't 
proven anything. But to exclude (3) you'd actually need to actually put 
constraints on which worlds are possible. What constraints would rule 
out (3)?

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29087 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 19:05 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<aNqdnXw8AqV28dT9nZ2dnUU7-I2dnZ2d@giganews.com>
In reply to#29084
On 3/10/2021 6:45 PM, André G. Isaak wrote:
> On 2021-03-10 17:34, olcott wrote:
>> On 3/10/2021 5:58 PM, André G. Isaak wrote:
>>> On 2021-03-10 16:01, olcott wrote:
>>>> On 3/10/2021 4:48 PM, André G. Isaak wrote:
>>>>> On 2021-03-10 15:23, olcott wrote:
>>>>>> On 3/10/2021 3:13 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-10 14:01, olcott wrote:
>>>>>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>>>>>
>>>>>>>>>>> I cannot acknowledge that because it is simply false. You 
>>>>>>>>>>> haven't defined 'would not have halted' adequately, 
>>>>>>>>>>
>>>>>>>>>> Sure I have right here:
>>>>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>>>>>
>>>>>>>>> The subjunctive entails some set of alternatives. Nowhere do 
>>>>>>>>> you specify what that set of alternatives actually is.
>>>>>>>>
>>>>>>>> As soon as Halts() detects that the execution trace of H_Hat() 
>>>>>>>> indicates that it is calling Halts() twice with the same data, 
>>>>>>>> the "would have" condition is met.
>>>>>>>>
>>>>>>>> Only a person that is trying as hard as they possibly can to 
>>>>>>>> make sure that they do not understand this can through a pure 
>>>>>>>> ruse act as if they don't understand this.
>>>>>>>>
>>>>>>>> This is from "possible worlds" semantics of modal logic.
>>>>>>>> https://plato.stanford.edu/entries/possible-worlds/
>>>>>>>
>>>>>>> You've never actually used modal logic, have you? Without 
>>>>>>> specifying a set of worlds and some accessibility relation 
>>>>>>> between those worlds it is entirely unclear what is meant by 
>>>>>>> 'possible'.
>>>>>>>
>>>>>>>> In one possible world Halts() stops simulating H_Hat().
>>>>>>>> In this possible world H_Hat() is not infinitely recursive.
>>>>>>>>
>>>>>>>> In another possible world Halts() does not stop simulating H_Hat().
>>>>>>>> In this possible world H_Hat() is infinitely recursive.
>>>>>>>
>>>>>>> Only one of the above worlds is actually a possible world if 
>>>>>>> Halts() is constant across worlds.
>>>>>> That is not the way that possible world's works.
>>>>>
>>>>> You have no idea how possible world's work.
>>>>>
>>>>>> There is one possible world where Halts() is a pinball game 
>>>>>> simulation.
>>>>>
>>>>> And by that reasoning there is also a possible world in which H_Hat 
>>>>> is simply a 'Hello World' program and in which Halts() doesn't stop 
>>>>> simulating H_Hat. In that possible world, H_Hat halts despite not 
>>>>> being halted by Halts(). So you can't claim that H_Hat would not 
>>>>> have halted unless terminated by Halts.
>>>>>
>>>>> If your worlds are not constrained in any way, then you cannot base 
>>>>> any argument on such possible worlds. Modal logic is useless 
>>>>> without some actual model specified.
>>>>>
>>>>> André
>>>>>
>>>>
>>>> Of all of the possibilities that can possibly be there are at least 
>>>> these two:
>>>>
>>>> (1) Halts stops simulating H_Hat() because H_Hat() specifies what 
>>>> would otherwise be infinite recursion if Halts() did not stop 
>>>> simulating it.
>>>>
>>>> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues 
>>>> to invoke Halts() in infinite recursion.
>>>
>>> And what does that show? 
>>
>> It proves that If halts does not stop simulating H_Hat() that H_Hat() 
>> would be infinitely recursive.
> 
> It would only show that if those were the *only* two possibilities. 

I give up you are simply a dishonest jackass.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29096 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-10 20:36 -0700
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<s2c38i$65u$1@dont-email.me>
In reply to#29087
On 2021-03-10 18:05, olcott wrote:
> On 3/10/2021 6:45 PM, André G. Isaak wrote:
>> On 2021-03-10 17:34, olcott wrote:
>>> On 3/10/2021 5:58 PM, André G. Isaak wrote:
>>>> On 2021-03-10 16:01, olcott wrote:

>>>>> Of all of the possibilities that can possibly be there are at least 
>>>>> these two:
>>>>>
>>>>> (1) Halts stops simulating H_Hat() because H_Hat() specifies what 
>>>>> would otherwise be infinite recursion if Halts() did not stop 
>>>>> simulating it.
>>>>>
>>>>> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues 
>>>>> to invoke Halts() in infinite recursion.
>>>>
>>>> And what does that show? 
>>>
>>> It proves that If halts does not stop simulating H_Hat() that H_Hat() 
>>> would be infinitely recursive.
>>
>> It would only show that if those were the *only* two possibilities. 
> 
> I give up you are simply a dishonest jackass.

Maybe instead of hurling insults, you should try to actually process 
what was being said.

You were the one who first introduced the idea of possible worlds. From 
a bit earlier in this thread we have the following:

 >>> In one possible world Halts() stops simulating H_Hat().
 >>> In this possible world H_Hat() is not infinitely recursive.
 >>
 >>> In another possible world Halts() does not stop simulating H_Hat().
 >>> In this possible world H_Hat() is infinitely recursive.
 >
 >> Only one of the above worlds is actually a possible world if Halts() 
is constant across worlds.
 > That is not the way that possible world's works.
 > There is one possible world where Halts() is a pinball game simulation.

I'm trying to get you to see that this isn't the way to look at things.

If you are going to allow for worlds in which all functions can be 
arbitrarily be replaced by anything (such as a pinball simulation or a 
block of cheese), then you're not going to be able to make any sorts of 
meaningful argument.

Clearly, you are not interested in worlds where Halts() acts a pinball 
game since they don't shed any light on your argument.

You're really only interested in two sets of worlds: those worlds in 
which Halts() behaves just like it does in the actual world, and those 
in which Halts() behaves *almost* like it does in the actual world, 
except that where the actual Halts() aborts its simulation, this 
alternate possible Halts() does not (assume that the abort code has been 
replaced by a sequence of no operations). Call those sets of worlds W 
and W'.

So now the question is whether we want to allow any leeway in how H_Hat 
behaves across these possible worlds. If we allow it to change 
arbitrarily, then it could potentially appear as a 'hello world' program 
which will always halt regardless of whether Halts() stops simulating it 
or not. That would result in the possibility (3) I'd mentioned which you 
conveniently snipped:

(3) Halts does not stop simulating H_Hat() and H_Hat terminates normally.

Again, having H_Hat behave like a 'hello world' program wouldn't shed 
any light whatsoever on your 'decider', so it makes sense not to 
consider such worlds.

So that leaves us with only *two* possible worlds worth considering.

These are

W. The actual world, in which Halts() has the ability to terminate a 
simulation that it thinks will run forever,

and

W'. The other possible world, in which the 'abort' code has been 
replaced by NOPs.

In all other respects these two worlds are identical. IOW, H_Hat is kept 
constant across the two of these.

The point of all of the above (and of my previous posts which you 
dismissed as me being a 'Jackass') is to get you to see that invoking 
'possible worlds' is completely useless if you allow anything you can 
imagine to be included in your possible worlds. Modal logic is useful 
only when you carefully constrain the set of possible worlds to ones 
actually relevant to the issue being explored (which is why you probably 
shouldn't start invoking fields which you know absolutely nothing about).

Can we agree that the above two worlds, W and W', are really the only 
ones of interest to us before proceeding further?

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#29097 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 21:40 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<1ZidnbmL46aoDNT9nZ2dnUU7-YWdnZ2d@giganews.com>
In reply to#29096
On 3/10/2021 9:36 PM, André G. Isaak wrote:
> On 2021-03-10 18:05, olcott wrote:
>> On 3/10/2021 6:45 PM, André G. Isaak wrote:
>>> On 2021-03-10 17:34, olcott wrote:
>>>> On 3/10/2021 5:58 PM, André G. Isaak wrote:
>>>>> On 2021-03-10 16:01, olcott wrote:
> 
>>>>>> Of all of the possibilities that can possibly be there are at 
>>>>>> least these two:
>>>>>>
>>>>>> (1) Halts stops simulating H_Hat() because H_Hat() specifies what 
>>>>>> would otherwise be infinite recursion if Halts() did not stop 
>>>>>> simulating it.
>>>>>>
>>>>>> (2) Halts does not stops simulating H_Hat() thus H_Hat() continues 
>>>>>> to invoke Halts() in infinite recursion.
>>>>>
>>>>> And what does that show? 
>>>>
>>>> It proves that If halts does not stop simulating H_Hat() that 
>>>> H_Hat() would be infinitely recursive.
>>>
>>> It would only show that if those were the *only* two possibilities. 
>>
>> I give up you are simply a dishonest jackass.
> 
> Maybe instead of hurling insults, you should try to actually process 
> what was being said.
> 
> You were the one who first introduced the idea of possible worlds. From 
> a bit earlier in this thread we have the following:
> 
>  >>> In one possible world Halts() stops simulating H_Hat().
>  >>> In this possible world H_Hat() is not infinitely recursive.
>  >>
>  >>> In another possible world Halts() does not stop simulating H_Hat().
>  >>> In this possible world H_Hat() is infinitely recursive.
>  >
>  >> Only one of the above worlds is actually a possible world if Halts() 
> is constant across worlds.
>  > That is not the way that possible world's works.
>  > There is one possible world where Halts() is a pinball game simulation.
> 
> I'm trying to get you to see that this isn't the way to look at things.

There is one way to understand what I am saying and you are doing 
everthing that you possible can to make sure that you miss the point.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29073 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-03-10 23:49 +0000
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<20210310154241.473@kylheku.com>
In reply to#29057
On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>> On 2021-03-10 13:01, olcott wrote:
>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>> 
>>>> I cannot acknowledge that because it is simply false. You haven't 
>>>> defined 'would not have halted' adequately, 
>>>
>>> Sure I have right here:
>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf 
>> 
>> 
>> Nothing in there defines your subjunctive 'would have'.
>> 
>> The subjunctive entails some set of alternatives. Nowhere do you specify 
>> what that set of alternatives actually is.
>
> As soon as Halts() detects that the execution trace of H_Hat() indicates 
> that it is calling Halts() twice with the same data, the "would have" 
> condition is met.

No it isn't, because Halts has the potential to return zero,
being a clever simulator that can make such a decision.

To be sure that isn't happening, you must trace the complex instruction
sequence inside Halts.

There, you encounter conditional branching left and right.

You're assuming that when the simulated H_Hat enters Halts,
that Halts is the transparent simulator (or, equivalently
just a P(I) call), and not the aborting simulator.

But when the top-level call to Halt calls Halts, it is not transparent;
it is the aborting simulator.

So that's a different H_Hat.

> Only a person that is trying as hard as they possibly can to make sure 
> that they do not understand this can through a pure ruse act as if they 
> don't understand this.
>
> This is from "possible worlds" semantics of modal logic.
> https://plato.stanford.edu/entries/possible-worlds/
>
> In one possible world Halts() stops simulating H_Hat().
> In this possible world H_Hat() is not infinitely recursive.

The problem is that you are changing the definition of H_Hat and Halts
as you jump between possible worlds.

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

[toc] | [prev] | [next] | [standalone]


#29075 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 17:57 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<u4udnWfFiqVjwdT9nZ2dnUU78bvNnZ2d@giganews.com>
In reply to#29073
On 3/10/2021 5:49 PM, Kaz Kylheku wrote:
> On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>> On 2021-03-10 13:01, olcott wrote:
>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>
>>>>> I cannot acknowledge that because it is simply false. You haven't
>>>>> defined 'would not have halted' adequately,
>>>>
>>>> Sure I have right here:
>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>
>>>
>>> Nothing in there defines your subjunctive 'would have'.
>>>
>>> The subjunctive entails some set of alternatives. Nowhere do you specify
>>> what that set of alternatives actually is.
>>
>> As soon as Halts() detects that the execution trace of H_Hat() indicates
>> that it is calling Halts() twice with the same data, the "would have"
>> condition is met.
> 
> No it isn't, because Halts has the potential to return zero,
> being a clever simulator that can make such a decision.

This is not the point in the execution trace that we are talking about.

We are talking about the point in the execution trace of H_Hat() where 
H_Hat has called Halts() twice in sequence from the same address with 
the same data...





-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#29077 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-03-11 00:18 +0000
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<20210310160802.103@kylheku.com>
In reply to#29075
On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
> On 3/10/2021 5:49 PM, Kaz Kylheku wrote:
>> On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>> On 2021-03-10 13:01, olcott wrote:
>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>
>>>>>> I cannot acknowledge that because it is simply false. You haven't
>>>>>> defined 'would not have halted' adequately,
>>>>>
>>>>> Sure I have right here:
>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>>
>>>>
>>>> Nothing in there defines your subjunctive 'would have'.
>>>>
>>>> The subjunctive entails some set of alternatives. Nowhere do you specify
>>>> what that set of alternatives actually is.
>>>
>>> As soon as Halts() detects that the execution trace of H_Hat() indicates
>>> that it is calling Halts() twice with the same data, the "would have"
>>> condition is met.
>> 
>> No it isn't, because Halts has the potential to return zero,
>> being a clever simulator that can make such a decision.
>
> This is not the point in the execution trace that we are talking about.
>
> We are talking about the point in the execution trace of H_Hat() where 
> H_Hat has called Halts() twice in sequence from the same address with 
> the same data...

That's not a valid runaway-recursion-detecting criterion in your system,
though! You have an aborting simulator which makes it possible for a
recurring call to the same function with the same arguments to
terminate after a couple nestings, such that Halts suddenly returns
zero.

It's valid criterion in the system where Halts(P, I) is a non-aborting
simulator, or just the call P(I).  But, in that system, the detection is
not there to catch that condition.

When H_Hat calls Halts, it gets a zero, and returns.

If the exact same thing does not happen when H_Hat is simulated, then
the simulation is not accurate. By not being accurate, it changes the
behavior of H_Hat, so its conclusions are about a different function.

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

[toc] | [prev] | [next] | [standalone]


#29085 — Re: Refuting the halting problem proofs with fully operational code (honest dialogue?)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-10 19:01 -0600
SubjectRe: Refuting the halting problem proofs with fully operational code (honest dialogue?)
Message-ID<5I-dnfluNOd59tT9nZ2dnUU7-c3NnZ2d@giganews.com>
In reply to#29077
On 3/10/2021 6:18 PM, Kaz Kylheku wrote:
> On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
>> On 3/10/2021 5:49 PM, Kaz Kylheku wrote:
>>> On 2021-03-10, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/10/2021 2:36 PM, André G. Isaak wrote:
>>>>> On 2021-03-10 13:01, olcott wrote:
>>>>>> On 3/10/2021 1:09 PM, André G. Isaak wrote:
>>>>>
>>>>>>> I cannot acknowledge that because it is simply false. You haven't
>>>>>>> defined 'would not have halted' adequately,
>>>>>>
>>>>>> Sure I have right here:
>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>>>
>>>>>
>>>>> Nothing in there defines your subjunctive 'would have'.
>>>>>
>>>>> The subjunctive entails some set of alternatives. Nowhere do you specify
>>>>> what that set of alternatives actually is.
>>>>
>>>> As soon as Halts() detects that the execution trace of H_Hat() indicates
>>>> that it is calling Halts() twice with the same data, the "would have"
>>>> condition is met.
>>>
>>> No it isn't, because Halts has the potential to return zero,
>>> being a clever simulator that can make such a decision.
>>
>> This is not the point in the execution trace that we are talking about.
>>
>> We are talking about the point in the execution trace of H_Hat() where
>> H_Hat has called Halts() twice in sequence from the same address with
>> the same data...
> 
> That's not a valid runaway-recursion-detecting criterion in your system,
> though! You have an aborting simulator which makes it possible for a
> recurring call to the same function with the same arguments to
> terminate after a couple nestings, such that Halts suddenly returns
> zero.

You don't understand the code well enough.
Returing 0 does not stop the infinite recursion.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


Page 15 of 23 — ← Prev page 1 … 13 14 [15] 16 17 … 23  Next page →

Back to top | Article view | comp.theory


csiph-web