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 11 of 21 — ← Prev page 1 … 9 10 [11] 12 13 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 08:15 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <sdednfBvJo5k407CnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #2199 |
On 12/int11/2020 5:30 AM, Andy Walker wrote:
> On 11/12/2020 01:12, olcott wrote:
>> All of the conventional halting problem conter-examples can be
>> decided by a UTM that has been adapted to become a halt decider
>> because in this case no TM can do anything that the UTM/decider
>> cannot see.
>
> (a) There is no [general] difficulty deciding any of the
> "conventional" HP counter-examples. This seems to be a
> misconception of PO's. The point is not that "H_hat(H_hat)"
> is an undecidable case, but that "H" [itself, with no extra
> OS or similar intervention] doesn't decide it correctly.
An ordinary UTM that has been adapted to becomes a halt decider does
decide it correctly.
Even in this case where Halts is not a global halt decider is decided
correctly, it merely does not seem to be decided correctly to people
that do not understand the details of the Halts() algorithm.
Halts decides these to cases consistently according to its algorithm.
int main()
{
H_Hat((U32)H_Hat);
Halts((U32)H_Hat, (U32)H_Hat);
}
Halts always makes its non-halting decision as soon as it has enough
data and makes its halting decision after the input has halted.
In the first case Halts is not permitted to directly examine the
outer-most H_Hat so it makes its non-halting decision on the input to
H_Hat.
When the global Halts is permitted to directly examine H_Hat then Halts
directly decides that H_Hat itself does not Halt.
If Halts is not allowed to abort its non-halting input then both of the
above examples are infinite execution.
> So "H" is not a universal halt decider. As this applies to
> all "H", this constitutes a proof of the HP result.
>
> (b) In particular, PO's adapted UTM, call it "POUTM", does not
> [correctly] decide the "conventional counter-example"
> "POUTM_hat", constructed from "POUTM" in the usual way.
That you fail to understand that it does does it correctly is not even
evidence that it does not decide it correctly. Not one person has
pointed out a single material error in any of my work.
> So "POUTM" does not decide /all/ the counter-examples.
>
> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
> Further, "POUTM++" does not decide "POUTM++_hat", .... I
> believe this to be the same regress that led PO astray in
> his discussions of Goedel; BICBW.
>
Empty rhetoric utterly bereft of supporting reasoning.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2020-12-11 14:34 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <xrLAH.74230$oqF7.23434@fx32.ams4> |
| In reply to | #2209 |
On 11/12/2020 14:15, olcott wrote:
> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>> On 11/12/2020 01:12, olcott wrote:
>>> All of the conventional halting problem conter-examples can be
>>> decided by a UTM that has been adapted to become a halt decider
>>> because in this case no TM can do anything that the UTM/decider
>>> cannot see.
>>
>> (a) There is no [general] difficulty deciding any of the
>> "conventional" HP counter-examples. This seems to be a
>> misconception of PO's. The point is not that "H_hat(H_hat)"
>> is an undecidable case, but that "H" [itself, with no extra
>> OS or similar intervention] doesn't decide it correctly.
>
> An ordinary UTM that has been adapted to becomes a halt decider does decide it correctly.
>
> Even in this case where Halts is not a global halt decider is decided correctly, it merely does not seem to be decided correctly to people that do not understand the details of the Halts() algorithm.
>
> Halts decides these to cases consistently according to its algorithm.
>
> int main()
> {
> H_Hat((U32)H_Hat);
> Halts((U32)H_Hat, (U32)H_Hat);
> }
>
> Halts always makes its non-halting decision as soon as it has enough data and makes its halting decision after the input has halted.
>
> In the first case Halts is not permitted to directly examine the outer-most H_Hat so it makes its non-halting decision on the input to H_Hat.
>
> When the global Halts is permitted to directly examine H_Hat then Halts directly decides that H_Hat itself does not Halt.
>
> If Halts is not allowed to abort its non-halting input then both of the above examples are infinite execution.
>
>> So "H" is not a universal halt decider. As this applies to
>> all "H", this constitutes a proof of the HP result.
>>
>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>> [correctly] decide the "conventional counter-example"
>> "POUTM_hat", constructed from "POUTM" in the usual way.
>
> That you fail to understand that it does does it correctly is not even evidence that it does not decide it correctly. Not one person has pointed out a single material error in any of my work.
>
>> So "POUTM" does not decide /all/ the counter-examples.
>>
>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>> believe this to be the same regress that led PO astray in
>> his discussions of Goedel; BICBW.
>>
> Empty rhetoric utterly bereft of supporting reasoning.
You have *not* refuted Alan Turing's proof as you have to consider conditionals when determining if a loop or a recursion is "infinite".
The Halting Problem survives another day.
/Flibble
--
😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 08:39 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <J5KdnZGIktsAGU7CnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #2210 |
On 12/11/2020 8:34 AM, Mr Flibble wrote:
> On 11/12/2020 14:15, olcott wrote:
>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>> On 11/12/2020 01:12, olcott wrote:
>>>> All of the conventional halting problem conter-examples can be
>>>> decided by a UTM that has been adapted to become a halt decider
>>>> because in this case no TM can do anything that the UTM/decider
>>>> cannot see.
>>>
>>> (a) There is no [general] difficulty deciding any of the
>>> "conventional" HP counter-examples. This seems to be a
>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>> is an undecidable case, but that "H" [itself, with no extra
>>> OS or similar intervention] doesn't decide it correctly.
>>
>> An ordinary UTM that has been adapted to becomes a halt decider does
>> decide it correctly.
>>
>> Even in this case where Halts is not a global halt decider is decided
>> correctly, it merely does not seem to be decided correctly to people
>> that do not understand the details of the Halts() algorithm.
>>
>> Halts decides these to cases consistently according to its algorithm.
>>
>> int main()
>> {
>> H_Hat((U32)H_Hat);
>> Halts((U32)H_Hat, (U32)H_Hat);
>> }
>>
>> Halts always makes its non-halting decision as soon as it has enough
>> data and makes its halting decision after the input has halted.
>>
>> In the first case Halts is not permitted to directly examine the
>> outer-most H_Hat so it makes its non-halting decision on the input to
>> H_Hat.
>>
>> When the global Halts is permitted to directly examine H_Hat then
>> Halts directly decides that H_Hat itself does not Halt.
>>
>> If Halts is not allowed to abort its non-halting input then both of
>> the above examples are infinite execution.
>>
>>> So "H" is not a universal halt decider. As this applies to
>>> all "H", this constitutes a proof of the HP result.
>>>
>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>> [correctly] decide the "conventional counter-example"
>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>
>> That you fail to understand that it does does it correctly is not even
>> evidence that it does not decide it correctly. Not one person has
>> pointed out a single material error in any of my work.
>>
>>> So "POUTM" does not decide /all/ the counter-examples.
>>>
>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>> believe this to be the same regress that led PO astray in
>>> his discussions of Goedel; BICBW.
>>>
>> Empty rhetoric utterly bereft of supporting reasoning.
>
> You have *not* refuted Alan Turing's proof as you have to consider
> conditionals when determining if a loop or a recursion is "infinite".
>
> The Halting Problem survives another day.
>
> /Flibble
>
Please cite where it says that:
ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
By A. M. TURING.
[Received 28 May, 1936.—Read 12 November, 1936.]
https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2020-12-11 14:52 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <AILAH.352084$IbZ9.178036@fx10.ams4> |
| In reply to | #2211 |
On 11/12/2020 14:39, olcott wrote:
> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>> On 11/12/2020 14:15, olcott wrote:
>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>> On 11/12/2020 01:12, olcott wrote:
>>>>> All of the conventional halting problem conter-examples can be
>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>> because in this case no TM can do anything that the UTM/decider
>>>>> cannot see.
>>>>
>>>> (a) There is no [general] difficulty deciding any of the
>>>> "conventional" HP counter-examples. This seems to be a
>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>> is an undecidable case, but that "H" [itself, with no extra
>>>> OS or similar intervention] doesn't decide it correctly.
>>>
>>> An ordinary UTM that has been adapted to becomes a halt decider does decide it correctly.
>>>
>>> Even in this case where Halts is not a global halt decider is decided correctly, it merely does not seem to be decided correctly to people that do not understand the details of the Halts() algorithm.
>>>
>>> Halts decides these to cases consistently according to its algorithm.
>>>
>>> int main()
>>> {
>>> H_Hat((U32)H_Hat);
>>> Halts((U32)H_Hat, (U32)H_Hat);
>>> }
>>>
>>> Halts always makes its non-halting decision as soon as it has enough data and makes its halting decision after the input has halted.
>>>
>>> In the first case Halts is not permitted to directly examine the outer-most H_Hat so it makes its non-halting decision on the input to H_Hat.
>>>
>>> When the global Halts is permitted to directly examine H_Hat then Halts directly decides that H_Hat itself does not Halt.
>>>
>>> If Halts is not allowed to abort its non-halting input then both of the above examples are infinite execution.
>>>
>>>> So "H" is not a universal halt decider. As this applies to
>>>> all "H", this constitutes a proof of the HP result.
>>>>
>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>> [correctly] decide the "conventional counter-example"
>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>
>>> That you fail to understand that it does does it correctly is not even evidence that it does not decide it correctly. Not one person has pointed out a single material error in any of my work.
>>>
>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>
>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>> believe this to be the same regress that led PO astray in
>>>> his discussions of Goedel; BICBW.
>>>>
>>> Empty rhetoric utterly bereft of supporting reasoning.
>>
>> You have *not* refuted Alan Turing's proof as you have to consider conditionals when determining if a loop or a recursion is "infinite".
>>
>> The Halting Problem survives another day.
>>
>> /Flibble
>>
>
> Please cite where it says that:
>
> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
> By A. M. TURING.
> [Received 28 May, 1936.—Read 12 November, 1936.]
>
> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
"given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed".
Are you denying that computer algorithms can contain conditionals?
To "solve" the Halting Problem requires solving it for any algorithm given any input and that includes algorithms containing conditionals.
/Flibble
--
😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 09:07 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <yPadnXJ3aL-nFk7CnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #2212 |
On 12/11/2020 8:52 AM, Mr Flibble wrote:
> On 11/12/2020 14:39, olcott wrote:
>> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>>> On 11/12/2020 14:15, olcott wrote:
>>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>>> On 11/12/2020 01:12, olcott wrote:
>>>>>> All of the conventional halting problem conter-examples can be
>>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>>> because in this case no TM can do anything that the UTM/decider
>>>>>> cannot see.
>>>>>
>>>>> (a) There is no [general] difficulty deciding any of the
>>>>> "conventional" HP counter-examples. This seems to be a
>>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>>> is an undecidable case, but that "H" [itself, with no extra
>>>>> OS or similar intervention] doesn't decide it correctly.
>>>>
>>>> An ordinary UTM that has been adapted to becomes a halt decider does
>>>> decide it correctly.
>>>>
>>>> Even in this case where Halts is not a global halt decider is
>>>> decided correctly, it merely does not seem to be decided correctly
>>>> to people that do not understand the details of the Halts() algorithm.
>>>>
>>>> Halts decides these to cases consistently according to its algorithm.
>>>>
>>>> int main()
>>>> {
>>>> H_Hat((U32)H_Hat);
>>>> Halts((U32)H_Hat, (U32)H_Hat);
>>>> }
>>>>
>>>> Halts always makes its non-halting decision as soon as it has enough
>>>> data and makes its halting decision after the input has halted.
>>>>
>>>> In the first case Halts is not permitted to directly examine the
>>>> outer-most H_Hat so it makes its non-halting decision on the input
>>>> to H_Hat.
>>>>
>>>> When the global Halts is permitted to directly examine H_Hat then
>>>> Halts directly decides that H_Hat itself does not Halt.
>>>>
>>>> If Halts is not allowed to abort its non-halting input then both of
>>>> the above examples are infinite execution.
>>>>
>>>>> So "H" is not a universal halt decider. As this applies to
>>>>> all "H", this constitutes a proof of the HP result.
>>>>>
>>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>>> [correctly] decide the "conventional counter-example"
>>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>>
>>>> That you fail to understand that it does does it correctly is not
>>>> even evidence that it does not decide it correctly. Not one person
>>>> has pointed out a single material error in any of my work.
>>>>
>>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>>
>>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>>> believe this to be the same regress that led PO astray in
>>>>> his discussions of Goedel; BICBW.
>>>>>
>>>> Empty rhetoric utterly bereft of supporting reasoning.
>>>
>>> You have *not* refuted Alan Turing's proof as you have to consider
>>> conditionals when determining if a loop or a recursion is "infinite".
>>>
>>> The Halting Problem survives another day.
>>>
>>> /Flibble
>>>
>>
>> Please cite where it says that:
>>
>> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
>> By A. M. TURING.
>> [Received 28 May, 1936.—Read 12 November, 1936.]
>>
>> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
>
> "given any computer algorithm, a Turing machine capable of simulating
> that algorithm's logic can be constructed".
>
> Are you denying that computer algorithms can contain conditionals?
>
> To "solve" the Halting Problem requires solving it for any algorithm
> given any input and that includes algorithms containing conditionals.
>
> /Flibble
>
The difference between refuting a proof by showing how its
counter-example basis of undecidability can be decided is not the same
thing as solving the halting problem.
Refuting the proof means that the certainty that the halting problem
cannot be solved becomes uncertainty that the halting problem can or
cannot be solved and not certainty that the halting problem can be solved.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2020-12-11 15:10 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <LZLAH.292683$kpV8.165984@fx36.ams4> |
| In reply to | #2213 |
On 11/12/2020 15:07, olcott wrote:
> On 12/11/2020 8:52 AM, Mr Flibble wrote:
>> On 11/12/2020 14:39, olcott wrote:
>>> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>>>> On 11/12/2020 14:15, olcott wrote:
>>>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>>>> On 11/12/2020 01:12, olcott wrote:
>>>>>>> All of the conventional halting problem conter-examples can be
>>>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>>>> because in this case no TM can do anything that the UTM/decider
>>>>>>> cannot see.
>>>>>>
>>>>>> (a) There is no [general] difficulty deciding any of the
>>>>>> "conventional" HP counter-examples. This seems to be a
>>>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>>>> is an undecidable case, but that "H" [itself, with no extra
>>>>>> OS or similar intervention] doesn't decide it correctly.
>>>>>
>>>>> An ordinary UTM that has been adapted to becomes a halt decider does decide it correctly.
>>>>>
>>>>> Even in this case where Halts is not a global halt decider is decided correctly, it merely does not seem to be decided correctly to people that do not understand the details of the Halts() algorithm.
>>>>>
>>>>> Halts decides these to cases consistently according to its algorithm.
>>>>>
>>>>> int main()
>>>>> {
>>>>> H_Hat((U32)H_Hat);
>>>>> Halts((U32)H_Hat, (U32)H_Hat);
>>>>> }
>>>>>
>>>>> Halts always makes its non-halting decision as soon as it has enough data and makes its halting decision after the input has halted.
>>>>>
>>>>> In the first case Halts is not permitted to directly examine the outer-most H_Hat so it makes its non-halting decision on the input to H_Hat.
>>>>>
>>>>> When the global Halts is permitted to directly examine H_Hat then Halts directly decides that H_Hat itself does not Halt.
>>>>>
>>>>> If Halts is not allowed to abort its non-halting input then both of the above examples are infinite execution.
>>>>>
>>>>>> So "H" is not a universal halt decider. As this applies to
>>>>>> all "H", this constitutes a proof of the HP result.
>>>>>>
>>>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>>>> [correctly] decide the "conventional counter-example"
>>>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>>>
>>>>> That you fail to understand that it does does it correctly is not even evidence that it does not decide it correctly. Not one person has pointed out a single material error in any of my work.
>>>>>
>>>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>>>
>>>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>>>> believe this to be the same regress that led PO astray in
>>>>>> his discussions of Goedel; BICBW.
>>>>>>
>>>>> Empty rhetoric utterly bereft of supporting reasoning.
>>>>
>>>> You have *not* refuted Alan Turing's proof as you have to consider conditionals when determining if a loop or a recursion is "infinite".
>>>>
>>>> The Halting Problem survives another day.
>>>>
>>>> /Flibble
>>>>
>>>
>>> Please cite where it says that:
>>>
>>> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
>>> By A. M. TURING.
>>> [Received 28 May, 1936.—Read 12 November, 1936.]
>>>
>>> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
>>
>> "given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed".
>>
>> Are you denying that computer algorithms can contain conditionals?
>>
>> To "solve" the Halting Problem requires solving it for any algorithm given any input and that includes algorithms containing conditionals.
>>
>> /Flibble
>>
>
> The difference between refuting a proof by showing how its counter-example basis of undecidability can be decided is not the same thing as solving the halting problem.
Your argument is specious. Refuting Turing's proof is EQUIVALENT to solving the HP. The HP cannot be solved.
>
> Refuting the proof means that the certainty that the halting problem cannot be solved becomes uncertainty that the halting problem can or cannot be solved and not certainty that the halting problem can be solved.
Vacuous.
/Flibble
--
😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 09:15 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <soSdnXuQGdy5EE7CnZ2dnUU7-KudnZ2d@giganews.com> |
| In reply to | #2214 |
On 12/11/2020 9:10 AM, Mr Flibble wrote:
> On 11/12/2020 15:07, olcott wrote:
>> On 12/11/2020 8:52 AM, Mr Flibble wrote:
>>> On 11/12/2020 14:39, olcott wrote:
>>>> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>>>>> On 11/12/2020 14:15, olcott wrote:
>>>>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>>>>> On 11/12/2020 01:12, olcott wrote:
>>>>>>>> All of the conventional halting problem conter-examples can be
>>>>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>>>>> because in this case no TM can do anything that the UTM/decider
>>>>>>>> cannot see.
>>>>>>>
>>>>>>> (a) There is no [general] difficulty deciding any of the
>>>>>>> "conventional" HP counter-examples. This seems to be a
>>>>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>>>>> is an undecidable case, but that "H" [itself, with no extra
>>>>>>> OS or similar intervention] doesn't decide it correctly.
>>>>>>
>>>>>> An ordinary UTM that has been adapted to becomes a halt decider
>>>>>> does decide it correctly.
>>>>>>
>>>>>> Even in this case where Halts is not a global halt decider is
>>>>>> decided correctly, it merely does not seem to be decided correctly
>>>>>> to people that do not understand the details of the Halts()
>>>>>> algorithm.
>>>>>>
>>>>>> Halts decides these to cases consistently according to its algorithm.
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> H_Hat((U32)H_Hat);
>>>>>> Halts((U32)H_Hat, (U32)H_Hat);
>>>>>> }
>>>>>>
>>>>>> Halts always makes its non-halting decision as soon as it has
>>>>>> enough data and makes its halting decision after the input has
>>>>>> halted.
>>>>>>
>>>>>> In the first case Halts is not permitted to directly examine the
>>>>>> outer-most H_Hat so it makes its non-halting decision on the input
>>>>>> to H_Hat.
>>>>>>
>>>>>> When the global Halts is permitted to directly examine H_Hat then
>>>>>> Halts directly decides that H_Hat itself does not Halt.
>>>>>>
>>>>>> If Halts is not allowed to abort its non-halting input then both
>>>>>> of the above examples are infinite execution.
>>>>>>
>>>>>>> So "H" is not a universal halt decider. As this applies to
>>>>>>> all "H", this constitutes a proof of the HP result.
>>>>>>>
>>>>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>>>>> [correctly] decide the "conventional counter-example"
>>>>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>>>>
>>>>>> That you fail to understand that it does does it correctly is not
>>>>>> even evidence that it does not decide it correctly. Not one person
>>>>>> has pointed out a single material error in any of my work.
>>>>>>
>>>>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>>>>
>>>>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>>>>> believe this to be the same regress that led PO astray in
>>>>>>> his discussions of Goedel; BICBW.
>>>>>>>
>>>>>> Empty rhetoric utterly bereft of supporting reasoning.
>>>>>
>>>>> You have *not* refuted Alan Turing's proof as you have to consider
>>>>> conditionals when determining if a loop or a recursion is "infinite".
>>>>>
>>>>> The Halting Problem survives another day.
>>>>>
>>>>> /Flibble
>>>>>
>>>>
>>>> Please cite where it says that:
>>>>
>>>> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
>>>> By A. M. TURING.
>>>> [Received 28 May, 1936.—Read 12 November, 1936.]
>>>>
>>>> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
>>>
>>> "given any computer algorithm, a Turing machine capable of simulating
>>> that algorithm's logic can be constructed".
>>>
>>> Are you denying that computer algorithms can contain conditionals?
>>>
>>> To "solve" the Halting Problem requires solving it for any algorithm
>>> given any input and that includes algorithms containing conditionals.
>>>
>>> /Flibble
>>>
>>
>> The difference between refuting a proof by showing how its
>> counter-example basis of undecidability can be decided is not the same
>> thing as solving the halting problem.
>
> Your argument is specious. Refuting Turing's proof is EQUIVALENT to
> solving the HP. The HP cannot be solved.
>
Most other people here would disagree with that assessment. Ask Ben he
seems to know these aspects quite well.
>>
>> Refuting the proof means that the certainty that the halting problem
>> cannot be solved becomes uncertainty that the halting problem can or
>> cannot be solved and not certainty that the halting problem can be
>> solved.
>
> Vacuous.
>
> /Flibble
>
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2020-12-11 15:23 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <Z9MAH.92402$xGx7.23271@fx38.ams4> |
| In reply to | #2216 |
On 11/12/2020 15:15, olcott wrote:
> On 12/11/2020 9:10 AM, Mr Flibble wrote:
>> On 11/12/2020 15:07, olcott wrote:
>>> On 12/11/2020 8:52 AM, Mr Flibble wrote:
>>>> On 11/12/2020 14:39, olcott wrote:
>>>>> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>>>>>> On 11/12/2020 14:15, olcott wrote:
>>>>>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>>>>>> On 11/12/2020 01:12, olcott wrote:
>>>>>>>>> All of the conventional halting problem conter-examples can be
>>>>>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>>>>>> because in this case no TM can do anything that the UTM/decider
>>>>>>>>> cannot see.
>>>>>>>>
>>>>>>>> (a) There is no [general] difficulty deciding any of the
>>>>>>>> "conventional" HP counter-examples. This seems to be a
>>>>>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>>>>>> is an undecidable case, but that "H" [itself, with no extra
>>>>>>>> OS or similar intervention] doesn't decide it correctly.
>>>>>>>
>>>>>>> An ordinary UTM that has been adapted to becomes a halt decider does decide it correctly.
>>>>>>>
>>>>>>> Even in this case where Halts is not a global halt decider is decided correctly, it merely does not seem to be decided correctly to people that do not understand the details of the Halts() algorithm.
>>>>>>>
>>>>>>> Halts decides these to cases consistently according to its algorithm.
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> H_Hat((U32)H_Hat);
>>>>>>> Halts((U32)H_Hat, (U32)H_Hat);
>>>>>>> }
>>>>>>>
>>>>>>> Halts always makes its non-halting decision as soon as it has enough data and makes its halting decision after the input has halted.
>>>>>>>
>>>>>>> In the first case Halts is not permitted to directly examine the outer-most H_Hat so it makes its non-halting decision on the input to H_Hat.
>>>>>>>
>>>>>>> When the global Halts is permitted to directly examine H_Hat then Halts directly decides that H_Hat itself does not Halt.
>>>>>>>
>>>>>>> If Halts is not allowed to abort its non-halting input then both of the above examples are infinite execution.
>>>>>>>
>>>>>>>> So "H" is not a universal halt decider. As this applies to
>>>>>>>> all "H", this constitutes a proof of the HP result.
>>>>>>>>
>>>>>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>>>>>> [correctly] decide the "conventional counter-example"
>>>>>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>>>>>
>>>>>>> That you fail to understand that it does does it correctly is not even evidence that it does not decide it correctly. Not one person has pointed out a single material error in any of my work.
>>>>>>>
>>>>>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>>>>>
>>>>>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>>>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>>>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>>>>>> believe this to be the same regress that led PO astray in
>>>>>>>> his discussions of Goedel; BICBW.
>>>>>>>>
>>>>>>> Empty rhetoric utterly bereft of supporting reasoning.
>>>>>>
>>>>>> You have *not* refuted Alan Turing's proof as you have to consider conditionals when determining if a loop or a recursion is "infinite".
>>>>>>
>>>>>> The Halting Problem survives another day.
>>>>>>
>>>>>> /Flibble
>>>>>>
>>>>>
>>>>> Please cite where it says that:
>>>>>
>>>>> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
>>>>> By A. M. TURING.
>>>>> [Received 28 May, 1936.—Read 12 November, 1936.]
>>>>>
>>>>> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
>>>>
>>>> "given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed".
>>>>
>>>> Are you denying that computer algorithms can contain conditionals?
>>>>
>>>> To "solve" the Halting Problem requires solving it for any algorithm given any input and that includes algorithms containing conditionals.
>>>>
>>>> /Flibble
>>>>
>>>
>>> The difference between refuting a proof by showing how its counter-example basis of undecidability can be decided is not the same thing as solving the halting problem.
>>
>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to solving the HP. The HP cannot be solved.
>>
>
> Most other people here would disagree with that assessment. Ask Ben he seems to know these aspects quite well.
Oh grow the fuck up and learn to speak for yourself and not other people. You have not refuted Turing or the HP.
/Flibble
--
😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 09:29 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <T6idnQl92u7vDU7CnZ2dnUU7-IXNnZ2d@giganews.com> |
| In reply to | #2214 |
On 12/11/2020 9:10 AM, Mr Flibble wrote:
> On 11/12/2020 15:07, olcott wrote:
>> On 12/11/2020 8:52 AM, Mr Flibble wrote:
>>> On 11/12/2020 14:39, olcott wrote:
>>>> On 12/11/2020 8:34 AM, Mr Flibble wrote:
>>>>> On 11/12/2020 14:15, olcott wrote:
>>>>>> On 12/int11/2020 5:30 AM, Andy Walker wrote:
>>>>>>> On 11/12/2020 01:12, olcott wrote:
>>>>>>>> All of the conventional halting problem conter-examples can be
>>>>>>>> decided by a UTM that has been adapted to become a halt decider
>>>>>>>> because in this case no TM can do anything that the UTM/decider
>>>>>>>> cannot see.
>>>>>>>
>>>>>>> (a) There is no [general] difficulty deciding any of the
>>>>>>> "conventional" HP counter-examples. This seems to be a
>>>>>>> misconception of PO's. The point is not that "H_hat(H_hat)"
>>>>>>> is an undecidable case, but that "H" [itself, with no extra
>>>>>>> OS or similar intervention] doesn't decide it correctly.
>>>>>>
>>>>>> An ordinary UTM that has been adapted to becomes a halt decider
>>>>>> does decide it correctly.
>>>>>>
>>>>>> Even in this case where Halts is not a global halt decider is
>>>>>> decided correctly, it merely does not seem to be decided correctly
>>>>>> to people that do not understand the details of the Halts()
>>>>>> algorithm.
>>>>>>
>>>>>> Halts decides these to cases consistently according to its algorithm.
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> H_Hat((U32)H_Hat);
>>>>>> Halts((U32)H_Hat, (U32)H_Hat);
>>>>>> }
>>>>>>
>>>>>> Halts always makes its non-halting decision as soon as it has
>>>>>> enough data and makes its halting decision after the input has
>>>>>> halted.
>>>>>>
>>>>>> In the first case Halts is not permitted to directly examine the
>>>>>> outer-most H_Hat so it makes its non-halting decision on the input
>>>>>> to H_Hat.
>>>>>>
>>>>>> When the global Halts is permitted to directly examine H_Hat then
>>>>>> Halts directly decides that H_Hat itself does not Halt.
>>>>>>
>>>>>> If Halts is not allowed to abort its non-halting input then both
>>>>>> of the above examples are infinite execution.
>>>>>>
>>>>>>> So "H" is not a universal halt decider. As this applies to
>>>>>>> all "H", this constitutes a proof of the HP result.
>>>>>>>
>>>>>>> (b) In particular, PO's adapted UTM, call it "POUTM", does not
>>>>>>> [correctly] decide the "conventional counter-example"
>>>>>>> "POUTM_hat", constructed from "POUTM" in the usual way.
>>>>>>
>>>>>> That you fail to understand that it does does it correctly is not
>>>>>> even evidence that it does not decide it correctly. Not one person
>>>>>> has pointed out a single material error in any of my work.
>>>>>>
>>>>>>> So "POUTM" does not decide /all/ the counter-examples.
>>>>>>>
>>>>>>> (c) If you adapt "POUTM" into a "POUTM+" designed to decide
>>>>>>> "POUTM_hat", then "POUTM+" does not decide "POUTM+_hat".
>>>>>>> Further, "POUTM++" does not decide "POUTM++_hat", .... I
>>>>>>> believe this to be the same regress that led PO astray in
>>>>>>> his discussions of Goedel; BICBW.
>>>>>>>
>>>>>> Empty rhetoric utterly bereft of supporting reasoning.
>>>>>
>>>>> You have *not* refuted Alan Turing's proof as you have to consider
>>>>> conditionals when determining if a loop or a recursion is "infinite".
>>>>>
>>>>> The Halting Problem survives another day.
>>>>>
>>>>> /Flibble
>>>>>
>>>>
>>>> Please cite where it says that:
>>>>
>>>> ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
>>>> By A. M. TURING.
>>>> [Received 28 May, 1936.—Read 12 November, 1936.]
>>>>
>>>> https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
>>>
>>> "given any computer algorithm, a Turing machine capable of simulating
>>> that algorithm's logic can be constructed".
>>>
>>> Are you denying that computer algorithms can contain conditionals?
>>>
>>> To "solve" the Halting Problem requires solving it for any algorithm
>>> given any input and that includes algorithms containing conditionals.
>>>
>>> /Flibble
>>>
>>
>> The difference between refuting a proof by showing how its
>> counter-example basis of undecidability can be decided is not the same
>> thing as solving the halting problem.
>
> Your argument is specious. Refuting Turing's proof is EQUIVALENT to
> solving the HP. The HP cannot be solved.
>
This is factually false.
Refuting the proof requires proving that the one counter-example of
undecidability used in the proof is decidable.
Solving the halting problem requires proving that every counter-example
that can possibly exist is decidable.
>>
>> Refuting the proof means that the certainty that the halting problem
>> cannot be solved becomes uncertainty that the halting problem can or
>> cannot be solved and not certainty that the halting problem can be
>> solved.
>
> Vacuous.
>
> /Flibble
>
--
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-11 10:23 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <ko-dnT5xm7mGAE7CnZ2dnUU7-VWdnZ2d@giganews.com> |
| In reply to | #2218 |
On 12/11/2020 10:04 AM, Malcolm McLean wrote: > On Friday, 11 December 2020 at 15:30:02 UTC, olcott wrote: >> On 12/11/2020 9:10 AM, Mr Flibble wrote: >>> On 11/12/2020 15:07, olcott wrote: >>>> On 12/11/2020 8:52 AM, Mr Flibble wrote: >>>> >>>> The difference between refuting a proof by showing how its >>>> counter-example basis of undecidability can be decided is not the same >>>> thing as solving the halting problem. >>> >>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >>> solving the HP. The HP cannot be solved. >>> >> This is factually false. >> Refuting the proof requires proving that the one counter-example of >> undecidability used in the proof is decidable. >> >> Solving the halting problem requires proving that every counter-example >> that can possibly exist is decidable. >> > You're right here. > But you've flip-flopped on whether you have an H / H_Hat pair, or a full > halt decider. > Since I am not all knowing I have always only had a partial decider. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-12-11 16:59 -0800 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <rr14lv$1gpk$1@gioia.aioe.org> |
| In reply to | #2220 |
On 12/11/2020 8:23 AM, olcott wrote: > On 12/11/2020 10:04 AM, Malcolm McLean wrote: >> On Friday, 11 December 2020 at 15:30:02 UTC, olcott wrote: >>> On 12/11/2020 9:10 AM, Mr Flibble wrote: >>>> On 11/12/2020 15:07, olcott wrote: >>>>> On 12/11/2020 8:52 AM, Mr Flibble wrote: >>>>> >>>>> The difference between refuting a proof by showing how its >>>>> counter-example basis of undecidability can be decided is not the same >>>>> thing as solving the halting problem. >>>> >>>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >>>> solving the HP. The HP cannot be solved. >>>> >>> This is factually false. >>> Refuting the proof requires proving that the one counter-example of >>> undecidability used in the proof is decidable. >>> >>> Solving the halting problem requires proving that every counter-example >>> that can possibly exist is decidable. >>> >> You're right here. >> But you've flip-flopped on whether you have an H / H_Hat pair, or a full >> halt decider. >> > > Since I am not all knowing I have always only had a partial decider. > I have a partial decider. You will give up in less than two months... Halt. Am I right? Passing on to your decider... ;^)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 19:08 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <q7OdnSAe2fpviknCnZ2dnUU7-LmdnZ2d@giganews.com> |
| In reply to | #2250 |
On 12/11/2020 6:59 PM, Chris M. Thomasson wrote: > On 12/11/2020 8:23 AM, olcott wrote: >> On 12/11/2020 10:04 AM, Malcolm McLean wrote: >>> On Friday, 11 December 2020 at 15:30:02 UTC, olcott wrote: >>>> On 12/11/2020 9:10 AM, Mr Flibble wrote: >>>>> On 11/12/2020 15:07, olcott wrote: >>>>>> On 12/11/2020 8:52 AM, Mr Flibble wrote: >>>>>> >>>>>> The difference between refuting a proof by showing how its >>>>>> counter-example basis of undecidability can be decided is not the >>>>>> same >>>>>> thing as solving the halting problem. >>>>> >>>>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >>>>> solving the HP. The HP cannot be solved. >>>>> >>>> This is factually false. >>>> Refuting the proof requires proving that the one counter-example of >>>> undecidability used in the proof is decidable. >>>> >>>> Solving the halting problem requires proving that every counter-example >>>> that can possibly exist is decidable. >>>> >>> You're right here. >>> But you've flip-flopped on whether you have an H / H_Hat pair, or a full >>> halt decider. >>> >> >> Since I am not all knowing I have always only had a partial decider. >> > > I have a partial decider. You will give up in less than two months... > Halt. Am I right? Passing on to your decider... ;^) 12,000 messages from me in the comp.theory forum since 2004 say otherwise. -- 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-11 19:10 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <q7OdnSMe2foBhUnCnZ2dnUU7-LmdnZ2d@giganews.com> |
| In reply to | #2252 |
On 12/11/2020 7:08 PM, olcott wrote: > On 12/11/2020 6:59 PM, Chris M. Thomasson wrote: >> On 12/11/2020 8:23 AM, olcott wrote: >>> On 12/11/2020 10:04 AM, Malcolm McLean wrote: >>>> On Friday, 11 December 2020 at 15:30:02 UTC, olcott wrote: >>>>> On 12/11/2020 9:10 AM, Mr Flibble wrote: >>>>>> On 11/12/2020 15:07, olcott wrote: >>>>>>> On 12/11/2020 8:52 AM, Mr Flibble wrote: >>>>>>> >>>>>>> The difference between refuting a proof by showing how its >>>>>>> counter-example basis of undecidability can be decided is not the >>>>>>> same >>>>>>> thing as solving the halting problem. >>>>>> >>>>>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >>>>>> solving the HP. The HP cannot be solved. >>>>>> >>>>> This is factually false. >>>>> Refuting the proof requires proving that the one counter-example of >>>>> undecidability used in the proof is decidable. >>>>> >>>>> Solving the halting problem requires proving that every >>>>> counter-example >>>>> that can possibly exist is decidable. >>>>> >>>> You're right here. >>>> But you've flip-flopped on whether you have an H / H_Hat pair, or a >>>> full >>>> halt decider. >>>> >>> >>> Since I am not all knowing I have always only had a partial decider. >>> >> >> I have a partial decider. You will give up in less than two months... >> Halt. Am I right? Passing on to your decider... ;^) > > 12,000 messages from me in the comp.theory forum since 2004 say otherwise. > 12,743 messages from me in the comp.theory forum since 2004 say otherwise. -- 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-11 18:52 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <20201211104708.461@kylheku.com> |
| In reply to | #2218 |
On 2020-12-11, olcott <NoOne@NoWhere.com> wrote: >> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >> solving the HP. The HP cannot be solved. >> > > This is factually false. > Refuting the proof requires proving that the one counter-example of > undecidability used in the proof is decidable. ... specifically by the function H, not just decidable in general! It is not enough to just show that the counter-example /as such/ is decidable. What must be shown is that the call to the Halts function is returning the correct answer. You know this, yet you keep omitting it, which is dishonest. Almost a week ago you admitted that, even though you've "correctly refuted" the proof, you are short of demonstrating a run where H (or whatever it is called: Halts, DebugTrace ...) shows he correct value. That is also dishonest: claiming you've solved the problem when the most critical piece is missing. I asked you over the course of the week whether you need to revise your one week estimate, of which there is only one day left, and you didn't respond. Therefore, I'm assuming you're committed to the self-imposed deadline. By around tomorrow or Sunday at the latest, I'm assuming you will have Halts returning the correct value.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 12:59 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <yfednXN-tPrqXE7CnZ2dnUU7-e2dnZ2d@giganews.com> |
| In reply to | #2226 |
On 12/11/2020 12:52 PM, Kaz Kylheku wrote: > On 2020-12-11, olcott <NoOne@NoWhere.com> wrote: >>> Your argument is specious. Refuting Turing's proof is EQUIVALENT to >>> solving the HP. The HP cannot be solved. >>> >> >> This is factually false. >> Refuting the proof requires proving that the one counter-example of >> undecidability used in the proof is decidable. > > ... specifically by the function H, not just decidable in general! > > It is not enough to just show that the counter-example /as such/ is > decidable. What must be shown is that the call to the Halts function > is returning the correct answer. > > You know this, yet you keep omitting it, which is dishonest. > > Almost a week ago you admitted that, even though you've "correctly > refuted" the proof, you are short of demonstrating a run where > H (or whatever it is called: Halts, DebugTrace ...) shows he > correct value. > > That is also dishonest: claiming you've solved the problem when > the most critical piece is missing. > > I asked you over the course of the week whether you need to revise your > one week estimate, of which there is only one day left, and you didn't > respond. > > Therefore, I'm assuming you're committed to the self-imposed deadline. > > By around tomorrow or Sunday at the latest, I'm assuming you will have > Halts returning the correct value. > I got it working. I have to clean up the messy debug interface. -- 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-11 18:35 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <20201211103219.787@kylheku.com> |
| In reply to | #2213 |
On 2020-12-11, olcott <NoOne@NoWhere.com> wrote: > The difference between refuting a proof by showing how its > counter-example basis of undecidability can be decided is not the same > thing as solving the halting problem. Yes, but "refuting a proof" and "solving the halting problem" have one thing in common: you so far done neither. The proof doesn't claim that the proposion Halts?(H_Hat(H_Hat)) is not decidable; only that H is not among the set of functions which decides it. Showing its decidability doesn't place H into that set.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 13:45 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <PJmdnXhek6b8UU7CnZ2dnUU7-KmdnZ2d@giganews.com> |
| In reply to | #2223 |
On 12/11/2020 1:35 PM, Kaz Kylheku wrote: > On 2020-12-11, olcott <NoOne@NoWhere.com> wrote: >> On 12/11/2020 12:35 PM, Kaz Kylheku wrote: >>> On 2020-12-11, olcott <NoOne@NoWhere.com> wrote: >>>> The difference between refuting a proof by showing how its >>>> counter-example basis of undecidability can be decided is not the same >>>> thing as solving the halting problem. >>> >>> Yes, but "refuting a proof" and "solving the halting problem" have one >>> thing in common: you so far done neither. >>> >>> The proof doesn't claim that the proposion Halts?(H_Hat(H_Hat)) is not >>> decidable; only that H is not among the set of functions which decides it. >>> Showing its decidability doesn't place H into that set. >>> >> >> It is wrong about that. > > Wrong about what; wrong about the choice of claim that it makes? > > You just can't change that without creaing a different proof. > > Can you spell out what proof it is that you think you're refuting and > what exact claim it makes? > H correctly decides (H_Hat, H_Hat) -- 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-11 09:14 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <soSdnXiQGdx8EU7CnZ2dnUU7-KvNnZ2d@giganews.com> |
| In reply to | #2209 |
On 12/11/2020 9:01 AM, Malcolm McLean wrote: > On Friday, 11 December 2020 at 14:15:29 UTC, olcott wrote: >> On 12/int11/2020 5:30 AM, Andy Walker wrote: >>> On 11/12/2020 01:12, olcott wrote: >>>> All of the conventional halting problem conter-examples can be >>>> decided by a UTM that has been adapted to become a halt decider >>>> because in this case no TM can do anything that the UTM/decider >>>> cannot see. >>> >>> (a) There is no [general] difficulty deciding any of the >>> "conventional" HP counter-examples. This seems to be a >>> misconception of PO's. The point is not that "H_hat(H_hat)" >>> is an undecidable case, but that "H" [itself, with no extra >>> OS or similar intervention] doesn't decide it correctly. >> An ordinary UTM that has been adapted to becomes a halt decider does >> decide it correctly. >> > I'm sure that it does. H_Hat can be decided by a simple partial halt > decider. It can't be decided by H. >> >> Even in this case where Halts is not a global halt decider is decided >> correctly, it merely does not seem to be decided correctly to people >> that do not understand the details of the Halts() algorithm. >> > If H returns a value to H_Hat, then H can't decide the halting correctly. If people would stop judging my work on the basis of intuition and try to actually find a programming error they will see that there is no programming error and their intuition is incorrect. > If H returns a value to something which isn't H_Hat, H is not a Turing > machine, it's doing the equivalent of an abort or a throw. If H > returns a value when called directly but doesn't return a value to H_Hat, > H's behaviour has been altered by something outside H_Hat. > > Once you start messing about with "global halt deciders" you can > produce something which looks at first sight as though it's refuting > Linz, but in fact it relies on the illegitimate global apparatus. > Your intuition is incorrect on this matter. Even though my halt deciding algorithm looks like it is far too simple to be correct it has taken me 16 years and much more than 12,000 hours to get it that simple. Try any judge my work by its algorithm and not by intuition. -- 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-11 19:04 +0000 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <20201211105615.439@kylheku.com> |
| In reply to | #2215 |
On 2020-12-11, olcott <NoOne@NoWhere.com> wrote:
> On 12/11/2020 9:01 AM, Malcolm McLean wrote:
>> If H returns a value to H_Hat, then H can't decide the halting correctly.
>
> If people would stop judging my work on the basis of intuition and try
> to actually find a programming error they will see that there is no
> programming error and their intuition is incorrect.
I already found a programming error and you acknowledged it. Here it
is again. You have a incorrect main function, which goes something like:
int main()
{
H(H_Hat, H_Hat); // return value ignored
OutputDebug("Terminated");
return 0;
}
I don't recall the exact details, but the programming error is
that the return value of H is ignored, so we do not know whether H
decided anything.
The correct code has this pattern:
int main()
{
if (H(H_Hat, H_Hat))
OutputDebug("H_Hat(H_Hat) halts");
else
OutputDebug("H_Hat(H_Hat) does not halt");
return 0;
}
Moreover, this correct structure is also required to actually print the
correct message matching the truth; corrections may have to be made
elsewhere to bring that about.
You have already acknowledged this last weekend and claimed that this
is just an "interface problem" you will have resolved in one week.
There you go: programmer error, debug away.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-11 13:17 -0600 |
| Subject | Re: Refuting the Peter Linz HP Proof |
| Message-ID | <rf6dnQqaD69bWE7CnZ2dnUU7-fvNnZ2d@giganews.com> |
| In reply to | #2229 |
On 12/11/2020 1:04 PM, Kaz Kylheku wrote:
> On 2020-12-11, olcott <NoOne@NoWhere.com> wrote:
>> On 12/11/2020 9:01 AM, Malcolm McLean wrote:
>>> If H returns a value to H_Hat, then H can't decide the halting correctly.
>>
>> If people would stop judging my work on the basis of intuition and try
>> to actually find a programming error they will see that there is no
>> programming error and their intuition is incorrect.
>
> I already found a programming error and you acknowledged it. Here it
> is again. You have a incorrect main function, which goes something like:
>
> int main()
> {
> H(H_Hat, H_Hat); // return value ignored
> OutputDebug("Terminated");
> return 0;
> }
>
> I don't recall the exact details, but the programming error is
> that the return value of H is ignored, so we do not know whether H
> decided anything.
>
> The correct code has this pattern:
>
> int main()
> {
> if (H(H_Hat, H_Hat))
> OutputDebug("H_Hat(H_Hat) halts");
> else
> OutputDebug("H_Hat(H_Hat) does not halt");
> return 0;
> }
>
> Moreover, this correct structure is also required to actually print the
> correct message matching the truth; corrections may have to be made
> elsewhere to bring that about.
>
> You have already acknowledged this last weekend and claimed that this
> is just an "interface problem" you will have resolved in one week.
>
> There you go: programmer error, debug away.
>
I got this working now:
int main()
{
u32 Input_Halted = Halts((u32)H_Hat, (u32)H_Hat);
Output("***Input_Halted =", Input_Halted);
HALT;
}
[0000063a]:***Input_Halted = --- 0
I have to clean up the debug messages before I can provide a more
detailed execution trace.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 11 of 21 — ← Prev page 1 … 9 10 [11] 12 13 … 21 Next page →
Back to top | Article view | comp.software-eng
csiph-web