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 13 of 21 — ← Prev page 1 … 11 12 [13] 14 15 … 21  Next page →


#2241 — Re: Refuting the Peter Linz HP Proof

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-11 23:28 +0000
SubjectRe: Refuting the Peter Linz HP Proof
Message-ID<20201211152715.840@kylheku.com>
In reply to#2238
On 2020-12-11, olcott <NoOne@NoWhere.com> wrote:
>>      You have not supplied any details of the "Halts" algorithm,
>> only, rather trivially, of a C program that calls it.
>> >
> What you really mean when you say this is that although you know that I 
> have supplied this algorithm again and again many times you simply don't 
> "believe in" this algorithm:

Only today did you provide a sneak preview of an execution trace in
which the value of Halts is turned into a diagnostic message, and
is supposedly the correct value.

You've not yet revealed full execution traces or any algorithm,
so the jury is out.

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

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


#2221 — Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-11 18:26 +0000
SubjectRe: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct)
Message-ID<20201211095101.625@kylheku.com>
In reply to#2199
["Followup-To:" header set to comp.theory.]
On 2020-12-11, olcott <NoOne@NoWhere.com> wrote:
> On 12/10/2020 6:51 PM, Kaz Kylheku wrote:
>> On 2020-12-10, olcott <NoOne@NoWhere.com> wrote:
>>> The UTM / halt decider cannot be fooled by shell scripts it has a global
>>> perspective that cannot be thwarted.
>> 
>> Note that every Turing compuation can be embedded inside another
>> compuation. If you're referring to a computation for which that is
>> somehow disallowed, that is no longer Turing computation.
>> 
>> In Turing computation, here is no no global that cannot be relativized
>> and turned into a local inside some larger global.
>> 
>
> All of the conventional halting problem conter-examples can be decided 
> by a UTM that has been adapted to become a halt decider because in this 
> case no TM can do anything that the UTM/decider cannot see.
       ^^^^^

Your apparatus has shown that ONE TM cannot escape the outer machine's
decision procedure. Well, it is more than just one; it generalizes a
somewhat: you show that several kinds of TM cannot escape: those which
exhibit one of several trivial patterns of non-termination.

If a machine can "see" everything that ANY machine does, then it has
to solve the halting problem, or else fail to terminate.

If A can see everything that B does, for any B, then it means that if B
runs forever and does not halt, then A also runs forever and does not
halt. If at any point A decides to quit, while B continues to run
forever, then B might do things that A can no longer see.

Therefore, if A wants to quit early, it has to at a point where the
remainder of B's behavior is completely predictable to A; B will
no longer continue to generate new, surprising behavior that is outside
of the previous understanding of A.

That decision requires solving the general halting, in order to work
for any B whatsoever.

If A recognizes just a finite number of ways, in which B's subsequent
behavior can be come entirely predictable and can be summarized without
further executing B, then A is not a general halting decider.

In the problem being discussed ad nauseum, there there are these
questions:

X: does H(H_Hat, H_Hat) halt?

Y: does H_Hat(H_Hat) halt?

Both are decidable; for any, we can find a machine which resolves
them.

The "conventional proofs" concern themselves with showing that H
is not among the machines which answer Y.

Either H fails to halt (which also means the answer to X is false)
or else it returns the wrong answer.

H not being in the set of machines which can answer Y doesn't mean
that Y is not answerable!

Your apparatus answers Y by confirming that H(H_Hat, H_Hat) does not
halt: it shows that an infinite loop or recursion occurs at a particular
instruction, and that instruction clearly belongs to the body of H_Hat.

(From that answer, we can also deduce that the answer the X is negative,
because in that particular test setup, H simply executes H_Hat(H_Hat).
Since H_Hat(H_Hat) fails to halt, so does H.)

So your apparatus is in the set of machines which can decide Y.
But your apparatus is not H. You don't show that H belongs to that set.

That is what is required to contradict the proofs, and which you
have not shown.

You're showing the wrong, irrelvant thing, which everyone already knows:
that Y is decidable.

Nearly a week ago, you admitted this problem (all the while insisting
that you have "correctly refuted" the proofs), and claimed that
showing this result is only a minor "interface problem" to be fixed
in your apparatus, which will be soved in about a week.

That week is almost up now.

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

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


#2225 — Re: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-11 12:48 -0600
SubjectRe: Refuting the Peter Linz HP Proof (Kaz agrees that I am correct)
Message-ID<HuednQI1hbiFIk7CnZ2dnUU7-NnNnZ2d@giganews.com>
In reply to#2221
On 12/11/2020 12:26 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-11, olcott <NoOne@NoWhere.com> wrote:
>> On 12/10/2020 6:51 PM, Kaz Kylheku wrote:
>>> On 2020-12-10, olcott <NoOne@NoWhere.com> wrote:
>>>> The UTM / halt decider cannot be fooled by shell scripts it has a global
>>>> perspective that cannot be thwarted.
>>>
>>> Note that every Turing compuation can be embedded inside another
>>> compuation. If you're referring to a computation for which that is
>>> somehow disallowed, that is no longer Turing computation.
>>>
>>> In Turing computation, here is no no global that cannot be relativized
>>> and turned into a local inside some larger global.
>>>
>>
>> All of the conventional halting problem conter-examples can be decided
>> by a UTM that has been adapted to become a halt decider because in this
>> case no TM can do anything that the UTM/decider cannot see.
>         ^^^^^
> 
> Your apparatus has shown that ONE TM cannot escape the outer machine's
> decision procedure. Well, it is more than just one; it generalizes a
> somewhat: you show that several kinds of TM cannot escape: those which
> exhibit one of several trivial patterns of non-termination.
> 
> If a machine can "see" everything that ANY machine does, then it has
> to solve the halting problem, or else fail to terminate.
> 

Not quite. All the non-terminating inputs that is has not be encoded to 
decide would be infinite because it was not programmed to recognize them.

> If A can see everything that B does, for any B, then it means that if B
> runs forever and does not halt, then A also runs forever and does not
> halt.  

Not in the cases that I have shown.

> If at any point A decides to quit, while B continues to run
> forever, then B might do things that A can no longer see.
> 
> Therefore, if A wants to quit early, it has to at a point where the
> remainder of B's behavior is completely predictable to A; B will
> no longer continue to generate new, surprising behavior that is outside
> of the previous understanding of A.
> 
> That decision requires solving the general halting, in order to work
> for any B whatsoever.
> 

That is not true.

> If A recognizes just a finite number of ways, in which B's subsequent
> behavior can be come entirely predictable and can be summarized without
> further executing B, then A is not a general halting decider.

Yes this is correct. I have only refuted the undecidability proofs, this 
only requires me to show how to decide their otherwise undecidable 
counter-example.

> In the problem being discussed ad nauseum, there there are these
> questions:
> 
> X: does H(H_Hat, H_Hat) halt?
> 
> Y: does H_Hat(H_Hat) halt?
> 
> Both are decidable; for any, we can find a machine which resolves
> them.
> 
> The "conventional proofs" concern themselves with showing that H
> is not among the machines which answer Y.
> 
> Either H fails to halt (which also means the answer to X is false)
> or else it returns the wrong answer.

Yet I have proved otherwise.

> H not being in the set of machines which can answer Y doesn't mean
> that Y is not answerable!
> 
> Your apparatus answers Y by confirming that H(H_Hat, H_Hat) does not
> halt: it shows that an infinite loop or recursion occurs at a particular
> instruction, and that instruction clearly belongs to the body of H_Hat.
> 

Yes.

> (From that answer, we can also deduce that the answer the X is negative,
> because in that particular test setup, H simply executes H_Hat(H_Hat).
> Since H_Hat(H_Hat) fails to halt, so does H.)
> 
No.

> So your apparatus is in the set of machines which can decide Y.
> But your apparatus is not H. You don't show that H belongs to that set.
> 
Yes I do.

> That is what is required to contradict the proofs, and which you
> have not shown.
> 

I just got my return value working.

> You're showing the wrong, irrelvant thing, which everyone already knows:
> that Y is decidable.
> 
> Nearly a week ago, you admitted this problem (all the while insisting
> that you have "correctly refuted" the proofs), and claimed that
> showing this result is only a minor "interface problem" to be fixed
> in your apparatus, which will be soved in about a week.
> 
> That week is almost up now.
> 

Yes and I just got it working.

-- 
Copyright 2020 Pete Olcott

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

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


#2280 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs

Fromolcott <NoOne@NoWhere.com>
Date2020-12-15 10:09 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs
Message-ID<yK2dnXzXs69GQkXCnZ2dnUU7-dvNnZ2d@giganews.com>
In reply to#2035
On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
> Code for contex:
> 
> bool Halts(u32 P, u32 I)
> {
>    bool Halted  = false;
>    bool Aborted = false;
>    while (!Halted && !Aborted)
>    {
>      Halted  = DebugStep(P, I);
>      Aborted = Needs_To_Be_Aborted();
>    }
>    return !Aborted;
> 
> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
> 
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 12/12/2020 5:20 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
> <cut>
>>>> int main()
>>>> {
>>>>     HERE: goto HERE;
>>>>     Confound_Halts((u32)Confound_Halts);
>>>>     Halts((u32)Confound_Halts, (u32)Confound_Halts);
>>>> }
>>>
>>> I did not write this.  You should make that clear when writing
>>> attributions.
>>>
>>>>   From the perspective of this master UTM all three lines of main()
>>>> specify infinite execution.
>>>
>>> As far as my original point is  concerned you have already said that Halts
>>> does not meet the challenge.  You've agreed that
>>>
>>> (a) Halts(Confound_Halts, Confound_Halts) is false, and
>>> (b) Confound_Halts(Confound_Halts) is a finite computation.
>>
>> (b) Confound_Halts(Confound_Halts) IS NOT A FINITE COMPUTATION
> 
> I am aware that you have said both.  What you have not done is retract
> what you said before*, namely that the input to halts is a finite
> computation.  You can't expect to get away with saying both, you need to
> say that you were wrong before.
> 
> And you appear to be also saying that you were also wrong to state that
> Halts(Confound_Halts, Confound_Halts) returns false**.  In fact, you
> appear to be saying now that that call does not return at all.
> 

As I have always said
 >>> (a) Halts(Confound_Halts, Confound_Halts) is false,
returns false according to this criteria:

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.

 >>> (b) Confound_Halts(Confound_Halts) is a finite computation.

The infinitely recursive invocation of Halts() by Confound_Halts() never 
returns anything to Confound_Halts() because infinitely recursive 
invocations never ever return.

If I ever said that either of these are finite computations I was 
incorrect, they are both unequivocal examples of infinite recursion.

int main()
{
   Confound_Halts(Confound_Halts);
}

int main()
{
   H_Hat(H_Hat);
}

Output_Debug_Trace() Trace_List.size(19)
---[00000661](01)  55                  push ebp
---[00000662](02)  8bec                mov ebp,esp
---[00000664](05)  6801060000          push 00000601
---[00000669](05)  e893ffffff          call 00000601   	--CALL [00000601]
---[00000601](01)  55                  push ebp
---[00000602](02)  8bec                mov ebp,esp
---[00000604](01)  51                  push ecx
---[00000605](03)  8b4508              mov eax,[ebp+08]
---[00000608](01)  50                  push eax
---[00000609](03)  8b4d08              mov ecx,[ebp+08]
---[0000060c](01)  51                  push ecx
---[0000060d](05)  e8effdffff          call 00000401   	--CALL [00000401]
---[00000601](01)  55                  push ebp
---[00000602](02)  8bec                mov ebp,esp
---[00000604](01)  51                  push ecx
---[00000605](03)  8b4508              mov eax,[ebp+08]
---[00000608](01)  50                  push eax
---[00000609](03)  8b4d08              mov ecx,[ebp+08]
---[0000060c](01)  51                  push ecx
---[0000060d](05)  e8effdffff          call 00000401   	--CALL [00000401]
The PRIOR Instruction Specifies Infinite Recursion: Simulation Stopped:

In both of the above cases global Halts() terminates the execution of 
the above functions in the same way that an uncaught "divide by zero" 
error would be reported by the operating system.

-- 
Copyright 2020 Pete Olcott

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

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


#2285 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 13:23 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<IoGdndKfvMgzw0fCnZ2dnUU7-WvNnZ2d@giganews.com>
In reply to#2280
On 12/16/2020 7:48 AM, Malcolm McLean wrote:
> On Wednesday, 16 December 2020 at 01:46:22 UTC, olcott wrote:
>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>> olcott <No...@NoWhere.com> writes:
>>>
>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>>>> Code for contex:
>>>>>>>
>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>> {
>>>>>>> bool Halted = false;
>>>>>>> bool Aborted = false;
>>>>>>> while (!Halted && !Aborted)
>>>>>>> {
>>>>>>> Halted = DebugStep(P, I);
>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>> }
>>>>>>> return !Aborted;
>>>>>>>
>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>
>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 12/12/2020 5:20 PM, Ben Bacarisse wrote:
>>>>> <cut>
>>>>>>>>> As far as my original point is concerned you have already said that Halts
>>>>>>>>> does not meet the challenge. You've agreed that
>>>>>>>>>
>>>>>>>>> (a) Halts(Confound_Halts, Confound_Halts) is false, and
>>>>>>>>> (b) Confound_Halts(Confound_Halts) is a finite computation.
>>>>>>>>
>>>>>>>> (b) Confound_Halts(Confound_Halts) IS NOT A FINITE COMPUTATION
>>>>>>>
>>>>>>> I am aware that you have said both. What you have not done is retract
>>>>>>> what you said before*, namely that the input to halts is a finite
>>>>>>> computation. You can't expect to get away with saying both, you need to
>>>>>>> say that you were wrong before.
>>>>>
>>>>> This is the first point that needs to be resolved. Were you wrong when
>>>>> you described the computation passed to Halts as finite? You qualified
>>>>> it -- "it's only finite because...", but I'd still be dead even if I were
>>>>> only dead because I jumped off a cliff.
>>>>>
>>>>> Anyway, it seems you are now adamant that, despite what you said before,
>>>>> Confound_Halts(Confound_Halts) is not a finite computation. There are
>>>>> only two ways that that can happen. Reminder:
>>>>>
>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>
>>>>> (1) Halts(Confound_Halts, Confound_Halts) returns true when called in
>>>>> the above function; or
>>>>>
>>>>> (2) Halts(Confound_Halts, Confound_Halts) does not return when called in
>>>>> the above function.
>>>>>
>> (3) When Halts(Confound_Halts, Confound_Halts) is called by main() this
>> is similar to wrapping a divide by zero error with a try catch block.
>> Halts() returns a value of 0 or 1.
>>
>> When Confound_Halts(Confound_Halts) is called by main() this is similar
>> to divide by zero error that has not been caught by a try-catch block.
>> The operating system abnormally terminates the application with an
>> [infinite execution] @ machine address fatal error.
>>
> So this is reasonable. Everything is run under a supervisor which detects
> non-stopping behaviour and aborts. Halts catches the detection when
> called at top level. When not called at top level, the supervisor catches
> the detection.
> 
> So it looks superficially as if Halts at top level is a pure function. That's as
> much as anyone sane would expect or demand. Halts can't be really a
> pure function because it changes its behaviour when called from Confound_
> Halts() . 

> It must interact with the supervisor in some way. But that is quite well
> hidden, and the supervisor set-up sounds innocuous enough at first sight.After
> all, you need some framework for running Turing machines, and for stopping
> them when they get caught in infinite loops (or exceed the patience of
> the user).
> 
> You haven't met Ben's challenge because of this
> 

Ben's challenge seemed to be self-contradictory adding the arbitrary 
requirement that a halt decider is either not allowed detect when 
another function is invoking it in infinite recursion

Halts-->H_Hat-->Halts  // second call to Halts

or whenever the halt decider does detect itself being invoked in 
infinite recursion this infinitely recursive invocation (the second one 
diagrammed above) must return a value to its caller even though no 
infinitely recursive invocations ever return values to their caller.

Since I have a complete execution trace of the halt decider deciding 
H_Hat correctly Ben's arbitrary requirement has no actual basis.

> (Ben)
>> * It occurs to me that you might think that a viable answer to this
>> challenge might be a function that returns something in some contexts
>> and does not return in others, even when given exactly the same
>> arguments in both cases. I'm discounting that because it's obviously
>> not allowed by the challenge wording, and you confirmed that no such
>> trickery is taking place long ago in the reply to, IIRC, Mike Terry.
>>
> As the asterisk indicates, this is a post-hoc requirement. Ultimately if
> you pile on control after control, it becomes impossibe even for the
> most skilled magician to pull a rabbit out of a hat. You can demand
> that you supply the the hat, and he can do it, you can demand that
> the hat not be placed on a table, and he will do it, you can demand that he
> wear short sleeves, and he will do it. But finally you demand a brown rabbit
> instead of a white rabbit. That's a demand too far. It's no longer possible to
> produce the rabbit from the hat.
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2286 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 14:04 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<If6dnUUqRMbH9UfCnZ2dnUU7-e_NnZ2d@giganews.com>
In reply to#2285
On 12/16/2020 1:55 PM, André G. Isaak wrote:
> On 2020-12-16 12:23, olcott wrote:
>> On 12/16/2020 7:48 AM, Malcolm McLean wrote:
>>> On Wednesday, 16 December 2020 at 01:46:22 UTC, olcott wrote:
>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>>>>>> Code for contex:
>>>>>>>>>
>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>> {
>>>>>>>>> bool Halted = false;
>>>>>>>>> bool Aborted = false;
>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>> {
>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>> }
>>>>>>>>> return !Aborted;
>>>>>>>>>
>>>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>>>
>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 12/12/2020 5:20 PM, Ben Bacarisse wrote:
>>>>>>> <cut>
>>>>>>>>>>> As far as my original point is concerned you have already 
>>>>>>>>>>> said that Halts
>>>>>>>>>>> does not meet the challenge. You've agreed that
>>>>>>>>>>>
>>>>>>>>>>> (a) Halts(Confound_Halts, Confound_Halts) is false, and
>>>>>>>>>>> (b) Confound_Halts(Confound_Halts) is a finite computation.
>>>>>>>>>>
>>>>>>>>>> (b) Confound_Halts(Confound_Halts) IS NOT A FINITE COMPUTATION
>>>>>>>>>
>>>>>>>>> I am aware that you have said both. What you have not done is 
>>>>>>>>> retract
>>>>>>>>> what you said before*, namely that the input to halts is a finite
>>>>>>>>> computation. You can't expect to get away with saying both, you 
>>>>>>>>> need to
>>>>>>>>> say that you were wrong before.
>>>>>>>
>>>>>>> This is the first point that needs to be resolved. Were you wrong 
>>>>>>> when
>>>>>>> you described the computation passed to Halts as finite? You 
>>>>>>> qualified
>>>>>>> it -- "it's only finite because...", but I'd still be dead even 
>>>>>>> if I were
>>>>>>> only dead because I jumped off a cliff.
>>>>>>>
>>>>>>> Anyway, it seems you are now adamant that, despite what you said 
>>>>>>> before,
>>>>>>> Confound_Halts(Confound_Halts) is not a finite computation. There 
>>>>>>> are
>>>>>>> only two ways that that can happen. Reminder:
>>>>>>>
>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>
>>>>>>> (1) Halts(Confound_Halts, Confound_Halts) returns true when 
>>>>>>> called in
>>>>>>> the above function; or
>>>>>>>
>>>>>>> (2) Halts(Confound_Halts, Confound_Halts) does not return when 
>>>>>>> called in
>>>>>>> the above function.
>>>>>>>
>>>> (3) When Halts(Confound_Halts, Confound_Halts) is called by main() this
>>>> is similar to wrapping a divide by zero error with a try catch block.
>>>> Halts() returns a value of 0 or 1.
>>>>
>>>> When Confound_Halts(Confound_Halts) is called by main() this is similar
>>>> to divide by zero error that has not been caught by a try-catch block.
>>>> The operating system abnormally terminates the application with an
>>>> [infinite execution] @ machine address fatal error.
>>>>
>>> So this is reasonable. Everything is run under a supervisor which 
>>> detects
>>> non-stopping behaviour and aborts. Halts catches the detection when
>>> called at top level. When not called at top level, the supervisor 
>>> catches
>>> the detection.
>>>
>>> So it looks superficially as if Halts at top level is a pure 
>>> function. That's as
>>> much as anyone sane would expect or demand. Halts can't be really a
>>> pure function because it changes its behaviour when called from 
>>> Confound_
>>> Halts() . 
>>
>>> It must interact with the supervisor in some way. But that is quite well
>>> hidden, and the supervisor set-up sounds innocuous enough at first 
>>> sight.After
>>> all, you need some framework for running Turing machines, and for 
>>> stopping
>>> them when they get caught in infinite loops (or exceed the patience of
>>> the user).
>>>
>>> You haven't met Ben's challenge because of this
>>>
>>
>> Ben's challenge seemed to be self-contradictory adding the arbitrary 
>> requirement that a halt decider is either not allowed detect when 
>> another function is invoking it in infinite recursion
>>
>> Halts-->H_Hat-->Halts  // second call to Halts
>>
>> or whenever the halt decider does detect itself being invoked in 
>> infinite recursion this infinitely recursive invocation (the second 
>> one diagrammed above) must return a value to its caller even though no 
>> infinitely recursive invocations ever return values to their caller.
>>
>> Since I have a complete execution trace of the halt decider deciding 
>> H_Hat correctly Ben's arbitrary requirement has no actual basis.
> 
> There's nothing arbitrary here. The requirement is that Halts() must be 
> *self-consistent*. That's a requirement which any solution to any 
> problem has.
> 
> According to you:
> 
> (1) You call Halts(H_Hat, H_Hat)
> (2) This in turn emulates H_Hat(H_Hat)
> (3) This in turn emulates Halts(H_Hat, H_Hat)
> (4) Your call in (1) aborts this as non-halting.
> 
> The problem is that the call in (1) and the call in (3) are *identical*

No they are not. Call (1) has a much longer execution trace to examine 
than call (3).  I have said this at least fifty times.


-- 
Copyright 2020 Pete Olcott

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

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


#2287 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromMr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
Date2020-12-16 20:21 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<8%tCH.414918$IbZ9.290031@fx10.ams4>
In reply to#2286
On 16/12/2020 20:04, olcott wrote:
> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>> On 2020-12-16 12:23, olcott wrote:
>>> On 12/16/2020 7:48 AM, Malcolm McLean wrote:
>>>> On Wednesday, 16 December 2020 at 01:46:22 UTC, olcott wrote:
>>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>
>>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>>>>>>> Code for contex:
>>>>>>>>>>
>>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>>> {
>>>>>>>>>> bool Halted = false;
>>>>>>>>>> bool Aborted = false;
>>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>>> {
>>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>>> }
>>>>>>>>>> return !Aborted;
>>>>>>>>>>
>>>>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>>>>
>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 12/12/2020 5:20 PM, Ben Bacarisse wrote:
>>>>>>>> <cut>
>>>>>>>>>>>> As far as my original point is concerned you have already said that Halts
>>>>>>>>>>>> does not meet the challenge. You've agreed that
>>>>>>>>>>>>
>>>>>>>>>>>> (a) Halts(Confound_Halts, Confound_Halts) is false, and
>>>>>>>>>>>> (b) Confound_Halts(Confound_Halts) is a finite computation.
>>>>>>>>>>>
>>>>>>>>>>> (b) Confound_Halts(Confound_Halts) IS NOT A FINITE COMPUTATION
>>>>>>>>>>
>>>>>>>>>> I am aware that you have said both. What you have not done is retract
>>>>>>>>>> what you said before*, namely that the input to halts is a finite
>>>>>>>>>> computation. You can't expect to get away with saying both, you need to
>>>>>>>>>> say that you were wrong before.
>>>>>>>>
>>>>>>>> This is the first point that needs to be resolved. Were you wrong when
>>>>>>>> you described the computation passed to Halts as finite? You qualified
>>>>>>>> it -- "it's only finite because...", but I'd still be dead even if I were
>>>>>>>> only dead because I jumped off a cliff.
>>>>>>>>
>>>>>>>> Anyway, it seems you are now adamant that, despite what you said before,
>>>>>>>> Confound_Halts(Confound_Halts) is not a finite computation. There are
>>>>>>>> only two ways that that can happen. Reminder:
>>>>>>>>
>>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>>
>>>>>>>> (1) Halts(Confound_Halts, Confound_Halts) returns true when called in
>>>>>>>> the above function; or
>>>>>>>>
>>>>>>>> (2) Halts(Confound_Halts, Confound_Halts) does not return when called in
>>>>>>>> the above function.
>>>>>>>>
>>>>> (3) When Halts(Confound_Halts, Confound_Halts) is called by main() this
>>>>> is similar to wrapping a divide by zero error with a try catch block.
>>>>> Halts() returns a value of 0 or 1.
>>>>>
>>>>> When Confound_Halts(Confound_Halts) is called by main() this is similar
>>>>> to divide by zero error that has not been caught by a try-catch block.
>>>>> The operating system abnormally terminates the application with an
>>>>> [infinite execution] @ machine address fatal error.
>>>>>
>>>> So this is reasonable. Everything is run under a supervisor which detects
>>>> non-stopping behaviour and aborts. Halts catches the detection when
>>>> called at top level. When not called at top level, the supervisor catches
>>>> the detection.
>>>>
>>>> So it looks superficially as if Halts at top level is a pure function. That's as
>>>> much as anyone sane would expect or demand. Halts can't be really a
>>>> pure function because it changes its behaviour when called from Confound_
>>>> Halts() . 
>>>
>>>> It must interact with the supervisor in some way. But that is quite well
>>>> hidden, and the supervisor set-up sounds innocuous enough at first sight.After
>>>> all, you need some framework for running Turing machines, and for stopping
>>>> them when they get caught in infinite loops (or exceed the patience of
>>>> the user).
>>>>
>>>> You haven't met Ben's challenge because of this
>>>>
>>>
>>> Ben's challenge seemed to be self-contradictory adding the arbitrary requirement that a halt decider is either not allowed detect when another function is invoking it in infinite recursion
>>>
>>> Halts-->H_Hat-->Halts  // second call to Halts
>>>
>>> or whenever the halt decider does detect itself being invoked in infinite recursion this infinitely recursive invocation (the second one diagrammed above) must return a value to its caller even though no infinitely recursive invocations ever return values to their caller.
>>>
>>> Since I have a complete execution trace of the halt decider deciding H_Hat correctly Ben's arbitrary requirement has no actual basis.
>>
>> There's nothing arbitrary here. The requirement is that Halts() must be *self-consistent*. That's a requirement which any solution to any problem has.
>>
>> According to you:
>>
>> (1) You call Halts(H_Hat, H_Hat)
>> (2) This in turn emulates H_Hat(H_Hat)
>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>> (4) Your call in (1) aborts this as non-halting.
>>
>> The problem is that the call in (1) and the call in (3) are *identical*
> 
> No they are not. Call (1) has a much longer execution trace to examine than call (3).  I have said this at least fifty times.

At least fifty-one times?

Soon to be fifty-two times, and fifty-three? Because you think you are right when EVERYBODY ELSE thinks you are wrong.

/Flibble

-- 
😎

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


#2288 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromJeff Barnett <jbb@notatt.com>
Date2020-12-16 13:33 -0700
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<rrdqvi$mh6$1@dont-email.me>
In reply to#2286
On 12/16/2020 1:04 PM, olcott wrote:
> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>> On 2020-12-16 12:23, olcott wrote:
>>> On 12/16/2020 7:48 AM, Malcolm McLean wrote:
>>>> On Wednesday, 16 December 2020 at 01:46:22 UTC, olcott wrote:
>>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>
>>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>>>>>>> Code for contex:
>>>>>>>>>>
>>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>>> {
>>>>>>>>>> bool Halted = false;
>>>>>>>>>> bool Aborted = false;
>>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>>> {
>>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>>> }
>>>>>>>>>> return !Aborted;
>>>>>>>>>>
>>>>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>>>>
>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 12/12/2020 5:20 PM, Ben Bacarisse wrote:
>>>>>>>> <cut>
>>>>>>>>>>>> As far as my original point is concerned you have already 
>>>>>>>>>>>> said that Halts
>>>>>>>>>>>> does not meet the challenge. You've agreed that
>>>>>>>>>>>>
>>>>>>>>>>>> (a) Halts(Confound_Halts, Confound_Halts) is false, and
>>>>>>>>>>>> (b) Confound_Halts(Confound_Halts) is a finite computation.
>>>>>>>>>>>
>>>>>>>>>>> (b) Confound_Halts(Confound_Halts) IS NOT A FINITE COMPUTATION
>>>>>>>>>>
>>>>>>>>>> I am aware that you have said both. What you have not done is 
>>>>>>>>>> retract
>>>>>>>>>> what you said before*, namely that the input to halts is a finite
>>>>>>>>>> computation. You can't expect to get away with saying both, 
>>>>>>>>>> you need to
>>>>>>>>>> say that you were wrong before.
>>>>>>>>
>>>>>>>> This is the first point that needs to be resolved. Were you 
>>>>>>>> wrong when
>>>>>>>> you described the computation passed to Halts as finite? You 
>>>>>>>> qualified
>>>>>>>> it -- "it's only finite because...", but I'd still be dead even 
>>>>>>>> if I were
>>>>>>>> only dead because I jumped off a cliff.
>>>>>>>>
>>>>>>>> Anyway, it seems you are now adamant that, despite what you said 
>>>>>>>> before,
>>>>>>>> Confound_Halts(Confound_Halts) is not a finite computation. 
>>>>>>>> There are
>>>>>>>> only two ways that that can happen. Reminder:
>>>>>>>>
>>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>>
>>>>>>>> (1) Halts(Confound_Halts, Confound_Halts) returns true when 
>>>>>>>> called in
>>>>>>>> the above function; or
>>>>>>>>
>>>>>>>> (2) Halts(Confound_Halts, Confound_Halts) does not return when 
>>>>>>>> called in
>>>>>>>> the above function.
>>>>>>>>
>>>>> (3) When Halts(Confound_Halts, Confound_Halts) is called by main() 
>>>>> this
>>>>> is similar to wrapping a divide by zero error with a try catch block.
>>>>> Halts() returns a value of 0 or 1.
>>>>>
>>>>> When Confound_Halts(Confound_Halts) is called by main() this is 
>>>>> similar
>>>>> to divide by zero error that has not been caught by a try-catch block.
>>>>> The operating system abnormally terminates the application with an
>>>>> [infinite execution] @ machine address fatal error.
>>>>>
>>>> So this is reasonable. Everything is run under a supervisor which 
>>>> detects
>>>> non-stopping behaviour and aborts. Halts catches the detection when
>>>> called at top level. When not called at top level, the supervisor 
>>>> catches
>>>> the detection.
>>>>
>>>> So it looks superficially as if Halts at top level is a pure 
>>>> function. That's as
>>>> much as anyone sane would expect or demand. Halts can't be really a
>>>> pure function because it changes its behaviour when called from 
>>>> Confound_
>>>> Halts() . 
>>>
>>>> It must interact with the supervisor in some way. But that is quite 
>>>> well
>>>> hidden, and the supervisor set-up sounds innocuous enough at first 
>>>> sight.After
>>>> all, you need some framework for running Turing machines, and for 
>>>> stopping
>>>> them when they get caught in infinite loops (or exceed the patience of
>>>> the user).
>>>>
>>>> You haven't met Ben's challenge because of this
>>>>
>>>
>>> Ben's challenge seemed to be self-contradictory adding the arbitrary 
>>> requirement that a halt decider is either not allowed detect when 
>>> another function is invoking it in infinite recursion
>>>
>>> Halts-->H_Hat-->Halts  // second call to Halts
>>>
>>> or whenever the halt decider does detect itself being invoked in 
>>> infinite recursion this infinitely recursive invocation (the second 
>>> one diagrammed above) must return a value to its caller even though 
>>> no infinitely recursive invocations ever return values to their caller.
>>>
>>> Since I have a complete execution trace of the halt decider deciding 
>>> H_Hat correctly Ben's arbitrary requirement has no actual basis.
>>
>> There's nothing arbitrary here. The requirement is that Halts() must 
>> be *self-consistent*. That's a requirement which any solution to any 
>> problem has.
>>
>> According to you:
>>
>> (1) You call Halts(H_Hat, H_Hat)
>> (2) This in turn emulates H_Hat(H_Hat)
>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>> (4) Your call in (1) aborts this as non-halting.
>>
>> The problem is that the call in (1) and the call in (3) are *identical*
> 
> No they are not. Call (1) has a much longer execution trace to examine 
> than call (3).  I have said this at least fifty times.

And you have been wrong 50 times in that case. The only explanation that 
seems to fit is that you don't know what "self-consistent" means. If you 
ask Andre, I sure he would explain it to you.
-- 
Jeff Barnett

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


#2289 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-16 20:44 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216123021.901@kylheku.com>
In reply to#2286
On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>> According to you:
>> 
>> (1) You call Halts(H_Hat, H_Hat)
>> (2) This in turn emulates H_Hat(H_Hat)
>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>> (4) Your call in (1) aborts this as non-halting.
>> 
>> The problem is that the call in (1) and the call in (3) are *identical*
>
> No they are not. Call (1) has a much longer execution trace to examine 
> than call (3).  I have said this at least fifty times.

And that is invalid. Two instances of the same TM are effectively one
and the same object. Their executions are absolutely identical.

If we initialize a TM with the same initial tape contents, the steps it
produces will be absolutely the same.

What you have is that (1) and (3) are different TMs, which only look the
same at the source and machine code level.

What's making them different is the manipulation by the supervising
emulator. That emulator contains state, and it perturbs their execution
basedon that state.

By this dihonest (, perhaps better described as shockingly naive)
ruse, you are turning pure-looking functions into impure procedures in a
way that does not show up in their source or compiled code.

The presence of this interfering mechanism takes away our intellectual
right to consider those C functions to be pure functions of their
arguments, as required.

The proofs that you're trying to discredit use pseudo-coded functions
instead of tape-based Turing Machines. The equivalence between the two
depends on the assumption that those functions being pure: they cannot
be procedures which rely on mutable external state, such as a total
execution history of the system or whatever.

I guarantee you that nobody in CS academia at any post-undergraduate
level is going to fall for this lame nonsense.


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

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


#2290 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 15:00 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<kOydnRDlOZQZ6EfCnZ2dnUU7-XPNnZ2d@giganews.com>
In reply to#2286
On 12/16/2020 2:24 PM, André G. Isaak wrote:
> On 2020-12-16 13:04, olcott wrote:
>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
> 
> <snippage>
> 
>>> There's nothing arbitrary here. The requirement is that Halts() must 
>>> be *self-consistent*. That's a requirement which any solution to any 
>>> problem has.
>>>
>>> According to you:
>>>
>>> (1) You call Halts(H_Hat, H_Hat)
>>> (2) This in turn emulates H_Hat(H_Hat)
>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>> (4) Your call in (1) aborts this as non-halting.
>>>
>>> The problem is that the call in (1) and the call in (3) are *identical*
>>
>> No they are not. Call (1) has a much longer execution trace to examine 
>> than call (3).  I have said this at least fifty times.
> 
> The above is entirely irrelevant.
> 
> In both cases, you are calling the *same* function with the *same* 
> input. 
It it not the same input.

In (1) Halts has seen H_Hat() call Halts() two times from the same 
machine address without any control flow instructions in between thus 
meeting the infinite recursion criteria.

In (3) Halts has not seen H_Hat() call Halts() two times from the same 
machine address without any control flow instructions in between thus 
NOT meeting the infinite recursion criteria.

If you would pay attention to what I actually say and not merely glance 
at a few words for the purpose of contriving a rebuttal that would fool 
others that are also not paying attention you would not make dumb 
mistakes like this one.

-- 
Copyright 2020 Pete Olcott

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

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


#2291 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-16 21:09 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216130303.17@kylheku.com>
In reply to#2290
["Followup-To:" header set to comp.theory.]
On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>> On 2020-12-16 13:04, olcott wrote:
>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>> 
>> <snippage>
>> 
>>>> There's nothing arbitrary here. The requirement is that Halts() must 
>>>> be *self-consistent*. That's a requirement which any solution to any 
>>>> problem has.
>>>>
>>>> According to you:
>>>>
>>>> (1) You call Halts(H_Hat, H_Hat)
>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>> (4) Your call in (1) aborts this as non-halting.
>>>>
>>>> The problem is that the call in (1) and the call in (3) are *identical*
>>>
>>> No they are not. Call (1) has a much longer execution trace to examine 
>>> than call (3).  I have said this at least fifty times.
>> 
>> The above is entirely irrelevant.
>> 
>> In both cases, you are calling the *same* function with the *same* 
>> input. 
> It it not the same input.

OK, at least you admit that.

But then, what is left of your argument?

You have, effectively, this:

void H_Hat(u32 P)
{
   if (Halts(P, P, EXTRA_INPUT_A))
     for (;;) { }
   else
     return;
}

int main(void)
{
   if (Halts((u32) H_Hat, (u32) H_Hat, EXTRA_INPUT_B))
     puts("H_Hat(H_Hat) halts!")
   else
     puts("H_Hat(H_Hat) doesn't halt!")
}


This is no longer the "attack template" used in the proofs.

  Halts(H_Hat, H_Hat, EXTRA_INPUT_A)

has nothing to do with:

  Halts(H_Hat, H_Hat, EXTRA_INPUT_B)

The third argument could be an opcode that turns it into a different
function.

  #define Bobs_Halt(P, I) Halts(P, I, EXTRA_INPUT_A);
  #define Dougs_Halt(P, I) Halts(P, I, EXTRA_INPUT_B);

Yes, H_Hat trying to behave opposite to what Bob's Halt decies is a
situation that can be decidable by Doug's Halt.

Nothing surprising or controversial there.

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


#2293 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 16:49 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<28ydnaYJM_5AE0fCnZ2dnUU7-QfNnZ2d@giganews.com>
In reply to#2291
On 12/16/2020 3:09 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
>> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>>> On 2020-12-16 13:04, olcott wrote:
>>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>>>
>>> <snippage>
>>>
>>>>> There's nothing arbitrary here. The requirement is that Halts() must
>>>>> be *self-consistent*. That's a requirement which any solution to any
>>>>> problem has.
>>>>>
>>>>> According to you:
>>>>>
>>>>> (1) You call Halts(H_Hat, H_Hat)
>>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>>> (4) Your call in (1) aborts this as non-halting.
>>>>>
>>>>> The problem is that the call in (1) and the call in (3) are *identical*
>>>>
>>>> No they are not. Call (1) has a much longer execution trace to examine
>>>> than call (3).  I have said this at least fifty times.
>>>
>>> The above is entirely irrelevant.
>>>
>>> In both cases, you are calling the *same* function with the *same*
>>> input.
>> It it not the same input.

> This is no longer the "attack template" used in the proofs.

I waited to respond to your posts until I developed this:

[Debug trace of Halts() deciding halting on H_Hat() ---Halts returns a 
value to main()]

The x86utm operating system as applied to the halting problem is best 
thought of as a hierarchy of UTMs executing other UTMs. Each UTM can 
look downward in the hierarchy from where it is in this hierarchy.

(1) Halts() can see the whole hierarchy.
(3) Can only see the UTMs that it has invoked.

-- 
Copyright 2020 Pete Olcott

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

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


#2295 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 00:21 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216161232.867@kylheku.com>
In reply to#2293
["Followup-To:" header set to comp.theory.]
On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 3:09 PM, Kaz Kylheku wrote:
>> ["Followup-To:" header set to comp.theory.]
>> On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
>>> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>>>> On 2020-12-16 13:04, olcott wrote:
>>>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>>>>
>>>> <snippage>
>>>>
>>>>>> There's nothing arbitrary here. The requirement is that Halts() must
>>>>>> be *self-consistent*. That's a requirement which any solution to any
>>>>>> problem has.
>>>>>>
>>>>>> According to you:
>>>>>>
>>>>>> (1) You call Halts(H_Hat, H_Hat)
>>>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>>>> (4) Your call in (1) aborts this as non-halting.
>>>>>>
>>>>>> The problem is that the call in (1) and the call in (3) are *identical*
>>>>>
>>>>> No they are not. Call (1) has a much longer execution trace to examine
>>>>> than call (3).  I have said this at least fifty times.
>>>>
>>>> The above is entirely irrelevant.
>>>>
>>>> In both cases, you are calling the *same* function with the *same*
>>>> input.
>>> It it not the same input.
>
>> This is no longer the "attack template" used in the proofs.
>
> I waited to respond to your posts until I developed this:
>
> [Debug trace of Halts() deciding halting on H_Hat() ---Halts returns a 
> value to main()]
>
> The x86utm operating system as applied to the halting problem is best 
> thought of as a hierarchy of UTMs executing other UTMs. Each UTM can 
> look downward in the hierarchy from where it is in this hierarchy.
>
> (1) Halts() can see the whole hierarchy.
> (3) Can only see the UTMs that it has invoked.

If Halts is really a pure function of two arguments, and it generates a
hierarchy of UTMs, then every call to Halts with the same two arguments
must generate exactly the same hierarchy of UTMs, and come to exactly
the same conclusion when it examines that hierarchy.

This is true even if one call is nested in the other. If Halts is a pure
function and invoked as Halts(P, I), which generates some structure of
computation, then if that compuation makes a recursive Halts(P, I) call,
that call will generate exactly the same structure of computation (and
so the recursion runs away, generating infinite nestings of that
identical structure).

If some hack is introduced into he execution model such that a nested
Halts(P, I) is distinguishable, then that I'm afraid is invalid.
Halts canno be called a pure function of those two arguments.

At this point, I have repeated the same point more than several times.

You already seem to agree that the two function invocations operate on
some different datum related to the execution sequence, which
constitutes an input that is not reflected in argument list.

This amounts to barking up completely the wrong tree in trying to refute
some class of halting proofs which are expressly rooted in pure
functions, of the arguments beween their parentheses.

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

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


#2292 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 16:37 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<DaGdnXUvT8KlEUfCnZ2dnUU7-VXNnZ2d@giganews.com>
In reply to#2290
On 12/16/2020 3:15 PM, André G. Isaak wrote:
> On 2020-12-16 14:00, olcott wrote:
>> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>>> On 2020-12-16 13:04, olcott wrote:
>>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>>>
>>> <snippage>
>>>
>>>>> There's nothing arbitrary here. The requirement is that Halts() 
>>>>> must be *self-consistent*. That's a requirement which any solution 
>>>>> to any problem has.
>>>>>
>>>>> According to you:
>>>>>
>>>>> (1) You call Halts(H_Hat, H_Hat)
>>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>>> (4) Your call in (1) aborts this as non-halting.
>>>>>
>>>>> The problem is that the call in (1) and the call in (3) are 
>>>>> *identical*
>>>>
>>>> No they are not. Call (1) has a much longer execution trace to 
>>>> examine than call (3).  I have said this at least fifty times.
>>>
>>> The above is entirely irrelevant.
>>>
>>> In both cases, you are calling the *same* function with the *same* 
>>> input. 
>> It it not the same input.
> 
> In (1) you have Halts(H_Hat, H_Hat)
> In (3) you have Halts(H_Hat, H_Hat)
> 
> That stuff between the parentheses is called "the input". In what 
> possible sense can you claim that Halts(H_Hat, H_Hat) and Halts(H_Hat, 
> H_Hat) have different inputs?
> 

Each invocation of Halts() only examines the x86 instructions that have 
been invoked since its own invocation.

It is just like a hierarchy of UTMs executing other UTMs. Each UTM can 
look downward in the hierarchy from where it is in this hierarchy.

(1) Halts() can see the whole hierarchy.
(3) Can only see the UTMs that it has invoked.

>> In (1) Halts has seen H_Hat() call Halts() two times from the same 
>> machine address without any control flow instructions in between thus 
>> meeting the infinite recursion criteria.
>>
>> In (3) Halts has not seen H_Hat() call Halts() two times from the same 
>> machine address without any control flow instructions in between thus 
>> NOT meeting the infinite recursion criteria.
> 
> None of that has anything to do with what the *input* is. What this does 
> amount to is the claim that Halts() behaves differently when being 
> emulated within Halts() than it does otherwise, which means your 
> emulation is broken.
> 

(see what I said above).

>> If you would pay attention to what I actually say and not merely 
>> glance at a few words for the purpose of contriving a rebuttal that 
>> would fool others that are also not paying attention you would not 
>> make dumb mistakes like this one.
> 
> I have made no mistake. You keep raising points intended to rationalize 
> your mistakes, but they are not legitimate, as is clear to everyone on 
> this group who actually understands what the halting problem is.
> 
> André
> 

It is more diffcult than I thought so neither of us made any actual 
mistake.


-- 
Copyright 2020 Pete Olcott

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

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


#2294 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 17:43 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<N8KdnVLL45clBkfCnZ2dnUU7-e3NnZ2d@giganews.com>
In reply to#2292
On 12/16/2020 5:29 PM, André G. Isaak wrote:
> On 2020-12-16 15:37, olcott wrote:
>> On 12/16/2020 3:15 PM, André G. Isaak wrote:
>>> On 2020-12-16 14:00, olcott wrote:
>>>> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>>>>> On 2020-12-16 13:04, olcott wrote:
>>>>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>>>>>
>>>>> <snippage>
>>>>>
>>>>>>> There's nothing arbitrary here. The requirement is that Halts() 
>>>>>>> must be *self-consistent*. That's a requirement which any 
>>>>>>> solution to any problem has.
>>>>>>>
>>>>>>> According to you:
>>>>>>>
>>>>>>> (1) You call Halts(H_Hat, H_Hat)
>>>>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>>>>> (4) Your call in (1) aborts this as non-halting.
>>>>>>>
>>>>>>> The problem is that the call in (1) and the call in (3) are 
>>>>>>> *identical*
>>>>>>
>>>>>> No they are not. Call (1) has a much longer execution trace to 
>>>>>> examine than call (3).  I have said this at least fifty times.
>>>>>
>>>>> The above is entirely irrelevant.
>>>>>
>>>>> In both cases, you are calling the *same* function with the *same* 
>>>>> input. 
>>>> It it not the same input.
>>>
>>> In (1) you have Halts(H_Hat, H_Hat)
>>> In (3) you have Halts(H_Hat, H_Hat)
>>>
>>> That stuff between the parentheses is called "the input". In what 
>>> possible sense can you claim that Halts(H_Hat, H_Hat) and 
>>> Halts(H_Hat, H_Hat) have different inputs?
>>>
>>
>> Each invocation of Halts() only examines the x86 instructions that 
>> have been invoked since its own invocation.
>>
>> It is just like a hierarchy of UTMs executing other UTMs. Each UTM can 
>> look downward in the hierarchy from where it is in this hierarchy.
>>
>> (1) Halts() can see the whole hierarchy.
>> (3) Can only see the UTMs that it has invoked.
>>
>>>> In (1) Halts has seen H_Hat() call Halts() two times from the same 
>>>> machine address without any control flow instructions in between 
>>>> thus meeting the infinite recursion criteria.
>>>>
>>>> In (3) Halts has not seen H_Hat() call Halts() two times from the 
>>>> same machine address without any control flow instructions in 
>>>> between thus NOT meeting the infinite recursion criteria.
>>>
>>> None of that has anything to do with what the *input* is. What this 
>>> does amount to is the claim that Halts() behaves differently when 
>>> being emulated within Halts() than it does otherwise, which means 
>>> your emulation is broken.
>>>
>>
>> (see what I said above).
> 
> That doesn't address the point about the *input*.
> 

Yes it does.

> You claim that your upper Halts(H_Hat, H_Hat) *must* abort the inner one 
> or it would not halt. But the inner one is the exact same function call 
> with the exact same arguments as the outer one. 

The first Halts is a UTM that simulates H_Hat that simulates Halts.
Each UTM in the UTM hierarchy can only see the hierarchy beginning with 
its only slave.

If I actually was incorrect you could point to a specific mistake in 
this: https://groups.google.com/g/comp.theory/c/P5xftn9F0no

The above proves that every hunch and intuition that I am incorrect is 
mistaken.



-- 
Copyright 2020 Pete Olcott

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

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


#2296 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 00:28 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216162234.114@kylheku.com>
In reply to#2294
["Followup-To:" header set to comp.theory.]
On 2020-12-16, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 5:29 PM, André G. Isaak wrote:
>> On 2020-12-16 15:37, olcott wrote:
>>> On 12/16/2020 3:15 PM, André G. Isaak wrote:
>>>> On 2020-12-16 14:00, olcott wrote:
>>>>> On 12/16/2020 2:24 PM, André G. Isaak wrote:
>>>>>> On 2020-12-16 13:04, olcott wrote:
>>>>>>> On 12/16/2020 1:55 PM, André G. Isaak wrote:
>>>>>>
>>>>>> <snippage>
>>>>>>
>>>>>>>> There's nothing arbitrary here. The requirement is that Halts() 
>>>>>>>> must be *self-consistent*. That's a requirement which any 
>>>>>>>> solution to any problem has.
>>>>>>>>
>>>>>>>> According to you:
>>>>>>>>
>>>>>>>> (1) You call Halts(H_Hat, H_Hat)
>>>>>>>> (2) This in turn emulates H_Hat(H_Hat)
>>>>>>>> (3) This in turn emulates Halts(H_Hat, H_Hat)
>>>>>>>> (4) Your call in (1) aborts this as non-halting.
>>>>>>>>
>>>>>>>> The problem is that the call in (1) and the call in (3) are 
>>>>>>>> *identical*
>>>>>>>
>>>>>>> No they are not. Call (1) has a much longer execution trace to 
>>>>>>> examine than call (3).  I have said this at least fifty times.
>>>>>>
>>>>>> The above is entirely irrelevant.
>>>>>>
>>>>>> In both cases, you are calling the *same* function with the *same* 
>>>>>> input. 
>>>>> It it not the same input.
>>>>
>>>> In (1) you have Halts(H_Hat, H_Hat)
>>>> In (3) you have Halts(H_Hat, H_Hat)
>>>>
>>>> That stuff between the parentheses is called "the input". In what 
>>>> possible sense can you claim that Halts(H_Hat, H_Hat) and 
>>>> Halts(H_Hat, H_Hat) have different inputs?
>>>>
>>>
>>> Each invocation of Halts() only examines the x86 instructions that 
>>> have been invoked since its own invocation.
>>>
>>> It is just like a hierarchy of UTMs executing other UTMs. Each UTM can 
>>> look downward in the hierarchy from where it is in this hierarchy.
>>>
>>> (1) Halts() can see the whole hierarchy.
>>> (3) Can only see the UTMs that it has invoked.
>>>
>>>>> In (1) Halts has seen H_Hat() call Halts() two times from the same 
>>>>> machine address without any control flow instructions in between 
>>>>> thus meeting the infinite recursion criteria.
>>>>>
>>>>> In (3) Halts has not seen H_Hat() call Halts() two times from the 
>>>>> same machine address without any control flow instructions in 
>>>>> between thus NOT meeting the infinite recursion criteria.
>>>>
>>>> None of that has anything to do with what the *input* is. What this 
>>>> does amount to is the claim that Halts() behaves differently when 
>>>> being emulated within Halts() than it does otherwise, which means 
>>>> your emulation is broken.
>>>>
>>>
>>> (see what I said above).
>> 
>> That doesn't address the point about the *input*.
>> 
>
> Yes it does.
>
>> You claim that your upper Halts(H_Hat, H_Hat) *must* abort the inner one 
>> or it would not halt. But the inner one is the exact same function call 
>> with the exact same arguments as the outer one. 
>
> The first Halts is a UTM that simulates H_Hat that simulates Halts.

Thus, if Halts is properly a pure funcion, as required, then *every*
halts is a UTM that simulates H_Hat that simulates Halts, and they
are all identical down to infinity.

> Each UTM in the UTM hierarchy can only see the hierarchy beginning with 
> its only slave.

You don't realize that these hierarchies must be identical, in spite
of the nesting. Just like when we zoom in on a fractal, and keep seeing
the same structures. (And other analogies.)

If they are not identical, there is a problem: Halts has a hidden input
not appearing in the arguments, or some other meddling is going on
from the supervising "global" simulator.

Nested hierarchies can have levels that are identical to each other.

If I have an infinite list of identical ducks X, and then I prepend
another identical duck to it to make a list Y, then X and Y are the same
list of ducks.  It's not the case that when I'm looking at Y, I see a
different, longer list of ducks compared to X.

If the lists look different, then it cannot be that what I prepended
is a duck that is identical to the others.

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

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


#2299 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 20:46 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<ttKdnaPKJbLzW0fCnZ2dnUU7-cnNnZ2d@giganews.com>
In reply to#2296
On 12/16/2020 7:51 PM, Kaz Kylheku wrote:
> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>> On 12/16/2020 6:28 PM, Kaz Kylheku wrote:
>>>
>>> Thus, if Halts is properly a pure funcion, as required, then *every*
>>> halts is a UTM that simulates H_Hat that simulates Halts, and they
>>> are all identical down to infinity.
>> So you can't understand that a UTM
>> simulating another UTM
>> simulating another UTM
>> simulating another UTM
>> will see the simulation of three UTMs?
> 
> If the progression is caused by an infinite recursion of a function
> with the same paraemters, then all of the simulation levels are
> indistinguishable. No UTM knows how many levels are above,
> and each one has the same number of identical levels below.
> 
> That's it.
> 

If we allowed the infinite recursion to infinitely recur this would be 
true. We cut off the otherwise infinite recursion at three.

> While it is possible to break that, by doing so you break the
> premise that we have a pure function.
> 

Halts() is a function of its inputs.

> And that's why you're able to do tricks like "abort" the recursion.
> If a recursion is able to terminate, then the recursion levels
> are not the same; 

Of course the recursion levels are not the same.
The first recursive invocation has a depth of one, et cetera...

> something changes by means of which the bottom
> is recognized, and the unwinding process begins.
> 

There is no bottom to infinite recursion.


-- 
Copyright 2020 Pete Olcott

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

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


#2300 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 04:24 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216202107.24@kylheku.com>
In reply to#2299
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 7:51 PM, Kaz Kylheku wrote:
>> If the progression is caused by an infinite recursion of a function
>> with the same paraemters, then all of the simulation levels are
>> indistinguishable. No UTM knows how many levels are above,
>> and each one has the same number of identical levels below.
>> 
>> That's it.
>> 
>
> If we allowed the infinite recursion to infinitely recur this would be 
> true. We cut off the otherwise infinite recursion at three.
>
>> While it is possible to break that, by doing so you break the
>> premise that we have a pure function.
>> 
>
> Halts() is a function of its inputs.

Unfortunately "inputs" no longer refers to "those argument things
between the parentheses that we are painstakingly keeping the same".

>> And that's why you're able to do tricks like "abort" the recursion.
>> If a recursion is able to terminate, then the recursion levels
>> are not the same; 
>
> Of course the recursion levels are not the same.
> The first recursive invocation has a depth of one, et cetera...

Pure functions have no access to any "depth", unless it is given
to them as an argument.

   void recurse(int some_arg, int depth = 0)
   {
      recurse(some_arg, depth + 1);
   }

   recurse(42);


>> something changes by means of which the bottom
>> is recognized, and the unwinding process begins.
>> 
>
> There is no bottom to infinite recursion.

Well, there is when something has stepped in and cut infinity off at three.

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

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


#2309 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-17 10:49 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<zYCdnbhL7baIEUbCnZ2dnUU7-bHNnZ2d@giganews.com>
In reply to#2300
On 12/17/2020 10:23 AM, Kaz Kylheku wrote:
> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>> All that I have to do to refute the {Linz, Sipser, and Kozen} proofs is
>> to show how Halts decides their {Ĥ, D, and N} counter examples as a
>> function of their sequence of instructions that Halts simulates. A
>    ^^^^^^^^
>> simulator has access to the sequence of instructions that it simulates.
> 
> No, you must also agree to understand and use the word "function" in the
> manner that those thinkers use it.
> 

Function (mathematics)
In mathematics, a function is a binary relation between two sets that 
associates every element of the first set to exactly one element of the 
second set.
https://en.wikipedia.org/wiki/Function_(mathematics)

The first set is sequences of x86 instructions and the second set is a 
Boolean value indicating False for this case:

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.
 >
 > Every computation that does halt even when its simulation is never
 > halted is by logical necessity a halting computation.

and True for sequences of x86 instructions that have halted.

Since this is a part halt decider it is also a partial function.
https://en.wikipedia.org/wiki/Partial_function

-- 
Copyright 2020 Pete Olcott

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

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


#2317 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 19:15 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201217110834.671@kylheku.com>
In reply to#2309
["Followup-To:" header set to comp.theory.]
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
> On 12/17/2020 10:23 AM, Kaz Kylheku wrote:
>> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>>> All that I have to do to refute the {Linz, Sipser, and Kozen} proofs is
>>> to show how Halts decides their {Ĥ, D, and N} counter examples as a
>>> function of their sequence of instructions that Halts simulates. A
>>    ^^^^^^^^
>>> simulator has access to the sequence of instructions that it simulates.
>> 
>> No, you must also agree to understand and use the word "function" in the
>> manner that those thinkers use it.
>> 
>
> Function (mathematics)
> In mathematics, a function is a binary relation between two sets that 
> associates every element of the first set to exactly one element of the 
> second set.
> https://en.wikipedia.org/wiki/Function_(mathematics)

In your simulation, a function is no such thing.

The same element <P, I> in the domain set is mapped by Halts into
two results: nontermination (Halts is not able to compute a value)
or else termination with a value.

This is due to the meddling with the control flows based on external
state stored in the emulator.

> The first set is sequences of x86 instructions and the second set is a 
> Boolean value indicating False for this case:

The proof specifies a Halts function which has two inputs that are
arguments to that function, and no other inputs. The inputs are a
program P, and some other input I.

In the test case, these inputs are exactly the same in both calls to
Halts.

In the C language version of the test case, these inputs are
both pointers to the H_Hat function, cast to an integer value.

They are not "sequences of x86 instructions". So when you speak about an
input which is such a sequence, you're speaking about an additional
input that is not among the arguments.

That is not valid; the proof is about a function which has only two
inputs which are those arguments.

You have invented a different proof and are attacking that instead,
while claiming that it's still the same proof.

You are a fraud.

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

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


Page 13 of 21 — ← Prev page 1 … 11 12 [13] 14 15 … 21  Next page →

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


csiph-web