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


Groups > comp.theory > #34384 > unrolled thread

Refuting the Sipser Halting Problem Proof (V1)

Started byolcott <NoOne@NoWhere.com>
First post2021-06-01 10:25 -0500
Last post2021-06-02 20:26 -0400
Articles 20 on this page of 162 — 8 participants

Back to article view | Back to comp.theory


Contents

  Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 10:25 -0500
    Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 19:07 -0400
      Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 18:16 -0500
        Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 21:24 -0400
          Re: Refuting the Sipser Halting Problem Proof (V1) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-01 18:30 -0700
            Re: Refuting the Sipser Halting Problem Proof (V1) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-01 18:31 -0700
          Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 21:41 -0500
            Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 23:24 -0400
              Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 23:03 -0500
                Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 06:52 -0400
                  Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-02 11:08 -0500
                    Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:18 -0400
      Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-01 21:27 -0500
        Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 22:55 -0400
          Refuting the Linz Halting Problem Proof(not bright enough) olcott <NoOne@NoWhere.com> - 2021-06-01 22:20 -0500
            Re: Refuting the Linz Halting Problem Proof(not bright enough)(typo) olcott <NoOne@NoWhere.com> - 2021-06-01 22:31 -0500
          Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-01 22:25 -0500
            Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 06:59 -0400
              Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-02 13:32 +0100
                Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 09:40 -0500
                  Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:20 -0400
                    Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 19:52 -0500
                      Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 21:14 -0400
                        Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) olcott <NoOne@NoWhere.com> - 2021-06-02 20:46 -0500
                          Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 22:47 -0400
                            Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-02 22:08 -0500
                              Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? Richard Damon <Richard@Damon-Family.org> - 2021-06-03 07:14 -0400
                                Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-03 08:31 -0500
                                  Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? Richard Damon <Richard@Damon-Family.org> - 2021-06-03 21:27 -0400
                                    Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-03 20:35 -0500
                          Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) Andy Walker <anw@cuboid.co.uk> - 2021-06-03 11:49 +0100
                            Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-03 08:22 -0500
                              Re: Halting problem undecidability and infinitely nested simulation(V13) - Andy Walker <anw@cuboid.co.uk> - 2021-06-04 15:16 +0100
                                Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-04 09:39 -0500
                                  Re: Halting problem undecidability and infinitely nested simulation(V13) - Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-04 08:59 -0700
                                    Re: Halting problem undecidability and infinitely nested simulation(V13) - Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-04 17:35 +0100
                                    Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-04 11:38 -0500
                                      Re: Halting problem undecidability and infinitely nested simulation(V13) - Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-05 03:36 -0700
                                        Re: Halting problem undecidability and infinitely nested simulation(V13) - Andy Walker <anw@cuboid.co.uk> - 2021-06-05 12:53 +0100
                                          Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-05 08:13 -0500
                                            Re: Halting problem undecidability and infinitely nested simulation(V13) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 11:14 -0400
                                              Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 10:34 -0500
                                                Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 12:13 -0400
                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 11:20 -0500
                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 15:17 -0400
                                                      Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 14:36 -0500
                                                        Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 18:32 -0400
                                                          Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 18:57 -0500
                                                            Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 20:26 -0400
                                                              Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 19:42 -0500
                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 21:45 -0400
                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 20:53 -0500
                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 15:34 -0400
                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-06 14:39 -0500
                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 15:59 -0400
                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-06 17:40 -0500
                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 19:05 -0400
                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 18:17 -0500
                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 19:52 -0400
                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 19:05 -0500
                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 20:40 -0400
                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 20:24 -0500
                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 21:51 -0400
                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 21:03 -0500
                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 22:32 -0400
                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 21:45 -0500
                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 23:15 -0400
                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 22:23 -0500
                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 07:58 -0400
                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-07 14:28 +0100
                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 09:01 -0500
                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 09:07 -0500
                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 20:56 -0400
                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 20:44 -0500
                                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 21:56 -0400
                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:18 -0500
                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 22:42 -0400
                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:48 -0500
                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:08 -0400
                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-07 22:27 -0500
                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:36 -0400
                                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-07 22:41 -0500
                                                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 07:25 -0400
                                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 08:25 -0500
                                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 21:17 -0400
                                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 21:03 -0500
                                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 22:36 -0400
                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 21:49 -0500
                                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 23:06 -0400
                                                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 22:24 -0500
                                                                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 07:05 -0400
                                                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 09:31 -0500
                                                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 21:13 -0500
                                                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 22:27 -0400
                                                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 21:31 -0500
                                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 06:24 -0400
                                                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 06:42 -0500
                                                                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-10 12:10 -0700
                                                                                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 14:58 -0500
                                                                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 15:49 -0500
                                                                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-10 20:39 -0700
                                                                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 23:40 -0500
                                                                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-11 10:36 -0700
                                                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-11 12:47 -0500
                                                                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 18:44 -0400
                                                                                                                                                            Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 17:54 -0500
                                                                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 19:07 -0400
                                                                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 19:21 -0500
                                                                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 20:58 -0400
                                                                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 20:40 -0500
                                                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 21:59 -0400
                                                                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 21:24 -0500
                                                                                                                                                                          Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 22:44 -0400
                                                                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 20:57 -0500
                                                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 22:30 -0400
                                                                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 21:45 -0500
                                                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 22:01 -0400
                                                                                                                                      Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-09 14:34 +0100
                                                                                                                                        Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 09:36 -0500
                                                                                                              Re: Halting problem undecidability and infinitely nested simulation(V17) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-08 03:26 +0100
                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:42 -0500
                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) Andy Walker <anw@cuboid.co.uk> - 2021-06-08 15:02 +0100
                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-08 09:14 -0500
                                                                                                                Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 22:45 -0400
                                                                                                                  Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:56 -0500
                                                                                                                    Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:12 -0400
                                        Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-05 08:00 -0500
                                          Re: Halting problem undecidability and infinitely nested simulation(V13) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 12:19 -0400
                                        Re: Halting problem undecidability and infinitely nested simulation(V13) - Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-05 21:42 +0100
                                          Re: Halting problem undecidability and infinitely nested simulation(V16) olcott <NoOne@NoWhere.com> - 2021-06-05 15:55 -0500
                                            Re: Halting problem undecidability and infinitely nested simulation(V16) Richard Damon <Richard@Damon-Family.org> - 2021-06-05 18:57 -0400
                    Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 20:15 -0500
                      Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 21:45 -0400
                        Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 20:48 -0500
                          Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 22:50 -0400
                          Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) André G. Isaak <agisaak@gm.invalid> - 2021-06-02 21:11 -0600
                            Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 22:16 -0500
                            Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-02 22:51 -0500
                              Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 07:19 -0400
                                Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-03 08:46 -0500
                                  Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 21:39 -0400
                                    Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-03 20:51 -0500
                                      Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 22:09 -0400
                                        Re: Refuting the Linz Halting Problem Proof (V15) olcott <NoOne@NoWhere.com> - 2021-06-03 21:29 -0500
                                          Re: Refuting the Linz Halting Problem Proof (V15) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 22:59 -0400
                                            Re: Refuting the Linz Halting Problem Proof (V15) olcott <NoOne@NoWhere.com> - 2021-06-03 22:37 -0500
                                              Re: Refuting the Linz Halting Problem Proof (V15) Richard Damon <Richard@Damon-Family.org> - 2021-06-04 07:44 -0400
                                                Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?) olcott <NoOne@NoWhere.com> - 2021-06-04 09:24 -0500
                                                  Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?)(typo) olcott <NoOne@NoWhere.com> - 2021-06-04 09:47 -0500
                                                  Re: Refuting the Linz Halting Problem Proof (V15)(top reviewer list) olcott <NoOne@NoWhere.com> - 2021-06-04 11:14 -0500
                                                  Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 14:31 -0700
                                                    Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-04 20:39 -0500
                                                      Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 22:22 -0700
                                                        Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-05 00:30 -0500
                                                          Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 22:33 -0700
                                                            Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-05 08:17 -0500
                                    Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:15 -0700
                                      Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-04 00:28 -0500
                                        Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:29 -0700
                                          Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:30 -0700
              Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 10:57 -0500
                Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:26 -0400

Page 2 of 9 — ← Prev page 1 [2] 3 4 5 6 7 8 9  Next page →


#34408 — Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-02 20:20 -0400
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)
Message-ID<efVtI.9839$EW.5167@fx04.iad>
In reply to#34403
On 6/2/21 10:40 AM, olcott wrote:
> On 6/2/2021 7:32 AM, Ben Bacarisse wrote:
>> Richard Damon <Richard@Damon-Family.org> writes:
>>
>>> You need to learn that there ARE things that are impossible.
>>
>> This raises an interesting question.  If PO were a confused student,
>> I'd want to find out how deep the confusion goes but asking if he
>> believes that there are any well-defined sets of strings that are not
>> decidable.  PO, however, never enters into such exchanges, preferring as
>> he does to keep his "lazer-like focus" on being wrong about halting.
>>
> 
> As I have already said many times all of the paradoxes and their math
> equivalent of undecidability are the incorrect application of semantics.
> 
> Note that D computes the opposite of the diagonal entries.
> The contradiction occurs at the point of the question mark
> where the entry must be the opposite of itself... (Sipser:1997:167).

Right, and that is the proof the D can't exist, and thus that H can't exist.


> 
> It looks like the diagonalization proof boils down to the impossible
> requirement that H(D, ⟨D⟩) == H(⟨D⟩) && H(D, ⟨D⟩) != H(⟨D⟩)

Right, which proves that H can't exist.

> 
> In the case where H must return the value that D returns, D has no
> value because it must be aborted before each obtaining any value:
> H(D, ⟨D⟩).
> 
> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
> PWS Publishing Company (165-167)
> 

As I said, it just proves that H can't exist, not that the problem is
somehow 'wrong'

Impossible problems occur all the time.

Maybe a good example is how to explain to an Olcott what Truth actually is.

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


#34411 — Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)

Fromolcott <NoOne@NoWhere.com>
Date2021-06-02 19:52 -0500
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)
Message-ID<lNmdne1l3rdcuiX9nZ2dnUU7-e-dnZ2d@giganews.com>
In reply to#34408
On 6/2/2021 7:20 PM, Richard Damon wrote:
> On 6/2/21 10:40 AM, olcott wrote:
>> On 6/2/2021 7:32 AM, Ben Bacarisse wrote:
>>> Richard Damon <Richard@Damon-Family.org> writes:
>>>
>>>> You need to learn that there ARE things that are impossible.
>>>
>>> This raises an interesting question.  If PO were a confused student,
>>> I'd want to find out how deep the confusion goes but asking if he
>>> believes that there are any well-defined sets of strings that are not
>>> decidable.  PO, however, never enters into such exchanges, preferring as
>>> he does to keep his "lazer-like focus" on being wrong about halting.
>>>
>>
>> As I have already said many times all of the paradoxes and their math
>> equivalent of undecidability are the incorrect application of semantics.
>>
>> Note that D computes the opposite of the diagonal entries.
>> The contradiction occurs at the point of the question mark
>> where the entry must be the opposite of itself... (Sipser:1997:167).
> 
> Right, and that is the proof the D can't exist, and thus that H can't exist.
> 
> 
>>
>> It looks like the diagonalization proof boils down to the impossible
>> requirement that H(D, ⟨D⟩) == H(⟨D⟩) && H(D, ⟨D⟩) != H(⟨D⟩)
> 
> Right, which proves that H can't exist.
> 
>>
>> In the case where H must return the value that D returns, D has no
>> value because it must be aborted before each obtaining any value:
>> H(D, ⟨D⟩).
>>
>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>> PWS Publishing Company (165-167)
>>
> 
> As I said, it just proves that H can't exist, not that the problem is
> somehow 'wrong'
> 
> Impossible problems occur all the time.
> 
> Maybe a good example is how to explain to an Olcott what Truth actually is.
> 

If all inputs can be divided into halting and not halting by one 
definition and cannot be divided into halting and not halting by another 
definition then the second definition is incorrect.

-- 
Copyright 2021 Pete Olcott

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

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


#34412 — Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-02 21:14 -0400
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts)
Message-ID<i2WtI.9599$341.459@fx42.iad>
In reply to#34411
On 6/2/21 8:52 PM, olcott wrote:

> 
> If all inputs can be divided into halting and not halting by one
> definition and cannot be divided into halting and not halting by another
> definition then the second definition is incorrect.
> 

WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
the classical definition, it is just that WE don't know which side some
machine belong in, but we do know that they definitely fall into one or
the other.

With your definition, some machine can be 'rightly' decided to fall into
either of the categories, depending on which decide you use. THAT isn't
a very useful definition if your definition of Halting depends on what
machine is doing the testing.

You also STILL have the problem that there are some machine you will
still not be able to know if they halt or not, so you haven't really
solved the problem, you only removed perhaps the simplest of cases, but
there are still MANY machines that you will not be able to decide on.

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


#34415 — Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)

Fromolcott <NoOne@NoWhere.com>
Date2021-06-02 20:46 -0500
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)
Message-ID<eqadnbjBJ_MTqSX9nZ2dnUU7-V_NnZ2d@giganews.com>
In reply to#34412
On 6/2/2021 8:14 PM, Richard Damon wrote:
> On 6/2/21 8:52 PM, olcott wrote:
> 
>>
>> If all inputs can be divided into halting and not halting by one
>> definition and cannot be divided into halting and not halting by another
>> definition then the second definition is incorrect.
>>
> 
> WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
> the classical definition, it is just that WE don't know which side some
> machine belong in, but we do know that they definitely fall into one or
> the other.
> 
> With your definition, some machine can be 'rightly' decided to fall into
> either of the categories, depending on which decide you use. THAT isn't
> a very useful definition if your definition of Halting depends on what
> machine is doing the testing.

On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
 > olcott <NoOne@NoWhere.com> writes:
 >
 >> Truism:
 >> Every simulation that would never stop unless Halts() stops
 >> it at some point specifies infinite execution.
 >
 > Any algorithm that implements this truism is, of course, a halting
 > decider.

The above truism is equivalent to this truism:
Whenever the simulation of the TM description X would not halt on input 
Y then TM X would not halt on input Y.

Ben is smart enough to see this are apparently you are not.

> You also STILL have the problem that there are some machine you will
> still not be able to know if they halt or not, so you haven't really
> solved the problem, you only removed perhaps the simplest of cases, but
> there are still MANY machines that you will not be able to decide on.

The maximum scope of my investigation since 2004 is to show that the 
standard template of the halting problem proofs <is> decidable thus 
refuting these proofs.


-- 
Copyright 2021 Pete Olcott

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

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


#34417 — Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-02 22:47 -0400
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)
Message-ID<jpXtI.202102$lyv9.152828@fx35.iad>
In reply to#34415
On 6/2/21 9:46 PM, olcott wrote:
> On 6/2/2021 8:14 PM, Richard Damon wrote:
>> On 6/2/21 8:52 PM, olcott wrote:
>>
>>>
>>> If all inputs can be divided into halting and not halting by one
>>> definition and cannot be divided into halting and not halting by another
>>> definition then the second definition is incorrect.
>>>
>>
>> WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
>> the classical definition, it is just that WE don't know which side some
>> machine belong in, but we do know that they definitely fall into one or
>> the other.
>>
>> With your definition, some machine can be 'rightly' decided to fall into
>> either of the categories, depending on which decide you use. THAT isn't
>> a very useful definition if your definition of Halting depends on what
>> machine is doing the testing.
> 
> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> Truism:
>>> Every simulation that would never stop unless Halts() stops
>>> it at some point specifies infinite execution.
>>
>> Any algorithm that implements this truism is, of course, a halting
>> decider.
> 
> The above truism is equivalent to this truism:
> Whenever the simulation of the TM description X would not halt on input
> Y then TM X would not halt on input Y.

Except that you don't process it to that definition.

If the copy of H that is deciding H^ is replaced with a simulator, while
keeping the definition of H^ intact, using the orignianal H. then the
simulator WILL come to a Halt, showing that H did not NEED to stop the
simulation, but did so incorrectly. Thus we see that H was wrong.

If you change the orignial H, then you have also changed H^, so you need
to start your analysis ALL over, for every H^ is intricately tied to the
H is it built from.

So your arguement to change everywhere H to simulate does make H^
non-halting, but it also makes H not answer so H fails at being a
halting decider.

Using your interpretation of this we get the inconsistency that Two
different Halt Deciders H1 and H2 can come up with opposite CORRECT
answers for a machine like H1^ as H1 sees the self-recursion and uses
your 'out' to 'correctly' call the machine non-halting, while H2 doesn't
see H1^ using itself, so it lets it run, and inside that, it simulates
H1 deciding to abort H1^, return non-Halting to H1^ and then H1^ halts,
so H2 does correctly say Halting.

Thus H1^ is both 'correctly' Halting and Non-Halting.

That or you need to define that ALL 'correct' halting deciders need to
be able to recognize all other 'correct' halt deciders to detect that
the program being run is using one of them, and THAT is an impossible
task. Your H will fail to detect a H2^ that is built on a different
version of your halt decider. You might try to argue that there can't be
an alternate version, but that would just show that you computation
environment isn't Turing Complete.

> 
> Ben is smart enough to see this are apparently you are not.
> 
>> You also STILL have the problem that there are some machine you will
>> still not be able to know if they halt or not, so you haven't really
>> solved the problem, you only removed perhaps the simplest of cases, but
>> there are still MANY machines that you will not be able to decide on.
> 
> The maximum scope of my investigation since 2004 is to show that the
> standard template of the halting problem proofs <is> decidable thus
> refuting these proofs.
> 

Except that you have failed at that, since we still have the your H says
that H^ doesn't halt, but when we run H^ it clearly halts, so H fails to
be the correct Halting Decider of Compuaton THeory, so you haven't
refuted the proof.

All you have done is created a new definition of Olcott-halting that is
inconsistant but is not vulnerable to the counter proof of Linz, it just
shows itself to be an inconsistent logic system, and thus show that it
now fails all three of the golden triangle of properties.

Olcott-Halting is still not able to be decidable, as it still will fail
to counter the OTHER proofs of non-halting decidability, like those
based on non-computable numbers.

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


#34419 — Would H_Hat ever stop if simulating halt decider H never stopped simulating it?

Fromolcott <NoOne@NoWhere.com>
Date2021-06-02 22:08 -0500
SubjectWould H_Hat ever stop if simulating halt decider H never stopped simulating it?
Message-ID<MuSdnbH13OpR2iX9nZ2dnUU7-TXNnZ2d@giganews.com>
In reply to#34417
On 6/2/2021 9:47 PM, Richard Damon wrote:
> On 6/2/21 9:46 PM, olcott wrote:
>> On 6/2/2021 8:14 PM, Richard Damon wrote:
>>> On 6/2/21 8:52 PM, olcott wrote:
>>>
>>>>
>>>> If all inputs can be divided into halting and not halting by one
>>>> definition and cannot be divided into halting and not halting by another
>>>> definition then the second definition is incorrect.
>>>>
>>>
>>> WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
>>> the classical definition, it is just that WE don't know which side some
>>> machine belong in, but we do know that they definitely fall into one or
>>> the other.
>>>
>>> With your definition, some machine can be 'rightly' decided to fall into
>>> either of the categories, depending on which decide you use. THAT isn't
>>> a very useful definition if your definition of Halting depends on what
>>> machine is doing the testing.
>>
>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> Truism:
>>>> Every simulation that would never stop unless Halts() stops
>>>> it at some point specifies infinite execution.
>>>
>>> Any algorithm that implements this truism is, of course, a halting
>>> decider.
>>
>> The above truism is equivalent to this truism:
>> Whenever the simulation of the TM description X would not halt on input
>> Y then TM X would not halt on input Y.
> 
> Except that you don't process it to that definition.
> 
See if you can manage to directly answer this question without getting 
distracted:

Would H_Hat ever stop if simulating halt decider H never stopped 
simulating it?

#define u32 uint32_t

// Simplified Peter Linz Ĥ
void H_Hat(u32 P)
{
   u32 Input_Halts = H(P, P);
   if (Input_Halts)
     HERE: goto HERE;
}

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

Everyone else gave up because I would not tolerate their dishonest 
dodges of trying to change the subject away from the exact yes or no 
question.



-- 
Copyright 2021 Pete Olcott

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

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


#34425 — Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-03 07:14 -0400
SubjectRe: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?
Message-ID<8Q2uI.68981$N%1.35855@fx28.iad>
In reply to#34419
On 6/2/21 11:08 PM, olcott wrote:
> On 6/2/2021 9:47 PM, Richard Damon wrote:
>> On 6/2/21 9:46 PM, olcott wrote:
>>> On 6/2/2021 8:14 PM, Richard Damon wrote:
>>>> On 6/2/21 8:52 PM, olcott wrote:
>>>>
>>>>>
>>>>> If all inputs can be divided into halting and not halting by one
>>>>> definition and cannot be divided into halting and not halting by
>>>>> another
>>>>> definition then the second definition is incorrect.
>>>>>
>>>>
>>>> WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
>>>> the classical definition, it is just that WE don't know which side some
>>>> machine belong in, but we do know that they definitely fall into one or
>>>> the other.
>>>>
>>>> With your definition, some machine can be 'rightly' decided to fall
>>>> into
>>>> either of the categories, depending on which decide you use. THAT isn't
>>>> a very useful definition if your definition of Halting depends on what
>>>> machine is doing the testing.
>>>
>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> Truism:
>>>>> Every simulation that would never stop unless Halts() stops
>>>>> it at some point specifies infinite execution.
>>>>
>>>> Any algorithm that implements this truism is, of course, a halting
>>>> decider.
>>>
>>> The above truism is equivalent to this truism:
>>> Whenever the simulation of the TM description X would not halt on input
>>> Y then TM X would not halt on input Y.
>>
>> Except that you don't process it to that definition.
>>
> See if you can manage to directly answer this question without getting
> distracted:
> 
> Would H_Hat ever stop if simulating halt decider H never stopped
> simulating it?
> 

YES.

Can be shown by replacing the call to H in main with a call to simulate.

This simulation will then simulate a call to H, which will do its stuff
and decide to stop simulating its copy of H, and return the non-halting
answer and then H_Hat will halt, and the simulation ends.

PERIOD.

DEFINITIION OF HALTING.

The fact that inside H_Hat was another simulation that got aborted is
irrelevant to the decision of the top most decider H if it is correct
for it to abort the simulation or not. It is wrong to do so (In the
sense of getting the right answer for the halting problem), even though
it has been programed to do so, and thus it needs to.

You confuse what it the correct thing to do for getting the right answer
and what is required by its programming.

Stopping the simulation is the wrong answer precisely because that is
what H has been programmed to do.

Yes, in the DESIGN phase of creating H, you run into the paradox like
"This statement is false", and the creation of an algorithm for an H
means choosing which wrong answer you will give.

Once you have made that choice, you are stuck with it, as it gets locked
into H_Hat, and then you are stuck making the wrong answer in the outer H.

This shows that it is impossible to create the H, not that the problem
is incorrectly stated.

The Requirements ARE the Requirement, then come out of Semantic
necessity. Halting is what Halting is.

It just turns out that this becomes an unsolvable problem, which is
fine, not all problems are solvable.

> #define u32 uint32_t
> 
> // Simplified Peter Linz Ĥ
> void H_Hat(u32 P)
> {
>   u32 Input_Halts = H(P, P);
>   if (Input_Halts)
>     HERE: goto HERE;
> }
> 
> int main()
> {
>   H((u32)H_Hat, (u32)H_Hat);
> }
> 
> Everyone else gave up because I would not tolerate their dishonest
> dodges of trying to change the subject away from the exact yes or no
> question.
> 
> 
> 

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


#34429 — Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?

Fromolcott <NoOne@NoWhere.com>
Date2021-06-03 08:31 -0500
SubjectRe: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?
Message-ID<0cadnYPHQs5QRCX9nZ2dnUU7-QnNnZ2d@giganews.com>
In reply to#34425
On 6/3/2021 6:14 AM, Richard Damon wrote:
> On 6/2/21 11:08 PM, olcott wrote:
>> On 6/2/2021 9:47 PM, Richard Damon wrote:
>>> On 6/2/21 9:46 PM, olcott wrote:
>>>> On 6/2/2021 8:14 PM, Richard Damon wrote:
>>>>> On 6/2/21 8:52 PM, olcott wrote:
>>>>>
>>>>>>
>>>>>> If all inputs can be divided into halting and not halting by one
>>>>>> definition and cannot be divided into halting and not halting by
>>>>>> another
>>>>>> definition then the second definition is incorrect.
>>>>>>
>>>>>
>>>>> WRONG. First, ALL machine CAN be divided into Halting or Not-Halting by
>>>>> the classical definition, it is just that WE don't know which side some
>>>>> machine belong in, but we do know that they definitely fall into one or
>>>>> the other.
>>>>>
>>>>> With your definition, some machine can be 'rightly' decided to fall
>>>>> into
>>>>> either of the categories, depending on which decide you use. THAT isn't
>>>>> a very useful definition if your definition of Halting depends on what
>>>>> machine is doing the testing.
>>>>
>>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> Truism:
>>>>>> Every simulation that would never stop unless Halts() stops
>>>>>> it at some point specifies infinite execution.
>>>>>
>>>>> Any algorithm that implements this truism is, of course, a halting
>>>>> decider.
>>>>
>>>> The above truism is equivalent to this truism:
>>>> Whenever the simulation of the TM description X would not halt on input
>>>> Y then TM X would not halt on input Y.
>>>
>>> Except that you don't process it to that definition.
>>>
>> See if you can manage to directly answer this question without getting
>> distracted:
>>
>> Would H_Hat ever stop if simulating halt decider H never stopped
>> simulating it?
>>
> 
> YES.
> 
> Can be shown by replacing the call to H in main with a call to simulate.

That is freaking not what I said.

Would H_Hat ever stop if simulating halt decider H never stopped 
simulating it?

Meaning replacing all instances of H with Simulate otherwise there is an 
H that does stop simulating its input.

#define ptr uintptr_t

int Simulate(u32 P, u32 I)
{
   ((void(*)(u32))P)(I);
   return 1;
}

// Simplified Linz Ĥ
void H_Hat(ptr P)
{
   u32 Input_Halts = H(P, P);
   if (Input_Halts)
     HERE: goto HERE;
}

int main()
{
   H(H_Hat, H_Hat);
}

Stopping at the first big mistake.



-- 
Copyright 2021 Pete Olcott

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

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


#34435 — Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-03 21:27 -0400
SubjectRe: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?
Message-ID<bkfuI.10480$341.8353@fx42.iad>
In reply to#34429
On 6/3/21 9:31 AM, olcott wrote:
> On 6/3/2021 6:14 AM, Richard Damon wrote:
>> On 6/2/21 11:08 PM, olcott wrote:
>>> On 6/2/2021 9:47 PM, Richard Damon wrote:
>>>> On 6/2/21 9:46 PM, olcott wrote:
>>>>> On 6/2/2021 8:14 PM, Richard Damon wrote:
>>>>>> On 6/2/21 8:52 PM, olcott wrote:
>>>>>>
>>>>>>>
>>>>>>> If all inputs can be divided into halting and not halting by one
>>>>>>> definition and cannot be divided into halting and not halting by
>>>>>>> another
>>>>>>> definition then the second definition is incorrect.
>>>>>>>
>>>>>>
>>>>>> WRONG. First, ALL machine CAN be divided into Halting or
>>>>>> Not-Halting by
>>>>>> the classical definition, it is just that WE don't know which side
>>>>>> some
>>>>>> machine belong in, but we do know that they definitely fall into
>>>>>> one or
>>>>>> the other.
>>>>>>
>>>>>> With your definition, some machine can be 'rightly' decided to fall
>>>>>> into
>>>>>> either of the categories, depending on which decide you use. THAT
>>>>>> isn't
>>>>>> a very useful definition if your definition of Halting depends on
>>>>>> what
>>>>>> machine is doing the testing.
>>>>>
>>>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> Truism:
>>>>>>> Every simulation that would never stop unless Halts() stops
>>>>>>> it at some point specifies infinite execution.
>>>>>>
>>>>>> Any algorithm that implements this truism is, of course, a halting
>>>>>> decider.
>>>>>
>>>>> The above truism is equivalent to this truism:
>>>>> Whenever the simulation of the TM description X would not halt on
>>>>> input
>>>>> Y then TM X would not halt on input Y.
>>>>
>>>> Except that you don't process it to that definition.
>>>>
>>> See if you can manage to directly answer this question without getting
>>> distracted:
>>>
>>> Would H_Hat ever stop if simulating halt decider H never stopped
>>> simulating it?
>>>
>>
>> YES.
>>
>> Can be shown by replacing the call to H in main with a call to simulate.
> 
> That is freaking not what I said.

I didn't say you did. I did say how to prove your statement is wrong.

> 
> Would H_Hat ever stop if simulating halt decider H never stopped
> simulating it?
> 

Yes. IF by this you mean the Simulating Halt Decider that is trying to
make the decision, and


> Meaning replacing all instances of H with Simulate otherwise there is an
> H that does stop simulating its input.
> 

AND THAT is an INVALID transformation. H^ is no longer the H^ in question.

And with THAT definition, H doesn't give an answer, so it fails.

Remember the RULES of the game.

FIRST, you declare the machine that will be H.

THEN you create H^, which will contain it own private copy of that H,
and once you do this you don't get to touch what is in H^ without
needing to start ALL over

Then you get to run that H(H^, H^>) and H^(<H^>) and see if H gets the
right answer (the definition of Halting).

If you want to use your 'alternate' definition then you can compare
H(<H^,H^) to UTM(<H^,H^>) (as that would be your halt decider not
deciding to halt the computation).


> #define ptr uintptr_t
> 
> int Simulate(u32 P, u32 I)
> {
>   ((void(*)(u32))P)(I);
>   return 1;
> }
> 
> // Simplified Linz Ĥ
> void H_Hat(ptr P)
> {
>   u32 Input_Halts = H(P, P);
>   if (Input_Halts)
>     HERE: goto HERE;
> }
> 
> int main()
> {
>   H(H_Hat, H_Hat);

> 
> Stopping at the first big mistake.
>

Then you should have stopped YEARS ago.

Note, you resist looking at the actual running of the machine H^ for
some strange reason, probably because it shows how bad your logic is.

If someone provided logic that 'proved' that a Black Cat was actually
White, wouldn't you point out that Black isn't White.

By this same logic, A Halting Machine can't be Non-Halting. Doesn't
matter why you think it should be, it just doesn't fit the real
definition, only your inconsistent Olcott-Halting rules, which really
just don't work.


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


#34437 — Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?

Fromolcott <NoOne@NoWhere.com>
Date2021-06-03 20:35 -0500
SubjectRe: Would H_Hat ever stop if simulating halt decider H never stopped simulating it?
Message-ID<Sf6dndUGqLoZHiT9nZ2dnUU7-LvNnZ2d@giganews.com>
In reply to#34435
On 6/3/2021 8:27 PM, Richard Damon wrote:
> On 6/3/21 9:31 AM, olcott wrote:
>> On 6/3/2021 6:14 AM, Richard Damon wrote:
>>> On 6/2/21 11:08 PM, olcott wrote:
>>>> On 6/2/2021 9:47 PM, Richard Damon wrote:
>>>>> On 6/2/21 9:46 PM, olcott wrote:
>>>>>> On 6/2/2021 8:14 PM, Richard Damon wrote:
>>>>>>> On 6/2/21 8:52 PM, olcott wrote:
>>>>>>>
>>>>>>>>
>>>>>>>> If all inputs can be divided into halting and not halting by one
>>>>>>>> definition and cannot be divided into halting and not halting by
>>>>>>>> another
>>>>>>>> definition then the second definition is incorrect.
>>>>>>>>
>>>>>>>
>>>>>>> WRONG. First, ALL machine CAN be divided into Halting or
>>>>>>> Not-Halting by
>>>>>>> the classical definition, it is just that WE don't know which side
>>>>>>> some
>>>>>>> machine belong in, but we do know that they definitely fall into
>>>>>>> one or
>>>>>>> the other.
>>>>>>>
>>>>>>> With your definition, some machine can be 'rightly' decided to fall
>>>>>>> into
>>>>>>> either of the categories, depending on which decide you use. THAT
>>>>>>> isn't
>>>>>>> a very useful definition if your definition of Halting depends on
>>>>>>> what
>>>>>>> machine is doing the testing.
>>>>>>
>>>>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> Truism:
>>>>>>>> Every simulation that would never stop unless Halts() stops
>>>>>>>> it at some point specifies infinite execution.
>>>>>>>
>>>>>>> Any algorithm that implements this truism is, of course, a halting
>>>>>>> decider.
>>>>>>
>>>>>> The above truism is equivalent to this truism:
>>>>>> Whenever the simulation of the TM description X would not halt on
>>>>>> input
>>>>>> Y then TM X would not halt on input Y.
>>>>>
>>>>> Except that you don't process it to that definition.
>>>>>
>>>> See if you can manage to directly answer this question without getting
>>>> distracted:
>>>>
>>>> Would H_Hat ever stop if simulating halt decider H never stopped
>>>> simulating it?
>>>>
>>>
>>> YES.
>>>
>>> Can be shown by replacing the call to H in main with a call to simulate.
>>
>> That is freaking not what I said.
> 
> I didn't say you did. I did say how to prove your statement is wrong.
> 
>>
>> Would H_Hat ever stop if simulating halt decider H never stopped
>> simulating it?
>>
> 
> Yes. IF by this you mean the Simulating Halt Decider that is trying to
> make the decision, and
> 
> 
>> Meaning replacing all instances of H with Simulate otherwise there is an
>> H that does stop simulating its input.
>>
> 
> AND THAT is an INVALID transformation. H^ is no longer the H^ in question.
> 
> And with THAT definition, H doesn't give an answer, so it fails.
> 
> Remember the RULES of the game.
> 
> FIRST, you declare the machine that will be H.
> 
> THEN you create H^, which will contain it own private copy of that H,
> and once you do this you don't get to touch what is in H^ without
> needing to start ALL over
> 
> Then you get to run that H(H^, H^>) and H^(<H^>) and see if H gets the
> right answer (the definition of Halting).
> 
> If you want to use your 'alternate' definition then you can compare
> H(<H^,H^) to UTM(<H^,H^>) (as that would be your halt decider not
> deciding to halt the computation).
> 
> 
>> #define ptr uintptr_t
>>
>> int Simulate(u32 P, u32 I)
>> {
>>    ((void(*)(u32))P)(I);
>>    return 1;
>> }
>>
>> // Simplified Linz Ĥ
>> void H_Hat(ptr P)
>> {
>>    u32 Input_Halts = H(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>> }
>>
>> int main()
>> {
>>    H(H_Hat, H_Hat);
> 
>>
>> Stopping at the first big mistake.
>>
> 
> Then you should have stopped YEARS ago.
> 
> Note, you resist looking at the actual running of the machine H^ for
> some strange reason, probably because it shows how bad your logic is.
> 
> If someone provided logic that 'proved' that a Black Cat was actually
> White, wouldn't you point out that Black isn't White.
> 
> By this same logic, A Halting Machine can't be Non-Halting. Doesn't
> matter why you think it should be, it just doesn't fit the real
> definition, only your inconsistent Olcott-Halting rules, which really
> just don't work.

If you go through my paper step by step you won't find any actual error.
I keep improving the wording.

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation


-- 
Copyright 2021 Pete Olcott

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

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


#34424 — Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)

FromAndy Walker <anw@cuboid.co.uk>
Date2021-06-03 11:49 +0100
SubjectRe: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?)
Message-ID<s9ac2v$147j$1@gioia.aioe.org>
In reply to#34415
On 03/06/2021 02:46, olcott wrote:
> The maximum scope of my investigation since 2004 is to show that the
> standard template of the halting problem proofs <is> decidable

	That much has never been in doubt;  you don't need to expend
energy and thousands of articles showing what we already know.

> thus refuting these proofs.

	But that doesn't follow.

-- 
Andy Walker, Nottingham.
    Andy's music pages: www.cuboid.me.uk/andy/Music
    Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Kontski

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


#34427 — Halting problem undecidability and infinitely nested simulation(V13) -

Fromolcott <NoOne@NoWhere.com>
Date2021-06-03 08:22 -0500
SubjectHalting problem undecidability and infinitely nested simulation(V13) -
Message-ID<bpmdnRRahMQ3SiX9nZ2dnUU7-fXNnZ2d@giganews.com>
In reply to#34424
On 6/3/2021 5:49 AM, Andy Walker wrote:
> On 03/06/2021 02:46, olcott wrote:
>> The maximum scope of my investigation since 2004 is to show that the
>> standard template of the halting problem proofs <is> decidable
> 
>      That much has never been in doubt;  you don't need to expend
> energy and thousands of articles showing what we already know.
> 
>> thus refuting these proofs.
> 
>      But that doesn't follow.
> 

The you could do more to point out a mistake than simply say that you 
don't believe what I am saying.

Halting problem undecidability and infinitely nested simulation


https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 



-- 
Copyright 2021 Pete Olcott

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

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


#34451 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

FromAndy Walker <anw@cuboid.co.uk>
Date2021-06-04 15:16 +0100
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<s9dcj4$1nnr$1@gioia.aioe.org>
In reply to#34427
On 03/06/2021 14:22, olcott wrote:
>>> The maximum scope of my investigation since 2004 is to show that the
>>> standard template of the halting problem proofs <is> decidable
>>      That much has never been in doubt;  you don't need to expend
>> energy and thousands of articles showing what we already know.
>>> thus refuting these proofs.
>>      But that doesn't follow.
> The you could do more to point out a mistake than simply say that you
> don't believe what I am saying.
	I could, but you're paying neither me nor much attention to
what I've commented on in previous articles, so there's little point.
If you want to make progress, you need to indicate where the standard
proofs, whether in Linz, Sipser, Minsky, ... or even my own page [as
previously referenced] rely on "the standard template" [whatever that
means] being undecidable.  If there is no such place, then proving
what we already knew [and pointed out to you] is irrelevant to your
claim that you have refuted those proofs.

-- 
Andy Walker, Nottingham.
    Andy's music pages: www.cuboid.me.uk/andy/Music
    Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Bach

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


#34453 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

Fromolcott <NoOne@NoWhere.com>
Date2021-06-04 09:39 -0500
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<CM-dnepY6bPcpif9nZ2dnUU7-UnNnZ2d@giganews.com>
In reply to#34451
On 6/4/2021 9:16 AM, Andy Walker wrote:
> On 03/06/2021 14:22, olcott wrote:
>>>> The maximum scope of my investigation since 2004 is to show that the
>>>> standard template of the halting problem proofs <is> decidable
>>>      That much has never been in doubt;  you don't need to expend
>>> energy and thousands of articles showing what we already know.
>>>> thus refuting these proofs.
>>>      But that doesn't follow.
>> The you could do more to point out a mistake than simply say that you
>> don't believe what I am saying.
>      I could, but you're paying neither me nor much attention to
> what I've commented on in previous articles, so there's little point.

No one has actually pointed out any mistake. They pointed out what they 
misunderstood to be a mistake and then refused to pay attention to my 
correction of their error.

The great thing about this review process is that it forced me to make 
my words clearer and clearer. They are clear enough now that any 
programmer can know that my proof is correct.

> If you want to make progress, you need to indicate where the standard
> proofs, whether in Linz, Sipser, Minsky, ... or even my own page [as
> previously referenced] rely on "the standard template" [whatever that
> means] being undecidable.  If there is no such place, then proving
> what we already knew [and pointed out to you] is irrelevant to your
> claim that you have refuted those proofs.
> 

I have done that so many times and was ignored that I deleted that page 
of my proof. You either know damn well what the standard template is or 
are utterly unqualified to evaluate my work.

-- 
Copyright 2021 Pete Olcott

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

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


#34457 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-06-04 08:59 -0700
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<f8bd91f3-4803-4254-acbb-0e2f354be90en@googlegroups.com>
In reply to#34453
On Friday, 4 June 2021 at 15:40:08 UTC+1, olcott wrote:
> On 6/4/2021 9:16 AM, Andy Walker wrote: 
> > On 03/06/2021 14:22, olcott wrote: 
> >>>> The maximum scope of my investigation since 2004 is to show that the 
> >>>> standard template of the halting problem proofs <is> decidable 
> >>> That much has never been in doubt; you don't need to expend 
> >>> energy and thousands of articles showing what we already know. 
> >>>> thus refuting these proofs. 
> >>> But that doesn't follow. 
> >> The you could do more to point out a mistake than simply say that you 
> >> don't believe what I am saying. 
> > I could, but you're paying neither me nor much attention to 
> > what I've commented on in previous articles, so there's little point.
> No one has actually pointed out any mistake. They pointed out what they 
> misunderstood to be a mistake and then refused to pay attention to my 
> correction of their error. 
> 
There's a poor use of terminology.
Basically in "decision problems" we talk about three sets. There's the set of
entities the problem applies to, then two mutually exclusive subsets, one
representing "Yes" and one representing "No" for the decision problem.

So we might classify strings as "numerical" or not. If we define "numerical"
as "representing a decimal number in conventional base ten fixed-place
representation" then it is quite easy to write the classifier for this problem.

Or we might want to classify strings as "English language sentences". That's
a much harder problem. Whilst we can do a decent job on most input we're likely
to get from a real user, there will be cases our classifier fails on, either because
they are marginal, or because they are crafted to defeat the classifier. Another
classifier might not fail on exactly the same cases. 

Note, that if somone presents a marginal case, such as "And is a word which
cannot start a sentence", and our classifier fails, it's easy to patch it to give
the agreed correct output. 

That doesn't mean that the "sentence decision problem" is tractable. It's
obviously not. Only a human speaker can decide if a sentence is a valid
English language sentence or not. The question is whether the set of
strings can be separated, by a computer, into the set of English language 
sentences or the set of non-sentences. Not whether, for any one input, we
can special case it.

Now you've been using the term "decideable" to apply to single programs,
and, because there is some method which will determine whether they halt 
or not, you declare them to be "decideable" and therefore the proofs in error.
But the proofs refer to the set of all programs, the set of programs which 
halt, and the set of programs which don't halt. Three infinite sets, of
which two are mutually exclusive sub-sets. The proofs are showing that
there is no finite program which separates out the infinite input set.

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


#34459 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-06-04 17:35 +0100
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<878s3py4da.fsf@bsb.me.uk>
In reply to#34457
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:

> On Friday, 4 June 2021 at 15:40:08 UTC+1, olcott wrote:
>> On 6/4/2021 9:16 AM, Andy Walker wrote: 
>> > On 03/06/2021 14:22, olcott wrote: 
>> >>>> The maximum scope of my investigation since 2004 is to show that the 
>> >>>> standard template of the halting problem proofs <is> decidable 
>> >>> That much has never been in doubt; you don't need to expend 
>> >>> energy and thousands of articles showing what we already know. 
>> >>>> thus refuting these proofs. 
>> >>> But that doesn't follow. 
>> >> The you could do more to point out a mistake than simply say that you 
>> >> don't believe what I am saying. 
>> > I could, but you're paying neither me nor much attention to 
>> > what I've commented on in previous articles, so there's little point.
>> No one has actually pointed out any mistake. They pointed out what they 
>> misunderstood to be a mistake and then refused to pay attention to my 
>> correction of their error. 
>> 
> There's a poor use of terminology.
> Basically in "decision problems" we talk about three sets. There's the set of
> entities the problem applies to, then two mutually exclusive subsets, one
> representing "Yes" and one representing "No" for the decision problem.

That's a reasonable way of putting it, but I'd add that the exclusive
subsets are, in fact a partition of the set of problem instances.

> That doesn't mean that the "sentence decision problem" is tractable. It's
> obviously not. Only a human speaker can decide if a sentence is a valid
> English language sentence or not.

But this is a bad example because a decision problem requires a
well-defined set "to be decided" and the problem you raise is about the
definition of the set itself, not whether the set is recursive or not.

-- 
Ben.

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


#34460 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

Fromolcott <NoOne@NoWhere.com>
Date2021-06-04 11:38 -0500
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<MZudnQMIQvBuyyf9nZ2dnUU7-anNnZ2d@giganews.com>
In reply to#34457
On 6/4/2021 10:59 AM, Malcolm McLean wrote:
> On Friday, 4 June 2021 at 15:40:08 UTC+1, olcott wrote:
>> On 6/4/2021 9:16 AM, Andy Walker wrote:
>>> On 03/06/2021 14:22, olcott wrote:
>>>>>> The maximum scope of my investigation since 2004 is to show that the
>>>>>> standard template of the halting problem proofs <is> decidable
>>>>> That much has never been in doubt; you don't need to expend
>>>>> energy and thousands of articles showing what we already know.
>>>>>> thus refuting these proofs.
>>>>> But that doesn't follow.
>>>> The you could do more to point out a mistake than simply say that you
>>>> don't believe what I am saying.
>>> I could, but you're paying neither me nor much attention to
>>> what I've commented on in previous articles, so there's little point.
>> No one has actually pointed out any mistake. They pointed out what they
>> misunderstood to be a mistake and then refused to pay attention to my
>> correction of their error.
>>
> There's a poor use of terminology.

Yes I will agree with that, none-the-less issues such as this have no 
bearing on the correctness of the essence of my refutation of the 
proofs. This is at most a credibility issue and not a validity issue in 
the slightest sense.

> Basically in "decision problems" we talk about three sets. There's the set of
> entities the problem applies to, then two mutually exclusive subsets, one
> representing "Yes" and one representing "No" for the decision problem.
> 

∃H ∈ Turing_Machines // simulating halt decider
∀P ∈ Turing_Machine_Descriptions
∀I ∈ Finite_Strings
(UTM(P,I) = ∞) ≡ (Simulate(P,I) = ∞) ≡ Must_Be_Stopped(P,I) ≡ ¬Halting(P,I))

https://en.wikipedia.org/wiki/List_of_logic_symbols

The above can be understood to be correct on the simple basis that every 
UTM simulation H of the TM description of TM P that does not halt on its 
input proves that H(P,I) does not halt.

This self-evident truth provides leverage in the halting problem 
counter-examples. See the first page of my paper for details.

> So we might classify strings as "numerical" or not. If we define "numerical"
> as "representing a decimal number in conventional base ten fixed-place
> representation" then it is quite easy to write the classifier for this problem.
> 
> Or we might want to classify strings as "English language sentences". That's
> a much harder problem. Whilst we can do a decent job on most input we're likely
> to get from a real user, there will be cases our classifier fails on, either because
> they are marginal, or because they are crafted to defeat the classifier. Another
> classifier might not fail on exactly the same cases.
> 
> Note, that if somone presents a marginal case, such as "And is a word which
> cannot start a sentence", and our classifier fails, it's easy to patch it to give
> the agreed correct output.
> 
> That doesn't mean that the "sentence decision problem" is tractable. It's
> obviously not. Only a human speaker can decide if a sentence is a valid
> English language sentence or not. The question is whether the set of
> strings can be separated, by a computer, into the set of English language
> sentences or the set of non-sentences. Not whether, for any one input, we
> can special case it.
> 
> Now you've been using the term "decideable" to apply to single programs,
> and, because there is some method which will determine whether they halt
> or not, you declare them to be "decideable" and therefore the proofs in error.
> But the proofs refer to the set of all programs, the set of programs which
> halt, and the set of programs which don't halt. Three infinite sets, of
> which two are mutually exclusive sub-sets. The proofs are showing that
> there is no finite program which separates out the infinite input set.
> 

If you examine the math that I posted above this may be clear.
This time I posted the link of what these logic symbols mean.

The first page of the following proof explains this same thing in English.

Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation


-- 
Copyright 2021 Pete Olcott

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

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


#34470 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-06-05 03:36 -0700
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<adee47dd-c2b1-4017-84b2-b4057a39bf8cn@googlegroups.com>
In reply to#34460
On Friday, 4 June 2021 at 17:38:18 UTC+1, olcott wrote:
> On 6/4/2021 10:59 AM, Malcolm McLean wrote: 
> > On Friday, 4 June 2021 at 15:40:08 UTC+1, olcott wrote: 
> >> On 6/4/2021 9:16 AM, Andy Walker wrote: 
> >>> On 03/06/2021 14:22, olcott wrote: 
> >>>>>> The maximum scope of my investigation since 2004 is to show that the 
> >>>>>> standard template of the halting problem proofs <is> decidable 
> >>>>> That much has never been in doubt; you don't need to expend 
> >>>>> energy and thousands of articles showing what we already know. 
> >>>>>> thus refuting these proofs. 
> >>>>> But that doesn't follow. 
> >>>> The you could do more to point out a mistake than simply say that you 
> >>>> don't believe what I am saying. 
> >>> I could, but you're paying neither me nor much attention to 
> >>> what I've commented on in previous articles, so there's little point. 
> >> No one has actually pointed out any mistake. They pointed out what they 
> >> misunderstood to be a mistake and then refused to pay attention to my 
> >> correction of their error. 
> >> 
> > There's a poor use of terminology.
> Yes I will agree with that, none-the-less issues such as this have no 
> bearing on the correctness of the essence of my refutation of the 
> proofs. This is at most a credibility issue and not a validity issue in 
> the slightest sense.
>
You say "The maximum scope of my investigation since 2004 is to show
that the standard template of the halting problem proofs <is> decideable"
Andy Walker's response was "That much has never been in doubt ...."

Now I know what you mean. What you mean is that you believe you can show
that the cases presented by the halting proofs don't in fact present insurmountable
problems for a decider. 

If you are making an uncontroversial point, people might forgive you for lax
use of terminology. If you are claiming to revolutionise the field, and it becomes
clear that you don't know the accepted terminology, people are much more likely
to simply dismiss what you are saying. Especially if it looks like the non-conventional
use of terminology is leading to an assumption which is in error - in this case,
that if we can build a decider which correctly classifies H_Hat(H_Hat) then
we've refuted Linz's proof.

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


#34471 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

FromAndy Walker <anw@cuboid.co.uk>
Date2021-06-05 12:53 +0100
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<s9foj1$ikp$1@gioia.aioe.org>
In reply to#34470
On 05/06/2021 11:36, Malcolm McLean wrote:
["You" == PO]
> You say "The maximum scope of my investigation since 2004 is to show
> that the standard template of the halting problem proofs <is> decideable"
> Andy Walker's response was "That much has never been in doubt ...."
> Now I know what you mean. What you mean is that you believe you can show
> that the cases presented by the halting proofs don't in fact present insurmountable
> problems for a decider.

	FTAOD, I knew what he meant too, and was commenting on what he meant
rather than anything more formal.

> If you are making an uncontroversial point, people might forgive you for lax
> use of terminology. If you are claiming to revolutionise the field, and it becomes
> clear that you don't know the accepted terminology, people are much more likely
> to simply dismiss what you are saying.

	That seems to be what PO believes, that people simply dismiss his
work for no other reason than his lack of knowledge.  No doubt some do;
but enough people here have tried to address what he calls the "essence"
or "gist" of what he is saying for it to be clear that we have, over the
years, been trying to help.  But it is a waste of time.

>					 Especially if it looks like the non-conventional
> use of terminology is leading to an assumption which is in error - in this case,
> that if we can build a decider which correctly classifies H_Hat(H_Hat) then
> we've refuted Linz's proof.

	Indeed.  PO's notion seems to be that "H^" is in some way difficult,
or complex, or unusual, or whatever, so he feels [assuming he is genuine and
not /merely/ trolling] that to analyse "H^" is to make progress.  But, as
most here know, that is not the "essence/gist" of the "standard proof", and
so his analysis is irrelevant, no matter how often he repeats it or claims
that it shows something-or-other about halting or re-words it or asks us to
find an error in it.

-- 
Andy Walker, Nottingham.
    Andy's music pages: www.cuboid.me.uk/andy/Music
    Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Ganz

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


#34473 — Re: Halting problem undecidability and infinitely nested simulation(V13) -

Fromolcott <NoOne@NoWhere.com>
Date2021-06-05 08:13 -0500
SubjectRe: Halting problem undecidability and infinitely nested simulation(V13) -
Message-ID<VbCdnW8fC8YW5Sb9nZ2dnUU7-d_NnZ2d@giganews.com>
In reply to#34471
On 6/5/2021 6:53 AM, Andy Walker wrote:
> On 05/06/2021 11:36, Malcolm McLean wrote:
> ["You" == PO]
>> You say "The maximum scope of my investigation since 2004 is to show
>> that the standard template of the halting problem proofs <is> decideable"
>> Andy Walker's response was "That much has never been in doubt ...."
>> Now I know what you mean. What you mean is that you believe you can show
>> that the cases presented by the halting proofs don't in fact present 
>> insurmountable
>> problems for a decider.
> 

I show all the details of how they are decided as not halting.

>      FTAOD, I knew what he meant too, and was commenting on what he meant
> rather than anything more formal.
> 
>> If you are making an uncontroversial point, people might forgive you 
>> for lax
>> use of terminology. If you are claiming to revolutionise the field, 
>> and it becomes
>> clear that you don't know the accepted terminology, people are much 
>> more likely
>> to simply dismiss what you are saying.
> 
>      That seems to be what PO believes, that people simply dismiss his
> work for no other reason than his lack of knowledge.  No doubt some do;
> but enough people here have tried to address what he calls the "essence"
> or "gist" of what he is saying for it to be clear that we have, over the
> years, been trying to help.  But it is a waste of time.
> 

The lack of the conventional use of terms of the art is by no means a 
lack of knowledge. I didn't learn any of these stuff by carefully 
studying the work of others. I learned from first-principles:
https://jamesclear.com/first-principles

>>                      Especially if it looks like the non-conventional
>> use of terminology is leading to an assumption which is in error - in 
>> this case,
>> that if we can build a decider which correctly classifies H_Hat(H_Hat) 
>> then
>> we've refuted Linz's proof.
> 
>      Indeed.  PO's notion seems to be that "H^" is in some way difficult,
> or complex, or unusual, or whatever, so he feels [assuming he is genuine 

That is a woefully terrible way of saying exactly the opposite of what I 
mean. The following code <is> sufficiently H_Hat.

// Simplified Linz Ĥ (Linz:1990:319)
void H_Hat(u32 P)
{
   // Linz H as a simulating partial halt decider
   u32 Input_Halts = H(P, P);
   if (Input_Halts)
     HERE: goto HERE;
}

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

> and
> not /merely/ trolling] that to analyse "H^" is to make progress.  But, as
> most here know, that is not the "essence/gist" of the "standard proof", and
> so his analysis is irrelevant, no matter how often he repeats it or claims
> that it shows something-or-other about halting or re-words it or asks us to
> find an error in it.
> 

When I show how the standard halting problem template is correctly 
decided as non-halting I have refuted the proofs.

This post is three versions out-of-date. My most recent material
is on page one of the following link.

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation

-- 
Copyright 2021 Pete Olcott

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

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


Page 2 of 9 — ← Prev page 1 [2] 3 4 5 6 7 8 9  Next page →

Back to top | Article view | comp.theory


csiph-web