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


Groups > comp.theory > #28134 > unrolled thread

Detecting infinite recursion

Started byolcott <NoOne@NoWhere.com>
First post2021-02-26 13:53 -0600
Last post2021-03-09 18:31 -0800
Articles 20 on this page of 736 — 18 participants

Back to article view | Back to comp.theory


Contents

  Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 13:53 -0600
    Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-02-26 12:41 -0800
      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 15:00 -0600
        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 10:18 -0500
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 09:26 -0600
            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 13:57 -0500
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 14:40 -0600
                Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-27 21:52 +0000
                  Re: Detecting infinite recursion Jeff Barnett <jbb@notatt.com> - 2021-02-27 15:10 -0700
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 16:12 -0600
                    Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-27 22:42 +0000
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 18:37 -0600
                        Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-28 11:46 +0000
                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 21:43 -0500
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 20:59 -0600
                        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 22:30 -0500
                          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 22:10 -0600
                            Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 14:24 +0000
                              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-28 08:34 -0600
                                Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 16:26 +0000
                                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-28 10:34 -0600
                                    Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 17:20 +0000
                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 13:08 -0600
                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-02-28 20:15 +0000
                                          Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 14:55 -0600
                                            Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-01 02:30 +0000
                                              Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 20:51 -0600
                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 03:52 +0000
                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 22:19 -0600
                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-01 13:10 +0000
                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 08:30 -0600
                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-01 15:20 +0000
                                                  Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 09:41 -0600
                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 08:24 -0600
                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 17:06 +0000
                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 16:52 +0000
                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 11:30 -0600
                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 18:25 +0000
                                                  Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 12:47 -0600
                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 14:29 -0500
                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 15:17 -0600
                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 16:31 -0500
                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 15:50 -0600
                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 17:54 -0500
                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 17:46 -0600
                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 19:54 -0500
                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 19:39 +0000
                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 14:22 -0600
                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-01 22:42 +0000
                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 17:00 -0600
                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-02 01:00 +0000
                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 19:31 -0600
                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-02 02:22 +0000
                                                                  Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 21:05 -0600
                                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 21:32 -0600
                                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 02:34 -0800
                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 08:45 -0600
                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 10:55 -0500
                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 09:58 -0600
                                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 12:01 -0500
                                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 11:42 -0600
                                                                                  Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:05 -0500
                                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-03 14:54 +0000
                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 12:41 -0600
                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-03 21:13 +0000
                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 15:37 -0600
                                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-02 12:02 +0000
                                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 09:29 -0600
                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 00:53 +0000
                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:02 -0600
                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 01:26 +0000
                                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:35 -0600
                                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 01:52 +0000
                                                                                  Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 20:14 -0600
                                                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:49 -0500
                                                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 21:31 -0600
                                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 23:12 -0500
                                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 22:30 -0600
                                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 07:49 -0500
                                                                                    Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 11:44 +0000
                                                                                      Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 12:08 -0600
                                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:35 +0000
                                                                                        Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:42 -0500
                                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 16:59 -0600
                                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 18:23 -0500
                                                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 17:34 -0600
                                                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:36 -0500
                                                                                                  Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 18:45 -0600
                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:40 -0500
                                                                              Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:43 -0600
                                                                                Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:19 -0500
                                                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) om@iki.fi (Otto J. Makela) - 2021-03-03 14:52 +0200
                                                                            Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-03 13:52 +0000
                                          Re: Detecting infinite recursion (H_Hat is proved to be decidable) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2021-02-28 21:51 -0800
                            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 11:30 -0500
                              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 10:43 -0600
                                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 14:38 -0500
                                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 15:30 -0600
                                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 17:33 -0500
                                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 16:40 -0600
                                        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 18:08 -0500
                                          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 17:37 -0600
                                            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 19:22 -0500
                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 21:19 -0500
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 20:36 -0600
                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 22:01 -0500
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 21:30 -0600
    Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-02-26 12:48 -0800
    Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-26 21:37 +0000
      Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-02-26 15:26 -0800
        Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-26 21:49 -0800
          Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-26 21:56 -0800
    Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-02-27 01:58 +0000
      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 21:24 -0600
        Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-27 03:32 +0000
    Re: Detecting infinite recursion Jeff Barnett <jbb@notatt.com> - 2021-02-26 21:32 -0700
    Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-01 20:04 -0800
      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 22:18 -0600
        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 07:03 -0500
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 09:33 -0600
            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:00 -0500
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 10:23 -0600
                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:53 -0500
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:37 -0600
                    Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 09:43 -0800
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:57 -0600
                        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:16 -0500
                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 12:57 -0500
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:12 -0600
                        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:40 -0500
                          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:51 -0600
                            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 16:00 -0500
    Re: Detecting infinite recursion om@iki.fi (Otto J. Makela) - 2021-03-02 18:36 +0200
      Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:55 -0500
      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:22 -0600
        Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 17:46 +0000
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:00 -0600
            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 14:15 -0500
            Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 19:35 +0000
            Re: Detecting infinite recursion R Kym Horsell <kym@kymhorsell.com> - 2021-03-02 19:37 +0000
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:58 -0600
                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:50 -0500
            Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:50 -0600
              Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 19:57 +0000
                Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:20 -0600
                Re: Detecting infinite recursion Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2021-03-02 12:57 -0800
                  Re: Detecting infinite recursion gazelle@shell.xmission.com (Kenny McCormack) - 2021-03-03 02:17 +0000
        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:20 -0500
        Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-03-02 11:45 -0800
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:52 -0600
            Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 12:01 -0800
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:41 -0600
                Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-02 21:01 +0000
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:11 -0600
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:19 -0600
                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:15 -0500
                      Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 16:38 -0600
                        Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:44 -0500
                          Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 19:48 -0600
                            Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:25 -0500
                              Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 20:40 -0600
                                Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:57 -0500
                                  Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:03 -0600
                                    Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:05 -0600
                                    Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 22:29 -0500
                                      Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:33 -0600
                                        Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 22:54 -0500
                                          Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:58 -0600
                                            Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 23:24 -0500
                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-02 22:49 -0600
                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 08:07 -0500
                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 09:26 -0600
                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 12:35 -0500
                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 12:13 -0600
                                                        Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:27 -0500
                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 16:34 -0600
                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:59 -0500
                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 23:30 +0000
                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 18:05 -0600
                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:39 -0500
                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 18:46 -0600
                                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:19 -0500
                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:23 +0000
                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 19:45 -0600
                                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:56 +0000
                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:15 -0600
                                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 02:32 +0000
                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:48 -0600
                                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:27 -0500
                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 21:38 -0600
                                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:58 -0500
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:10 -0600
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:25 -0500
                                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 16:34 +0000
                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 11:45 -0600
                                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:31 +0000
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:50 -0600
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:43 +0000
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:01 -0600
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:04 -0500
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:50 -0600
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 09:44 -0500
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 12:03 +0000
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 09:09 -0600
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:36 -0500
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:19 +0000
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 10:25 -0600
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:45 -0500
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 21:16 +0000
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 15:31 -0600
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-06 13:58 +0000
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 09:01 -0600
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:12 -0500
                                                                                                          Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 09:58 -0600
                                                                                                            Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:33 -0500
                                                                                                              Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 10:59 -0600
                                                                                                                Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:10 -0500
                                                                                                                  Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 14:40 -0600
                                                                                                                    Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:28 -0500
                                                                                                                      Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 16:52 -0600
                                                                                                                        Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 18:34 -0500
                                                                                                                          Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 17:38 -0600
                                                                                                                            Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:10 -0500
                                                                                                                              Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 18:27 -0600
                                                                                                                                Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:36 -0500
                                                                                                                                  Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 18:50 -0600
                                                                                                                                    Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:34 -0500
                                                                                                                                      Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 20:36 -0600
                                                                                                                                        Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:05 -0500
                                                                                                                                          Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 21:18 -0600
                                                                                                                                            Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:53 -0500
                                                                                                                                              Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:01 -0600
                                                                                                                                                Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 08:35 -0500
                                                                                                                                                  Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:30 -0800
                                                                                                                                                    Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:49 -0500
                                                                                                                                                      Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:37 -0800
                                                                                                                                                        Re: Detecting infinite recursion (deciding Simulate) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 12:01 +0000
                                                                                                                                                          Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-08 18:01 -0800
                                                                                                                                                        Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:12 -0500
                                                                                                                                                          Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-08 18:03 -0800
                                                                                                                                            Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 21:01 -0700
                                                                                                                                              Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:09 -0600
                                                                                                                                                Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 21:23 -0700
                                                                                                                                                  Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:27 -0600
                                                                                                                                                    Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 23:56 -0700
                                                                                                                                                    Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:35 -0800
                                                                                                                                                  Re: Detecting infinite recursion (deciding Simulate) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 05:46 +0000
                                                                                                                                                    Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-07 00:17 -0600
                                                                                                                                                      Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 08:59 -0500
                                                                                                                                                Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:35 -0800
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 00:57 +0000
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:11 -0600
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 01:41 +0000
                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:50 -0600
                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:53 +0000
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-05 13:39 -0800
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 15:55 -0600
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-06 01:41 +0000
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 16:50 -0800
                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 21:41 +0000
                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 15:50 -0600
                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 00:44 +0000
                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 19:01 -0600
                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:46 +0000
                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:13 -0600
                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 02:34 +0000
                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:57 -0600
                                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 16:44 +0000
                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 11:42 -0600
                                                                        Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 19:36 +0000
                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 13:42 -0600
                                                                            Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 20:55 +0000
                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:12 -0600
                                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 17:08 -0500
                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:56 -0500
                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 14:19 -0600
                                                                              Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 15:48 -0500
                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:07 -0600
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 17:25 -0500
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:44 -0600
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 18:26 -0500
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:37 -0600
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 15:54 -0700
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:17 -0600
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 16:36 -0700
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:46 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 17:46 -0700
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:13 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 18:31 -0700
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:37 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 21:13 -0700
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:29 -0600
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 22:08 -0700
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:20 -0600
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 22:57 -0700
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 00:07 -0600
                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 23:51 -0700
                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:25 -0600
                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 09:23 -0700
                                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 10:27 -0600
                                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 12:26 -0700
                                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 13:47 -0600
                                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 15:20 -0500
                                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 19:07 -0600
                                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 20:48 -0500
                                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 20:01 -0600
                                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:21 -0500
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-04 15:23 -0800
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:35 -0600
                                                                              Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 21:05 +0000
                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:15 -0600
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 04:17 +0000
                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:46 -0600
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 11:26 +0000
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:56 -0600
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 15:45 +0000
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 10:00 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:17 -0500
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 17:39 +0000
                                                                                            Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 11:47 -0600
                                                                                              Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 15:22 -0500
                                                                                                Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 14:40 -0600
                                                                                                  Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 20:55 -0500
                                                                                              Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 00:53 +0000
                                                                                                Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-06 19:01 -0600
                                                                                                  Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:36 -0500
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-05 12:43 -0800
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 14:59 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-05 13:33 -0800
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:01 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:08 -0700
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:20 -0600
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:32 -0700
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:41 -0600
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:47 -0700
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:59 -0600
                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 20:11 -0700
                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 21:28 -0600
                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 20:47 -0700
                                                                                                                    Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 22:12 -0600
                                                                                                                      Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 21:39 -0700
                                                                                                                        Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 23:17 -0600
                                                                                                                          Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 22:31 -0700
                                                                                                                            Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 23:35 -0600
                                                                                                                              Re: Deciding the [would-not-halt] property (André's ignorance) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 02:36 -0800
                                                                                                                                Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:37 -0600
                                                                                                                                Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 08:16 -0700
                                                                                                                                  Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:32 -0600
                                                                                                                                Re: Deciding the [would-not-halt] property (identical functions) olcott <NoOne@NoWhere.com> - 2021-03-06 11:48 -0600
                                                                                                                              Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:10 -0500
                                                                                                                                Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:41 -0600
                                                                                                                                  Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:05 -0500
                                                                                                                                    Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:51 -0600
                                                                                                                              Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 08:09 -0700
                                                                                                                                Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:28 -0600
                                                                                                                          Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:05 -0500
                                                                                                                            Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:39 -0600
                                                                                                                              Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:08 -0500
                                                                                                                                Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:53 -0600
                                                                                                                                  Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:16 -0500
                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 23:52 -0500
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:02 -0500
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:00 -0500
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 23:59 +0000
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 18:23 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:17 +0000
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:33 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:54 -0500
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:08 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:14 -0500
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 14:44 -0600
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:34 -0500
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 16:56 -0600
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:26 -0500
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 18:34 -0600
                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:56 -0500
                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 20:10 -0600
                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:10 -0500
                                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 21:23 -0600
                                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 23:05 -0500
                                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 22:20 -0600
                                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 20:27 -0800
                                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 09:11 -0500
                                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-07 06:29 -0800
                                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 11:58 -0500
                                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:17 -0800
                                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-07 17:21 -0600
                                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 01:19 +0000
                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 19:34 -0600
                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:51 -0500
                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:01 -0600
                                                                                                                                          Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:11 -0500
                                                                                                                                            Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:19 -0600
                                                                                                                                              Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:40 -0500
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:50 -0600
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:28 -0500
                                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:39 -0600
                                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:25 -0500
                                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 10:34 -0600
                                                                                                                                                          Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:51 -0500
                                                                                                                                            Re: Detecting infinite recursion (1931 Gödel) André G. Isaak <agisaak@gm.invalid> - 2021-03-07 20:32 -0700
                                                                                                                                              Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:48 -0600
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 11:44 +0000
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:35 -0500
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:44 -0600
                                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:30 -0500
                                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 10:52 -0600
                                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 12:07 -0500
                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 02:24 +0000
                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:28 -0600
                                                                                                                                          Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 02:33 +0000
                                                                                                                                            Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:37 -0600
                                                                                                                                              Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:14 -0500
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:22 -0600
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:45 -0500
                                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:52 -0600
                                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 10:01 -0500
                                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:50 -0600
                                                                                                                                                          Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:33 -0500
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:17 -0800
                                                                                                                                              Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 12:34 +0000
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 04:58 -0800
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:11 -0800
                                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:28 -0800
                                                                                                                                                Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:26 -0600
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:34 -0500
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 16:54 +0000
                                                                                                                                                    Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 11:12 -0600
                                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:48 +0000
                                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 12:21 -0600
                                                                                                                                                      Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 13:43 -0500
                                                                                                                                                        Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 13:49 -0600
                                                                                                                                                          Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 15:19 -0500
                                                                                                                                                            Re: Detecting infinite recursion (Haskell Curry) olcott <NoOne@NoWhere.com> - 2021-03-08 20:38 -0600
                                                                                                                                                              Re: Detecting infinite recursion (Haskell Curry) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 18:55 -0800
                                                                                                                                                  Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 00:30 +0000
                                                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:59 -0500
                                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:34 +0000
                                                                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:30 +0000
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-07 02:47 -0800
                                                                                                              Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 09:27 -0600
                                                                                                                Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 09:36 -0600
                                                                                                                Re: Detecting infinite recursion (incorrect questions) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 21:04 -0500
                                                                                                                  Re: Detecting infinite recursion (incorrect questions) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:24 +0000
                                                                                                                    Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 20:32 -0600
                                                                                                                      Re: Detecting infinite recursion (incorrect questions) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:59 +0000
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 23:20 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:18 +0000
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 23:42 +0000
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 18:19 -0600
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 04:56 +0000
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:17 -0500
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 05:05 -0800
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 08:48 -0600
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 09:47 -0800
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:52 -0600
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:19 -0500
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 15:00 -0600
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:59 -0500
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 23:16 +0000
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:33 +0000
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:45 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 17:02 +0000
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:15 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 18:07 +0000
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:14 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:25 -0600
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 19:06 +0000
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 18:25 +0000
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:53 -0600
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 19:13 +0000
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 14:25 -0600
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 21:00 +0000
                                                                                                            Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 15:35 -0600
                                                                                                              Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 23:07 +0000
                                                                                                                Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 17:33 -0600
                                                                                                                  Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 03:34 +0000
                                                                                                                    Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 21:40 -0600
                                                                                                                      Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 17:16 +0000
                                                                                                                        Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-07 17:12 -0600
                                                                                                                          Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:11 +0000
                                                                                                                            Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 20:17 -0600
                                                                                                                              Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:55 +0000
                                                                                                                                Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 21:06 -0600
                                                                                                                                  Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 04:43 +0000
                                                                                                                                    Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 22:51 -0600
                                                                                                                                Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 22:39 -0600
                                                                                                                                  Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 04:55 +0000
                                                                                                                                    Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 23:05 -0600
                                                                                                                                      Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 23:20 -0600
                                                                                                                                        Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 06:16 +0000
                                                                                                                                      Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 06:13 +0000
                                                                                                                                        Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-08 00:21 -0600
                                                                                                                                          Re: Detecting infinite recursion (PDF) (last step?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:30 -0800
                                                                                                                                          Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 07:07 +0000
                                                                                                                                            Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 09:23 -0600
                                                                                                                                              Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:16 +0000
                                                                                                                                                Re: Detecting infinite recursion (PDF) (agreement?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-08 09:26 -0800
                                                                                                                                                  Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 11:36 -0600
                                                                                                                                                    Re: Detecting infinite recursion (PDF) (agreement?) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:52 -0800
                                                                                                                                                    Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:59 +0000
                                                                                                                                                      Re: Detecting infinite recursion (PDF) (agreement?) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 10:07 -0800
                                                                                                                                                      Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:31 -0600
                                                                                                                                                        Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 18:41 +0000
                                                                                                                                                          Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:55 -0600
                                                                                                                                                            Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 19:29 +0000
                                                                                                                                                              Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 14:50 -0500
                                                                                                                                                              Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 14:02 -0600
                                                                                                                                                                Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 20:52 +0000
                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 15:15 -0600
                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 14:43 -0700
                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 00:03 +0000
                                                                                                                                                                      Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 18:59 -0600
                                                                                                                                                                        Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 20:24 -0500
                                                                                                                                                                          Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 19:54 -0600
                                                                                                                                                                            Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 03:14 +0000
                                                                                                                                                                              Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:20 -0600
                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:42 -0500
                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:47 -0600
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:57 -0500
                                                                                                                                                                                      Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:11 -0600
                                                                                                                                                                                        Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:46 -0500
                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 20:54 -0700
                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:09 -0600
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:55 -0500
                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 04:17 +0000
                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:28 -0600
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 05:52 +0000
                                                                                                                                                                                      Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 00:03 -0600
                                                                                                                                                                                        Re: Detecting infinite recursion (PDF) (nitwit) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 04:12 -0800
                                                                                                                                                                                        Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 15:51 +0000
                                                                                                                                                                                          Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 10:07 -0600
                                                                                                                                                                                            Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 11:33 -0500
                                                                                                                                                                                            Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:00 +0000
                                                                                                                                                                                              Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 11:08 -0600
                                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:27 -0500
                                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:28 +0000
                                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 11:37 -0600
                                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:44 -0500
                                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:59 +0000
                                                                                                                                                                                          Re: Detecting infinite recursion (PDF) (nitwit) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 17:29 +0000
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:59 -0500
                                                                                                                                                                                      Re: Detecting infinite recursion (PDF) (nitwit) R Kym Horsell <kym@kymhorsell.com> - 2021-03-09 16:16 +0000
                                                                                                                                                                                        Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 10:26 -0600
                                                                                                                                                                                          Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 16:46 +0000
                                                                                                                                                                                            Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 10:51 -0600
                                                                                                                                                                                              Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 16:54 +0000
                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:00 -0600
                                                                                                                                                                                                  Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 17:04 +0000
                                                                                                                                                                                                    Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:10 -0600
                                                                                                                                                                                          Re: Refuting the halting problem proofs with fully operational code R Kym Horsell <kym@kymhorsell.com> - 2021-03-09 16:57 +0000
                                                                                                                                                                                            Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:02 -0600
                                                                                                                                                                                          Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:17 +0000
                                                                                                                                                                                            Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:24 -0600
                                                                                                                                                                                              Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:35 +0000
                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-09 11:54 -0600
                                                                                                                                                                                                  Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 18:02 +0000
                                                                                                                                                                                                  Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 13:57 -0500
                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-09 10:04 -0800
                                                                                                                                                                                                  Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 12:12 -0600
                                                                                                                                                                                                    Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 18:37 +0000
                                                                                                                                                                                                      Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 12:57 -0600
                                                                                                                                                                                                        Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:26 -0500
                                                                                                                                                                                                          Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 14:46 -0600
                                                                                                                                                                                                            Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 16:48 -0500
                                                                                                                                                                                                              Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 15:56 -0600
                                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 17:49 -0500
                                                                                                                                                                                                            Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:26 +0000
                                                                                                                                                                                                              Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 20:47 -0600
                                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:14 +0000
                                                                                                                                                                                                                Re: Refuting the halting problem proofs with fully operational code Jeff Barnett <jbb@notatt.com> - 2021-03-10 11:36 -0700
                                                                                                                                                                                                                  Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-10 12:58 -0600
                                                                                                                                                                                                                    Re: Refuting the halting problem proofs with fully operational code Jeff Barnett <jbb@notatt.com> - 2021-03-10 15:35 -0700
                                                                                                                                                                                                        Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 19:28 +0000
                                                                                                                                                                                                    Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:00 -0500
                                                                                                                                                                                                      Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 13:03 -0600
                                                                                                                                                                                                        Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:25 -0500
                                                                                                                                                                                                    Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 21:39 +0000
                                                                                                                                                                                                      Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 15:59 -0600
                                                                                                                                                                                                      Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 16:52 -0600
                                                                                                                                                                                              Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:42 -0500
                                                                                                                                                                                          Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:36 -0500
                                                                                                                                                                            Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:36 -0500
                                                                                                                                                                              Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:45 -0600
                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 23:02 -0500
                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:13 -0600
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 08:00 -0500
                                                                                                                                                                                Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 21:22 -0700
                                                                                                                                                                                  Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:35 -0600
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 20:42 -0800
                                                                                                                                                                                    Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 08:07 -0500
                                                                                                                                                    Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 13:32 -0500
                                                                                                                                                Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 11:31 -0600
                                                                                                                                                  Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 18:04 +0000
                                                                                                                                                    Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:34 -0600
                                                                                                                                                      Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 19:07 +0000
                                                                                                                                                        Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 14:01 -0600
                                                                                                                                                          Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 15:34 -0500
                                                                                                                                                            Re: Detecting infinite recursion (PDF) (Rice's theorem) olcott <NoOne@NoWhere.com> - 2021-03-08 15:57 -0600
                                                                                                                                                              Re: Detecting infinite recursion (PDF) (Rice's theorem) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 17:20 -0500
                                                                                                                                          Re: Detecting infinite recursion (PDF) (last step?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 23:57 -0800
                                                                                                                                          Re: Detecting infinite recursion (PDF) (last step?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:37 -0500
                                                                                                                                            Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-08 09:28 -0600
                                                                                                                                              Re: Detecting infinite recursion (PDF) (last step?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:37 -0500
                                                                                                                                    Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-08 00:10 -0600
                                                                                                                                      Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 07:04 +0000
                                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-06 21:10 +0000
                                                                                                        Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 15:43 -0600
                                                                                                          Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:24 -0500
                                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 15:51 -0600
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 18:26 -0500
                                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 01:07 +0000
                                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:14 -0600
                                                                                                              Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 19:16 -0800
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Jeff Barnett <jbb@notatt.com> - 2021-03-06 11:49 -0700
                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:24 -0600
                                                                              Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 22:23 +0000
                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:42 -0600
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:14 +0000
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:30 -0600
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:46 +0000
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 20:05 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:47 +0000
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:03 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 11:46 +0000
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:57 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:48 -0500
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:07 +0000
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 21:54 -0500
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:07 -0600
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 22:35 -0500
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:43 -0600
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:13 -0500
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:49 -0600
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 09:50 -0500
                                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 22:20 +0000
                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:31 -0600
                                                                                Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:13 +0000
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:20 -0600
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:42 +0000
                                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:00 -0600
                                                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 12:01 +0000
                                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 09:03 -0600
                                                                                            Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:11 +0000
                                                                                              Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 10:20 -0600
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:41 -0500
                                                                                                Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 22:06 +0000
                                                                                                  Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:41 -0600
                                                                                                    Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:53 -0600
                                                                        Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:27 +0000
                                                                          Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:43 -0600
                                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 22:04 -0500
                                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:17 -0600
                                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:00 -0500
                                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:14 -0600
                                                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:18 -0500
                                                                            Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-04 20:03 -0800
                                                                              Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-04 20:46 -0800
                                                            Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:33 -0500
                                                              Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 21:43 -0600
                                                                Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:08 -0500
                                                                  Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:15 -0600
                                                                    Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:30 -0500
                                                                      Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:35 -0600
                                                                        Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:56 -0500
                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 16:07 -0500
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:41 -0600
                    Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:20 -0500
                      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 16:29 -0600
                        Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:55 -0500
                  Re: Detecting infinite recursion (exception to the rule) olcott <NoOne@NoWhere.com> - 2021-03-02 16:24 -0600
                    Re: Detecting infinite recursion (exception to the rule) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:50 -0500
                      Re: Detecting infinite recursion (exception to the rule) olcott <NoOne@NoWhere.com> - 2021-03-02 16:59 -0600
                        Re: Detecting infinite recursion (exception to the rule) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 19:20 -0500
                          Re: Detecting infinite recursion (credit where it is due) olcott <NoOne@NoWhere.com> - 2021-03-02 18:45 -0600
                            Re: Detecting infinite recursion (credit where it is due) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:58 -0500
                Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 22:57 +0000
                Re: Detecting infinite recursion om@iki.fi (Otto J. Makela) - 2021-03-03 14:46 +0200
            Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-03-02 12:04 -0800
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:49 -0600
            Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:52 -0500
              Re: Detecting infinite recursion is simple olcott <NoOne@NoWhere.com> - 2021-03-02 15:08 -0600
                Re: Detecting infinite recursion is simple Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:33 -0500
                  Re: Detecting infinite recursion is simple olcott <NoOne@NoWhere.com> - 2021-03-02 17:18 -0600
                    Re: Detecting infinite recursion is simple Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:07 -0500
        Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-02 21:41 +0000
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:57 -0600
            Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-02 22:32 +0000
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 16:42 -0600
      Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 12:52 -0600
        Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 19:53 +0000
          Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 14:07 -0600
            Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 21:14 +0000
              Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 15:25 -0600
                Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 22:01 +0000
                  Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 16:09 -0600
                    Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:59 +0000
                Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:19 -0500
                  Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:50 +0000
                    Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 16:56 -0600
                      Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:51 +0000
      Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 17:06 -0600
        Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 18:17 -0500
          Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 17:25 -0600
            Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:46 -0500
              Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 19:09 -0600
                Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:45 -0500
                  Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 21:55 -0600
                    Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:11 -0500
                      Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 22:22 -0600
                        Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:48 -0500
                          Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-03 22:59 -0600
                            Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 07:17 -0500
                              Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 08:07 -0600
                                Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 10:11 -0500
                                  Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 09:21 -0600
                                    Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 10:48 -0500
                                      Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 09:55 -0600
                                        Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:31 -0500
                                    Re: Detecting infinite recursion (rewritten) pointless Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-04 07:59 -0800
                                      Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 10:12 -0600
                                        Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:40 -0500
    Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 12:55 -0600
    Re: Detecting infinite recursion Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-07 16:38 +0100
      Re: Detecting infinite recursion (halting problem) olcott <NoOne@NoWhere.com> - 2021-03-07 09:55 -0600
        Re: Detecting infinite recursion (halting problem) Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-07 18:08 +0100
      Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 10:54 -0800
    Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 19:42 -0600
      Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:22 +0000
        Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 20:30 -0600
          Re: Detecting infinite recursion (2021-03-09) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 21:54 -0500
            Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 21:01 -0600
              Re: Detecting infinite recursion (2021-03-09) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:29 -0500
              Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:31 +0000
          Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:15 +0000
        Re: Detecting infinite recursion (2021-03-09) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 18:31 -0800

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


#28579 — Re: Detecting infinite recursion (halt deciding criteria)

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-03-05 12:26 -0700
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<s1u0lm$guf$1@dont-email.me>
In reply to#28572
On 2021-03-05 09:27, olcott wrote:
> On 3/5/2021 10:23 AM, André G. Isaak wrote:
>> On 2021-03-05 07:25, olcott wrote:
>>> On 3/5/2021 12:51 AM, André G. Isaak wrote:
>>>> On 2021-03-04 23:07, olcott wrote:
>>>>> On 3/4/2021 11:57 PM, André G. Isaak wrote:
>>>>>> On 2021-03-04 22:20, olcott wrote:
>>>>>>> On 3/4/2021 11:08 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-04 21:29, olcott wrote:
>>>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>> There is a big difference between a contradiction (the liar's 
>>>>>>>> paradox) and simply being wrong (Halt's evaluation of 
>>>>>>>> H_Hat(H_Hat)).
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> Actually all this stuff is moot Halts() cannot return any value 
>>>>>>> to H_Hat() because H_Hat() invokes Halts() in infinite recursion.
>>>>>>
>>>>>> Which is an admission that you do not have a decider. A decider, 
>>>>>> by definition, must always return a value to its caller. 
>>>>>
>>>>> That is not true. It must return a value to some caller it need not 
>>>>> return a value to every caller.
>>>>
>>>> Yes, it is true. This is a simple matter of definition. A decider is 
>>>> guaranteed to return a value. It doesn't return a value sometimes to 
>>>> some callers. If it is called, it returns a value. Always. Otherwise 
>>>> it isn't a decider.
>>>
>>> What you say cannot possibly be correct because it is never correct 
>>> for any software function to return any value to a software function 
>>> that invokes it in infinite recursion.
>>
>> Of course it can be (and is) correct.
>>
>> A decider is *defined* as a function which is guaranteed to return a 
>> value.
>>
>> You are correct that it won't be possible for a function which gets 
>> stuck in infinite recursion to return a value.
>>
>> That means that any function which has the ability to call itself 
>> recursively in a way that potentially leads to infinite recursion does 
>> not meet the definition of a decider.
> 
> Not at all. There is nothing about such a function being called in 
> infinite recursion that prevents it from halting in a final state 
> indicating that its input does not halt.

First you claim it is "never correct for any software function to return 
any value to a software function that invokes it in infinite recursion."

Now you claim that nothing prevents it from doing so.

Make up your mind.

André


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

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


#28580 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 13:47 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<xNudnQaV-ZdXF9_9nZ2dnUU7-d_NnZ2d@giganews.com>
In reply to#28579
On 3/5/2021 1:26 PM, André G. Isaak wrote:
> On 2021-03-05 09:27, olcott wrote:
>> On 3/5/2021 10:23 AM, André G. Isaak wrote:
>>> On 2021-03-05 07:25, olcott wrote:
>>>> On 3/5/2021 12:51 AM, André G. Isaak wrote:
>>>>> On 2021-03-04 23:07, olcott wrote:
>>>>>> On 3/4/2021 11:57 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-04 22:20, olcott wrote:
>>>>>>>> On 3/4/2021 11:08 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-04 21:29, olcott wrote:
>>>>>>>
>>>>>>> <snip>
>>>>>>>
>>>>>>>>> There is a big difference between a contradiction (the liar's 
>>>>>>>>> paradox) and simply being wrong (Halt's evaluation of 
>>>>>>>>> H_Hat(H_Hat)).
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> Actually all this stuff is moot Halts() cannot return any value 
>>>>>>>> to H_Hat() because H_Hat() invokes Halts() in infinite recursion.
>>>>>>>
>>>>>>> Which is an admission that you do not have a decider. A decider, 
>>>>>>> by definition, must always return a value to its caller. 
>>>>>>
>>>>>> That is not true. It must return a value to some caller it need 
>>>>>> not return a value to every caller.
>>>>>
>>>>> Yes, it is true. This is a simple matter of definition. A decider 
>>>>> is guaranteed to return a value. It doesn't return a value 
>>>>> sometimes to some callers. If it is called, it returns a value. 
>>>>> Always. Otherwise it isn't a decider.
>>>>
>>>> What you say cannot possibly be correct because it is never correct 
>>>> for any software function to return any value to a software function 
>>>> that invokes it in infinite recursion.
>>>
>>> Of course it can be (and is) correct.
>>>
>>> A decider is *defined* as a function which is guaranteed to return a 
>>> value.
>>>
>>> You are correct that it won't be possible for a function which gets 
>>> stuck in infinite recursion to return a value.
>>>
>>> That means that any function which has the ability to call itself 
>>> recursively in a way that potentially leads to infinite recursion 
>>> does not meet the definition of a decider.
>>
>> Not at all. There is nothing about such a function being called in 
>> infinite recursion that prevents it from halting in a final state 
>> indicating that its input does not halt.
> 
> First you claim it is "never correct for any software function to return 
> any value to a software function that invokes it in infinite recursion."
> 
> Now you claim that nothing prevents it from doing so.
> 
> Make up your mind.
> 
> André
> 
> 

You have to pay attention to the exact meaning of the words that I say, 
not an mere approximation.

When the halt decider halts in a final state indicating that its input 
has the [would-not-halt] property, its input has already been aborted 
thus has no access to the [would-not-halt] decision.

-- 
Copyright 2021 Pete Olcott

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

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


#28581 — Re: Detecting infinite recursion (halt deciding criteria)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-05 15:20 -0500
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<Jow0I.66342$aX.20071@fx44.iad>
In reply to#28580
On 3/5/21 2:47 PM, olcott wrote:
> On 3/5/2021 1:26 PM, André G. Isaak wrote:

>> First you claim it is "never correct for any software function to
>> return any value to a software function that invokes it in infinite
>> recursion."
>>
>> Now you claim that nothing prevents it from doing so.
>>
>> Make up your mind.
>>
>> André
>>
>>
> 
> You have to pay attention to the exact meaning of the words that I say,
> not an mere approximation.
> 
> When the halt decider halts in a final state indicating that its input
> has the [would-not-halt] property, its input has already been aborted
> thus has no access to the [would-not-halt] decision.
> 

This can NOT be done as a Turing Equivalent. Either your machine ends in
the state defined as 'would-not-halt' which H_Hat can then modify the
transition to go where it want, or it doesn't and then has failed to answer.

Maybe you should study a bit more about Turing Machine Theory before you
start making a lot of claims about proofs based on them.

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


#28602 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 19:07 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<AoGdnTPEatZRSN_9nZ2dnUU7-V-dnZ2d@giganews.com>
In reply to#28581
On 3/5/2021 2:20 PM, Richard Damon wrote:
> On 3/5/21 2:47 PM, olcott wrote:
>> On 3/5/2021 1:26 PM, André G. Isaak wrote:
> 
>>> First you claim it is "never correct for any software function to
>>> return any value to a software function that invokes it in infinite
>>> recursion."
>>>
>>> Now you claim that nothing prevents it from doing so.
>>>
>>> Make up your mind.
>>>
>>> André
>>>
>>>
>>
>> You have to pay attention to the exact meaning of the words that I say,
>> not an mere approximation.
>>
>> When the halt decider halts in a final state indicating that its input
>> has the [would-not-halt] property, its input has already been aborted
>> thus has no access to the [would-not-halt] decision.
>>
> 
> This can NOT be done as a Turing Equivalent. Either your machine ends in
> the state defined as 'would-not-halt' which H_Hat can then modify the
> transition to go where it want, or it doesn't and then has failed to answer.
> 

Yes we all know that it is totally impossible for any UTM to stop 
simulating its input, that would cause the whole universe to implode.

> Maybe you should study a bit more about Turing Machine Theory before you
> start making a lot of claims about proofs based on them.
> 


-- 
Copyright 2021 Pete Olcott

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

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


#28610 — Re: Detecting infinite recursion (halt deciding criteria)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-05 20:48 -0500
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<9cB0I.59936$OY.27586@fx38.iad>
In reply to#28602
On 3/5/21 8:07 PM, olcott wrote:
> On 3/5/2021 2:20 PM, Richard Damon wrote:
>> On 3/5/21 2:47 PM, olcott wrote:
>>> On 3/5/2021 1:26 PM, André G. Isaak wrote:
>>
>>>> First you claim it is "never correct for any software function to
>>>> return any value to a software function that invokes it in infinite
>>>> recursion."
>>>>
>>>> Now you claim that nothing prevents it from doing so.
>>>>
>>>> Make up your mind.
>>>>
>>>> André
>>>>
>>>>
>>>
>>> You have to pay attention to the exact meaning of the words that I say,
>>> not an mere approximation.
>>>
>>> When the halt decider halts in a final state indicating that its input
>>> has the [would-not-halt] property, its input has already been aborted
>>> thus has no access to the [would-not-halt] decision.
>>>
>>
>> This can NOT be done as a Turing Equivalent. Either your machine ends in
>> the state defined as 'would-not-halt' which H_Hat can then modify the
>> transition to go where it want, or it doesn't and then has failed to
>> answer.
>>
> 
> Yes we all know that it is totally impossible for any UTM to stop
> simulating its input, that would cause the whole universe to implode.
> 
>> Maybe you should study a bit more about Turing Machine Theory before you
>> start making a lot of claims about proofs based on them.
>>
> 
> 

As I said, maybe you should study Turing Theory a bit.

The only way a Turing Halt Decide could 'abort' a 'calling' Turing
Machine is to halt as a non-answer.

Turing Machines are INTENTIONAL very computationally simple, as this
allows much easier theoretical discussion about them, and is based on
patterns that have been well analyzed.

And Yes, in a sense adding a definition to your machine that it has
returned an answer but has aborted the calling Turing machine HAS
'imploded the whole Universe' because it puts the proof outside the
realms of the Universe of Turing Machines (as you seem to be want to do
with your proofs).

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


#28614 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 20:01 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<8cednSjC8vkSf9_9nZ2dnUU7-QmdnZ2d@giganews.com>
In reply to#28610
On 3/5/2021 7:48 PM, Richard Damon wrote:
> On 3/5/21 8:07 PM, olcott wrote:
>> On 3/5/2021 2:20 PM, Richard Damon wrote:
>>> On 3/5/21 2:47 PM, olcott wrote:
>>>> On 3/5/2021 1:26 PM, André G. Isaak wrote:
>>>
>>>>> First you claim it is "never correct for any software function to
>>>>> return any value to a software function that invokes it in infinite
>>>>> recursion."
>>>>>
>>>>> Now you claim that nothing prevents it from doing so.
>>>>>
>>>>> Make up your mind.
>>>>>
>>>>> André
>>>>>
>>>>>
>>>>
>>>> You have to pay attention to the exact meaning of the words that I say,
>>>> not an mere approximation.
>>>>
>>>> When the halt decider halts in a final state indicating that its input
>>>> has the [would-not-halt] property, its input has already been aborted
>>>> thus has no access to the [would-not-halt] decision.
>>>>
>>>
>>> This can NOT be done as a Turing Equivalent. Either your machine ends in
>>> the state defined as 'would-not-halt' which H_Hat can then modify the
>>> transition to go where it want, or it doesn't and then has failed to
>>> answer.
>>>
>>
>> Yes we all know that it is totally impossible for any UTM to stop
>> simulating its input, that would cause the whole universe to implode.
>>
>>> Maybe you should study a bit more about Turing Machine Theory before you
>>> start making a lot of claims about proofs based on them.
>>>
>>
>>
> 
> As I said, maybe you should study Turing Theory a bit.
> 
> The only way a Turing Halt Decide could 'abort' a 'calling' Turing
> Machine is to halt as a non-answer.

A UTM adapted to become a halt decider could stop simulating its input.

-- 
Copyright 2021 Pete Olcott

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

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


#28616 — Re: Detecting infinite recursion (halt deciding criteria)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-05 21:21 -0500
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<CGB0I.76047$zY.45661@fx36.iad>
In reply to#28614
On 3/5/21 9:01 PM, olcott wrote:
> On 3/5/2021 7:48 PM, Richard Damon wrote:
>> On 3/5/21 8:07 PM, olcott wrote:
>>> On 3/5/2021 2:20 PM, Richard Damon wrote:
>>>> On 3/5/21 2:47 PM, olcott wrote:
>>>>> On 3/5/2021 1:26 PM, André G. Isaak wrote:
>>>>
>>>>>> First you claim it is "never correct for any software function to
>>>>>> return any value to a software function that invokes it in infinite
>>>>>> recursion."
>>>>>>
>>>>>> Now you claim that nothing prevents it from doing so.
>>>>>>
>>>>>> Make up your mind.
>>>>>>
>>>>>> André
>>>>>>
>>>>>>
>>>>>
>>>>> You have to pay attention to the exact meaning of the words that I
>>>>> say,
>>>>> not an mere approximation.
>>>>>
>>>>> When the halt decider halts in a final state indicating that its input
>>>>> has the [would-not-halt] property, its input has already been aborted
>>>>> thus has no access to the [would-not-halt] decision.
>>>>>
>>>>
>>>> This can NOT be done as a Turing Equivalent. Either your machine
>>>> ends in
>>>> the state defined as 'would-not-halt' which H_Hat can then modify the
>>>> transition to go where it want, or it doesn't and then has failed to
>>>> answer.
>>>>
>>>
>>> Yes we all know that it is totally impossible for any UTM to stop
>>> simulating its input, that would cause the whole universe to implode.
>>>
>>>> Maybe you should study a bit more about Turing Machine Theory before
>>>> you
>>>> start making a lot of claims about proofs based on them.
>>>>
>>>
>>>
>>
>> As I said, maybe you should study Turing Theory a bit.
>>
>> The only way a Turing Halt Decide could 'abort' a 'calling' Turing
>> Machine is to halt as a non-answer.
> 
> A UTM adapted to become a halt decider could stop simulating its input.
> 

It could stop simulating its input, but not the computation that is
using it. The Halt Decider based on the UTM still MUST return its answer
to the computation it is part of, or fail at being a Halt Decider.

You seem VERY prone to confusing this distinction.

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


#28491 — Re: Detecting infinite recursion (halt deciding criteria)

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-03-04 15:23 -0800
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<2f25e0a4-2ce2-4ecc-b151-f238c7454281n@googlegroups.com>
In reply to#28470
On Thursday, 4 March 2021 at 21:07:02 UTC, olcott wrote:
> On 3/4/2021 2:48 PM, Richard Damon wrote: 
> > 
> > And the fact that the Halt Decider can't give the correct answer is why 
> > the Halt Decider that is aways right can not exist, so you argument is 
> > just PROVING the statement you are trying to refute. 
> >
> The halt decider cannot give a correct answer to an incorrect question. 
> When we remove the pathological self-reference from the question then a 
> correct answer can be provided. 
> 
> If we ask Jack: Can you provide a correct answer to the question: 
> "Will your answer to this question be no?" 
> Jack can correctly answer "no". 
>
So Jack is constrained to answer "yes" or "no", and he cannot answer 
correctly because of pathological self reference. However if he attempts
an answer anyway, then there is a correct answer to the question, but it
cannot be made by Jack.

The Jack paradox does not (as far as I'm aware) really tell us anything
interesting about natural language or human honesty. It's just a rather silly
paradox.
> 
> When the halt decider uses the criteria:
> Does the simulation of the input program have to be stopped to prevent 
> its otherwise infinite execution?
> It can divide all of its inputs into those having the not halting 
> property and those that do not.
>
Sure. And we can write an attempted H. Then the question "does H_Hat
halt or not?" has a yes / no answer. And we can write another halt decider, 
which may well be a simulator with some recursion detection logic bolted
on, that can correctly answer the question, for that H_Hat. But the simulator
cannot be H, or you are back to the original problem.

Now is this to computer science as the Jack paradox is to natural language?
The consensus is no. Computer programs are not written in natural language. 
They are mechanical (electrical) constructs.

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


#28494 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-04 17:35 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<J_OdnblfmOYD89z9nZ2dnUU78L3NnZ2d@giganews.com>
In reply to#28491
On 3/4/2021 5:23 PM, Malcolm McLean wrote:
> On Thursday, 4 March 2021 at 21:07:02 UTC, olcott wrote:
>> On 3/4/2021 2:48 PM, Richard Damon wrote:
>>>
>>> And the fact that the Halt Decider can't give the correct answer is why
>>> the Halt Decider that is aways right can not exist, so you argument is
>>> just PROVING the statement you are trying to refute.
>>>
>> The halt decider cannot give a correct answer to an incorrect question.
>> When we remove the pathological self-reference from the question then a
>> correct answer can be provided.
>>
>> If we ask Jack: Can you provide a correct answer to the question:
>> "Will your answer to this question be no?"
>> Jack can correctly answer "no".
>>
> So Jack is constrained to answer "yes" or "no", and he cannot answer
> correctly because of pathological self reference. However if he attempts
> an answer anyway, then there is a correct answer to the question, but it
> cannot be made by Jack.
> 
> The Jack paradox does not (as far as I'm aware) really tell us anything
> interesting about natural language or human honesty. It's just a rather silly
> paradox.
>>
>> When the halt decider uses the criteria:
>> Does the simulation of the input program have to be stopped to prevent
>> its otherwise infinite execution?
>> It can divide all of its inputs into those having the not halting
>> property and those that do not.
>>
> Sure. And we can write an attempted H. Then the question "does H_Hat
> halt or not?" has a yes / no answer. And we can write another halt decider,
> which may well be a simulator with some recursion detection logic bolted
> on, that can correctly answer the question, for that H_Hat. But the simulator
> cannot be H, or you are back to the original problem.

I renamed H to the more descriptive Halts()

I show 100% of every detail of all of the criteria used by Halts() to 
correctly decide halting of the equivalent of the Linz H_Hat(). You have 
to understand the x86 assembly language to understand these details.

#include <stdint.h>
#define u8 uint8_t
#define u32 uint32_t
#define u16 uint16_t

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

int main()
{
   Halts((u32)H_Hat, (u32)H_Hat);
}

_H_Hat()
[00000878](01)  55              push ebp
[00000879](02)  8bec            mov ebp,esp
[0000087b](01)  51              push ecx
[0000087c](03)  8b4508          mov eax,[ebp+08]
[0000087f](01)  50              push eax
[00000880](03)  8b4d08          mov ecx,[ebp+08]
[00000883](01)  51              push ecx
[00000884](05)  e8effbffff      call 00000478
[00000889](03)  83c408          add esp,+08
[0000088c](03)  8945fc          mov [ebp-04],eax
[0000088f](04)  837dfc00        cmp dword [ebp-04],+00
[00000893](02)  7402            jz 00000897
[00000895](02)  ebfe            jmp 00000895
[00000897](02)  8be5            mov esp,ebp
[00000899](01)  5d              pop ebp
[0000089a](01)  c3              ret

_main()
[000008a8](01)  55              push ebp
[000008a9](02)  8bec            mov ebp,esp
[000008ab](05)  6878080000      push 00000878
[000008b0](05)  6878080000      push 00000878
[000008b5](05)  e8befbffff      call 00000478
[000008ba](03)  83c408          add esp,+08
[000008bd](02)  33c0            xor eax,eax
[000008bf](01)  5d              pop ebp
[000008c0](01)  c3              ret

Columns
(1) Execution trace sequence number
(2) Machine address of instruction
(3) Machine address of top of stack
(4) Value of top of stack after instruction executed
(5) Number of bytes of machine code
(6) Machine language bytes
(7) Assembly language text

(01)[000008a8][000111b4][00000000](01)  55              push ebp
(02)[000008a9][000111b4][00000000](02)  8bec            mov ebp,esp
(03)[000008ab][000111b0][00000878](05)  6878080000      push 00000878
(04)[000008b0][000111ac][00000878](05)  6878080000      push 00000878
(05)[000008b5][000111a8][000008ba](05)  e8befbffff      call 00000478

Line (03) pushes second parameter to Simulate() machine address 0x878
Line (04) pushes  first parameter to Simulate() machine address 0x878
Line (05) Calls Halts(0x878, 0x878);

(06)[00000878][00011198][000111a4](01)  55              push ebp
(07)[00000879][00011198][000111a4](02)  8bec            mov ebp,esp
(08)[0000087b][00011194][00000000](01)  51              push ecx
(09)[0000087c][00011194][00000000](03)  8b4508          mov eax,[ebp+08]
(10)[0000087f][00011190][00000878](01)  50              push eax
(11)[00000880][00011190][00000878](03)  8b4d08          mov ecx,[ebp+08]
(12)[00000883][0001118c][00000878](01)  51              push ecx
(13)[00000884][00011188][00000889](05)  e8effbffff      call 00000478

Line (10) pushes second parameter to Simulate() machine address 0x878
Line (12) pushes  first parameter to Simulate() machine address 0x878
Line (13) Calls Halts(0x878, 0x878);

(14)[00000878][00011178][00011184](01)  55              push ebp
(15)[00000879][00011178][00011184](02)  8bec            mov ebp,esp
(16)[0000087b][00011174][00000878](01)  51              push ecx
(17)[0000087c][00011174][00000878](03)  8b4508          mov eax,[ebp+08]
(18)[0000087f][00011170][00000878](01)  50              push eax
(19)[00000880][00011170][00000878](03)  8b4d08          mov ecx,[ebp+08]
(20)[00000883][0001116c][00000878](01)  51              push ecx
(21)[00000884][00011168][00000889](05)  e8effbffff      call 00000478

Line (18) pushes second parameter to Simulate() machine address 0x878
Line (20) pushes  first parameter to Simulate() machine address 0x878
Line (21) Calls Halts(0x878, 0x878);

Now we have seen that Halts() is invoked two times from the same machine 
address of H_Hat() with the same data Halts() determines that it must 
stop simulating H_Hat() to prevent its otherwise infinite execution. At 
this point Halts() would decide not halting return a value of 0 to its 
caller.




-- 
Copyright 2021 Pete Olcott

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

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


#28467 — Re: Detecting infinite recursion (halt deciding criteria)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-03-04 21:05 +0000
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<20210304125543.513@kylheku.com>
In reply to#28462
On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
> On 3/4/2021 1:56 PM, Richard Damon wrote:
>> On 3/4/21 2:36 PM, Kaz Kylheku wrote:
>>> On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
>>>> By removing the pathological self-reference(Olcott 2004) from the
>>>
>>> You can't do that!
>>>
>>> Choosing a self-referential test case is the privilege of the QA
>>> engineer who proves that your halting decider is broken (that being
>>> their basic job description).
>>>
>>> First, the QA engineer prepares the H_Hat test case driver. There is no
>>> self-reference in that: it refers to an argument P.
>>>
>>> Then the QA engineer invokes Halts(H_Hat, H_Hat).
>>> That is the point where a form of self-reference is introduced:
>>> the binding of the H_Hat argument to the P and I parameters.
>>>
>>> This is scriptable! We can build everything into a shared library and
>>> use a high level language with FFI (foreign function interface)
>>> like Lisp or Python to code the Halts(H_Hat, H_Hat) call.
>>>
>>> What you're calling "pathological self reference" is just a way
>>> of using the software.
>>>
>>> The only way you can "remove" it is if you somehow confine the
>>> freedom of expression of the users.
>>>
>> 
>> He is 'removing' the problem case by redefining the test condition so
>> that those cases don't have well define results so he can point to HIS
>> test criteria and claim he passes.
>> 
>> Of course, when the product is delivered to the primary customers, they
>> are going to say that it doesn't meet their requirements and it just a
>> piece of junk.
>> 
>
> If we ask a man that has never been married:
> Have you stopped beating your wife?
> There exists no correct yes/no answer to this question.
>
> The undecidability of this question is entirely based on the fact that 
> it is incorrect.

The question is perfectly answerable to someone who has been beating
his wife.

It isn't incorrect; rather, it presupposes the context that the subject
is a wife-beater, or that he even has a wife.

> The pathogical self-reference error of the halting problem proofs and 
> Godel's 1931 incompleteness theorem is the only reason why they are 
> "undecidable".
>
> You ask someone (we'll call him "Jack") to give a truthful
> yes/no answer to the following question:
>
> Will Jack's answer to this question be no?
>
> Jack can't possibly give a correct yes/no answer to the question.

That has nothing to do with the halting proof, though; it contains
no runaway feedback loop whereby a proposition negates itself.

> BECAUSE THE QUESTION ITSELF IS INCORRECT.

The question is this: Halts(H_Hat, H_Hat).

IF you change it to Halts(puts, "abc"), that is no longer pathological,
right? The alleged pathology is in just he way it is called.


But that call is something you can execute, which either fails to halt,
or produces a wrong answer.

When it halts and produces a wrong answer, every term in the program is
settled with a stable value. The value of every expression the program
ever evaluated is known, and stable.

You can't argue with working code!

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


#28472 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-04 15:15 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<rbKdndyMl9B70Nz9nZ2dnUU78amdnZ2d@giganews.com>
In reply to#28467
On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
> On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
>> On 3/4/2021 1:56 PM, Richard Damon wrote:
>>> On 3/4/21 2:36 PM, Kaz Kylheku wrote:
>>>> On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
>>>>> By removing the pathological self-reference(Olcott 2004) from the
>>>>
>>>> You can't do that!
>>>>
>>>> Choosing a self-referential test case is the privilege of the QA
>>>> engineer who proves that your halting decider is broken (that being
>>>> their basic job description).
>>>>
>>>> First, the QA engineer prepares the H_Hat test case driver. There is no
>>>> self-reference in that: it refers to an argument P.
>>>>
>>>> Then the QA engineer invokes Halts(H_Hat, H_Hat).
>>>> That is the point where a form of self-reference is introduced:
>>>> the binding of the H_Hat argument to the P and I parameters.
>>>>
>>>> This is scriptable! We can build everything into a shared library and
>>>> use a high level language with FFI (foreign function interface)
>>>> like Lisp or Python to code the Halts(H_Hat, H_Hat) call.
>>>>
>>>> What you're calling "pathological self reference" is just a way
>>>> of using the software.
>>>>
>>>> The only way you can "remove" it is if you somehow confine the
>>>> freedom of expression of the users.
>>>>
>>>
>>> He is 'removing' the problem case by redefining the test condition so
>>> that those cases don't have well define results so he can point to HIS
>>> test criteria and claim he passes.
>>>
>>> Of course, when the product is delivered to the primary customers, they
>>> are going to say that it doesn't meet their requirements and it just a
>>> piece of junk.
>>>
>>
>> If we ask a man that has never been married:
>> Have you stopped beating your wife?
>> There exists no correct yes/no answer to this question.
>>
>> The undecidability of this question is entirely based on the fact that
>> it is incorrect.
> 
> The question is perfectly answerable to someone who has been beating
> his wife.
> 
> It isn't incorrect; rather, it presupposes the context that the subject
> is a wife-beater, or that he even has a wife.
> 
>> The pathogical self-reference error of the halting problem proofs and
>> Godel's 1931 incompleteness theorem is the only reason why they are
>> "undecidable".
>>
>> You ask someone (we'll call him "Jack") to give a truthful
>> yes/no answer to the following question:
>>
>> Will Jack's answer to this question be no?
>>
>> Jack can't possibly give a correct yes/no answer to the question.
> 
> That has nothing to do with the halting proof, though; it contains
> no runaway feedback loop whereby a proposition negates itself.
> 

As you already know H_Hat() would contradict any value that Halts() 
would return. Because you already know this is make sense sense that you 
say this is not analogous to Jack's question.

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


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

-- 
Copyright 2021 Pete Olcott

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

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


#28534 — Re: Detecting infinite recursion (halt deciding criteria)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-03-05 04:17 +0000
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<20210304191104.252@kylheku.com>
In reply to#28472
On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
> As you already know H_Hat() would contradict any value that Halts() 
> would return.

Not by any definition of "contradict" used in logic.

A contradiction occurs when we find some proposition P to be either
false or true depending on which steps we follow.

A Liar Paradox sentence contradicts itself, indeed. The proposition
is L, and it asserts ~L.

Here, here is no contradiction.

There is a proposition, and then there is a behavior which that
proposition is ostensibly about. The proposition is false.

For instance, if I point at a duck, and call it a swan,
I am not being contradicted by the swan; I'm just wrong.

> Because you already know this is make sense sense that you
> say this is not analogous to Jack's question.
>
> void H_Hat(u32 P)
  ^^^^

We know from the very type of this thing that it has no power
to contradict; it's not even a Boolean predicate.

Also note that Halts cannot return a different value without
becoming a different function. Because H_Hat is built out of Halts,
that makes H_Hat a different function.

So no, Halts cannot return a different value such hat the *original*
H_Hat behaves opposite to that value's interpretation.

Formally speaking, "Halts returning a different value" means we
substitute a different Halts, a Halts2. And that creates a new H_Hat,
a H_Hat2. It is H_Hat2 which "behaves opposite" relative to the
interpretation of the return value of Halts2. The original H_Hat
does not "behave opposite" relative to the new Halts2; the original
H_Hat continues to be built on Halts.

You're horribly confused. You speak about functions as if they
were people, and use inappropriate analogies.

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

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


#28537 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-04 22:46 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<S-2dnfZg6NwmKtz9nZ2dnUU7-XvNnZ2d@giganews.com>
In reply to#28467
On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
> On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
>> On 3/4/2021 1:56 PM, Richard Damon wrote:
>>> On 3/4/21 2:36 PM, Kaz Kylheku wrote:
>>>> On 2021-03-04, olcott <NoOne@NoWhere.com> wrote:
>>>>> By removing the pathological self-reference(Olcott 2004) from the
>>>>
>>>> You can't do that!
>>>>
>>>> Choosing a self-referential test case is the privilege of the QA
>>>> engineer who proves that your halting decider is broken (that being
>>>> their basic job description).
>>>>
>>>> First, the QA engineer prepares the H_Hat test case driver. There is no
>>>> self-reference in that: it refers to an argument P.
>>>>
>>>> Then the QA engineer invokes Halts(H_Hat, H_Hat).
>>>> That is the point where a form of self-reference is introduced:
>>>> the binding of the H_Hat argument to the P and I parameters.
>>>>
>>>> This is scriptable! We can build everything into a shared library and
>>>> use a high level language with FFI (foreign function interface)
>>>> like Lisp or Python to code the Halts(H_Hat, H_Hat) call.
>>>>
>>>> What you're calling "pathological self reference" is just a way
>>>> of using the software.
>>>>
>>>> The only way you can "remove" it is if you somehow confine the
>>>> freedom of expression of the users.
>>>>
>>>
>>> He is 'removing' the problem case by redefining the test condition so
>>> that those cases don't have well define results so he can point to HIS
>>> test criteria and claim he passes.
>>>
>>> Of course, when the product is delivered to the primary customers, they
>>> are going to say that it doesn't meet their requirements and it just a
>>> piece of junk.
>>>
>>
>> If we ask a man that has never been married:
>> Have you stopped beating your wife?
>> There exists no correct yes/no answer to this question.
>>
>> The undecidability of this question is entirely based on the fact that
>> it is incorrect.
> 
> The question is perfectly answerable to someone who has been beating
> his wife.
> 
> It isn't incorrect; rather, it presupposes the context that the subject
> is a wife-beater, or that he even has a wife.

I created the brand new idea of an incorrect question as any question 
that is defined in such a way that correct answers cannot possibly 
exist. What time is it (yes or no)? was my first example of an incorrect 
question.

>> The pathogical self-reference error of the halting problem proofs and
>> Godel's 1931 incompleteness theorem is the only reason why they are
>> "undecidable".
>>
>> You ask someone (we'll call him "Jack") to give a truthful
>> yes/no answer to the following question:
>>
>> Will Jack's answer to this question be no?
>>
>> Jack can't possibly give a correct yes/no answer to the question.
> 
> That has nothing to do with the halting proof, though; it contains
> no runaway feedback loop whereby a proposition negates itself.

The original halting problem is defined as an incorrect decision problem 
(analogous to an incorrect question) in that neither Boolean value that 
Halts() can return to H_Hat() is correct.


>> BECAUSE THE QUESTION ITSELF IS INCORRECT.
> 
> The question is this: Halts(H_Hat, H_Hat).
> 
> IF you change it to Halts(puts, "abc"), that is no longer pathological,
> right? The alleged pathology is in just he way it is called.
> 
> 
> But that call is something you can execute, which either fails to halt,
> or produces a wrong answer.
> 
> When it halts and produces a wrong answer, every term in the program is
> settled with a stable value. The value of every expression the program
> ever evaluated is known, and stable.
> 
> You can't argue with working code!

I provided the working code too many times and no one paid any attention 
probably because they could not understand the assembly language 
execution trace.

If we assume that the halt decider does correctly determine that its 
input would not halt unless it stopped simulating this input then the 
halt decider can correctly decide not halting on this input.

This halt deciding criteria makes the conventional halting problem 
counter-examples such as H_Hat() halting decidable.


-- 
Copyright 2021 Pete Olcott

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

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


#28546 — Re: Detecting infinite recursion (halt deciding criteria)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-05 11:26 +0000
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<87blbxkfiv.fsf@bsb.me.uk>
In reply to#28537
olcott <NoOne@NoWhere.com> writes:

> I created the brand new idea of an incorrect question as any question
> that is defined in such a way that correct answers cannot possibly
> exist.

(a) Every instance of the halting problem has a correct yes/no answer.

(b) If you redefine what halting means (as you have done), not one of
the old theorems change.  Turning machine equivalence is still
undecidable.  Whether a TM ever writes a particular symbol is still
undecidable.  There is still no effective procedure to decide if a
context free grammar is ambiguous or not.

(c) The definition if halting is obvious and natural, so it leads to a
rich and interesting theory of which you have decided to remain entirely
ignorant.  No one will be interested in your "other" halting based as it
is on what a slightly different computation would do were it not halted.

> What time is it (yes or no)? was my first example of an incorrect
> question.

Every instance of the halting problem has a correct yes/no answer.
Every context free grammar is or is not ambiguous.  Two Turing machines
either compute the same function or they do not.  All of the
conventional undecidable problems have obvious and natural meanings as
well as unambiguously correct yes/no answers.

-- 
Ben.

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


#28555 — Re: Detecting infinite recursion (halt deciding criteria)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 08:56 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<_LWdnUdZ4KIU29_9nZ2dnUU7-KvNnZ2d@giganews.com>
In reply to#28546
On 3/5/2021 5:26 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> I created the brand new idea of an incorrect question as any question
>> that is defined in such a way that correct answers cannot possibly
>> exist.
> 
> (a) Every instance of the halting problem has a correct yes/no answer.

Jack's question has a correct yes/no answer:
Will Jack's answer to this question be no?
Yet no correct answer that Jack can provide.

> (b) If you redefine what halting means (as you have done), not one of
> the old theorems change.  Turning machine equivalence is still
> undecidable.  Whether a TM ever writes a particular symbol is still
> undecidable.  There is still no effective procedure to decide if a
> context free grammar is ambiguous or not.

When we realize that the original theorem depends upon the semantic
error of pathological self-reference then the original theorem carries 
no weight.

The only reason that Jack cannot correctly answer the question is the 
the question is defined to contradict any answer that he provides.

The halting problem proofs look like they have been defined so that
the HP proof counter-example does the opposite of whatever the halt
decider decides.

For every (at least partial) halt decider the bases its halting
decision on examining its own execution trace of its own simulation
of its input the reason that Halts() cannot returns a correct
halting decision to H_Hat() is that H_Hat() has invoked it in infinite 
recursion.

I overcome the pathological self-reference of the original
halting problem proofs. It is no longer possible to show that any
element of the entire set of finite strings representing Turing
machine descriptions cannot be divided into those having the
[would not halt property] and those not having this property.

> (c) The definition if halting is obvious and natural, so it leads to a
> rich and interesting theory of which you have decided to remain entirely
> ignorant.  No one will be interested in your "other" halting based as it
> is on what a slightly different computation would do were it not halted.
> 
>> What time is it (yes or no)? was my first example of an incorrect
>> question.
> 
> Every instance of the halting problem has a correct yes/no answer.
> Every context free grammar is or is not ambiguous.  Two Turing machines
> either compute the same function or they do not.  All of the
> conventional undecidable problems have obvious and natural meanings as
> well as unambiguously correct yes/no answers.
> 


-- 
Copyright 2021 Pete Olcott

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

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


#28562 — Re: Detecting infinite recursion (halt deciding criteria)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-05 15:45 +0000
SubjectRe: Detecting infinite recursion (halt deciding criteria)
Message-ID<877dmliozb.fsf@bsb.me.uk>
In reply to#28555
olcott <NoOne@NoWhere.com> writes:

> On 3/5/2021 5:26 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> I created the brand new idea of an incorrect question as any question
>>> that is defined in such a way that correct answers cannot possibly
>>> exist.
>>
>> (a) Every instance of the halting problem has a correct yes/no answer.
>
> Jack's question has a correct yes/no answer:
> Will Jack's answer to this question be no?
> Yet no correct answer that Jack can provide.

You'd like to deny that every instance of the halting problem has a
correct yes/no answer but you don't quite have the intellectual courage
to do it.

There are lots of function from N to N that no TM computes (there are
only countably many TMs and uncountable many functioned from N to N).
We happen to know a few of these functions.  The halting function (h: N
-> {0, 1} with h(n) = 1 iff n encodes a halting computation) is one.
Deal with it.

>> (b) If you redefine what halting means (as you have done), not one of
>> the old theorems change.  Turning machine equivalence is still
>> undecidable.  Whether a TM ever writes a particular symbol is still
>> undecidable.  There is still no effective procedure to decide if a
>> context free grammar is ambiguous or not.
>
> When we realize that the original theorem depends upon the semantic
> error of pathological self-reference then the original theorem carries
> no weight.

The theorems carry exactly the same wright they did before, whatever
words you use to describe the fact that you don't like the halting
theorem.  Nothing changes because some random bloke on the Internet
calls something "a semantic error".  No one cares.  People will continue
to study other interesting and practical undecidable problems, just as
you will continue to ignore them.

> I overcome the pathological self-reference of the original
> halting problem proofs.

No.  The halting problem is not changed in any way just because some
daft person redefines "halting".  No one cares about your "new" problem.
It's the old one -- where halting means... halting (yes, amazing, that I
even have to say this) that matters.

> It is no longer possible to show that any
> element of the entire set of finite strings representing Turing
> machine descriptions cannot be divided into those having the
> [would not halt property] and those not having this property.

Two points.  First, of course you can divide the set of encoded TM
computations into two in lots of ways, but there is one division that is
really important -- those that halt and those that don't.

Second, you can't actually do what you claim.  The PO-almost-halting
problem is also undecidable.  You can pull the trick you want in a few
special cases, but there is no effective procedure you can implement
that will always tell you if a computation "would have to be stopped".
While you were content to say silly things about just one case you could
get away with it, but what you claim to be doing can't be done in
general.

-- 
Ben.

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


#28564 — Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 10:00 -0600
SubjectRe: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property
Message-ID<R6KdnQE_T6EMyN_9nZ2dnUU7-UXNnZ2d@giganews.com>
In reply to#28562
On 3/5/2021 9:45 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 3/5/2021 5:26 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> I created the brand new idea of an incorrect question as any question
>>>> that is defined in such a way that correct answers cannot possibly
>>>> exist.
>>>
>>> (a) Every instance of the halting problem has a correct yes/no answer.
>>
>> Jack's question has a correct yes/no answer:
>> Will Jack's answer to this question be no?
>> Yet no correct answer that Jack can provide.
> 
> You'd like to deny that every instance of the halting problem has a
> correct yes/no answer but you don't quite have the intellectual courage
> to do it.
> 

Every instance of the halting problem has a correct yes/no answer except 
for the cases of Turing Machines that do not exist because they are 
defined to provide the correct solution to undecidible descision problems.

Every Turing machnine that exists either halts or fails to halt.

> There are lots of function from N to N that no TM computes (there are
> only countably many TMs and uncountable many functioned from N to N).
> We happen to know a few of these functions.  The halting function (h: N
> -> {0, 1} with h(n) = 1 iff n encodes a halting computation) is one.
> Deal with it.
> 
>>> (b) If you redefine what halting means (as you have done), not one of
>>> the old theorems change.  Turning machine equivalence is still
>>> undecidable.  Whether a TM ever writes a particular symbol is still
>>> undecidable.  There is still no effective procedure to decide if a
>>> context free grammar is ambiguous or not.
>>
>> When we realize that the original theorem depends upon the semantic
>> error of pathological self-reference then the original theorem carries
>> no weight.
> 
> The theorems carry exactly the same wright they did before, whatever

They seem to carry the same weight as they did before because it has not 
been sufficiently well established that their semantic incoherence makes 
them erroneous.

Within the hypothesis that it is an established fact that their 
conclusion is fundamentally based on an error this conclusion would 
correspondingly cease to carry weight.

> words you use to describe the fact that you don't like the halting
> theorem.  Nothing changes because some random bloke on the Internet
> calls something "a semantic error".  No one cares.  People will continue
> to study other interesting and practical undecidable problems, just as
> you will continue to ignore them.
> 
>> I overcome the pathological self-reference of the original
>> halting problem proofs.
> 
> No.  The halting problem is not changed in any way just because some
> daft person redefines "halting".  No one cares about your "new" problem.
> It's the old one -- where halting means... halting (yes, amazing, that I
> even have to say this) that matters.
> 
>> It is no longer possible to show that any
>> element of the entire set of finite strings representing Turing
>> machine descriptions cannot be divided into those having the
>> [would not halt property] and those not having this property.
> 
> Two points.  First, of course you can divide the set of encoded TM
> computations into two in lots of ways, but there is one division that is
> really important -- those that halt and those that don't.
> 
> Second, you can't actually do what you claim.  The PO-almost-halting
> problem is also undecidable.  You can pull the trick you want in a few
> special cases, but there is no effective procedure you can implement
> that will always tell you if a computation "would have to be stopped".
> While you were content to say silly things about just one case you could
> get away with it, but what you claim to be doing can't be done in
> general.
> 

A computation has the [would-not-halt] property if any anytime during 
its execution trace it would not halt unless its execution was aborted.

This same [would-not-halt] property also applies to (at least partial) 
halt deciders that base their halting decision on examining their own 
execution trace of their input to determine whether or not this input 
has the [would-not-halt] property.

When an (at least partial) halt decider determines that its input has 
the [would-not-halt] property it terminates the simulation of its input 
and decides [would-not-halt].



-- 
Copyright 2021 Pete Olcott

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

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


#28567 — Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-05 11:17 -0500
SubjectRe: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property
Message-ID<OQs0I.6608$BJ.1299@fx17.iad>
In reply to#28564
On 3/5/21 11:00 AM, olcott wrote:
>>
> 
> Every instance of the halting problem has a correct yes/no answer except
> for the cases of Turing Machines that do not exist because they are
> defined to provide the correct solution to undecidible descision problems.
> 
> Every Turing machnine that exists either halts or fails to halt.

So, are you claiming here that H_Hat based on your Halts does not exist
as a Turing Machine?

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


#28577 — Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-05 17:39 +0000
SubjectRe: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property
Message-ID<87eegth54c.fsf@bsb.me.uk>
In reply to#28564
olcott <NoOne@NoWhere.com> writes:

> On 3/5/2021 9:45 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 3/5/2021 5:26 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> I created the brand new idea of an incorrect question as any question
>>>>> that is defined in such a way that correct answers cannot possibly
>>>>> exist.
>>>>
>>>> (a) Every instance of the halting problem has a correct yes/no answer.
>>>
>>> Jack's question has a correct yes/no answer:
>>> Will Jack's answer to this question be no?
>>> Yet no correct answer that Jack can provide.
>>
>> You'd like to deny that every instance of the halting problem has a
>> correct yes/no answer but you don't quite have the intellectual courage
>> to do it.
>
> Every instance of the halting problem has a correct yes/no answer
> except for the cases of Turing Machines that do not exist because they
> are defined to provide the correct solution to undecidible descision
> problems.
>
> Every Turing machnine that exists either halts or fails to halt.

And instance of the halting problem is an encoded TM/input pair.  Thus
all of them have a correct yes/no answer.  This is not hard.  It is not
mysterious or ambiguous.

>> There are lots of function from N to N that no TM computes (there are
>> only countably many TMs and uncountable many functioned from N to N).
>> We happen to know a few of these functions.  The halting function (h: N
>> -> {0, 1} with h(n) = 1 iff n encodes a halting computation) is one.
>> Deal with it.
>>
>>>> (b) If you redefine what halting means (as you have done), not one of
>>>> the old theorems change.  Turning machine equivalence is still
>>>> undecidable.  Whether a TM ever writes a particular symbol is still
>>>> undecidable.  There is still no effective procedure to decide if a
>>>> context free grammar is ambiguous or not.
>>>
>>> When we realize that the original theorem depends upon the semantic
>>> error of pathological self-reference then the original theorem carries
>>> no weight.
>>
>> The theorems carry exactly the same wright they did before, whatever
>
> They seem to carry the same weight as they did before because it has
> not been sufficiently well established that their semantic incoherence
> makes them erroneous.

I don't know what an "erroneous" theorem is so I can't say.  I am pretty
confident that people will still care about what computations halt and
which don't (after all, it's central to solving so many problems) and
whether that can be decided by some effective procedure.  I am equally
confident that no one will care about PO-almost-halting but only time
will tell.  You need to get on with it and write that paper!  (In case
you don't get it, I am teasing you here -- I know you can't write a
paper yet.)

> Within the hypothesis that it is an established fact that their
> conclusion is fundamentally based on an error this conclusion would
> correspondingly cease to carry weight.

There is no error.  Every computation either halts or it does not halt.
No TM implements the halting function.  These are simple facts
unaffected by your declaring an "error".

The fact is, you simply don't like those facts because they don't sit
well with your view of the world, so you declare an error where there is
none.  Lots of people want mathematics and logic to be a more
"decidable" place as it would provide a refuge from the chaotic real
world they have trouble coping with.

>> words you use to describe the fact that you don't like the halting
>> theorem.  Nothing changes because some random bloke on the Internet
>> calls something "a semantic error".  No one cares.  People will continue
>> to study other interesting and practical undecidable problems, just as
>> you will continue to ignore them.
>>
>>> I overcome the pathological self-reference of the original
>>> halting problem proofs.
>>
>> No.  The halting problem is not changed in any way just because some
>> daft person redefines "halting".  No one cares about your "new" problem.
>> It's the old one -- where halting means... halting (yes, amazing, that I
>> even have to say this) that matters.
>>
>>> It is no longer possible to show that any
>>> element of the entire set of finite strings representing Turing
>>> machine descriptions cannot be divided into those having the
>>> [would not halt property] and those not having this property.
>>
>> Two points.  First, of course you can divide the set of encoded TM
>> computations into two in lots of ways, but there is one division that is
>> really important -- those that halt and those that don't.
>>
>> Second, you can't actually do what you claim.  The PO-almost-halting
>> problem is also undecidable.  You can pull the trick you want in a few
>> special cases, but there is no effective procedure you can implement
>> that will always tell you if a computation "would have to be stopped".
>> While you were content to say silly things about just one case you could
>> get away with it, but what you claim to be doing can't be done in
>> general.
>
> A computation has the [would-not-halt] property if any anytime during
> its execution trace it would not halt unless its execution was
> aborted.

Yes, I know.  This is an undecidable property of a computation, and
adding the word "trace" does not alter that.  Neither the trace nor the
source code nor anything else about a computation can be used to
determine this property, correctly and in all cases.  I know you won't
ever accept this, so it's a pointless remark, but others may find it
interesting.

> This same [would-not-halt] property also applies to (at least partial)
> halt deciders that base their halting decision on examining their own
> execution trace of their input to determine whether or not this input
> has the [would-not-halt] property.
>
> When an (at least partial) halt decider determines that its input has
> the [would-not-halt] property it terminates the simulation of its input
> and decides [would-not-halt].

If you could write mathematics, this would be clear.  At a guess it
seems to be saying that you are prepared to accept "false positives".
That, as I have said many times, will indeed work.  Any property (even
real halting rather than PO-halting) can be partially decided if enough
cases are permitted to be decided incorrectly (you need infinitely many,
in fact).

-- 
Ben.

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


#28578 — Deciding the [would-not-halt] property

Fromolcott <NoOne@NoWhere.com>
Date2021-03-05 11:47 -0600
SubjectDeciding the [would-not-halt] property
Message-ID<KZudndZ14JtV89_9nZ2dnUU7-a_NnZ2d@giganews.com>
In reply to#28577
On 3/5/2021 11:39 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 3/5/2021 9:45 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 3/5/2021 5:26 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> I created the brand new idea of an incorrect question as any question
>>>>>> that is defined in such a way that correct answers cannot possibly
>>>>>> exist.
>>>>>
>>>>> (a) Every instance of the halting problem has a correct yes/no answer.
>>>>
>>>> Jack's question has a correct yes/no answer:
>>>> Will Jack's answer to this question be no?
>>>> Yet no correct answer that Jack can provide.
>>>
>>> You'd like to deny that every instance of the halting problem has a
>>> correct yes/no answer but you don't quite have the intellectual courage
>>> to do it.
>>
>> Every instance of the halting problem has a correct yes/no answer
>> except for the cases of Turing Machines that do not exist because they
>> are defined to provide the correct solution to undecidible descision
>> problems.
>>
>> Every Turing machnine that exists either halts or fails to halt.
> 
> And instance of the halting problem is an encoded TM/input pair.  Thus
> all of them have a correct yes/no answer.  This is not hard.  It is not
> mysterious or ambiguous.
> 
>>> There are lots of function from N to N that no TM computes (there are
>>> only countably many TMs and uncountable many functioned from N to N).
>>> We happen to know a few of these functions.  The halting function (h: N
>>> -> {0, 1} with h(n) = 1 iff n encodes a halting computation) is one.
>>> Deal with it.
>>>
>>>>> (b) If you redefine what halting means (as you have done), not one of
>>>>> the old theorems change.  Turning machine equivalence is still
>>>>> undecidable.  Whether a TM ever writes a particular symbol is still
>>>>> undecidable.  There is still no effective procedure to decide if a
>>>>> context free grammar is ambiguous or not.
>>>>
>>>> When we realize that the original theorem depends upon the semantic
>>>> error of pathological self-reference then the original theorem carries
>>>> no weight.
>>>
>>> The theorems carry exactly the same wright they did before, whatever
>>
>> They seem to carry the same weight as they did before because it has
>> not been sufficiently well established that their semantic incoherence
>> makes them erroneous.
> 
> I don't know what an "erroneous" theorem is so I can't say.  I am pretty
> confident that people will still care about what computations halt and
> which don't (after all, it's central to solving so many problems) and
> whether that can be decided by some effective procedure.  I am equally
> confident that no one will care about PO-almost-halting but only time
> will tell.  You need to get on with it and write that paper!  (In case
> you don't get it, I am teasing you here -- I know you can't write a
> paper yet.)
> 
>> Within the hypothesis that it is an established fact that their
>> conclusion is fundamentally based on an error this conclusion would
>> correspondingly cease to carry weight.
> 
> There is no error.  Every computation either halts or it does not halt.
> No TM implements the halting function.  These are simple facts
> unaffected by your declaring an "error".
> 
> The fact is, you simply don't like those facts because they don't sit
> well with your view of the world, so you declare an error where there is
> none.  Lots of people want mathematics and logic to be a more
> "decidable" place as it would provide a refuge from the chaotic real
> world they have trouble coping with.
> 
>>> words you use to describe the fact that you don't like the halting
>>> theorem.  Nothing changes because some random bloke on the Internet
>>> calls something "a semantic error".  No one cares.  People will continue
>>> to study other interesting and practical undecidable problems, just as
>>> you will continue to ignore them.
>>>
>>>> I overcome the pathological self-reference of the original
>>>> halting problem proofs.
>>>
>>> No.  The halting problem is not changed in any way just because some
>>> daft person redefines "halting".  No one cares about your "new" problem.
>>> It's the old one -- where halting means... halting (yes, amazing, that I
>>> even have to say this) that matters.
>>>
>>>> It is no longer possible to show that any
>>>> element of the entire set of finite strings representing Turing
>>>> machine descriptions cannot be divided into those having the
>>>> [would not halt property] and those not having this property.
>>>
>>> Two points.  First, of course you can divide the set of encoded TM
>>> computations into two in lots of ways, but there is one division that is
>>> really important -- those that halt and those that don't.
>>>
>>> Second, you can't actually do what you claim.  The PO-almost-halting
>>> problem is also undecidable.  You can pull the trick you want in a few
>>> special cases, but there is no effective procedure you can implement
>>> that will always tell you if a computation "would have to be stopped".
>>> While you were content to say silly things about just one case you could
>>> get away with it, but what you claim to be doing can't be done in
>>> general.
>>
>> A computation has the [would-not-halt] property if any anytime during
>> its execution trace it would not halt unless its execution was
>> aborted.
> 
> Yes, I know.  This is an undecidable property of a computation, and
> adding the word "trace" does not alter that.  Neither the trace nor the
> source code nor anything else about a computation can be used to
> determine this property, correctly and in all cases.  I know you won't
> ever accept this, so it's a pointless remark, but others may find it
> interesting.

I have concretely shown that it does correctly decide the
[would-not-halt] property of the halting problem proof counter-examples.

>> This same [would-not-halt] property also applies to (at least partial)
>> halt deciders that base their halting decision on examining their own
>> execution trace of their input to determine whether or not this input
>> has the [would-not-halt] property.
>>
>> When an (at least partial) halt decider determines that its input has
>> the [would-not-halt] property it terminates the simulation of its input
>> and decides [would-not-halt].
> 
> If you could write mathematics, this would be clear.  At a guess it
> seems to be saying that you are prepared to accept "false positives".

I explained it completely with an x86 assembly language execution trace 
that you could not understand.

> That, as I have said many times, will indeed work.  Any property (even
> real halting rather than PO-halting) can be partially decided if enough
> cases are permitted to be decided incorrectly (you need infinitely many,
> in fact).

It cannot be shown that the [would-not-halt] property would ever be 
decided incorrectly.


-- 
Copyright 2021 Pete Olcott

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

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


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

Back to top | Article view | comp.theory


csiph-web