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


Groups > comp.theory > #27719 > unrolled thread

Re: Halting Problem Final Conclusion [2021 update to my 2004 statement]

Started byolcott <NoOne@NoWhere.com>
First post2021-01-02 12:12 -0600
Last post2021-01-05 21:55 +0000
Articles 20 on this page of 320 — 12 participants

Back to article view | Back to comp.theory

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 12:12 -0600
    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 13:54 -0500
      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 13:12 -0600
        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 14:36 -0500
          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 13:42 -0600
            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 15:16 -0500
        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-02 20:04 +0000
    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-02 19:14 +0000
    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-02 23:06 +0000
      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 18:38 -0500
        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-03 00:25 +0000
          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 20:33 -0500
            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 01:12 +0000
              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-03 20:58 -0500
                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 02:19 +0000
                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-03 22:59 -0500
                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-03 20:23 -0800
                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 23:57 +0000
                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Andy Walker <anw@cuboid.co.uk> - 2021-01-04 11:24 +0000
                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-04 07:10 -0500
                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Andy Walker <anw@cuboid.co.uk> - 2021-01-04 14:52 +0000
                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-04 13:58 -0500
                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-04 20:49 -0600
                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-04 20:39 -0700
                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-04 21:46 -0600
                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 10:01 -0700
                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 12:26 -0600
                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 19:15 +0000
                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 13:37 -0600
                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:15 +0000
                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 15:42 -0600
                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:24 +0000
                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 16:36 -0600
                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 23:52 +0000
                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-05 23:00 -0600
                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 07:55 +0000
                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 13:17 -0600
                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 21:48 +0000
                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 16:38 -0600
                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 05:28 +0000
                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 11:57 +0000
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:05 -0600
                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) André G. Isaak <agisaak@gm.invalid> - 2021-01-07 12:25 -0700
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:41 -0600
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:45 -0600
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 18:45 -0500
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 18:11 -0600
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 01:15 +0000
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 21:14 -0500
                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:49 -0600
                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-08 13:38 -0500
                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 19:59 +0000
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 17:43 -0600
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 00:59 +0000
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:47 -0600
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 18:00 +0000
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-08 16:13 -0500
                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) olcott <NoOne@NoWhere.com> - 2021-01-07 10:00 -0600
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 11:38 -0500
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 21:24 +0000
                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) olcott <NoOne@NoWhere.com> - 2021-01-07 16:31 -0600
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 00:49 +0000
                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 01:00 +0000
                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 21:09 -0600
                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 03:20 +0000
                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 22:14 -0600
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 08:48 -0500
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-08 02:23 +0000
                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:40 -0600
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 17:58 +0000
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) André G. Isaak <agisaak@gm.invalid> - 2021-01-08 14:34 -0700
                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 15:59 -0600
                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 02:22 +0000
                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 20:35 -0600
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 03:31 +0000
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 21:53 -0600
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 04:39 +0000
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 23:08 -0600
                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Jeff Barnett <jbb@notatt.com> - 2021-01-08 22:36 -0700
                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 05:39 +0000
                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 23:50 -0600
                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 07:05 +0000
                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 17:30 +0000
                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 11:58 -0600
                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 18:24 +0000
                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 12:40 -0600
                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 20:07 +0000
                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 15:25 -0600
                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-01-09 21:46 +0000
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:03 -0600
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 22:28 +0000
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 17:07 -0600
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-09 18:41 -0500
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 14:04 -0800
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-10 16:27 -0600
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 22:46 +0000
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 15:11 -0800
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Jeff Barnett <jbb@notatt.com> - 2021-01-10 18:01 -0700
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-10 20:17 -0500
                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-11 03:08 +0000
                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:18 -0600
                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 18:53 +0000
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 13:35 -0600
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:01 +0000
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 14:03 -0600
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:19 +0000
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 13:54 -0600
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:17 +0000
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 14:53 -0600
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-11 18:25 -0500
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Pathological Self-Reference) olcott <NoOne@NoWhere.com> - 2021-01-11 19:26 -0600
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-11 18:10 -0500
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 17:46 -0600
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 00:36 +0000
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 20:41 -0600
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Richard Damon <Richard@Damon-Family.org> - 2021-01-11 19:49 -0500
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 20:46 -0600
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Richard Damon <Richard@Damon-Family.org> - 2021-01-11 22:32 -0500
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 09:36 -0600
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:10 -0500
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 10:23 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:38 -0500
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:06 -0600
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 12:43 -0500
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](decider defined) olcott <NoOne@NoWhere.com> - 2021-01-12 19:14 -0600
                                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](decider defined) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 20:51 -0500
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 08:45 -0800
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:00 -0600
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 12:32 -0500
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](actual behavior) olcott <NoOne@NoWhere.com> - 2021-01-12 19:44 -0600
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](actual behavior) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:01 -0500
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 11:03 -0800
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 13:40 -0600
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 12:24 -0800
                                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](laser focused) olcott <NoOne@NoWhere.com> - 2021-01-12 18:32 -0600
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:27 +0000
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 12:50 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 19:51 +0000
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 14:06 -0600
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 20:17 +0000
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-11 22:23 -0800
                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Jeff Barnett <jbb@notatt.com> - 2021-01-10 22:31 -0700
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:07 -0600
                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 22:20 +0000
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:51 -0600
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 23:22 +0000
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 01:03 +0000
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 10:06 -0600
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:15 +0000
                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 11:50 -0600
                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-12 13:01 -0500
                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 12:07 -0600
                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 02:30 +0000
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-09 03:46 -0800
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:36 -0600
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:39 -0600
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-09 08:12 -0800
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 10:33 -0600
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 13:57 -0500
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 13:18 -0600
                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 16:46 -0500
                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 16:31 -0600
                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 18:35 -0500
                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-01-09 17:22 -0800
                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 19:36 -0600
                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 02:10 +0000
                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 23:12 -0600
                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 09:48 +0000
                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 08:40 -0500
                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-10 05:53 -0800
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:34 -0600
                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 15:09 +0000
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 17:43 +0000
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:43 -0600
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 19:01 +0000
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 13:00 -0500
                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 09:53 -0600
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:23 -0500
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 10:31 -0600
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:53 -0500
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:32 +0000
                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 12:59 -0600
                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 20:07 +0000
                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 14:49 -0600
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 21:28 +0000
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 16:47 -0600
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-12 14:50 -0800
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 23:33 +0000
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:10 -0600
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 00:31 +0000
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 01:28 +0000
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:05 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:21 -0500
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 15:16 +0000
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:30 -0500
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 21:07 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 22:35 -0500
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 14:47 +0000
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 13:57 -0600
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 20:37 +0000
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 15:16 -0600
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 00:05 +0000
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 19:05 -0600
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 02:33 +0000
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:39 -0600
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 04:03 +0000
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-13 22:34 -0600
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 07:26 -0500
                                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:08 -0600
                                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 10:21 -0500
                                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:32 -0600
                                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 11:00 -0500
                                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 10:48 -0600
                                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 00:58 +0000
                                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:09 -0600
                                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:06 +0000
                                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 16:54 +0000
                                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 11:22 -0600
                                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:33 +0000
                                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:10 -0600
                                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 19:25 +0000
                                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 12:58 -0500
                                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:28 -0600
                                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 13:55 -0500
                                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:00 -0600
                                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 19:57 -0500
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 01:34 +0000
                                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:45 -0600
                                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:01 -0500
                                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:31 +0000
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:43 -0600
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 01:51 +0000
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:22 -0600
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 03:09 +0000
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:28 -0500
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:50 -0600
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 03:15 +0000
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 22:27 -0500
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) André G. Isaak <agisaak@gm.invalid> - 2021-01-12 22:53 -0700
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 00:39 -0600
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-13 02:35 -0800
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 11:10 +0000
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 07:49 -0500
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-13 05:21 -0800
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:53 -0600
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 20:59 +0000
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 15:27 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 21:38 +0000
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 16:22 -0600
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Andy Walker <anw@cuboid.co.uk> - 2021-01-14 15:14 +0000
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 09:23 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) Andy Walker <anw@cuboid.co.uk> - 2021-01-14 17:06 +0000
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:25 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:10 +0000
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:26 -0600
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:26 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 19:40 -0500
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 14:51 +0000
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 09:39 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 19:55 -0500
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:53 -0600
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:58 -0600
                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 01:20 +0000
                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 19:55 -0600
                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 15:35 +0000
                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:05 -0600
                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 23:59 +0000
                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 18:57 -0600
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 02:23 +0000
                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:21 -0600
                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 03:42 +0000
                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-13 22:15 -0600
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 08:37 -0500
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 09:18 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 10:47 -0500
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 10:41 -0600
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 12:55 -0500
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 12:16 -0600
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 13:47 -0500
                                                                                                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-16 15:03 -0600
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 19:48 -0500
                                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-17 05:00 +0000
                                                                                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 01:24 +0000
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-15 01:51 +0000
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 02:45 +0000
                                                                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 22:25 -0500
                                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 14:50 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-16 13:24 -0800
                                                                                                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 16:04 -0600
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:15 -0500
                                                                                                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-17 04:46 +0000
                                                                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-16 15:23 -0600
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:05 -0500
                                                                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:14 +0000
                                                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 21:46 -0500
                                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 17:33 +0000
                                                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-10 03:27 -0800
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 08:11 -0500
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 14:57 +0000
                                                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:35 -0600
                                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 02:22 +0000
                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-06 07:53 -0500
                                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-06 09:05 -0800
                                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 13:04 -0600
                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-05 21:31 -0500
                                              Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 04:15 +0000
                                Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 12:42 -0700
                                  Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 13:59 -0600
                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 14:03 -0700
                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 15:33 -0600
                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:46 +0000
                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 16:10 -0600
                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:43 +0000
                                    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:17 +0000
                                      Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) olcott <NoOne@NoWhere.com> - 2021-01-05 16:03 -0600
                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:33 +0000
                                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Richard Damon <Richard@Damon-Family.org> - 2021-01-05 17:54 -0500
                                          Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Jeff Barnett <jbb@notatt.com> - 2021-01-05 18:37 -0700
                                            Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 19:02 -0800
                        Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Vir Campestris <vir.campestris@invalid.invalid> - 2021-01-05 21:55 +0000

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


#28050 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-16 19:48 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<RPLMH.5089$ew6.4910@fx11.iad>
In reply to#28044
On 1/16/21 4:03 PM, olcott wrote:
> On 1/14/2021 12:47 PM, Richard Damon wrote:
>> On 1/14/21 1:16 PM, olcott wrote:
>>>
>>> This means that Halts() <is> a correct halt decider for the above input
>>> as long as it returns the correct value to main() even if this is the
>>> only place that it returns a value.
>>>
>>
>> WRONG.
>>
>> IF we also run with a
>>
>> int main()
>> {
>>      H_Hat( (u32)H_Hat);
>> }
>>
>> it must ALSO return that same value to the top level call in H_Hat, or
>> it PROVES that Halts is NOT the equivalent of the Turing Machine H.
> 
> Try and cite any textbook source that proves that a decider must return
> a value more than once. You are talking out of your ass.
> 
> 

Basic definition of a mathematical function, every invocation of a pure
mathematical function with the same input will ALWAYS produce the same
result.

Turing Machines compute pure mathematical functions.

If Halts(P, I) is a pure mathematical function, which it must be if it
is the computational equivalent of the Turing Machine H in the proof,
thus must return the exact same answer to ALL calls of it which give the
same input, whether it is run as a machine on its own or as a piece of
H^, failure says something was done wrong.

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


#28059 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-17 05:00 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<20210116204635.579@kylheku.com>
In reply to#28044
On 2021-01-16, olcott <NoOne@NoWhere.com> wrote:
> On 1/14/2021 12:47 PM, Richard Damon wrote:
>> On 1/14/21 1:16 PM, olcott wrote:
>>> On 1/14/2021 11:55 AM, Richard Damon wrote:
>>>> On 1/14/21 11:41 AM, olcott wrote:
>>>>> On 1/14/2021 9:47 AM, Richard Damon wrote:
>>>>>> On 1/14/21 10:18 AM, olcott wrote:
>>>>>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>>>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>>>>
>>>>>>>>>> Please also note that anything you do with your pile of x86 code
>>>>>>>>>> will
>>>>>>>>>> not apply to the standard proofs unless you can show that the
>>>>>>>>>> H/H_Hat
>>>>>>>>>> relationship has been maintained and you have admitted that you
>>>>>>>>>> are not
>>>>>>>>>> doing that with the latest ruse.
>>>>>>>>>
>>>>>>>>> The only thing that this function does not implement from Linz is
>>>>>>>>> copying its input and Sipser does it my way:
>>>>>>>>
>>>>>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as
>>>>>>>> that
>>>>>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>>>>>> decide on P given input P, which requires that P be on the input tape
>>>>>>>> twice, thus it needs to do the duplication. Sipser is just not
>>>>>>>> explicit
>>>>>>>> about doing that, but it IS still fundamentally required to
>>>>>>>> implement it.
>>>>>>>>>
>>>>>>>>>        Now we construct a new Turing machine D with H as a
>>>>>>>>> subroutine.
>>>>>>>>>        (Sipser 1997:165)
>>>>>>>>>
>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>> {
>>>>>>>>>       u32 Input_Halts = Halts(P, P);
>>>>>>>>>       if (Input_Halts)
>>>>>>>>>         HERE: goto HERE;
>>>>>>>>>       return;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> Thus the above function has the key common elements of Linz and
>>>>>>>>> Sipser.
>>>>>>>>>
>>>>>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>>>>>> Boston:
>>>>>>>>> PWS Publishing Company (165-167)
>>>>>>>>>
>>>>>>>>
>>>>>>>> Note, that by reusing the representation in the manner you have, you
>>>>>>>> have broken your Computational Equivalenc between your code and the
>>>>>>>> Turing Machines described in the proofs, because you have provided
>>>>>>>> your
>>>>>>>> x86 code with information that the Turing Machines did not have,
>>>>>>>> namely
>>>>>>>> that the input IS a copy of the machine that is running.
>>>>>>>>
>>>>>>>
>>>>>>> I could easily provide a copy and end up with the same results. The
>>>>>>> problem is that Linz specifies infinitely recursive copies. This
>>>>>>> process
>>>>>>> can be decided as not halting too, but the proof is more difficult to
>>>>>>> understand. By passing the machine address (or tape location)
>>>>>>> instead of
>>>>>>> making a copy we get the same
>>>>>>>
>>>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>>>       Once D has determined this information, it does the opposite.
>>>>>>>       (Sipser 1997:165)
>>>>>>> basis used in all the proofs specified in the simplest possible way.
>>>>>>>
>>>>>>
>>>>>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>>>>>> actually specify recursion at all. Linz (and SIPSER) only have
>>>>>> self-reference. It is only YOUR decision to try to solve by simulation
>>>>>> that gets you into something like recursion.
>>>>>
>>>>> Any configuration is completely determined by the current state of the
>>>>> control unit, the contents of the tape, and the position of the
>>>>> read-write head (Linz 1990:236)
>>>>>
>>>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>>>> moves (Linz 1990:237)
>>>>>
>>>>> Therefore H begins at a start state (q0) and ends up at one of two final
>>>>> states (qy) or (qn) and can do [any damn thing inbetween] as long as it
>>>>> ends up deciding halting on its input.
>>>>
>>>> It can do anything that the machine is able to do.
>>>
>>>
>>> As long as it moves from (q0) to the ((qy)) or ((qn)) that corresponds
>>> to the halting status of its input it <is> a correct halt decider for
>>> this input no matter what it does inbetween.
>>>
>>> void H_Hat(u32 P)
>>> {
>>>    u32 Input_Halts = Halts(P, P);
>>>    if (Input_Halts)
>>>      HERE: goto HERE;
>>>    return;
>>> }
>>>
>>> int main()
>>> {
>>>    u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>    Output("Input_Would_Halt =", Input_Would_Halt);
>>> }
>>>
>>>
>>> This means that Halts() <is> a correct halt decider for the above input
>>> as long as it returns the correct value to main() even if this is the
>>> only place that it returns a value.
>>>
>> 
>> WRONG.
>> 
>> IF we also run with a
>> 
>> int main()
>> {
>>      H_Hat( (u32)H_Hat);
>> }
>> 
>> it must ALSO return that same value to the top level call in H_Hat, or
>> it PROVES that Halts is NOT the equivalent of the Turing Machine H.
>
> Try and cite any textbook source that proves that a decider must return 
> a value more than once. You are talking out of your ass.

I will address that below. First, however, if you don't think that
your halting decieder be callable more than once, please try the
following program instead:

  int main(int argc, char **argv)
  {
     if (argc >= 2 && strcmp(argv[1], "--decide") == 0) {
       u32 Input_Halts = Halts((u32) H_Hat, (u32) H_Hat);
       Output("Input_Halts = ", Input_Halts);
     } else {
       H_Hat((u32) H_Hat);
       Output("H_Hat terminated!");
     }

     return 0;
  }

Run the program with the --decide option to obtain he Input_Halts = 0
output.

Then run it without the option and watch "H_Hat terminated!" is
produced.

Then the decider is not being called twice in the same process; but
always in a clean slate.

No changing of any #defines and recompiling the program is allowed
between runs, of course. Just run the same executable twice, with and
without the argument. Feel free to reboot the PC in between if you think
that helps.

Now to address your "talking out of your ass" comment, for which you
should apologize to Richard:

Since a decider is a function, arguments can be applied to it more than
once, and they can be the same ones.

For instance, sin is a function; the following is a valid formula:

   y = sin(x) * sin(x)

A function has the property that each application of the same arguments
to that function specifies the same value.

Anything which has a problem being invoked more than once is not a
function. The definition of a function has no such restriction.

I believe your function in fact has no problem being called more than
once.  Your decider will consistently return the same value for the same
arguments.

It will return the same value to H_Hat as to main.

You just don't like being confronted what that implies, because you
can't face the fact that you've wasted so many years on this,
put it behind you and move on.

Just because you don't emotionally like what your code does when it is
used in a certain way doesn't mean that that should be forbidden.

-- 
TXR Programming Language: http://nongnu.org/txr

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


#28035 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-01-15 01:24 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<87v9bz9elz.fsf@bsb.me.uk>
In reply to#28005
olcott <NoOne@NoWhere.com> writes:

> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>> <cut>
>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>
>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>> on a material fact.
>>>>>>>>>>
>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>
>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>> halting problem an open question again.
>>>>>>>>
>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>> you not get this after all this time?
>>>>>>>
>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>> Y is proven to be bogus.
>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>
>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>> me rather than just say things that are not at issue.
>>>>>
>>>>> As long as we are on the same page wit the above then I don't
>>>>> understand what you could mean. What do you mean?
>>>>
>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>> you have not even read Linz's "proper" proof.
>>>
>>> You already acknowledged that all the proofs have the same essential
>>> basis, thus refuting this basis would refute the Theorem.
>>
>> In fact I have stated the contrary.  You still haven't read Linz's actual
>> proof (rather than the one he sketches for historical reasons), have
>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>> about Chaitin?  Martin?
>
> https://catonmat.net/busy-beaver
>
> The busy beaver is not analogous to:
> (a) The Liar Paradox
> (b) Gödel's 1931 Incompleteness Theorem
> (c) The Tarski Undefinability Theorem
>
> Thus busy beaver is not relevant to my research on the mathematical
> foundation of truth.

Any time you feel up to actually leaning something, ask the group (or
me) why the BB theorem is directly relevant to you current "work".

> Refuting the conventional:
>
> "Do the opposite of whatever the halt decider decides"
>    Once D has determined this information, it does the opposite.
>    (Sipser 1997:165)
> can be leveraged to apply to {a,b,c} above.
>
>> Please also note that anything you do with your pile of x86 code will
>> not apply to the standard proofs unless you can show that the H/H_Hat
>> relationship has been maintained and you have admitted that you are not
>> doing that with the latest ruse.
>
> The only thing that this function does not implement from Linz is
> copying its input and Sipser does it my way:

You are wrong about Sipser.  If you did is Siper's way you could pull
the trick you trying to get past us.

>    Now we construct a new Turing machine D with H as a subroutine.
>    (Sipser 1997:165)
>
> void H_Hat(u32 P)
> {
>   u32 Input_Halts = Halts(P, P);
>   if (Input_Halts)
>     HERE: goto HERE;
>   return;
> }
>
> Thus the above function has the key common elements of Linz and
> Sipser.

The problem function is your Halts with its "modes".  The H/H_Hat
relationship is about one input-determined computation called H and
another, derived from it, called H_Hat.  You have (at least) two
computations hidden behind the name Halts.

You swore bind you were not doing anything as obviously wrong as this
but here we are...

In other news, you pass on another request to post what you had two
years ago:

|| And still you don't post it!  (A JPG will do.)  I really want to know
|| what you considered to be two actual Turing machines, fully encoded,
|| exactly and precisely as in Linz two years ago.  Anyway, keep
|| refusing.  As I say, that's almost as good at making my point as
|| posting it would be.

-- 
Ben.

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


#28037 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-15 01:51 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<20210114173216.637@kylheku.com>
In reply to#28035
On 2021-01-15, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>> <cut>
>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>
>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>
>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>
>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>> halting problem an open question again.
>>>>>>>>>
>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>> you not get this after all this time?
>>>>>>>>
>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>> Y is proven to be bogus.
>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>
>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>> me rather than just say things that are not at issue.
>>>>>>
>>>>>> As long as we are on the same page wit the above then I don't
>>>>>> understand what you could mean. What do you mean?
>>>>>
>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>> you have not even read Linz's "proper" proof.
>>>>
>>>> You already acknowledged that all the proofs have the same essential
>>>> basis, thus refuting this basis would refute the Theorem.
>>>
>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>> proof (rather than the one he sketches for historical reasons), have
>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>> about Chaitin?  Martin?
>>
>> https://catonmat.net/busy-beaver
>>
>> The busy beaver is not analogous to:
>> (a) The Liar Paradox
>> (b) Gödel's 1931 Incompleteness Theorem
>> (c) The Tarski Undefinability Theorem
>>
>> Thus busy beaver is not relevant to my research on the mathematical
>> foundation of truth.
>
> Any time you feel up to actually leaning something, ask the group (or
> me) why the BB theorem is directly relevant to you current "work".
>
>> Refuting the conventional:
>>
>> "Do the opposite of whatever the halt decider decides"
>>    Once D has determined this information, it does the opposite.
>>    (Sipser 1997:165)
>> can be leveraged to apply to {a,b,c} above.
>>
>>> Please also note that anything you do with your pile of x86 code will
>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>> relationship has been maintained and you have admitted that you are not
>>> doing that with the latest ruse.
>>
>> The only thing that this function does not implement from Linz is
>> copying its input and Sipser does it my way:
>
> You are wrong about Sipser.  If you did is Siper's way you could pull
> the trick you trying to get past us.
>
>>    Now we construct a new Turing machine D with H as a subroutine.
>>    (Sipser 1997:165)
>>
>> void H_Hat(u32 P)
>> {
>>   u32 Input_Halts = Halts(P, P);
>>   if (Input_Halts)
>>     HERE: goto HERE;
>>   return;
>> }
>>
>> Thus the above function has the key common elements of Linz and
>> Sipser.
>
> The problem function is your Halts with its "modes".  The H/H_Hat
> relationship is about one input-determined computation called H and
> another, derived from it, called H_Hat.  You have (at least) two
> computations hidden behind the name Halts.
>
> You swore bind you were not doing anything as obviously wrong as this
> but here we are...

The mode is is fixed at compile-time though.

The wrong thing is basically insisting that when the program is
compiled with the #define set to one mode, its result speaks about
not about the behavior of H_Hat in that same program, but H_Hat
in a differnt program that is compiled with the #define in another
mode.

Olcott understands this very well; he knows that it breaks the
self-reference, which is by design: he wants to break that because
it is "pathological".

He knows that if we ask the right question (does the program compiled
with the given mode #define calculate the halting of that program's own
H_Hat(H_Hat)?) that the answer it is calculating is wrong.

His whole "research program" revolves around insisting that this
question is wrong.

The modified question involving "does it need to be stopped"
revolves around flipping this mode variable.
How the modified question maps to his program is this:

"Does the code need to be recompiled with the mode-cotrolling #define
input set to a value in order to prevent the infinite execution of Halts
over the remaining two P, I inputs that occurs under the original mode?"

Interpreted in his way, in the light of what he is doing, it is
obviously not the same as the halting problem question at all,
which is the point.

Olcott understands all this; his entire argument reduces to
"pathological self-reference" being wrong and redefining the problem.

"Pathological self-reference" is an appeal to emotion, where
no reasoning is possible. It's an esthetic argument.

Basically, all rational dialog has been exhausted and Olcott has
conceded all the technical points; it's just down to his distaste
for that self-reference thing, which is like a religious belief.

What time is it? Yes or no? Yes: time to stop responding, maybe?

-- 
TXR Programming Language: http://nongnu.org/txr

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


#28038 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-01-15 02:45 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<87k0seapf1.fsf@bsb.me.uk>
In reply to#28037
Kaz Kylheku <563-365-8930@kylheku.com> writes:

> On 2021-01-15, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>>
>>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>>
>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>
>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>
>>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>>> you not get this after all this time?
>>>>>>>>>
>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>> Y is proven to be bogus.
>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>
>>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>
>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>> understand what you could mean. What do you mean?
>>>>>>
>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>>> you have not even read Linz's "proper" proof.
>>>>>
>>>>> You already acknowledged that all the proofs have the same essential
>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>
>>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>>> proof (rather than the one he sketches for historical reasons), have
>>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>>> about Chaitin?  Martin?
>>>
>>> https://catonmat.net/busy-beaver
>>>
>>> The busy beaver is not analogous to:
>>> (a) The Liar Paradox
>>> (b) Gödel's 1931 Incompleteness Theorem
>>> (c) The Tarski Undefinability Theorem
>>>
>>> Thus busy beaver is not relevant to my research on the mathematical
>>> foundation of truth.
>>
>> Any time you feel up to actually leaning something, ask the group (or
>> me) why the BB theorem is directly relevant to you current "work".
>>
>>> Refuting the conventional:
>>>
>>> "Do the opposite of whatever the halt decider decides"
>>>    Once D has determined this information, it does the opposite.
>>>    (Sipser 1997:165)
>>> can be leveraged to apply to {a,b,c} above.
>>>
>>>> Please also note that anything you do with your pile of x86 code will
>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>> relationship has been maintained and you have admitted that you are not
>>>> doing that with the latest ruse.
>>>
>>> The only thing that this function does not implement from Linz is
>>> copying its input and Sipser does it my way:
>>
>> You are wrong about Sipser.  If you did is Siper's way you could pull
>> the trick you trying to get past us.
>>
>>>    Now we construct a new Turing machine D with H as a subroutine.
>>>    (Sipser 1997:165)
>>>
>>> void H_Hat(u32 P)
>>> {
>>>   u32 Input_Halts = Halts(P, P);
>>>   if (Input_Halts)
>>>     HERE: goto HERE;
>>>   return;
>>> }
>>>
>>> Thus the above function has the key common elements of Linz and
>>> Sipser.
>>
>> The problem function is your Halts with its "modes".  The H/H_Hat
>> relationship is about one input-determined computation called H and
>> another, derived from it, called H_Hat.  You have (at least) two
>> computations hidden behind the name Halts.
>>
>> You swore bind you were not doing anything as obviously wrong as this
>> but here we are...
>
> The mode is is fixed at compile-time though.

I don't think that makes any difference.  Different code is different
code!

> The wrong thing is basically insisting that when the program is
> compiled with the #define set to one mode, its result speaks about
> not about the behavior of H_Hat in that same program, but H_Hat
> in a differnt program that is compiled with the #define in another
> mode.

Right.  I think he's also made the same claim about a run-time switch
but it's all the same trick.

> Olcott understands this very well; he knows that it breaks the
> self-reference, which is by design: he wants to break that because
> it is "pathological".

Yes, he has been very clear, provided one is prepared to pick through
all the misused terms and garbled sentences.

The mystery (for me) is that now he's been forced into making this
clear, why is he making such heavy weather of it?  I can write a Halts
function with a switch (compile- or run-time) that makes Halts(H_Hat,
H_Hat) correct in only a couple of lines.

He is either very confused about what he is really doing, or he is
being deliberately obtuse.  Very, very obtuse.

> He knows that if we ask the right question (does the program compiled
> with the given mode #define calculate the halting of that program's own
> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>
> His whole "research program" revolves around insisting that this
> question is wrong.

If it were that simple he would not spend so much time trying to say
that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
insistent that his code "refutes" the conventional historical proof.

He really, really does think that there are no undecidable sets (well,
he would if he knew what they were).

That's why he won't consider any other undecidable sets.
Many of them have nothing that PO could object to as "pathological".

> What time is it? Yes or no? Yes: time to stop responding, maybe?

Oh, it was that time 10 years ago, but he knows all the right tricks.
He'll insult you or, worse, praise you.  It's hard to leave "Kaz
understand that I'm, right" on the record forever.  I don't think it's
worth trying to explain anything to him.  When I reply, I try to have an
imaginary student in mind whose only interest is to have what PO is up
to pointed out.

All he really wants is to be validated by having knowledgeable people
talk to him, so not replying would be severe punishment indeed.  He'd
escalate though.  The posts would be copied to more groups in the hope
of hooking in new responders and the claims would get more explicitly
wrong.  The desire to get engagement trumps all moral considerations.
Just consider how successful the big lie of Dec 2018 turned out to be!

-- 
Ben.

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


#28039 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-14 22:25 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<VW7MH.7483$4d1.5771@fx47.iad>
In reply to#28038
On 1/14/21 9:45 PM, Ben Bacarisse wrote:
> Kaz Kylheku <563-365-8930@kylheku.com> writes:
> 
>> On 2021-01-15, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>>
>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>>
>>>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>>>> you not get this after all this time?
>>>>>>>>>>
>>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>>> Y is proven to be bogus.
>>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>>
>>>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>>
>>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>>> understand what you could mean. What do you mean?
>>>>>>>
>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>>>> you have not even read Linz's "proper" proof.
>>>>>>
>>>>>> You already acknowledged that all the proofs have the same essential
>>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>>
>>>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>>>> proof (rather than the one he sketches for historical reasons), have
>>>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>>>> about Chaitin?  Martin?
>>>>
>>>> https://catonmat.net/busy-beaver
>>>>
>>>> The busy beaver is not analogous to:
>>>> (a) The Liar Paradox
>>>> (b) Gödel's 1931 Incompleteness Theorem
>>>> (c) The Tarski Undefinability Theorem
>>>>
>>>> Thus busy beaver is not relevant to my research on the mathematical
>>>> foundation of truth.
>>>
>>> Any time you feel up to actually leaning something, ask the group (or
>>> me) why the BB theorem is directly relevant to you current "work".
>>>
>>>> Refuting the conventional:
>>>>
>>>> "Do the opposite of whatever the halt decider decides"
>>>>    Once D has determined this information, it does the opposite.
>>>>    (Sipser 1997:165)
>>>> can be leveraged to apply to {a,b,c} above.
>>>>
>>>>> Please also note that anything you do with your pile of x86 code will
>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>> relationship has been maintained and you have admitted that you are not
>>>>> doing that with the latest ruse.
>>>>
>>>> The only thing that this function does not implement from Linz is
>>>> copying its input and Sipser does it my way:
>>>
>>> You are wrong about Sipser.  If you did is Siper's way you could pull
>>> the trick you trying to get past us.
>>>
>>>>    Now we construct a new Turing machine D with H as a subroutine.
>>>>    (Sipser 1997:165)
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>   u32 Input_Halts = Halts(P, P);
>>>>   if (Input_Halts)
>>>>     HERE: goto HERE;
>>>>   return;
>>>> }
>>>>
>>>> Thus the above function has the key common elements of Linz and
>>>> Sipser.
>>>
>>> The problem function is your Halts with its "modes".  The H/H_Hat
>>> relationship is about one input-determined computation called H and
>>> another, derived from it, called H_Hat.  You have (at least) two
>>> computations hidden behind the name Halts.
>>>
>>> You swore bind you were not doing anything as obviously wrong as this
>>> but here we are...
>>
>> The mode is is fixed at compile-time though.
> 
> I don't think that makes any difference.  Different code is different
> code!
> 
>> The wrong thing is basically insisting that when the program is
>> compiled with the #define set to one mode, its result speaks about
>> not about the behavior of H_Hat in that same program, but H_Hat
>> in a differnt program that is compiled with the #define in another
>> mode.
> 
> Right.  I think he's also made the same claim about a run-time switch
> but it's all the same trick.
> 
>> Olcott understands this very well; he knows that it breaks the
>> self-reference, which is by design: he wants to break that because
>> it is "pathological".
> 
> Yes, he has been very clear, provided one is prepared to pick through
> all the misused terms and garbled sentences.
> 
> The mystery (for me) is that now he's been forced into making this
> clear, why is he making such heavy weather of it?  I can write a Halts
> function with a switch (compile- or run-time) that makes Halts(H_Hat,
> H_Hat) correct in only a couple of lines.
> 
> He is either very confused about what he is really doing, or he is
> being deliberately obtuse.  Very, very obtuse.
> 
>> He knows that if we ask the right question (does the program compiled
>> with the given mode #define calculate the halting of that program's own
>> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>>
>> His whole "research program" revolves around insisting that this
>> question is wrong.
> 
> If it were that simple he would not spend so much time trying to say
> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
> insistent that his code "refutes" the conventional historical proof.
> 
> He really, really does think that there are no undecidable sets (well,
> he would if he knew what they were).
> 
> That's why he won't consider any other undecidable sets.
> Many of them have nothing that PO could object to as "pathological".
> 
>> What time is it? Yes or no? Yes: time to stop responding, maybe?
> 
> Oh, it was that time 10 years ago, but he knows all the right tricks.
> He'll insult you or, worse, praise you.  It's hard to leave "Kaz
> understand that I'm, right" on the record forever.  I don't think it's
> worth trying to explain anything to him.  When I reply, I try to have an
> imaginary student in mind whose only interest is to have what PO is up
> to pointed out.
> 
> All he really wants is to be validated by having knowledgeable people
> talk to him, so not replying would be severe punishment indeed.  He'd
> escalate though.  The posts would be copied to more groups in the hope
> of hooking in new responders and the claims would get more explicitly
> wrong.  The desire to get engagement trumps all moral considerations.
> Just consider how successful the big lie of Dec 2018 turned out to be!
> 

He needs Halts to change at compile time so the requests to prove the
need in need to abort can't be properly proved. His answer to removing
the halt decision is to recompile with the switch so it is removed
EVERYWHERE and thus we do get the claimed infinite recursion because of
course we have broken the halt decider.

It goes back to his broken reusing of the actual code, in the same
address space for all the levels of the simulation.

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


#28042 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 14:50 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<kPmdnXQ2e8cuzJ79nZ2dnUU7-I3NnZ2d@giganews.com>
In reply to#28039
On 1/14/2021 9:25 PM, Richard Damon wrote:
> On 1/14/21 9:45 PM, Ben Bacarisse wrote:
>> Kaz Kylheku <563-365-8930@kylheku.com> writes:
>>
>>> On 2021-01-15, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>>>
>>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>>>
>>>>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>>>>> you not get this after all this time?
>>>>>>>>>>>
>>>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>>>> Y is proven to be bogus.
>>>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>>>
>>>>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>>>
>>>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>>>> understand what you could mean. What do you mean?
>>>>>>>>
>>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>>>>> you have not even read Linz's "proper" proof.
>>>>>>>
>>>>>>> You already acknowledged that all the proofs have the same essential
>>>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>>>
>>>>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>>>>> proof (rather than the one he sketches for historical reasons), have
>>>>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>>>>> about Chaitin?  Martin?
>>>>>
>>>>> https://catonmat.net/busy-beaver
>>>>>
>>>>> The busy beaver is not analogous to:
>>>>> (a) The Liar Paradox
>>>>> (b) Gödel's 1931 Incompleteness Theorem
>>>>> (c) The Tarski Undefinability Theorem
>>>>>
>>>>> Thus busy beaver is not relevant to my research on the mathematical
>>>>> foundation of truth.
>>>>
>>>> Any time you feel up to actually leaning something, ask the group (or
>>>> me) why the BB theorem is directly relevant to you current "work".
>>>>
>>>>> Refuting the conventional:
>>>>>
>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>     Once D has determined this information, it does the opposite.
>>>>>     (Sipser 1997:165)
>>>>> can be leveraged to apply to {a,b,c} above.
>>>>>
>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>> relationship has been maintained and you have admitted that you are not
>>>>>> doing that with the latest ruse.
>>>>>
>>>>> The only thing that this function does not implement from Linz is
>>>>> copying its input and Sipser does it my way:
>>>>
>>>> You are wrong about Sipser.  If you did is Siper's way you could pull
>>>> the trick you trying to get past us.
>>>>
>>>>>     Now we construct a new Turing machine D with H as a subroutine.
>>>>>     (Sipser 1997:165)
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>>    u32 Input_Halts = Halts(P, P);
>>>>>    if (Input_Halts)
>>>>>      HERE: goto HERE;
>>>>>    return;
>>>>> }
>>>>>
>>>>> Thus the above function has the key common elements of Linz and
>>>>> Sipser.
>>>>
>>>> The problem function is your Halts with its "modes".  The H/H_Hat
>>>> relationship is about one input-determined computation called H and
>>>> another, derived from it, called H_Hat.  You have (at least) two
>>>> computations hidden behind the name Halts.
>>>>
>>>> You swore bind you were not doing anything as obviously wrong as this
>>>> but here we are...
>>>
>>> The mode is is fixed at compile-time though.
>>
>> I don't think that makes any difference.  Different code is different
>> code!
>>
>>> The wrong thing is basically insisting that when the program is
>>> compiled with the #define set to one mode, its result speaks about
>>> not about the behavior of H_Hat in that same program, but H_Hat
>>> in a differnt program that is compiled with the #define in another
>>> mode.
>>
>> Right.  I think he's also made the same claim about a run-time switch
>> but it's all the same trick.
>>
>>> Olcott understands this very well; he knows that it breaks the
>>> self-reference, which is by design: he wants to break that because
>>> it is "pathological".
>>
>> Yes, he has been very clear, provided one is prepared to pick through
>> all the misused terms and garbled sentences.
>>
>> The mystery (for me) is that now he's been forced into making this
>> clear, why is he making such heavy weather of it?  I can write a Halts
>> function with a switch (compile- or run-time) that makes Halts(H_Hat,
>> H_Hat) correct in only a couple of lines.
>>
>> He is either very confused about what he is really doing, or he is
>> being deliberately obtuse.  Very, very obtuse.
>>
>>> He knows that if we ask the right question (does the program compiled
>>> with the given mode #define calculate the halting of that program's own
>>> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>>>
>>> His whole "research program" revolves around insisting that this
>>> question is wrong.
>>
>> If it were that simple he would not spend so much time trying to say
>> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
>> insistent that his code "refutes" the conventional historical proof.
>>
>> He really, really does think that there are no undecidable sets (well,
>> he would if he knew what they were).
>>
>> That's why he won't consider any other undecidable sets.
>> Many of them have nothing that PO could object to as "pathological".
>>
>>> What time is it? Yes or no? Yes: time to stop responding, maybe?
>>
>> Oh, it was that time 10 years ago, but he knows all the right tricks.
>> He'll insult you or, worse, praise you.  It's hard to leave "Kaz
>> understand that I'm, right" on the record forever.  I don't think it's
>> worth trying to explain anything to him.  When I reply, I try to have an
>> imaginary student in mind whose only interest is to have what PO is up
>> to pointed out.
>>
>> All he really wants is to be validated by having knowledgeable people
>> talk to him, so not replying would be severe punishment indeed.  He'd
>> escalate though.  The posts would be copied to more groups in the hope
>> of hooking in new responders and the claims would get more explicitly
>> wrong.  The desire to get engagement trumps all moral considerations.
>> Just consider how successful the big lie of Dec 2018 turned out to be!
>>
> 
> He needs Halts to change at compile time so the requests to prove the
> need in need to abort can't be properly proved. His answer to removing
> the halt decision is to recompile with the switch so it is removed
> EVERYWHERE and thus we do get the claimed infinite recursion because of
> course we have broken the halt decider.
> 


Halts() always simulates it input. When the halt decider is changed so 
that it only reports halting after its input has halted and never aborts 
the execution of any input then the resulting execution trace makes it 
as obvious as a [Boston cream pie in the face] that the following code 
<is> infinitely recursive:

// Halts() always simulates it input
void H_Hat(u32 P)
{
   u32 Input_Halts = Halts(P, P);
   if (Input_Halts)
     HERE: goto HERE;
   return;
}

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

Weasel wording may convince gullible fools that this is not the case, 
but then what would one expect from gullible fools?

-- 
Copyright 2021 Pete Olcott

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

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


#28047 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-01-16 13:24 -0800
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<7f542392-d8bf-4bea-a0af-7df689cabeffn@googlegroups.com>
In reply to#28042
On Saturday, 16 January 2021 at 20:51:07 UTC, olcott wrote:
> On 1/14/2021 9:25 PM, Richard Damon wrote: 
> > On 1/14/21 9:45 PM, Ben Bacarisse wrote: 
> >> Kaz Kylheku <563-36...@kylheku.com> writes: 
> >> 
> >>> On 2021-01-15, Ben Bacarisse <ben.u...@bsb.me.uk> wrote: 
> >>>> olcott <No...@NoWhere.com> writes: 
> >>>> 
> >>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote: 
> >>>>>> olcott <No...@NoWhere.com> writes: 
> >>>>>> 
> >>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote: 
> >>>>>>>> olcott <No...@NoWhere.com> writes: 
> >>>>>>>> 
> >>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote: 
> >>>>>>>>>> olcott <No...@NoWhere.com> writes: 
> >>>>>>>>>> 
> >>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote: 
> >>>>>>>>>>>> olcott <No...@NoWhere.com> writes: 
> >>>>>>>>>>>> 
> >>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: 
> >>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes: 
> >>>>>>>>>>>>>> 
> >>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: 
> >>>>>>>>>>>>>> <cut> 
> >>>>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to 
> >>>>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the 
> >>>>>>>>>>>>>>>> classical halting problem. 
> >>>>>>>>>>>>>>> 
> >>>>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me 
> >>>>>>>>>>>>>>> on a material fact. 
> >>>>>>>>>>>>>> 
> >>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have 
> >>>>>>>>>>>>>> code that can make this determination in the general case. 
> >>>>>>>>>>>>> 
> >>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem 
> >>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the 
> >>>>>>>>>>>>> halting problem an open question again. 
> >>>>>>>>>>>> 
> >>>>>>>>>>>> No. Invalidating a proof does not invalidate the theorem. How could 
> >>>>>>>>>>>> you not get this after all this time? 
> >>>>>>>>>>> 
> >>>>>>>>>>> Theorem X is proven on the basis of Y. 
> >>>>>>>>>>> Y is proven to be bogus. 
> >>>>>>>>>>> Thus the proof of Theorem X loses its basis. 
> >>>>>>>>>> 
> >>>>>>>>>> Not in dispute. If you don't understand what I'm saying, you could ask 
> >>>>>>>>>> me rather than just say things that are not at issue. 
> >>>>>>>>> 
> >>>>>>>>> As long as we are on the same page wit the above then I don't 
> >>>>>>>>> understand what you could mean. What do you mean? 
> >>>>>>>> 
> >>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of 
> >>>>>>>> them are found to be bogus. The halting theorem has been proved in many 
> >>>>>>>> different ways. You have never bothered to look at any of them. Heck, 
> >>>>>>>> you have not even read Linz's "proper" proof. 
> >>>>>>> 
> >>>>>>> You already acknowledged that all the proofs have the same essential 
> >>>>>>> basis, thus refuting this basis would refute the Theorem. 
> >>>>>> 
> >>>>>> In fact I have stated the contrary. You still haven't read Linz's actual 
> >>>>>> proof (rather than the one he sketches for historical reasons), have 
> >>>>>> you? Have you looked at Rado's proof of the busy beaver theorem? What 
> >>>>>> about Chaitin? Martin? 
> >>>>> 
> >>>>> https://catonmat.net/busy-beaver 
> >>>>> 
> >>>>> The busy beaver is not analogous to: 
> >>>>> (a) The Liar Paradox 
> >>>>> (b) Gödel's 1931 Incompleteness Theorem 
> >>>>> (c) The Tarski Undefinability Theorem 
> >>>>> 
> >>>>> Thus busy beaver is not relevant to my research on the mathematical 
> >>>>> foundation of truth. 
> >>>> 
> >>>> Any time you feel up to actually leaning something, ask the group (or 
> >>>> me) why the BB theorem is directly relevant to you current "work". 
> >>>> 
> >>>>> Refuting the conventional: 
> >>>>> 
> >>>>> "Do the opposite of whatever the halt decider decides" 
> >>>>> Once D has determined this information, it does the opposite. 
> >>>>> (Sipser 1997:165) 
> >>>>> can be leveraged to apply to {a,b,c} above. 
> >>>>> 
> >>>>>> Please also note that anything you do with your pile of x86 code will 
> >>>>>> not apply to the standard proofs unless you can show that the H/H_Hat 
> >>>>>> relationship has been maintained and you have admitted that you are not 
> >>>>>> doing that with the latest ruse. 
> >>>>> 
> >>>>> The only thing that this function does not implement from Linz is 
> >>>>> copying its input and Sipser does it my way: 
> >>>> 
> >>>> You are wrong about Sipser. If you did is Siper's way you could pull 
> >>>> the trick you trying to get past us. 
> >>>> 
> >>>>> Now we construct a new Turing machine D with H as a subroutine. 
> >>>>> (Sipser 1997:165) 
> >>>>> 
> >>>>> void H_Hat(u32 P) 
> >>>>> { 
> >>>>> u32 Input_Halts = Halts(P, P); 
> >>>>> if (Input_Halts) 
> >>>>> HERE: goto HERE; 
> >>>>> return; 
> >>>>> } 
> >>>>> 
> >>>>> Thus the above function has the key common elements of Linz and 
> >>>>> Sipser. 
> >>>> 
> >>>> The problem function is your Halts with its "modes". The H/H_Hat 
> >>>> relationship is about one input-determined computation called H and 
> >>>> another, derived from it, called H_Hat. You have (at least) two 
> >>>> computations hidden behind the name Halts. 
> >>>> 
> >>>> You swore bind you were not doing anything as obviously wrong as this 
> >>>> but here we are... 
> >>> 
> >>> The mode is is fixed at compile-time though. 
> >> 
> >> I don't think that makes any difference. Different code is different 
> >> code! 
> >> 
> >>> The wrong thing is basically insisting that when the program is 
> >>> compiled with the #define set to one mode, its result speaks about 
> >>> not about the behavior of H_Hat in that same program, but H_Hat 
> >>> in a differnt program that is compiled with the #define in another 
> >>> mode. 
> >> 
> >> Right. I think he's also made the same claim about a run-time switch 
> >> but it's all the same trick. 
> >> 
> >>> Olcott understands this very well; he knows that it breaks the 
> >>> self-reference, which is by design: he wants to break that because 
> >>> it is "pathological". 
> >> 
> >> Yes, he has been very clear, provided one is prepared to pick through 
> >> all the misused terms and garbled sentences. 
> >> 
> >> The mystery (for me) is that now he's been forced into making this 
> >> clear, why is he making such heavy weather of it? I can write a Halts 
> >> function with a switch (compile- or run-time) that makes Halts(H_Hat, 
> >> H_Hat) correct in only a couple of lines. 
> >> 
> >> He is either very confused about what he is really doing, or he is 
> >> being deliberately obtuse. Very, very obtuse. 
> >> 
> >>> He knows that if we ask the right question (does the program compiled 
> >>> with the given mode #define calculate the halting of that program's own 
> >>> H_Hat(H_Hat)?) that the answer it is calculating is wrong. 
> >>> 
> >>> His whole "research program" revolves around insisting that this 
> >>> question is wrong. 
> >> 
> >> If it were that simple he would not spend so much time trying to say 
> >> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so 
> >> insistent that his code "refutes" the conventional historical proof. 
> >> 
> >> He really, really does think that there are no undecidable sets (well, 
> >> he would if he knew what they were). 
> >> 
> >> That's why he won't consider any other undecidable sets. 
> >> Many of them have nothing that PO could object to as "pathological". 
> >> 
> >>> What time is it? Yes or no? Yes: time to stop responding, maybe? 
> >> 
> >> Oh, it was that time 10 years ago, but he knows all the right tricks. 
> >> He'll insult you or, worse, praise you. It's hard to leave "Kaz 
> >> understand that I'm, right" on the record forever. I don't think it's 
> >> worth trying to explain anything to him. When I reply, I try to have an 
> >> imaginary student in mind whose only interest is to have what PO is up 
> >> to pointed out. 
> >> 
> >> All he really wants is to be validated by having knowledgeable people 
> >> talk to him, so not replying would be severe punishment indeed. He'd 
> >> escalate though. The posts would be copied to more groups in the hope 
> >> of hooking in new responders and the claims would get more explicitly 
> >> wrong. The desire to get engagement trumps all moral considerations. 
> >> Just consider how successful the big lie of Dec 2018 turned out to be! 
> >> 
> > 
> > He needs Halts to change at compile time so the requests to prove the 
> > need in need to abort can't be properly proved. His answer to removing 
> > the halt decision is to recompile with the switch so it is removed 
> > EVERYWHERE and thus we do get the claimed infinite recursion because of 
> > course we have broken the halt decider. 
> >
> Halts() always simulates it input. When the halt decider is changed so 
> that it only reports halting after its input has halted and never aborts 
> the execution of any input then the resulting execution trace makes it 
> as obvious as a [Boston cream pie in the face] that the following code 
> <is> infinitely recursive: 
> 
> // Halts() always simulates it input
> void H_Hat(u32 P) 
> { 
> u32 Input_Halts = Halts(P, P); 
> if (Input_Halts) 
> HERE: goto HERE; 
> return; 
> }
> int main() 
> { 
> H_Hat((u32)H_Hat); 
> } 
> 
> Weasel wording may convince gullible fools that this is not the case, 
> but then what would one expect from gullible fools?
> 
But you've conflated the representation of the machine with
the machine itself. In Linz's H_Hat, a copy of P is made on each call.
So each layer of emulation has physically distinct data to work on, 
and you can't detect recursion by looking for calls to the same address.

In fact I'm not sure it's even called "recursion" any more.

However ultimately it doesn't matter. That's not the root reason you don't
have an H that meet's Linz's specifications. The idea seems to be that
Halts doesn't return at all in one mode, and returns "non-halting" in another.
But H has no way of switching modes. 

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


#28049 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 16:04 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<556dnV9LnbFs_579nZ2dnUU7-c3NnZ2d@giganews.com>
In reply to#28047
On 1/16/2021 3:24 PM, Malcolm McLean wrote:
> On Saturday, 16 January 2021 at 20:51:07 UTC, olcott wrote:
>> On 1/14/2021 9:25 PM, Richard Damon wrote:
>>> On 1/14/21 9:45 PM, Ben Bacarisse wrote:
>>>> Kaz Kylheku <563-36...@kylheku.com> writes:
>>>>
>>>>> On 2021-01-15, Ben Bacarisse <ben.u...@bsb.me.uk> wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> No. Invalidating a proof does not invalidate the theorem. How could
>>>>>>>>>>>>>> you not get this after all this time?
>>>>>>>>>>>>>
>>>>>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>>>>>> Y is proven to be bogus.
>>>>>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>>>>>
>>>>>>>>>>>> Not in dispute. If you don't understand what I'm saying, you could ask
>>>>>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>>>>>
>>>>>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>>>>>> understand what you could mean. What do you mean?
>>>>>>>>>>
>>>>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>>>>>> them are found to be bogus. The halting theorem has been proved in many
>>>>>>>>>> different ways. You have never bothered to look at any of them. Heck,
>>>>>>>>>> you have not even read Linz's "proper" proof.
>>>>>>>>>
>>>>>>>>> You already acknowledged that all the proofs have the same essential
>>>>>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>>>>>
>>>>>>>> In fact I have stated the contrary. You still haven't read Linz's actual
>>>>>>>> proof (rather than the one he sketches for historical reasons), have
>>>>>>>> you? Have you looked at Rado's proof of the busy beaver theorem? What
>>>>>>>> about Chaitin? Martin?
>>>>>>>
>>>>>>> https://catonmat.net/busy-beaver
>>>>>>>
>>>>>>> The busy beaver is not analogous to:
>>>>>>> (a) The Liar Paradox
>>>>>>> (b) Gödel's 1931 Incompleteness Theorem
>>>>>>> (c) The Tarski Undefinability Theorem
>>>>>>>
>>>>>>> Thus busy beaver is not relevant to my research on the mathematical
>>>>>>> foundation of truth.
>>>>>>
>>>>>> Any time you feel up to actually leaning something, ask the group (or
>>>>>> me) why the BB theorem is directly relevant to you current "work".
>>>>>>
>>>>>>> Refuting the conventional:
>>>>>>>
>>>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>>> Once D has determined this information, it does the opposite.
>>>>>>> (Sipser 1997:165)
>>>>>>> can be leveraged to apply to {a,b,c} above.
>>>>>>>
>>>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>>>> relationship has been maintained and you have admitted that you are not
>>>>>>>> doing that with the latest ruse.
>>>>>>>
>>>>>>> The only thing that this function does not implement from Linz is
>>>>>>> copying its input and Sipser does it my way:
>>>>>>
>>>>>> You are wrong about Sipser. If you did is Siper's way you could pull
>>>>>> the trick you trying to get past us.
>>>>>>
>>>>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>>>>> (Sipser 1997:165)
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> return;
>>>>>>> }
>>>>>>>
>>>>>>> Thus the above function has the key common elements of Linz and
>>>>>>> Sipser.
>>>>>>
>>>>>> The problem function is your Halts with its "modes". The H/H_Hat
>>>>>> relationship is about one input-determined computation called H and
>>>>>> another, derived from it, called H_Hat. You have (at least) two
>>>>>> computations hidden behind the name Halts.
>>>>>>
>>>>>> You swore bind you were not doing anything as obviously wrong as this
>>>>>> but here we are...
>>>>>
>>>>> The mode is is fixed at compile-time though.
>>>>
>>>> I don't think that makes any difference. Different code is different
>>>> code!
>>>>
>>>>> The wrong thing is basically insisting that when the program is
>>>>> compiled with the #define set to one mode, its result speaks about
>>>>> not about the behavior of H_Hat in that same program, but H_Hat
>>>>> in a differnt program that is compiled with the #define in another
>>>>> mode.
>>>>
>>>> Right. I think he's also made the same claim about a run-time switch
>>>> but it's all the same trick.
>>>>
>>>>> Olcott understands this very well; he knows that it breaks the
>>>>> self-reference, which is by design: he wants to break that because
>>>>> it is "pathological".
>>>>
>>>> Yes, he has been very clear, provided one is prepared to pick through
>>>> all the misused terms and garbled sentences.
>>>>
>>>> The mystery (for me) is that now he's been forced into making this
>>>> clear, why is he making such heavy weather of it? I can write a Halts
>>>> function with a switch (compile- or run-time) that makes Halts(H_Hat,
>>>> H_Hat) correct in only a couple of lines.
>>>>
>>>> He is either very confused about what he is really doing, or he is
>>>> being deliberately obtuse. Very, very obtuse.
>>>>
>>>>> He knows that if we ask the right question (does the program compiled
>>>>> with the given mode #define calculate the halting of that program's own
>>>>> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>>>>>
>>>>> His whole "research program" revolves around insisting that this
>>>>> question is wrong.
>>>>
>>>> If it were that simple he would not spend so much time trying to say
>>>> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
>>>> insistent that his code "refutes" the conventional historical proof.
>>>>
>>>> He really, really does think that there are no undecidable sets (well,
>>>> he would if he knew what they were).
>>>>
>>>> That's why he won't consider any other undecidable sets.
>>>> Many of them have nothing that PO could object to as "pathological".
>>>>
>>>>> What time is it? Yes or no? Yes: time to stop responding, maybe?
>>>>
>>>> Oh, it was that time 10 years ago, but he knows all the right tricks.
>>>> He'll insult you or, worse, praise you. It's hard to leave "Kaz
>>>> understand that I'm, right" on the record forever. I don't think it's
>>>> worth trying to explain anything to him. When I reply, I try to have an
>>>> imaginary student in mind whose only interest is to have what PO is up
>>>> to pointed out.
>>>>
>>>> All he really wants is to be validated by having knowledgeable people
>>>> talk to him, so not replying would be severe punishment indeed. He'd
>>>> escalate though. The posts would be copied to more groups in the hope
>>>> of hooking in new responders and the claims would get more explicitly
>>>> wrong. The desire to get engagement trumps all moral considerations.
>>>> Just consider how successful the big lie of Dec 2018 turned out to be!
>>>>
>>>
>>> He needs Halts to change at compile time so the requests to prove the
>>> need in need to abort can't be properly proved. His answer to removing
>>> the halt decision is to recompile with the switch so it is removed
>>> EVERYWHERE and thus we do get the claimed infinite recursion because of
>>> course we have broken the halt decider.
>>>
>> Halts() always simulates it input. When the halt decider is changed so
>> that it only reports halting after its input has halted and never aborts
>> the execution of any input then the resulting execution trace makes it
>> as obvious as a [Boston cream pie in the face] that the following code
>> <is> infinitely recursive:
>>
>> // Halts() always simulates it input
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> }
>>
>> Weasel wording may convince gullible fools that this is not the case,
>> but then what would one expect from gullible fools?
>>
> But you've conflated the representation of the machine with
> the machine itself. In Linz's H_Hat, a copy of P is made on each call.

In Siper a copy of the machine <is not> made with each call, the halt 
decider is a called subroutine the same way that I do it.

    Now we construct a new Turing machine D with H as a
    subroutine. (Sipser 1997:165)

thus the Linz example can be merged with the Sipser example to make the 
simplest example that encompasses the key:

"do the opposite of whatever the halt decifer decides"

    Once D has determined this information, it does the
    opposite. (Sipser 1997:165)

http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: 
PWS Publishing Company (165-167)

> So each layer of emulation has physically distinct data to work on,
> and you can't detect recursion by looking for calls to the same address.
> 
> In fact I'm not sure it's even called "recursion" any more.
> 
> However ultimately it doesn't matter. That's not the root reason you don't
> have an H that meet's Linz's specifications. The idea seems to be that
> Halts doesn't return at all in one mode, and returns "non-halting" in another.
> But H has no way of switching modes.

Are you smart enough to understand that when a function is called in 
infinite recursion that it does not return a value to its caller?

Can you also understand that when the same case as above has the 
function call aborted that this function still does not return a value 
to its caller?


-- 
Copyright 2021 Pete Olcott

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

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


#28054 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-16 20:15 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<vcMMH.13121$PB3.12320@fx18.iad>
In reply to#28042
On 1/16/21 3:50 PM, olcott wrote:
> On 1/14/2021 9:25 PM, Richard Damon wrote:

>> He needs Halts to change at compile time so the requests to prove the
>> need in need to abort can't be properly proved. His answer to removing
>> the halt decision is to recompile with the switch so it is removed
>> EVERYWHERE and thus we do get the claimed infinite recursion because of
>> course we have broken the halt decider.
>>
> 
> 
> Halts() always simulates it input. When the halt decider is changed so
> that it only reports halting after its input has halted and never aborts
> the execution of any input then the resulting execution trace makes it
> as obvious as a [Boston cream pie in the face] that the following code
> <is> infinitely recursive:
> 
> // Halts() always simulates it input
> void H_Hat(u32 P)
> {
>   u32 Input_Halts = Halts(P, P);
>   if (Input_Halts)
>     HERE: goto HERE;
>   return;
> }
> 
> int main()
> {
>   H_Hat((u32)H_Hat);
> }
> 
> Weasel wording may convince gullible fools that this is not the case,
> but then what would one expect from gullible fools?
> 

The input to Halts is provide on the input tape, That tape will contain
the copies of the 'working' Halts function. We can not change this or we
are changing what we are asking about.

We are asking to make a small change to the Halts that is in the actual
Turing Machine, on the logic that if it TRUELY had to stop the
simulation to avoid infinite execution, then if we disable that ability
to stop JUST THERE, then we can possibly determine that it was wrong by
seeing the computatioh actually halts.

To change the tape to show this would be as dishonest as VW programming
their engines to control the emissions when it detected that it was
under emissions testing.

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


#28058 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-17 04:46 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<20210116204126.944@kylheku.com>
In reply to#28042
On 2021-01-16, olcott <NoOne@NoWhere.com> wrote:
> Halts() always simulates it input. When the halt decider is changed so 
> that it only reports halting after its input has halted and never aborts 
> the execution of any input then the resulting execution trace makes it 
> as obvious as a [Boston cream pie in the face] that the following code 
><is> infinitely recursive:
>
> // Halts() always simulates it input
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Halts)
>      HERE: goto HERE;
>    return;
> }

However, when the halt decidedr is changed so that it does abort,
then that is no longer infinitely recursive.
>
> int main()
> {
>    H_Hat((u32)H_Hat);
> }

And in those cases, you omit his call from your main to avoid
confronting the fact that it terminates.

You've never posted results from a program that has all of the following
features:

1. calls Halts((u32) H_Hat, (u32) H_Hat) and reports the value.
2. calls H_Hat((u32) H_Hat) as above.
3. also reports the value Halts(P, P) returns to H_Hat.

You're not fooling anyone.

> but then what would one expect from gullible fools?

Believing some your less crazy-sounding claims.

-- 
TXR Programming Language: http://nongnu.org/txr

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


#28046 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 15:23 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<ab2dnQtVOfD_xJ79nZ2dnUU7-efNnZ2d@giganews.com>
In reply to#28035
On 1/14/2021 7:24 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>> <cut>
>>>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>>>> classical halting problem.
>>>>>>>>>>>>
>>>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>>>> on a material fact.
>>>>>>>>>>>
>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>
>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>> halting problem an open question again.
>>>>>>>>>
>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>> you not get this after all this time?
>>>>>>>>
>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>> Y is proven to be bogus.
>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>
>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>> me rather than just say things that are not at issue.
>>>>>>
>>>>>> As long as we are on the same page wit the above then I don't
>>>>>> understand what you could mean. What do you mean?
>>>>>
>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>> you have not even read Linz's "proper" proof.
>>>>
>>>> You already acknowledged that all the proofs have the same essential
>>>> basis, thus refuting this basis would refute the Theorem.
>>>
>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>> proof (rather than the one he sketches for historical reasons), have
>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>> about Chaitin?  Martin?
>>
>> https://catonmat.net/busy-beaver
>>
>> The busy beaver is not analogous to:
>> (a) The Liar Paradox
>> (b) Gödel's 1931 Incompleteness Theorem
>> (c) The Tarski Undefinability Theorem
>>
>> Thus busy beaver is not relevant to my research on the mathematical
>> foundation of truth.
> 
> Any time you feel up to actually leaning something, ask the group (or
> me) why the BB theorem is directly relevant to you current "work".
> 
>> Refuting the conventional:
>>
>> "Do the opposite of whatever the halt decider decides"
>>     Once D has determined this information, it does the opposite.
>>     (Sipser 1997:165)
>> can be leveraged to apply to {a,b,c} above.
>>
>>> Please also note that anything you do with your pile of x86 code will
>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>> relationship has been maintained and you have admitted that you are not
>>> doing that with the latest ruse.
>>
>> The only thing that this function does not implement from Linz is
>> copying its input and Sipser does it my way:
> 
> You are wrong about Sipser.  If you did is Siper's way you could pull
> the trick you trying to get past us.
> 
>>     Now we construct a new Turing machine D with H as a subroutine.
>>     (Sipser 1997:165)
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> Thus the above function has the key common elements of Linz and
>> Sipser.
> 
> The problem function is your Halts with its "modes".  The H/H_Hat
> relationship is about one input-determined computation called H and
> another, derived from it, called H_Hat.  You have (at least) two
> computations hidden behind the name Halts.
> 

The only reason that I need modes is that in my "C" implementation 
people get fooled into believing that the halt decider is inconsistent 
because the two lines in main() seem to show that it is inconsistent.

With the Turing Machine implementation of this same halt decider there 
is no such thing as local mode so both lines of main() are decided in 
global mode as not halting.

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

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

When the above is implemented as Turing machines it is impossible to 
execute H_Hat() outside of the complete scope of Halts(), thus 
H_Hat((u32)H_Hat); of main cannot even be expressed.

-- 
Copyright 2021 Pete Olcott

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

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


#28053 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-16 20:05 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<X3MMH.14392$Ht5.1839@fx36.iad>
In reply to#28046
On 1/16/21 4:23 PM, olcott wrote:

> When the above is implemented as Turing machines it is impossible to
> execute H_Hat() outside of the complete scope of Halts(), thus
> H_Hat((u32)H_Hat); of main cannot even be expressed.
> 

Then your doing it wrong. If H is the Turing Machine equivalent of your
Halting Decider, it is ALWAYS possible to form the Machine H^ as
described by Linz. PERIOD.

If you want to overturn this basic premise, maybe you need to start
writing your proof in a Turing Notation to explain what you want to do.

I suppose your other option is to assume that Church-Turing doesn't
apply, but then you have cut off the limb you are sitting on, as the
Theorems you are working on are based on Turing Machines, and you are
counting on that to work in x86 space.

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


#28056 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-01-17 03:14 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<87o8ho8daz.fsf@bsb.me.uk>
In reply to#28046
olcott <NoOne@NoWhere.com> writes:

> On 1/14/2021 7:24 PM, Ben Bacarisse wrote:
<cut>
>> The problem function is your Halts with its "modes".  The H/H_Hat
>> relationship is about one input-determined computation called H and
>> another, derived from it, called H_Hat.  You have (at least) two
>> computations hidden behind the name Halts.
>
> The only reason that I need modes is that in my "C" implementation
> people get fooled into believing that the halt decider is inconsistent
> because the two lines in main() seem to show that it is inconsistent.
>
> With the Turing Machine implementation of this same halt decider there
> is no such thing as local mode so both lines of main() are decided in
> global mode as not halting.
>
> void H_Hat(u32 P)
> {
>   u32 Input_Halts = Halts(P, P);
>   if (Input_Halts)
>     HERE: goto HERE;
>   return;
> }
>
> int main()
> {
>   u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>   H_Hat((u32)H_Hat);
> }
>
> When the above is implemented as Turing machines it is impossible to
> execute H_Hat() outside of the complete scope of Halts(), thus
> H_Hat((u32)H_Hat); of main cannot even be expressed.

So you admit that Halts and H_Hat are not in the same relationship as H
and H^ in Linz?  That's great (because you are correct about that) but
it does reinforce the fact that you've been lying about having H and H^
"exactly and precisely as in Linz".

You realise we've been telling you this for weeks?

And yet again you pass on another request to post what you had two years
ago:

|| I really want to know
|| what you considered to be two actual Turing machines, fully encoded,
|| exactly and precisely as in Linz two years ago.  Anyway, keep
|| refusing.  As I say, that's almost as good at making my point as
|| posting it would be.

Posting these two Turing machines should clear up this "mode" issue once
and for all.  So, why not post what you have back then?

-- 
Ben.

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


#28000 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-13 21:46 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<NfOLH.23969$YS6.20586@fx39.iad>
In reply to#27996
On 1/13/21 7:57 PM, olcott wrote:
> 
> As I have said many many times I had the complete algorithm showing the
> details of how H() correctly decides not halting for H_Hat() on the
> basis of the infinite recursion of H_Hat() written in almost complete C.
> 
> If I said that I wrote a paper on how to cure a kind of cancer and I
> actually only scribbled short hand notes on how to cure this cancer and
> the cure worked, then my original statement is sufficiently accurate.
> The fact that the cure worked would carry enormous weight on the
> assessment of the accuracy of the original statement.
> 

If you wrote a paper on how to cure a kind of cancer, people would ask
to see the reseach that SHOWED that your method did actually work, and
if you said that you hadn't completed the study, you would be laughed
out of the house for fraud. You only make such an announcement AFTER you
have proven it.

You actually have sort of done that here. You have been saying for a
long time that you have this program that 'proves' that you are right,
but every time people ask about it, it isn't quite ready yet.

If the program really IS the proof you claimed, then how can it have
proven it if it isn't done yet. That seems to sound like your cancer
cure, you have an idea that you think will work, so you go boast that
you actually HAVE a cure when you don't yet. THIS IS JUST A LIE.

It seems that you don't really have a firm understanding of truth, as
you engage in so many deceptive practices. You make claims to have
things, that when pressed turns out to not quite be true. You seem to
like twisting terms and make them mean what they don't normally mean,
like you claim of 'no conditional in the code' but you actually mean
there are no visible conditionals in the part of the code that you call
user code, but don't look at that man behind the curtain, that doesn't
count.

If you REALLY need the program for the proof, then you can't of made the
proof way back then when you made the claims, because the program didn't
exist then (or so you say).

If you don't really need the program, then you could have long ago
explained in detail what your proof actually was, and people could see
it for what it was.

NO ONE needs to see the many lines of the trace, as the only part that
is important, if you are making the claim to be applicable to the
classical halting problem, is the very end, where H returns its
prediction to H^, and then seeing what H^ does. Thats it.

If you aren't claiming to apply to the classical halting problem, then
we can probably see less, because it just doesn't matter. What would
matter then is showing some actually mathematical proof that this
alternate question actually has some use.

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


#27835 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-01-09 17:33 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<87y2h2uiao.fsf@bsb.me.uk>
In reply to#27829
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:

> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote:
>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: 
>>
>> > You have explained, clearly, the ways in which the two algorithms 
>> > differ: one is a simulation that does not return a value, the other is a 
>> > partial simulation that does. I can't see why you want to deny this 
>> > now. It the core of the ruse you are trying to pull.
>>
>> How can you say something as stupid as this knowing that I have 
>> repeatedly told you many times that there is only one single instance of 
>> the machine code? 
>>
> A halt decider has to be a function of the input machine and the input
> machine's tape. If it is a function of the input machine, the input
> machine's tape, and something else, even a simple flag, then it's
> easy to meet Linz's challenge.

What is Linz's challenge?

> If you disguise the "something else" then
> it might be a clever cheat, but it's just a cheat.

-- 
Ben.

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


#27862 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-01-10 03:27 -0800
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<6626e908-aa28-4aa4-9f6e-4089a5bfeecan@googlegroups.com>
In reply to#27835
On Saturday, 9 January 2021 at 17:33:21 UTC, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.ar...@gmail.com> writes: 
> 
> > On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: 
> >> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: 
> >> 
> >> > You have explained, clearly, the ways in which the two algorithms 
> >> > differ: one is a simulation that does not return a value, the other is a 
> >> > partial simulation that does. I can't see why you want to deny this 
> >> > now. It the core of the ruse you are trying to pull. 
> >> 
> >> How can you say something as stupid as this knowing that I have 
> >> repeatedly told you many times that there is only one single instance of 
> >> the machine code? 
> >> 
> > A halt decider has to be a function of the input machine and the input 
> > machine's tape. If it is a function of the input machine, the input 
> > machine's tape, and something else, even a simple flag, then it's 
> > easy to meet Linz's challenge.
> What is Linz's challenge?
>
To find an H which decides H_Hat.

It's not really a "challenge" since it obviously can't be done. But PO has 
chosen to treat it as a challenge.  

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


#27863 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-01-10 08:11 -0500
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<U1DKH.119792$SY1.115613@fx36.iad>
In reply to#27862
On 1/10/21 6:27 AM, Malcolm McLean wrote:
> On Saturday, 9 January 2021 at 17:33:21 UTC, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes: 
>>
>>> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: 
>>>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: 
>>>>
>>>>> You have explained, clearly, the ways in which the two algorithms 
>>>>> differ: one is a simulation that does not return a value, the other is a 
>>>>> partial simulation that does. I can't see why you want to deny this 
>>>>> now. It the core of the ruse you are trying to pull. 
>>>>
>>>> How can you say something as stupid as this knowing that I have 
>>>> repeatedly told you many times that there is only one single instance of 
>>>> the machine code? 
>>>>
>>> A halt decider has to be a function of the input machine and the input 
>>> machine's tape. If it is a function of the input machine, the input 
>>> machine's tape, and something else, even a simple flag, then it's 
>>> easy to meet Linz's challenge.
>> What is Linz's challenge?
>>
> To find an H which decides H_Hat.
> 
> It's not really a "challenge" since it obviously can't be done. But PO has 
> chosen to treat it as a challenge.  
> 

Or a bit more precisely, to find an H that decides the H^ built from THAT H.

The key is that H^ is constructed to use a particular H, and it is THAT
H (and primarily that H) that can't predict the halting status of H^.

In one sense, to use a sort of C++ terminology H_Hat isn't an ordinary
function but more of a template function based on a provided function,
so we really have H_Hat<H>(P)

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


#27866 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-01-10 14:57 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<87h7novnz9.fsf@bsb.me.uk>
In reply to#27862
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:

> On Saturday, 9 January 2021 at 17:33:21 UTC, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes: 
>> 
>> > On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: 
>> >> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: 
>> >> 
>> >> > You have explained, clearly, the ways in which the two algorithms 
>> >> > differ: one is a simulation that does not return a value, the other is a 
>> >> > partial simulation that does. I can't see why you want to deny this 
>> >> > now. It the core of the ruse you are trying to pull. 
>> >> 
>> >> How can you say something as stupid as this knowing that I have 
>> >> repeatedly told you many times that there is only one single instance of 
>> >> the machine code? 
>> >> 
>> > A halt decider has to be a function of the input machine and the input 
>> > machine's tape. If it is a function of the input machine, the input 
>> > machine's tape, and something else, even a simple flag, then it's 
>> > easy to meet Linz's challenge.
>> What is Linz's challenge?
>>
> To find an H which decides H_Hat.
>
> It's not really a "challenge" since it obviously can't be done.

It obviously can be done.  There is no doubt that PO has /an/ H that
correctly decides the H_Hat he keeps posting.  The trouble is it's the
wrong H (or the wrong H_Hat depending on how you want to look at it).

> But PO has chosen to treat it as a challenge.

If PO were, as you have charitably maintained, simply a showman looking
for a good trick, the challenge could be seen as one of hiding what's
going on.  But PO has be admirable clear in this point.  The computation
that gets the right answer is not the one around which H_Hat is wrapped.

It's true there has been a fair amount of deception involved, such as
using the same function to implement these two behaviours and not
publishing the code, but I am not sure that these result from an honest
desire to "hide the trick".

-- 
Ben.

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


#27882 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-11 12:35 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<s7edne1DcMUTB2HCnZ2dnUU7-dtQAAAA@giganews.com>
In reply to#27862
On 1/10/2021 5:27 AM, Malcolm McLean wrote:
> On Saturday, 9 January 2021 at 17:33:21 UTC, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>>> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote:
>>>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote:
>>>>
>>>>> You have explained, clearly, the ways in which the two algorithms
>>>>> differ: one is a simulation that does not return a value, the other is a
>>>>> partial simulation that does. I can't see why you want to deny this
>>>>> now. It the core of the ruse you are trying to pull.
>>>>
>>>> How can you say something as stupid as this knowing that I have
>>>> repeatedly told you many times that there is only one single instance of
>>>> the machine code?
>>>>
>>> A halt decider has to be a function of the input machine and the input
>>> machine's tape. If it is a function of the input machine, the input
>>> machine's tape, and something else, even a simple flag, then it's
>>> easy to meet Linz's challenge.
>> What is Linz's challenge?
>>
> To find an H which decides H_Hat.
> 
> It's not really a "challenge" since it obviously can't be done. But PO has
> chosen to treat it as a challenge.
> 

The only way that you can avoid understandmg that I showed exactly how 
Halts() correctly decides not-halting on H_Hat() is to intentionally 
ignore the details of what I have been saying.

-- 
Copyright 2021 Pete Olcott

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

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


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

Back to top | Article view | comp.theory


csiph-web