Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.software-eng > #1940 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-11-27 13:20 -0600 |
| Last post | 2020-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.
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 17 of 21 — ← Prev page 1 … 15 16 [17] 18 19 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-23 14:45 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <X4mdnVxdMK_6MX7CnZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #2374 |
On 12/23/2020 2:16 PM, Malcolm McLean wrote: > On Wednesday, 23 December 2020 at 17:38:56 UTC, Kaz Kylheku wrote: >> On 2020-12-23, olcott <No...@NoWhere.com> wrote: >>> The above H_Hat() is complete. I am adapting Halts() so that it makes >>> its decision only based on the execution trace derived from its input. >>> >>> The prior Halts() made its decision based on the complete execution of >>> every user instruction that was executed whether it was input to Halts() >>> or not. >> While it is good that you're slowly heeding criticism, I'm afraid that >> as you repair the wrinkles in your system, you're going to have to >> confront the insurmountable problem of Halts not being able to return >> the correct value. >> > A halt decider, or even a partial halt decider that refutes the Linz H_Hat > problem, has to be a cheat. You can't really overturn established mathematical > theorems, certainly not using the tools of a technical education. In order to do > so, everyone has to have been wrong for a long time. That's possible in > other disciplines, like biology, but very unlikely in mathematics. > > So an attempt to patch up an attempted H to make it not a cheat is > misconceived. All you can do is refine it to make it less obviously a > cheat. > Mere assertion of beliefs totally bereft of even a subtle trace of actual reasoning. I have provided the program that does what was "proved" impossible to do. Although the proof is correct in that no correct halting status can be returned to the counter-example input program, the proof made the numbskull mistake of simply assuming that a value must be returned to the counter-example input program. Once it is realized that (a) The counter-example input program's invocation of the halt decider is infinitely recursive. (b) No infinitely recursive invocation ever returns a value to its caller. Then the mistake of the proof is made obvious and the counter-example input program becomes easily decidable. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-23 20:54 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <20201223124619.125@kylheku.com> |
| In reply to | #2379 |
["Followup-To:" header set to comp.theory.] On 2020-12-23, olcott <NoOne@NoWhere.com> wrote: > On 12/23/2020 2:16 PM, Malcolm McLean wrote: >> On Wednesday, 23 December 2020 at 17:38:56 UTC, Kaz Kylheku wrote: >>> On 2020-12-23, olcott <No...@NoWhere.com> wrote: >>>> The above H_Hat() is complete. I am adapting Halts() so that it makes >>>> its decision only based on the execution trace derived from its input. >>>> >>>> The prior Halts() made its decision based on the complete execution of >>>> every user instruction that was executed whether it was input to Halts() >>>> or not. >>> While it is good that you're slowly heeding criticism, I'm afraid that >>> as you repair the wrinkles in your system, you're going to have to >>> confront the insurmountable problem of Halts not being able to return >>> the correct value. >>> >> A halt decider, or even a partial halt decider that refutes the Linz H_Hat >> problem, has to be a cheat. You can't really overturn established mathematical >> theorems, certainly not using the tools of a technical education. In order to do >> so, everyone has to have been wrong for a long time. That's possible in >> other disciplines, like biology, but very unlikely in mathematics. >> >> So an attempt to patch up an attempted H to make it not a cheat is >> misconceived. All you can do is refine it to make it less obviously a >> cheat. >> > > Mere assertion of beliefs totally bereft of even a subtle trace of > actual reasoning. That could only be true if the existing body of work in mathematic related to the limits of Turing computation were bereft of reasoning, which is not. > do. Although the proof is correct in that no correct halting status can > be returned to the counter-example input program, the proof made the > numbskull mistake of simply assuming that a value must be returned to > the counter-example input program. If Halts(P, P) does not return to H_Hat, in the case when the parameter P = H_Hat, then that means Halts(P, P) has not yet decided. If we can show that it never returns no matter how long we wait, then it means that it fails to decide. A machine stuck in a loop or recursion has failed to decide. Because Halts(H_Hat, H_Hat) is a function call that models a Turing machine, it is required to be a pure function whose behavior depends only on its arguments. Every occurrences of Halts(H_Hat, H_Hat) denotes exactly the same computation steps. If Halts(H_Hat, H_Hat) doesn't return to H_Hat, that means that Halts(H_Hat, H_Hat) absolutely does not return. Pure functions do not behave according to who calls them, or how deeply they are nested in recursion or any nonsense of that sort. You're just too poorly educated to understand this. Do you even have a degree in CS or math? Second and third year students know stuff that you have no clue about, like what is a function. There are only two "numbskull mistakes" around here: (1) you and your so-called work and (2) the rest of us giving it any attention.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-23 16:27 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <_JCdnVGZ38bAWX7CnZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #2380 |
On 12/23/2020 2:54 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-23, olcott <NoOne@NoWhere.com> wrote:
>> On 12/23/2020 2:16 PM, Malcolm McLean wrote:
>>> On Wednesday, 23 December 2020 at 17:38:56 UTC, Kaz Kylheku wrote:
>>>> On 2020-12-23, olcott <No...@NoWhere.com> wrote:
>>>>> The above H_Hat() is complete. I am adapting Halts() so that it makes
>>>>> its decision only based on the execution trace derived from its input.
>>>>>
>>>>> The prior Halts() made its decision based on the complete execution of
>>>>> every user instruction that was executed whether it was input to Halts()
>>>>> or not.
>>>> While it is good that you're slowly heeding criticism, I'm afraid that
>>>> as you repair the wrinkles in your system, you're going to have to
>>>> confront the insurmountable problem of Halts not being able to return
>>>> the correct value.
>>>>
>>> A halt decider, or even a partial halt decider that refutes the Linz H_Hat
>>> problem, has to be a cheat. You can't really overturn established mathematical
>>> theorems, certainly not using the tools of a technical education. In order to do
>>> so, everyone has to have been wrong for a long time. That's possible in
>>> other disciplines, like biology, but very unlikely in mathematics.
>>>
>>> So an attempt to patch up an attempted H to make it not a cheat is
>>> misconceived. All you can do is refine it to make it less obviously a
>>> cheat.
>>>
>>
>> Mere assertion of beliefs totally bereft of even a subtle trace of
>> actual reasoning.
>
> That could only be true if the existing body of work in mathematic
> related to the limits of Turing computation were bereft of reasoning,
> which is not.
>
I was referring to the reasoning that Malcolm himself provided, AKA nada.
>> do. Although the proof is correct in that no correct halting status can
>> be returned to the counter-example input program, the proof made the
>> numbskull mistake of simply assuming that a value must be returned to
>> the counter-example input program.
>
> If Halts(P, P) does not return to H_Hat, in the case when the parameter
> P = H_Hat, then that means Halts(P, P) has not yet decided. If we can
> show that it never returns no matter how long we wait, then it means
> that it fails to decide. A machine stuck in a loop or recursion has
> failed to decide.
>
If we simply assume that the halt decider that H_Hat invokes is a
simulator then we can see that the resulting infinite recursion is so
obvious that even a high school student could write a correct halt
decider for H_Hat and the basis
Your mind must be totally clouded with bias.
Simple proof of {Linz, Siper, Kozen} counter-example decidability
http://www.liarparadox.org/X86_based_Halt_Decider.pdf
> Because Halts(H_Hat, H_Hat) is a function call that models a Turing
> machine, it is required to be a pure function whose behavior depends
> only on its arguments. Every occurrences of Halts(H_Hat, H_Hat) denotes
> exactly the same computation steps. If Halts(H_Hat, H_Hat) doesn't
> return to H_Hat, that means that Halts(H_Hat, H_Hat) absolutely does not
> return.
That is such a stupid thing to say. When a function decides that an
invocation of itself is infinitely recursive (as I have proven) this
function can abort the infinitely recursive invocation and return a
value indicating this decision to the invocation of itself that is not
infinitely recursive.
> Pure functions do not behave according to who calls them, or how
> deeply they are nested in recursion or any nonsense of that sort.
>
(1) No function ever returns any value to its infinitely recursive
invocation.
(2) Functions do return value to their invocations that are not
infinitely recursive.
(1) & (2) proves that you are wrong.
Try and provide an example of a function that returns a value to its
caller when the caller's invocation of this function is infinitely
recursive.
Failure to provide such an example will be construed as sufficient
evidence that you are talking out of your butt.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-23 23:10 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <20201223145426.263@kylheku.com> |
| In reply to | #2381 |
On 2020-12-23, olcott <NoOne@NoWhere.com> wrote: >> Pure functions do not behave according to who calls them, or how >> deeply they are nested in recursion or any nonsense of that sort. >> > > (1) No function ever returns any value to its infinitely recursive > invocation. > > (2) Functions do return value to their invocations that are not > infinitely recursive. > > (1) & (2) proves that you are wrong. I'm citing some uncontroversial properties of functions: that they don't depend on their context, but only their arguments. I mention no returning but behavior. Since you believe my statement is wrong, that must mean you think that pure functions do behave according to who calls them, and therefore TMs behave according to who loads the tape and starts them.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-23 16:43 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <AdidnQcvuc6HVX7CnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #2379 |
On 12/23/2020 4:23 PM, Malcolm McLean wrote:
> On Wednesday, 23 December 2020 at 20:45:35 UTC, olcott wrote:
>> On 12/23/2020 2:16 PM, Malcolm McLean wrote:
>>> On Wednesday, 23 December 2020 at 17:38:56 UTC, Kaz Kylheku wrote:
>>>> On 2020-12-23, olcott <No...@NoWhere.com> wrote:
>>>>> The above H_Hat() is complete. I am adapting Halts() so that it makes
>>>>> its decision only based on the execution trace derived from its input.
>>>>>
>>>>> The prior Halts() made its decision based on the complete execution of
>>>>> every user instruction that was executed whether it was input to Halts()
>>>>> or not.
>>>> While it is good that you're slowly heeding criticism, I'm afraid that
>>>> as you repair the wrinkles in your system, you're going to have to
>>>> confront the insurmountable problem of Halts not being able to return
>>>> the correct value.
>>>>
>>> A halt decider, or even a partial halt decider that refutes the Linz H_Hat
>>> problem, has to be a cheat. You can't really overturn established mathematical
>>> theorems, certainly not using the tools of a technical education. In order to do
>>> so, everyone has to have been wrong for a long time. That's possible in
>>> other disciplines, like biology, but very unlikely in mathematics.
>>>
>>> So an attempt to patch up an attempted H to make it not a cheat is
>>> misconceived. All you can do is refine it to make it less obviously a
>>> cheat.
>>>
>>
>> Mere assertion of beliefs totally bereft of even a subtle trace of
>> actual reasoning.
>>
>> I have provided the program that does what was "proved" impossible to
>> do. Although the proof is correct in that no correct halting status can
>> be returned to the counter-example input program, the proof made the
>> numbskull mistake of simply assuming that a value must be returned to
>> the counter-example input program.
>>
>> Once it is realized that
>> (a) The counter-example input program's invocation of the halt decider
>> is infinitely recursive.
>> (b) No infinitely recursive invocation ever returns a value to its caller.
>>
>> Then the mistake of the proof is made obvious and the counter-example
>> input program becomes easily decidable.
>>
> No, there's no mistake in Linz's proof.
>
> The machine H may itself fail to halt, making H_Hat non-halting.
> But then H hasn't determined that H_Hat is non-halting.
>
> More broadly, yes, "the consenus of mathematicians" is an
> argument from authority. It leads you into deep philosphical
> waters if you ask "what does it mean to prove something?" and
> "what does it mean to know that a proof is valid?".
>
The is the core of all of my research: Ultimately proof is only derived
through a set of mutually self-defining interlocking semantic tautologies.
> However if I believe that I can understand a proof and see that
> it is valid, and there is also an established consensus of mathematicians
> that it is valid, then it's not like come other subjects where you can't
> prove things in the same way. For example behaviourism was believed
> by almost everyone in biology, until a few people did some experiments
> that showed it to be wrong. Mathematics isn't like that. It isn't based on
> observations which may be unconsciously biased.
>
> In order for an established proof to be wrong, everyone has to have
> been misled. Then you've got to show how everyone else was misled.
> And if you've got only a technical education, you've either got to derive
> everything yourself from first principles, or you've got to do that using tools
> which to the professionals are basic. It's as close to an impossible task as
> makes no difference.
>
> You haven't offered anything that would convince anyone that you have pulled
> off this amazing feat. Only a non-halting H that disguises the fact that it
> doesn't return a value because it is terminated by another detector not
> run from H_Hat. Quite clever, but anyone can see that it doesn't fulfil the
> requirements for H. Of course it doesn't. How could it ?
>
I have provided the entire basis showing how H does correctly decide Ĥ.
Simple proof of {Linz, Siper, Kozen} counter-example decidability
http://www.liarparadox.org/X86_based_Halt_Decider.pdf
You say that you simply don't believe it failing to ever understand that
it is not a matter of belief, it is a matter of comprehension.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-23 21:42 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <e6adnWV_0vaDk3nCnZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #2382 |
On 12/23/2020 5:57 PM, Malcolm McLean wrote:
> On Wednesday, 23 December 2020 at 23:47:43 UTC, olcott wrote:
>> On 12/23/2020 5:27 PM, Malcolm McLean wrote:
>>> On Wednesday, 23 December 2020 at 22:43:46 UTC, olcott wrote:
>>>> On 12/23/2020 4:23 PM, Malcolm McLean wrote:
>>>>
>>>>> You haven't offered anything that would convince anyone that you have pulled
>>>>> off this amazing feat. Only a non-halting H that disguises the fact that it
>>>>> doesn't return a value because it is terminated by another detector not
>>>>> run from H_Hat. Quite clever, but anyone can see that it doesn't fulfil the
>>>>> requirements for H. Of course it doesn't. How could it ?
>>>>>
>>>> I have provided the entire basis showing how H does correctly decide Ĥ.
>>>> Simple proof of {Linz, Siper, Kozen} counter-example decidability
>>>> http://www.liarparadox.org/X86_based_Halt_Decider.pdf
>>>> You say that you simply don't believe it failing to ever understand that
>>>> it is not a matter of belief, it is a matter of comprehension.
>>>>
>>> You've messed about with outer invocations of H and inner invocations of H,
>>> H as the operating system, aborts returning to outer invocations, and
>>> simple infinite recursion detection logic which couldn't possibly be THE
>>> ANSWER that everyone else has missed.
>>>
>>> The broad outlines of what you have done are clear now, and it's a cheat.
>> There is no such thing as a software cheat. The software either
>> completes the computation correctly or not. Where the Hell did you ever
>> get such a squirrely idea as a software cheat?
>>
> If you supply information instead of calculating it from what are claimed to
> be the paramrters, it's a cheat.
>
>
As long as whatever algorithm I use no longer has undecidable inputs
that can be defined my method has conquered the undecidability proofs.
The ONLY thing that can possibly show that my method does not conquer
the undecidability proofs is an undecidable input.
Mere opinions to the contrary that are not fully supported by reasoning
are of no more value that gas passed through the rectum.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 11:36 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <OuSdnR3G2dUeTHnCnZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #2382 |
On 12/24/2020 10:33 AM, Kaz Kylheku wrote: > On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >> There is one invocation of Halts() in main() that is not infintely >> recursive and does return a value to its caller. >> >> There is also an infinitely recursive invocation of Halts() from H_Hat(). > > Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) > is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. > > How can Halts be an algorithm over the two arguments, as required? > Halts is primarily a simulator. The first thing that it does is simulate the execution of its input, while examining the execution trace of this input. The second thing that it does is terminate the simulation of this input when its execution trace matches one of the patterns of infinite execution. > Your apparatus informs the simulations what level they are, so that at a > certain nesting level, the recursion is caught and he machine aborts. No at all. Not in the least little bit. Why do you assume such things? I am stopping my evaluation here because the rest of what you say is based on a false assumption. A UTM watches the execution trace of its input until it sees a known pattern of infinite execution and then it becomes a halt decider terminating the simulation of this input and reporting not-halting. When you get bogged down in irrelevant details you fail to see the simple essence of the big picture. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-24 17:43 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <20201224093851.430@kylheku.com> |
| In reply to | #2385 |
["Followup-To:" header set to comp.theory.] On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: > On 12/24/2020 10:33 AM, Kaz Kylheku wrote: >> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>> There is one invocation of Halts() in main() that is not infintely >>> recursive and does return a value to its caller. >>> >>> There is also an infinitely recursive invocation of Halts() from H_Hat(). >> >> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) >> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. >> >> How can Halts be an algorithm over the two arguments, as required? >> > > Halts is primarily a simulator. > The first thing that it does is simulate the execution of its input, > while examining the execution trace of this input. > > The second thing that it does is terminate the simulation of this input > when its execution trace matches one of the patterns of infinite execution. > >> Your apparatus informs the simulations what level they are, so that at a >> certain nesting level, the recursion is caught and he machine aborts. > > No at all. Not in the least little bit. Why do you assume such things? Because you haven't posted a URL to a git repository with working code and reproducible build instructions, all we have is assumptions. > I am stopping my evaluation here because the rest of what you say is > based on a false assumption. Sure, keep it a secret where the assumption is wrongly made and what is the correction to it. Can you post a corrected version of one of my sequence diagrams?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 11:51 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <op-dna-cFOyASHnCnZ2dnUU7-SGdnZ2d@giganews.com> |
| In reply to | #2386 |
On 12/24/2020 11:43 AM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >> On 12/24/2020 10:33 AM, Kaz Kylheku wrote: >>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>>> There is one invocation of Halts() in main() that is not infintely >>>> recursive and does return a value to its caller. >>>> >>>> There is also an infinitely recursive invocation of Halts() from H_Hat(). >>> >>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) >>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. >>> >>> How can Halts be an algorithm over the two arguments, as required? >>> >> >> Halts is primarily a simulator. >> The first thing that it does is simulate the execution of its input, >> while examining the execution trace of this input. >> >> The second thing that it does is terminate the simulation of this input >> when its execution trace matches one of the patterns of infinite execution. >> >>> Your apparatus informs the simulations what level they are, so that at a >>> certain nesting level, the recursion is caught and he machine aborts. >> >> No at all. Not in the least little bit. Why do you assume such things? > > Because you haven't posted a URL to a git repository with working code > and reproducible build instructions, all we have is assumptions. > >> I am stopping my evaluation here because the rest of what you say is >> based on a false assumption. > > Sure, keep it a secret where the assumption is wrongly made and what is > the correction to it. > > Can you post a corrected version of one of my sequence diagrams? > I explained its architecture completely on the past that you ignored: On 12/24/2020 11:36 AM, olcott wrote: > A UTM watches the execution trace of its input until it sees a known > pattern of infinite execution and then it becomes a halt decider > terminating the simulation of this input and reporting not-halting. > > When you get bogged down in irrelevant details you fail to see the > simple essence of the big picture. > -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 13:20 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Halt_Decider c++ class) |
| Message-ID | <OPmdnSj1aLJldHnCnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #2386 |
On 12/24/2020 11:43 AM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote:
>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>> There is one invocation of Halts() in main() that is not infintely
>>>> recursive and does return a value to its caller.
>>>>
>>>> There is also an infinitely recursive invocation of Halts() from H_Hat().
>>>
>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat)
>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't.
>>>
>>> How can Halts be an algorithm over the two arguments, as required?
>>>
>>
>> Halts is primarily a simulator.
>> The first thing that it does is simulate the execution of its input,
>> while examining the execution trace of this input.
>>
>> The second thing that it does is terminate the simulation of this input
>> when its execution trace matches one of the patterns of infinite execution.
>>
>>> Your apparatus informs the simulations what level they are, so that at a
>>> certain nesting level, the recursion is caught and he machine aborts.
>>
>> No at all. Not in the least little bit. Why do you assume such things?
>
> Because you haven't posted a URL to a git repository with working code
> and reproducible build instructions, all we have is assumptions.
>
>> I am stopping my evaluation here because the rest of what you say is
>> based on a false assumption.
>
> Sure, keep it a secret where the assumption is wrongly made and what is
> the correction to it.
>
> Can you post a corrected version of one of my sequence diagrams?
>
Here is a C++ class version:
This one is more accurate because the slave_state changes with each
DebugStep().
class Halt_Decider
{
std::vector<Instruction> execution_trace;
bool DebugStep(machine_state& slave_state);
bool Halts(u32 p, u32 i);
};
bool Halts(u32 p, u32 i)
{
bool Halted = false;
bool Aborted = false;
machine_state slave_state(p, i); // Initializes slave_state
while (!Halted && !Aborted)
{
// EIP points to the next instruction to be simulated
Instruction loc(EIP); // Constructs the Instruction @ EIP
execution_trace.push_back(loc);
Halted = DebugStep(slave_state);
if (!Halted)
Aborted = Needs_To_Be_Aborted(execution_trace);
}
return !Aborted;
}
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 22:27 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <_KCdnajUxo--93jCnZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #2386 |
On 12/24/2020 6:08 PM, Mike Terry wrote:
> On 24/12/2020 17:43, Kaz Kylheku wrote:
>> ["Followup-To:" header set to comp.theory.]
>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote:
>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>> There is one invocation of Halts() in main() that is not infintely
>>>>> recursive and does return a value to its caller.
>>>>>
>>>>> There is also an infinitely recursive invocation of Halts() from
>>>>> H_Hat().
>>>>
>>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat)
>>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't.
>>>>
>>>> How can Halts be an algorithm over the two arguments, as required?
>>>>
>>>
>>> Halts is primarily a simulator.
>>> The first thing that it does is simulate the execution of its input,
>>> while examining the execution trace of this input.
>>>
>>> The second thing that it does is terminate the simulation of this input
>>> when its execution trace matches one of the patterns of infinite
>>> execution.
>>>
>>>> Your apparatus informs the simulations what level they are, so that
>>>> at a
>>>> certain nesting level, the recursion is caught and he machine aborts.
>>>
>>> No at all. Not in the least little bit. Why do you assume such things?
>>
>> Because you haven't posted a URL to a git repository with working code
>> and reproducible build instructions, all we have is assumptions.
>>
>>> I am stopping my evaluation here because the rest of what you say is
>>> based on a false assumption.
>>
>> Sure, keep it a secret where the assumption is wrongly made and what is
>> the correction to it.
>>
>> Can you post a corrected version of one of my sequence diagrams?
>>
>
> My impression is like this:
>
> main() Halts() H_Hat Halts() H_Hat
> level 0 level 1
> |
> |--------->|
> | ..[sim]...> |
> ¦ |-------->|
> ¦ |...[sim]..>|
> ¦ |
> ¦ |
> | ..[abrt] (= Just Don't Emulate Any More!)
> |<--- 0 ---|
>
> When A emulates B, A can decide at any point to just stop emulating B -
> that's all that's meant by A "aborts" B. As far as I can see there are
> no "abort traps" or aborts percolating outwards from inner nested
> emulations. (I could be wrong on this - who knows what's really in PO's
> mind? And even if we did, who knows exactly what he's implemented!? But
> I certainly can't see any NEED for abort traps)
>
> There is the need [for PO's infinite recursion test] for outer emulation
> levels to see the /nested/ instructions at *all* *inner* emulation
> levels. In a real TM that would be very fiddly, but with PO's
> architecture, it shouldn't be so hard, because (AIUI) his emulation
> primitives (CreateEmulation(), SingleStep() or equivalent) are
> implemented in his OS, and can simply arrange for the outer emulations
> to see the emulated instructions at all *inner* emulation levels. Not
> that I'm suggesting that's how PO has done it, but in principle it
> /could/ be like this, which would satisfy the "pure function" requirement.
>
> (I can't see any PO-requirement for inner emulators to see instructions
> for /outer/ emulations, and like you've pointed out that would be a Bad
> Thing as it totally mess up the correspondence with TMs in the Linz proof.)
>
>
> Mike.
>
It turns out that the code actually works like this pseudo code template
and decides [need to abort] at the innermost invocation of Halts() based
on the static variable. In an actual UTM this static variable would be
stored on the master UTM tape.
bool Halts(u32 P, u32 I)
{
static u32* local_execution_trace_list; // notice the static variable
bool Halted = false;
bool Aborted = false;
while (!Halted && !Aborted)
{
// EIP points to the next instruction to be simulated
PushBack(local_execution_trace_list, EIP);
Halted = DebugStep(P, I);
if (!Halted)
Aborted = Needs_To_Be_Aborted(local_execution_trace_list);
}
return !Aborted;
}
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-26 14:10 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <_L-dnanT06YyBXrCnZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #2393 |
On 12/25/2020 11:02 AM, Mike Terry wrote:
> On 25/12/2020 04:27, olcott wrote:
>> On 12/24/2020 6:08 PM, Mike Terry wrote:
>>> On 24/12/2020 17:43, Kaz Kylheku wrote:
>>>> ["Followup-To:" header set to comp.theory.]
>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote:
>>>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> There is one invocation of Halts() in main() that is not infintely
>>>>>>> recursive and does return a value to its caller.
>>>>>>>
>>>>>>> There is also an infinitely recursive invocation of Halts() from
>>>>>>> H_Hat().
>>>>>>
>>>>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat)
>>>>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't.
>>>>>>
>>>>>> How can Halts be an algorithm over the two arguments, as required?
>>>>>>
>>>>>
>>>>> Halts is primarily a simulator.
>>>>> The first thing that it does is simulate the execution of its input,
>>>>> while examining the execution trace of this input.
>>>>>
>>>>> The second thing that it does is terminate the simulation of this
>>>>> input
>>>>> when its execution trace matches one of the patterns of infinite
>>>>> execution.
>>>>>
>>>>>> Your apparatus informs the simulations what level they are, so that
>>>>>> at a
>>>>>> certain nesting level, the recursion is caught and he machine aborts.
>>>>>
>>>>> No at all. Not in the least little bit. Why do you assume such things?
>>>>
>>>> Because you haven't posted a URL to a git repository with working code
>>>> and reproducible build instructions, all we have is assumptions.
>>>>
>>>>> I am stopping my evaluation here because the rest of what you say is
>>>>> based on a false assumption.
>>>>
>>>> Sure, keep it a secret where the assumption is wrongly made and what is
>>>> the correction to it.
>>>>
>>>> Can you post a corrected version of one of my sequence diagrams?
>>>>
>>>
>>> My impression is like this:
>>>
>>> main() Halts() H_Hat Halts() H_Hat
>>> level 0 level 1
>>> |
>>> |--------->|
>>> | ..[sim]...> |
>>> ¦ |-------->|
>>> ¦ |...[sim]..>|
>>> ¦ |
>>> ¦ |
>>> | ..[abrt] (= Just Don't Emulate Any More!)
>>> |<--- 0 ---|
>>>
>>> When A emulates B, A can decide at any point to just stop emulating B
>>> - that's all that's meant by A "aborts" B. As far as I can see there
>>> are no "abort traps" or aborts percolating outwards from inner nested
>>> emulations. (I could be wrong on this - who knows what's really in
>>> PO's mind? And even if we did, who knows exactly what he's
>>> implemented!? But I certainly can't see any NEED for abort traps)
>>>
>>> There is the need [for PO's infinite recursion test] for outer
>>> emulation levels to see the /nested/ instructions at *all* *inner*
>>> emulation levels. In a real TM that would be very fiddly, but with
>>> PO's architecture, it shouldn't be so hard, because (AIUI) his
>>> emulation primitives (CreateEmulation(), SingleStep() or equivalent)
>>> are implemented in his OS, and can simply arrange for the outer
>>> emulations to see the emulated instructions at all *inner* emulation
>>> levels. Not that I'm suggesting that's how PO has done it, but in
>>> principle it /could/ be like this, which would satisfy the "pure
>>> function" requirement.
>>>
>>> (I can't see any PO-requirement for inner emulators to see
>>> instructions for /outer/ emulations, and like you've pointed out that
>>> would be a Bad Thing as it totally mess up the correspondence with TMs
>>> in the Linz proof.)
>>>
>>>
>>> Mike.
>>>
>>
>> It turns out that the code actually works like this pseudo code template
>> and decides [need to abort] at the innermost invocation of Halts() based
>> on the static variable. In an actual UTM this static variable would be
>> stored on the master UTM tape.
>>
>> bool Halts(u32 P, u32 I)
>> {
>> static u32* local_execution_trace_list; // notice the static variable
>> bool Halted = false;
>> bool Aborted = false;
>> while (!Halted && !Aborted)
>> {
>> // EIP points to the next instruction to be simulated
>> PushBack(local_execution_trace_list, EIP);
>> Halted = DebugStep(P, I);
>> if (!Halted)
>> Aborted = Needs_To_Be_Aborted(local_execution_trace_list);
>> }
>> return !Aborted;
>> }
>
The actual code is fully operational now.
> That's a really awful idea, because such a machine does not correspond
> in any useful way with the TMs as used in the Linz proof.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
else
HALT
}
The only thing that is actually required to refute the proofs is to show
that undecible inputs can no longer be defined.
> You have made
> your Halts dependent on how it was invoked! (And this could so easily
> have been done "properly".)
>
>
> Mike.
>
The usual "trick" no longer makes inputs undecidable.
That is all that is required to refute the proof.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-26 15:42 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (HP decidability thesis) |
| Message-ID | <35Cdnf-czoDVM3rCnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #2394 |
On 12/26/2020 3:31 PM, Richard Damon wrote: > On 12/26/20 3:10 PM, olcott wrote: >> >> The only thing that is actually required to refute the proofs is to show >> that undecidable inputs can no longer be defined. > > That wording is not quite right. You need to show that H correctly > decides the Halting for the H^ machine built from it. > That is merely a specific instance of my generic statement. My generic statement forms the Olcott halting problem decidability thesis: The halting problem cannot be shown to be undecidable. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-26 14:40 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Exercise) |
| Message-ID | <6sSdnaSXqL88AnrCnZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #2386 |
On 12/25/2020 12:28 PM, Mike Terry wrote: > On 25/12/2020 17:16, Richard Damon wrote: >> On 12/25/20 11:53 AM, Mike Terry wrote: >>> On 25/12/2020 00:42, Richard Damon wrote: >>>> On 12/24/20 7:08 PM, Mike Terry wrote: >>>>> On 24/12/2020 17:43, Kaz Kylheku wrote: >>>>>> ["Followup-To:" header set to comp.theory.] >>>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote: >>>>>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> There is one invocation of Halts() in main() that is not infintely >>>>>>>>> recursive and does return a value to its caller. >>>>>>>>> >>>>>>>>> There is also an infinitely recursive invocation of Halts() from >>>>>>>>> H_Hat(). >>>>>>>> >>>>>>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) >>>>>>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. >>>>>>>> >>>>>>>> How can Halts be an algorithm over the two arguments, as required? >>>>>>>> >>>>>>> >>>>>>> Halts is primarily a simulator. >>>>>>> The first thing that it does is simulate the execution of its input, >>>>>>> while examining the execution trace of this input. >>>>>>> >>>>>>> The second thing that it does is terminate the simulation of this >>>>>>> input >>>>>>> when its execution trace matches one of the patterns of infinite >>>>>>> execution. >>>>>>> >>>>>>>> Your apparatus informs the simulations what level they are, so that >>>>>>>> at a >>>>>>>> certain nesting level, the recursion is caught and he machine >>>>>>>> aborts. >>>>>>> >>>>>>> No at all. Not in the least little bit. Why do you assume such >>>>>>> things? >>>>>> >>>>>> Because you haven't posted a URL to a git repository with working >>>>>> code >>>>>> and reproducible build instructions, all we have is assumptions. >>>>>> >>>>>>> I am stopping my evaluation here because the rest of what you say is >>>>>>> based on a false assumption. >>>>>> >>>>>> Sure, keep it a secret where the assumption is wrongly made and >>>>>> what is >>>>>> the correction to it. >>>>>> >>>>>> Can you post a corrected version of one of my sequence diagrams? >>>>>> >>>>> >>>>> My impression is like this: >>>>> >>>>> main() Halts() H_Hat Halts() H_Hat >>>>> level 0 level 1 >>>>> | >>>>> |--------->| >>>>> | ..[sim]...> | >>>>> ¦ |-------->| >>>>> ¦ |...[sim]..>| >>>>> ¦ | >>>>> ¦ | >>>>> | ..[abrt] (= Just Don't Emulate Any More!) >>>>> |<--- 0 ---| >>>>> >>>>> When A emulates B, A can decide at any point to just stop emulating >>>>> B - >>>>> that's all that's meant by A "aborts" B. As far as I can see there >>>>> are >>>>> no "abort traps" or aborts percolating outwards from inner nested >>>>> emulations. (I could be wrong on this - who knows what's really in >>>>> PO's >>>>> mind? And even if we did, who knows exactly what he's >>>>> implemented!? But >>>>> I certainly can't see any NEED for abort traps) >>>>> >>>>> There is the need [for PO's infinite recursion test] for outer >>>>> emulation >>>>> levels to see the /nested/ instructions at *all* *inner* emulation >>>>> levels. In a real TM that would be very fiddly, but with PO's >>>>> architecture, it shouldn't be so hard, because (AIUI) his emulation >>>>> primitives (CreateEmulation(), SingleStep() or equivalent) are >>>>> implemented in his OS, and can simply arrange for the outer emulations >>>>> to see the emulated instructions at all *inner* emulation levels. Not >>>>> that I'm suggesting that's how PO has done it, but in principle it >>>>> /could/ be like this, which would satisfy the "pure function" >>>>> requirement. >>>>> >>>>> (I can't see any PO-requirement for inner emulators to see >>>>> instructions >>>>> for /outer/ emulations, and like you've pointed out that would be a >>>>> Bad >>>>> Thing as it totally mess up the correspondence with TMs in the Linz >>>>> proof.) >>>>> >>>>> >>>>> Mike. >>>>> >>>> >>>> Currently, the key trick he uses is that the main function is NOT the >>>> very top of his hierarchy, but is actually run under a call to Halts >>>> (this he calls the global decider, he has promised a 'local' version, >>>> which disables this outer deciders ability to actually halt the full >>>> emulation). >>>> >>>> This outer Halts call sees H_Hat call Halts call H_Hat, and then >>>> declairs that H_Hat is determined non-halting, even though from the >>>> above trace we know that if it let the emulation go a bit longer, Halts >>>> would break the recursion, return a 0 and then H_Hat will halt. He uses >>>> this decision to justify that H_Hat is indeed a non-halting decision, >>>> but THAT decision is incorrect, and incompatible with the behavior of >>>> Halts. >>> >>> Yes, his position has become quite incoherent. He claims Halts >>> correctly determines halting, because it says input (H_Hat,H_Hat) is >>> non-halting: Halts detects "non-halting behaviour"! His "evidence" of >>> this, is a trace of Halts wrapping main and the H_Hat(H_Hat) >>> calculation, and (surprise!) Halts again announces it detected >>> "non-halting behaviour". So Halts was right, and consistent! (LOL) >>> >>> Of course you can get this behaviour much more simply: Halts() could >>> just look at the first emulated instruction, and announce it has found >>> non-halting behaviour. >> >> Well, he does do a bit better than that, since he points to the trace to >> show that it does what he claims is proof of the infinite behavior, and >> does 'quote' a rule which I believe is a real proof of infinite >> behavior, he just applies it wrong and so gets the wrong answer (he >> ignore some of the instructions in the path calling them 'system' code) > > Aha, I kind of suspected this was what you're thinking. > > A rule isn't proof of anything - but more importantly his rule is Wrong > in an environment with EMULATION traces. Since I'd mentioned this in > the past in response to a post of yours (and also to others), I had been > wondering if you had picked up on this, as you seemed to ignore it and > just carried on insisting there must be some hidden conditional. (Well, > it's true there are hidden conditionals, so it's not like you're wrong > there...) > > Exercise: Find an example program with the following characteristics: > a) Contains two calls both from A to B in its trace > b) Contains *NO conditional branches* in the trace between A and B > (inclusive). This includes "indirect conditionals" such as > branching to a variable address, e.g. in x86 world, branching > on an indirect address using a register. > c) *Does not exhibit infinite recursion* > > Notes: > - if the trace is a regular (single) x86 processor trace (so no > interleaved emulation trace entries from different logical processors) > then I think we can agree the PO test works in this scenario. (You or I > could come up with a proper proof, but not PO as he lacks the intellect > to understand what's required for such a proof. Still - the test is > basically sound for this scenario...) > - so the solution will involve emulation and the trace will be (as in > PO's traces) an interleaved trace combining all the emulated > instructions together in one amalgamated trace.) > - Details of emulation implementation don't really matter, but for the > sake of the exercise we should agree on how emulation is implemented, at > least for tracing purposes: I suggest two primitives : > CreateEmulation(P,I) returns e, representing the emulation virtual > process; StepEmulation(e) steps e by one "instruction". (Traces will > show these primitives as single instructions.) Traced instructions may > as well be a high-level program statement rather than x86 instructions, > just to keep the trace size reasonable. (It is a "high level" exercise.) > - obviously the emulation primitives contain conditionals internally, > but we consider them atomic ops, since they are guaranteed to return, > and so effectively behave like non-branching instructions. (Like > Halts() should, hehe.) > - the exercise isn't to find a cunning "cheat" - the PO test really is > unsound (I would say /quite obviously/) when applied to a scenario with > merged emulation traces - the solution isn't complicated or > subtle/"clever"! > > > Mike. > Because the differing emulation levels occur in the same physical address space such that the virtual machines have their x86 machine instructions stored in a single location in memory and the input to Halts() is at a pair of fixed addresses in memory the different emulation levels are merely the Turing machine equivalent of recursive invocation. This exact same relationship holds when an actual master UTM is invoking other UTMs (in an emulation hierarchy) having their Turing Machine descriptions already on the master UTM tape. If these differing x86 / UTM emulation levels did not share a common memory / master UTM tape then the application of the recursive invocation detection criteria would not apply because "the same numerical address" may have entirely different contents across multiple physical x86 machines / UTMs. As long as the recursive emulation hierarchy is based on a shared address space with code and input data residing at fixed locations in memory / Master UTM tape positions, then the recursive emulation levels are equivalent to ordinary recursion. Even this requirement can be relaxed as long as we have a shared memory space / shared master UTM tape. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-29 09:43 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Exercise) |
| Message-ID | <te6dnfG7U6kP03bCnZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #2386 |
On 12/25/2020 12:28 PM, Mike Terry wrote:
> On 25/12/2020 17:16, Richard Damon wrote:
>> On 12/25/20 11:53 AM, Mike Terry wrote:
>>> On 25/12/2020 00:42, Richard Damon wrote:
>>>> On 12/24/20 7:08 PM, Mike Terry wrote:
>>>>> On 24/12/2020 17:43, Kaz Kylheku wrote:
>>>>>> ["Followup-To:" header set to comp.theory.]
>>>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote:
>>>>>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>> There is one invocation of Halts() in main() that is not infintely
>>>>>>>>> recursive and does return a value to its caller.
>>>>>>>>>
>>>>>>>>> There is also an infinitely recursive invocation of Halts() from
>>>>>>>>> H_Hat().
>>>>>>>>
>>>>>>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat)
>>>>>>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't.
>>>>>>>>
>>>>>>>> How can Halts be an algorithm over the two arguments, as required?
>>>>>>>>
>>>>>>>
>>>>>>> Halts is primarily a simulator.
>>>>>>> The first thing that it does is simulate the execution of its input,
>>>>>>> while examining the execution trace of this input.
>>>>>>>
>>>>>>> The second thing that it does is terminate the simulation of this
>>>>>>> input
>>>>>>> when its execution trace matches one of the patterns of infinite
>>>>>>> execution.
>>>>>>>
>>>>>>>> Your apparatus informs the simulations what level they are, so that
>>>>>>>> at a
>>>>>>>> certain nesting level, the recursion is caught and he machine
>>>>>>>> aborts.
>>>>>>>
>>>>>>> No at all. Not in the least little bit. Why do you assume such
>>>>>>> things?
>>>>>>
>>>>>> Because you haven't posted a URL to a git repository with working
>>>>>> code
>>>>>> and reproducible build instructions, all we have is assumptions.
>>>>>>
>>>>>>> I am stopping my evaluation here because the rest of what you say is
>>>>>>> based on a false assumption.
>>>>>>
>>>>>> Sure, keep it a secret where the assumption is wrongly made and
>>>>>> what is
>>>>>> the correction to it.
>>>>>>
>>>>>> Can you post a corrected version of one of my sequence diagrams?
>>>>>>
>>>>>
>>>>> My impression is like this:
>>>>>
>>>>> main() Halts() H_Hat Halts() H_Hat
>>>>> level 0 level 1
>>>>> |
>>>>> |--------->|
>>>>> | ..[sim]...> |
>>>>> ¦ |-------->|
>>>>> ¦ |...[sim]..>|
>>>>> ¦ |
>>>>> ¦ |
>>>>> | ..[abrt] (= Just Don't Emulate Any More!)
>>>>> |<--- 0 ---|
>>>>>
>>>>> When A emulates B, A can decide at any point to just stop emulating
>>>>> B -
>>>>> that's all that's meant by A "aborts" B. As far as I can see there
>>>>> are
>>>>> no "abort traps" or aborts percolating outwards from inner nested
>>>>> emulations. (I could be wrong on this - who knows what's really in
>>>>> PO's
>>>>> mind? And even if we did, who knows exactly what he's
>>>>> implemented!? But
>>>>> I certainly can't see any NEED for abort traps)
>>>>>
>>>>> There is the need [for PO's infinite recursion test] for outer
>>>>> emulation
>>>>> levels to see the /nested/ instructions at *all* *inner* emulation
>>>>> levels. In a real TM that would be very fiddly, but with PO's
>>>>> architecture, it shouldn't be so hard, because (AIUI) his emulation
>>>>> primitives (CreateEmulation(), SingleStep() or equivalent) are
>>>>> implemented in his OS, and can simply arrange for the outer emulations
>>>>> to see the emulated instructions at all *inner* emulation levels. Not
>>>>> that I'm suggesting that's how PO has done it, but in principle it
>>>>> /could/ be like this, which would satisfy the "pure function"
>>>>> requirement.
>>>>>
>>>>> (I can't see any PO-requirement for inner emulators to see
>>>>> instructions
>>>>> for /outer/ emulations, and like you've pointed out that would be a
>>>>> Bad
>>>>> Thing as it totally mess up the correspondence with TMs in the Linz
>>>>> proof.)
>>>>>
>>>>>
>>>>> Mike.
>>>>>
>>>>
>>>> Currently, the key trick he uses is that the main function is NOT the
>>>> very top of his hierarchy, but is actually run under a call to Halts
>>>> (this he calls the global decider, he has promised a 'local' version,
>>>> which disables this outer deciders ability to actually halt the full
>>>> emulation).
>>>>
>>>> This outer Halts call sees H_Hat call Halts call H_Hat, and then
>>>> declairs that H_Hat is determined non-halting, even though from the
>>>> above trace we know that if it let the emulation go a bit longer, Halts
>>>> would break the recursion, return a 0 and then H_Hat will halt. He uses
>>>> this decision to justify that H_Hat is indeed a non-halting decision,
>>>> but THAT decision is incorrect, and incompatible with the behavior of
>>>> Halts.
>>>
>>> Yes, his position has become quite incoherent. He claims Halts
>>> correctly determines halting, because it says input (H_Hat,H_Hat) is
>>> non-halting: Halts detects "non-halting behaviour"! His "evidence" of
>>> this, is a trace of Halts wrapping main and the H_Hat(H_Hat)
>>> calculation, and (surprise!) Halts again announces it detected
>>> "non-halting behaviour". So Halts was right, and consistent! (LOL)
>>>
>>> Of course you can get this behaviour much more simply: Halts() could
>>> just look at the first emulated instruction, and announce it has found
>>> non-halting behaviour.
>>
>> Well, he does do a bit better than that, since he points to the trace to
>> show that it does what he claims is proof of the infinite behavior, and
>> does 'quote' a rule which I believe is a real proof of infinite
>> behavior, he just applies it wrong and so gets the wrong answer (he
>> ignore some of the instructions in the path calling them 'system' code)
>
> Aha, I kind of suspected this was what you're thinking.
>
> A rule isn't proof of anything - but more importantly his rule is Wrong
> in an environment with EMULATION traces. Since I'd mentioned this in
> the past in response to a post of yours (and also to others), I had been
> wondering if you had picked up on this, as you seemed to ignore it and
> just carried on insisting there must be some hidden conditional. (Well,
> it's true there are hidden conditionals, so it's not like you're wrong
> there...)
>
> Exercise: Find an example program with the following characteristics:
> a) Contains two calls both from A to B in its trace
> b) Contains *NO conditional branches* in the trace between A and B
> (inclusive). This includes "indirect conditionals" such as
> branching to a variable address, e.g. in x86 world, branching
> on an indirect address using a register.
> c) *Does not exhibit infinite recursion*
>
> Notes:
> - if the trace is a regular (single) x86 processor trace (so no
> interleaved emulation trace entries from different logical processors)
> then I think we can agree the PO test works in this scenario.
Good
> (You or I
> could come up with a proper proof, but not PO as he lacks the intellect
> to understand what's required for such a proof. Still - the test is
> basically sound for this scenario...)
AXIOMS
Every time (within an execution trace) there is an unconditional branch
to a target <= the current address and there are no control flow**
instructions inbetween is an infinite loop.
Every time the same function is called from the same machine address a
second time (within an execution trace) without any control flow**
instructions in-between is a case of infinite recursion.
** This can probably be limited to conditional branch instructions
> - so the solution will involve emulation and the trace will be (as in
> PO's traces) an interleaved trace combining all the emulated
> instructions together in one amalgamated trace.)
Yes, good.
> - Details of emulation implementation don't really matter, but for the
> sake of the exercise we should agree on how emulation is implemented, at
> least for tracing purposes: I suggest two primitives :
> CreateEmulation(P,I) returns e, representing the emulation virtual
> process; StepEmulation(e) steps e by one "instruction". (Traces will
> show these primitives as single instructions.) Traced instructions may
> as well be a high-level program statement rather than x86 instructions,
> just to keep the trace size reasonable. (It is a "high level" exercise.)
> - obviously the emulation primitives contain conditionals internally,
> but we consider them atomic ops, since they are guaranteed to return,
> and so effectively behave like non-branching instructions. (Like
> Halts() should, hehe.)
Yes, good, and that is the way that I do it.
> - the exercise isn't to find a cunning "cheat" - the PO test really is
> unsound (I would say /quite obviously/) when applied to a scenario with
> merged emulation traces - the solution isn't complicated or
> subtle/"clever"!
>
>
> Mike.
>
When you can see the whole thing then it is very obviously completely sound.
The latest rewrite does all of the halt deciding and process context
creation in emulated code. There are a few operations that must be done
by the operating system to keep them atomic:
u32* Allocate(u32 size) {}
void SaveState(Registers* state) {}
void LoadState(Registers* state) {}
u32 DebugStep(Registers* master_state, Registers* slave_state) {}
Other operations are done by the operating system to make the output
smaller. Number of Instructions Executed(14824) is 210 pages long.
The system will have three have deciding modes:
(1) Disabled
(2) Global
(3) Local
The global and local halt deciding mode use the same emulated jalt
decider instructions so that every step of their execution can be
verified. The "C" source code of the halt decider functions and their
input are provided along with their disassembly listings.
From all of this it can be verified that all the halting decisions in
each of the three modes are correct for H_Hat().
AXIOMS
Every time (within an execution trace of user-code) there is an
unconditional branch to a target <= the current address and there are no
control flow** instructions inbetween is an infinite loop.
Every time the same function is called from the same machine address a
second time (within an execution trace of user-code) without any control
flow** instructions in-between is a case of infinite recursion.
** This can probably be limited to control flow instructions.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-24 18:00 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <20201224095130.577@kylheku.com> |
| In reply to | #2385 |
["Followup-To:" header set to comp.theory.]
On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
> On 12/24/2020 10:33 AM, Kaz Kylheku wrote:
>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>> There is one invocation of Halts() in main() that is not infintely
>>> recursive and does return a value to its caller.
>>>
>>> There is also an infinitely recursive invocation of Halts() from H_Hat().
>>
>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat)
>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't.
>>
>> How can Halts be an algorithm over the two arguments, as required?
>>
>
> Halts is primarily a simulator.
> The first thing that it does is simulate the execution of its input,
> while examining the execution trace of this input.
That's what I mean by [sim] in the sequence diagram:
main() Halts() H_Hat Halts() H_Hat
level 0 level 1
|
|--------->|
| ..[sim]...> |
|-------->|
|...[sim]..>|
|
|
|<..[abrt]..|
|<.........[abrt].......|
|<--- 0 ---|
----> is a function call
<--- 0 --- is a return with value 0
...[sim]...> is not a function call; it means that a loop is executed
with simulates the target, so it executes that way.
<...[abrt]... is a termination of the simulation as an abort, etc.
The sequence diagram doesn't show all details like lists of instructions
being gathered and subject to pattern analysis. But it captures the flow
of events.
If the diagram guesses wrong in places, can you fix it?
> The second thing that it does is terminate the simulation of this input
> when its execution trace matches one of the patterns of infinite execution.
Who is supervising that?
Is it the case that each Halts says "everything under me can go to three
levels, and that's it? And therefore, the top level Halts dominates. The
nested Halts also wants to go to 3 levels, but the top level simulation
kicks in before that limit is reached?
>> Your apparatus informs the simulations what level they are, so that at a
>> certain nesting level, the recursion is caught and he machine aborts.
>
> No at all. Not in the least little bit. Why do you assume such things?
Well, the fact is that the recursion is detected, and the recursion is
at some nesting level when this happens, right?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 12:12 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <Jv6dncx3t5aCR3nCnZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #2388 |
On 12/24/2020 12:00 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >> On 12/24/2020 10:33 AM, Kaz Kylheku wrote: >>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>>> There is one invocation of Halts() in main() that is not infintely >>>> recursive and does return a value to its caller. >>>> >>>> There is also an infinitely recursive invocation of Halts() from H_Hat(). >>> >>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) >>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. >>> >>> How can Halts be an algorithm over the two arguments, as required? >>> >> >> Halts is primarily a simulator. >> The first thing that it does is simulate the execution of its input, >> while examining the execution trace of this input. > > That's what I mean by [sim] in the sequence diagram: > > main() Halts() H_Hat Halts() H_Hat > level 0 level 1 > | > |--------->| > | ..[sim]...> | > |-------->| > |...[sim]..>| > | > | > |<..[abrt]..| > |<.........[abrt].......| > |<--- 0 ---| > > > ----> is a function call > > <--- 0 --- is a return with value 0 > > ...[sim]...> is not a function call; it means that a loop is executed > with simulates the target, so it executes that way. > > <...[abrt]... is a termination of the simulation as an abort, etc. > > > The sequence diagram doesn't show all details like lists of instructions > being gathered and subject to pattern analysis. But it captures the flow > of events. > > If the diagram guesses wrong in places, can you fix it? > >> The second thing that it does is terminate the simulation of this input >> when its execution trace matches one of the patterns of infinite execution. > > Who is supervising that? > > Is it the case that each Halts says "everything under me can go to three > levels, and that's it? And therefore, the top level Halts dominates. The > nested Halts also wants to go to 3 levels, but the top level simulation > kicks in before that limit is reached? > >>> Your apparatus informs the simulations what level they are, so that at a >>> certain nesting level, the recursion is caught and he machine aborts. >> >> No at all. Not in the least little bit. Why do you assume such things? > > Well, the fact is that the recursion is detected, and the recursion is > at some nesting level when this happens, right? > The simulator continues to simulate H_Hat() until it sees this pattern Every time that the same function is called from the same machine address a second time (within an execution trace) without any control flow instructions in-between is a case of infinite recursion. in the execution trace of H_Hat instructions: ---[000007ca](01) 55 push ebp ---[000007cb](02) 8bec mov ebp,esp ---[000007cd](01) 51 push ecx ---[000007ce](03) 8b4508 mov eax,[ebp+08] ---[000007d1](01) 50 push eax ---[000007d2](03) 8b4d08 mov ecx,[ebp+08] ---[000007d5](01) 51 push ecx ---[000007d6](05) e80ffeffff call 000005ea --CALL [000005ea] ---[000007ca](01) 55 push ebp ---[000007cb](02) 8bec mov ebp,esp ---[000007cd](01) 51 push ecx ---[000007ce](03) 8b4508 mov eax,[ebp+08] ---[000007d1](01) 50 push eax ---[000007d2](03) 8b4d08 mov ecx,[ebp+08] ---[000007d5](01) 51 push ecx ---[000007d6](05) e80ffeffff call 000005ea --CALL [000005ea] All the other details are beside the point thus extraneous. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-24 19:25 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <20201224103840.344@kylheku.com> |
| In reply to | #2389 |
["Followup-To:" header set to comp.theory.] On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: > On 12/24/2020 12:00 PM, Kaz Kylheku wrote: >> ["Followup-To:" header set to comp.theory.] >> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>> On 12/24/2020 10:33 AM, Kaz Kylheku wrote: >>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote: >>>>> There is one invocation of Halts() in main() that is not infintely >>>>> recursive and does return a value to its caller. >>>>> >>>>> There is also an infinitely recursive invocation of Halts() from H_Hat(). >>>> >>>> Yet, these use exactly the same arguments. One Halts(H_Hat, H_Hat) >>>> is infinitely recursive, and one Halts(H_Hat, H_Hat) isn't. >>>> >>>> How can Halts be an algorithm over the two arguments, as required? >>>> >>> >>> Halts is primarily a simulator. >>> The first thing that it does is simulate the execution of its input, >>> while examining the execution trace of this input. >> >> That's what I mean by [sim] in the sequence diagram: >> >> main() Halts() H_Hat Halts() H_Hat >> level 0 level 1 >> | >> |--------->| >> | ..[sim]...> | >> |-------->| >> |...[sim]..>| >> | >> | >> |<..[abrt]..| >> |<.........[abrt].......| >> |<--- 0 ---| >> >> >> ----> is a function call >> >> <--- 0 --- is a return with value 0 >> >> ...[sim]...> is not a function call; it means that a loop is executed >> with simulates the target, so it executes that way. >> >> <...[abrt]... is a termination of the simulation as an abort, etc. >> >> >> The sequence diagram doesn't show all details like lists of instructions >> being gathered and subject to pattern analysis. But it captures the flow >> of events. >> >> If the diagram guesses wrong in places, can you fix it? >> >>> The second thing that it does is terminate the simulation of this input >>> when its execution trace matches one of the patterns of infinite execution. >> >> Who is supervising that? >> >> Is it the case that each Halts says "everything under me can go to three >> levels, and that's it? And therefore, the top level Halts dominates. The >> nested Halts also wants to go to 3 levels, but the top level simulation >> kicks in before that limit is reached? >> >>>> Your apparatus informs the simulations what level they are, so that at a >>>> certain nesting level, the recursion is caught and he machine aborts. >>> >>> No at all. Not in the least little bit. Why do you assume such things? >> >> Well, the fact is that the recursion is detected, and the recursion is >> at some nesting level when this happens, right? >> > > The simulator continues to simulate H_Hat() until it sees this pattern > > Every time that the same function is called from the same machine > address a second time (within an execution trace) without any control > flow instructions in-between is a case of infinite recursion. But that never happens. H_Hat makes only a single call to Halts. There is no second call. Halts doesn't call anything: it runs a simulation loop. The next call to H_Hat is simulated. That simulation must be fresh, exactly like the first, top-level one. It has no memory of any previous instructions. So: 1. the top-level simulator does not see any function calls: it traces through a single function call that H_Hat makes to Halts, and then it traces the next level simulator, which is sitting in a loop, not doing any recursion. 2. The next level simulator must start in a completely blank slate, exactly like the top-level one (or if it does not, it should). So when the simulator sees H_Hat calling Halts, that looks like it the call is happening for the first time. It must look that way to every simulation level. 3. However, suppose that each simulator transmits its findings (such as encountered intruction sequences) into a reporting channel accessible to the previous simulator. Then each simulator can combine those results and send it upward via its own channel. Thus each simulator has the data from those which are below. Each simulator is roving through this combined data detecting the cross-simulator recursion. Every other simulator is identically doing the same thing but the top level one is the oldest and so it will be the first one to detect recursion. At that point it can stop the show and report "does not halt". The whole thing then stops. If the top level simulator were to continue insead of stopping and returning zero, the next Halts one level down would be he next to detect a deeper recursion, and it would also return 0. Of course, that would make it different from the top-level one; if the top level one fails to return 0, then he one below will also fail, and so the recursion will run away. But the point is that they can be the same; the Halts simulations do not have to know about their own level. The level-specific behavior emerges from the fact that the top simulation has access to a larger log of information, having started first. Is that close?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-24 14:01 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <iaGdndqG6fPjbnnCnZ2dnUU7-UvNnZ2d@giganews.com> |
| In reply to | #2391 |
On 12/24/2020 1:50 PM, Kaz Kylheku wrote:
> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>> But that never happens. H_Hat makes only a single call to Halts.
>>> There is no second call.
>>>
>> Because Halts() is a simulator that simulates its input (as I have said
>> far too many times, why do you freaking keep ignoring this?)
>>
>> When Halts simulates its input
>> When Halts simulates its input
>> When Halts simulates its input
>> When Halts simulates its input
>>
>> Halts simulates H_Hat calling Halts()
>> Halts simulates H_Hat calling Halts()
>> Halts simulates H_Hat calling Halts()
>> Halts simulates H_Hat calling Halts()
>>
>> Which causes Halts to simulate its input
>> Which causes Halts to simulate its input
>> Which causes Halts to simulate its input
>> Which causes Halts to simulate its input
>
> Yes, but that nested simulation is itself being simulated.
>
Yes.
> A subroutine call instruction in the second level simulation is
> not seen as a subroutine call to the first level simulation.
>
It is the Turing machine equivalent of recursive invocation.
> The first level simulation is tracing the second simulator going around
> in a loop, handling the call intruction. It doesn't see that instruction
> itself; it sees the second level simulator's own instructions, right?
Each simulator writes the execution trace of the instructions that it
simulates (one instruction at a time) to the master UTM tape.
> However, I have noted that the simulations can sidestep this by
> reporting the instruction stream they have processed into an output
> channel. These channels can be aggregated: each simulator can somehow
> gain access to an ouput channel established by the lower-level
> simulation, and combine the results with its own trace, and send them to
> its own output channel.
>
The C equivalent of a std::vector that I created from scratch that is
defined as a static variable of the halt decider serves as a sufficient
proxy for the master UTM tape.
Here is the same idea as a C++ class:
class Halt_Decider
{
std::vector<Instruction> execution_trace;
bool DebugStep(machine_state& slave_state);
bool Halts(u32 p, u32 i);
};
bool Halts(u32 p, u32 i)
{
bool Halted = false;
bool Aborted = false;
machine_state slave_state(p, i); // Initializes slave_state
while (!Halted && !Aborted)
{
// EIP points to the next instruction to be simulated
Instruction loc(EIP); // Constructs the Instruction @ EIP
execution_trace.push_back(loc);
Halted = DebugStep(slave_state);
if (!Halted)
Aborted = Needs_To_Be_Aborted(execution_trace);
}
return !Aborted;
}
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-26 15:35 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (numbskull mistake) |
| Message-ID | <_-udnT9yh9BYMXrCnZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #2382 |
On 12/25/2020 12:19 PM, Jeff Barnett wrote:
> On 12/24/2020 3:40 PM, Richard Damon wrote:
>> On 12/23/20 10:17 PM, olcott wrote:
>>> On 12/23/2020 8:01 PM, Kaz Kylheku wrote:
>>>> On 2020-12-24, olcott <NoOne@NoWhere.com> wrote:
>>>>> The halting theorem says that a universal halt decider is utterly
>>>>> uncomputable.
>>>>
>>>> It says no such thing; it says that an algorithm doesn't exist for
>>>> deciding whether any TM will halt or not.
>>>>
>>>>> If the halt decider consistently gets the correct answer by
>>>>> simulating a
>>>>> https://en.wikipedia.org/wiki/Ouija board, then this answer counts.
>>>>
>>>> No, because the theorem says there is no *algorithm* (== Turing
>>>> process)
>>>> which decides the halting of all TMs.
>>>>
>>>
>>> Right so when my C program does, as we know from the Church-Turing
>>> thesis C programs are much more powerful than Turing machines, so this
>>> doesn't count.
>>>
>> Really, you read Church-Turing that way?
>>
>> From what I read, the thesis says (in part) that all Random Access
>> Machines (and thus all C programs) could be simulated by a Turing
>> Machine with at most a polynomial time (and constant space) penalty.
>>
>> Yes, perhaps you can say that C programs are 'more powerful' in that
>> they are faster, but they can compute no more calculations than a Turing
>> Machine.
>
> First there is no concept of time in a TM computation: you simply have a
> very abstract state transition function that either ends in one of the
> halting states or it does not. Talking about time for a TM is like
> talking about time for convergence of a Taylor series: the series at a
> point either converges to a value or it does not. Some series converge
> faster if you use them for computation then others but that doesn't
> factor in the time (your time) to evaluate a term and that can be
> radically different. Best to not try to compare a TM abstraction to a
> real machine.
>
> As to relative power. Let's review some facts about TM power. Let's let
> the TM abstraction be nondeterministic. I'm almost sure that Linz covers
> this concept where in a state with a particular symbol under the read
> head, you may transition to zero or more states; the computation is
> "halting" if any path reaches a halting state. Then there are random TM
> formalisms where a TM behavior is select from many possibilities using a
> distribution function and halting is defined in the usual way - so
> whether the machine reaches a halting state and the tape contents are
> probabilistic concepts. None of these reformulations make the class of
> TM computations any larger, i.e., if one of the reformulations can
> achieve a result so can some regular ordinary old TM do it too.
>
> In other words any thing a hunk of time can can calculated can be done
> by a TM. In particular, there is absolutely nothing in the X86 behavior
> that is not TM computable. Even with unlimited memory, randomizing
> interrupts, halting instructions, SVC's or whatever they are called now
> a days, etc, etc, etc. If you want more power, I suggest an oracle.
>
> There is nothing novel here in computer theory. These ludicrous attempts
> to defeat basic reasoning are just that: ludicrous. The concept that PO
> is the little drummer boy marching with strange gesticulations and
> appearing an uncoordinated fool whose reputation is redeemed when we see
> he is marching with the band of heaven that only he could see and hear
> is also ludicrous. He is might be a decades long, award winning troll
> marching all of us through these never ending threads of nonsense. Most
> likely is just a little drummer boy who is uncoordinated and lost. And
> it is we who have read too many Christmas stories.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
else
HALT
}
The proofs are correct in that there exists no correct value that
Halts() can return to H_Hat().
The proofs are incorrect in their assumption that a value must be
returned to H_Hat().
The essence of my refution is as simple as that.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 17 of 21 — ← Prev page 1 … 15 16 [17] 18 19 … 21 Next page →
Back to top | Article view | comp.software-eng
csiph-web