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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-17 15:06 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<oMmdnfu1As6hVUbCnZ2dnUU7-bvNnZ2d@giganews.com>
In reply to#2317
On 12/17/2020 1:15 PM, Kaz Kylheku wrote:
> ["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.
> 

The proof falsely presumes that halt deciding can only be done by static 
analysis. I am under no obligation to maintain that false assumption. As 
long as I show all the steps of how Halts correctly decides:

(a) Linz Ĥ
(b) Sipser K
(c) Kozen N
I have refuted these proofs.

Halts() decides halting based on finite strings representing sequences 
of simulated instructions. As the simulation progresses this sequence 
increases in length. At a certain point in the execution trace the outer 
halts has seen enough of the execution trace of H_Hat to determine that 
H_Hat is invoking Halts in infinite recursion.



-- 
Copyright 2020 Pete Olcott

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-17 17:29 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<aomdnQL5EtpbdEbCnZ2dnUU7-X_NnZ2d@giganews.com>
In reply to#2300
On 12/17/2020 10:06 AM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-17, olcott <NoOne@nospicedham.NoWhere.com> wrote:
>> On 12/16/2020 10:50 PM, Kaz Kylheku wrote:
>>> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>>>> On 12/16/2020 10:24 PM, Kaz Kylheku wrote:
>>>>> 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".
>>>>>
>>>>
>>>> I think that may be simply because you have a narrow minded view of
>>>> inputs as some fixed sized set of objects.
>>>
>>> Oh, I specifically do not. Above, I'm demonstrating flexibility and
>>> insight; I'm recognizing the new situation that there are more inputs
>>> than just the arguments to those function parameters, and I'm
>>> acknowleding that those are bona fide inputs.
>>>
>>
>> Great !
>>
>>> However, the proofs that are used to demonstrate the nonexistence of a
>>> universal halting aglorithms specify certain functions which have
>>> certain inputs, and only those inputs, and are generally pure.
>>
>> The dynamically generated execution trace of the simulation of H_Hat and
>> its input are what Halts bases its halting decision on. That the
>> conventiopal proof may have incorectly assumed static analysis is merely
>> a false assumption on its part.
> 
> The conventional proofs have no such problem. They place absolutely no
> restrictions on Halts other than that it have two arguments, return a
> Boolean indication and be a function. Within these constraints, no
> technique, be it "static" or "dynamic" is off the table.
> 
> The proofs show that no definition of Halts, under their constraints,
> can be a universal halting decider. Because Halts is constrained in such
> a way that it can be comprised of any Turing machine (there is an
> equivalence between pure funcions and Turing machines), the proofs show
> that no Turing machine can be a universal halting decider.
> 
> Your apparatus contains contains functions which meet a different,
> informal definition of the word "function" denoting an imperative
> procedure that returns a value, that may access (and even mutate) state
> information not contained in its arguments.
> 
> Your claim is that your apparatus is an embodiment of the entities
> described in the proof, and therefore properties of the apparatus speak
> to the proof. This claim is false, and is to a large extent based
> on equivocation over word semantics: changing between the definition of
> "function" in mathematics jargon, and the definition of "function" in
> the jargon of certain programming languages.
> 
> Equivocation is one of the most embarrassing errors of inference that
> man can make: not pinning down the meanings of words.
> 
> The assumptions which a proof makes are its privilege, and they
> contribute to its definition. If you have to change them in order to
> challenge the proof, you're attacking a strawman caricature of the proof,
> not the real one.
> 
>> The halting proofs merely falsely assume static rather than dynamic
>> analysis. That is their mistake not mine.
> 
> No such words appear in any proof you can cite from any credible
> textbook or paper. All proper presentations of the proof allow the
> decider simply be an arbitrary recursive funtion, which allows it to be
> any Turing machine.
> 
> (Quite literally, the decider function can encode the arguments P and I
> onto a tape of symbols, and feed it to an actual Universal Turing Machine.)
> 
> The techniques you are using do not allow this; you could not translate
> your simulation approach such that Halts encodes P and I onto a tape and
> just launches a UTM, and then (if the UTM halts) collects the return
> value from the tape.
> 
> Your approach would require the multiple invocations of that UTM to be
> diddled by an interfering process into incorrectly producing different
> results.
> 

It is only the equivalent of UTM Halts simulating UTM H_Hat simulating 
UTM Halts simulating UTM H_Hat... that is cut off from simulating UTM 
Halts again by the first instance of Halts().

-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-18 18:02 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201218095907.561@kylheku.com>
In reply to#2321
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>> Your approach would require the multiple invocations of that UTM to be
>> diddled by an interfering process into incorrectly producing different
>> results.
>> 
>
> It is only the equivalent of UTM Halts simulating UTM H_Hat simulating 
> UTM Halts simulating UTM H_Hat... that is cut off from simulating UTM 
> Halts again by the first instance of Halts().

What you're missing is that each Halts *invocation* is a new TM that
must start in a completely blank state, with no information other than
what is provided in its arguments.

Your simulation is intended to make a statement about a proof; but
the information leaks it depends on mean that it is not so.

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-18 12:24 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<rvCdnQIjobVNbkHCnZ2dnUU7-XXNnZ2d@giganews.com>
In reply to#2326
On 12/18/2020 12:02 PM, Kaz Kylheku wrote:
> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>>> Your approach would require the multiple invocations of that UTM to be
>>> diddled by an interfering process into incorrectly producing different
>>> results.
>>>
>>
>> It is only the equivalent of UTM Halts simulating UTM H_Hat simulating
>> UTM Halts simulating UTM H_Hat... that is cut off from simulating UTM
>> Halts again by the first instance of Halts().
> 
> What you're missing is that each Halts *invocation* is a new TM that
> must start in a completely blank state, with no information other than
> what is provided in its arguments.
> 

Yes, except that the preceding simulations in the simulation hierarchy 
are no longer a blank slate. These simulations can see every detail of 
the execution trace of the subsequent simulations.

> Your simulation is intended to make a statement about a proof; but
> the information leaks it depends on mean that it is not so.
> 

The pinnacle of a simulation hierarchy can see every instruction that is 
simulated by subsequent simulations within this hierarchy.

Maybe this is too difficult to understand without seeing all the details 
of the 220 page trace and the source code of the whole system.


-- 
Copyright 2020 Pete Olcott

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-17 21:18 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<wJOdnRCdU8bzgkHCnZ2dnUU7-VPNnZ2d@giganews.com>
In reply to#2300
On 12/17/2020 8:50 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 12/17/2020 8:19 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
> <cut>
>>>> 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.
>>
>> How so no? (Can you stay on topic?)
> 
> The topic has been the same for two years.  Everyone has been wanting to
> see those two "actual Turing machines", "fully encoded" that are
> "exactly and precisely as in Linz".
> 

Back then I had not created / discovered the idea that every C function 
translated into the x86 language that does need more memory than is has 
is computationally equivalent to a Turing machine. I was referring to 
this C function a fully encoded Turing machine:

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

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

Now I know that it computationally equivalent to a Turing machine, which 
for all practical purposes <is> an actual Turing machine.

> Now look at the squalid claim you have now been reduced to making.  No
> actual Turing machines, and not even a Halts function.  

The Halts() function is very difficult to understand because every time 
that it is invoked it creates a whole separate process context with its 
own memory, registers and stack to simulate its input.

I wanted to make this as much as possible equivalent to a chain of UTMs. 
When H_Hat invokes Halts() it does this in its own process context. 
These details would confuse the people here. Unless a person has written 
an operating system these details could be overwelming.

> You deviously
> don't post that in any of your junk dumps because you don't have it
> written.  And as for the H/H^ relationship "exactly and precisely as in
> Linz" you have explicitly broken it completely.
> 

Obviously I have not broken it as can be seen by the code above.
Halts() is a function of the execution trace of its input.

> You don't like being reminded of the Big Lie from two years ago, but

It never ever was a lie, because the C function above <is> 
computationally equivalent to a Turing machine for all practical 
purposes it <is> a Turing machine.

> everything you claim now is a direct result of walking back that
> grandiose claim (and, to be fair, I am pretty sure that is was just a
> Big Delusion at the time -- the lies were in the cover-up that
> followed).
> 

Did you know that Donald Trump's best net approval rating was -4%  ?

https://projects.fivethirtyeight.com/trump-approval-ratings/adults/?fbclid=IwAR3ZkDbYtrpcr2zmfAjUVJ1n9aQYIlnfikRSpzDVdZ05FXZTA8hCVH01G7k

He knows this therefore he knows that he did not win the election.

DON'T BE A DONALD TRUMP !!!


-- 
Copyright 2020 Pete Olcott

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

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


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

From"Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>
Date2020-12-17 20:20 -0800
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<1a147498-a8c4-c844-57c0-71734e728c3f@gmail.com>
In reply to#2323
On 12/17/2020 7:18 PM, olcott wrote:
> On 12/17/2020 8:50 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 12/17/2020 8:19 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>> <cut>
>>>>> 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.
>>>
>>> How so no? (Can you stay on topic?)
>>
>> The topic has been the same for two years.  Everyone has been wanting to
>> see those two "actual Turing machines", "fully encoded" that are
>> "exactly and precisely as in Linz".
>>
> 
> Back then I had not created / discovered the idea that every C function 
> translated into the x86 language that does need more memory than is has 
> is computationally equivalent to a Turing machine. I was referring to 
> this C function a fully encoded Turing machine:
> 
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Halts)
>      HERE: goto HERE;
>    else
>      HALT
> }
> 
> int main()
> {
>    u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>    Output_Debug_Trace();
>    Output("Input_Would_Halt =", Input_Would_Halt);
>    HALT;
> }
> 
> Now I know that it computationally equivalent to a Turing machine, which 
> for all practical purposes <is> an actual Turing machine.
> 
>> Now look at the squalid claim you have now been reduced to making.  No
>> actual Turing machines, and not even a Halts function. 
> 
> The Halts() function is very difficult to understand because every time 
> that it is invoked it creates a whole separate process context with its 
> own memory, registers and stack to simulate its input.
> 
> I wanted to make this as much as possible equivalent to a chain of UTMs. 
> When H_Hat invokes Halts() it does this in its own process context. 
> These details would confuse the people here. Unless a person has written 
> an operating system these details could be overwelming.
> 
>> You deviously
>> don't post that in any of your junk dumps because you don't have it
>> written.  And as for the H/H^ relationship "exactly and precisely as in
>> Linz" you have explicitly broken it completely.
>>
> 
> Obviously I have not broken it as can be seen by the code above.
> Halts() is a function of the execution trace of its input.
> 
>> You don't like being reminded of the Big Lie from two years ago, but
> 
> It never ever was a lie, because the C function above <is> 
> computationally equivalent to a Turing machine for all practical 
> purposes it <is> a Turing machine.
> 
>> everything you claim now is a direct result of walking back that
>> grandiose claim (and, to be fair, I am pretty sure that is was just a
>> Big Delusion at the time -- the lies were in the cover-up that
>> followed).
>>
> 
> Did you know that Donald Trump's best net approval rating was -4%  ?
> 
> https://projects.fivethirtyeight.com/trump-approval-ratings/adults/?fbclid=IwAR3ZkDbYtrpcr2zmfAjUVJ1n9aQYIlnfikRSpzDVdZ05FXZTA8hCVH01G7k 
> 
> 
> He knows this therefore he knows that he did not win the election.
> 
> DON'T BE A DONALD TRUMP !!!
> 
> 
You are a mean person.

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 18:44 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<luWdnePJTeJMNEfCnZ2dnUU7-SfNnZ2d@giganews.com>
In reply to#2294
On 12/16/2020 6:07 PM, André G. Isaak wrote:
> On 2020-12-16 16:43, olcott 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.
> 
> No, it does not.
> 
>>> 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.
> 
> You're failing to address the fundamental inconsistency here. 

You could look at the executition trace here and see that you are wrong:

On 12/16/2020 3:27 PM, olcott wrote:
Debug trace of Halts() deciding halting on H_Hat() ---Halts returns a 
value to main()

Try and find an actual programming error. You have got intuition and 
hunches that seems to show that I am wrong and I have complete proof 
that I am right. Look at the proof and try and find an error.


-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 01:55 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216175225.418@kylheku.com>
In reply to#2297
["Followup-To:" header set to comp.theory.]
> Try and find an actual programming error. You have got intuition and 

Firstly, that request is impossible; you have not published all the
code: not even in binary form.

> hunches that seems to show that I am wrong and I have complete proof 
> that I am right. Look at the proof and try and find an error.

Yet, I'm willing to accept that there is no programming error. I am
assuming (as I have been for quite a while) that the whole apparatus you
have prepared works according to your requirements.

Those requirements simply don't amount to something which refutes a
proof. You're equivocating by switching the meaning of the pure
functions in the proof into impure computer procedures in your
apparatus.

Bug-free as it may be, it doesn't prove what you want to prove.

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-16 22:59 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<99CdnU-XMppTeEfCnZ2dnUU7-UvNnZ2d@giganews.com>
In reply to#2298
On 12/16/2020 10:39 PM, Kaz Kylheku wrote:
> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>> On 12/16/2020 7:55 PM, Kaz Kylheku wrote:
>>> ["Followup-To:" header set to comp.theory.]
>>>> Try and find an actual programming error. You have got intuition and
>>>
>>> Firstly, that request is impossible; you have not published all the
>>> code: not even in binary form.
>>>
>>>> hunches that seems to show that I am wrong and I have complete proof
>>>> that I am right. Look at the proof and try and find an error.
>>>
>>> Yet, I'm willing to accept that there is no programming error. I am
>>> assuming (as I have been for quite a while) that the whole apparatus you
>>> have prepared works according to your requirements.
>>>
>>> Those requirements simply don't amount to something which refutes a
>>> proof. You're equivocating by switching the meaning of the pure
>>> functions in the proof into impure computer procedures in your
>>> apparatus.
>>>
>>> Bug-free as it may be, it doesn't prove what you want to prove.
>>>
>>
>> THIS BY ITSELF TOTALLY PROVES THAT I AM CORRECT.
> 
> I also have a program which does exactly the same thing.
> 
> It took me all of 15 minutes to produce.
> 
Yet you do not have the x86 code generated by the Microsoft C compiler 
along with the self-evidently correct execution trace of this code 
showing that the halt deciding criteria was met by this execution trace.

Also the local halt decider apparently is a function of the execution 
trace of the inputs that it simulates. I just empirically verified this.

-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 05:36 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201216213109.583@kylheku.com>
In reply to#2301
["Followup-To:" header set to comp.theory.]
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
> On 12/16/2020 10:39 PM, Kaz Kylheku wrote:
>> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>>> On 12/16/2020 7:55 PM, Kaz Kylheku wrote:
>>>> ["Followup-To:" header set to comp.theory.]
>>>>> Try and find an actual programming error. You have got intuition and
>>>>
>>>> Firstly, that request is impossible; you have not published all the
>>>> code: not even in binary form.
>>>>
>>>>> hunches that seems to show that I am wrong and I have complete proof
>>>>> that I am right. Look at the proof and try and find an error.
>>>>
>>>> Yet, I'm willing to accept that there is no programming error. I am
>>>> assuming (as I have been for quite a while) that the whole apparatus you
>>>> have prepared works according to your requirements.
>>>>
>>>> Those requirements simply don't amount to something which refutes a
>>>> proof. You're equivocating by switching the meaning of the pure
>>>> functions in the proof into impure computer procedures in your
>>>> apparatus.
>>>>
>>>> Bug-free as it may be, it doesn't prove what you want to prove.
>>>>
>>>
>>> THIS BY ITSELF TOTALLY PROVES THAT I AM CORRECT.
>> 
>> I also have a program which does exactly the same thing.
>> 
>> It took me all of 15 minutes to produce.
>> 
> Yet you do not have the x86 code generated by the Microsoft C compiler 
> along with the self-evidently correct execution trace of this code 
> showing that the halt deciding criteria was met by this execution trace.

Anyone can produce the GCC assembly output for the code if they wish
with gcc -S. Won't really reveal anything interesting.
We can use it to confirm that the infinite loop in H_Hat is really
infinite (it is: I did look).

With gdb, we can single step through he code, one instruction at a time.
That also won't really shed any light on anything.

I have prints in the right places showing that my H_Hat(H_Hat) returns
when invoked, showing that it it halts, and that Halts(H_Hat, H_Hat)
calculates this, and returns 1. H_Hat has the right structure: it also calls
Halts(H_Hat, H_Hat) and "behaves opposite": if that returns 1, it
doesn't halt.

> Also the local halt decider apparently is a function of the execution 
> trace of the inputs that it simulates. I just empirically verified this.

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-17 10:37 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<Y86dnao2VqnMFEbCnZ2dnUU7-dHNnZ2d@giganews.com>
In reply to#2302
On 12/17/2020 10:14 AM, Kaz Kylheku wrote:
> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>> You do not have a formal proof expressed as a sequence of x86
>> instruction that specify infinite recursion, I do.
> 
> You don't have "x86 instructions". Those are specified in Intel
> architecture manuals.
> 
> Intel does not specify an instruction set which causes ostensibly
> infinite recursion to actually end in three levels.
> 
> That is a dirty hack, which is no better than the one in my program.
> 
> The "olcott instructions" only look syntacticaly like x86.
> (Just like "olcott functions" only look syntactically like pure
> functions, but aren't).
> 
> You apparently don't know the difference between syntax and semantics;

Syntax mathamatically maps to corresonding semantics.

> you think that if you can keep the syntax of the elements in a proof,
> more or less, but radically change the semantics, you can then refute
> the proof.
> 

The invocation of the x86 instructions in main() and H_Hat() stipulates 
the resulting execution trace as a logical consequence of the x86 formal 
language. When we apply the infinite recursion detection axiom to this 
stipulated sequence we have a formal proof of non-halting.

-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-17 16:46 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201217084245.656@kylheku.com>
In reply to#2307
["Followup-To:" header set to comp.theory.]
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
> On 12/17/2020 10:14 AM, Kaz Kylheku wrote:
>> On 2020-12-17, olcott <NoOne@NoWhere.com> wrote:
>>> You do not have a formal proof expressed as a sequence of x86
>>> instruction that specify infinite recursion, I do.
>> 
>> You don't have "x86 instructions". Those are specified in Intel
>> architecture manuals.
>> 
>> Intel does not specify an instruction set which causes ostensibly
>> infinite recursion to actually end in three levels.
>> 
>> That is a dirty hack, which is no better than the one in my program.
>> 
>> The "olcott instructions" only look syntacticaly like x86.
>> (Just like "olcott functions" only look syntactically like pure
>> functions, but aren't).
>> 
>> You apparently don't know the difference between syntax and semantics;
>
> Syntax mathamatically maps to corresonding semantics.

Absolutely, stupidly false.  A given syntax maps to any number of
different semantics, which can be whatever you want.

It's very easy to equivocate on syntax: to change the semantics of a
synax in the middle of argumentation to falsely arrive at a conclusion.

Or to argue with someone's reasoning by changing the meaning of some
syntax they are using.

(The semantics of syntax is a generalization of word semantics. A word is
a syntactic element and its meaning is the semantics of a tiny piece of
syntax.)

>> you think that if you can keep the syntax of the elements in a proof,
>> more or less, but radically change the semantics, you can then refute
>> the proof.
>> 
>
> The invocation of the x86 instructions in main() and H_Hat() stipulates 
> the resulting execution trace as a logical consequence of the x86 formal 
> language.

So, if that is the case, why can't we just run them on a fine x86 CPU
from Intel?

> When we apply the infinite recursion detection axiom to this 
> stipulated sequence we have a formal proof of non-halting.

You cannot add axioms that are not used in the proof you're trying to
refute.  You must work with the same axioms.

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-19 09:38 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<q_qdnagF0-0Pg0PCnZ2dnUU7-QfNnZ2d@giganews.com>
In reply to#2280
On 12/19/2020 5:47 AM, Malcolm McLean wrote:
> On Saturday, 19 December 2020 at 03:48:12 UTC, olcott wrote:
>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>> olcott <No...@NoWhere.com> writes:
>>>
>>>> On 12/17/2020 8:35 PM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> On 12/16/2020 6:25 PM, Ben Bacarisse wrote:
>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>
>>>>>>>> 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:
>>>>>>>>>>>
>>>>>>>>>>>> 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:
>>>>>>>>>>>> The infinitely recursive invocation of Halts() by Confound_Halts()
>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>
>>>>>>>>>>> OK that's excellently clear.
>>>>>>>
>>>>>>> You are perfectly clear. Halts fails to meet the conditions set out in
>>>>>>> the challenge by not returning a value:
>>>>>>>
>>>>>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>>>>>> finite computation and false otherwise.
>>>>>>>
>>>>>>> Not returning a value, even if only in some contexts, makes it a fail.
>>> <cut>
>>>>
>>>> I just proved how it does perrectly meet its conditions.
>>>
>>> Don't be silly. The specification:
>>>
>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>> finite computation and false otherwise.
>>>
>>> requires that the function return a value, regardless of context.
>>>
>> There are contexts where functions sometimes do not return values, such
>> as this one:
>>
>> int Divide(int X, int Y)
>> {
>> return X / Y;
>> }
>>
>> int main()
>> {
>> int Z = (5, 0);
>> }
>>
> Divide has a special point at denominator 0 where the graph jumps from -infinity
> to + infinity. So one way of solving this is to say that the (mathematical sense) function
> isn't defined for this input. The code can do anything if you say that the input is
> disallowed - raise a signal, return zero, go into an infinite loop.
> 
> The function Halts() is defined for all inputs that represent a valid Turing machine
> and tape. The machine will either eventually halt or it won't. However whilst the
> function is defined, it is not computable. That's the "halting problem". It is of
> course reasonable, in fact necessary, if attempting a halt decider to say that it
> is a "partial halt decider". If an input with the halt decider itself embedded into it
> is presented, ths might be one of the inputs it can't handle, and it goes off into
> infinite recursion. Fair enough, no-one would expect any better.
> 
> If it detects the infinite recursion and halts it, you've got a sort of chicken and
> egg problem - the recursrion is of the halt detector itself, which detects its
> own recursion, and stops. So it's not in fact infinitely recursive. You seem to have
> realised this and it's led you to solutions such as "would be non-halting unless
> aborted", and the top-level supervisor.
> 

Defining a halt decider that simply does not work does not show that the 
halting problem is undecidable. Instead we must define an input that 
cannot be correctly decided by any decider. A halt decider using the 
following architecture cannot be shown to have undecidable inputs:

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

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

> The halt detector simply takes a machine description as input. So if that leads to
> problems with infinite recursion, that's because you programmed those problems

There is a mapping from finite strings representing a machine and its 
input to ordered sets of finite stings of execution sequences after N 
steps of the computation have been completed.

A second mapping from elements of the set of sequences to a Boolean 
values indicating halting status could occur. Unrecognized patterns of 
infinite execution would never map to a Boolean value. The rest would 
map to True for halted after N steps or False for infinite execution 
detected after M steps.

> in. But the Linz example is problematic for a halt detector based on emulation even
> without considering the inversion of input. Where you've gone wrong is in assuming
> that because you can work on those emulation problems, then central point of Linz's
> example - the inversion of the result, goes away.
> 

The inversion result goes away because the call to Halts from H_Hat() is 
inherently infinitely recursive for every halt decider based on 
simulating its input. A simple execution trace by an ordinary UTM will 
show this.

It would not be infinitely recursive if the halt decider based its 
decision on a phone call to the psychic hotline or sent an email to the 
chairman of Oracle Corporation (Larry Ellison).

-- 
Copyright 2020 Pete Olcott

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-19 09:43 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<H8qdnUZlwOEVgkPCnZ2dnUU7-SXNnZ2d@giganews.com>
In reply to#2280
On 12/19/2020 9:24 AM, André G. Isaak wrote:
> On 2020-12-19 07:47, olcott wrote:
>> On 12/19/2020 1:35 AM, Kaz Kylheku wrote:
>>> On 2020-12-19, olcott <NoOne@NoWhere.com> wrote:
>>>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>> The infinitely recursive invocation of Halts() by 
>>>>>>>>>>>>>> Confound_Halts()
>>>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>>>
>>>>>>>>>>>>> OK that's excellently clear.
>>>>>>>>>
>>>>>>>>> You are perfectly clear.  Halts fails to meet the conditions 
>>>>>>>>> set out in
>>>>>>>>> the challenge by not returning a value:
>>>>>>>>>
>>>>>>>>>      Show a function F such that F(P, I) is true if, and only 
>>>>>>>>> if, P(I) is a
>>>>>>>>>      finite computation and false otherwise.
>>>>>>>>>
>>>>>>>>> Not returning a value, even if only in some contexts, makes it 
>>>>>>>>> a fail.
>>>>> <cut>
>>>>>>
>>>>>> I just proved how it does perrectly meet its conditions.
>>>>>
>>>>> Don't be silly.  The specification:
>>>>>
>>>>>     Show a function F such that F(P, I) is true if, and only if, 
>>>>> P(I) is a
>>>>>     finite computation and false otherwise.
>>>>>
>>>>> requires that the function return a value, regardless of context.
>>>>>
>>>>
>>>> There are contexts where functions sometimes do not return values, such
>>>> as this one:
>>>
>>> Well, and so what? If some proposed F doesn't return a value for some
>>> <P, I> pair in the relevant domain, then it doesn't meet the above
>>> requirement, right? It thereby shows itself not to be a universal 
>>> halting
>>> decider. Is that difficult?
>>>
>>
>> Then there is no such thing as a function because every function can 
>> be preceded by an infinite loop so that this otherwise function does 
>> not always return a value in the relevant domain.
> 
> 
>> int Add(int X, int Y)
>> {
>>    return X + Y;
>> }
>>
>> int main()
>> {
>>    HERE goto HERE;
>>    ADD(2,3);
>> }
> 
> You can't seriously be advancing this as a real argument.
> 
> main() and Add() are two separate functions. Add() always returns a 
> value. main() does not. main() never gets around to calling Add(), so 
> the above does *not* illustrate a case of Add() not returning a value.
> 
> André
> 

The fact that Halts() does correctly return false for this input
void H_Hat(u32 P)
{
   u32 Input_Halts = Halts(P, P);
   if (Input_Halts)
     HERE: goto HERE;
   else
     HALT
}
means that Halts() is a decider for this input.


-- 
Copyright 2020 Pete Olcott

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-19 10:20 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<ocGdnag6rJuktUPCnZ2dnUU7-SvNnZ2d@giganews.com>
In reply to#2329
On 12/19/2020 9:58 AM, André G. Isaak wrote:
> On 2020-12-19 08:43, olcott wrote:
>> On 12/19/2020 9:24 AM, André G. Isaak wrote:
>>> On 2020-12-19 07:47, olcott wrote:
>>>> On 12/19/2020 1:35 AM, Kaz Kylheku wrote:
>>>>> On 2020-12-19, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>> The infinitely recursive invocation of Halts() by 
>>>>>>>>>>>>>>>> Confound_Halts()
>>>>>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> OK that's excellently clear.
>>>>>>>>>>>
>>>>>>>>>>> You are perfectly clear.  Halts fails to meet the conditions 
>>>>>>>>>>> set out in
>>>>>>>>>>> the challenge by not returning a value:
>>>>>>>>>>>
>>>>>>>>>>>      Show a function F such that F(P, I) is true if, and only 
>>>>>>>>>>> if, P(I) is a
>>>>>>>>>>>      finite computation and false otherwise.
>>>>>>>>>>>
>>>>>>>>>>> Not returning a value, even if only in some contexts, makes 
>>>>>>>>>>> it a fail.
>>>>>>> <cut>
>>>>>>>>
>>>>>>>> I just proved how it does perrectly meet its conditions.
>>>>>>>
>>>>>>> Don't be silly.  The specification:
>>>>>>>
>>>>>>>     Show a function F such that F(P, I) is true if, and only if, 
>>>>>>> P(I) is a
>>>>>>>     finite computation and false otherwise.
>>>>>>>
>>>>>>> requires that the function return a value, regardless of context.
>>>>>>>
>>>>>>
>>>>>> There are contexts where functions sometimes do not return values, 
>>>>>> such
>>>>>> as this one:
>>>>>
>>>>> Well, and so what? If some proposed F doesn't return a value for some
>>>>> <P, I> pair in the relevant domain, then it doesn't meet the above
>>>>> requirement, right? It thereby shows itself not to be a universal 
>>>>> halting
>>>>> decider. Is that difficult?
>>>>>
>>>>
>>>> Then there is no such thing as a function because every function can 
>>>> be preceded by an infinite loop so that this otherwise function does 
>>>> not always return a value in the relevant domain.
>>>
>>>
>>>> int Add(int X, int Y)
>>>> {
>>>>    return X + Y;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>>    HERE goto HERE;
>>>>    ADD(2,3);
>>>> }
>>>
>>> You can't seriously be advancing this as a real argument.
>>>
>>> main() and Add() are two separate functions. Add() always returns a 
>>> value. main() does not. main() never gets around to calling Add(), so 
>>> the above does *not* illustrate a case of Add() not returning a value.
>>>
>>> André
>>>
>>
>> The fact that Halts() does correctly return false for this input
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    else
>>      HALT
>> }
>> means that Halts() is a decider for this input.
> 
> Why do you insist on responding with completely irrelevant replies? My 
> point above had to do with your absurd claim that there is no such thing 
> as a function and had nothing to do with your "decider".
> 
> And will you *please* learn what various terms mean. You have claimed to 
> have a partial decider, not a decider. 

A partial decider is a decider for a set of inputs and this can be 
equally stated as a decider for a particular class of inputs or a 
particular instance of an input. When you attempt to correct me make 
sure you do this correctly.

> A partial decider might decide 
> certain inputs, but it is not a *decider* for those inputs. 

So a box of ice cream might actually be a bottle of ketchup and thus not 
a box of ice cream at all thus a thing is sometimes not itself.

> A decider, 
> by definition, returns a result for *all* inputs. A partial decider 
> returns results for some inputs.
> 
> But what you have doesn't qualify as a partial halt decider because it 
> evaluates Halts(H_Hat, H_Hat) inconsistently.

That you falsely believe that it evaluates Halts(H_Hat, H_Hat) 
inconsistently is not at all the same thing as actual inconsistency.

Some people "believe" that Trump won the election even though his best 
approval rating of his whole presidency had 4% more voters disapprove of 
his performance than those that approved.

https://projects.fivethirtyeight.com/trump-approval-ratings/adults/?fbclid=IwAR0PqOZ7OMyIXn2LmlxIxTCV1FCN2Cl1mtSXCiuPMlg8txv_X5kyfOB8DOA

When he always had a significant majority of voters against him then he 
knows damn well he lost the election. That he continues to lie about 
this to stir up violent action to overturn the will of the people is 
insurrection.

> Recall that the function it attempts to compute is a *mathematical* 
> function. This function, therefore, either maps Halts(H_Hat, H_Hat) to 
> HALTS or to DOESN'T HALT. It does this with 100% consistency. It cannot 
> sometimes map to HALTS and sometimes to DOESN'T HALT.
> 
> Your Halts(H_Hat, H_Hat) in main returns DOESN'T HALT based on its 
> dubious conclusion that the embedded Halts(H_Hat, H_Hat) doesn't halt.
> 
> That means your Halts(H_Hat, H_Hat) claims that it, itself, does not 
> halt, despite the fact that it does in fact halt and return a value.
> 
> You should look up the word 'consistency' in a dictionary, preferably a 
> mathematical or philosophical dictionary rather than a general purpose one.
> 
> André
> 


-- 
Copyright 2020 Pete Olcott

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

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


#2332 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (universal versus partial decider)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-19 10:47 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (universal versus partial decider)
Message-ID<AKudnVTmnfc2s0PCnZ2dnUU7-aHNnZ2d@giganews.com>
In reply to#2329
On 12/19/2020 9:58 AM, André G. Isaak wrote:
> On 2020-12-19 08:43, olcott wrote:
>> On 12/19/2020 9:24 AM, André G. Isaak wrote:
>>> On 2020-12-19 07:47, olcott wrote:
>>>> On 12/19/2020 1:35 AM, Kaz Kylheku wrote:
>>>>> On 2020-12-19, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>> The infinitely recursive invocation of Halts() by 
>>>>>>>>>>>>>>>> Confound_Halts()
>>>>>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> OK that's excellently clear.
>>>>>>>>>>>
>>>>>>>>>>> You are perfectly clear.  Halts fails to meet the conditions 
>>>>>>>>>>> set out in
>>>>>>>>>>> the challenge by not returning a value:
>>>>>>>>>>>
>>>>>>>>>>>      Show a function F such that F(P, I) is true if, and only 
>>>>>>>>>>> if, P(I) is a
>>>>>>>>>>>      finite computation and false otherwise.
>>>>>>>>>>>
>>>>>>>>>>> Not returning a value, even if only in some contexts, makes 
>>>>>>>>>>> it a fail.
>>>>>>> <cut>
>>>>>>>>
>>>>>>>> I just proved how it does perrectly meet its conditions.
>>>>>>>
>>>>>>> Don't be silly.  The specification:
>>>>>>>
>>>>>>>     Show a function F such that F(P, I) is true if, and only if, 
>>>>>>> P(I) is a
>>>>>>>     finite computation and false otherwise.
>>>>>>>
>>>>>>> requires that the function return a value, regardless of context.
>>>>>>>
>>>>>>
>>>>>> There are contexts where functions sometimes do not return values, 
>>>>>> such
>>>>>> as this one:
>>>>>
>>>>> Well, and so what? If some proposed F doesn't return a value for some
>>>>> <P, I> pair in the relevant domain, then it doesn't meet the above
>>>>> requirement, right? It thereby shows itself not to be a universal 
>>>>> halting
>>>>> decider. Is that difficult?
>>>>>
>>>>
>>>> Then there is no such thing as a function because every function can 
>>>> be preceded by an infinite loop so that this otherwise function does 
>>>> not always return a value in the relevant domain.
>>>
>>>
>>>> int Add(int X, int Y)
>>>> {
>>>>    return X + Y;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>>    HERE goto HERE;
>>>>    ADD(2,3);
>>>> }
>>>
>>> You can't seriously be advancing this as a real argument.
>>>
>>> main() and Add() are two separate functions. Add() always returns a 
>>> value. main() does not. main() never gets around to calling Add(), so 
>>> the above does *not* illustrate a case of Add() not returning a value.
>>>
>>> André
>>>
>>
>> The fact that Halts() does correctly return false for this input
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    else
>>      HALT
>> }
>> means that Halts() is a decider for this input.
> 
> Why do you insist on responding with completely irrelevant replies? My 
> point above had to do with your absurd claim that there is no such thing 
> as a function and had nothing to do with your "decider".
> 
> And will you *please* learn what various terms mean. You have claimed to 
> have a partial decider, not a decider. A partial decider might decide 
> certain inputs, but it is not a *decider* for those inputs.

If the term "decider" always means universal decider then the term 
partial decider is self-contradictory because it means a universal 
decider that is not universal.

Ultimately the conventional application of the terms: "decider" and 
partial decider" depends on the sets that decider decides.

If a decider can decide every element of a set then it is a universal 
decider for every element in that set. It can be called a universal 
decider for every element of that set even if the set only contains a 
single element.

On the other hand if a decider can correctly decide every element of the 
set of Turing machine descriptions then it can be called a universal 
decider for this precisely defined set.

Instead of leaving these things implied it is much more effective 
communication use to the terms universal decider and partial decider 
(not just decider by itself) and apply these more precise terms to the 
precisely defined sets that they apply.

Even a universal halt decider that can correctly decide halting for the 
set of finite strings representing Turing machines might be utterly 
baffled when presented with the finite string of an English poem, thus 
even a universal decider must have its universe explicitly defined.

-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-19 22:32 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201219143106.709@kylheku.com>
In reply to#2329
On 2020-12-19, olcott <NoOne@NoWhere.com> wrote:
> The fact that Halts() does correctly return false for this input
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Halts)
>      HERE: goto HERE;
>    else
>      HALT
> }
> means that Halts() is a decider for this input.

No, it means that Halts is not a pure function of two immutable
arguments, but some kind of swindle.

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

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


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

Fromolcott <NoOne@NoWhere.com>
Date2020-12-19 17:51 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<x56dncPy2uOND0PCnZ2dnUU7-X3NnZ2d@giganews.com>
In reply to#2334
On 12/19/2020 5:26 PM, Malcolm McLean wrote:
> On Saturday, 19 December 2020 at 22:45:30 UTC, olcott wrote:
>> On 12/19/2020 4:32 PM, Kaz Kylheku wrote:
>>> On 2020-12-19, olcott <No...@NoWhere.com> wrote:
>>>> The fact that Halts() does correctly return false for this input
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> else
>>>> HALT
>>>> }
>>>> means that Halts() is a decider for this input.
>>>
>>> No, it means that Halts is not a pure function of two immutable
>>> arguments, but some kind of swindle.
>>>
>> I can equally baselessly say what you just said a swindle.
>> Any idiot can use rhetoric.
>>
> Now you see it now you don't. If Halts return false, then H_Hat never
> goes into the infinite loop. So it must return. Which makes Halts
> incorrect.
> However you've confirmed that H_Hat(H_Hat) doesn't halt. So this
> is impossible. Unless Halts isn't  a pure function of two immutable
> arguments, as Kaz said.

I break out of the Liar Paradox pathological self-reference**

This is the only way that not-halting can be decided without forming a 
contradiction:

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

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

** If it is true than makes it false, if it is false the makes it true

>> It takes much more than an idiot to support one's position with sound
>> reasoning. I am researching the idea of pure functions and so far I
>> can't tell what difference it makes.
>>
> If H is implemented in C and isn't a pure function, then it becomes very
> easy to arrange things so that it returns false in one context and
> hangs in another.

Not on this {Linz, Sipser, Kozen} counter-example:

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

In any case since there is a mathematical mapping from the x86 inputs to 
their corresponding execution trace and a mapping from elements of the 
set of x86 execution trace to the Boolean halt status of this trace, 
then I may still have a pure function.

-- 
Copyright 2020 Pete Olcott

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

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


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

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2020-12-20 05:21 +0000
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example)
Message-ID<20201219210721.130@kylheku.com>
In reply to#2335
On 2020-12-19, olcott <NoOne@NoWhere.com> wrote:
> On 12/19/2020 5:26 PM, Malcolm McLean wrote:
>> On Saturday, 19 December 2020 at 22:45:30 UTC, olcott wrote:
>>> On 12/19/2020 4:32 PM, Kaz Kylheku wrote:
>>>> On 2020-12-19, olcott <No...@NoWhere.com> wrote:
>>>>> The fact that Halts() does correctly return false for this input
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> else
>>>>> HALT
>>>>> }
>>>>> means that Halts() is a decider for this input.
>>>>
>>>> No, it means that Halts is not a pure function of two immutable
>>>> arguments, but some kind of swindle.
>>>>
>>> I can equally baselessly say what you just said a swindle.
>>> Any idiot can use rhetoric.
>>>
>> Now you see it now you don't. If Halts return false, then H_Hat never
>> goes into the infinite loop. So it must return. Which makes Halts
>> incorrect.
>> However you've confirmed that H_Hat(H_Hat) doesn't halt. So this
>> is impossible. Unless Halts isn't  a pure function of two immutable
>> arguments, as Kaz said.
>
> I break out of the Liar Paradox pathological self-reference**
>
> This is the only way that not-halting can be decided without forming a 
> contradiction:

There is no liar paradox in the Halting, because there is no self
reference. What's happening in the proofs is that a program is given
itself as input. That is not a paradoxical self reference though.

For instance, the copy utility in POSIX can copy itself:

  $ /bin/cp -p /bin/cp /home/kaz/cp    # -p == preserve permissions

  $ /home/kaz/cp --version
  cp (GNU coreutils) 8.28
  [ ... ]

No paradox here. The copy utility copies any file. It is a "universal
copy file function". So, it makes no exception for itself.

Likewise, there is no paradox when we feed <H_Hat, H_Hat> to the Halts
function.

The value returned by Halts is not being *contradicted* by H_Hat.
H_Hat *behaves* differently from what that value says. Thereby, that
value is simply shown to be false.

In the Liar Paradox, things are not settled in this way; the sentence
has no definite truth value.

See the difference?

Halting proof -> no instability of truth values, everything settled.

Liar Paradox -> unstable feedback loop: no definite truth value.


>
> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
> > A computation that would not halt if its simulation were not
> > halted is indeed a non-halting computation.
>
> On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
> > Every computation that would not halt if its simulation
> > were not halted is by logical necessity a non-halting computation.
>
> ** If it is true than makes it false, if it is false the makes it true

Nothing is flipped at all. H_Hat does not invert any return value.

If Halts returns false, then that is what it is.

What H_Hat is doing is using its behavior to create a *context*
which causes the value to have an incorrect *interpretation*.

So that is to say, the boolean value "true" from Halts isn't just
a logical value. It has an *interpretation*: it is making a statement
about something in the world. That interpretation is false.

A given Halts function is what it is; it returns a given value and no
other.

If you want a different value, you have to change Halts: that means
creating a different program in which Halts is replaced by another
function.

Because we create a different program, and the program is being fed to
itself, we end up not only with a different program, but with a
different input pair <P, P>.

In that new situation, the new Halts will, again, have an incorrect
interpretation on the new input (i.e. the new program itself).


>>> reasoning. I am researching the idea of pure functions and so far I
>>> can't tell what difference it makes.
>>>
>> If H is implemented in C and isn't a pure function, then it becomes very
>> easy to arrange things so that it returns false in one context and
>> hangs in another.
>
> Not on this {Linz, Sipser, Kozen} counter-example:
>
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Halts)
>      HERE: goto HERE;
>    else
>      HALT
> }
>
> In any case since there is a mathematical mapping from the x86 inputs to 
> their corresponding execution trace and a mapping from elements of the 
> set of x86 execution trace to the Boolean halt status of this trace, 
> then I may still have a pure function.

Everything that is going on in your program, or any other program, has a
mapping to some mathematical description.

However, the entities in your program do not map to the same-named
entities in the proof that you're trying to refute.

To see what they actually map to, you have to identify the hidden inputs
leaking into the functions, and then in the mathematical description,
show those inputs as explicit arguments.

If you do the work carefully, you will see that Halts(P, I) in your code
has to correspond to some Halts(P, I, X, Y, ..). And you will have to
confront the conclusion that the two calls to Halts do not share the
same values of all of the arguments.


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

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


#2342 — Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly)

Fromolcott <NoOne@NoWhere.com>
Date2020-12-20 13:43 -0600
SubjectRe: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly)
Message-ID<X-CdnRfu-u7kNELCnZ2dnUU7-KHNnZ2d@giganews.com>
In reply to#2334
On 12/20/2020 1:05 PM, Jeff Barnett wrote:
> On 12/20/2020 11:30 AM, olcott wrote:
>> Because only a very stupid person would believe that an infinitely 
>> recursive invocation ever returns a value to it caller.
> 
> It was your misguided idea to use emulation. Standard tools for these 
> sorts of analyses are lexical analysis and loop invariants. The fact 
> that your implementation and misunderstandings lead you into troubles of 
> your own making is no surprise.

So in other words you are implying that you too also stupidly believe 
that some infinitely recursive invocations do return values to their 
callers.

To me this seems just as stupid as people believing that Trump won the 
election when every poll of his approval rating consistently said that 
most people thought he was always doing a bad job.

The fact that all these polls agreed proves that they are correct. If 
these polls were not correct then the Republican party would have done 
their own poll to show the error of these polls.
https://projects.fivethirtyeight.com/trump-approval-ratings/

>> By characterizing my code as a cheat you are demonstrating a reckless 
>> disregard for the truth.
> 
> Why not? Ralph London (if I remember correctly), in a paper he published 
> started with a quote: "Rules are rules." This quote was attributed to a 
> waitress at a roadside truck stop somewhere in the USA. The paper was in 
> the general field of logic applied to reasoning about behavior of 
> procedures. The paper would be well over your head so I don't recommend 
> that you read it; on the other hand, you could learn a lot from that 
> waitress. Find her. Sit on the floor by her feet. Observe, Learn.


-- 
Copyright 2020 Pete Olcott

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

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


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

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


csiph-web