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 16 of 21 — ← Prev page 1 … 14 15 [16] 17 18 … 21 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-21 21:55 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201221133710.938@kylheku.com> |
| In reply to | #2357 |
["Followup-To:" header set to comp.theory.]
On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
> On 12/21/2020 1:31 PM, Kaz Kylheku wrote:
>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
>>> On 12/21/2020 12:11 PM, Kaz Kylheku wrote:
>>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
>>>>> bool Halts(u32 P, u32 I)
>>>>> {
>>>>> static u32* local_execution_trace_list;
>>
>> [ snip ]
>>
>>> At least one of these machines must see the log of every instruction
>>> that was executed by every machine in the set of recursive invocations.
>>> With the static variable: static u32* local_execution_trace_list;
>>> every machine can see every instruction executed by any machine in the
>>> recursive invocation sequence.
>>
>> I'm afraid that's completely, utterly invalid.
>>
>> I didn't even notice the static keyword, because I was deceived by the
>> word "local" in the variable name!
>>
>> A static variable in C is only "local" in terms of lexical visibility:
>> the variable cannot be accessed by name other than inside the scope of
>> the Halts function.
>>
>> In other ways, it is global; it is shared by multiple invocations of
>> Halts. That problem is more relevant here than lexical scope.
>>
>> A pure function coded in C may have static variables, provided they
>> are immutable. For instance, look-up tables. Every literal that appears
>> in a program, like 42 or "abc", is effectively static data.
>>
>> If a procedure mutates a variable that is shared with other function
>> invocations, then it is not a function. It does not calculate a
>> result just from its inputs, but also according to what other
>> invocations of that function have done so to the shared varaible.
>>
>> Because it is not a function, the procedure does not implement a TM.
>>
>> The entire simulation in which the function runs may be a TM, but that
>> function isn't a TM.
>
> Are you saying that a master UTM is breaking the rules by keeping track
> of the state transitions of its subordinate UTMs?
The job of this master TM, in connection with the proof, is to simulate
certain functions which correspond to Halts and H_Hat. These functions
are understood in the proof to be recursive functions corresponding to
TMs. The proof is not applicable to objects which are something else.
The master TM can keep track of whatever it wants; but if its job is
to faithfully simulate the execution of these TMs, it cannot take
information gathered about them and feed them back into those TMs, so
that they are influenced by knowledge about each other.
A TM is not affected by anything other than the contents of the tape it
is started with.
Whenever a TM is started with the same tape contents, it does exactly the
same thing. That's regardless if it is actually being simulated by a
larger TM, which maintains a global execution history. No such a history
can leak into the TM in question.
If something is messing with a TM so that it makes decisions that don't
proceed from nothing but its initial tape contents, then it's no longer
a TM.
The whole simulation can still be a TM, though. Whether a cog inside a
TM is itself a TM "depends".
--
TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-21 13:08 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <7Pudne7xF4lab33CnZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #2352 |
On 12/21/2020 12:47 PM, Kaz Kylheku wrote:
> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
>> On 12/21/2020 12:11 PM, Kaz Kylheku wrote:
>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
>>>> bool Halts(u32 P, u32 I)
>>>> {
>>>> static u32* local_execution_trace_list;
>>>> bool Halted = false;
>>>> bool Aborted = false;
>>>> while (!Halted && !Aborted)
>>>> {
>>>> // EIP points to the next instruction to be simulated
>>>> PushBack(local_execution_trace_list, EIP);
>>>
>>>> Halted = DebugStep(P, I);
>>>> if (!Halted)
>>>> Aborted = Needs_To_Be_Aborted(local_execution_trace_list);
>>>> }
>>>> return !Aborted;
>>>> }
>
> That's rude; quoting your pseudo-code but leaving mine out.
> I now cannot refer to mine.
>
>>> EIP looks like a global variable, leaking information.
>>>
>> The EIP is the machine hardware instruction pointer it would be
>> equivalent to the UTM tape head position.
>
> The problem is that all the pure function invocations in the proof
> correspond to independent Turing machines.
That is flatly false. All of the Turing machines in the proof are
dependent on the first Turing machine that has been constructed.
> You have only one EIP, and so there is only one Turing machine,
> in which the others are jumbled together.
>
A construction hierarchy is certainly not any sort of mere jumble to say
that it is is like saying the English language is a bunch are characters
that have been jumbled together.
> While it is valid to make a larger TM out of a combination of smaller
> ones (which is exactly the same observation as that functions are
> permitted to compose to make new functions), the proof is concerned with
> showing that a particular function inside the whole conglomerate cannot
> exist: i.e. there is no such TM. Any simulation related to the proof has
> to use clean, independent TMs for all of the functions, in order to be a
So in other words the correct solution exists yet it is simply
arbitrarily not allowed.
That is just lake saying it is impossible to add 5 + 5 because the
integer value of 10 is disallowed.
> credible simulation. It cannot be that just the entire simulation, as
> such, is a TM, but inside the simulation, the functions are impure
> procedures.
>
> You're not going to topple a simple, air-tight proof with a simulation
> that is not "squeaky clean".
I does decide correctly, simply disallowing this correct solution on a
purely arbitrary basis is cheating.
--
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-21 14:57 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <5cidnZEXB53VkXzCnZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #2355 |
On 12/21/2020 2:13 PM, Kaz Kylheku wrote: > On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>> The problem is that all the pure function invocations in the proof >>> correspond to independent Turing machines. >> >> That is flatly false. All of the Turing machines in the proof are >> dependent on the first Turing machine that has been constructed. > > That may be so in your belief and in the simulation, but not in so the > proof. > > The functional notation like Halts(P, I) denotes a complete blank-slate > machine calculation that depends on nothing but the inputs P and I, and > a self-contained calculation mechanism within Halts. That mechanism does > not communicate with the outside world, other than to announce the > completion of the calculation. > It is a self-contained calculation within Halts that does not communicate with the outside world until its returns its result. Part of this internal computation involves executing a hierarchy of subordinate UTMs from its own master tape. > If you believe otherwise, you are changing the proof into some strawman > version of it, and then refuting that strawman version. > > If you're confident that your belief is right, then try to publish > your result. > -- 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-21 21:59 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201221135602.517@kylheku.com> |
| In reply to | #2358 |
["Followup-To:" header set to comp.theory.] On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: > On 12/21/2020 2:13 PM, Kaz Kylheku wrote: >> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>>> The problem is that all the pure function invocations in the proof >>>> correspond to independent Turing machines. >>> >>> That is flatly false. All of the Turing machines in the proof are >>> dependent on the first Turing machine that has been constructed. >> >> That may be so in your belief and in the simulation, but not in so the >> proof. >> >> The functional notation like Halts(P, I) denotes a complete blank-slate >> machine calculation that depends on nothing but the inputs P and I, and >> a self-contained calculation mechanism within Halts. That mechanism does >> not communicate with the outside world, other than to announce the >> completion of the calculation. >> > > It is a self-contained calculation within Halts that does not > communicate with the outside world until its returns its result. Part of How so; there is now a static variable in Halts which holds a value which was left there by a previous invocation of Halts. > this internal computation involves executing a hierarchy of subordinate > UTMs from its own master tape. It's clear that the overall TM that runs the simulation has the above characteristic, but that master TM isn't Halts. Halts is one of the subordinate TMs appearing in the proof. It appears twice. Both appearances, if they are simulated, have to behave exactly the same way. If they don't, Halts is disqualified as not-a-function. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-21 16:52 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <GfOdnZkJvuW_unzCnZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #2360 |
On 12/21/2020 3:59 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >> On 12/21/2020 2:13 PM, Kaz Kylheku wrote: >>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>>>> The problem is that all the pure function invocations in the proof >>>>> correspond to independent Turing machines. >>>> >>>> That is flatly false. All of the Turing machines in the proof are >>>> dependent on the first Turing machine that has been constructed. >>> >>> That may be so in your belief and in the simulation, but not in so the >>> proof. >>> >>> The functional notation like Halts(P, I) denotes a complete blank-slate >>> machine calculation that depends on nothing but the inputs P and I, and >>> a self-contained calculation mechanism within Halts. That mechanism does >>> not communicate with the outside world, other than to announce the >>> completion of the calculation. >>> >> >> It is a self-contained calculation within Halts that does not >> communicate with the outside world until its returns its result. Part of > > How so; there is now a static variable in Halts which holds a value > which was left there by a previous invocation of Halts. > >> this internal computation involves executing a hierarchy of subordinate >> UTMs from its own master tape. > > It's clear that the overall TM that runs the simulation has the above > characteristic, but that master TM isn't Halts. Halts is one of the > subordinate TMs appearing in the proof. It appears twice. Both > appearances, if they are simulated, have to behave exactly the same way. > If they don't, Halts is disqualified as not-a-function. > Halts() <is> the master of its subordinates so it an actual UTM the static variable would merely be positions on the master UTM tape. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-21 16:53 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <GfOdnZgJvuUYunzCnZ2dnUU7-TOdnZ2d@giganews.com> |
| In reply to | #2361 |
On 12/21/2020 4:52 PM, olcott wrote: > On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >> ["Followup-To:" header set to comp.theory.] >> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>> On 12/21/2020 2:13 PM, Kaz Kylheku wrote: >>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>>>>> The problem is that all the pure function invocations in the proof >>>>>> correspond to independent Turing machines. >>>>> >>>>> That is flatly false. All of the Turing machines in the proof are >>>>> dependent on the first Turing machine that has been constructed. >>>> >>>> That may be so in your belief and in the simulation, but not in so the >>>> proof. >>>> >>>> The functional notation like Halts(P, I) denotes a complete blank-slate >>>> machine calculation that depends on nothing but the inputs P and I, and >>>> a self-contained calculation mechanism within Halts. That mechanism >>>> does >>>> not communicate with the outside world, other than to announce the >>>> completion of the calculation. >>>> >>> >>> It is a self-contained calculation within Halts that does not >>> communicate with the outside world until its returns its result. Part of >> >> How so; there is now a static variable in Halts which holds a value >> which was left there by a previous invocation of Halts. >> >>> this internal computation involves executing a hierarchy of subordinate >>> UTMs from its own master tape. >> >> It's clear that the overall TM that runs the simulation has the above >> characteristic, but that master TM isn't Halts. Halts is one of the >> subordinate TMs appearing in the proof. It appears twice. Both >> appearances, if they are simulated, have to behave exactly the same way. >> If they don't, Halts is disqualified as not-a-function. >> > > Halts() <is> the master of its subordinates so it an actual UTM the Halts() <is> the master of its subordinates so <in> an actual UTM the > static variable would merely be positions on the master UTM tape. > -- 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-22 01:25 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201221170547.20@kylheku.com> |
| In reply to | #2361 |
["Followup-To:" header set to comp.theory.] On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: > On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >> ["Followup-To:" header set to comp.theory.] >> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>> On 12/21/2020 2:13 PM, Kaz Kylheku wrote: >>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>>>>> The problem is that all the pure function invocations in the proof >>>>>> correspond to independent Turing machines. >>>>> >>>>> That is flatly false. All of the Turing machines in the proof are >>>>> dependent on the first Turing machine that has been constructed. >>>> >>>> That may be so in your belief and in the simulation, but not in so the >>>> proof. >>>> >>>> The functional notation like Halts(P, I) denotes a complete blank-slate >>>> machine calculation that depends on nothing but the inputs P and I, and >>>> a self-contained calculation mechanism within Halts. That mechanism does >>>> not communicate with the outside world, other than to announce the >>>> completion of the calculation. >>>> >>> >>> It is a self-contained calculation within Halts that does not >>> communicate with the outside world until its returns its result. Part of >> >> How so; there is now a static variable in Halts which holds a value >> which was left there by a previous invocation of Halts. >> >>> this internal computation involves executing a hierarchy of subordinate >>> UTMs from its own master tape. >> >> It's clear that the overall TM that runs the simulation has the above >> characteristic, but that master TM isn't Halts. Halts is one of the >> subordinate TMs appearing in the proof. It appears twice. Both >> appearances, if they are simulated, have to behave exactly the same way. >> If they don't, Halts is disqualified as not-a-function. >> > > Halts() <is> the master of its subordinates so it an actual UTM the > static variable would merely be positions on the master UTM tape. Since some of those subordinates are also Halts, due to recursion, you have major confusion here. In the proof, Halts is required to be complete, self-contained Turing-machine, presented as a function call. The function call applies a function to its arguments. Those two ingredients are equivalent to loading a tape into a UTM to create a TM, and running it. (A UTM tape represents both "code" and "data"). Every call to Halts with the same arguments corresponds to exactly the same TM which carries out exactly the same steps with the same result: either failing to halt, or halting with the same final state recorded on the tape. The Halts which is called by H_Hat is exactly tha same Halts invocation as the top-level one, because it passes the same arguments. That's a key condition which allows the proof claim that Halts cannot decide the halting of H_Hat(H_Hat). -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-22 09:39 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <ueCdnWTP54uljn_CnZ2dnUU7-U3NnZ2d@giganews.com> |
| In reply to | #2363 |
On 12/21/2020 7:25 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>> ["Followup-To:" header set to comp.theory.] >>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/21/2020 2:13 PM, Kaz Kylheku wrote: >>>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 12/21/2020 12:47 PM, Kaz Kylheku wrote: >>>>>>> The problem is that all the pure function invocations in the proof >>>>>>> correspond to independent Turing machines. >>>>>> >>>>>> That is flatly false. All of the Turing machines in the proof are >>>>>> dependent on the first Turing machine that has been constructed. >>>>> >>>>> That may be so in your belief and in the simulation, but not in so the >>>>> proof. >>>>> >>>>> The functional notation like Halts(P, I) denotes a complete blank-slate >>>>> machine calculation that depends on nothing but the inputs P and I, and >>>>> a self-contained calculation mechanism within Halts. That mechanism does >>>>> not communicate with the outside world, other than to announce the >>>>> completion of the calculation. >>>>> >>>> >>>> It is a self-contained calculation within Halts that does not >>>> communicate with the outside world until its returns its result. Part of >>> >>> How so; there is now a static variable in Halts which holds a value >>> which was left there by a previous invocation of Halts. >>> >>>> this internal computation involves executing a hierarchy of subordinate >>>> UTMs from its own master tape. >>> >>> It's clear that the overall TM that runs the simulation has the above >>> characteristic, but that master TM isn't Halts. Halts is one of the >>> subordinate TMs appearing in the proof. It appears twice. Both >> appearances, if they are simulated, have to behave exactly the same way. >>> If they don't, Halts is disqualified as not-a-function. >>> >> >> Halts() <is> the master of its subordinates so it an actual UTM the >> static variable would merely be positions on the master UTM tape. > > Since some of those subordinates are also Halts, due to recursion, you > have major confusion here. > Every invocation of Halts has the same machine code / set of states. Every invocation of Halts in an invocation chain is executed in its own process context, having its own memory, registers and stack. The first invocation of Halts is executed in the process context of the master UTM. Ev every subordinate UTM is dependent on its master UTM to simulate its next instruction. > In the proof, Halts is required to be complete, self-contained > Turing-machine, presented as a function call. The function call applies I don't think that I really need to duplicate every aspect of the proof. The only aspect that I need to duplicate is the aspect where H_Hat() does the opposite of whatever Halts() decides. As long as I can show that this is no longer undecidable by any means what-so-ever, then this previously undecidable input ceases to provide the basis for the conclusion of the proof and the proof has been refuted. > a function to its arguments. Those two ingredients are equivalent to > loading a tape into a UTM to create a TM, and running it. (A UTM tape > represents both "code" and "data"). > The UTM/halt decider has H_Hat and its input loaded onto its master tape. It performs some computations and halts in its own final state indicating the halting status of H_Hat. It really doesn't matter what these intermediate computations are as long as the final state that it transitions to corresponds to the halt status of H_Hat. > Every call to Halts with the same arguments corresponds to exactly the > same TM which carries out exactly the same steps with the same result: > either failing to halt, or halting with the same final state recorded on > the tape. > Halts in this case is a UTM that executes a recursive chain of UTMs on the basis of an input program and its input data. In this case this is merely a program that detects its own infinitely recursive invocation. Since my C program can do it then by the Church-Turing thesis a TM can do it. > The Halts which is called by H_Hat is exactly tha same Halts invocation > as the top-level one, because it passes the same arguments. > > That's a key condition which allows the proof claim that Halts cannot > decide the halting of H_Hat(H_Hat). > I think that this is the bottom line: Since my C program can correctly decide halting on H_Hat then by the Church-Turing thesis a TM can do it. -- 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-22 10:57 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <CMedncvG5rrtuH_CnZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #2364 |
On 12/22/2020 10:36 AM, Kaz Kylheku wrote: > On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >> On 12/21/2020 7:25 PM, Kaz Kylheku wrote: >>> ["Followup-To:" header set to comp.theory.] >>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>>> Halts() <is> the master of its subordinates so it an actual UTM the >>>> static variable would merely be positions on the master UTM tape. >>> >>> Since some of those subordinates are also Halts, due to recursion, you >>> have major confusion here. >>> >> Every invocation of Halts has the same machine code / set of states. >> Every invocation of Halts in an invocation chain is executed in its own >> process context, having its own memory, registers and stack. > > Are the memory and registers reset to the same initial values? > The only memory that each machine uses is allocated from the heap (the master tape) and the same goes for stack space. The ESP is set to point to this stack space. The other registers are allowed to diverge from their present values within this separate process context. >> invocation of Halts is executed in the process context of the master >> UTM. Ev every subordinate UTM is dependent on its master UTM to simulate >> its next instruction. >> >>> In the proof, Halts is required to be complete, self-contained >>> Turing-machine, presented as a function call. The function call applies >> >> I don't think that I really need to duplicate every aspect of the proof. > > Sure, feel free to ignore the aspects that make it correct and > unsassailable, then attack the rest. > >> The only aspect that I need to duplicate is the aspect where H_Hat() >> does the opposite of whatever Halts() decides. > > Basically, feel free disregard aspects that make the proof valid and > unassailable. The proof essentially makes the claim that H_Hat is undecidable. Refuting that assertion refutes the proof. The proof is anchored in the assumption that neither return value from Halts() to H_Hat() is a correct return value thus making H_Hat() undecidable. The proof utterly overlooks the fact that a halt decider based on simulating the execution of H_Hat() would detect that the H_Hat() invocation of Halts() is infinitely recursive. It is an immutable fact that no infinitely recursive invocation ever returns a value to its caller. The proof did not take this into consideration. The proof simply assumed that Halts() must return a value to its caller. This false assumption is the basis for the refutation of the proof. Thanks for doing the best that you can to give my work an honest and accurate review. I don't think that I can say that about anyone else. Mike may have tried to give my work an honest and accurate review when his rebuttal devolved into mere assertions utterly bereft of supporting reasoning I lost my confidence in this. -- 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-22 17:03 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201222085809.751@kylheku.com> |
| In reply to | #2365 |
["Followup-To:" header set to comp.theory.] On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: > On 12/22/2020 10:36 AM, Kaz Kylheku wrote: >> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>> On 12/21/2020 7:25 PM, Kaz Kylheku wrote: >>>> ["Followup-To:" header set to comp.theory.] >>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>>>> Halts() <is> the master of its subordinates so it an actual UTM the >>>>> static variable would merely be positions on the master UTM tape. >>>> >>>> Since some of those subordinates are also Halts, due to recursion, you >>>> have major confusion here. >>>> >>> Every invocation of Halts has the same machine code / set of states. >>> Every invocation of Halts in an invocation chain is executed in its own >>> process context, having its own memory, registers and stack. >> >> Are the memory and registers reset to the same initial values? >> > > The only memory that each machine uses is allocated from the heap (the > master tape) and the same goes for stack space. That doesn't answer my question. I asked about initial values, and you're talking about where the memory comes from, which is neither here nor there. Are these heap allocations initialized to all zero bytes? > The ESP is set to point > to this stack space. The other registers are allowed to diverge from > their present values within this separate process context. What does that mean? What does "present values" mean? Does each machine not start with registers set the same fixed, initial values?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-22 11:46 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <MK2dncHo5vefrH_CnZ2dnUU7-e3NnZ2d@giganews.com> |
| In reply to | #2366 |
On 12/22/2020 11:03 AM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >> On 12/22/2020 10:36 AM, Kaz Kylheku wrote: >>> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/21/2020 7:25 PM, Kaz Kylheku wrote: >>>>> ["Followup-To:" header set to comp.theory.] >>>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>>>>> Halts() <is> the master of its subordinates so it an actual UTM the >>>>>> static variable would merely be positions on the master UTM tape. >>>>> >>>>> Since some of those subordinates are also Halts, due to recursion, you >>>>> have major confusion here. >>>>> >>>> Every invocation of Halts has the same machine code / set of states. >>>> Every invocation of Halts in an invocation chain is executed in its own >>>> process context, having its own memory, registers and stack. >>> >>> Are the memory and registers reset to the same initial values? >>> >> >> The only memory that each machine uses is allocated from the heap (the >> master tape) and the same goes for stack space. > > That doesn't answer my question. I asked about initial values, and > you're talking about where the memory comes from, which is neither here > nor there. > > Are these heap allocations initialized to all zero bytes? > >> The ESP is set to point >> to this stack space. The other registers are allowed to diverge from >> their present values within this separate process context. > > What does that mean? The new machine is forced to only use its own newly allocated stack space. It cannot see any other stack space. > What does "present values" mean? Each machine starts on the basis of the machine that started it. > Does each machine > not start with registers set the same fixed, initial values? > Setting its registers to zeroes should not change the computation. Besides the EIP and the ESP is simply ignores the values of the other registers. The memory allocated from the heap mimics a std:vector in that its capacity is set to the size of the allocation and its size it initialized to zero. It size can only be changed by PushBack(). -- 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-22 18:37 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201222102814.127@kylheku.com> |
| In reply to | #2367 |
["Followup-To:" header set to comp.theory.] On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: > On 12/22/2020 11:03 AM, Kaz Kylheku wrote: >> ["Followup-To:" header set to comp.theory.] >> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>> On 12/22/2020 10:36 AM, Kaz Kylheku wrote: >>>> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>>>> On 12/21/2020 7:25 PM, Kaz Kylheku wrote: >>>>>> ["Followup-To:" header set to comp.theory.] >>>>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>>>>>> Halts() <is> the master of its subordinates so it an actual UTM the >>>>>>> static variable would merely be positions on the master UTM tape. >>>>>> >>>>>> Since some of those subordinates are also Halts, due to recursion, you >>>>>> have major confusion here. >>>>>> >>>>> Every invocation of Halts has the same machine code / set of states. >>>>> Every invocation of Halts in an invocation chain is executed in its own >>>>> process context, having its own memory, registers and stack. >>>> >>>> Are the memory and registers reset to the same initial values? >>>> >>> >>> The only memory that each machine uses is allocated from the heap (the >>> master tape) and the same goes for stack space. >> >> That doesn't answer my question. I asked about initial values, and >> you're talking about where the memory comes from, which is neither here >> nor there. >> >> Are these heap allocations initialized to all zero bytes? >> >>> The ESP is set to point >>> to this stack space. The other registers are allowed to diverge from >>> their present values within this separate process context. >> >> What does that mean? > > The new machine is forced to only use its own newly allocated stack > space. It cannot see any other stack space. Do you understand the question? Is that stack zeroed out, or is there garbage from previous memory allocations? >> What does "present values" mean? > > Each machine starts on the basis of the machine that started it. I don't understand what that means. Is it a copy of the machine that is starting it, in that machine's current state? If so, why not just say that? >> Does each machine >> not start with registers set the same fixed, initial values? >> > > Setting its registers to zeroes should not change the computation. So the machines are not started with registers being reset, but you're somehow sure that this is not a problem? > Besides the EIP and the ESP is simply ignores the values of the other > registers. So you think; did you verify that? > The memory allocated from the heap mimics a std:vector in that its > capacity is set to the size of the allocation and its size it > initialized to zero. It size can only be changed by PushBack(). When the memory is extended by PushBack, is that zeroed? What triggers Pushback? -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-22 12:57 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <qNidnbza1ocr3H_CnZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #2368 |
On 12/22/2020 12:37 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >> On 12/22/2020 11:03 AM, Kaz Kylheku wrote: >>> ["Followup-To:" header set to comp.theory.] >>> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/22/2020 10:36 AM, Kaz Kylheku wrote: >>>>> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 12/21/2020 7:25 PM, Kaz Kylheku wrote: >>>>>>> ["Followup-To:" header set to comp.theory.] >>>>>>> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 12/21/2020 3:59 PM, Kaz Kylheku wrote: >>>>>>>> Halts() <is> the master of its subordinates so it an actual UTM the >>>>>>>> static variable would merely be positions on the master UTM tape. >>>>>>> >>>>>>> Since some of those subordinates are also Halts, due to recursion, you >>>>>>> have major confusion here. >>>>>>> >>>>>> Every invocation of Halts has the same machine code / set of states. >>>>>> Every invocation of Halts in an invocation chain is executed in its own >>>>>> process context, having its own memory, registers and stack. >>>>> >>>>> Are the memory and registers reset to the same initial values? >>>>> >>>> >>>> The only memory that each machine uses is allocated from the heap (the >>>> master tape) and the same goes for stack space. >>> >>> That doesn't answer my question. I asked about initial values, and >>> you're talking about where the memory comes from, which is neither here >>> nor there. >>> >>> Are these heap allocations initialized to all zero bytes? >>> >>>> The ESP is set to point >>>> to this stack space. The other registers are allowed to diverge from >>>> their present values within this separate process context. >>> >>> What does that mean? >> >> The new machine is forced to only use its own newly allocated stack >> space. It cannot see any other stack space. > > Do you understand the question? Is that stack zeroed out, or is there > garbage from previous memory allocations? > Do you understand that this does not make any computational difference as long as the uninitialized values are never used? >>> What does "present values" mean? >> >> Each machine starts on the basis of the machine that started it. > > I don't understand what that means. Is it a copy of the machine that is > starting it, in that machine's current state? If so, why not just > say that? > It means that in the case where the EAX register (or any other register besides EIP and ESP) happens to have a value from a prior computation that this value remains in the EAX register. >>> Does each machine >>> not start with registers set the same fixed, initial values? >>> >> >> Setting its registers to zeroes should not change the computation. > > So the machines are not started with registers being reset, but > you're somehow sure that this is not a problem? > Yes. >> Besides the EIP and the ESP is simply ignores the values of the other >> registers. > > So you think; did you verify that? > The way to verify that would be set set them to zeros and see if the computation changes. >> The memory allocated from the heap mimics a std:vector in that its >> capacity is set to the size of the allocation and its size it >> initialized to zero. It size can only be changed by PushBack(). > > When the memory is extended by PushBack, is that zeroed? > No it is not there is no need to initialize memory that cannot be accessed until it has been initialized. As long as the std::vector protocol of memory access is used properly access to uninitialized data never occurs: // This prevents access to uninitialized data for (u32 N = 0; N < stdvector.size(); N++) > What triggers Pushback? > A call to PushBack from user code or operating system code. All of the memory of the whole system including the initial system stack is allocated from a single contiguous block as if this block of memory was a Turing Machine tape. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-22 13:44 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <Ht2dnQv7facH0X_CnZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #2364 |
On 12/22/2020 1:26 PM, Malcolm McLean wrote: > On Tuesday, 22 December 2020 at 15:39:44 UTC, olcott wrote: >> >> I think that this is the bottom line: >> Since my C program can correctly decide halting on H_Hat then by the >> Church-Turing thesis a TM can do it. >> > A Turing machine can correctly call halting on H_Hat together with > an attempted H. However that Turing machine cannot be H. If > the halt decider is a C program rather than an actual Turing machine, it > becomes easier to disguise the fact that H and the halt decider are > not identical. All you need to cheat is to hide a single flag somewhere. > So in other words you are saying that it is against the rules for a halt decider to base its halting decision on its own simulation of its input. -- 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-22 14:18 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <_KqdnU_TPuUEyX_CnZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #2370 |
On 12/22/2020 2:12 PM, Richard Damon wrote: > On 12/22/20 2:44 PM, olcott wrote: >> On 12/22/2020 1:26 PM, Malcolm McLean wrote: >>> On Tuesday, 22 December 2020 at 15:39:44 UTC, olcott wrote: >>>> >>>> I think that this is the bottom line: >>>> Since my C program can correctly decide halting on H_Hat then by the >>>> Church-Turing thesis a TM can do it. >>>> >>> A Turing machine can correctly call halting on H_Hat together with >>> an attempted H. However that Turing machine cannot be H. If >>> the halt decider is a C program rather than an actual Turing machine, it >>> becomes easierĀ to disguise the fact that H and the halt decider are >>> not identical. All you need to cheat is to hide a single flag somewhere. >>> >> >> So in other words you are saying that it is against the rules for a halt >> decider to base its halting decision on its own simulation of its input. >> > > It is against the rules for a halt decider to use information from > OUTSIDE itself to make its decision. (Like getting information from the > global 'UTM' trace from prior to its call). This information would not > be available to it as Turing Machine. > The halt decider <is> the UTM that keeps track of every instruction that it simulates. > Also, it can't use that sort of information to change its behavior, i.e. > know that it is somehow nested so deep. > -- 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-22 21:23 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201222124542.357@kylheku.com> |
| In reply to | #2371 |
["Followup-To:" header set to comp.theory.] On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: > On 12/22/2020 2:12 PM, Richard Damon wrote: >> On 12/22/20 2:44 PM, olcott wrote: >>> On 12/22/2020 1:26 PM, Malcolm McLean wrote: >>>> On Tuesday, 22 December 2020 at 15:39:44 UTC, olcott wrote: >>>>> >>>>> I think that this is the bottom line: >>>>> Since my C program can correctly decide halting on H_Hat then by the >>>>> Church-Turing thesis a TM can do it. >>>>> >>>> A Turing machine can correctly call halting on H_Hat together with >>>> an attempted H. However that Turing machine cannot be H. If >>>> the halt decider is a C program rather than an actual Turing machine, it >>>> becomes easierĀ to disguise the fact that H and the halt decider are >>>> not identical. All you need to cheat is to hide a single flag somewhere. >>>> >>> >>> So in other words you are saying that it is against the rules for a halt >>> decider to base its halting decision on its own simulation of its input. >>> >> >> It is against the rules for a halt decider to use information from >> OUTSIDE itself to make its decision. (Like getting information from the >> global 'UTM' trace from prior to its call). This information would not >> be available to it as Turing Machine. >> > > The halt decider <is> the UTM that keeps track of every instruction that > it simulates. You keep bouncing between having multiple instances of UTMs which are separate, with separate registers, then saying there is "the EAX register" (just one), then saying there is one UTM. It's a confused mess! In the proof, there are separate TM's. Halts(H_Hat, H_Hat) is one TM. H_Hat(H_Hat) is another TM There are two instances of the first one, which must be absolutely identical. One is the top-level invocation, which is asked to decide <H_Hat, H_Hat>. The other is the one embedded inside H_Hat(H_Hat). It's very simple. If Halts simulate its input, that means that the Halts inside H_Hat will run exactly the same simulation, in every detail. If the top level Halts simulation differs in any way from the simulation invoked from H_Hat, then those two are not the same TM. One is HaltsA, and the other HaltsB. In that case, the proof is not being followed. H_Hat has embedded in it a different decider from the one that is being used to decide H_Hat(H_Hat). If the whole thing is embedded in one master TM which simulates everything else, that TM must make sure that those pieces are still independent TMs with no leakage. It cannot keep some kind of log of the steps, and then make the log available to the TMs. That is complete nonsense, and doesn't refute anything.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-23 11:40 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <656dne9AA9a1HH7CnZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #2371 |
On 12/23/2020 11:12 AM, Kaz Kylheku wrote: > On 2020-12-23, olcott <NoOne@NoWhere.com> wrote: >> On 12/22/2020 6:50 PM, Kaz Kylheku wrote: >>> On 2020-12-23, olcott <NoOne@NoWhere.com> wrote: >>>> On 12/22/2020 6:08 PM, Kaz Kylheku wrote: >>>>> On 2020-12-22, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 12/22/2020 4:38 PM, Richard Damon wrote: >>>>>>> The you need to wrap the WHOLE UTM with H_Hat, not just Halts. >>>>>>> >>>>>> >>>>>> Not at all. H_Hat is a subordinate of the UTM / halt decider. >>>>> >>>>> The point is that the decider invocation that H_Hat calls must be >>>>> exactly the same as the outer one that is deciding whether H_Hat stops >>>>> on H_Hat. >>>>> >>>>> Halts cannot play a double role as a master machine that maintains >>>>> global information, and also be the embedded one in H_Hat, such that the >>>>> master one interferes with the execution of the other one. >> >>>> Basically you are saying that although a C program can detect when it is >>>> called in infinite recursion this is beyond the capability of a Turing >>>> machine. >>> >>> That is not related to what I'm saying at all. >>> >>> Rather, if a Turing machine A detects its own runaway recursion, then that >>> Turing machine always detects that recursion in exactly the same way. >> >> We are not talking about its own runaway recursion we are talking about >> another function invoking this function in infinite recursion. > > It doesn't mater what we are talking about. Whatever a TM detects, > it must detect it the same way every time. > >> The simplest way to do this that perfectly catches some of the cases is >> that as soon as any function is called a second time from the same >> machine address without any control flow instructions inbetween then >> this is definitely infinite recursion. >> >> This can be detected the same way every time by consistently applying >> the above criteria. > > But you're not doing it consistently. The top-most Halts allows the > emulation to proceed down to second embedded Halts. > > The Halts called form H_Hat cannot go down to the same depth. > > Why is that? Something is different. That's an inconsistency. > > The machine on which the inner Halts is executing has changed the rules > about how deep the recursion can go. But how does it know? It is "in > cahoots" with the top level machine; it knows about the nesting. > > That constitutes a channel of information leakage. That's a form of > information leakage which is not available to the true TM versions of > Halts and H_Hat in the proof. > > Everything you are doing can be modeled by TMs and by pure functions. If > the logic of your system were refactored into pure function (say, > rewritten in a purely functional language like Haskell) you would no > longer be able to represent the procedure call Halts(H_Hat, H_Hat) as a > two-argument function. It would have to have a third argument like > "emulation depth" or whatever, taking different values, and that would > make it obvious that it doesn't speak to the halting proofs. > Halts is fundamentally a UTM that can spawn other slave UTMs that are executed in a recursive hierarchy or not. Every UTM that is simulated by the Halts master UTM is forced to write its complete execution trace to the Halts / master UTM tape as a part of its process of simulation. -- 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-22 14:34 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <JsqdnTo9vsOixX_CnZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #2370 |
On 12/22/2020 2:25 PM, Malcolm McLean wrote: > On Tuesday, 22 December 2020 at 19:44:33 UTC, olcott wrote: >> On 12/22/2020 1:26 PM, Malcolm McLean wrote: >>> On Tuesday, 22 December 2020 at 15:39:44 UTC, olcott wrote: >>>> >>>> I think that this is the bottom line: >>>> Since my C program can correctly decide halting on H_Hat then by the >>>> Church-Turing thesis a TM can do it. >>>> >>> A Turing machine can correctly call halting on H_Hat together with >>> an attempted H. However that Turing machine cannot be H. If >>> the halt decider is a C program rather than an actual Turing machine, it >>> becomes easier to disguise the fact that H and the halt decider are >>> not identical. All you need to cheat is to hide a single flag somewhere. >>> >> So in other words you are saying that it is against the rules for a halt >> decider to base its halting decision on its own simulation of its input. >> > I'm not quite sure what that means. The halt decider can certainly > build a Turing machine from the machine description input and > step it as part of its decision process. However it can't communicate > with anything outside of its input tape, until the final moment, > when it halts and produces a single yes / no decision. > Then within this specification it can construct a hierarchy of UTM's executing other UTM's each writing their execution trace (sequence of state transitions) to the master tape of this halt decider / UTM. > If H is a Turing machine, then this requirement is enforced by the > rules for the construction of Turing machines. If H is a C function, > the programmer has to enforce the rule by restricting the C constructs > that he uses. > -- 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-21 12:34 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <vaadnZKsDaM0d33CnZ2dnUU7-L3NnZ2d@giganews.com> |
| In reply to | #2348 |
On 12/21/2020 12:22 PM, Kaz Kylheku wrote: > On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: >> From my point of view testing these things would be like testing that 2 >> + 3 = 5 on a calculator. > > That suggests an excellent one-sentence analogy of all your empirical > work: you're frothing up a caclulator demo to disprove "2 + 3 = 5". > > In the demo, a doctored calculator CPU inadvertently flips a bit, > so that that 00..11 changes into into 00..10. The answer 4 > pops out, and victory is claimed. > > Everyone objects that 3 is immutable; you can't change it into 2. The > calculations must be pure! But, you say, that's the proof's problem, > not yours; it doesn't take into account dynamics. > > Oh, but you're looking into this immutability stuff, and revising the > code, all the same ... Halts does decide H_Hat correctly if math says this is impossible then math is wrong. Math has a few screwy things that need to be abolished. The principle of explosion is one of these things. A set as a member of itself is the same as a person that shoves themselves up so far up their own butt-hole no outside surface of their body is outside of their own butt-hole and their butt-hole is also shoved up itself thus having no outside surface. To make a long story short the concept of a set containing itself is incoherent. Nothing can possibly totally contain itself such that its conceptual or physical outer boundary ceases to exist. If any conceptual or physical outer boundary does exist then then total containment has not occurred. -- 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-22 20:25 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <Mrydnba99JMaN3_CnZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #2346 |
On 12/22/2020 8:13 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 12/20/2020 7:42 PM, Ben Bacarisse wrote:
> <cut>
>>> OK. Let me know if you want to try again, but a function that meets
>>> the specification I gave can't execute indefinitely.
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> else
>> HALT
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output_Debug_Trace();
>> Output("Input_Would_Halt =", Input_Would_Halt);
>> HALT;
>> }
>
> ... and so on.
>
> You are just mindlessly cutting and pasting replies. Nothing here could
> possibly be taken as a function that meets the challenge I posted.
>
The above H_Hat() is complete. I am adapting Halts() so that it makes
its decision only based on the execution trace derived from its input.
The prior Halts() made its decision based on the complete execution of
every user instruction that was executed whether it was input to Halts()
or not.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 16 of 21 — ← Prev page 1 … 14 15 [16] 17 18 … 21 Next page →
Back to top | Article view | comp.software-eng
csiph-web