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


Groups > comp.software-eng > #1940 > unrolled thread

Re: Happy Thanksgiving to all

Started byolcott <NoOne@NoWhere.com>
First post2020-11-27 13:20 -0600
Last post2020-11-30 16:57 -0600
Articles 20 on this page of 412 — 6 participants

Back to article view | Back to comp.software-eng

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: Happy Thanksgiving to all olcott <NoOne@NoWhere.com> - 2020-11-27 13:20 -0600
    Re: Happy Thanksgiving to all olcott <NoOne@NoWhere.com> - 2020-11-27 17:17 -0600
      Re: Happy Thanksgiving to all olcott <NoOne@NoWhere.com> - 2020-11-27 17:57 -0600
      Re: Happy Thanksgiving to all olcott <NoOne@NoWhere.com> - 2020-11-28 08:21 -0600
        Re: Happy Thanksgiving to all olcott <NoOne@NoWhere.com> - 2020-11-28 08:40 -0600
          Re: Happy Thanksgiving to all (over your head) olcott <NoOne@NoWhere.com> - 2020-11-28 12:23 -0600
          Re: Happy Thanksgiving to all (Over your head) olcott <NoOne@NoWhere.com> - 2020-11-28 12:46 -0600
            Re: Happy Thanksgiving to all (Over your head) olcott <NoOne@NoWhere.com> - 2020-11-28 13:27 -0600
              Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 16:00 -0600
                Re: Happy Thanksgiving to all (logical necessity) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-28 22:11 +0000
                  Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 16:16 -0600
                Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 17:49 -0600
                  Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 22:29 -0600
                    Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-29 12:41 -0600
                  Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 23:15 -0600
                Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 18:07 -0600
            Re: Happy Thanksgiving to all (Over your head) Jeff Barnett <jbb@notatt.com> - 2020-11-28 12:27 -0700
              Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 13:40 -0600
                Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 17:06 -0600
                  Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 17:39 -0600
                    Re: Happy Thanksgiving to all (logical necessity) Jeff Barnett <jbb@notatt.com> - 2020-11-28 17:45 -0700
                      Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 19:08 -0600
                        Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-29 08:56 -0600
                          Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-29 09:12 -0600
                          Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-29 09:40 -0600
                            Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-11-30 20:02 -0600
                              Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-11-30 22:39 -0600
                                Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-11-30 21:19 -0800
                                  Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) Jeff Barnett <jbb@notatt.com> - 2020-12-01 10:58 -0700
                                    Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-02 23:32 -0800
                              Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-12-01 09:12 -0600
                                Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 21:22 +0000
                                  Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-12-01 15:40 -0600
                                    Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-01 22:10 +0000
                                      Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-12-01 16:26 -0600
                                      Re: Happy Thanksgiving to all (logical necessity)(asleep at the switch) olcott <NoOne@NoWhere.com> - 2020-12-01 17:21 -0600
                              Re: Happy Thanksgiving to all (logical necessity)(Numbskull?) olcott <NoOne@NoWhere.com> - 2020-12-01 20:53 -0600
                                Re: Happy Thanksgiving to all (logical necessity)[ Ben is a Numbskull !!! ] olcott <NoOne@NoWhere.com> - 2020-12-02 20:28 -0600
                                  Re: Happy Thanksgiving to all (logical necessity)[ Ben is a Numbskull !!! ] olcott <NoOne@NoWhere.com> - 2020-12-04 20:29 -0600
                                    Re: Happy Thanksgiving to all (logical necessity)[ Ben is a Numbskull !!! ] olcott <NoOne@NoWhere.com> - 2020-12-05 10:05 -0600
                                Re: Happy Thanksgiving to all (logical necessity)(Numbskull?) olcott <NoOne@NoWhere.com> - 2020-12-02 20:39 -0600
                                  Re: Refuting the Peter Linz HP proof olcott <NoOne@NoWhere.com> - 2020-12-03 12:42 -0600
                                    Re: Refuting the Peter Linz HP proof olcott <NoOne@NoWhere.com> - 2020-12-04 08:40 -0600
                                      Re: Refuting the Peter Linz HP proof olcott <NoOne@NoWhere.com> - 2020-12-04 10:06 -0600
                                        Re: Refuting the Peter Linz HP proof olcott <NoOne@NoWhere.com> - 2020-12-04 13:34 -0600
                                Re: Happy Thanksgiving to all (logical necessity)[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-02 21:52 -0600
                                  Re: Local halt decider enabled[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-03 08:46 -0600
                                  Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-03 08:53 -0600
                                    Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-03 10:49 -0600
                                      Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 08:24 -0600
                                      Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 08:28 -0600
                                        Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 09:46 -0600
                                        Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 10:57 -0600
                                          Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 13:55 -0600
                                            Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 10:22 -0600
                                              Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 13:22 -0600
                                            Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 10:59 -0600
                                              Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 12:52 -0600
                                                Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 13:24 -0600
                                                  Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 14:15 -0600
                                                    Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 15:21 -0600
                                                    Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 16:23 -0600
                                                    Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 16:25 -0600
                                                      Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-05 22:40 -0600
                                                        Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-06 13:18 -0600
                                                          Re: Refutation of Peter Linz HP proof [ Logical Necessity ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-06 19:59 +0000
                                                            Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-06 14:07 -0600
                                                              Re: Refutation of Peter Linz HP proof [ Logical Necessity ] Jeff Barnett <jbb@notatt.com> - 2020-12-06 16:59 -0700
                                                          Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-06 14:29 -0600
                                                            Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-07 14:16 -0600
                                                              Re: Refutation of Peter Linz HP proof [ Logical Necessity ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-07 21:16 +0000
                                                                Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-07 15:21 -0600
                                                                  Re: Refutation of Peter Linz HP proof [ Logical Necessity ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-07 22:10 +0000
                                                                    Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-07 16:26 -0600
                                                                      Re: Refutation of Peter Linz HP proof [ Logical Necessity ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-08 02:03 +0000
                                                                        Re: Refutation of Peter Linz HP proof [ divide by zero error returns no value ] olcott <NoOne@NoWhere.com> - 2020-12-07 20:22 -0600
                                                                          Re: Refutation of Peter Linz HP proof [ divide by zero error returns no value ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-08 03:09 +0000
                                                                            Re: Refutation of Peter Linz HP proof [ divide by zero error returns no value ] olcott <NoOne@NoWhere.com> - 2020-12-07 21:37 -0600
                                                            Re: Refutation of Peter Linz HP proof [ Logical Necessity ] olcott <NoOne@NoWhere.com> - 2020-12-07 14:42 -0600
                                                            Re: Refutation of Peter Linz HP proof [ Recursion with TMs ] olcott <NoOne@NoWhere.com> - 2020-12-07 19:05 -0600
                                                              Re: Refutation of Peter Linz HP proof [ Recursion with TMs ] olcott <NoOne@NoWhere.com> - 2020-12-07 21:51 -0600
                                                                Re: Refutation of Peter Linz HP proof [ Recursion with TMs ] olcott <NoOne@NoWhere.com> - 2020-12-08 15:25 -0600
                                                                  Re: Refutation of Peter Linz HP proof [ Recursion with TMs ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-08 21:44 +0000
                                                          Re: Refutation of Peter Linz HP proof [ Dishonest dodges ] olcott <NoOne@NoWhere.com> - 2020-12-06 14:47 -0600
                                                    Re: Renaming DebugTrace() to H or Halts[ Halts == Simulate ] olcott <NoOne@NoWhere.com> - 2020-12-06 08:31 -0600
                                                      Re: Renaming DebugTrace() to H or Halts[ Halts == Simulate ] olcott <NoOne@NoWhere.com> - 2020-12-07 13:32 -0600
                                                        Re: Renaming DebugTrace() to H or Halts[ Halts == Simulate ] olcott <NoOne@NoWhere.com> - 2020-12-08 08:42 -0600
                                        Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 11:10 -0600
                                      Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 09:50 -0600
                                      Re: Renaming DebugTrace() to H or Halts[ Effective Presentation ] olcott <NoOne@NoWhere.com> - 2020-12-04 11:20 -0600
                                Re: Happy Thanksgiving to all (logical necessity)(Numbskull?) olcott <NoOne@NoWhere.com> - 2020-12-04 20:44 -0600
                                  Re: Happy Thanksgiving to all (logical necessity)(Numbskull?) olcott <NoOne@NoWhere.com> - 2020-12-05 19:55 -0600
                                    Re: Both invocations of Confound_Halts() are decided consistently (Ben's ADD) olcott <NoOne@NoWhere.com> - 2020-12-07 20:13 -0600
                                    Re: Happy Thanksgiving to all (logical necessity)(Over Ben's head) olcott <NoOne@NoWhere.com> - 2020-12-07 20:26 -0600
                            Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 12:05 -0600
                            Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 12:07 -0600
                              Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 13:12 -0600
                                Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 14:24 -0600
                                  Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 15:22 -0600
                                    Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts)(nitwit) olcott <NoOne@NoWhere.com> - 2020-12-02 16:03 -0600
                                  Re: Refuting the Peter Linz HP Proof (Ben is proven wrong by the actual facts) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-02 21:45 +0000
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-02 19:27 -0600
                                      Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-03 18:18 +0000
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-02 19:50 -0600
                                      Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-03 18:32 +0000
                                        Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-03 12:35 -0600
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-03 15:47 -0600
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-07 12:29 -0600
                                    Re: Refuting the Peter Linz HP Proof (Ben still tries to dodge the truth) olcott <NoOne@NoWhere.com> - 2020-12-07 20:10 -0600
                                    Re: Refuting the Peter Linz HP Proof (Ben still tries to dodge the truth) olcott <NoOne@NoWhere.com> - 2020-12-08 08:33 -0600
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-09 12:04 -0600
                                      Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-09 22:48 -0600
                                        Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-10 12:13 +0000
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-10 12:21 +0000
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 08:22 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 08:20 -0600
                                        Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 08:44 -0600
                                          Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 15:02 -0600
                                            Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-10 21:19 +0000
                                              Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 15:53 -0600
                                                Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-10 23:38 +0000
                                                  Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 18:16 -0600
                                                    Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 00:19 +0000
                                                      Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 18:27 -0600
                                                        Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 00:29 +0000
                                                          Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 18:45 -0600
                                                            Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 00:54 +0000
                                                              Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 19:48 -0600
                                                            Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 00:55 +0000
                                                              Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] olcott <NoOne@NoWhere.com> - 2020-12-10 19:01 -0600
                                                                Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 01:03 +0000
                                                                Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 01:14 +0000
                                                              Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Jeff Barnett <jbb@notatt.com> - 2020-12-10 21:54 -0700
                                            Re: Refuting the Peter Linz HP Proof [ Most important words that I have ever said on the HP ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-10 23:10 +0000
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 18:58 -0600
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 01:13 +0000
                                              Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 19:33 -0600
                                                Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 19:13 +0000
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 20:53 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 19:18 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-11 18:20 -0600
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-12 00:34 +0000
                                              Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-11 18:47 -0600
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-11 18:48 -0600
                                            Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 09:31 -0600
                                              Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 10:24 -0600
                                                Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 11:38 -0600
                                                  Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 11:45 -0600
                                                    Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-12 17:55 +0000
                                                    Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 12:26 -0600
                                                      Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-12 19:01 +0000
                                                      Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-12 14:01 -0600
                                                        Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-12 20:04 +0000
                                                        Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-14 08:25 -0600
                                                          Re: Refuting the Peter Linz HP Proof (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-14 17:45 +0000
                                                          Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-14 12:50 -0600
                                                            Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-14 15:42 -0600
                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-14 19:34 -0600
                                                                Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-15 09:36 +0000
                                                                  Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (Halts() as an exception handler) olcott <NoOne@NoWhere.com> - 2020-12-15 08:50 -0600
                                                                    Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (Halts() as an exception handler) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-15 17:18 +0000
                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-15 08:28 -0600
                                                                Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-15 09:21 -0600
                                                                  Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-15 10:28 -0600
                                                                    Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-15 17:38 +0000
                                                                    Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-15 12:13 -0600
                                                                      Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 08:24 -0600
                                                                        Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 09:16 -0600
                                                                          Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 10:55 -0600
                                                                            Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-17 17:05 +0000
                                                                            Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 12:13 -0600
                                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 19:03 +0000
                                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-18 11:54 -0600
                                                                          Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 11:07 -0600
                                                                            Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 12:21 -0600
                                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 19:08 +0000
                                                                              Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (as easy as 1,2,3) olcott <NoOne@NoWhere.com> - 2020-12-17 13:26 -0600
                                                                                Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (as easy as 1,2,3) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 20:20 +0000
                                                                        Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 16:27 +0000
                                                                        Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) olcott <NoOne@NoWhere.com> - 2020-12-17 18:35 -0600
                                                            Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-14 15:37 -0800
                                            Re: Refuting the Peter Linz HP Proof [ infinitely recursive Turing machines ] olcott <NoOne@NoWhere.com> - 2020-12-12 10:13 -0600
                                              Re: Refuting the Peter Linz HP Proof [ infinitely recursive Turing machines ] olcott <NoOne@NoWhere.com> - 2020-12-12 10:29 -0600
                                              Re: Refuting the Peter Linz HP Proof [ infinitely recursive Turing machines ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-12 16:41 +0000
                                                Re: Refuting the Peter Linz HP Proof [ infinitely recursive Turing machines ] olcott <NoOne@NoWhere.com> - 2020-12-12 10:44 -0600
                                        Re: Refuting the Peter Linz HP Proof (Kaz most definitely has agreed with olcott) olcott <NoOne@NoWhere.com> - 2020-12-10 09:17 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz most definitely has agreed with olcott) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-10 15:20 +0000
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-09 19:46 -0600
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 08:37 -0600
                                      Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 09:21 -0600
                                        Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 10:16 -0600
                                    Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 14:34 -0600
                                      Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-10 22:23 +0000
                                        Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 17:30 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-10 23:37 +0000
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 18:12 -0600
                                          Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 00:51 +0000
                                            Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 19:12 -0600
                                              Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Jeff Barnett <jbb@notatt.com> - 2020-12-10 21:50 -0700
                                                Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-10 23:03 -0600
                                              Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 08:15 -0600
                                                Re: Refuting the Peter Linz HP Proof Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 14:34 +0000
                                                  Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 08:39 -0600
                                                    Re: Refuting the Peter Linz HP Proof Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 14:52 +0000
                                                      Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 09:07 -0600
                                                        Re: Refuting the Peter Linz HP Proof Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 15:10 +0000
                                                          Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 09:15 -0600
                                                            Re: Refuting the Peter Linz HP Proof Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-11 15:23 +0000
                                                          Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 09:29 -0600
                                                            Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 10:23 -0600
                                                              Re: Refuting the Peter Linz HP Proof "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-11 16:59 -0800
                                                                Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 19:08 -0600
                                                                  Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 19:10 -0600
                                                            Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 18:52 +0000
                                                              Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 12:59 -0600
                                                        Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 18:35 +0000
                                                          Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 13:45 -0600
                                                Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 09:14 -0600
                                                  Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 19:04 +0000
                                                    Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 13:17 -0600
                                                      Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 19:44 +0000
                                                        Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 13:58 -0600
                                                          Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 20:07 +0000
                                                            Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 14:20 -0600
                                                              Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 23:20 +0000
                                                                Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 17:31 -0600
                                                                  Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-12 00:19 +0000
                                                                    Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 18:46 -0600
                                                                      Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-12 01:00 +0000
                                                                        Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 19:16 -0600
                                                                          Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-12 02:13 +0000
                                                                          Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-12 02:18 +0000
                                                Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 10:22 -0600
                                                  Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 12:38 -0600
                                                Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 18:31 +0000
                                                  Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 12:55 -0600
                                                    Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 19:17 +0000
                                                      Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 17:45 -0600
                                                Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 15:58 -0600
                                                  Re: Refuting the Peter Linz HP Proof olcott <NoOne@NoWhere.com> - 2020-12-11 17:23 -0600
                                                  Re: Refuting the Peter Linz HP Proof Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 23:28 +0000
                                              Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-11 18:26 +0000
                                                Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct) olcott <NoOne@NoWhere.com> - 2020-12-11 12:48 -0600
                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs olcott <NoOne@NoWhere.com> - 2020-12-15 10:09 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 13:23 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 14:04 -0600
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2020-12-16 20:21 +0000
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Jeff Barnett <jbb@notatt.com> - 2020-12-16 13:33 -0700
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-16 20:44 +0000
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 15:00 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-16 21:09 +0000
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 16:49 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 00:21 +0000
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 16:37 -0600
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 17:43 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 00:28 +0000
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 20:46 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 04:24 +0000
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-17 10:49 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 19:15 +0000
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-17 15:06 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-17 17:29 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-18 18:02 +0000
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-18 12:24 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-17 21:18 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-17 20:20 -0800
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 18:44 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 01:55 +0000
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-16 22:59 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 05:36 +0000
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-17 10:37 -0600
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-17 16:46 +0000
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 09:38 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 09:43 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 10:20 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (universal versus partial decider) olcott <NoOne@NoWhere.com> - 2020-12-19 10:47 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-19 22:32 +0000
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 17:51 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-20 05:21 +0000
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) olcott <NoOne@NoWhere.com> - 2020-12-20 13:43 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) olcott <NoOne@NoWhere.com> - 2020-12-20 16:20 -0600
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) Jeff Barnett <jbb@notatt.com> - 2020-12-20 16:37 -0700
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) olcott <NoOne@NoWhere.com> - 2020-12-20 18:22 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 10:00 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-19 15:21 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 19:30 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 19:42 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) olcott <NoOne@NoWhere.com> - 2020-12-19 20:01 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Mathematical Mapping) olcott <NoOne@NoWhere.com> - 2020-12-20 12:19 -0600
                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-19 19:54 -0600
                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-20 18:41 -0600
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-20 16:43 -0800
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-20 20:37 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-20 21:55 -0600
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2020-12-20 20:05 -0800
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-21 04:44 +0000
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-20 23:06 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 12:39 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-21 19:31 +0000
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 14:52 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-21 21:55 +0000
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 13:08 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 14:57 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-21 21:59 +0000
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 16:52 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 16:53 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-22 01:25 +0000
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 09:39 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 10:57 -0600
                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-22 17:03 +0000
                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 11:46 -0600
                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-22 18:37 +0000
                                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 12:57 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 13:44 -0600
                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 14:18 -0600
                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-22 21:23 +0000
                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-23 11:40 -0600
                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 14:34 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-21 12:34 -0600
                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) olcott <NoOne@NoWhere.com> - 2020-12-22 20:25 -0600
                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-23 14:45 -0600
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-23 20:54 +0000
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-23 16:27 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-23 23:10 +0000
                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-23 16:43 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-23 21:42 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-24 11:36 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-24 17:43 +0000
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-24 11:51 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Halt_Decider c++ class) olcott <NoOne@NoWhere.com> - 2020-12-24 13:20 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-24 22:27 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-26 14:10 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP decidability thesis) olcott <NoOne@NoWhere.com> - 2020-12-26 15:42 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Exercise) olcott <NoOne@NoWhere.com> - 2020-12-26 14:40 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Exercise) olcott <NoOne@NoWhere.com> - 2020-12-29 09:43 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-24 18:00 +0000
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-24 12:12 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-24 19:25 +0000
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-24 14:01 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) olcott <NoOne@NoWhere.com> - 2020-12-26 15:35 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-26 22:29 +0000
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (stupid dishonest or both) olcott <NoOne@NoWhere.com> - 2020-12-26 17:25 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (stupid dishonest or both) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-27 00:48 +0000
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (stupid dishonest or both) olcott <NoOne@NoWhere.com> - 2020-12-26 20:04 -0600
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (stupid dishonest or both) olcott <NoOne@NoWhere.com> - 2020-12-26 21:38 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (stupid dishonest or both) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-27 05:04 +0000
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP criteria) olcott <NoOne@NoWhere.com> - 2020-12-28 13:17 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP criteria) olcott <NoOne@NoWhere.com> - 2020-12-28 14:03 -0600
                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP criteria) olcott <NoOne@NoWhere.com> - 2020-12-28 18:17 -0600
                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axioms) olcott <NoOne@NoWhere.com> - 2020-12-29 09:16 -0600
                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axioms) olcott <NoOne@NoWhere.com> - 2020-12-29 11:00 -0600
                                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-30 15:17 -0600
                                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-30 15:52 -0600
                                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-30 22:34 -0600
                                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-30 22:54 -0600
                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-31 05:26 +0000
                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-30 23:47 -0600
                                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-31 09:58 +0000
                                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-31 08:49 -0600
                                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider decides H_Hat() correctly) olcott <NoOne@NoWhere.com> - 2020-12-31 11:18 -0600
                                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-31 18:09 +0000
                                                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-31 16:17 -0600
                                                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2020-12-31 18:22 -0600
                                                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2020-12-31 21:14 -0600
                                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-01 03:32 +0000
                                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2020-12-31 21:47 -0600
                                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2020-12-31 23:26 -0600
                                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 11:01 -0600
                                                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 12:24 -0600
                                                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 13:59 -0600
                                                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 16:15 -0600
                                                                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 17:02 -0600
                                                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 13:39 -0600
                                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 13:46 -0600
                                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 11:16 -0600
                                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---] olcott <NoOne@NoWhere.com> - 2021-01-01 12:50 -0600
                                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ] olcott <NoOne@NoWhere.com> - 2021-01-01 17:57 -0600
                                                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ] olcott <NoOne@NoWhere.com> - 2021-01-01 18:56 -0600
                                                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ] olcott <NoOne@NoWhere.com> - 2021-01-02 09:31 -0600
                                                                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ] olcott <NoOne@NoWhere.com> - 2021-01-02 10:05 -0600
                                                                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ] olcott <NoOne@NoWhere.com> - 2021-01-02 11:53 -0600
                                                                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ revised non-halting criteria is not pathological ] olcott <NoOne@NoWhere.com> - 2021-01-02 13:33 -0600
                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated) olcott <NoOne@NoWhere.com> - 2020-12-31 08:53 -0600
                                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (solving the HP is possible) olcott <NoOne@NoWhere.com> - 2020-12-31 11:29 -0600
                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (solving the HP is possible) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-31 18:10 +0000
                                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (solving the HP is possible) olcott <NoOne@NoWhere.com> - 2020-12-31 15:48 -0600
                                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (solving the HP is possible) olcott <NoOne@NoWhere.com> - 2020-12-31 18:06 -0600
                                                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (solving the HP is possible) olcott <NoOne@NoWhere.com> - 2020-12-31 20:35 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-29 03:15 +0000
                                                              Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (pathological self-reference) olcott <NoOne@NoWhere.com> - 2020-12-29 10:45 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) Jeff Barnett <jbb@notatt.com> - 2020-12-26 17:35 -0700
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ double sqrt(X) ] olcott <NoOne@NoWhere.com> - 2020-12-26 21:20 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ double sqrt(X) ] olcott <NoOne@NoWhere.com> - 2020-12-28 13:00 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ double sqrt(X) ] olcott <NoOne@NoWhere.com> - 2020-12-28 13:35 -0600
                                                      Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ double sqrt(X) ] olcott <NoOne@NoWhere.com> - 2020-12-28 17:59 -0600
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ double sqrt(X) ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-29 03:35 +0000
                                                        Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ three modes ] olcott <NoOne@NoWhere.com> - 2020-12-29 10:17 -0600
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ three modes ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-29 17:17 +0000
                                                          Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ three modes ] olcott <NoOne@NoWhere.com> - 2020-12-29 11:24 -0600
                                                            Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ three modes ] Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-29 18:37 +0000
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Functions do not always return values) olcott <NoOne@NoWhere.com> - 2020-12-28 12:44 -0600
                                                Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (essence of my solution) olcott <NoOne@NoWhere.com> - 2020-12-29 10:00 -0600
                                                  Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP proof criteria is a cheap trick) olcott <NoOne@NoWhere.com> - 2020-12-29 11:08 -0600
                                                    Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP proof criteria is a cheap trick) Kaz Kylheku <563-365-8930@kylheku.com> - 2020-12-29 18:12 +0000
                            Re: Happy Thanksgiving to all (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 15:24 -0600
                            Re: Happy Thanksgiving to all (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 20:36 -0600
                              Re: Happy Thanksgiving to all (Ben is proven wrong by the actual facts) olcott <NoOne@NoWhere.com> - 2020-12-02 21:00 -0600
                                Re: Happy Thanksgiving to all (Ben is proven wrong by the actual facts) Jeff Barnett <jbb@notatt.com> - 2020-12-02 21:23 -0700
                  Re: Happy Thanksgiving to all (logical necessity) Jeff Barnett <jbb@notatt.com> - 2020-11-28 17:34 -0700
                    Re: Happy Thanksgiving to all (logical necessity) olcott <NoOne@NoWhere.com> - 2020-11-28 19:03 -0600
    Re: Happy Thanksgiving to all Kaz Kylheku <563-365-8930@kylheku.com> - 2020-11-30 20:27 +0000
      Re: Happy Thanksgiving to all (infinite recursion slaps them in the face) olcott <NoOne@NoWhere.com> - 2020-11-30 16:57 -0600

Page 19 of 21 — ← Prev page 1 … 17 18 [19] 20 21  Next page →


#2442 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-31 18:09 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated)
Message-ID<20201231091305.242@kylheku.com>
In reply to#2437
["Followup-To:" header set to comp.theory.]
On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
> On 12/31/2020 3:58 AM, Kaz Kylheku wrote:
>> ["Followup-To:" header set to comp.theory.]
>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>> On 12/30/2020 11:26 PM, Kaz Kylheku wrote:
>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>> None-the-less for all of the simplest possible encodings of the
>>>>> conventional halting problem counter-examples the halt decider does
>>>>> decide correctly.
>>>>
>>>> Does not; it outputs 0 ("H_Hat(H_Hat) does not halt") when a direct call
>>>> to H_Hat((u32) H_Hat) halts.
>>>>
>>>
>>> I decided the most transparent way to handle this was to have three halt
>>> deciding modes: (a) disabled (b) global (c) local.
>> 
>> The most transparent way to handle this is not to have any modes and
>> just recognize the truth in the halting theorem, like a mature
>> intellectual.
>> 
>
> My halt decider does decide  this function correctly:
>
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>
>    if (Input_Halts)
>      HERE: goto HERE;
>    else
>      HALT
> }

No, it doesn't. If the first thing we do in  main() is call
this function with H_Hat as its argument, it reaches the HALT
instruction.

If main() calls Halts((u32) H_Hat, (u32) H_Hat), it returns
zero. The correct result is nonzero.

> When you can see the 220 page execution trace of each of the three modes 
> deciding:
>
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>
>    if (Input_Halts)
>      HERE: goto HERE;
>    else
>      HALT
> }

What you're missing is verifying that an actual call to H_Hat(H_Hat), in
each execution mode, matches what the decider is saying in that
respective mode.

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

This program neglects to test the return value of H_Hat by failing
to report it. You're deliberately avoiding the truth.

> Using the local halt decider the above two computations are not the 
> same.

If by that you mean that the two calls to Halts(H_Hat, H_Hat) are
distinguishable from each other in any way, that's invalid;
"local" mode is an incorrect execution model.

In the mathematics, whenever we see the same syntax of a function
call like f(a, b), it denotes exactly the same thing, with exactly the
same properties. The halting proof is about mathematics.

Or, if you prefer the Turing Machine view: a call like f(a, b)
corresponds to a specific Turing Machine: a tape with specific contents
loaded into the rigid mechanism, which carries out exactly the same
steps for that same tape.

> The decision point of the second computation is out-of-sync with 
> the decision point of the first computation by one recursion level.

No, it isn't, because H_Hat doesn't simulate Halts. H_Hat makes a
simple, direct call to Halts.

(In fact, your C compiler can inline H_Hat into main!)

In any case, we can eliminate the difference in activation levels using this
program structure:

 void H_Hat(u32 P)
 {
    u32 Input_Halts = Halts(P, P);

    Output("H_Hat: Input_Halts =", Input_Halts);

    if (Input_Halts)
      HERE: goto HERE;
    else
      HALT
 }

 void Halts_Wrapper(u32 P)
 {
    u32 Input_Halts = Halts(P, P);

    Output("Halts_Wrapper: Input_Halts =", Input_Halts);
 }

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

There can be no difference between the two calls to Halts(P, P) If Halts
behaves differently in the two situations, there is something invalid going on
which is not relevant to the halting theorem, because Halts is not a Turing
machine.

No difference means that output values traced in both functions, if
both Output calls are reached, should be the same.

> When we run the disabled halt decider neither of the two lines above 
> would halt.

If neither of the lines halt, and one of those lines is Halts(H_Hat, H_Hat),
that shows that Halts is failing to decide. The correct answer is 0,
since the second line doesn't halt.

> When we run the global halt decider the second line is 
> terminated for infinite recursion.

1. Where is the evidence that the second line is reached?
   If so, it means that Halts returned a value to main.

2. You're not logging the value returned to main. Doing so would not only
   confirm the value, but the fact that Halts returned, as required, and that
   the second line is being reached.

3. If Halts returned to main, why wouldn't it return to H_Hat?

>> Yes; even without your explicit admission here, it's obvious that you
>> don't test because you think you know better.
>> 
>> Unfortunately, it does something other than what you think.
>
> I spent a month studying this case six months before I began disclosing 
> these details on this forum. I know how it works, why it works this way 
> and why the halt decider is correct.

Even smart engineers don't know everything about how their code works.

The authors of SSL didn't know about heartbleed.

Intel engineers didn't predict Spectre and Meltdown.

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

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


#2445 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-31 16:17 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (halt decider axiom has been validated)
Message-ID<JaGdnUEZMK170HPCnZ2dnUU7-LXNnZ2d@giganews.com>
In reply to#2442
On 12/31/2020 12:09 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>> On 12/31/2020 3:58 AM, Kaz Kylheku wrote:
>>> ["Followup-To:" header set to comp.theory.]
>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>> On 12/30/2020 11:26 PM, Kaz Kylheku wrote:
>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>> None-the-less for all of the simplest possible encodings of the
>>>>>> conventional halting problem counter-examples the halt decider does
>>>>>> decide correctly.
>>>>>
>>>>> Does not; it outputs 0 ("H_Hat(H_Hat) does not halt") when a direct call
>>>>> to H_Hat((u32) H_Hat) halts.
>>>>>
>>>>
>>>> I decided the most transparent way to handle this was to have three halt
>>>> deciding modes: (a) disabled (b) global (c) local.
>>>
>>> The most transparent way to handle this is not to have any modes and
>>> just recognize the truth in the halting theorem, like a mature
>>> intellectual.
>>>
>>
>> My halt decider does decide  this function correctly:
>>
>> void H_Hat(u32 P)
>> {
>>     u32 Input_Halts = Halts(P, P);
>>
>>     if (Input_Halts)
>>       HERE: goto HERE;
>>     else
>>       HALT
>> }
> 
> No, it doesn't. If the first thing we do in  main() is call
> this function with H_Hat as its argument, it reaches the HALT
> instruction.
> 
> If main() calls Halts((u32) H_Hat, (u32) H_Hat), it returns
> zero. The correct result is nonzero.
> 
>> When you can see the 220 page execution trace of each of the three modes
>> deciding:
>>
>> void H_Hat(u32 P)
>> {
>>     u32 Input_Halts = Halts(P, P);
>>
>>     if (Input_Halts)
>>       HERE: goto HERE;
>>     else
>>       HALT
>> }
> 
> What you're missing is verifying that an actual call to H_Hat(H_Hat), in
> each execution mode, matches what the decider is saying in that
> respective mode.
> 
>> int main()
>> {
>>     Halts((u32)H_Hat, (u32)H_Hat);
>>     H_Hat((u32)H_Hat);
>> }
> 

When the halt decider decides infinite recursion it is saying that 
unless the recursion is halted at some point the recursion will be 
infinite.

It was a design choice to have the halt decider report infinite 
recursion as soon as it detects infinite recursion.

In the above example Halts detects infinite recursion before H_Hat 
begins to execute on the first line and immediately after H_Hat has 
executed on the second line.

The only reason H_Hat halts on the second line is that Halts() kills its 
otherwise infinite recursion.

These nuanaces seem to be above your capacity to understand.

-- 
Copyright 2020 Pete Olcott

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

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


#2447 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2020-12-31 18:22 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<7ZGdnd5JIPaw9nPCnZ2dnUU7-K3NnZ2d@giganews.com>
In reply to#2445
On 12/31/2020 4:38 PM, Richard Damon wrote:
> On 12/31/20 5:17 PM, olcott wrote:
>> On 12/31/2020 12:09 PM, Kaz Kylheku wrote:
>>> ["Followup-To:" header set to comp.theory.]
>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>> On 12/31/2020 3:58 AM, Kaz Kylheku wrote:
>>>>> ["Followup-To:" header set to comp.theory.]
>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 12/30/2020 11:26 PM, Kaz Kylheku wrote:
>>>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> None-the-less for all of the simplest possible encodings of the
>>>>>>>> conventional halting problem counter-examples the halt decider does
>>>>>>>> decide correctly.
>>>>>>>
>>>>>>> Does not; it outputs 0 ("H_Hat(H_Hat) does not halt") when a
>>>>>>> direct call
>>>>>>> to H_Hat((u32) H_Hat) halts.
>>>>>>>
>>>>>>
>>>>>> I decided the most transparent way to handle this was to have three
>>>>>> halt
>>>>>> deciding modes: (a) disabled (b) global (c) local.
>>>>>
>>>>> The most transparent way to handle this is not to have any modes and
>>>>> just recognize the truth in the halting theorem, like a mature
>>>>> intellectual.
>>>>>
>>>>
>>>> My halt decider does decide  this function correctly:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>      u32 Input_Halts = Halts(P, P);
>>>>
>>>>      if (Input_Halts)
>>>>        HERE: goto HERE;
>>>>      else
>>>>        HALT
>>>> }
>>>
>>> No, it doesn't. If the first thing we do in  main() is call
>>> this function with H_Hat as its argument, it reaches the HALT
>>> instruction.
>>>
>>> If main() calls Halts((u32) H_Hat, (u32) H_Hat), it returns
>>> zero. The correct result is nonzero.
>>>
>>>> When you can see the 220 page execution trace of each of the three modes
>>>> deciding:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>      u32 Input_Halts = Halts(P, P);
>>>>
>>>>      if (Input_Halts)
>>>>        HERE: goto HERE;
>>>>      else
>>>>        HALT
>>>> }
>>>
>>> What you're missing is verifying that an actual call to H_Hat(H_Hat), in
>>> each execution mode, matches what the decider is saying in that
>>> respective mode.
>>>
>>>> int main()
>>>> {
>>>>      Halts((u32)H_Hat, (u32)H_Hat);
>>>>      H_Hat((u32)H_Hat);
>>>> }
>>>
>>
>> When the halt decider decides infinite recursion it is saying that
>> unless the recursion is halted at some point the recursion will be
>> infinite.
>>
>> It was a design choice to have the halt decider report infinite
>> recursion as soon as it detects infinite recursion.
>>
>> In the above example Halts detects infinite recursion before H_Hat
>> begins to execute on the first line and immediately after H_Hat has
>> executed on the second line.
>>
>> The only reason H_Hat halts on the second line is that Halts() kills its
>> otherwise infinite recursion.
>>
>> These nuanaces seem to be above your capacity to understand.
>>
> 
> But is your Halts actually a Halting decider??
> 
> When Halts abort the infinite recursion and returns the answer, it turns
> out wrong.
> 
> If you are deciding a different question, then you need to be clear
> about that, and not try to claim that you are working on the classical
> halting decider,
> 

As long as I show that it can no longer be proven that all inputs cannot 
be divided into those having the property of infinite execution and 
those not having that property then I have refuted the halting problem 
undecidability proofs even if I did this by correcting their incorrect 
halt deciding criteria.

When-so-ever the conclusion of a proof is refuted by what-so-ever means 
then the proof too has also been refuted.

> Note, you are deciding that if Halts didn't stop the recursion, the
> recursion would be infinite, but are ignoring the fact that Halt MUST
> stop the recusion to meet its requirements, and H_Hat is allowed to
> depend on that fact. This means that the recursion really isn't infinite
> (or Halts fails to meet the requirements of being a decider).
> 

Inputs meeting this criteria have the property of infinite execution:

On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
 > A computation that would not halt if its simulation were not
 > halted is indeed a non-halting computation.

On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
 > Every computation that would not halt if its simulation
 > were not halted is by logical necessity a non-halting computation.

If the criteria was: Does the input halt on its input?
we conflate together inputs that halt on their own with inputs that must 
have their simulation stopped thus defining halt deciding criteria that 
has no correct answer.

Only when we remove the Pathological self-reference(Olcott 2004) from 
the halt deciding criteria do we define criteria that can be met.

comp.theory Peter Olcott Sep 5, 2004, 11:21:57 AM
The Liar Paradox can be shown to be nothing more than
a incorrectly formed statement because of its pathological
self-reference. The Halting Problem can only exist because
of this same sort of pathological self-reference.
https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ

-- 
Copyright 2020 Pete Olcott

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

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


#2449 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2020-12-31 21:14 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<1-OdnZWZhbkCDnPCnZ2dnUU7-SPNnZ2d@giganews.com>
In reply to#2447
On 12/31/2020 8:23 PM, Richard Damon wrote:
> On 12/31/20 7:22 PM, olcott wrote:
>> On 12/31/2020 4:38 PM, Richard Damon wrote:
>>> On 12/31/20 5:17 PM, olcott wrote:
>>>> On 12/31/2020 12:09 PM, Kaz Kylheku wrote:
>>>>> ["Followup-To:" header set to comp.theory.]
>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 12/31/2020 3:58 AM, Kaz Kylheku wrote:
>>>>>>> ["Followup-To:" header set to comp.theory.]
>>>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> On 12/30/2020 11:26 PM, Kaz Kylheku wrote:
>>>>>>>>> On 2020-12-31, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> None-the-less for all of the simplest possible encodings of the
>>>>>>>>>> conventional halting problem counter-examples the halt decider
>>>>>>>>>> does
>>>>>>>>>> decide correctly.
>>>>>>>>>
>>>>>>>>> Does not; it outputs 0 ("H_Hat(H_Hat) does not halt") when a
>>>>>>>>> direct call
>>>>>>>>> to H_Hat((u32) H_Hat) halts.
>>>>>>>>>
>>>>>>>>
>>>>>>>> I decided the most transparent way to handle this was to have three
>>>>>>>> halt
>>>>>>>> deciding modes: (a) disabled (b) global (c) local.
>>>>>>>
>>>>>>> The most transparent way to handle this is not to have any modes and
>>>>>>> just recognize the truth in the halting theorem, like a mature
>>>>>>> intellectual.
>>>>>>>
>>>>>>
>>>>>> My halt decider does decide  this function correctly:
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>>       u32 Input_Halts = Halts(P, P);
>>>>>>
>>>>>>       if (Input_Halts)
>>>>>>         HERE: goto HERE;
>>>>>>       else
>>>>>>         HALT
>>>>>> }
>>>>>
>>>>> No, it doesn't. If the first thing we do in  main() is call
>>>>> this function with H_Hat as its argument, it reaches the HALT
>>>>> instruction.
>>>>>
>>>>> If main() calls Halts((u32) H_Hat, (u32) H_Hat), it returns
>>>>> zero. The correct result is nonzero.
>>>>>
>>>>>> When you can see the 220 page execution trace of each of the three
>>>>>> modes
>>>>>> deciding:
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>>       u32 Input_Halts = Halts(P, P);
>>>>>>
>>>>>>       if (Input_Halts)
>>>>>>         HERE: goto HERE;
>>>>>>       else
>>>>>>         HALT
>>>>>> }
>>>>>
>>>>> What you're missing is verifying that an actual call to
>>>>> H_Hat(H_Hat), in
>>>>> each execution mode, matches what the decider is saying in that
>>>>> respective mode.
>>>>>
>>>>>> int main()
>>>>>> {
>>>>>>       Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>       H_Hat((u32)H_Hat);
>>>>>> }
>>>>>
>>>>
>>>> When the halt decider decides infinite recursion it is saying that
>>>> unless the recursion is halted at some point the recursion will be
>>>> infinite.
>>>>
>>>> It was a design choice to have the halt decider report infinite
>>>> recursion as soon as it detects infinite recursion.
>>>>
>>>> In the above example Halts detects infinite recursion before H_Hat
>>>> begins to execute on the first line and immediately after H_Hat has
>>>> executed on the second line.
>>>>
>>>> The only reason H_Hat halts on the second line is that Halts() kills its
>>>> otherwise infinite recursion.
>>>>
>>>> These nuanaces seem to be above your capacity to understand.
>>>>
>>>
>>> But is your Halts actually a Halting decider??
>>>
>>> When Halts abort the infinite recursion and returns the answer, it turns
>>> out wrong.
>>>
>>> If you are deciding a different question, then you need to be clear
>>> about that, and not try to claim that you are working on the classical
>>> halting decider,
>>>
>>
>> As long as I show that it can no longer be proven that all inputs cannot
>> be divided into those having the property of infinite execution and
>> those not having that property then I have refuted the halting problem
>> undecidability proofs even if I did this by correcting their incorrect
>> halt deciding criteria.
>>
>> When-so-ever the conclusion of a proof is refuted by what-so-ever means
>> then the proof too has also been refuted.
>>
>>> Note, you are deciding that if Halts didn't stop the recursion, the
>>> recursion would be infinite, but are ignoring the fact that Halt MUST
>>> stop the recusion to meet its requirements, and H_Hat is allowed to
>>> depend on that fact. This means that the recursion really isn't infinite
>>> (or Halts fails to meet the requirements of being a decider).
>>>
>>
>> Inputs meeting this criteria have the property of infinite execution:
>>
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
> 
> But the simulation of H_Hat does NOT need to be halted (unless Halts
> fails to meet its requirement to decide in finite time). It is only
> because of your faulty logic that you think it does, In actuality,
> either Halts fails to meet it requirement, possibly because it fails to
> abort its simulation of H_Hat, to return an answer to H_Hat, or it it
> does, it turns out that its answer is wrong.
> 
> You conflate the inadequacy of Halts to come up with the right answer
> for H_Hat having non_halting behavior.
>>
>> On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
>>> Every computation that would not halt if its simulation
>>> were not halted is by logical necessity a non-halting computation.
>>
>> If the criteria was: Does the input halt on its input?
>> we conflate together inputs that halt on their own with inputs that must
>> have their simulation stopped thus defining halt deciding criteria that
>> has no correct answer.
> 
> Not at all. A Halting decider does NOT need to be just a simulator with
> non-halting behavior detection. Maybe your example can be used as proof
> that this does not work.
> 
> There are many Halt Decider structures that can handle other
> self-referential machine definitions, so there is no 'necessity' to say
> that there is something wrong with self-referential machines.
> 

I have been studying pathological self-reference since 2004. There is 
nothing that can correctly handle it because it is a semantic error.
It is comparble to asking the question: What time is it yes or no?

> Note, that the ability to make such a self-referential machine is an

Pathological self-reference is self-reference of a declarative sentence 
of natural language or a proposition of formal language that prevents 
this declarative sentence or proposition from being resolved to a 
Boolean value.

> important property of Turing Machines, as without that it may not be
> possible to express all possible computations. (It is one thing that
> completes Turing completeness). Since Turing Machines CAN be self
> referential, a Universal Halting Decider also needs to be able to handle
> them, and is one thing that makes it easy to prove that there is no such
> thing as a Universal Halting Decider.
>>
>> Only when we remove the Pathological self-reference(Olcott 2004) from
>> the halt deciding criteria do we define criteria that can be met.
> 
> But then you are NOT answer the Halting Problem question.
> 
>>
>> comp.theory Peter Olcott Sep 5, 2004, 11:21:57 AM
>> The Liar Paradox can be shown to be nothing more than
>> a incorrectly formed statement because of its pathological
>> self-reference. The Halting Problem can only exist because
>> of this same sort of pathological self-reference.
>> https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ
>>
> 
> Self Reference is NOT pathological, but is an important property to
> express the fullness of mathematics and logic.
> 
> Yes, once your logic system allows this sort of self reference, you get
> properties like incompleteness which seems to be something you do not
> like. But it is important to fully be able to describe the infinity of
> mathematics.
> 
> 
> You really need to make up your mind. Either you are dealing with the
> classical Halting Problem, in which case you need to work within the
> rules of that problem, or you admit that you are working on a different
> problem, at which point you need to stop presuming your answers have any
> bearing on those classical problems.
> 

You must be far too dumb to realize that refuting the conclusion of a 
proof refutes the proof.

A universal halt decider only needs to divide all of its inputs into 
those having the property of infinite execution and those that do not 
have this property.

The proofs conclude that they have proved that no such halt decider can 
possibly exist.

Inputs that match the following criteria ARE NON-HALTING INPUTS !!!

On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
 > A computation that would not halt if its simulation were not
 > halted is indeed a non-halting computation.

On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
 > Every computation that would not halt if its simulation
 > were not halted is by logical necessity a non-halting computation.

It is like I am saying that we can know for sure that black cats are 
black and you are disagreeing.

When we can know that a statement is true entirely on the basis of the 
meaning of its words then we have perfectly justified complete certainty 
that the statement is true.

--Every computation that would not halt if its simulation
--were not halted is by logical necessity a non-halting computation.

--Every computation that would not halt if its simulation
--were not halted is by logical necessity a non-halting computation.

--Every computation that would not halt if its simulation
--were not halted is by logical necessity a non-halting computation.

--Every computation that would not halt if its simulation
--were not halted is by logical necessity a non-halting computation.

--Every computation that would not halt if its simulation
--were not halted is by logical necessity a non-halting computation.


> You are fully able to strike out on a new problem and change whatever
> assumptions you want to make, even the nature of what is Truth. Just
> realize that when you change basic definitions you lose the ability to
> directly state things about statements based on the classical
> definitions, and you need to take care what you take in from the
> classics, to make sure that the properties they talk about still apply.
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2450 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-01 03:32 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<20201231191919.397@kylheku.com>
In reply to#2449
On 2021-01-01, olcott <NoOne@NoWhere.com> wrote:
> I have been studying pathological self-reference since 2004. There is 
> nothing that can correctly handle it because it is a semantic error.

In the case of the Liar Paradox, that may be so. We cannot assign a
truth value to the sentence.

In the case of the halting problem proofs, here is no pathology;
it's perfectly okay to ask a decider about any program whatsoever, even
one which (1) takes itself as input and (2) feeds it to the decider.

There is no problem with assigning a truth value to any proposition.
Halts either fails to return, or else returns a stable value: true or
false. There is no pathological feedback which makes it impossible to
assign that truth value.

Moreover, that value has an interpretation which is always incorrect;
that's another certainty.

A situation with truth values and interpretations which are certain
cannot be called pathological.

> It is comparble to asking the question: What time is it yes or no?

That question only has a problem of type, since time isn't Boolean.

There is no such syntactic problem in the halting question. The
problem doesn't insist on an answer whose type doesn't make sense.

>> Note, that the ability to make such a self-referential machine is an
>
> Pathological self-reference is self-reference of a declarative sentence 
> of natural language or a proposition of formal language that prevents 
> this declarative sentence or proposition from being resolved to a 
> Boolean value.

Precisely; see above.

We have no problem resolving anything to Boolean values in the
common proof schema of halting undecidability.

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

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


#2451 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2020-12-31 21:47 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<YrmdnVnvMb_tBnPCnZ2dnUU7-b3NnZ2d@giganews.com>
In reply to#2450
On 12/31/2020 9:32 PM, Kaz Kylheku wrote:
> On 2021-01-01, olcott <NoOne@NoWhere.com> wrote:
>> I have been studying pathological self-reference since 2004. There is
>> nothing that can correctly handle it because it is a semantic error.
> 
> In the case of the Liar Paradox, that may be so. We cannot assign a
> truth value to the sentence.
> 
> In the case of the halting problem proofs, here is no pathology;


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

Do the opposite of what-ever the halt decider decides is the exact same
Pathological self-reference(Olcott 2004) as the liar paradox.

Only when this Pathological self-reference(Olcott 2004) is removed by 
the following criteria:

On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
 > Every computation that would not halt if its simulation
 > were not halted is by logical necessity a non-halting computation.

Can inputs be divided into those having the property of infinite 
execution and those not having this property.

In my solution both of these inputs halt. The first one must be forced 
to halt and the second one halts on its own. When we use the original 
criteria: Does the input halt on its input? we cannot define a halt decider.

> it's perfectly okay to ask a decider about any program whatsoever, even
> one which (1) takes itself as input and (2) feeds it to the decider.
> 
> There is no problem with assigning a truth value to any proposition.

LP := ~True(LP) // What is its truth value?

> Halts either fails to return, or else returns a stable value: true or
> false. There is no pathological feedback which makes it impossible to
> assign that truth value.
> 
> Moreover, that value has an interpretation which is always incorrect;
> that's another certainty.
> 
> A situation with truth values and interpretations which are certain
> cannot be called pathological.
> 
>> It is comparble to asking the question: What time is it yes or no?
> 
> That question only has a problem of type, since time isn't Boolean.
> 
> There is no such syntactic problem in the halting question. The
> problem doesn't insist on an answer whose type doesn't make sense.


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

Which of {true, false} is the correct value that Halts() could return to 
H_Hat()?

sci.lang
Peter Olcott Feb 20, 2015, 11:38:48 AM

The logical law of polar questions

When posed to a man whom has never been married,
the question: Have you stopped beating your wife?
Is an incorrect polar question because neither yes nor
no is a correct answer.

All polar questions (including incorrect polar questions)
have exactly one answer from the following:
1) No
2) Yes
3) Neither // Only applies to incorrect polar questions

As far as I know I am the original discoverer of the
above logical law, thus copyright 2015 by Peter Olcott.

https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ




>>> Note, that the ability to make such a self-referential machine is an
>>
>> Pathological self-reference is self-reference of a declarative sentence
>> of natural language or a proposition of formal language that prevents
>> this declarative sentence or proposition from being resolved to a
>> Boolean value.
> 
> Precisely; see above.
> 
> We have no problem resolving anything to Boolean values in the
> common proof schema of halting undecidability.
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2452 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2020-12-31 23:26 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<dsCdnXknlvY5L3PCnZ2dnUU7-WXNnZ2d@giganews.com>
In reply to#2449
On 12/31/2020 9:43 PM, Richard Damon wrote:
> On 12/31/20 10:14 PM, olcott wrote:
>> On 12/31/2020 8:23 PM, Richard Damon wrote:
>>>
>>>
>>> Self Reference is NOT pathological, but is an important property to
>>> express the fullness of mathematics and logic.
>>>
>>> Yes, once your logic system allows this sort of self reference, you get
>>> properties like incompleteness which seems to be something you do not
>>> like. But it is important to fully be able to describe the infinity of
>>> mathematics.
>>>
>>>
>>> You really need to make up your mind. Either you are dealing with the
>>> classical Halting Problem, in which case you need to work within the
>>> rules of that problem, or you admit that you are working on a different
>>> problem, at which point you need to stop presuming your answers have any
>>> bearing on those classical problems.
>>>
>>
>> You must be far too dumb to realize that refuting the conclusion of a
>> proof refutes the proof.
> 
> What about MY refuting YOUR proof. You conclusion has been shown to be
> wrong many times.
> 
>>
>> A universal halt decider only needs to divide all of its inputs into
>> those having the property of infinite execution and those that do not
>> have this property.
> 
> Yes, and if Halts is a decider, which means it returns its answer to its
> caller. (and that is the ONLY way a Turing Machine can give an answer,

Sure and like infinite loops that only loop ten times infinite recursion 
only recurs ten times, so whenever any function is invoked in infinite 
recursion it always returns the result to its caller after its tenth 
invocation.



-- 
Copyright 2020 Pete Olcott

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

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


#2453 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 11:01 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<bvmdnSuXzJsZyHLCnZ2dnUU7-evNnZ2d@giganews.com>
In reply to#2452
On 1/1/2021 10:29 AM, Andy Walker wrote:
> On 01/01/2021 15:21, olcott wrote:
>> A decider is not a program that autmatically corrects the bugs of
>> other programs. If a bug in another program prevents a decider from
>> returning a value then the value is not returned.
> 
>      Your program is entirely under your control, and is not
> directly concerned with any other program, buggy or otherwise,
> as what is has to determine is the halt status of a program
> described in its parameter.  That description cannot, of itself,
> prevent your program from returning a value, nor is your program
> required to correct its bugs.
> 
>      If your program does not return a value, then it is, by
> definition, not a decider.  It may still be a partial decider;
> but those are ten a penny.  Even useful partial deciders, unlike
> the toy examples given so often in this collection of threads.
> 
>      Little of this is relevant to your claims.  In order to
> show that the conventional proofs are incorrect, most of us would
> be happy if you could write a program "P" such that when asked
> about the program "P_hat" obtained from "P" by the standard
> construction, "P" returned the correct answer.  There should be
> no question of "P" aborting, 

If we hypothesize that a decider decides halting by simulating its input 
and we arbitrarily forbid this decider from stopping the simulation of 
this input when it detects infinite execution then we have arbitrarily 
eliminated an otherwise possible halt decider from basing its halt 
deciding decision on simulating its input.

As long as a halt decider divides its inputs into those having the 
property of infinite execution from those that do not have this property 
the conventional halting problem undecidability proofs have been refuted.

I really can't understand how people can possibly be so stupid that they 
cannot understand this, maybe it is not stupidity maybe it is dishonestly?

> nor of hidden states, nor of
> "infinite recursion" [which, if present, is an artifact of the
> way you choose to write "P"].  Thus far, you have failed, and
> most of us believe that you are doomed to perpetual failure
> [or perpetual trolling, if you prefer].
> 
> -- Andy Walker, Nottingham.
>     Andy's music pages: www.cuboid.me.uk/andy/Music
>     Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Balakirev


-- 
Copyright 2020 Pete Olcott

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

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


#2455 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 12:24 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<o9SdnXP698Bo9XLCnZ2dnUU7-fHNnZ2d@giganews.com>
In reply to#2453
On 1/1/2021 11:20 AM, André G. Isaak wrote:
> On 2021-01-01 10:01, olcott wrote:
>> On 1/1/2021 10:29 AM, Andy Walker wrote:
>>> On 01/01/2021 15:21, olcott wrote:
>>>> A decider is not a program that autmatically corrects the bugs of
>>>> other programs. If a bug in another program prevents a decider from
>>>> returning a value then the value is not returned.
>>>
>>>      Your program is entirely under your control, and is not
>>> directly concerned with any other program, buggy or otherwise,
>>> as what is has to determine is the halt status of a program
>>> described in its parameter.  That description cannot, of itself,
>>> prevent your program from returning a value, nor is your program
>>> required to correct its bugs.
>>>
>>>      If your program does not return a value, then it is, by
>>> definition, not a decider.  It may still be a partial decider;
>>> but those are ten a penny.  Even useful partial deciders, unlike
>>> the toy examples given so often in this collection of threads.
>>>
>>>      Little of this is relevant to your claims.  In order to
>>> show that the conventional proofs are incorrect, most of us would
>>> be happy if you could write a program "P" such that when asked
>>> about the program "P_hat" obtained from "P" by the standard
>>> construction, "P" returned the correct answer.  There should be
>>> no question of "P" aborting, 
>>
>> If we hypothesize that a decider decides halting by simulating its 
>> input and we arbitrarily forbid this decider from stopping the 
>> simulation of this input when it detects infinite execution then we 
>> have arbitrarily eliminated an otherwise possible halt decider from 
>> basing its halt deciding decision on simulating its input.
> 
> There's nothing arbitrary about the requirement that Halts() must always 
> return a value. That follows from the definition of what a decider is. 
> If you cannot construct a program which 'decides' halting by simulating 
> its input that can't always return a value because it gets stuck in an 
> infinite loop/recursion, that simply illustrates that simulation isn't 
> the right approach.
> 

Halts() can still return a value to another caller yet returning a value 
to a caller that invokes it in infinite recursion is a logic error 
because infinite recursion means that no value is ever returned to the 
caller.

> Arguing about whether a decider must always return a value is en par 
> with arguing about what a prime number is. 

Arguing that a function that was invoked in infinite recursion returns a 
value to its caller violates the definition of infinite recursion.

This shows logical incoherence between your interpretation of the 
definition of decider and the definition of infinite recursion.

> These are well-defined terms. 
> You don't get to redefine them to suit your whims. A decider is 
> *defined* as a program which is guaranteed to always halt in either an 
> accepting or rejecting state.
> 
>> I really can't understand how people can possibly be so stupid that 
>> they cannot understand this, maybe it is not stupidity maybe it is 
>> dishonestly?
> 
> Or maybe it's because you refuse to learn the actual meanings of the 
> terms you use? You can't sanely argue that a program which doesn't 
> always return a value is a decider anymore than you can argue that 18 is 
> a prime number.
> 
> André
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2459 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 13:59 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<-PWdnYbiKICr4nLCnZ2dnUU7-WHNnZ2d@giganews.com>
In reply to#2455
On 1/1/2021 12:39 PM, André G. Isaak wrote:
> On 2021-01-01 11:24, olcott wrote:
>> On 1/1/2021 11:20 AM, André G. Isaak wrote:
>>> On 2021-01-01 10:01, olcott wrote:
>>>> On 1/1/2021 10:29 AM, Andy Walker wrote:
>>>>> On 01/01/2021 15:21, olcott wrote:
>>>>>> A decider is not a program that autmatically corrects the bugs of
>>>>>> other programs. If a bug in another program prevents a decider from
>>>>>> returning a value then the value is not returned.
>>>>>
>>>>>      Your program is entirely under your control, and is not
>>>>> directly concerned with any other program, buggy or otherwise,
>>>>> as what is has to determine is the halt status of a program
>>>>> described in its parameter.  That description cannot, of itself,
>>>>> prevent your program from returning a value, nor is your program
>>>>> required to correct its bugs.
>>>>>
>>>>>      If your program does not return a value, then it is, by
>>>>> definition, not a decider.  It may still be a partial decider;
>>>>> but those are ten a penny.  Even useful partial deciders, unlike
>>>>> the toy examples given so often in this collection of threads.
>>>>>
>>>>>      Little of this is relevant to your claims.  In order to
>>>>> show that the conventional proofs are incorrect, most of us would
>>>>> be happy if you could write a program "P" such that when asked
>>>>> about the program "P_hat" obtained from "P" by the standard
>>>>> construction, "P" returned the correct answer.  There should be
>>>>> no question of "P" aborting, 
>>>>
>>>> If we hypothesize that a decider decides halting by simulating its 
>>>> input and we arbitrarily forbid this decider from stopping the 
>>>> simulation of this input when it detects infinite execution then we 
>>>> have arbitrarily eliminated an otherwise possible halt decider from 
>>>> basing its halt deciding decision on simulating its input.
>>>
>>> There's nothing arbitrary about the requirement that Halts() must 
>>> always return a value. That follows from the definition of what a 
>>> decider is. If you cannot construct a program which 'decides' halting 
>>> by simulating its input that can't always return a value because it 
>>> gets stuck in an infinite loop/recursion, that simply illustrates 
>>> that simulation isn't the right approach.
>>>
>>
>> Halts() can still return a value to another caller yet returning a 
>> value to a caller that invokes it in infinite recursion is a logic 
>> error because infinite recursion means that no value is ever returned 
>> to the caller.
>>
>>> Arguing about whether a decider must always return a value is en par 
>>> with arguing about what a prime number is. 
>>
>> Arguing that a function that was invoked in infinite recursion returns 
>> a value to its caller violates the definition of infinite recursion. >
>> This shows logical incoherence between your interpretation of the 
>> definition of decider and the definition of infinite recursion.
> 
> Nobody is arguing that a function that is infinitely recursive can 
> return a value to its caller. What's being argued here is that not every 
> function constitutes a 'decider'. To be a decider, a function must be 
> designed in such a way that no input can lead to infinite recursion or 
> an infinite loop. The fact that yours can lead to infinite recursion is 
> a problem with your design; it has no bearing on the meaning of 'decider'.
> 

That it detects this infinite recursion and aborts it is how it remains 
a decider. None-the-less no function can ever return any value to a 
caller that invoked it in infinite recursion.

When Halts detects that it has been invoked in infinite recursion it 
could simply transition to its own final state indicating non-halting 
input.

If H_Hat is waiting for a return value from a void function the compiler 
probably won't even compile the code.

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

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

It seems to make the most sense to require a decider such as Halts() to 
always return a value at least once.

It does not seem to make sense to require Halts() halts to return a 
value to its infinite invocation caller.

This is either a misunderstanding of the requirements of a decider or 
the requirements of a decider are logically incoherent.

> And this isn't *my* interpretation of the definition of 'decider'. This 
> term is precisely defined. It leaves no room for interpretation.
> 
> André
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2460 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 16:15 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<cqidnY-n0JGNAnLCnZ2dnUU7-QnNnZ2d@giganews.com>
In reply to#2459
On 1/1/2021 3:43 PM, Richard Damon wrote:
> On 1/1/21 2:59 PM, olcott wrote:
>> On 1/1/2021 12:39 PM, André G. Isaak wrote:
>>> On 2021-01-01 11:24, olcott wrote:
>>>> On 1/1/2021 11:20 AM, André G. Isaak wrote:
>>>>> On 2021-01-01 10:01, olcott wrote:
>>>>>> On 1/1/2021 10:29 AM, Andy Walker wrote:
>>>>>>> On 01/01/2021 15:21, olcott wrote:
>>>>>>>> A decider is not a program that autmatically corrects the bugs of
>>>>>>>> other programs. If a bug in another program prevents a decider from
>>>>>>>> returning a value then the value is not returned.
>>>>>>>
>>>>>>>       Your program is entirely under your control, and is not
>>>>>>> directly concerned with any other program, buggy or otherwise,
>>>>>>> as what is has to determine is the halt status of a program
>>>>>>> described in its parameter.  That description cannot, of itself,
>>>>>>> prevent your program from returning a value, nor is your program
>>>>>>> required to correct its bugs.
>>>>>>>
>>>>>>>       If your program does not return a value, then it is, by
>>>>>>> definition, not a decider.  It may still be a partial decider;
>>>>>>> but those are ten a penny.  Even useful partial deciders, unlike
>>>>>>> the toy examples given so often in this collection of threads.
>>>>>>>
>>>>>>>       Little of this is relevant to your claims.  In order to
>>>>>>> show that the conventional proofs are incorrect, most of us would
>>>>>>> be happy if you could write a program "P" such that when asked
>>>>>>> about the program "P_hat" obtained from "P" by the standard
>>>>>>> construction, "P" returned the correct answer.  There should be
>>>>>>> no question of "P" aborting,
>>>>>>
>>>>>> If we hypothesize that a decider decides halting by simulating its
>>>>>> input and we arbitrarily forbid this decider from stopping the
>>>>>> simulation of this input when it detects infinite execution then we
>>>>>> have arbitrarily eliminated an otherwise possible halt decider from
>>>>>> basing its halt deciding decision on simulating its input.
>>>>>
>>>>> There's nothing arbitrary about the requirement that Halts() must
>>>>> always return a value. That follows from the definition of what a
>>>>> decider is. If you cannot construct a program which 'decides'
>>>>> halting by simulating its input that can't always return a value
>>>>> because it gets stuck in an infinite loop/recursion, that simply
>>>>> illustrates that simulation isn't the right approach.
>>>>>
>>>>
>>>> Halts() can still return a value to another caller yet returning a
>>>> value to a caller that invokes it in infinite recursion is a logic
>>>> error because infinite recursion means that no value is ever returned
>>>> to the caller.
>>>>
>>>>> Arguing about whether a decider must always return a value is en par
>>>>> with arguing about what a prime number is.
>>>>
>>>> Arguing that a function that was invoked in infinite recursion
>>>> returns a value to its caller violates the definition of infinite
>>>> recursion. >
>>>> This shows logical incoherence between your interpretation of the
>>>> definition of decider and the definition of infinite recursion.
>>>
>>> Nobody is arguing that a function that is infinitely recursive can
>>> return a value to its caller. What's being argued here is that not
>>> every function constitutes a 'decider'. To be a decider, a function
>>> must be designed in such a way that no input can lead to infinite
>>> recursion or an infinite loop. The fact that yours can lead to
>>> infinite recursion is a problem with your design; it has no bearing on
>>> the meaning of 'decider'.
>>>
>>
>> That it detects this infinite recursion and aborts it is how it remains
>> a decider. None-the-less no function can ever return any value to a
>> caller that invoked it in infinite recursion.
> 
> IF it IS infinite recusion, then yes, it won't return to the caller
> because it never returns (and thus fails to be a decider). IF the
> function terminates the infinite recursion (so it can decide) then it
> CAN return to its caller, because it wasn't stuck in real infinite
> recursion, but the conditional in the decider stopped the recursion.

It must call the same function from the same machine address twice 
before the (otherwise) infinite recursion can be detected.

If the halt decider aborts its input just before this input makes a 
second call to Halts() then Halts() cannot return a value to its caller 
because the caller has already been aborted.

-- 
Copyright 2020 Pete Olcott

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

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


#2462 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 17:02 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<ZcednV9yYvJnNHLCnZ2dnUU7-dXNnZ2d@giganews.com>
In reply to#2460
On 1/1/2021 4:30 PM, Richard Damon wrote:
> On 1/1/21 5:15 PM, olcott wrote:
>> On 1/1/2021 3:43 PM, Richard Damon wrote:
>>> On 1/1/21 2:59 PM, olcott wrote:
>>>>
>>>> That it detects this infinite recursion and aborts it is how it remains
>>>> a decider. None-the-less no function can ever return any value to a
>>>> caller that invoked it in infinite recursion.
>>>
>>> IF it IS infinite recusion, then yes, it won't return to the caller
>>> because it never returns (and thus fails to be a decider). IF the
>>> function terminates the infinite recursion (so it can decide) then it
>>> CAN return to its caller, because it wasn't stuck in real infinite
>>> recursion, but the conditional in the decider stopped the recursion.
>>
>> It must call the same function from the same machine address twice
>> before the (otherwise) infinite recursion can be detected.
>>
>> If the halt decider aborts its input just before this input makes a
>> second call to Halts() then Halts() cannot return a value to its caller
>> because the caller has already been aborted.
>>
> 
> If Halts aborted it CALLER, then it committed suicide and failed to
> answer, and thus failed to answer, and just plain FAILED.
> 

I never ever said that it failed to answer. It is incorrect for it to 
return a value to a function that has called it infinite recursion.
The halt decider is designed to execute a function until it detects 
infinite execution or terminates on its own.

A wall a separation between the behavior of the program under test (PUT) 
and the behavior of the halt decider must be strictly maintained 
otherwise the halt decision becomes tainted by interference by the halt 
decider.

This requires the halt decider to immediately terminate the execution of 
program under test (PUT) as soon as the halt decider detects infinite 
execution.

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

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


> Halts will abort ITS simulation of the input, and return the answer to
> its caller, The fact that the input just happens to match its caller
> should be unknown (or at least doesn't matter) to Halts if it follows
> the rules.
> 
> You are confusing the various level of execution, perhaps because your
> machine design doesn't keep the actual machine being run seperate from
> the input to the decider.
> 
> I will note that you have described you decider as taking a COFF file as
> its input, but it doesn't, it takes an already loaded program. This
> helps promote such confusion, as you REALLY need to keep track of which
> invocation of that code you are taking about.
> 
> Halts aborts its simulation of its input, that is NOT its caller, even
> if that code is at the exact same memory address, as they are different
> execution contexts. (Which is one reason some have suggested that an
> indication of execution context should be include in your trace output),
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2457 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 13:39 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<1c6dnXc2ibnk53LCnZ2dnUU7-SnNnZ2d@giganews.com>
In reply to#2453
On 1/1/2021 1:02 PM, Andy Walker wrote:
> On 01/01/2021 17:01, olcott wrote:
> [I wrote:]
>>>      Little of this is relevant to your claims.  In order to
>>> show that the conventional proofs are incorrect, most of us would
>>> be happy if you could write a program "P" such that when asked
>>> about the program "P_hat" obtained from "P" by the standard
>>> construction, "P" returned the correct answer.  There should be
>>> no question of "P" aborting, 
>> If we hypothesize that a decider decides halting by simulating its
>> input and we arbitrarily forbid this decider from stopping the
>> simulation of this input when it detects infinite execution then we
>> have arbitrarily eliminated an otherwise possible halt decider from
>> basing its halt deciding decision on simulating its input.
> 
>      That's /your/ hypothesis, and /your/ forbidding.  There are
> ways to detect halting [or otherwise] other than simulation, and the
> obvious thing to do on detecting "infinite execution" is to report
> "Doesn't halt!" and stop, not to abort "P" and have no answer.  There

OK, I will do that. The halt decider never returns any value, and it 
never returns to main() is simply transitions to its own final state 
indicating not halting or halting.

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

This also means that the above function can be correctly decided because 
Halts() never ever returns any value to any caller thus H_Hat() cannot 
possibly do the opposite of whatever Halts() decides.

> is certainly no point in aborting "P".  Nor has anyone been saying
> that you should continue to simulate "P_hat" beyond the point where
> you are able to determine its status.
> 
>> As long as a halt decider divides its inputs into those having the
>> property of infinite execution from those that do not have this
>> property the conventional halting problem undecidability proofs have
>> been refuted.
> 
>      Provided that the division is correct, that would indeed
> show that the conventional proofs are incorrect.  

Yet both of these inputs halt:
(a) some halt on their own and
(b) some have been forced to halt,
thus the original halt decider criteria:
Does the input halt on its input?
   must be corrected to:
Does the input halt on its input without having its simulation aborted?


> But that is what
> you have [so far] failed to do.  See above.
> 
>> I really can't understand how people can possibly be so stupid that
>> they cannot understand this, maybe it is not stupidity maybe it is
>> dishonestly?
> 
>      Perhaps you should contemplate that at least some of the
> people here are neither stupid nor dishonest.  You cannot blame
> them for thinking that the boot is on the other foot.  See above.
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2458 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 13:46 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<qPGdnetz2tGA4XLCnZ2dnUU7-LHNnZ2d@giganews.com>
In reply to#2452
On 1/1/2021 1:00 PM, Kaz Kylheku wrote:
> On 2021-01-01, olcott <NoOne@NoWhere.com> wrote:
>> On 1/1/2021 5:01 AM, André G. Isaak wrote:
>>> You keep raising this point about loops and recursion as if it somehow
>>> obviates the need to return a value.
>>
>> Of course it does.
> 
> Speaking of returning, that's another thing.  Your system uses
> inconsistent conventions.  You've modeled H_Hat as a function which
> calls the HALT; instruction when it halts. That means "halt the entire
> program".
> 
> Yet the Halt() function simply returns a value when it halts.
> 
> I think this is a gratuitous consistency which detracts from the ability
> to reason about your work.
> 
> You must make your H_Hat and Halts follow the same conventions: either
> H_Hat should simply "return;" instead of "HALT;" or Halts should be
> changed so that it uses HALT to stop when it has made a decision (and,
> just before doing that, somehow indicates a true or false result).
> 

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

I had to use the other convention as a part of my task switching 
protocol. The original task switching protocol did not have anywhere for 
the simulated function to return to because each process had its own 
stack. Now the simulated code returns back to an exit point in the 
simulator.

>  From this point on, I no longer accept the validity of any of your work
> that uses a mixture of HALT and returning for halting, and encourage
> everyone to do the same.
> 
> I understand that you need to be able to simulate a function, and
> intercept when that function returns. I have some suggestions on how
> that may be handled:
> 
>    Alternative 1: DebugSimulate can use a machine-language stub to dispach
>    functions, something like:
> 
>      debugSimulateStub:
>         call [%eax]
>         halt
> 
>    Then we call DebugSimulate(P, I), it puts P into EAX and points IP to
>    debugSimulateStub. When halt occurs, the return value of P is in EAX.
> 
>    Alternative 2: DebugSimulate can intercept the RET instruction
>    specially. When processing RET, it can check the stack pointer
>    value. If ESP indicates that the top-level is returning, then
>    the simulation can halt. The return value is in EAX again.
>    When the stack pointer is below the top leve, then nothing is done;
>    RET just returns normally.
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2454 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 11:16 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<bYSdnYK-uahGxXLCnZ2dnUU7-QHNnZ2d@giganews.com>
In reply to#2449
On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> I have been studying pathological self-reference since 2004. There is
>> nothing that can correctly handle it because it is a semantic error.
>> It is comparable to asking the question: What time is it yes or no? 
> 
> Not this again.  Repeat after me: "every instance of the halting problem
> has a correct yes/no answer".
> 

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

Neither value from the set of {true, false} returned by Halts() to 
H_Hat() is correct in the same way that neither value from the set of 
{yes, no} is a correct answer to the question posed to a man that has 
never been married: Have you stopped beating your wife?

sci.lang
Peter Olcott Feb 20, 2015, 11:38:48 AM

The logical law of polar questions

When posed to a man whom has never been married,
the question: Have you stopped beating your wife?
Is an incorrect polar question because neither yes nor
no is a correct answer.

All polar questions (including incorrect polar questions)
have exactly one answer from the following:
1) No
2) Yes
3) Neither // Only applies to incorrect polar questions

As far as I know I am the original discoverer of the
above logical law, thus copyright 2015 by Peter Olcott.





https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ


-- 
Copyright 2020 Pete Olcott

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

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


#2456 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 12:50 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [---Pathological self-reference(Olcott 2004)---]
Message-ID<hLidnTmvq6xh83LCnZ2dnUU7-anNnZ2d@giganews.com>
In reply to#2454
On 1/1/2021 12:11 PM, André G. Isaak wrote:
> On 2021-01-01 10:16, olcott wrote:
>> On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> I have been studying pathological self-reference since 2004. There is
>>>> nothing that can correctly handle it because it is a semantic error.
>>>> It is comparable to asking the question: What time is it yes or no? 
>>>
>>> Not this again.  Repeat after me: "every instance of the halting problem
>>> has a correct yes/no answer".
>>>
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> Neither value from the set of {true, false} returned by Halts() to 
>> H_Hat() is correct
> 
> Nonsense. Either a program halts on a particular input or it doesn't. 
> For every program and every given input there is a correct answer.
> 

If we hypothetically assume that a halt decider can correctly divide all 
inputs into those having the property of infinite execution and those 
that do not this property the halt decider could report all of these 
inputs as halting because some of the inputs halt on their own and some 
of these inputs have to have their simulation aborted.

Reporting those inputs having the property of infinite execution and 
those that do not have this property would solve the halting problem.

Conflating together the ones that halted on their own and the ones that 
had to have their simulation aborted into inputs that halt would not 
solve the halting problem.

>> in the same way that neither value from the set of {yes, no} is a 
>> correct answer to the question posed to a man that has never been 
>> married: Have you stopped beating your wife?
> 
> Again, you really ought to think these things through. There *is* a 

I think that 20,000 hours is enough.

> correct answer to the above question. It is "no". This answer, however, 
> can be misleading because the question contains a presupposition. 

When we treat natural language as a mathematical formalism "no" is a 
logically incorrect answer because it contains a presupposition.

When we do not treat language as a as a mathematical formalism then the 
answer of "kinda, sorta, but, not really" could be contrued as correct.

The answer of "no" logically entails the false presupposition.
That linguists may disagree merely shows that linguists are not logicians.

> Ergo 
> the better answer would be "No, I don't have a wife", or "No, I don't 
> have a wife and if I did I wouldn't have started beating her in the 
> first place".
> 
> There is an enormous literature on presuppositions and presupposition 
> failure. You really ought to familiarize yourself with topics before you 
> make proclamations about them.
> 
> André



-- 
Copyright 2020 Pete Olcott

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

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


#2461 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 17:57 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]
Message-ID<PPSdnXks1KieKnLCnZ2dnUU7-bHNnZ2d@giganews.com>
In reply to#2454
On 1/1/2021 4:55 PM, Richard Damon wrote:
> On 1/1/21 5:20 PM, olcott wrote:
>> On 1/1/2021 4:05 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> I have been studying pathological self-reference since 2004. There is
>>>>>> nothing that can correctly handle it because it is a semantic error.
>>>>>> It is comparable to asking the question: What time is it yes or no?
>>>>>
>>>>> Not this again.  Repeat after me: "every instance of the halting
>>>>> problem
>>>>> has a correct yes/no answer".
>>>>>
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>     u32 Input_Halts = Halts(P, P);
>>>>     if (Input_Halts)
>>>>       HERE: goto HERE;
>>>>     return;
>>>> }
>>>>
>>>> Neither value from the set of {true, false} returned by Halts() to
>>>> H_Hat() is correct
>>>
>>> No, this is wrong, though you probably did not mean to say exactly that.
>> Yes I did mean exactly that and you knew damned well that I did mean
>> exactly that.
>>
>> If Halts returns true, that is the wrong answer because H_Hat() loops.
>> If Halts returns false, that is the wrong answer because H_Hat() halts.
>>
> 
> Right. that means that Halts can't be right, not that there is no answer
> to the halting state of H_Hat.
> 

It doesn't even mean that Halts() cannot be right. It does mean that 
Halts() must terminate its simulation of H_Hat() before making its 
halting decision.

As long as it is no longer possible to provide a counter example that 
cannot be determined to be placed in the category of inputs with the 
property of infinite execution or inputs without this property then the 
halting problem undecidability proofs have been refuted.

The term decider doesn't really have a standard meaning. In fact, it is 
lamentable that Sipser chose the terms decider and recognizer, since 
they seem to confuse students.

Intuitively, a decider should be a Turing machine that given an input, 
halts and either accepts or rejects, relaying its answer in one of many 
equivalent ways, such as halting at an ACCEPT or REJECT state, or 
leaving its answer on the output tape.
https://cs.stackexchange.com/questions/84433/what-is-decider

A decider is only required to make a decision for every input.
It typically does this at the end of its execution.

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

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

When Halts() returns its correct decision in main() this proves that it 
is a decider, any opinion to the contrary is simply misinformation.

-- 
Copyright 2020 Pete Olcott

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

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


#2463 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-01 18:56 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]
Message-ID<s9CdnWx8ovM1WXLCnZ2dnUU7-KHNnZ2d@giganews.com>
In reply to#2461
On 1/1/2021 6:31 PM, Richard Damon wrote:
> On 1/1/21 6:57 PM, olcott wrote:
>> On 1/1/2021 4:55 PM, Richard Damon wrote:
>>> On 1/1/21 5:20 PM, olcott wrote:
>>>> On 1/1/2021 4:05 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> I have been studying pathological self-reference since 2004.
>>>>>>>> There is
>>>>>>>> nothing that can correctly handle it because it is a semantic error.
>>>>>>>> It is comparable to asking the question: What time is it yes or no?
>>>>>>>
>>>>>>> Not this again.  Repeat after me: "every instance of the halting
>>>>>>> problem
>>>>>>> has a correct yes/no answer".
>>>>>>>
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>>      u32 Input_Halts = Halts(P, P);
>>>>>>      if (Input_Halts)
>>>>>>        HERE: goto HERE;
>>>>>>      return;
>>>>>> }
>>>>>>
>>>>>> Neither value from the set of {true, false} returned by Halts() to
>>>>>> H_Hat() is correct
>>>>>
>>>>> No, this is wrong, though you probably did not mean to say exactly
>>>>> that.
>>>> Yes I did mean exactly that and you knew damned well that I did mean
>>>> exactly that.
>>>>
>>>> If Halts returns true, that is the wrong answer because H_Hat() loops.
>>>> If Halts returns false, that is the wrong answer because H_Hat() halts.
>>>>
>>>
>>> Right. that means that Halts can't be right, not that there is no answer
>>> to the halting state of H_Hat.
>>>
>>
>> It doesn't even mean that Halts() cannot be right. It does mean that
>> Halts() must terminate its simulation of H_Hat() before making its
>> halting decision.
>>
>> As long as it is no longer possible to provide a counter example that
>> cannot be determined to be placed in the category of inputs with the
>> property of infinite execution or inputs without this property then the
>> halting problem undecidability proofs have been refuted.
>>
>> The term decider doesn't really have a standard meaning. In fact, it is
>> lamentable that Sipser chose the terms decider and recognizer, since
>> they seem to confuse students.
>>
>> Intuitively, a decider should be a Turing machine that given an input,
>> halts and either accepts or rejects, relaying its answer in one of many
>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>> leaving its answer on the output tape.
>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>
>> A decider is only required to make a decision for every input.
>> It typically does this at the end of its execution.
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> int main()
>> {
>>    u32 Input_Halts = Halts((u32)H_Hat, (u32)H_Hat);
>> }
>>
>> When Halts() returns its correct decision in main() this proves that it
>> is a decider, any opinion to the contrary is simply misinformation.
>>
> 
> Except when you check the answer it gives, it doesn't match what H_Hat
> actually does. Thus it doesn't correctly decide.
> 

YOU MUST HAVE FREAKING BRAIN DAMAGE !!!

As I have said far too many times it does not fricking answer the 
question about what the freak that the input does.

THIS IS ALL THAT WE NEED FOR A UNIVERSAL HALT DECIDER
It answers the question about whether or not the input has the property 
of infinite execution.

The point of my prior reply is that all the times that everyone said 
that the halt decider must return a value to the caller that invokes in 
in infinite recursion IS PURE BULLSHIT.

    The term decider doesn't really have a standard
    meaning. In fact, it is lamentable that Sipser
    chose the terms decider and recognizer, since
    they seem to confuse students.

    Intuitively, a decider should be a Turing machine
    that given an input, halts and either accepts or
    rejects, relaying its answer in one of many equivalent
    ways, such as halting at an ACCEPT or REJECT state, or
    leaving its answer on the output tape.
    https://cs.stackexchange.com/questions/84433/what-is-decider

As long as Halts eventually returns a result by any means what-so-ever 
then Halts <is> a freaking decider.



-- 
Copyright 2020 Pete Olcott

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

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


#2464 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-02 09:31 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]
Message-ID<176dnSdb3ed8DG3CnZ2dnUU7-L-dnZ2d@giganews.com>
In reply to#2463
On 1/2/2021 9:20 AM, Richard Damon wrote:
> On 1/2/21 9:52 AM, olcott wrote:
>> On 1/1/2021 9:18 PM, Richard Damon wrote:
>>> On 1/1/21 7:56 PM, olcott wrote:
>>>> On 1/1/2021 6:31 PM, Richard Damon wrote:
>>>>> On 1/1/21 6:57 PM, olcott wrote:
>>>>>> On 1/1/2021 4:55 PM, Richard Damon wrote:
>>>>>>> On 1/1/21 5:20 PM, olcott wrote:
>>>>>>>> On 1/1/2021 4:05 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> I have been studying pathological self-reference since 2004.
>>>>>>>>>>>> There is
>>>>>>>>>>>> nothing that can correctly handle it because it is a semantic
>>>>>>>>>>>> error.
>>>>>>>>>>>> It is comparable to asking the question: What time is it yes or
>>>>>>>>>>>> no?
>>>>>>>>>>>
>>>>>>>>>>> Not this again.  Repeat after me: "every instance of the halting
>>>>>>>>>>> problem
>>>>>>>>>>> has a correct yes/no answer".
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>> {
>>>>>>>>>>        u32 Input_Halts = Halts(P, P);
>>>>>>>>>>        if (Input_Halts)
>>>>>>>>>>          HERE: goto HERE;
>>>>>>>>>>        return;
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> Neither value from the set of {true, false} returned by Halts() to
>>>>>>>>>> H_Hat() is correct
>>>>>>>>>
>>>>>>>>> No, this is wrong, though you probably did not mean to say exactly
>>>>>>>>> that.
>>>>>>>> Yes I did mean exactly that and you knew damned well that I did mean
>>>>>>>> exactly that.
>>>>>>>>
>>>>>>>> If Halts returns true, that is the wrong answer because H_Hat()
>>>>>>>> loops.
>>>>>>>> If Halts returns false, that is the wrong answer because H_Hat()
>>>>>>>> halts.
>>>>>>>>
>>>>>>>
>>>>>>> Right. that means that Halts can't be right, not that there is no
>>>>>>> answer
>>>>>>> to the halting state of H_Hat.
>>>>>>>
>>>>>>
>>>>>> It doesn't even mean that Halts() cannot be right. It does mean that
>>>>>> Halts() must terminate its simulation of H_Hat() before making its
>>>>>> halting decision.
>>>>>>
>>>>>> As long as it is no longer possible to provide a counter example that
>>>>>> cannot be determined to be placed in the category of inputs with the
>>>>>> property of infinite execution or inputs without this property then
>>>>>> the
>>>>>> halting problem undecidability proofs have been refuted.
>>>>>>
>>>>>> The term decider doesn't really have a standard meaning. In fact,
>>>>>> it is
>>>>>> lamentable that Sipser chose the terms decider and recognizer, since
>>>>>> they seem to confuse students.
>>>>>>
>>>>>> Intuitively, a decider should be a Turing machine that given an input,
>>>>>> halts and either accepts or rejects, relaying its answer in one of
>>>>>> many
>>>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>>>> leaving its answer on the output tape.
>>>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>>>
>>>>>> A decider is only required to make a decision for every input.
>>>>>> It typically does this at the end of its execution.
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>>      u32 Input_Halts = Halts(P, P);
>>>>>>      if (Input_Halts)
>>>>>>        HERE: goto HERE;
>>>>>>      return;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>>      u32 Input_Halts = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> }
>>>>>>
>>>>>> When Halts() returns its correct decision in main() this proves
>>>>>> that it
>>>>>> is a decider, any opinion to the contrary is simply misinformation.
>>>>>>
>>>>>
>>>>> Except when you check the answer it gives, it doesn't match what H_Hat
>>>>> actually does. Thus it doesn't correctly decide.
>>>>>
>>>>
>>>> YOU MUST HAVE FREAKING BRAIN DAMAGE !!!
>>>>
>>>> As I have said far too many times it does not fricking answer the
>>>> question about what the freak that the input does.
>>>
>>> And, becuase we CAN run that input as a program, (assuming you fix your
>>> machine to have just a local working decider) we can see that with the
>>> answer you claim wiil be generated, the machine will HALT.
>>>
>>> Your attempt to change the question is basically answering the questions
>>> "Did the Dog Bark?" with "The Cat Purred a lot".
>>>
>>> It REALLY doesn't matter if the halt decider had problems and decided it
>>> needed to halt the simulation (in fact, as has been said, there is no
>>> requriremet that it do ANY simulation), the only answer that matters is
>>> what the program would do when run by itself.
>>>
>>> In fact, the fact that the machine does come to a halt is proof that if
>>> that level of the halt detector didn't abort the execution, and let the
>>> next layer do the abort, it would have seen that the execution did
>>> terminate, and it would have returned Halting, so the 'need to halt'
>>> clause wasn't actually met.
>>>>
>>>> THIS IS ALL THAT WE NEED FOR A UNIVERSAL HALT DECIDER
>>>> It answers the question about whether or not the input has the property
>>>> of infinite execution.
>>>>
>>>
>>> It needs to CORRECTLY answer the question, which we just showed that it
>>> didn't (at least if Halt meets its requirement to provide an answer in
>>> finite time).
>>>
>>>> The point of my prior reply is that all the times that everyone said
>>>> that the halt decider must return a value to the caller that invokes in
>>>> in infinite recursion IS PURE BULLSHIT.
>>>
>>> It seem that you have some problems with basic things like rules and
>>> definitions.
>>>>
>>>>      The term decider doesn't really have a standard
>>>>      meaning. In fact, it is lamentable that Sipser
>>>>      chose the terms decider and recognizer, since
>>>>      they seem to confuse students.
>>>>
>>>>      Intuitively, a decider should be a Turing machine
>>>>      that given an input, halts and either accepts or
>>>>      rejects, relaying its answer in one of many equivalent
>>>>      ways, such as halting at an ACCEPT or REJECT state, or
>>>>      leaving its answer on the output tape.
>>>>      https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>
>>>> As long as Halts eventually returns a result by any means what-so-ever
>>>> then Halts <is> a freaking decider.
>>>>
>>>
>>
>> Can you see that a program that divides all inputs into those with the
>> property of infinite execution and those that do not have this property
>> would solve the halting problem, or are you a liar?
> 
> 
> A program that CORRECTLY divides all programs into Halting and
> Non-Halting will satisfy the requirement, 
That was not the question.

-- 
Copyright 2020 Pete Olcott

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

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


#2465 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]

Fromolcott <NoOne@NoWhere.com>
Date2021-01-02 10:05 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs [ misinformation ]
Message-ID<K4KdnY2_TMxRBG3CnZ2dnUU7-efNnZ2d@giganews.com>
In reply to#2464
On 1/2/2021 9:40 AM, Richard Damon wrote:
> On 1/2/21 10:31 AM, olcott wrote:
>> On 1/2/2021 9:20 AM, Richard Damon wrote:
>>> On 1/2/21 9:52 AM, olcott wrote:
>>>> On 1/1/2021 9:18 PM, Richard Damon wrote:
>>>>> On 1/1/21 7:56 PM, olcott wrote:
>>>>>> On 1/1/2021 6:31 PM, Richard Damon wrote:
>>>>>>> On 1/1/21 6:57 PM, olcott wrote:
>>>>>>>> On 1/1/2021 4:55 PM, Richard Damon wrote:
>>>>>>>>> On 1/1/21 5:20 PM, olcott wrote:
>>>>>>>>>> On 1/1/2021 4:05 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 1/1/2021 10:47 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> I have been studying pathological self-reference since 2004.
>>>>>>>>>>>>>> There is
>>>>>>>>>>>>>> nothing that can correctly handle it because it is a semantic
>>>>>>>>>>>>>> error.
>>>>>>>>>>>>>> It is comparable to asking the question: What time is it
>>>>>>>>>>>>>> yes or
>>>>>>>>>>>>>> no?
>>>>>>>>>>>>>
>>>>>>>>>>>>> Not this again.  Repeat after me: "every instance of the
>>>>>>>>>>>>> halting
>>>>>>>>>>>>> problem
>>>>>>>>>>>>> has a correct yes/no answer".
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>>>> {
>>>>>>>>>>>>         u32 Input_Halts = Halts(P, P);
>>>>>>>>>>>>         if (Input_Halts)
>>>>>>>>>>>>           HERE: goto HERE;
>>>>>>>>>>>>         return;
>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> Neither value from the set of {true, false} returned by
>>>>>>>>>>>> Halts() to
>>>>>>>>>>>> H_Hat() is correct
>>>>>>>>>>>
>>>>>>>>>>> No, this is wrong, though you probably did not mean to say
>>>>>>>>>>> exactly
>>>>>>>>>>> that.
>>>>>>>>>> Yes I did mean exactly that and you knew damned well that I did
>>>>>>>>>> mean
>>>>>>>>>> exactly that.
>>>>>>>>>>
>>>>>>>>>> If Halts returns true, that is the wrong answer because H_Hat()
>>>>>>>>>> loops.
>>>>>>>>>> If Halts returns false, that is the wrong answer because H_Hat()
>>>>>>>>>> halts.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Right. that means that Halts can't be right, not that there is no
>>>>>>>>> answer
>>>>>>>>> to the halting state of H_Hat.
>>>>>>>>>
>>>>>>>>
>>>>>>>> It doesn't even mean that Halts() cannot be right. It does mean that
>>>>>>>> Halts() must terminate its simulation of H_Hat() before making its
>>>>>>>> halting decision.
>>>>>>>>
>>>>>>>> As long as it is no longer possible to provide a counter example
>>>>>>>> that
>>>>>>>> cannot be determined to be placed in the category of inputs with the
>>>>>>>> property of infinite execution or inputs without this property then
>>>>>>>> the
>>>>>>>> halting problem undecidability proofs have been refuted.
>>>>>>>>
>>>>>>>> The term decider doesn't really have a standard meaning. In fact,
>>>>>>>> it is
>>>>>>>> lamentable that Sipser chose the terms decider and recognizer, since
>>>>>>>> they seem to confuse students.
>>>>>>>>
>>>>>>>> Intuitively, a decider should be a Turing machine that given an
>>>>>>>> input,
>>>>>>>> halts and either accepts or rejects, relaying its answer in one of
>>>>>>>> many
>>>>>>>> equivalent ways, such as halting at an ACCEPT or REJECT state, or
>>>>>>>> leaving its answer on the output tape.
>>>>>>>> https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>>>>>
>>>>>>>> A decider is only required to make a decision for every input.
>>>>>>>> It typically does this at the end of its execution.
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>>       u32 Input_Halts = Halts(P, P);
>>>>>>>>       if (Input_Halts)
>>>>>>>>         HERE: goto HERE;
>>>>>>>>       return;
>>>>>>>> }
>>>>>>>>
>>>>>>>> int main()
>>>>>>>> {
>>>>>>>>       u32 Input_Halts = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>> }
>>>>>>>>
>>>>>>>> When Halts() returns its correct decision in main() this proves
>>>>>>>> that it
>>>>>>>> is a decider, any opinion to the contrary is simply misinformation.
>>>>>>>>
>>>>>>>
>>>>>>> Except when you check the answer it gives, it doesn't match what
>>>>>>> H_Hat
>>>>>>> actually does. Thus it doesn't correctly decide.
>>>>>>>
>>>>>>
>>>>>> YOU MUST HAVE FREAKING BRAIN DAMAGE !!!
>>>>>>
>>>>>> As I have said far too many times it does not fricking answer the
>>>>>> question about what the freak that the input does.
>>>>>
>>>>> And, becuase we CAN run that input as a program, (assuming you fix your
>>>>> machine to have just a local working decider) we can see that with the
>>>>> answer you claim wiil be generated, the machine will HALT.
>>>>>
>>>>> Your attempt to change the question is basically answering the
>>>>> questions
>>>>> "Did the Dog Bark?" with "The Cat Purred a lot".
>>>>>
>>>>> It REALLY doesn't matter if the halt decider had problems and
>>>>> decided it
>>>>> needed to halt the simulation (in fact, as has been said, there is no
>>>>> requriremet that it do ANY simulation), the only answer that matters is
>>>>> what the program would do when run by itself.
>>>>>
>>>>> In fact, the fact that the machine does come to a halt is proof that if
>>>>> that level of the halt detector didn't abort the execution, and let the
>>>>> next layer do the abort, it would have seen that the execution did
>>>>> terminate, and it would have returned Halting, so the 'need to halt'
>>>>> clause wasn't actually met.
>>>>>>
>>>>>> THIS IS ALL THAT WE NEED FOR A UNIVERSAL HALT DECIDER
>>>>>> It answers the question about whether or not the input has the
>>>>>> property
>>>>>> of infinite execution.
>>>>>>
>>>>>
>>>>> It needs to CORRECTLY answer the question, which we just showed that it
>>>>> didn't (at least if Halt meets its requirement to provide an answer in
>>>>> finite time).
>>>>>
>>>>>> The point of my prior reply is that all the times that everyone said
>>>>>> that the halt decider must return a value to the caller that
>>>>>> invokes in
>>>>>> in infinite recursion IS PURE BULLSHIT.
>>>>>
>>>>> It seem that you have some problems with basic things like rules and
>>>>> definitions.
>>>>>>
>>>>>>       The term decider doesn't really have a standard
>>>>>>       meaning. In fact, it is lamentable that Sipser
>>>>>>       chose the terms decider and recognizer, since
>>>>>>       they seem to confuse students.
>>>>>>
>>>>>>       Intuitively, a decider should be a Turing machine
>>>>>>       that given an input, halts and either accepts or
>>>>>>       rejects, relaying its answer in one of many equivalent
>>>>>>       ways, such as halting at an ACCEPT or REJECT state, or
>>>>>>       leaving its answer on the output tape.
>>>>>>       https://cs.stackexchange.com/questions/84433/what-is-decider
>>>>>>
>>>>>> As long as Halts eventually returns a result by any means what-so-ever
>>>>>> then Halts <is> a freaking decider.
>>>>>>
>>>>>
>>>>
>>>> Can you see that a program that divides all inputs into those with the
>>>> property of infinite execution and those that do not have this property
>>>> would solve the halting problem, or are you a liar?
>>>
>>>
>>> A program that CORRECTLY divides all programs into Halting and
>>> Non-Halting will satisfy the requirement,
>> That was not the question.
>>
> 
> Making a program to arbitrarily divide other programs into categories
> but not needing to be correct about it is trivial. That is NOT the
> Halting Problem.
> 
> Also, the Halting Problem is about Halting, not some strange property
> that if the Halting Decider was just a UTM would the execution go on
> forever, That is a different question.
> 

A program that has the property of infinite execution is a program that 
would execute infinitely if its simulation was never stopped.

-- 
Copyright 2020 Pete Olcott

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

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


Page 19 of 21 — ← Prev page 1 … 17 18 [19] 20 21  Next page →

Back to top | Article view | comp.software-eng


csiph-web