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 15 of 21 — ← Prev page 1 … 13 14 [15] 16 17 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-20 16:20 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) |
| Message-ID | <45udnTCR_9qrU0LCnZ2dnUU7-QnNnZ2d@giganews.com> |
| In reply to | #2342 |
On 12/20/2020 3:58 PM, Jeff Barnett wrote: > On 12/20/2020 12:43 PM, olcott wrote: >> On 12/20/2020 1:05 PM, Jeff Barnett wrote: >>> On 12/20/2020 11:30 AM, olcott wrote: >>>> Because only a very stupid person would believe that an infinitely >>>> recursive invocation ever returns a value to it caller. >>> >>> It was your misguided idea to use emulation. Standard tools for these >>> sorts of analyses are lexical analysis and loop invariants. The fact >>> that your implementation and misunderstandings lead you into troubles >>> of your own making is no surprise. >> >> So in other words you are implying that you too also stupidly believe >> that some infinitely recursive invocations do return values to their >> callers. > > If you would only read the threads you respond to, you wouldn't seem so > idiotic all the time. The simple response Is that whether or not that > always leads to non halting depends on the "semantics" of evaluation of > the language the code was written in. Oh so in other words your problem is not stupidity but instead you are too brain damaged to remember that I have said that the language is the x86 language many hundreds of times? ---[000005e6](01) 55 push ebp ---[000005e7](02) 8bec mov ebp,esp ---[000005e9](01) 51 push ecx ---[000005ea](03) 8b4508 mov eax,[ebp+08] ---[000005ed](01) 50 push eax ---[000005ee](03) 8b4d08 mov ecx,[ebp+08] ---[000005f1](01) 51 push ecx ---[000005f2](05) e8effdffff call 000003e6 --CALL [000003e6] ---[000005e6](01) 55 push ebp ---[000005e7](02) 8bec mov ebp,esp ---[000005e9](01) 51 push ecx ---[000005ea](03) 8b4508 mov eax,[ebp+08] ---[000005ed](01) 50 push eax ---[000005ee](03) 8b4d08 mov ecx,[ebp+08] ---[000005f1](01) 51 push ecx ---[000005f2](05) e8effdffff call 000003e6 --CALL [000003e6] Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6] > Since you are totally unaware of > this - though I mentioned it with examples in a prior post - you have > turned your normal ignorance into mulish ignorance. As usual. Make a > donkey bray for the audience please. > >> To me this seems just as stupid as people believing that Trump won the >> election when every poll of his approval rating consistently said that >> most people thought he was always doing a bad job. > > Like logic, your not a student of history. Look up polls taken at that > time and compare to the actual results of the Dewey Vs. Truman contest. > You seem to have a knack for picking really poor examples. > It is a different kind of poll. The approval rating poll is much more reliable. Since Trump must know that every poll consistently showed a very poor approval rating the whole time that he was president he knows damn well that he did not win the election. > By the way, you seem to use Trump a lot in your emails and I find that > funny. When it comes to self deception and a confused mind, you make our > illustrious president look like a mental giant who is completely aware > of the current situation. Why do you pick analogies that are more about > you than who you point them at. Einstein had you in mind - see quote at > the end of a lot of your messages. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-12-20 16:37 -0700 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) |
| Message-ID | <rron8i$19l$1@dont-email.me> |
| In reply to | #2343 |
On 12/20/2020 3:20 PM, olcott wrote: > On 12/20/2020 3:58 PM, Jeff Barnett wrote: >> On 12/20/2020 12:43 PM, olcott wrote: >>> On 12/20/2020 1:05 PM, Jeff Barnett wrote: >>>> On 12/20/2020 11:30 AM, olcott wrote: >>>>> Because only a very stupid person would believe that an infinitely >>>>> recursive invocation ever returns a value to it caller. >>>> >>>> It was your misguided idea to use emulation. Standard tools for >>>> these sorts of analyses are lexical analysis and loop invariants. >>>> The fact that your implementation and misunderstandings lead you >>>> into troubles of your own making is no surprise. >>> >>> So in other words you are implying that you too also stupidly believe >>> that some infinitely recursive invocations do return values to their >>> callers. >> >> If you would only read the threads you respond to, you wouldn't seem >> so idiotic all the time. The simple response Is that whether or not >> that always leads to non halting depends on the "semantics" of >> evaluation of the language the code was written in. > > Oh so in other words your problem is not stupidity but instead you are > too brain damaged to remember that I have said that the language is the > x86 language many hundreds of times? Don't be absurd. Who's the schmuck who decide to compile C into x86 code so he could fake aspects of execution and tell brain-dead lies about it. If you really are fool enough to keep on down this path, write your code in X86, quit talking about C, and turn over H. Stop the nonsense and put on your big boy pants. These 3d level traces prove nothing other than giving your readers the choice as to weather you are dishonest or a completely stupid fucktard. > ---[000005e6](01) 55 push ebp > ---[000005e7](02) 8bec mov ebp,esp > ---[000005e9](01) 51 push ecx > ---[000005ea](03) 8b4508 mov eax,[ebp+08] > ---[000005ed](01) 50 push eax > ---[000005ee](03) 8b4d08 mov ecx,[ebp+08] > ---[000005f1](01) 51 push ecx > ---[000005f2](05) e8effdffff call 000003e6 --CALL > [000003e6] > ---[000005e6](01) 55 push ebp > ---[000005e7](02) 8bec mov ebp,esp > ---[000005e9](01) 51 push ecx > ---[000005ea](03) 8b4508 mov eax,[ebp+08] > ---[000005ed](01) 50 push eax > ---[000005ee](03) 8b4d08 mov ecx,[ebp+08] > ---[000005f1](01) 51 push ecx > ---[000005f2](05) e8effdffff call 000003e6 --CALL > [000003e6] > Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6] > >> Since you are totally unaware of this - though I mentioned it with >> examples in a prior post - you have turned your normal ignorance into >> mulish ignorance. As usual. Make a donkey bray for the audience please. >> >>> To me this seems just as stupid as people believing that Trump won >>> the election when every poll of his approval rating consistently said >>> that most people thought he was always doing a bad job. >> >> Like logic, your not a student of history. Look up polls taken at that >> time and compare to the actual results of the Dewey Vs. Truman >> contest. You seem to have a knack for picking really poor examples. >> > > It is a different kind of poll. > The approval rating poll is much more reliable. > Since Trump must know that every poll consistently showed a very poor > approval rating the whole time that he was president he knows damn well > that he did not win the election. > >> By the way, you seem to use Trump a lot in your emails and I find that >> funny. When it comes to self deception and a confused mind, you make >> our illustrious president look like a mental giant who is completely >> aware of the current situation. Why do you pick analogies that are >> more about you than who you point them at. Einstein had you in mind - >> see quote at the end of a lot of your messages. I see that the Einstein quote you use to characterize your own muddled mind state is attached to the message I'm replying to. Read it. Read it again and then look up that coffee shop waitress and get on the floor and worship her wisdom. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-20 18:22 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Richard insists on acting stupidly) |
| Message-ID | <PomdnYeOtMJId0LCnZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #2344 |
On 12/20/2020 5:37 PM, Jeff Barnett wrote:
> On 12/20/2020 3:20 PM, olcott wrote:
>> On 12/20/2020 3:58 PM, Jeff Barnett wrote:
>>> On 12/20/2020 12:43 PM, olcott wrote:
>>>> On 12/20/2020 1:05 PM, Jeff Barnett wrote:
>>>>> On 12/20/2020 11:30 AM, olcott wrote:
>>>>>> Because only a very stupid person would believe that an infinitely
>>>>>> recursive invocation ever returns a value to it caller.
>>>>>
>>>>> It was your misguided idea to use emulation. Standard tools for
>>>>> these sorts of analyses are lexical analysis and loop invariants.
>>>>> The fact that your implementation and misunderstandings lead you
>>>>> into troubles of your own making is no surprise.
>>>>
>>>> So in other words you are implying that you too also stupidly
>>>> believe that some infinitely recursive invocations do return values
>>>> to their callers.
>>>
>>> If you would only read the threads you respond to, you wouldn't seem
>>> so idiotic all the time. The simple response Is that whether or not
>>> that always leads to non halting depends on the "semantics" of
>>> evaluation of the language the code was written in.
>>
>> Oh so in other words your problem is not stupidity but instead you are
>> too brain damaged to remember that I have said that the language is
>> the x86 language many hundreds of times?
>
> Don't be absurd. Who's the schmuck who decide to compile C into x86 code
> so he could fake aspects of execution and tell brain-dead lies about it.
> If you really are fool enough to keep on down this path, write your code
> in X86, quit talking about C, and turn over H.
I am working on that. Because of the reviews here I am transforming the
local halt decider into a local halt decider with this architecture:
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;
}
The final x86utm based halt decider will have three modes:
(1) global
(2) local
(3) none
> Stop the nonsense and put
> on your big boy pants. These 3d level traces prove nothing other than
> giving your readers the choice as to weather you are dishonest or a
> completely stupid fucktard.
>
For people that can actually understand the x86 language
(1) The C code does map to its machine code.
(2) The machine code does map to its execution trace.
(3) The execution trace does map to infinite recursion.
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;
}
_H_Hat()
[000005e6](01) 55 push ebp
[000005e7](02) 8bec mov ebp,esp
[000005e9](01) 51 push ecx
[000005ea](03) 8b4508 mov eax,[ebp+08]
[000005ed](01) 50 push eax
[000005ee](03) 8b4d08 mov ecx,[ebp+08]
[000005f1](01) 51 push ecx
[000005f2](05) e8effdffff call 000003e6
[000005f7](03) 83c408 add esp,+08
[000005fa](03) 8945fc mov [ebp-04],eax
[000005fd](04) 837dfc00 cmp dword [ebp-04],+00
[00000601](02) 7404 jz 00000607
[00000603](02) ebfe jmp 00000603
[00000605](02) eb01 jmp 00000608
[00000607](01) f4 hlt
[00000608](02) 8be5 mov esp,ebp
[0000060a](01) 5d pop ebp
[0000060b](01) c3 ret
_main()
[00000616](01) 55 push ebp
[00000617](02) 8bec mov ebp,esp
[00000619](01) 51 push ecx
[0000061a](05) 68e6050000 push 000005e6
[0000061f](05) 68e6050000 push 000005e6
[00000624](05) e8bdfdffff call 000003e6
[00000629](03) 83c408 add esp,+08
[0000062c](03) 8945fc mov [ebp-04],eax
[0000062f](05) e8f2fcffff call 00000326
[00000634](03) 8b45fc mov eax,[ebp-04]
[00000637](01) 50 push eax
[00000638](05) 68a3020000 push 000002a3
[0000063d](05) e894fcffff call 000002d6
[00000642](03) 83c408 add esp,+08
[00000645](01) f4 hlt
[00000646](02) 8be5 mov esp,ebp
[00000648](01) 5d pop ebp
[00000649](01) c3 ret
Output_Debug_Trace() Trace_List.size(24)
---[00000616](01) 55 push ebp
---[00000617](02) 8bec mov ebp,esp
---[00000619](01) 51 push ecx
---[0000061a](05) 68e6050000 push 000005e6
---[0000061f](05) 68e6050000 push 000005e6
---[00000624](05) e8bdfdffff call 000003e6 --CALL [000003e6]
---[000005e6](01) 55 push ebp
---[000005e7](02) 8bec mov ebp,esp
---[000005e9](01) 51 push ecx
---[000005ea](03) 8b4508 mov eax,[ebp+08]
---[000005ed](01) 50 push eax
---[000005ee](03) 8b4d08 mov ecx,[ebp+08]
---[000005f1](01) 51 push ecx
---[000005f2](05) e8effdffff call 000003e6 --CALL [000003e6]
---[000005e6](01) 55 push ebp
---[000005e7](02) 8bec mov ebp,esp
---[000005e9](01) 51 push ecx
---[000005ea](03) 8b4508 mov eax,[ebp+08]
---[000005ed](01) 50 push eax
---[000005ee](03) 8b4d08 mov ecx,[ebp+08]
---[000005f1](01) 51 push ecx
---[000005f2](05) e8effdffff call 000003e6 --CALL [000003e6]
That you would denigrate my work entirely on the basis of your own
ignorance of the x86 language certainly seems like a real jackass move
to me.
--
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-19 10:00 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) |
| Message-ID | <YoCdnf3t450ZvkPCnZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #2280 |
On 12/19/2020 9:29 AM, André G. Isaak wrote: > On 2020-12-19 08:14, olcott wrote: >> On 12/19/2020 7:41 AM, André G. Isaak wrote: >>> On 2020-12-19 04:47, Malcolm McLean wrote: >>>> Divide has a special point at denominator 0 where the graph jumps >>>> from -infinity >>>> to + infinity. So one way of solving this is to say that the >>>> (mathematical sense) function >>>> isn't defined for this input. The code can do anything if you say >>>> that the input is >>>> disallowed - raise a signal, return zero, go into an infinite loop. >>>> >>>> The function Halts() is defined for all inputs that represent a >>>> valid Turing machine >>>> and tape. The machine will either eventually halt or it won't. >>> >>> Here we should clarify (for Olcott's sake, not yours) we aren't >>> talking about Olcott's Halts(), but rather the mathematical function >>> which his Halts() attempts to compute. >>> >>> The mathematical Halts function maps every pair <Turning Machine >>> Description, Input String> to either HALTS or DOESN'T_HALT. This >>> function isn't a computer program. It is simply a mapping which >>> exists independently of any machine which purports to compute it. >>> >> >> It could be a mapping from finite strings represnting a machine and >> its input to ordered sets of finite stings of execution sequences >> after N steps of the computation have been completed. > > You could create such a mapping if you wanted to, but it would be a > *different* function. What I am describing is the function which the > halting problem deals with. This is a function which has already been > precisely defined. > A thing can be defined precisely and still defined insufficiently by leaving out required details. >> A second mapping from elements of the set of sequences to a Boolean >> values indicating halting status could occur. Unrecognized patterns of >> infinite execution would never map to a Boolean value. The rest would >> map to True for halted after N steps or False for infinite execution >> detected after M steps. > > Again, the above has nothing to do with the function which the halting > problem deals with, which is a function mapping *every* possible input > in its domain to either HALTS or DOESN'T_HALT. And this does not specifically preclude an intermediate mapping inbetween. The conclusion of the halting problem undecidability proof is that halting is not always decidable. The basis of this conclusion is an input counter-example that this proof hypothesizes is not correctly decidable by any means what-so-ever. As long as one means for deciding this input is provided the hypothesis basis of the proof and thus the whole proof is refuted. That the proof did not consider a two-level mapping is merely a fault of the proof and not a fault of the refutation of this proof. > If there are things which > never map to a boolean value then you are talking about some entirely > different function. > > André > -- 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-19 15:21 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <oeydnT-_rt5280PCnZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #2280 |
On 12/19/2020 3:08 PM, André G. Isaak wrote:
> On 2020-12-19 13:16, olcott wrote:
>
>> This seems to also address the objections of Kaz and Malcolm in that
>> it is a pure function of its inputs and does not require any global data.
>
> Anything requiring static variables is not a pure function.
>
In the case of a halt decider derived from an actual UTM this would
merely involve the UTM keeping track of the instructions that it
simulated. That is all that is occuring here.
The key point is that such a halt decider has no undecidable inputs and
that is all that is actually required. That it does not conform to some
purely arbitrary conventions is totally irrelevant.
>> 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;
>> }
>>
--
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-19 19:30 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) |
| Message-ID | <jYOdnSpMQZ2iNEPCnZ2dnUU7-X3NnZ2d@giganews.com> |
| In reply to | #2280 |
On 12/19/2020 6:57 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
> Code for contex:
>
> bool Halts(u32 P, u32 I)
> {
> bool Halted = false;
> bool Aborted = false;
> while (!Halted && !Aborted)
> {
> Halted = DebugStep(P, I);
> Aborted = Needs_To_Be_Aborted();
> }
> return !Aborted;
>
> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>
> The key fact from the horse's mouth:
>
> olcott <NoOne@NoWhere.com> writes:
> | The infinitely recursive invocation of Halts() by Confound_Halts()
> | never returns anything to Confound_Halts()
>
> <cut a diversion>
>>>>> But Ben wasn't discussing that function. He was discussing a
>>>>> function which met the specification:
>>>>>
>>>>> F(P, I) is true if, and only if, P(I) is a finite computation and
>>>>> false otherwise.
>>>>>
>>>>> Note the "if and only if" and the "otherwise". That exhausts all
>>>>> possibilities and doesn't include the possibility of not returning
>>>>> a result.
>
>>>> If is a partial decider that correct decides the halting problem
>>>> counter examples.
>>>
>>> You might be offering a partial decider, but that's not what Ben specified.
>>
>> It seems that I have to say everything at least fifty times because
>> people are not taking their Adderall for their ADD.
>>
>> I am frigging not trying to solve the halting problem by defining a
>> halt decider. I am refuting the halting problem proofs by defining a
>> partial decider that correctly decides the counter-examples that they
>> use as the basis of these proofs.
>
> If you were both knowledgeable and honest you would not have posted, in
> reply to my challenge, a function that fails to meet it. But you are
> neither. You did not have the knowledge to realise that your own words
> would soon show that the Halts function fails the challenge, and you are
> not honest enough to admit that only claiming a partial decider is
> irrelevant to my challenge.
>
> The knowledgeable and honest answer all those posts ago would have been
> "No, I can't post such a function because I only have a partial
> decider".
>
> So, do you want to have another go at meeting the challenge, or do you
> accept that, at least for the moment, you cannot meet it?
>
This is the updated template of the function that correctly decides:
void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
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;
}
When defining the scope of a decider whether it be all finite strings,
all finite strings describing Turing machines or finite strings defining
a single computation stipulating the specific co-domain of the function
is more precise and thus more effective communication than simply using
the conventional terminology in the conventional way. My halt decider
has a co-domain of at least the one element of:
void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
--
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-19 19:42 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) |
| Message-ID | <fK-dnUCeRPJhNkPCnZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #2336 |
On 12/19/2020 7:30 PM, olcott wrote:
> On 12/19/2020 6:57 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>> Code for contex:
>>
>> bool Halts(u32 P, u32 I)
>> {
>> bool Halted = false;
>> bool Aborted = false;
>> while (!Halted && !Aborted)
>> {
>> Halted = DebugStep(P, I);
>> Aborted = Needs_To_Be_Aborted();
>> }
>> return !Aborted;
>>
>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>
>> The key fact from the horse's mouth:
>>
>> olcott <NoOne@NoWhere.com> writes:
>> | The infinitely recursive invocation of Halts() by Confound_Halts()
>> | never returns anything to Confound_Halts()
>>
>> <cut a diversion>
>>>>>> But Ben wasn't discussing that function. He was discussing a
>>>>>> function which met the specification:
>>>>>>
>>>>>> F(P, I) is true if, and only if, P(I) is a finite computation and
>>>>>> false otherwise.
>>>>>>
>>>>>> Note the "if and only if" and the "otherwise". That exhausts all
>>>>>> possibilities and doesn't include the possibility of not returning
>>>>>> a result.
>>
>>>>> If is a partial decider that correct decides the halting problem
>>>>> counter examples.
>>>>
>>>> You might be offering a partial decider, but that's not what Ben
>>>> specified.
>>>
>>> It seems that I have to say everything at least fifty times because
>>> people are not taking their Adderall for their ADD.
>>>
>>> I am frigging not trying to solve the halting problem by defining a
>>> halt decider. I am refuting the halting problem proofs by defining a
>>> partial decider that correctly decides the counter-examples that they
>>> use as the basis of these proofs.
>>
>> If you were both knowledgeable and honest you would not have posted, in
>> reply to my challenge, a function that fails to meet it. But you are
>> neither. You did not have the knowledge to realise that your own words
>> would soon show that the Halts function fails the challenge, and you are
>> not honest enough to admit that only claiming a partial decider is
>> irrelevant to my challenge.
>>
>> The knowledgeable and honest answer all those posts ago would have been
>> "No, I can't post such a function because I only have a partial
>> decider".
>>
>> So, do you want to have another go at meeting the challenge, or do you
>> accept that, at least for the moment, you cannot meet it?
>>
>
> This is the updated template of the function that correctly decides:
> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>
> 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;
> }
>
> When defining the scope of a decider whether it be all finite strings,
> all finite strings describing Turing machines or finite strings defining
> a single computation stipulating the specific co-domain of the function
> is more precise and thus more effective communication than simply using
> the conventional terminology in the conventional way. My halt decider
> has a co-domain of at least the one element of:
>
> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
I screwed that one up. It screwed me up that the range/domain suddenly
swapped out one of these and started callibg is the co-domain.
The set of inputs to the Halts() function for which Boolean outputs are
defined includes at least the one element of:
void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
I have to rewrite my global halt decider to correspond to the above
template.
--
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-19 20:01 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Ben's example) |
| Message-ID | <wcCdnZOs5obtLUPCnZ2dnUU7-L_NnZ2d@giganews.com> |
| In reply to | #2336 |
On 12/19/2020 7:50 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 12/19/2020 6:57 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>> Code for contex:
>>>
>>> bool Halts(u32 P, u32 I)
>>> {
>>> bool Halted = false;
>>> bool Aborted = false;
>>> while (!Halted && !Aborted)
>>> {
>>> Halted = DebugStep(P, I);
>>> Aborted = Needs_To_Be_Aborted();
>>> }
>>> return !Aborted;
>>>
>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>
>>> The key fact from the horse's mouth:
>>>
>>> olcott <NoOne@NoWhere.com> writes:
>>> | The infinitely recursive invocation of Halts() by Confound_Halts()
>>> | never returns anything to Confound_Halts()
>>>
>>> <cut a diversion>
>>>>>>> But Ben wasn't discussing that function. He was discussing a
>>>>>>> function which met the specification:
>>>>>>>
>>>>>>> F(P, I) is true if, and only if, P(I) is a finite computation and
>>>>>>> false otherwise.
>>>>>>>
>>>>>>> Note the "if and only if" and the "otherwise". That exhausts all
>>>>>>> possibilities and doesn't include the possibility of not returning
>>>>>>> a result.
>>>
>>>>>> If is a partial decider that correct decides the halting problem
>>>>>> counter examples.
>>>>>
>>>>> You might be offering a partial decider, but that's not what Ben specified.
>>>>
>>>> It seems that I have to say everything at least fifty times because
>>>> people are not taking their Adderall for their ADD.
>>>>
>>>> I am frigging not trying to solve the halting problem by defining a
>>>> halt decider. I am refuting the halting problem proofs by defining a
>>>> partial decider that correctly decides the counter-examples that they
>>>> use as the basis of these proofs.
>>>
>>> If you were both knowledgeable and honest you would not have posted, in
>>> reply to my challenge, a function that fails to meet it. But you are
>>> neither. You did not have the knowledge to realise that your own words
>>> would soon show that the Halts function fails the challenge, and you are
>>> not honest enough to admit that only claiming a partial decider is
>>> irrelevant to my challenge.
>>>
>>> The knowledgeable and honest answer all those posts ago would have been
>>> "No, I can't post such a function because I only have a partial
>>> decider".
>>>
>>> So, do you want to have another go at meeting the challenge, or do you
>>> accept that, at least for the moment, you cannot meet it?
>>
>> This is the updated template of the function that correctly decides:
>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>
> I've addressed this where you posted it, but you appear to have already
> admitted defeat here. I wish you would keep all the details together
> because I took this suggestion seriously in my reply to the other post
> where you made it.
>
>> 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;
>> }
>>
>> When defining the scope of a decider whether it be all finite strings,
>> all finite strings describing Turing machines or finite strings
>> defining a single computation stipulating the specific co-domain of
>> the function is more precise and thus more effective communication
>> than simply using the conventional terminology in the conventional
>> way. My halt decider has a co-domain of at least the one element of:
>>
>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>
> You don't mean co-domain. You should look up fancy words before trying
> to use them.
>
> You probably mean that want to restrict the domain on which the function
> is defined (or possibly just on which it is correct), but that domain
> does no consist of functions, but of pairs.
>
> But these are technicalities. The big problem is that you are not
> claiming to have a function that meets the specification. That
> specification does not permit a candidate to have such a restricted
> domain. A knowledgeable and honest post would have said "No, I can't
> post such a function, but maybe you would be interested in this more
> limited partial function...".
>
The above function always correctly decides that
>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
is a non halting computation the first chance that it gets.
As long as it can examine any element of the otherwise infinite
recursion it decides not halting on the basis of this element and
terminates the otherwise infinitely recursive sequence.
If neither the local Halts nor the global Halts is allowed to decide
halting on this because the halt decider is in <none> mode then
>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
executes infinitely.
--
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-20 12:19 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (Mathematical Mapping) |
| Message-ID | <N7adnVGkCKY4CELCnZ2dnUU7-T3NnZ2d@giganews.com> |
| In reply to | #2336 |
On 12/20/2020 11:11 AM, Kaz Kylheku wrote:
> On 2020-12-20, olcott <NoOne@NoWhere.com> wrote:
>> My point is that I am not solving the halting problem I am refuting the
>> conventional halting problem undecidability proofs, you know the
>> difference don't you?
>
> Well, you're spectactularly failing in refuting those proofs by not
> understanding what is an algorithmic machine corresponding to a
> function: a deterministic machine whose behavior depends only on its
> documented inputs, which correspond to arguments of the function.
>
> You think it's perfectly fine for instances of supposedly the same
> algorithmic machine with the same initial conditions to behave
> differently in different instances, which is absurd.
>
> You created a simulation in which you say exactly that is happening,
> but the executing procedures have hidden inputs through information
> leakage from a synthetic x86 CPU that you've doctored. For instance,
> the synthetic CPU can detect and stop a runaway recursion at a
> predetermined number of levels, and this is done in a way which is
> visible to the running code, in order to alter its decision-making.
>
> By the way, the conventional proofs do not just say that there is no
> universal halting decider. In so doing, they prove a logically weaker,
> more general claim: namely, that there is no function at all that can be
> substituted into their framework program which will return a correct
> halting answer for just that program, regardless of whether that
> function is even remotely a halting decider for any other input
> combination. The trap is so perspicuously clear, that there is
> obviously no escape.
>
Sure if you ignore my proof to the contrary it would certainly seem that
way. According to aerodynamics bumblebees cannot fly yet they fly
proving that aerodynamics is wrong.
If according to math this function cannot be correctly decided by
Halts(), when I show all of the steps of exactly how it is correctly
decided by Halts() math is proved wrong.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
else
HALT
}
This function maps integer machine addresses
to a Boolean value indicating the halting status
of x86 program P on input I. It achieve this
mapping through intermediate mappings:
(a) Integer machine addresses are mapped
to their corresponding finite strings, The first finite
string P is a sequence of bytes representing the
x86 machine language instructions of executable
code.
(b) The pair of finite strings corresponding to (P and I)
are mapped to a set of sequences of finite strings
each sequence representing a point along the
execution trace of P on input I.
(c) One of the elements of this set of sequences is
mapped to a Boolean value indicating the halting
status of P on input I.
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;
}
--
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-19 19:54 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <O7adncOus-MkM0PCnZ2dnUU7-dHNnZ2d@giganews.com> |
| In reply to | #2280 |
On 12/19/2020 7:34 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 12/17/2020 8:35 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 12/16/2020 6:25 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>
>>>>>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>> Code for contex:
>>>
>>> bool Halts(u32 P, u32 I)
>>> {
>>> bool Halted = false;
>>> bool Aborted = false;
>>> while (!Halted && !Aborted)
>>> {
>>> Halted = DebugStep(P, I);
>>> Aborted = Needs_To_Be_Aborted();
>>> }
>>> return !Aborted;
>>>
>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>> The infinitely recursive invocation of Halts() by Confound_Halts()
>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>
>>>>>>>>>>> OK that's excellently clear.
>>>>>>>
>>>>>>> You are perfectly clear. Halts fails to meet the conditions set out in
>>>>>>> the challenge by not returning a value:
>>>>>>>
>>>>>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>>>>>> finite computation and false otherwise.
>>>>>>>
>>>>>>> Not returning a value, even if only in some contexts, makes it a fail.
>>> <cut>
>>>>
>>>> I just proved how it does perrectly meet its conditions.
>>>
>>> Don't be silly. The specification:
>>>
>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>> finite computation and false otherwise.
>>>
>>> requires that the function return a value, regardless of context.
>>
>> This definition of a Halt decider seems to address your objections.
>
> But do you claim it meets the specification? Since you posted a
> function before that clearly does not, you might just be trying to waste
> my time again.
>
>> It turns out that in this case the innermost Halts() is the one that
>> makes the halt decision thus could return this same decision to its
>> outer invocations.
>>
>> This seems to also address the objections of Kaz and Malcolm in that
>> it is a pure function of its inputs and does not require any global
>> data.
>
> I don't care if it is pure function or not, nor do I care about global
> or static data. The specification only requires that its return value
> be correct. That's what enables us to reason about each and every call
> to the function.
>
>> bool Halts(u32 P, u32 I)
>
> I am going to rename it Halts2. This continual reusing of the same name
> for different functions is just bad engineering and sows confusion.
>
>> {
>> 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;
>> }
>
> Because this function is incomplete (it references code I can't see),
> you will have to tell me what it returns. In
>
> bool Halts2(u32 P, u32 I) { ... as above ... }
>
> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>
> int main(void) { Confound_Halts2(Confound_Halts2); }
>
> the first thing that happens in Confound_Halts2 is a call to Halts2 in
> the 'if'. What does this function call return? And in
>
> bool Halts2(u32 P, u32 I) { ... as above ... }
>
> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>
> int main(void) {
> return Halts2(Confound_Halts2, Confound_Halts2) ? EXIT_SUCCESS : EXIT_FAILURE;
> }
>
> what does the call to Halts2 in main return?
>
In global halt deciding mode they both return false to the operating
system treating infinite executiom as a fatal error.
In none halt deciding mode they both execute infinitely.
What it returns and why it returns this value in local halt deciding
mode is beyond your comprehension unless you first understand how and
why both the global halt deciding mode and the none halt deciding mode
are decided correctly.
--
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-20 18:41 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <FoKdnYUbONO1ckLCnZ2dnUU7-R_NnZ2d@giganews.com> |
| In reply to | #2338 |
On 12/20/2020 6:18 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 12/19/2020 7:34 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 12/17/2020 8:35 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 12/16/2020 6:25 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>> Code for contex:
>>>>>
>>>>> bool Halts(u32 P, u32 I)
>>>>> {
>>>>> bool Halted = false;
>>>>> bool Aborted = false;
>>>>> while (!Halted && !Aborted)
>>>>> {
>>>>> Halted = DebugStep(P, I);
>>>>> Aborted = Needs_To_Be_Aborted();
>>>>> }
>>>>> return !Aborted;
>>>>>
>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>> The infinitely recursive invocation of Halts() by Confound_Halts()
>>>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>>>
>>>>>>>>>>>>> OK that's excellently clear.
>>>>>>>>>
>>>>>>>>> You are perfectly clear. Halts fails to meet the conditions set out in
>>>>>>>>> the challenge by not returning a value:
>>>>>>>>>
>>>>>>>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>
>>>>>>>>> Not returning a value, even if only in some contexts, makes it a fail.
>>>>> <cut>
>>>>>>
>>>>>> I just proved how it does perrectly meet its conditions.
>>>>>
>>>>> Don't be silly. The specification:
>>>>>
>>>>> Show a function F such that F(P, I) is true if, and only if, P(I) is a
>>>>> finite computation and false otherwise.
>>>>>
>>>>> requires that the function return a value, regardless of context.
>>>>
>>>> This definition of a Halt decider seems to address your objections.
>>>
>>> But do you claim it meets the specification? Since you posted a
>>> function before that clearly does not, you might just be trying to waste
>>> my time again.
>>>
>>>> It turns out that in this case the innermost Halts() is the one that
>>>> makes the halt decision thus could return this same decision to its
>>>> outer invocations.
>>>>
>>>> This seems to also address the objections of Kaz and Malcolm in that
>>>> it is a pure function of its inputs and does not require any global
>>>> data.
>>>
>>> I don't care if it is pure function or not, nor do I care about global
>>> or static data. The specification only requires that its return value
>>> be correct. That's what enables us to reason about each and every call
>>> to the function.
>>>
>>>> bool Halts(u32 P, u32 I)
>>>
>>> I am going to rename it Halts2. This continual reusing of the same name
>>> for different functions is just bad engineering and sows confusion.
>>>
>>>> {
>>>> 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;
>>>> }
>>>
>>> Because this function is incomplete (it references code I can't see),
>>> you will have to tell me what it returns. In
>>>
>>> bool Halts2(u32 P, u32 I) { ... as above ... }
>>>
>>> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>>>
>>> int main(void) { Confound_Halts2(Confound_Halts2); }
>>>
>>> the first thing that happens in Confound_Halts2 is a call to Halts2 in
>>> the 'if'. What does this function call return? And in
>>>
>>> bool Halts2(u32 P, u32 I) { ... as above ... }
>>>
>>> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>>>
>>> int main(void) {
>>> return Halts2(Confound_Halts2, Confound_Halts2) ? EXIT_SUCCESS : EXIT_FAILURE;
>>> }
>>>
>>> what does the call to Halts2 in main return?
>>
>> In global halt deciding mode they both return false to the operating
>> system treating infinite executiom as a fatal error.
>>
>> In none halt deciding mode they both execute infinitely.
>
> OK, so the Halts2 function does not meet the challenge. I am mystified
> why you keep posting code you apparently know does not meet the
> specification. Do you want to have another go?
>
I am just going to complete the halt decider so that it can be executed
in <global>, (the default) <local> and <none> mode and the important
people that will review my work for publication will be able to
understand it on the basis of the completed work.
The reviewers here did very effectively point out the importance of the
local mode. We can't really create the original conditions of the
standard proofs without a local mode.
Local mode currently has this template:
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;
}
To the best of my ability it does seem that the above is a function from
the finite strings specified by the integer addresses to the
corresponding Boolean halting status with some other intermediate
mathematical mappings inbetween.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-12-20 16:43 -0800 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <rror39$1ilm$2@gioia.aioe.org> |
| In reply to | #2346 |
On 12/20/2020 4:41 PM, olcott wrote:
> On 12/20/2020 6:18 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 12/19/2020 7:34 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 12/18/2020 6:13 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 12/17/2020 8:35 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 12/16/2020 6:25 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 12/15/2020 7:11 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 12/15/2020 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 12/13/2020 7:14 AM, Ben Bacarisse wrote:
>>>>>> Code for contex:
>>>>>>
>>>>>> bool Halts(u32 P, u32 I)
>>>>>> {
>>>>>> bool Halted = false;
>>>>>> bool Aborted = false;
>>>>>> while (!Halted && !Aborted)
>>>>>> {
>>>>>> Halted = DebugStep(P, I);
>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>> }
>>>>>> return !Aborted;
>>>>>>
>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>> The infinitely recursive invocation of Halts() by
>>>>>>>>>>>>>>> Confound_Halts()
>>>>>>>>>>>>>>> never returns anything to Confound_Halts()
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> OK that's excellently clear.
>>>>>>>>>>
>>>>>>>>>> You are perfectly clear. Halts fails to meet the conditions
>>>>>>>>>> set out in
>>>>>>>>>> the challenge by not returning a value:
>>>>>>>>>>
>>>>>>>>>> Show a function F such that F(P, I) is true if, and only
>>>>>>>>>> if, P(I) is a
>>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>>
>>>>>>>>>> Not returning a value, even if only in some contexts, makes it
>>>>>>>>>> a fail.
>>>>>> <cut>
>>>>>>>
>>>>>>> I just proved how it does perrectly meet its conditions.
>>>>>>
>>>>>> Don't be silly. The specification:
>>>>>>
>>>>>> Show a function F such that F(P, I) is true if, and only if,
>>>>>> P(I) is a
>>>>>> finite computation and false otherwise.
>>>>>>
>>>>>> requires that the function return a value, regardless of context.
>>>>>
>>>>> This definition of a Halt decider seems to address your objections.
>>>>
>>>> But do you claim it meets the specification? Since you posted a
>>>> function before that clearly does not, you might just be trying to
>>>> waste
>>>> my time again.
>>>>
>>>>> It turns out that in this case the innermost Halts() is the one that
>>>>> makes the halt decision thus could return this same decision to its
>>>>> outer invocations.
>>>>>
>>>>> This seems to also address the objections of Kaz and Malcolm in that
>>>>> it is a pure function of its inputs and does not require any global
>>>>> data.
>>>>
>>>> I don't care if it is pure function or not, nor do I care about global
>>>> or static data. The specification only requires that its return value
>>>> be correct. That's what enables us to reason about each and every call
>>>> to the function.
>>>>
>>>>> bool Halts(u32 P, u32 I)
>>>>
>>>> I am going to rename it Halts2. This continual reusing of the same
>>>> name
>>>> for different functions is just bad engineering and sows confusion.
>>>>
>>>>> {
>>>>> 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;
>>>>> }
>>>>
>>>> Because this function is incomplete (it references code I can't see),
>>>> you will have to tell me what it returns. In
>>>>
>>>> bool Halts2(u32 P, u32 I) { ... as above ... }
>>>>
>>>> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>>>>
>>>> int main(void) { Confound_Halts2(Confound_Halts2); }
>>>>
>>>> the first thing that happens in Confound_Halts2 is a call to Halts2 in
>>>> the 'if'. What does this function call return? And in
>>>>
>>>> bool Halts2(u32 P, u32 I) { ... as above ... }
>>>>
>>>> void Confound_Halts2(u32 P) { if (Halts2(P, P)) while (1); }
>>>>
>>>> int main(void) {
>>>> return Halts2(Confound_Halts2, Confound_Halts2) ? EXIT_SUCCESS
>>>> : EXIT_FAILURE;
>>>> }
>>>>
>>>> what does the call to Halts2 in main return?
>>>
>>> In global halt deciding mode they both return false to the operating
>>> system treating infinite executiom as a fatal error.
>>>
>>> In none halt deciding mode they both execute infinitely.
>>
>> OK, so the Halts2 function does not meet the challenge. I am mystified
>> why you keep posting code you apparently know does not meet the
>> specification. Do you want to have another go?
>>
>
> I am just going to complete the halt decider so that it can be executed
> in <global>, (the default) <local> and <none> mode and the important
> people that will review my work for publication will be able to
> understand it on the basis of the completed work.
>
> The reviewers here did very effectively point out the importance of the
> local mode. We can't really create the original conditions of the
> standard proofs without a local mode.
>
> Local mode currently has this template:
>
> 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;
> }
>
>
> To the best of my ability it does seem that the above is a function from
> the finite strings specified by the integer addresses to the
> corresponding Boolean halting status with some other intermediate
> mathematical mappings inbetween.
>
BARF!
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-20 20:37 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <SNCdnT0RKPXzl33CnZ2dnUU7-bnNnZ2d@giganews.com> |
| In reply to | #2346 |
On 12/20/2020 8:22 PM, Richard Damon wrote: > On 12/20/20 7:41 PM, olcott wrote: >> >> I am just going to complete the halt decider so that it can be executed >> in <global>, (the default) <local> and <none> mode and the important >> people that will review my work for publication will be able to >> understand it on the basis of the completed work. > > Are you going to fix the fact that, at least based on your current > description, your halt decider currently is going to indicate several > programs that are clearly finite and halting as being infinitely recursive? > With the contrast of these three modes and the ability to see the full execution trace of every step of the actual halt deciding process people will be able to see that is not the case. People cannot simply imagine that it must be making some mistake somewhere when they can directly see every detail of all the steps. -- 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-20 21:55 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <E8ydnU4y8N8ggX3CnZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #2348 |
On 12/20/2020 9:22 PM, Richard Damon wrote: > On 12/20/20 9:37 PM, olcott wrote: >> On 12/20/2020 8:22 PM, Richard Damon wrote: >>> On 12/20/20 7:41 PM, olcott wrote: >>>> >>>> I am just going to complete the halt decider so that it can be executed >>>> in <global>, (the default) <local> and <none> mode and the important >>>> people that will review my work for publication will be able to >>>> understand it on the basis of the completed work. >>> >>> Are you going to fix the fact that, at least based on your current >>> description, your halt decider currently is going to indicate several >>> programs that are clearly finite and halting as being infinitely >>> recursive? >>> >> >> With the contrast of these three modes and the ability to see the full >> execution trace of every step of the actual halt deciding process people >> will be able to see that is not the case. >> >> People cannot simply imagine that it must be making some mistake >> somewhere when they can directly see every detail of all the steps. >> > > So, are you saying that you HAVE tested your program on the > non-infinitely recursive examples I have given and they do not get > falsely marked as infinitely recursive? > That is a numbskull thing to say. It is dead obvious that this aspect of the computation is correct to anyone that knows the x86 language. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2020-12-20 20:05 -0800 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <rrp6uh$12jc$1@gioia.aioe.org> |
| In reply to | #2349 |
On 12/20/2020 7:55 PM, olcott wrote: > On 12/20/2020 9:22 PM, Richard Damon wrote: >> On 12/20/20 9:37 PM, olcott wrote: >>> On 12/20/2020 8:22 PM, Richard Damon wrote: >>>> On 12/20/20 7:41 PM, olcott wrote: >>>>> >>>>> I am just going to complete the halt decider so that it can be >>>>> executed >>>>> in <global>, (the default) <local> and <none> mode and the important >>>>> people that will review my work for publication will be able to >>>>> understand it on the basis of the completed work. >>>> >>>> Are you going to fix the fact that, at least based on your current >>>> description, your halt decider currently is going to indicate several >>>> programs that are clearly finite and halting as being infinitely >>>> recursive? >>>> >>> >>> With the contrast of these three modes and the ability to see the full >>> execution trace of every step of the actual halt deciding process people >>> will be able to see that is not the case. >>> >>> People cannot simply imagine that it must be making some mistake >>> somewhere when they can directly see every detail of all the steps. >>> >> >> So, are you saying that you HAVE tested your program on the >> non-infinitely recursive examples I have given and they do not get >> falsely marked as infinitely recursive? >> > > That is a numbskull thing to say. It is dead obvious that this aspect of > the computation is correct to anyone that knows the x86 language. > > WOW!
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-21 04:44 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201220203519.831@kylheku.com> |
| In reply to | #2348 |
["Followup-To:" header set to comp.theory.] On 2020-12-21, olcott <NoOne@NoWhere.com> wrote: > On 12/20/2020 8:22 PM, Richard Damon wrote: >> On 12/20/20 7:41 PM, olcott wrote: >>> >>> I am just going to complete the halt decider so that it can be executed >>> in <global>, (the default) <local> and <none> mode and the important >>> people that will review my work for publication will be able to >>> understand it on the basis of the completed work. >> >> Are you going to fix the fact that, at least based on your current >> description, your halt decider currently is going to indicate several >> programs that are clearly finite and halting as being infinitely recursive? >> > > With the contrast of these three modes and the ability to see the full > execution trace of every step of the actual halt deciding process people > will be able to see that is not the case. Whether or not H_Hat(H_Hat) halts is easily decidable. Everyone knows this. Therefore it is not impressive or relevant to show some execution trace which decides it. The only issue is that this is not decidable by the Halts function call Halts(H_Hat, H_Hat). You have to show that Halts is deciding it, and that both H_Hat and Halts are functions of their arguments, with no suspicious information leakage going on. Without that, the execution trace is not credible. Not that it's wrong in and of itself, but rather, there is no confidence that it's the execution trace from a pure function Halts, embedded in a pure H_Hat. The world has an evidently air-tight proof that Halts cannot decide. The claim that this is wrong is extremely extraordinary, and requires extraordinary rigorous justification, not some hand-waving around some execution traces from some machine that makes suspicious interventions in programs. How about: put a real Intel x86 CPU in single step mode, and log traces from that? -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-20 23:06 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <3ICdnVOPOrvQsH3CnZ2dnUU7-c3NnZ2d@giganews.com> |
| In reply to | #2351 |
On 12/20/2020 10:44 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-12-21, olcott <NoOne@NoWhere.com> wrote:
>> On 12/20/2020 8:22 PM, Richard Damon wrote:
>>> On 12/20/20 7:41 PM, olcott wrote:
>>>>
>>>> I am just going to complete the halt decider so that it can be executed
>>>> in <global>, (the default) <local> and <none> mode and the important
>>>> people that will review my work for publication will be able to
>>>> understand it on the basis of the completed work.
>>>
>>> Are you going to fix the fact that, at least based on your current
>>> description, your halt decider currently is going to indicate several
>>> programs that are clearly finite and halting as being infinitely recursive?
>>>
>>
>> With the contrast of these three modes and the ability to see the full
>> execution trace of every step of the actual halt deciding process people
>> will be able to see that is not the case.
>
> Whether or not H_Hat(H_Hat) halts is easily decidable. Everyone knows
> this. Therefore it is not impressive or relevant to show some execution
> trace which decides it.
>
> The only issue is that this is not decidable by the Halts function
> call Halts(H_Hat, H_Hat).
>
> You have to show that Halts is deciding it, and that both H_Hat and
> Halts are functions of their arguments, with no suspicious information
> leakage going on.
>
This is the execution trace that I will be able to provide:
This function maps the finite strings at the integer
machine addresses (P, I) to a Boolean value indicating
the halting status of x86 program P on input I. It
achieves this mapping through intermediate mappings:
(a) The pair of finite strings corresponding to (P and I)
are mapped to a set of sequences of finite strings.
Each finite string of each sequence is a single machine
instruction. Each sequence is the full execution trace of
the input up to the execution of the current instruction.
(b) One of the elements of this set of sequences is
mapped to a Boolean value indicating the halting
status of P on input I.
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;
}
> Without that, the execution trace is not credible. Not that it's wrong
> in and of itself, but rather, there is no confidence that it's the
> execution trace from a pure function Halts, embedded in a pure H_Hat.
>
> The world has an evidently air-tight proof that Halts cannot decide.
> The claim that this is wrong is extremely extraordinary, and requires
> extraordinary rigorous justification, not some hand-waving around some
> execution traces from some machine that makes suspicious interventions
> in programs.
>
> How about: put a real Intel x86 CPU in single step mode, and log
> traces from that?
>
--
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:39 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <mN6dnWMAnpBFdn3CnZ2dnUU7-L3NnZ2d@giganews.com> |
| In reply to | #2352 |
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;
>> }
>
>
> EIP looks like a global variable, leaking information.
>
> You need something like:
>
> bool Halts(u32 P, u32 I)
> {
> x86Machine *m = Create_x86Machine(P, I);
>
> while (!m.Halted() && !m.Aborted())
> {
> m.DebugStep(); // maintains instructions sequence log, if needed
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.
> }
>
> return !m.Aborted;
> }
> --
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 19:31 +0000 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <20201221104731.554@kylheku.com> |
| In reply to | #2354 |
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.
The halting proofs require the functions to be TM's; they are modeling
TM's using function syntax.
--
TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-21 14:52 -0600 |
| Subject | Re: Refuting the {Linz, Sipser, Kozen} HP Proofs (objections addressed) |
| Message-ID | <WdCdnbtwxa2OlnzCnZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #2356 |
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?
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 15 of 21 — ← Prev page 1 … 13 14 [15] 16 17 … 21 Next page →
Back to top | Article view | comp.software-eng
csiph-web