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


Groups > comp.theory > #39388 > unrolled thread

Why do theory of computation problems require pure functions?

Started byolcott <NoOne@NoWhere.com>
First post2021-09-17 21:40 -0500
Last post2021-09-19 23:11 +0100
Articles 20 on this page of 243 — 10 participants

Back to article view | Back to comp.theory


Contents

  Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-17 21:40 -0500
    Re: Why do theory of computation problems require pure functions? "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-09-17 21:48 -0700
    Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-17 22:50 -0600
      Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 00:02 -0600
        Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 00:13 -0600
          Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 00:29 -0600
      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 08:54 -0500
        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 10:43 -0400
          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 09:49 -0500
            Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:02 -0600
              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:13 -0500
              Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:23 -0400
                Re: Why do theory of computation problems require pure functions? olcott <polcott2@gmail.com> - 2021-09-18 10:28 -0500
                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:42 -0400
                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:51 -0500
                      Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:00 -0400
                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:34 -0500
                Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:29 -0600
                  Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 11:31 -0600
                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:47 -0500
                      Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:34 -0400
                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:45 -0500
                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:06 -0400
                            Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:20 -0500
                              Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 21:46 +0100
                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 16:06 -0500
                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:14 -0400
                                  Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:58 +0100
                              Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:04 -0400
            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:13 -0400
              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:19 -0500
                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:25 -0400
                  Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:37 -0500
                    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:44 -0400
                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:08 -0500
                        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:32 -0400
                          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:04 -0500
                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:12 -0400
                              Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:02 +0100
                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 16:11 -0500
                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:30 -0400
                                  Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:03 +0100
        Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:01 -0600
          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:10 -0500
            Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:09 -0600
              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:36 -0500
    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 07:14 -0400
    Re: Why do theory of computation problems require pure functions? Andy Walker <anw@cuboid.co.uk> - 2021-09-18 13:02 +0100
      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 08:57 -0500
        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 10:53 -0400
        Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:04 -0600
          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:17 -0500
            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:24 -0400
              Re: Why do theory of computation problems require pure functions? olcott <polcott2@gmail.com> - 2021-09-18 10:29 -0500
                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:37 -0400
                  Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:39 -0500
                    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:52 -0400
                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:15 -0500
                        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:28 -0400
                          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:50 -0500
                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:08 -0400
                              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:30 -0500
                                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:52 -0400
                                  Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 15:07 -0500
                                    Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:55 -0400
                                      Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 16:22 -0500
                                        Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:38 -0400
                                          Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 16:48 -0500
                                            Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:01 -0400
                                              Re: Why do theory of computation problems require pure functions? [defeat Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:10 -0500
                                                Re: Why do theory of computation problems require pure functions? [defeat Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:26 -0400
                Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:55 +0100
            Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:10 -0600
              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:39 -0500
                Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:52 -0600
                  Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:08 -0500
                    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:24 -0400
                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:39 -0500
                        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:57 -0400
                          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:17 -0500
                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:45 -0400
                              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:55 -0500
                                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:11 -0400
                                Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:08 -0600
                                  Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:15 -0500
                                    Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:28 -0600
                                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:32 -0500
                                        Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:55 -0600
                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:58 -0400
                                          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:58 -0500
                                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:09 -0400
                                              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 22:32 -0500
                                                Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 22:10 -0600
                                                  Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 22:19 -0600
                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 00:12 -0500
                                                      Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 00:00 -0600
                                                        Re: Why do theory of computation problems require pure functions?[ decidability decider citation ] olcott <NoOne@NoWhere.com> - 2021-09-19 06:56 -0500
                                                          Re: Why do theory of computation problems require pure functions?[ decidability decider citation ] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 08:05 -0600
                                                      Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 06:28 -0400
                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 09:34 -0500
                                                      Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 09:40 -0600
                                                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 10:46 -0500
                                                          Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 10:11 -0600
                                                            Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 11:39 -0500
                                                              Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 10:56 -0600
                                                                Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 12:07 -0500
                                                                  Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 11:25 -0600
                                                                    Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 12:54 -0500
                                                                      Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 12:24 -0600
                                                                        Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 13:33 -0500
                                                                          Re: Why do theory of computation problems require pure functions? [ PSR error] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 15:11 -0400
                                                                          Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 20:22 +0100
                                                                            Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 14:31 -0500
                                                                              Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 21:39 +0100
                                                                              Re: Why do theory of computation problems require pure functions? [ PSR error] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 18:59 -0400
                                                                          Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 13:23 -0600
                                                                            Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 14:37 -0500
                                                                              Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 13:45 -0600
                                                                              Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 21:33 +0100
                                                                  Re: Why do theory of computation problems require pure functions? [ PSR error] Jeff Barnett <jbb@notatt.com> - 2021-09-19 11:36 -0600
                                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 13:37 -0400
                                                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 06:31 -0400
                                            Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 17:14 -0600
                                          Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-18 16:11 -0700
                                            Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 17:16 -0600
                                              Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:52 +0100
                                            Re: Why do theory of computation problems require pure functions? [ Bingo !] olcott <NoOne@NoWhere.com> - 2021-09-18 18:17 -0500
                                              Re: Why do theory of computation problems require pure functions? [ Bingo !] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:20 -0400
                                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:17 -0400
                                            Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:38 +0100
                                              Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-19 15:36 -0700
                                                Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:01 +0100
                                                  Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-19 16:23 -0700
                                                    Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:37 +0100
                                                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:49 -0500
                                                        Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 10:54 +0100
                                                          Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 08:58 -0500
                                                            Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:02 -0400
                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:21 -0500
                                                      Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 11:00 +0100
                                                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 09:21 -0500
                                                          Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 23:06 +0100
                                                            Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 18:33 -0500
                                                              Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:00 +0100
                                                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 19:14 -0500
                                                                  Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:56 +0100
                                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:11 -0500
                                                                      Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 02:45 +0100
                                                                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:49 -0500
                                                                          Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:30 +0100
                                                                            Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 21:38 -0500
                                                                              Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:50 +0100
                                                                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:09 -0500
                                                                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:29 -0400
                                                                                  Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-22 01:44 +0100
                                                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-21 19:56 -0500
                                                                                      Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-22 23:58 +0100
                                                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:05 -0400
                                                                            Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:13 -0500
                                                                              Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:35 -0400
                                                                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-21 10:21 -0500
                                                                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-21 22:12 -0400
                                                                      Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:16 -0400
                                                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:12 -0400
                                                                    Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 21:25 -0500
                                                                      Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:21 -0400
                                                                        Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 23:03 -0500
                                                                          Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 00:42 -0400
                                                                            Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 23:55 -0500
                                                                              Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 01:17 -0400
                                                                              Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 08:23 -0400
                                                                                Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 10:19 -0500
                                                                                  Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 11:51 -0600
                                                                                    Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 13:22 -0500
                                                                                      Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 12:43 -0600
                                                                                        Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 14:25 -0500
                                                                                          Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 21:33 -0400
                                                                                          Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 21:45 -0600
                                                                                            Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 23:05 -0500
                                                                                              Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 07:03 -0400
                                                                                              Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-22 14:46 -0600
                                                                                                Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-22 15:52 -0500
                                                                                                  Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 19:55 -0400
                                                                                      Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 19:23 -0400
                                                                                  Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 19:21 -0400
                                                                                    Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 18:56 -0500
                                                                                      Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 21:39 -0400
                                                                                      Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 08:01 -0400
                                                                            Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 10:16 -0500
                                                                              Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 22:10 -0400
                                                              Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 21:28 -0400
                                                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:33 -0500
                                                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:21 -0400
                                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 21:35 -0500
                                                                      Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:45 +0100
                                                                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:07 -0500
                                                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:24 -0400
                                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:04 -0400
                                                Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:18 -0500
                                                  Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 19:48 -0600
                                                    Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 21:00 -0500
                                                      Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:10 -0400
                                                      Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 20:20 -0600
                                                        Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 21:55 -0500
                                                          Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 22:16 -0600
                                                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 06:47 -0400
                                                            Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 09:22 -0500
                                                              Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:19 -0400
                                                  Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:15 -0400
                                        Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 18:21 -0600
                                          Re: Why do theory of computation problems require pure functions? Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-09-19 03:15 +0100
                                    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:29 -0400
                        Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:54 +0100
                          Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:02 -0500
                            Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:24 -0400
                              Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:29 -0500
                                Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:35 -0400
                            Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:43 +0100
                              Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-19 20:56 -0500
                                Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:22 -0400
                                Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 10:54 +0100
                                  Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 09:02 -0500
                                    Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 23:05 +0100
                                      Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 18:37 -0500
                                        Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:43 +0100
                                          Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 19:51 -0500
                                            Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:10 +0100
                                        Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:27 -0400
                          Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:32 -0400
                            Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:07 +0100
                Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 14:55 -0400
                  Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:06 -0500
                    Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:40 -0400
                      Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:52 -0500
                        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:15 -0400
            Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:51 +0100
              Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:00 -0500
                Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:26 +0100
      Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:45 +0100
        Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:51 -0400
          Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 23:24 +0100
        Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 16:57 -0500
          Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:11 +0100

Page 11 of 13 — ← Prev page 1 … 9 10 [11] 12 13  Next page →


#39589

Fromolcott <NoOne@NoWhere.com>
Date2021-09-19 21:00 -0500
Message-ID<v6idnae2nraxdtr8nZ2dnUU7-UPNnZ2d@giganews.com>
In reply to#39586
On 9/19/2021 8:48 PM, André G. Isaak wrote:
> On 2021-09-19 19:18, olcott wrote:
>> On 9/19/2021 5:36 PM, Malcolm McLean wrote:
>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>
>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak 
>>>>> wrote:
>>>>>> On 2021-09-18 16:32, olcott wrote:
>>>>>>
>>>>>>>
>>>>>>> I just defeated Rice's theorem, the other details are for another 
>>>>>>> day.
>>>>>> How exactly have you managed to do that?
>>>>>>
>>>>>> Unless you know which is correct, your H1/H pair are unable to 
>>>>>> reach a
>>>>>> decision at all regarding halting.
>>>>>>
>>>>> We construct two halt deciders, which are known to be correct, other
>>>>> than for "pathological" inputs. When fed such a "pathological" input,
>>>>> one returns true and the other returns false.
>>>>>
>>>>> Therefore using the two halt deciders and selecting the instances 
>>>>> where
>>>>> they disagree, we have classified the "pathological inputs", 
>>>>> something that
>>>>> Rice's theorem states that cannot be achieved.
>>>>
>>>> Why do you say that? Surely that depends entirely on the parts you put
>>>> in scare quotes. PO (deliberately?) flip-lops between stating that
>>>> "pathological" inputs are characterised by a syntactic pattern and by a
>>>> semantic property. Why do you even think he knows which one he is
>>>> talking about today?
>>>>
>>> I'm just summarising PO's argument so that others can understand 
>>> where he
>>> is coming from.
>>> You can poke holes in the argument, of course, but to try to do that 
>>> at the same
>>> time as summarising it would be unfiar and counter-productive.
>>>
>>
>> Pathological self-reference (Olcott 2004) is generically the case 
>> where the evaluation whether an expression of language has a semantic 
>> property cannot be correctly made because this expression of language has 
> 
> Your programs are written in C. C has well-defined syntactic and 
> semantic rules. Neither your H nor your P violate any of those rules, so 
> in what sense is there an 'error'. Just asserting that there is one 
> doesn't make it so.
> 
> Yes, your H(P, P) produces the wrong answer, but that doesn't mean 
> there's any sort of 'error' with P.
> 
> André
> 
> André


This is a brand new semantic error that I first discovered in 2004 and 
was only able to concretely formalize in the last two weeks as

void P(u32 x)
{
   if (H(x, x))
     HERE: goto HERE;
}

u32 PSR_Olcott_2004(u32 P)
{
   return H1(P,P) != H(P,P);
}


-- 
Copyright 2021 Pete Olcott

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

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


#39590

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-19 22:10 -0400
Message-ID<B4S1J.42729$3p3.29291@fx16.iad>
In reply to#39589
On 9/19/21 10:00 PM, olcott wrote:
> On 9/19/2021 8:48 PM, André G. Isaak wrote:
>> On 2021-09-19 19:18, olcott wrote:
>>> On 9/19/2021 5:36 PM, Malcolm McLean wrote:
>>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote:
>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>>
>>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak
>>>>>> wrote:
>>>>>>> On 2021-09-18 16:32, olcott wrote:
>>>>>>>
>>>>>>>>
>>>>>>>> I just defeated Rice's theorem, the other details are for
>>>>>>>> another day.
>>>>>>> How exactly have you managed to do that?
>>>>>>>
>>>>>>> Unless you know which is correct, your H1/H pair are unable to
>>>>>>> reach a
>>>>>>> decision at all regarding halting.
>>>>>>>
>>>>>> We construct two halt deciders, which are known to be correct, other
>>>>>> than for "pathological" inputs. When fed such a "pathological" input,
>>>>>> one returns true and the other returns false.
>>>>>>
>>>>>> Therefore using the two halt deciders and selecting the instances
>>>>>> where
>>>>>> they disagree, we have classified the "pathological inputs",
>>>>>> something that
>>>>>> Rice's theorem states that cannot be achieved.
>>>>>
>>>>> Why do you say that? Surely that depends entirely on the parts you put
>>>>> in scare quotes. PO (deliberately?) flip-lops between stating that
>>>>> "pathological" inputs are characterised by a syntactic pattern and
>>>>> by a
>>>>> semantic property. Why do you even think he knows which one he is
>>>>> talking about today?
>>>>>
>>>> I'm just summarising PO's argument so that others can understand
>>>> where he
>>>> is coming from.
>>>> You can poke holes in the argument, of course, but to try to do that
>>>> at the same
>>>> time as summarising it would be unfiar and counter-productive.
>>>>
>>>
>>> Pathological self-reference (Olcott 2004) is generically the case
>>> where the evaluation whether an expression of language has a semantic
>>> property cannot be correctly made because this expression of language
>>> has 
>>
>> Your programs are written in C. C has well-defined syntactic and
>> semantic rules. Neither your H nor your P violate any of those rules,
>> so in what sense is there an 'error'. Just asserting that there is one
>> doesn't make it so.
>>
>> Yes, your H(P, P) produces the wrong answer, but that doesn't mean
>> there's any sort of 'error' with P.
>>
>> André
>>
>> André
> 
> 
> This is a brand new semantic error that I first discovered in 2004 and
> was only able to concretely formalize in the last two weeks as
> 
> void P(u32 x)
> {
>   if (H(x, x))
>     HERE: goto HERE;
> }
> 
> u32 PSR_Olcott_2004(u32 P)
> {
>   return H1(P,P) != H(P,P);
> }
> 
> 

This is NOT a semantic error.

It is an error in your own understanding of what the problem being asked is.


FAIL.

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


#39592

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-09-19 20:20 -0600
Message-ID<si8r5f$npo$1@dont-email.me>
In reply to#39589
On 2021-09-19 20:00, olcott wrote:

> This is a brand new semantic error that I first discovered in 2004 and 
> was only able to concretely formalize in the last two weeks as
> 
> void P(u32 x)
> {
>    if (H(x, x))
>      HERE: goto HERE;
> }
> 
> u32 PSR_Olcott_2004(u32 P)
> {
>    return H1(P,P) != H(P,P);
> }

Those are simply lines of code. They don't 'formalize' anything. Finding 
that two procedure calls don't give the same result doesn't signal any 
sort of error.

The semantics of C are governed by the C standard. Unless you can point 
to some specific aspect of C semantics that are being violated, you 
can't call this a 'semantic error'.

André

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

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


#39594

Fromolcott <NoOne@NoWhere.com>
Date2021-09-19 21:55 -0500
Message-ID<w_Wdnf4g-YWJZdr8nZ2dnUU7-Q3NnZ2d@giganews.com>
In reply to#39592
On 9/19/2021 9:20 PM, André G. Isaak wrote:
> On 2021-09-19 20:00, olcott wrote:
> 
>> This is a brand new semantic error that I first discovered in 2004 and 
>> was only able to concretely formalize in the last two weeks as
>>
>> void P(u32 x)
>> {
>>    if (H(x, x))
>>      HERE: goto HERE;
>> }
>>
>> u32 PSR_Olcott_2004(u32 P)
>> {
>>    return H1(P,P) != H(P,P);
>> }
> 
> Those are simply lines of code. They don't 'formalize' anything. 

The rest of the fully opertational code that implements them does.

> Finding 
> that two procedure calls don't give the same result doesn't signal any 
> sort of error.
> 

The Pathological self-reference error is why
"This sentence is not true" is neither true nor false.
It is (like H/P) self-contradictory.

> The semantics of C are governed by the C standard. Unless you can point 
> to some specific aspect of C semantics that are being violated, you 
> can't call this a 'semantic error'.
> 
> André
> 


-- 
Copyright 2021 Pete Olcott

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

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


#39596

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-09-19 22:16 -0600
Message-ID<si91v5$gna$1@dont-email.me>
In reply to#39594
On 2021-09-19 20:55, olcott wrote:
> On 9/19/2021 9:20 PM, André G. Isaak wrote:
>> On 2021-09-19 20:00, olcott wrote:
>>
>>> This is a brand new semantic error that I first discovered in 2004 
>>> and was only able to concretely formalize in the last two weeks as
>>>
>>> void P(u32 x)
>>> {
>>>    if (H(x, x))
>>>      HERE: goto HERE;
>>> }
>>>
>>> u32 PSR_Olcott_2004(u32 P)
>>> {
>>>    return H1(P,P) != H(P,P);
>>> }
>>
>> Those are simply lines of code. They don't 'formalize' anything. 
> 
> The rest of the fully opertational code that implements them does.

Even if you have fully operational code, that still doesn't formalize 
the notion of a 'pathological reference error'. For that you need an 
actual DEFINITION. You've attempted a few but none of them have even 
approached being a real formal definition. AFAICT 'pathological 
reference error' is simply another way of saying 'something that Olcott 
would like to sweep under the rug'.

>> Finding that two procedure calls don't give the same result doesn't 
>> signal any sort of error.
>>
> 
> The Pathological self-reference error is why
> "This sentence is not true" is neither true nor false.
> It is (like H/P) self-contradictory.

You've said this many times. It's simply not compelling. There's no 
resemblance between the halting problem and the liar. While the liar 
arguably has no truth value, P(P) has a perfectly well-defined halting 
status which can easily be determined. It simply cannot be determined by 
H. There's no 'error' involved; simply a limitation of what H (or any 
other alleged halt decider) can actually do.

There's nothing 'erroneous' about P. You seem to claim that the error 
arises only when it appears as an input to H (and even then, only when 
the input to P is a description of P). The only way that that can be 
sensibly interpreted is to view this as a claim that this isn't a valid 
input to H because it falls outside the domain of the function H. But 
since P(P) *is* a computation, that is simply an acknowledgement that H 
is not a *universal* halt decider. By definition, a universal halt 
decider must accept *any* valid computation as an input and must return 
a result.

André


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

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


#39600

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-20 06:47 -0400
Message-ID<rFZ1J.43011$md6.14426@fx36.iad>
In reply to#39594
On 9/19/21 10:55 PM, olcott wrote:
> On 9/19/2021 9:20 PM, André G. Isaak wrote:
>> On 2021-09-19 20:00, olcott wrote:
>>
>>> This is a brand new semantic error that I first discovered in 2004
>>> and was only able to concretely formalize in the last two weeks as
>>>
>>> void P(u32 x)
>>> {
>>>    if (H(x, x))
>>>      HERE: goto HERE;
>>> }
>>>
>>> u32 PSR_Olcott_2004(u32 P)
>>> {
>>>    return H1(P,P) != H(P,P);
>>> }
>>
>> Those are simply lines of code. They don't 'formalize' anything. 
> 
> The rest of the fully opertational code that implements them does.
> 
>> Finding that two procedure calls don't give the same result doesn't
>> signal any sort of error.
>>
> 
> The Pathological self-reference error is why
> "This sentence is not true" is neither true nor false.
> It is (like H/P) self-contradictory.
> 

That is meaningless in this context.

In what sense are you claiming that P doesn't have a truth value?

It is clear, and you have accepted, that P(P) does Halt when run as a
Computation. This is the proper value of the Question of does P(P) Halt.

In what way does that running not have a value?

The ONLY question you have shown to not have a value is the question,
"What Should H return when given the input <P> <P> to be right?"

That is NOT a question in view at this time, as once you have defined
this PSC_Olcott_2004 as a machine, you HAD to have made whatever wrong
choice to that question you are going to make.

If you issue that H is actually DEFINED as returning the rtght value,
then H is not a Computation, becuase it is not based on an actual
algorithm, and it also means that you haven't written code that
implements H because you can't write C code that actually implements
that either.

It seems what you have written is some code to implement the results of
faulty logic that you just assume/'stipulate' must be correct, but which
is actually unsound and wrong.

>> The semantics of C are governed by the C standard. Unless you can
>> point to some specific aspect of C semantics that are being violated,
>> you can't call this a 'semantic error'.
>>
>> André
>>
> 
> 

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


#39604

Fromolcott <NoOne@NoWhere.com>
Date2021-09-20 09:22 -0500
Message-ID<i96dnQL238StBNX8nZ2dnUU7-XOdnZ2d@giganews.com>
In reply to#39600
On 9/20/2021 5:47 AM, Richard Damon wrote:
> On 9/19/21 10:55 PM, olcott wrote:
>> On 9/19/2021 9:20 PM, André G. Isaak wrote:
>>> On 2021-09-19 20:00, olcott wrote:
>>>
>>>> This is a brand new semantic error that I first discovered in 2004
>>>> and was only able to concretely formalize in the last two weeks as
>>>>
>>>> void P(u32 x)
>>>> {
>>>>     if (H(x, x))
>>>>       HERE: goto HERE;
>>>> }
>>>>
>>>> u32 PSR_Olcott_2004(u32 P)
>>>> {
>>>>     return H1(P,P) != H(P,P);
>>>> }
>>>
>>> Those are simply lines of code. They don't 'formalize' anything.
>>
>> The rest of the fully opertational code that implements them does.
>>
>>> Finding that two procedure calls don't give the same result doesn't
>>> signal any sort of error.
>>>
>>
>> The Pathological self-reference error is why
>> "This sentence is not true" is neither true nor false.
>> It is (like H/P) self-contradictory.
>>
> 
> That is meaningless in this context.
> 
> In what sense are you claiming that P doesn't have a truth value?
> 

 >

Unless one of them has a pathological self-reference relationship with 
its input and the other one does not.

void P(u32 x)
{
   if (H(x, x))
     HERE: goto HERE;
}

P was intentionally designed to contradict the H halt decider.
P was not intentionally designed to contradict the H1 halt decider.



> It is clear, and you have accepted, that P(P) does Halt when run as a
> Computation. This is the proper value of the Question of does P(P) Halt.
> 
> In what way does that running not have a value?
> 
> The ONLY question you have shown to not have a value is the question,
> "What Should H return when given the input <P> <P> to be right?"
> 
> That is NOT a question in view at this time, as once you have defined
> this PSC_Olcott_2004 as a machine, you HAD to have made whatever wrong
> choice to that question you are going to make.
> 
> If you issue that H is actually DEFINED as returning the rtght value,
> then H is not a Computation, becuase it is not based on an actual
> algorithm, and it also means that you haven't written code that
> implements H because you can't write C code that actually implements
> that either.
> 
> It seems what you have written is some code to implement the results of
> faulty logic that you just assume/'stipulate' must be correct, but which
> is actually unsound and wrong.
> 
>>> The semantics of C are governed by the C standard. Unless you can
>>> point to some specific aspect of C semantics that are being violated,
>>> you can't call this a 'semantic error'.
>>>
>>> André
>>>
>>
>>
> 


-- 
Copyright 2021 Pete Olcott

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

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


#39637

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-20 19:19 -0400
Message-ID<5G82J.15090$IO1.14165@fx19.iad>
In reply to#39604
On 9/20/21 10:22 AM, olcott wrote:
> On 9/20/2021 5:47 AM, Richard Damon wrote:
>> On 9/19/21 10:55 PM, olcott wrote:
>>> On 9/19/2021 9:20 PM, André G. Isaak wrote:
>>>> On 2021-09-19 20:00, olcott wrote:
>>>>
>>>>> This is a brand new semantic error that I first discovered in 2004
>>>>> and was only able to concretely formalize in the last two weeks as
>>>>>
>>>>> void P(u32 x)
>>>>> {
>>>>>     if (H(x, x))
>>>>>       HERE: goto HERE;
>>>>> }
>>>>>
>>>>> u32 PSR_Olcott_2004(u32 P)
>>>>> {
>>>>>     return H1(P,P) != H(P,P);
>>>>> }
>>>>
>>>> Those are simply lines of code. They don't 'formalize' anything.
>>>
>>> The rest of the fully opertational code that implements them does.
>>>
>>>> Finding that two procedure calls don't give the same result doesn't
>>>> signal any sort of error.
>>>>
>>>
>>> The Pathological self-reference error is why
>>> "This sentence is not true" is neither true nor false.
>>> It is (like H/P) self-contradictory.
>>>
>>
>> That is meaningless in this context.
>>
>> In what sense are you claiming that P doesn't have a truth value?
>>
> 
>>
> 
> Unless one of them has a pathological self-reference relationship with
> its input and the other one does not.
> 
> void P(u32 x)
> {
>   if (H(x, x))
>     HERE: goto HERE;
> }
> 
> P was intentionally designed to contradict the H halt decider.
> P was not intentionally designed to contradict the H1 halt decider.
> 

Right, which is TOTALLY allowed.

You have thus either proved that H and H1 are NOT the same computation,
or that Nither actually is a Computaiton.

Since H1 and H give different answer, they can't be the same ACTUAL
computation since this 'self reference' property isn't an input.

If H1 can distinguish itself from H, it isn't the same computation.

PERIOD.

> 
> 
>> It is clear, and you have accepted, that P(P) does Halt when run as a
>> Computation. This is the proper value of the Question of does P(P) Halt.
>>
>> In what way does that running not have a value?
>>
>> The ONLY question you have shown to not have a value is the question,
>> "What Should H return when given the input <P> <P> to be right?"
>>
>> That is NOT a question in view at this time, as once you have defined
>> this PSC_Olcott_2004 as a machine, you HAD to have made whatever wrong
>> choice to that question you are going to make.
>>
>> If you issue that H is actually DEFINED as returning the rtght value,
>> then H is not a Computation, becuase it is not based on an actual
>> algorithm, and it also means that you haven't written code that
>> implements H because you can't write C code that actually implements
>> that either.
>>
>> It seems what you have written is some code to implement the results of
>> faulty logic that you just assume/'stipulate' must be correct, but which
>> is actually unsound and wrong.
>>
>>>> The semantics of C are governed by the C standard. Unless you can
>>>> point to some specific aspect of C semantics that are being violated,
>>>> you can't call this a 'semantic error'.
>>>>
>>>> André
>>>>
>>>
>>>
>>
> 
> 

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


#39591

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-19 22:15 -0400
Message-ID<t9S1J.112246$Kv2.105439@fx47.iad>
In reply to#39584
On 9/19/21 9:18 PM, olcott wrote:
> On 9/19/2021 5:36 PM, Malcolm McLean wrote:
>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote:
>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>
>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote:
>>>>> On 2021-09-18 16:32, olcott wrote:
>>>>>
>>>>>>
>>>>>> I just defeated Rice's theorem, the other details are for another
>>>>>> day.
>>>>> How exactly have you managed to do that?
>>>>>
>>>>> Unless you know which is correct, your H1/H pair are unable to reach a
>>>>> decision at all regarding halting.
>>>>>
>>>> We construct two halt deciders, which are known to be correct, other
>>>> than for "pathological" inputs. When fed such a "pathological" input,
>>>> one returns true and the other returns false.
>>>>
>>>> Therefore using the two halt deciders and selecting the instances where
>>>> they disagree, we have classified the "pathological inputs",
>>>> something that
>>>> Rice's theorem states that cannot be achieved.
>>>
>>> Why do you say that? Surely that depends entirely on the parts you put
>>> in scare quotes. PO (deliberately?) flip-lops between stating that
>>> "pathological" inputs are characterised by a syntactic pattern and by a
>>> semantic property. Why do you even think he knows which one he is
>>> talking about today?
>>>
>> I'm just summarising PO's argument so that others can understand where he
>> is coming from.
>> You can poke holes in the argument, of course, but to try to do that
>> at the same
>> time as summarising it would be unfiar and counter-productive.
>>
> 
> Pathological self-reference (Olcott 2004) is generically the case where
> the evaluation whether an expression of language has a semantic property
> cannot be correctly made because this expression of language has
> self-reference.
> 
> Concretely one case of this is objectively assessed by this function:
> 
> u32 PSR_Olcott_2004(u32 P)
> {
>   return H1(P,P) != H(P,P);
> }
> 

So PSR_Olcott_2004 fails at its job because it gives different answer to:

u32 P1(u32 P) {
  if(H1(P,P)) {
     while(1) continue;
  }
}


u32 P2(u32 P) {
  if(H2(P,P)) {
     while(1) continue;
  }
}

Which either should both display the problem or nether, but PSR
categorizes them differently.

FAIL.

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


#39503

FromJeff Barnett <jbb@notatt.com>
Date2021-09-18 18:21 -0600
Message-ID<si5vpj$nvd$1@dont-email.me>
In reply to#39490
On 9/18/2021 4:32 PM, olcott wrote:
> On 9/18/2021 5:28 PM, André G. Isaak wrote:
>> On 2021-09-18 16:15, olcott wrote:
>>> On 9/18/2021 5:08 PM, André G. Isaak wrote:

>>> By using the H1/H pair we have a universal halt decider.
>>> Whenever they don't provide the same result then one of them is wrong.

Here's my pair:
    function H1 (anything) return true;
    function H2 (anything) return false;

I too have a universal halt decider! Whenever they don't provide the 
same result then one of them is wrong.

I wished I had realized how easy this problem was. I wonder if I'll beat 
you to publish.
-- 
Jeff Barnett

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


#39505

FromMike Terry <news.dead.person.stones@darjeeling.plus.com>
Date2021-09-19 03:15 +0100
Message-ID<NJ-dnY3PvrzGANv8nZ2dnUU78SHNnZ2d@brightview.co.uk>
In reply to#39503
On 19/09/2021 01:21, Jeff Barnett wrote:> On 9/18/2021 4:32 PM, olcott 
wrote:
 >> On 9/18/2021 5:28 PM, André G. Isaak wrote:
 >>> On 2021-09-18 16:15, olcott wrote:
 >>>> On 9/18/2021 5:08 PM, André G. Isaak wrote:
 >
 >>>> By using the H1/H pair we have a universal halt decider.
 >>>> Whenever they don't provide the same result then one of them is wrong.
 >
 > Here's my pair:
 >     function H1 (anything) return true;
 >     function H2 (anything) return false;
 >
 > I too have a universal halt decider! Whenever they don't provide the
 > same result then one of them is wrong.

You could use this to define the PO-semantic property of "horrible 
input" (HI).  Then you could claim to have defeated Rice as well! 
That's like killing two birds with one stone, which is supposedly a 
highly admirable achievement.  :)

 >
 > I wished I had realized how easy this problem was. I wonder if I'll beat
 > you to publish.

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


#39488

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-18 18:29 -0400
Message-ID<UKt1J.42634$3p3.36267@fx16.iad>
In reply to#39483
On 9/18/21 6:15 PM, olcott wrote:
> On 9/18/2021 5:08 PM, André G. Isaak wrote:
>> On 2021-09-18 14:55, olcott wrote:
>>> On 9/18/2021 3:45 PM, Richard Damon wrote:
>>>> On 9/18/21 4:17 PM, olcott wrote:
>>>>> On 9/18/2021 2:57 PM, Richard Damon wrote:
>>>>>> On 9/18/21 3:39 PM, olcott wrote:
>>>>>>> On 9/18/2021 2:24 PM, Richard Damon wrote:
>>>>>>>> On 9/18/21 1:08 PM, olcott wrote:
>>>>>>>>> On 9/18/2021 11:52 AM, André G. Isaak wrote:
>>>>>>>>>> On 2021-09-18 10:39, olcott wrote:
>>>>>>>>>>> On 9/18/2021 11:10 AM, André G. Isaak wrote:
>>>>>>>>>>>> On 2021-09-18 09:17, olcott wrote:
>>>>>>>>>>>>> On 9/18/2021 10:04 AM, André G. Isaak wrote:
>>>>>>>>>>>>>> On 2021-09-18 07:57, olcott wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> I either must stick with C/x86 code or write a RASP
>>>>>>>>>>>>>>> machine, the
>>>>>>>>>>>>>>> only way that my key insights can possible be fully
>>>>>>>>>>>>>>> understood is
>>>>>>>>>>>>>>> to have every single detail as fully operational code
>>>>>>>>>>>>>>> such that
>>>>>>>>>>>>>>> we can simply see what it does and thus not merely
>>>>>>>>>>>>>>> imagine what
>>>>>>>>>>>>>>> it would do.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Why do you insist on continuously repeating this rather
>>>>>>>>>>>>>> ridiculous
>>>>>>>>>>>>>> claim?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> When working with Turing Machines one doesn't need to 'merely
>>>>>>>>>>>>>> imagine what it would do.' One can see *exactly* what it
>>>>>>>>>>>>>> does.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> When H is defined as a simulating halt decider then H
>>>>>>>>>>>>> correctly
>>>>>>>>>>>>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩.
>>>>>>>>>>>>
>>>>>>>>>>>> And this statement relates to my post how exactly?
>>>>>>>>>>>>
>>>>>>>>>>>> André
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> How can [One can see *exactly* what it does] show that my
>>>>>>>>>>> claim that
>>>>>>>>>>> simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly
>>>>>>>>>>> decide the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ?
>>>>>>>>>>
>>>>>>>>>> I made no claims whatsoever in my post about your H.
>>>>>>>>>
>>>>>>>>> This is exactly what I mean by dishonest dodge AKA the strawman
>>>>>>>>> error.
>>>>>>>>>
>>>>>>>>> When we examine the Peter Linz H applied to ⟨Ĥ⟩ ⟨Ĥ⟩
>>>>>>>>>
>>>>>>>>> there is nothing in the peter Linz text where
>>>>>>>>> [One can see *exactly* what it does]
>>>>>>>>>
>>>>>>>>> when we assume that the Peter Linz H/Ĥ are based on simulating
>>>>>>>>> halt
>>>>>>>>> deciders.
>>>>>>>>
>>>>>>>> In the Linz text, we are not given the detail of what the
>>>>>>>> machines do
>>>>>>>> inside for their processing, but we know EXACTLY how they behave
>>>>>>>> at an
>>>>>>>> input/output level.
>>>>>>>>
>>>>>>>> H is given a defined input, a properly encoded version of H^ (<H^>)
>>>>>>>>
>>>>>>>> and is defined to end, based on whatever algorithm is inside H to
>>>>>>>> end at
>>>>>>>> either H.qy or H.qn.
>>>>>>>>
>>>>>>>> He then defines a machine H^ that is based on a nearly exact
>>>>>>>> copy of H,
>>>>>>>> with just a minor change in the qy state to make it non-terminal
>>>>>>>> but
>>>>>>>> loop, and the add a duplication of the input, so H^ can take as an
>>>>>>>> input
>>>>>>>> <H^> and then get to the copy of the code of H with <H^> <H^> on
>>>>>>>> the
>>>>>>>> tape, which is by definition the encoding of the machine H^(<H^>).
>>>>>>>>
>>>>>>>> Since it is identical code with identical input, but the
>>>>>>>> property of
>>>>>>>> being a Computation, if H(<H^>.<H^>) will end at H.qn, then H^
>>>>>>>> will end
>>>>>>>> at H^.qn (and then halt) and if H ends at H.qy then H^ will get to
>>>>>>>> H^.qy
>>>>>>>> (and then loop forever).
>>>>>>>>
>>>>>>>> Yes, Linz doesn't describe how H is designed to get from H.q0 to
>>>>>>>> H.qn or
>>>>>>>> H.qy, and that is intentional, as that is specified totally by the
>>>>>>>> design of H, and since NOTHING has been assumed about it, no
>>>>>>>> possible H
>>>>>>>> has been excluded from the reasoning.
>>>>>>>>
>>>>>>>> Thus, even your simulating halt decider case fits in his model.
>>>>>>>>
>>>>>>>> Once we know what the provided H will do when given this input,
>>>>>>>> we can
>>>>>>>> see what the machine that this input represents, and if H said
>>>>>>>> it would
>>>>>>>> halt, it loops, and if H says it won't halt, it Halts, thus any
>>>>>>>> answer H
>>>>>>>> gives will be wrong.
>>>>>>>>
>>>>>>>> The only other posibilities is that H never gets to either H.qn or
>>>>>>>> H.qy,
>>>>>>>> in which case it has also failed to give the right answer.
>>>>>>>>
>>>>>>>
>>>>>>> That is factually incorrect.
>>>>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>>>>>
>>>>>> When did you ever claim that H (not H1) ever said that H^(H^) was
>>>>>> halting.
>>>>>>
>>>>>> You can't use H1, as H^ is built on H, if you want to use H1, you
>>>>>> need
>>>>>> to build the H1^ that calls it to test.
>>>>>>
>>>>>> Maybe you still don't know what that line means.
>>>>>>
>>>>>>>
>>>>>>> The Linz text does cannot possibly get into sufficient detail to
>>>>>>> show
>>>>>>> how this is not true simply because it is true.
>>>>>>>
>>>>>>
>>>>>> Since your described algorithm for H says that H will declare this
>>>>>> input
>>>>>> to be non-halting, you are lying to say that this H goes to the
>>>>>> terminal
>>>>>> state qy.
>>>>>>
>>>>>> The actual behavior of machine H is determined by the algorithm
>>>>>> embedded
>>>>>> in it. That algorithm says that <H^> <H^> represents a non-halting
>>>>>> computation, therefore H will go to H.qn.
>>>>>>
>>>>>> Linz says that the H that gives the RIGHT answer for an input that is
>>>>>> Halting will go to H.qy, but your H doesn't go there because it is
>>>>>> not
>>>>>> right.
>>>>>>
>>>>>> 'Give the right answer' is NOT a valid algorithm for a Turing
>>>>>> Machine.
>>>>>>
>>>>>
>>>>> When I refer to H1/H I am referring to my C/x86 code.
>>>>> When I refer to H/Ĥ I am referring to the Peter Linz templates.
>>>>> You can't seem to keep this straight.
>>>>>
>>>>>
>>>>
>>>>
>>>> Which means you have something MAJORLY wrong with your argument.
>>>>
>>>> H1 and H in you C/x86 code are two copies of your decider
>>>>
>>>> Linz H is the Correct Halting decider that is what you claim is
>>>> equivalent of you H
>>>>
>>>
>>> Not any more. Ever since I created H1 that does not have pathological
>>> self-reference (two weeks ago?) retaining H that does have
>>> pathological self-reference, my H(P,P) is equivalent to the Linz Ĥ.qx
>>> ⟨Ĥ⟩.
>>>
>>> My H1(P,P) is equivalent to the Linz H ⟨Ĥ⟩ ⟨Ĥ⟩.
>>> Previosly I had no idea how two different halt deciders would
>>> coordinate between themselves so I did not discuss the Linz H ⟨Ĥ⟩ ⟨Ĥ⟩.
>> There's something horrendously confused about this.
>>
>> To the extent that I can actually follow your claims given that you
>> keep changing the names of things, here is my current understanding of
>> what you have:
>>
>> You have created a 'Halt Decider' H.
>>
>> Alongside that, you also have a 'confounding case' P which you claim
>> is derived from your H in the same way that Linz derives H_Hat from H
>> (It isn't actually, but let's not worry about that for now).
>>
>> You also have a second Halt Decider H1 which is the same as H except
>> that it 'does not have pathological self-reference'. You've never
>> shown *any* code for this H1, but my assumption is that it is simply a
>> copy of H, but since H1 resides at a distinct machine address from H,
>> if H is called from within H1 it won't be seen as a recursive call.
>>
>> The problem here is that Linz's proof asserts that for any putative
>> halt decider H, we can construct a new Turing Machine H_Hat which H
>> will be unable to decide.
>>
>> Your H cannot correctly decide H(P, P). You seem to acknowledge this.
>>
>> Your H1 according to you *can* correctly decide H1(P, P).
>>
>> But your P isn't derived from your H1. It is derived from your H.
>> Alongside your H1 there will be a P1 such that H1(P1, P1) will not be
>> correctly decided, so you still aren't overcoming Linz.
>>
>> Linz doesn't claim that it is impossible for the halting status of
>> H_Hat(H_Hat) to be decided. He claims only that it cannot correctly be
>> decided by H.
>>
>> Basically (subject to seeing your actual code), you have a machine H
>> which cannot correctly decide whether P(P) halts but which can
>> correctly decide whether P1(P1) halts. You also have a machine H1
>> which can correctly decide whether P(P) halts but which cannot
>> correctly decide whether P1(P1) halts. So neither of these can
>> possibly count as a universal halt decider since each has a case it
>> cannot decide. Neither your H nor your H1 can decide the corresponding
>> case described by the Linz Proof.
>>
>> André
>>
> 
> By using the H1/H pair we have a universal halt decider.
> Whenever they don't provide the same result then one of them is wrong.
> 
> int main()
> {
>   if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
>     OutputString("Pathological self-reference error!");
> }
> 
> 

Which one? Once you write you algorithm to choose the right answer, and
call it say HH, then write HH^ to test it (call HH and do the opposite
of what it says).


Classic failure of the try multiple methods to get arround the
bothersome case.

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


#39475

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-09-18 22:54 +0100
Message-ID<87a6k9blco.fsf@bsb.me.uk>
In reply to#39447
olcott <NoOne@NoWhere.com> writes:

> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.

Yet you keep telling us that and "exact copy" of H transitions to the
rejecting state when presented with that input of the tape.  Identical
state transition functions determine the exact same sequence of machine
configurations given identical tape contents.

-- 
Ben.

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


#39480 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

Fromolcott <NoOne@NoWhere.com>
Date2021-09-18 17:02 -0500
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<h7ydndYbPtVt_Nv8nZ2dnUU7-IWdnZ2d@giganews.com>
In reply to#39475
On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
> 
> Yet you keep telling us that and "exact copy" of H transitions to the
> rejecting state when presented with that input of the tape.  Identical
> state transition functions determine the exact same sequence of machine
> configurations given identical tape contents.
> 

Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott 2004) 
error.

H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not have the pathological 
self-reference(Olcott 2004) error.

Computations having the pathological self-reference(Olcott 2004) error 
are computationally distinct from ones that do not.

H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩
detects the pathological self-reference(Olcott 2004) error.

This is made 100% concrete with every detail explicitly shown:

int main()
{
   if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
     OutputString("Pathological self-reference error!");
}


-- 
Copyright 2021 Pete Olcott

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

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


#39484 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-18 18:24 -0400
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<fGt1J.42632$3p3.13112@fx16.iad>
In reply to#39480
On 9/18/21 6:02 PM, olcott wrote:
> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>
>> Yet you keep telling us that and "exact copy" of H transitions to the
>> rejecting state when presented with that input of the tape.  Identical
>> state transition functions determine the exact same sequence of machine
>> configurations given identical tape contents.
>>
> 
> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott 2004)
> error.

No such thing in reality. <H^> <H^> is a valid input that H is supposed
to get right if it is to be a correct Halt Decider.

> 
> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not have the pathological
> self-reference(Olcott 2004) error.

But YOUR H isn't the same H as H^ was built from, and thus doesn't apply.

> 
> Computations having the pathological self-reference(Olcott 2004) error
> are computationally distinct from ones that do not.

So, PO H1 is computationally distinct from PO H, so therefore the P
built with PO H isn't built with the same computation that correctly
decides it.

WORTHLESS. Only the computation that Linz H^ is built from correctly
deciding it matters. PO H1 is, from your claim above, NOT that
comptation, as PO P is built from PO H which you just said is distinct
from PO H1, so it is only PO H that needs to decide PO P correctly,
which it does not

FAIL,

> 
> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩
> detects the pathological self-reference(Olcott 2004) error.
> 
> This is made 100% concrete with every detail explicitly shown:
> 
> int main()
> {
>   if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
>     OutputString("Pathological self-reference error!");
> }
> 

I.E, you just built a machine to test if your decider is wrong!

Which it is.

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


#39489 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

Fromolcott <NoOne@NoWhere.com>
Date2021-09-18 17:29 -0500
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<i6WdneLuOczK9dv8nZ2dnUU7-THNnZ2d@giganews.com>
In reply to#39484
On 9/18/2021 5:24 PM, Richard Damon wrote:
> On 9/18/21 6:02 PM, olcott wrote:
>> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>>
>>> Yet you keep telling us that and "exact copy" of H transitions to the
>>> rejecting state when presented with that input of the tape.  Identical
>>> state transition functions determine the exact same sequence of machine
>>> configurations given identical tape contents.
>>>
>>
>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott 2004)
>> error.
> 
> No such thing in reality. <H^> <H^> is a valid input that H is supposed
> to get right if it is to be a correct Halt Decider.
> 
>>
>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not have the pathological
>> self-reference(Olcott 2004) error.
> 
> But YOUR H isn't the same H as H^ was built from, and thus doesn't apply.
> 
>>
>> Computations having the pathological self-reference(Olcott 2004) error
>> are computationally distinct from ones that do not.
> 
> So, PO H1 is computationally distinct from PO H, so therefore the P
> built with PO H isn't built with the same computation that correctly
> decides it.
> 
> WORTHLESS. Only the computation that Linz H^ is built from correctly
> deciding it matters. PO H1 is, from your claim above, NOT that
> comptation, as PO P is built from PO H which you just said is distinct
> from PO H1, so it is only PO H that needs to decide PO P correctly,
> which it does not
> 
> FAIL,
> 
>>
>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩
>> detects the pathological self-reference(Olcott 2004) error.
>>
>> This is made 100% concrete with every detail explicitly shown:
>>
>> int main()
>> {
>>    if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
>>      OutputString("Pathological self-reference error!");
>> }
>>
> 
> I.E, you just built a machine to test if your decider is wrong!
> 
> Which it is.
> 

This defeats Rice's theorem in that it correctly recognizes a semantic 
property of the input.

When the results of a pair of halt deciders H1/H2 are not the same then 
the input has the pathological self-reference(Olcott 2004) error.

-- 
Copyright 2021 Pete Olcott

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

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


#39492 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-18 18:35 -0400
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<IQt1J.169010$T_8.76186@fx48.iad>
In reply to#39489
On 9/18/21 6:29 PM, olcott wrote:
> On 9/18/2021 5:24 PM, Richard Damon wrote:
>> On 9/18/21 6:02 PM, olcott wrote:
>>> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>>>
>>>> Yet you keep telling us that and "exact copy" of H transitions to the
>>>> rejecting state when presented with that input of the tape.  Identical
>>>> state transition functions determine the exact same sequence of machine
>>>> configurations given identical tape contents.
>>>>
>>>
>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott 2004)
>>> error.
>>
>> No such thing in reality. <H^> <H^> is a valid input that H is supposed
>> to get right if it is to be a correct Halt Decider.
>>
>>>
>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not have the pathological
>>> self-reference(Olcott 2004) error.
>>
>> But YOUR H isn't the same H as H^ was built from, and thus doesn't apply.
>>
>>>
>>> Computations having the pathological self-reference(Olcott 2004) error
>>> are computationally distinct from ones that do not.
>>
>> So, PO H1 is computationally distinct from PO H, so therefore the P
>> built with PO H isn't built with the same computation that correctly
>> decides it.
>>
>> WORTHLESS. Only the computation that Linz H^ is built from correctly
>> deciding it matters. PO H1 is, from your claim above, NOT that
>> comptation, as PO P is built from PO H which you just said is distinct
>> from PO H1, so it is only PO H that needs to decide PO P correctly,
>> which it does not
>>
>> FAIL,
>>
>>>
>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩
>>> detects the pathological self-reference(Olcott 2004) error.
>>>
>>> This is made 100% concrete with every detail explicitly shown:
>>>
>>> int main()
>>> {
>>>    if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
>>>      OutputString("Pathological self-reference error!");
>>> }
>>>
>>
>> I.E, you just built a machine to test if your decider is wrong!
>>
>> Which it is.
>>
> 
> This defeats Rice's theorem in that it correctly recognizes a semantic
> property of the input.
> 
> When the results of a pair of halt deciders H1/H2 are not the same then
> the input has the pathological self-reference(Olcott 2004) error.
> 

What is the exact semantic property that you claim this decider detects?

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


#39583 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-09-20 00:43 +0100
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<87sfy06shz.fsf@bsb.me.uk>
In reply to#39480
olcott <NoOne@NoWhere.com> writes:

> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>> 
>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>
>> Yet you keep telling us that and "exact copy" of H transitions to the
>> rejecting state when presented with that input of the tape.  Identical
>> state transition functions determine the exact same sequence of machine
>> configurations given identical tape contents. 
>
> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott
> 2004) error.

It can have any error in it you like to invent, but tell us what happens
and that can't be true as well as what you say above.

But things have moved on because you are now just lying about
something.  As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to
H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions
to H.qn many times".

Putting aside how many times you've said each of these, which one is
true and which one is the lie?

-- 
Ben.

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


#39588 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

Fromolcott <NoOne@NoWhere.com>
Date2021-09-19 20:56 -0500
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<r42dnY5Rb4T5d9r8nZ2dnUU7-VfNnZ2d@giganews.com>
In reply to#39583
On 9/19/2021 6:43 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>>
>>> Yet you keep telling us that and "exact copy" of H transitions to the
>>> rejecting state when presented with that input of the tape.  Identical
>>> state transition functions determine the exact same sequence of machine
>>> configurations given identical tape contents.
>>
>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott
>> 2004) error.
> 
> It can have any error in it you like to invent, but tell us what happens
> and that can't be true as well as what you say above.
> 
> But things have moved on because you are now just lying about
> something.  As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to
> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions
> to H.qn many times".
> 
> Putting aside how many times you've said each of these, which one is
> true and which one is the lie?
> 

Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never halts 
unless it aborts the simulation of its input.

H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ sees that Ĥ applied to ⟨Ĥ⟩ transitions to Ĥ.qn and 
thus transitions to H.qy

void P(u32 x)
{
   if (H(x, x))
     HERE: goto HERE;
}

I could not understand this myself until I saw H1(P,P).

Previously I always said that H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ was too
complicated to untangle when two different halt deciders
must coordinate with each other.




-- 
Copyright 2021 Pete Olcott

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

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


#39593 — Re: Why do theory of computation problems require pure functions? [defeating Rice]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-09-19 22:22 -0400
SubjectRe: Why do theory of computation problems require pure functions? [defeating Rice]
Message-ID<lfS1J.112247$Kv2.31281@fx47.iad>
In reply to#39588
On 9/19/21 9:56 PM, olcott wrote:
> On 9/19/2021 6:43 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/18/2021 4:54 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy.
>>>>
>>>> Yet you keep telling us that and "exact copy" of H transitions to the
>>>> rejecting state when presented with that input of the tape.  Identical
>>>> state transition functions determine the exact same sequence of machine
>>>> configurations given identical tape contents.
>>>
>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ has the pathological self-reference(Olcott
>>> 2004) error.
>>
>> It can have any error in it you like to invent, but tell us what happens
>> and that can't be true as well as what you say above.
>>
>> But things have moved on because you are now just lying about
>> something.  As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to
>> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions
>> to H.qn many times".
>>
>> Putting aside how many times you've said each of these, which one is
>> true and which one is the lie?
>>
> 
> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never halts
> unless it aborts the simulation of its input.

Except that isn't the queston. It is a fixed fact that the code at H^.qx
WILL abort the simulation, and that if that input was put to a UTM (or
other true simulator) it will Halt.

H^.qx is thsu wrong.

> 
> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ sees that Ĥ applied to ⟨Ĥ⟩ transitions to Ĥ.qn and
> thus transitions to H.qy

But if my POOP decoder ring is working right, this 'H' isn't the same H
that P uses, but is the 'copy' of H, actually called H1, that isn't
computationally equivalent because it gives different answers.

SO, is H not a Computation, or is H1 not the same as H.

FAIL

> 
> void P(u32 x)
> {
>   if (H(x, x))
>     HERE: goto HERE;
> }
> 
> I could not understand this myself until I saw H1(P,P).
> 
> Previously I always said that H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ was too
> complicated to untangle when two different halt deciders
> must coordinate with each other.
> 

Right DIFFERENT Halt deciders.

H1 getting it right does NOT prove anything, because H got it wrong.

You CAN'T equate both the code in H and in H1 to the same Turing Machine
H, as they don't give the same answers to the same input.

Thus your problem setup violates the problem statement.

You are NOT building the ^ template machine off the Halt Decider that
will try to correctly decide it.

FAIL.

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


Page 11 of 13 — ← Prev page 1 … 9 10 [11] 12 13  Next page →

Back to top | Article view | comp.theory


csiph-web