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 9 of 21 — ← Prev page 1 … 7 8 [9] 10 11 … 21 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-15 17:18 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (Halts() as an exception handler) |
| Message-ID | <20201215090503.243@kylheku.com> |
| In reply to | #2278 |
["Followup-To:" header set to comp.theory.]
On 2020-12-15, olcott <NoOne@NoWhere.com> wrote:
> On 12/15/2020 3:36 AM, Kaz Kylheku wrote:
>> On 2020-12-15, olcott <NoOne@NoWhere.com> wrote:
>>> I have explained the difference between these two computations many times:
>>
>> That's nice; you're not responding to the content of any of my points.
>>
>>> int main()
>>> {
>>> Halts((u32)H_Hat, (u32)H_Hat);
>>> H_Hat((u32)H_Hat);
>>> }
>>
>> 1. Those are not the two I'm talking about, but since our particular
>> H_Hat((u32)H_Hat) immediately calls Halts((u32)H_Hat, (u32)H_Hat), how
>> can there be a legitimate difference between those two?
>>
>
> The calls to Halts() are out-of-sync with each other.
Can you site a reference for the definition of "sync" you are using?
What does it mean for calls to two pure functions to be "in sync", and
"out of sync", and how is is it possible under the definition of pure
function?
>> 2. I'm talking about both main() and H_Hat both making a call to
>> Halts((u32)H_Hat, (u32)H_Hat). One returns, producing a value which
>> indicates that the ... other one doesn't return? What?
>>
>> How can exactly the same procedure both return and not return, unless it
>> isn't a pure function, or else not a function of just those arguments
>> that are apparent in the higher level language?
>>
>
> Global Halts() can return to the caller or it can return to the
> operating system in the same way that the "divide by zero" exception
> handler can catch an exception in the program or be caught by the
> operating system.
>
> Whenever the infinite execution is first invoked by Halts() it can
> return a value that can be reported.
If an infinite execution occurs in Halts, it means Halts has failed to
decide. If this infinite execution is detected, and that is used as a
pretext to abort Halts such that it appears to terminate, it must not be
turned into a successful return value from Halts. The caller must know
that Halts failed to decide.
> This is like an exception handler
> catching a divide by zero error.
>
> Whenever the infinite execution is NOT first invoked by Halts() this is
> exactly the same as an uncaught divide by zero error and reported by the
> operating system.
OK, that is enough detail to pinpoint what is bogus in this apparatus.
You have a simulator which counts certain events which occur and then
chooses behaviors. I.e. there is a global state which drives behavior
changes.
Since this is not visible in the source code of H_Hat or Halts, you're
claiming you've refuted something.
> The closest that anyone has "proved that I am wrong" on my halt decider
> is proving that they either don't understand what I am saying or they
> don't understand the subject matter.
You clearly don't understand the subject matter, if you think you can
mess with the behavior of functions based on monitoring what they are
doing, counting certain events, and then reacting differently to a
certain pattern of execution based on the value of the counter.
--
TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-15 08:28 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <3dadnQwwG--9VUXCnZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #2273 |
On 12/15/2020 12:58 AM, André G. Isaak wrote: > On 2020-12-14 15:54, olcott wrote: >> On 12/14/2020 4:28 PM, André G. Isaak wrote: >>> On 2020-12-14 14:42, olcott wrote: >>>> On 12/14/2020 1:52 PM, André G. Isaak wrote: >>>>> On 2020-12-14 11:50, olcott wrote: >>>>>> On 12/14/2020 9:31 AM, André G. Isaak wrote: >>>>>>> On 2020-12-14 08:16, olcott wrote: >>>>> >>>>>>>> Halts(H_Hat, H_Hat) is only a finite computation because it >>>>>>>> aborts the otherwise infinite recursion of its input according >>>>>>>> to this criteria: >>>>>>> >>>>>>> And the Halts(H_Hat, H_Hat) called from within H_Hat should be a >>>>>>> finite computation for the exact same reason. It has the exact >>>>>>> same ability to abort its input as your outermost call to Halts() >>>>>>> has. >>>>>>> >>>>>>> If you were to run H_Hat(H_Hat) as an independent program, then >>>>>>> it's call to Halts(H_Hat, H_Hat) would behave in exactly the same >>>>>>> way as the call to Halts(H_Hat, H_Hat) described above. >>>>>> >>>>>> In my halt deciding solution it is impossible to run anything as >>>>>> an independent program, everything is simulated so that nothing >>>>>> can be done behind the back of the halt decider. >>>>> >>>>> Sort of like writing a program that predicts asteroid orbits but >>>>> only allowing its predictions to be tested against your asteroid >>>>> simulator so that reality can't do things behind the back of your >>>>> predictor... >>>>> >>>>> Yeah, that makes sense. >>>>> >>>>> André >>>>> >>>>> >>>> >>>> No it is more like writing an asteroid predictor from God's point of >>>> view. >>> >>> I have no idea what it means for a halt decider (or asteroid >>> predictor) to be written from 'God's point of view'. >>> >>>> Because it is well known common knowledge that the simulation of the >>>> Turing machine description of a Turing machine by a UTM is >>>> computationally equivalent to directly executing this TM >>> >>> If simulating a TM in a UTM is computationally equivalent to directly >>> executing a TM, then why insist on not allowing that direct execution? >>> >> >> The halt decider is inherently a simulator any code that it does not >> simulate is code that it cannot examine. > > When we're testing the behaviour of the input as an independent > computation, we're not *running* the halt decider. It isn't expected to > examine anything in such cases. > > André > I can't understand what you are saying. It seems like you are saying the a halt decider is not a halt decider, a thing is not itself. This is the halt deciding principle: On 11/27/2020 9:02 PM, Ben Bacarisse wrote: > A computation that would not halt if its simulation were not > halted is indeed a non-halting computation. On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: > Every computation that would not halt if its simulation > were not halted is by logical necessity a non-halting computation. -- 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-15 09:21 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <X5ydnW03xcIZSUXCnZ2dnUU7-KXNnZ2d@giganews.com> |
| In reply to | #2277 |
On 12/15/2020 9:10 AM, André G. Isaak wrote: > On 2020-12-15 07:28, olcott wrote: >> On 12/15/2020 12:58 AM, André G. Isaak wrote: >>> On 2020-12-14 15:54, olcott wrote: >>>> On 12/14/2020 4:28 PM, André G. Isaak wrote: >>>>> On 2020-12-14 14:42, olcott wrote: >>>>>> On 12/14/2020 1:52 PM, André G. Isaak wrote: >>>>>>> On 2020-12-14 11:50, olcott wrote: >>>>>>>> On 12/14/2020 9:31 AM, André G. Isaak wrote: >>>>>>>>> On 2020-12-14 08:16, olcott wrote: >>>>>>> >>>>>>>>>> Halts(H_Hat, H_Hat) is only a finite computation because it >>>>>>>>>> aborts the otherwise infinite recursion of its input according >>>>>>>>>> to this criteria: >>>>>>>>> >>>>>>>>> And the Halts(H_Hat, H_Hat) called from within H_Hat should be >>>>>>>>> a finite computation for the exact same reason. It has the >>>>>>>>> exact same ability to abort its input as your outermost call to >>>>>>>>> Halts() has. >>>>>>>>> >>>>>>>>> If you were to run H_Hat(H_Hat) as an independent program, then >>>>>>>>> it's call to Halts(H_Hat, H_Hat) would behave in exactly the >>>>>>>>> same way as the call to Halts(H_Hat, H_Hat) described above. >>>>>>>> >>>>>>>> In my halt deciding solution it is impossible to run anything as >>>>>>>> an independent program, everything is simulated so that nothing >>>>>>>> can be done behind the back of the halt decider. >>>>>>> >>>>>>> Sort of like writing a program that predicts asteroid orbits but >>>>>>> only allowing its predictions to be tested against your asteroid >>>>>>> simulator so that reality can't do things behind the back of your >>>>>>> predictor... >>>>>>> >>>>>>> Yeah, that makes sense. >>>>>>> >>>>>>> André >>>>>>> >>>>>>> >>>>>> >>>>>> No it is more like writing an asteroid predictor from God's point >>>>>> of view. >>>>> >>>>> I have no idea what it means for a halt decider (or asteroid >>>>> predictor) to be written from 'God's point of view'. >>>>> >>>>>> Because it is well known common knowledge that the simulation of >>>>>> the Turing machine description of a Turing machine by a UTM is >>>>>> computationally equivalent to directly executing this TM >>>>> >>>>> If simulating a TM in a UTM is computationally equivalent to >>>>> directly executing a TM, then why insist on not allowing that >>>>> direct execution? >>>>> >>>> >>>> The halt decider is inherently a simulator any code that it does not >>>> simulate is code that it cannot examine. >>> >>> When we're testing the behaviour of the input as an independent >>> computation, we're not *running* the halt decider. It isn't expected >>> to examine anything in such cases. >>> >>> André >>> >> >> I can't understand what you are saying. It seems like you are saying >> the a halt decider is not a halt decider, a thing is not itself. > > Above, I stated that the the behaviour of a program X *when run > independently* is the metric against which the claims of the halt > decider are to be evaluated. Ah so you prove that you are ignorant of the common knowledge that the simulation of the Turing machine description of a TM by a UTM is equivalent to the direct execution of this TM. Furthermore a UTM that examines the behavior of the machine that it is simulating is still a UTM. We might as well stop here until you understand these two key points because they are necessary prerequisites. -- 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-15 10:28 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <Mr2dnf4B2sjVeUXCnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #2279 |
On 12/15/2020 9:54 AM, André G. Isaak wrote: > On 2020-12-15 08:21, olcott wrote: >> On 12/15/2020 9:10 AM, André G. Isaak wrote: >>> On 2020-12-15 07:28, olcott wrote: >>>> On 12/15/2020 12:58 AM, André G. Isaak wrote: >>>>> On 2020-12-14 15:54, olcott wrote: >>>>>> On 12/14/2020 4:28 PM, André G. Isaak wrote: >>>>>>> On 2020-12-14 14:42, olcott wrote: >>>>>>>> On 12/14/2020 1:52 PM, André G. Isaak wrote: >>>>>>>>> On 2020-12-14 11:50, olcott wrote: >>>>>>>>>> On 12/14/2020 9:31 AM, André G. Isaak wrote: >>>>>>>>>>> On 2020-12-14 08:16, olcott wrote: >>>>>>>>> >>>>>>>>>>>> Halts(H_Hat, H_Hat) is only a finite computation because it >>>>>>>>>>>> aborts the otherwise infinite recursion of its input >>>>>>>>>>>> according to this criteria: >>>>>>>>>>> >>>>>>>>>>> And the Halts(H_Hat, H_Hat) called from within H_Hat should >>>>>>>>>>> be a finite computation for the exact same reason. It has the >>>>>>>>>>> exact same ability to abort its input as your outermost call >>>>>>>>>>> to Halts() has. >>>>>>>>>>> >>>>>>>>>>> If you were to run H_Hat(H_Hat) as an independent program, >>>>>>>>>>> then it's call to Halts(H_Hat, H_Hat) would behave in exactly >>>>>>>>>>> the same way as the call to Halts(H_Hat, H_Hat) described above. >>>>>>>>>> >>>>>>>>>> In my halt deciding solution it is impossible to run anything >>>>>>>>>> as an independent program, everything is simulated so that >>>>>>>>>> nothing can be done behind the back of the halt decider. >>>>>>>>> >>>>>>>>> Sort of like writing a program that predicts asteroid orbits >>>>>>>>> but only allowing its predictions to be tested against your >>>>>>>>> asteroid simulator so that reality can't do things behind the >>>>>>>>> back of your predictor... >>>>>>>>> >>>>>>>>> Yeah, that makes sense. >>>>>>>>> >>>>>>>>> André >>>>>>>>> >>>>>>>>> >>>>>>>> >>>>>>>> No it is more like writing an asteroid predictor from God's >>>>>>>> point of view. >>>>>>> >>>>>>> I have no idea what it means for a halt decider (or asteroid >>>>>>> predictor) to be written from 'God's point of view'. >>>>>>> >>>>>>>> Because it is well known common knowledge that the simulation of >>>>>>>> the Turing machine description of a Turing machine by a UTM is >>>>>>>> computationally equivalent to directly executing this TM >>>>>>> >>>>>>> If simulating a TM in a UTM is computationally equivalent to >>>>>>> directly executing a TM, then why insist on not allowing that >>>>>>> direct execution? >>>>>>> >>>>>> >>>>>> The halt decider is inherently a simulator any code that it does >>>>>> not simulate is code that it cannot examine. >>>>> >>>>> When we're testing the behaviour of the input as an independent >>>>> computation, we're not *running* the halt decider. It isn't >>>>> expected to examine anything in such cases. >>>>> >>>>> André >>>>> >>>> >>>> I can't understand what you are saying. It seems like you are saying >>>> the a halt decider is not a halt decider, a thing is not itself. >>> >>> Above, I stated that the the behaviour of a program X *when run >>> independently* is the metric against which the claims of the halt >>> decider are to be evaluated. >> >> Ah so you prove that you are ignorant of the common knowledge that the >> simulation of the Turing machine description of a TM by a UTM is >> equivalent to the direct execution of this TM. > > You keep repeating this, but are failing to grasp the point: to be > blunt, I DON'T TRUST your simulator. I don't give a rats ass. (AKA this is moot). You don't even have to trust it. You can determine that it would be correct even without seeing its code. Knowing that it decides correctly requires: (a) An elementary understanding of software engineering, such things as infinitely recursive invocations never return values to their caller. (b) An elementary understanding of how the C programming language maps to x86 control flow instructions. (c) An understanding of very elementary infinite recursion detection algorithms: whenever an execution trace shows a second call to the same function from the same machine address with no control flow instructions in-between THIS <IS> INFINITE RECURSION. > Yes, if a simulator is a perfect > simulator, then running the program in the simulator and running it > directly will have the same results. But, running it directly eliminates > any possibility that the observed behaviour is the result of bugs in the > simulator. Yes and running it directly is exactly the same as requiring the umpire of a baseball game to make sure that he keeps his eyes closed while calling every play. Do you have the wit of a nit? > There is ABSOLUTELY no reason to insist that it be run inside a > simulator if they really have the same results. By *insisting* that it > be simulated, you are only reinforcing my view that your simulator is > not trustworthy. > >> Furthermore a UTM that examines the behavior of the machine that it is >> simulating is still a UTM. We might as well stop here until you >> understand these two key points because they are necessary prerequisites. > > The above is entirely irrelevant to anything that I actually said. > > André > -- 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-15 17:38 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <20201215091909.850@kylheku.com> |
| In reply to | #2281 |
["Followup-To:" header set to comp.theory.]
On 2020-12-15, olcott <NoOne@NoWhere.com> wrote:
> On 12/15/2020 9:54 AM, André G. Isaak wrote:
>> On 2020-12-15 08:21, olcott wrote:
>>> On 12/15/2020 9:10 AM, André G. Isaak wrote:
>>>> On 2020-12-15 07:28, olcott wrote:
>>>>> On 12/15/2020 12:58 AM, André G. Isaak wrote:
>>>>>> On 2020-12-14 15:54, olcott wrote:
>>>>>>> On 12/14/2020 4:28 PM, André G. Isaak wrote:
>>>>>>>> On 2020-12-14 14:42, olcott wrote:
>>>>>>>>> On 12/14/2020 1:52 PM, André G. Isaak wrote:
>>>>>>>>>> On 2020-12-14 11:50, olcott wrote:
>>>>>>>>>>> On 12/14/2020 9:31 AM, André G. Isaak wrote:
>>>>>>>>>>>> On 2020-12-14 08:16, olcott wrote:
>>>>>>>>>>
>>>>>>>>>>>>> Halts(H_Hat, H_Hat) is only a finite computation because it
>>>>>>>>>>>>> aborts the otherwise infinite recursion of its input
>>>>>>>>>>>>> according to this criteria:
>>>>>>>>>>>>
>>>>>>>>>>>> And the Halts(H_Hat, H_Hat) called from within H_Hat should
>>>>>>>>>>>> be a finite computation for the exact same reason. It has the
>>>>>>>>>>>> exact same ability to abort its input as your outermost call
>>>>>>>>>>>> to Halts() has.
>>>>>>>>>>>>
>>>>>>>>>>>> If you were to run H_Hat(H_Hat) as an independent program,
>>>>>>>>>>>> then it's call to Halts(H_Hat, H_Hat) would behave in exactly
>>>>>>>>>>>> the same way as the call to Halts(H_Hat, H_Hat) described above.
>>>>>>>>>>>
>>>>>>>>>>> In my halt deciding solution it is impossible to run anything
>>>>>>>>>>> as an independent program, everything is simulated so that
>>>>>>>>>>> nothing can be done behind the back of the halt decider.
>>>>>>>>>>
>>>>>>>>>> Sort of like writing a program that predicts asteroid orbits
>>>>>>>>>> but only allowing its predictions to be tested against your
>>>>>>>>>> asteroid simulator so that reality can't do things behind the
>>>>>>>>>> back of your predictor...
>>>>>>>>>>
>>>>>>>>>> Yeah, that makes sense.
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> No it is more like writing an asteroid predictor from God's
>>>>>>>>> point of view.
>>>>>>>>
>>>>>>>> I have no idea what it means for a halt decider (or asteroid
>>>>>>>> predictor) to be written from 'God's point of view'.
>>>>>>>>
>>>>>>>>> Because it is well known common knowledge that the simulation of
>>>>>>>>> the Turing machine description of a Turing machine by a UTM is
>>>>>>>>> computationally equivalent to directly executing this TM
>>>>>>>>
>>>>>>>> If simulating a TM in a UTM is computationally equivalent to
>>>>>>>> directly executing a TM, then why insist on not allowing that
>>>>>>>> direct execution?
>>>>>>>>
>>>>>>>
>>>>>>> The halt decider is inherently a simulator any code that it does
>>>>>>> not simulate is code that it cannot examine.
>>>>>>
>>>>>> When we're testing the behaviour of the input as an independent
>>>>>> computation, we're not *running* the halt decider. It isn't
>>>>>> expected to examine anything in such cases.
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> I can't understand what you are saying. It seems like you are saying
>>>>> the a halt decider is not a halt decider, a thing is not itself.
>>>>
>>>> Above, I stated that the the behaviour of a program X *when run
>>>> independently* is the metric against which the claims of the halt
>>>> decider are to be evaluated.
>>>
>>> Ah so you prove that you are ignorant of the common knowledge that the
>>> simulation of the Turing machine description of a TM by a UTM is
>>> equivalent to the direct execution of this TM.
>>
>> You keep repeating this, but are failing to grasp the point: to be
>> blunt, I DON'T TRUST your simulator.
>
> I don't give a rats ass. (AKA this is moot). You don't even have to
> trust it. You can determine that it would be correct even without seeing
> its code.
The simulator may be fine. It's obvious you have used it to perpetrate
hacks from which you are drawing invalid conclusions.
You believe that a simulator can interfere with the behavior of a
function, such that different executions of it with the same arguments
provokes a different reaction of the simulator, based on global state
information retained in that simulator.
I have a new fakehalts2.c which does something I believe to be very
similar to your descriptions. Because my program is honestly coded,
there is no need to conceal anything inside a simulator; the fraud
is laid bare in the C source code:
$ ./fakehalt2
Got here so H_Hat(H_Hat) halted!
H_Hat(H_Hat) doesn't halt!
Source:
#include <stdio.h>
#include <setjmp.h>
#include <stdlib.h>
typedef void (*fun_t)(void *data);
typedef int (*decider_t)(fun_t, void *data);
int Halts(fun_t, void *);
void H_Hat(void *data)
{
if (Halts((fun_t) data, data)) {
for (;;)
fflush(stdout);
} else {
return;
}
}
int Halts(fun_t fun, void *data)
{
static int counter = 0;
static jmp_buf jbuf;
if (counter++ == 0) {
if (setjmp(jbuf)) {
return 0; // Caught exception in fun(data)
} else {
fun(data); // Just invoke the function on the input
return 1;
}
}
// Reset everything for next time.
counter = 0;
// Infinite execution is occurring: throw exception!
longjmp(jbuf, 1);
}
int main(void)
{
H_Hat((void *) H_Hat);
puts("Got here so H_Hat(H_Hat) halted!");
if (Halts(H_Hat, (void *) H_Hat))
puts("H_Hat(H_Hat) halts!");
else
puts("H_Hat(H_Hat) doesn't halt!");
return 0;
}
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-15 12:13 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <8eCdnUauuNBMYUXCnZ2dnUU7-Q_NnZ2d@giganews.com> |
| In reply to | #2281 |
On 12/15/2020 11:38 AM, Alan Mackenzie wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 12/15/2020 9:54 AM, André G. Isaak wrote: >>> On 2020-12-15 08:21, olcott wrote: > > [ .... ] > >>>> Ah so you prove that you are ignorant of the common knowledge that >>>> the simulation of the Turing machine description of a TM by a UTM is >>>> equivalent to the direct execution of this TM. > >>> You keep repeating this, but are failing to grasp the point: to be >>> blunt, I DON'T TRUST your simulator. > > Neither do I, neither would anybody sensible. > >> I don't give a rats ass. (AKA this is moot). You don't even have to >> trust it. You can determine that it would be correct even without >> seeing its code. > >> Knowing that it decides correctly requires: >> (a) An elementary understanding of software engineering, such things as >> infinitely recursive invocations never return values to their caller. > > If you had an elementary grasp of software engineering, you would know > that all software needs testing. That includes your simulator. What > needs testing is that it works, i.e. that its simulated results match the > real results. My x86utm operating system entirely based on a world class x86 emulator that has been around for decades. All the x86 emulation is performed by this emulator. The code emulated by this emulator is the COFF object file output generated by the Microsoft C compiler. All that I do to this COFF data is patch the relocation references to locations in the COFF object file. -- 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-17 08:24 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <LdidnefKqMCO90bCnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #2284 |
On 12/17/2020 7:15 AM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 12/16/2020 6:28 AM, Alan Mackenzie wrote: >>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>> On 12/15/2020 11:38 AM, Alan Mackenzie wrote: >>>>> In comp.theory olcott <NoOne@nowhere.com> wrote: >>>>>> On 12/15/2020 9:54 AM, André G. Isaak wrote: >>>>>>> On 2020-12-15 08:21, olcott wrote: > >>>>> [ .... ] > >>>>>>>> Ah so you prove that you are ignorant of the common knowledge >>>>>>>> that the simulation of the Turing machine description of a TM by >>>>>>>> a UTM is equivalent to the direct execution of this TM. > >>>>>>> You keep repeating this, but are failing to grasp the point: to be >>>>>>> blunt, I DON'T TRUST your simulator. > >>>>> Neither do I, neither would anybody sensible. > >>>>>> I don't give a rats ass. (AKA this is moot). You don't even have to >>>>>> trust it. You can determine that it would be correct even without >>>>>> seeing its code. > >>>>>> Knowing that it decides correctly requires: >>>>>> (a) An elementary understanding of software engineering, such >>>>>> things as infinitely recursive invocations never return values to >>>>>> their caller. > >>>>> If you had an elementary grasp of software engineering, you would >>>>> know that all software needs testing. That includes your simulator. >>>>> What needs testing is that it works, i.e. that its simulated results >>>>> match the real results. > >>>> My x86utm operating system entirely based on a world class x86 >>>> emulator that has been around for decades. All the x86 emulation is >>>> performed by this emulator. > >>>> The code emulated by this emulator is the COFF object file output >>>> generated by the Microsoft C compiler. All that I do to this COFF >>>> data is patch the relocation references to locations in the COFF >>>> object file. > >>> You are incorporating that software into a new program. You seem >>> resistant to actually testing that program, which could contain all >>> sorts of bugs not in the emulator it is based on. > >> The thing is that the halt decision measure against this criteria and >> the execution trace that I have provided is ridiculously obviously >> correct. > > I can't parse that "sentence". The first clause lacking a verb, and uses > ridiculously abstract words which disguise the actual meaning, if any. > > Dumping internal debugging data is hardly evidence of being "ridiculously > obviously correct". > The halt decider bases its halting decision on the x86utm machine description language that <is> the x86 language. The Microsoft C compiler hands you a fully populated directed graph of all of the control flow of an entire C program when its code is generated as x86 code. When we have such a directed graph we can look for cycles in this graph that indicate infinite execution. We can't do that at the C level. > Your program is allegedly a simulator. Does it actually simulate > accurately? There are decades of development in this open source world class x86 emulator. I can correctly excute the whole 80386 instruction set. > As a smoke test, you need to run a function in the simulator, > then run the same function free standing, and check that the two runs > give the same results. If you can't even do this, why should anybody > take your program seriously? > >> Every time that the same function is called from the same machine >> address a second time without any control flow instructions in-between >> is a case of infinite recursion. > > Somebody (was it Richard?) has pointed out that this condition is > not sufficient to entail infinite recursion. Richard does not comprehend the basic software engineering principle that infinitely recursive invocations never return values to their callers. This is a pretty dumb mistake. > Somebody else (Jeff, I > think) has pointed out that this condition isn't necessary either - there > are many different ways a program can fail to be halting. > >> -- >> Copyright 2020 Pete Olcott > It does not have to be necessary it only has to be sufficient. -- 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-17 09:16 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <eIadncbkAJTK60bCnZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #2303 |
On 12/17/2020 9:05 AM, André G. Isaak wrote: > On 2020-12-17 07:24, olcott wrote: >> On 12/17/2020 7:15 AM, Alan Mackenzie wrote: > >>> Your program is allegedly a simulator. Does it actually simulate >>> accurately? >> >> There are decades of development in this open source world class x86 >> emulator. I can correctly excute the whole 80386 instruction set. > > But you aren't using that. You are using a version which you have > modified to act as a 'halt' decider. Those modifications have not had > decades of "world class" development behind them. Alan's request that it > be tested is entirely reasonable. > > André > ALL of the emulation is done by the emulator. That the halt deciding decision is correct is cream pie smashed in the face dead obvious to anyone having the required prerequisite knowledge of the x86 language. People not having this required required prerequisite knowledge are foolish to disagree when the entire basis of this disagreement is their own ignorance. 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] Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6] Every time that the same function is called from the same machine address a second time without any control flow instructions in-between (within an execution trace) is a case of infinite recursion. This is shown at execution trace lines 14-22 above. -- 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-17 10:55 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <XbqdnXkPw9QJEEbCnZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #2304 |
On 12/17/2020 10:46 AM, André G. Isaak wrote: > On 2020-12-17 08:16, olcott wrote: >> On 12/17/2020 9:05 AM, André G. Isaak wrote: >>> On 2020-12-17 07:24, olcott wrote: >>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote: >>> >>>>> Your program is allegedly a simulator. Does it actually simulate >>>>> accurately? >>>> >>>> There are decades of development in this open source world class x86 >>>> emulator. I can correctly excute the whole 80386 instruction set. >>> >>> But you aren't using that. You are using a version which you have >>> modified to act as a 'halt' decider. Those modifications have not had >>> decades of "world class" development behind them. Alan's request that >>> it be tested is entirely reasonable. >>> >>> André >>> >> >> ALL of the emulation is done by the emulator. >> >> That the halt deciding decision is correct is cream pie smashed in the >> face dead obvious to anyone having the required prerequisite knowledge >> of the x86 language. >> >> People not having this required required prerequisite knowledge are >> foolish to disagree when the entire basis of this disagreement is >> their own ignorance. >> >> 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] >> Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6] >> >> Every time that the same function is called from the same machine >> address a second time without any control flow instructions in-between >> (within an execution trace) is a case of infinite recursion. >> This is shown at execution trace lines 14-22 above. > > > The problem is that what you describe in the paragraph above is (a) not > really what's going on in your trace and (b) won't work for Linz's H-Hat. > > (a) You don't show a complete trace above, but from your description you > have code which determines whether the same function is being addressed > a second time and aborts it if it is. That inevitably is going to > involve flow-control instructions. And these instructions are going to > be included as an integral part of the embedded Halts() so you can't > just ignore these. They're part of the computation which Halts() (and > therefore H_Hat()) performs. > DO I HAVE TO TELL YOU THIS 10,000 TIMES BEFORE YOU BOTHER TO NOTICE THAT I SAID IT ONCE? On 11/27/2020 9:02 PM, Ben Bacarisse wrote: > A computation that would not halt if its simulation were not > halted is indeed a non-halting computation. On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: > Every computation that would not halt if its simulation > were not halted is by logical necessity a non-halting computation. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2020-12-17 17:05 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <MdMCH.226155$O777.97658@fx18.ams4> |
| In reply to | #2310 |
On 17/12/2020 16:55, olcott wrote: > On 12/17/2020 10:46 AM, André G. Isaak wrote: >> On 2020-12-17 08:16, olcott wrote: >>> On 12/17/2020 9:05 AM, André G. Isaak wrote: >>>> On 2020-12-17 07:24, olcott wrote: >>>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote: >>>> >>>>>> Your program is allegedly a simulator. Does it actually simulate >>>>>> accurately? >>>>> >>>>> There are decades of development in this open source world class x86 emulator. I can correctly excute the whole 80386 instruction set. >>>> >>>> But you aren't using that. You are using a version which you have modified to act as a 'halt' decider. Those modifications have not had decades of "world class" development behind them. Alan's request that it be tested is entirely reasonable. >>>> >>>> André >>>> >>> >>> ALL of the emulation is done by the emulator. >>> >>> That the halt deciding decision is correct is cream pie smashed in the face dead obvious to anyone having the required prerequisite knowledge of the x86 language. >>> >>> People not having this required required prerequisite knowledge are foolish to disagree when the entire basis of this disagreement is their own ignorance. >>> >>> 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] >>> Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6] >>> >>> Every time that the same function is called from the same machine address a second time without any control flow instructions in-between (within an execution trace) is a case of infinite recursion. >>> This is shown at execution trace lines 14-22 above. >> >> >> The problem is that what you describe in the paragraph above is (a) not really what's going on in your trace and (b) won't work for Linz's H-Hat. >> >> (a) You don't show a complete trace above, but from your description you have code which determines whether the same function is being addressed a second time and aborts it if it is. That inevitably is going to involve flow-control instructions. And these instructions are going to be included as an integral part of the embedded Halts() so you can't just ignore these. They're part of the computation which Halts() (and therefore H_Hat()) performs. >> > > DO I HAVE TO TELL YOU THIS 10,000 TIMES BEFORE YOU BOTHER TO NOTICE THAT I SAID IT ONCE? > > On 11/27/2020 9:02 PM, Ben Bacarisse wrote: > > A computation that would not halt if its simulation were not > > halted is indeed a non-halting computation. > > On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: > > Every computation that would not halt if its simulation > > were not halted is by logical necessity a non-halting computation. Repeating something that is incorrect doesn't make it correct no matter how many times you repeat it. Take your meds and get a fucking hobby already. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-17 12:13 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <3e-dnS-fYa0jAkbCnZ2dnUU7-IXNnZ2d@giganews.com> |
| In reply to | #2310 |
On 12/17/2020 11:18 AM, André G. Isaak wrote: > On 2020-12-17 09:55, olcott wrote: >> On 12/17/2020 10:46 AM, André G. Isaak wrote: >>> On 2020-12-17 08:16, olcott wrote: >>>> On 12/17/2020 9:05 AM, André G. Isaak wrote: >>>>> On 2020-12-17 07:24, olcott wrote: >>>>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote: >>>>> >>>>>>> Your program is allegedly a simulator. Does it actually simulate >>>>>>> accurately? >>>>>> >>>>>> There are decades of development in this open source world class >>>>>> x86 emulator. I can correctly excute the whole 80386 instruction set. >>>>> >>>>> But you aren't using that. You are using a version which you have >>>>> modified to act as a 'halt' decider. Those modifications have not >>>>> had decades of "world class" development behind them. Alan's >>>>> request that it be tested is entirely reasonable. >>>>> >>>>> André >>>>> >>>> >>>> ALL of the emulation is done by the emulator. >>>> >>>> That the halt deciding decision is correct is cream pie smashed in >>>> the face dead obvious to anyone having the required prerequisite >>>> knowledge of the x86 language. >>>> >>>> People not having this required required prerequisite knowledge are >>>> foolish to disagree when the entire basis of this disagreement is >>>> their own ignorance. >>>> >>>> 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] >>>> Input Aborted because of INFINITE RECURSION from [000005f2] to >>>> [000003e6] >>>> >>>> Every time that the same function is called from the same machine >>>> address a second time without any control flow instructions >>>> in-between (within an execution trace) is a case of infinite recursion. >>>> This is shown at execution trace lines 14-22 above. >>> >>> >>> The problem is that what you describe in the paragraph above is (a) >>> not really what's going on in your trace and (b) won't work for >>> Linz's H-Hat. >>> >>> (a) You don't show a complete trace above, but from your description >>> you have code which determines whether the same function is being >>> addressed a second time and aborts it if it is. That inevitably is >>> going to involve flow-control instructions. And these instructions >>> are going to be included as an integral part of the embedded Halts() >>> so you can't just ignore these. They're part of the computation which >>> Halts() (and therefore H_Hat()) performs. >>> >> >> DO I HAVE TO TELL YOU THIS 10,000 TIMES BEFORE YOU BOTHER TO NOTICE >> THAT I SAID IT ONCE? > > It doesn't matter how many times you say it. It has nothing to do with > the point I make above. > > André The only reason that I can show that halting is decidable is because I changed the tense of the halt deciding question: Does the input halt on its input? is impossible to correctly answer. If the halt decider says yes then the correct answer is no. If the halt decider says no then the correct answer is yes. Would the input on its input have infinite execution if not aborted by its simulator? Can be correctly answered thus eliminating the basis of all the conventional proofs of undeciability. >> On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >> > A computation that would not halt if its simulation were not >> > halted is indeed a non-halting computation. >> >> On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: >> > Every computation that would not halt if its simulation >> > were not halted is by logical necessity a non-halting computation. > > -- 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-17 19:03 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <20201217105547.661@kylheku.com> |
| In reply to | #2313 |
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote: > Would the input on its input have infinite execution if not aborted by > its simulator? Can be correctly answered thus eliminating the basis of > all the conventional proofs of undeciability. No, because though the halting question can be answered for that test case as a whole, it cannot be answered by that specific function that is being tested inside the test case, namely Halts. You argue that it can, using a broken definition of "function" in which different calls to Halts are occurring with different inputs. "Inputs" refers to material beyond just the arguments (as it should be). This is because the execution substrate is a hacked version of x86 which injects control flow changes into code based on global state inside the emulator. Because that state is not visible inside the program, the source and object code still looks like it is functional, you're claiming that the apparatus is a correct implementation of the entities in the proof. This is not so. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-18 11:54 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <jtydnRuv-qlacUHCnZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #2313 |
On 12/18/2020 11:23 AM, André G. Isaak wrote: > On 2020-12-18 07:24, olcott wrote: >> On 12/18/2020 4:54 AM, André G. Isaak wrote: > >>> I'm just trying to get your to use your terminology correctly. >>> >>> You've declared your Halts() as >>> >>> bool Halts(u32 P, u32 I); >>> >>> Neither P nor I is an "execution trace" so you can't claim your Halt >>> detector is a function from execution traces. >>> >> >> P and I are the entire basis from which an execution trace is generated. > > That doesn't make Halts() a function from execution traces. As I said, > my purpose here is simply to try to encourage you to use terminology in > the same way that the rest of the universe does. > > André > > I have said this fifty times now, maybe this time you will notice? Halts <is> a simulator with inputs (u32 p, u32 I) that decides halting based on the execution trace that it simulates. -- 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-17 11:07 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <cd-dnYInC4qnDUbCnZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #2304 |
On 12/17/2020 10:46 AM, André G. Isaak wrote:
> On 2020-12-17 08:16, olcott wrote:
>> On 12/17/2020 9:05 AM, André G. Isaak wrote:
>>> On 2020-12-17 07:24, olcott wrote:
>>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote:
>>>
>>>>> Your program is allegedly a simulator. Does it actually simulate
>>>>> accurately?
>>>>
>>>> There are decades of development in this open source world class x86
>>>> emulator. I can correctly excute the whole 80386 instruction set.
>>>
>>> But you aren't using that. You are using a version which you have
>>> modified to act as a 'halt' decider. Those modifications have not had
>>> decades of "world class" development behind them. Alan's request that
>>> it be tested is entirely reasonable.
>>>
>>> André
>>>
>>
>> ALL of the emulation is done by the emulator.
>>
>> That the halt deciding decision is correct is cream pie smashed in the
>> face dead obvious to anyone having the required prerequisite knowledge
>> of the x86 language.
>>
>> People not having this required required prerequisite knowledge are
>> foolish to disagree when the entire basis of this disagreement is
>> their own ignorance.
>>
>> 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]
>> Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6]
>>
>> Every time that the same function is called from the same machine
>> address a second time without any control flow instructions in-between
>> (within an execution trace) is a case of infinite recursion.
>> This is shown at execution trace lines 14-22 above.
>
> (b) In the ACTUAL Linz proof, H_Hat is created by making a *copy* of H
> which is then modified. This means that H_Hat will include code which
> may be functionally equivalent to the code in H, but it will *not* be at
> the same address because it is a copy. Your 'infinite recursion
> detection' relies on the fact that your H_Hat is derived by calling
> Halts() rather than copying Halts(). But this won't work for an H_Hat
> which is actually derived from Halts() in the manner prescribed by Linz,
> and if you actually want to address Linz's proof, you need your H_Hat to
> be derived from your Halts() in the manner which Linz's proof employs.
>
> André
>
That is not consistent with the Sipser proof and I want to generalize
across all three: {Linz, Sipser, and Kozen}
Now we construct a new Turing machine D with H as a
subroutine. This new TM calls H to determine what M
does when the input to M is its own description (M).
Once D has determined this information, it does the
opposite. That is, it rejects if M accepts and accepts
if M does not accept.
http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
The key thing that my approach solves is that it utterly eliminates the
(key basis of all the proofs) the input doing the opposite of whatever
the halt decider decides.
--
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-17 12:21 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <dbOdnY9EDNswPEbCnZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #2312 |
On 12/17/2020 11:24 AM, André G. Isaak wrote:
> On 2020-12-17 10:07, olcott wrote:
>> On 12/17/2020 10:46 AM, André G. Isaak wrote:
>>> On 2020-12-17 08:16, olcott wrote:
>>>> On 12/17/2020 9:05 AM, André G. Isaak wrote:
>>>>> On 2020-12-17 07:24, olcott wrote:
>>>>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote:
>>>>>
>>>>>>> Your program is allegedly a simulator. Does it actually simulate
>>>>>>> accurately?
>>>>>>
>>>>>> There are decades of development in this open source world class
>>>>>> x86 emulator. I can correctly excute the whole 80386 instruction set.
>>>>>
>>>>> But you aren't using that. You are using a version which you have
>>>>> modified to act as a 'halt' decider. Those modifications have not
>>>>> had decades of "world class" development behind them. Alan's
>>>>> request that it be tested is entirely reasonable.
>>>>>
>>>>> André
>>>>>
>>>>
>>>> ALL of the emulation is done by the emulator.
>>>>
>>>> That the halt deciding decision is correct is cream pie smashed in
>>>> the face dead obvious to anyone having the required prerequisite
>>>> knowledge of the x86 language.
>>>>
>>>> People not having this required required prerequisite knowledge are
>>>> foolish to disagree when the entire basis of this disagreement is
>>>> their own ignorance.
>>>>
>>>> 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]
>>>> Input Aborted because of INFINITE RECURSION from [000005f2] to
>>>> [000003e6]
>>>>
>>>> Every time that the same function is called from the same machine
>>>> address a second time without any control flow instructions
>>>> in-between (within an execution trace) is a case of infinite recursion.
>>>> This is shown at execution trace lines 14-22 above.
>>>
>>> (b) In the ACTUAL Linz proof, H_Hat is created by making a *copy* of
>>> H which is then modified. This means that H_Hat will include code
>>> which may be functionally equivalent to the code in H, but it will
>>> *not* be at the same address because it is a copy. Your 'infinite
>>> recursion detection' relies on the fact that your H_Hat is derived by
>>> calling Halts() rather than copying Halts(). But this won't work for
>>> an H_Hat which is actually derived from Halts() in the manner
>>> prescribed by Linz, and if you actually want to address Linz's proof,
>>> you need your H_Hat to be derived from your Halts() in the manner
>>> which Linz's proof employs.
>>>
>>> André
>>>
>>
>> That is not consistent with the Sipser proof and I want to generalize
>> across all three: {Linz, Sipser, and Kozen}
>
>> Now we construct a new Turing machine D with H as a
>> subroutine. This new TM calls H to determine what M
>> does when the input to M is its own description (M).
>>
>> Once D has determined this information, it does the
>> opposite. That is, it rejects if M accepts and accepts
>> if M does not accept.
>
> First off, Turing Machines don't have subroutines in the sense that C
> programs do. When Sipser says 'subroutine' he simply means copy.
>
When a master UTM simlates a slave UTM that simulates another slave UTM
this is computationally equivalent to the invocation of subroutines with
no copying required. This is how x86utm works. In this case the virtual
machine description language is the x86 language.
> Second, even if that were not the case it still fails to address the
> point. Linz provides a method whereby *any* putative halt decider can be
> transformed into a program which cannot be correctly decided by that
> halt decider. It involves making a *copy* of H. And absolutely nothing
> stops someone from applying this method to your program and your program
> won't be able to deal with it. If we make a *copy* of your Halts() and
> use that as a basis for H_Hat, then calls to the copy of Halts() within
> H_Hat will not have the same address as your upper Halts() routine and
> your 'recursion detection' method will break down since there will be no
> actual recursion. There is absolutely no way around this.
>
> André
>
This only requires another infinite recursion detection method that is
more difficult to understand. The key thing is that my solution utterly
defeats the "do the opposite of whatever the halt decider decides" trick.
--
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-17 19:08 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <20201217110409.892@kylheku.com> |
| In reply to | #2314 |
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote: > more difficult to understand. The key thing is that my solution utterly > defeats the "do the opposite of whatever the halt decider decides" trick. Your solution defeats an altered, strawman version of the trick in which functions have their control flows altered by an emulator based on external state that it maintains. It's like saying that you have a solution for some chess problem. You see, the original proof is making a bad assumption: rook cannot move diagonally. That is where they are wrong. If you allow the rook to move diagonally, the problem is solved. The bad assumption that rooks can only move horizontally and vertically is the proof's problem, not yours. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-17 13:26 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (as easy as 1,2,3) |
| Message-ID | <r46dnVU7ZPVzLUbCnZ2dnUU7-cvNnZ2d@giganews.com> |
| In reply to | #2314 |
On 12/17/2020 1:12 PM, Alan Mackenzie wrote:
> In comp.theory olcott <NoOne@nowhere.com> wrote:
>> On 12/17/2020 11:24 AM, André G. Isaak wrote:
>
> [ .... ]
>
>>> Second, even if that were not the case it still fails to address the
>>> point. Linz provides a method whereby *any* putative halt decider can
>>> be transformed into a program which cannot be correctly decided by
>>> that halt decider. It involves making a *copy* of H. And absolutely
>>> nothing stops someone from applying this method to your program and
>>> your program won't be able to deal with it. If we make a *copy* of
>>> your Halts() and use that as a basis for H_Hat, then calls to the copy
>>> of Halts() within H_Hat will not have the same address as your upper
>>> Halts() routine and your 'recursion detection' method will break down
>>> since there will be no actual recursion. There is absolutely no way
>>> around this.
>
>>> André
>
>> This only requires another infinite recursion detection method that is
>> more difficult to understand. The key thing is that my solution utterly
>> defeats the "do the opposite of whatever the halt decider decides"
>> trick.
>
> It does not. The proofs you are trying to discredit are valid for any
> and all purported halt deciders. And I can say that without reference to
> your particular system or the hundreds of silly posts over the last few
> weeks.
>
> Your problem is that you don't understand maths, you don't understand
> what it means for something to be a theorem. A theorem isn't like a
> political point of view, something to be shouted down, or argued against,
> or suppressed by high intensity propaganda. A mathematical theorem is
> absolute truth, for all time.
>
> You railing against this theorem you don't like is just stupid. No
> subterfuges like aborting running programs, simulation, or whatever can
> make the slightest difference to the theoremhood of Alan Turing's
> theorem.
>
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]
Input Aborted because of INFINITE RECURSION from [000005f2] to [000003e6]
Every time that the same function is called from the same machine
address a second time without any control flow instructions in-between
(within an execution trace) is a case of infinite recursion. This is
shown at execution trace lines 14-22 above.
From the above is is obvious that you are not telling the truth. We can
leave it to the readers to decide whether this is intentional deception
or simply a lack of understanding of software engineering and/or 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.
As easy as 1,2,3 you are wrong and I am right.
>> --
>> Copyright 2020 Pete Olcott
>
>> "Great spirits have always encountered violent opposition from mediocre
>> minds." Einstein
>
--
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-17 20:20 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (as easy as 1,2,3) |
| Message-ID | <20201217121854.587@kylheku.com> |
| In reply to | #2318 |
On 2020-12-17, olcott <NoOne@NoWhere.com> wrote: > Every time that the same function is called from the same machine > address a second time without any control flow instructions in-between "Every time" and "second time" cannot appear in the same sentence. Every time I have been to Paris for the second time, it was just as vibrant ... > leave it to the readers to decide whether this is intentional deception There are pretty much no readers here that have not accused you of deception at some point. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2020-12-17 16:27 +0000 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <20201217082325.303@kylheku.com> |
| In reply to | #2303 |
["Followup-To:" header set to comp.theory.] On 2020-12-17, olcott <NoOne@NoWhere.com> wrote: > The Microsoft C compiler hands you a fully populated directed graph of > all of the control flow of an entire C program when its code is Then, after that Microsoft compiler is done, this Olcott joker comes along and adds invisible control flows and global state via a hacked emulator, which does things like terminate runaway recursion at three levels. Moreover, he calls that "x86", so as to create the appearance that it's an instruction set designed by Intel.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-17 18:35 -0600 |
| Subject | Re: Refuting the {Linz, Sipser and Kozen} HP Proofs (deciders within infinite recursion) |
| Message-ID | <HtKdnYLWJsj-ZEbCnZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #2303 |
On 12/17/2020 6:00 PM, Mike Terry wrote:
> On 17/12/2020 22:31, olcott wrote:
>> On 12/17/2020 4:11 PM, Mike Terry wrote:
>>> On 17/12/2020 21:42, olcott wrote:
>>>> On 12/17/2020 3:24 PM, Mike Terry wrote:
>>>>> On 17/12/2020 14:56, olcott wrote:
>>>>>> On 12/17/2020 8:36 AM, Malcolm McLean wrote:
>>>>>>> On Thursday, 17 December 2020 at 14:24:26 UTC, olcott wrote:
>>>>>>>> On 12/17/2020 7:15 AM, Alan Mackenzie wrote:
>>>>>>>>> olcott <No...@nowhere.com> wrote:
>>>>>>>>>> On 12/16/2020 6:28 AM, Alan Mackenzie wrote:
>>>>>>>>>>> In comp.theory olcott <No...@nowhere.com> wrote:
>>>>>>>>>>>> On 12/15/2020 11:38 AM, Alan Mackenzie wrote:
>>>>>>>>>>>>> In comp.theory olcott <No...@nowhere.com> wrote:
>>>>>>>>>>>>>> On 12/15/2020 9:54 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>> On 2020-12-15 08:21, olcott wrote:
>>>>>>>>>
>>>>>>>>>>>>> [ .... ]
>>>>>>>>>
>>>>>>>>>>>>>>>> Ah so you prove that you are ignorant of the common
>>>>>>>>>>>>>>>> knowledge
>>>>>>>>>>>>>>>> that the simulation of the Turing machine description of a
>>>>>>>>>>>>>>>> TM by
>>>>>>>>>>>>>>>> a UTM is equivalent to the direct execution of this TM.
>>>>>>>>>
>>>>>>>>>>>>>>> You keep repeating this, but are failing to grasp the point:
>>>>>>>>>>>>>>> to be
>>>>>>>>>>>>>>> blunt, I DON'T TRUST your simulator.
>>>>>>>>>
>>>>>>>>>>>>> Neither do I, neither would anybody sensible.
>>>>>>>>>
>>>>>>>>>>>>>> I don't give a rats ass. (AKA this is moot). You don't even
>>>>>>>>>>>>>> have to
>>>>>>>>>>>>>> trust it. You can determine that it would be correct even
>>>>>>>>>>>>>> without
>>>>>>>>>>>>>> seeing its code.
>>>>>>>>>
>>>>>>>>>>>>>> Knowing that it decides correctly requires:
>>>>>>>>>>>>>> (a) An elementary understanding of software engineering, such
>>>>>>>>>>>>>> things as infinitely recursive invocations never return
>>>>>>>>>>>>>> values to
>>>>>>>>>>>>>> their caller.
>>>>>>>>>
>>>>>>>>>>>>> If you had an elementary grasp of software engineering, you
>>>>>>>>>>>>> would
>>>>>>>>>>>>> know that all software needs testing. That includes your
>>>>>>>>>>>>> simulator.
>>>>>>>>>>>>> What needs testing is that it works, i.e. that its simulated
>>>>>>>>>>>>> results
>>>>>>>>>>>>> match the real results.
>>>>>>>>>
>>>>>>>>>>>> My x86utm operating system entirely based on a world class x86
>>>>>>>>>>>> emulator that has been around for decades. All the x86
>>>>>>>>>>>> emulation is
>>>>>>>>>>>> performed by this emulator.
>>>>>>>>>
>>>>>>>>>>>> The code emulated by this emulator is the COFF object file
>>>>>>>>>>>> output
>>>>>>>>>>>> generated by the Microsoft C compiler. All that I do to this
>>>>>>>>>>>> COFF
>>>>>>>>>>>> data is patch the relocation references to locations in the
>>>>>>>>>>>> COFF
>>>>>>>>>>>> object file.
>>>>>>>>>
>>>>>>>>>>> You are incorporating that software into a new program. You seem
>>>>>>>>>>> resistant to actually testing that program, which could
>>>>>>>>>>> contain all
>>>>>>>>>>> sorts of bugs not in the emulator it is based on.
>>>>>>>>>
>>>>>>>>>> The thing is that the halt decision measure against this criteria
>>>>>>>>>> and
>>>>>>>>>> the execution trace that I have provided is ridiculously
>>>>>>>>>> obviously
>>>>>>>>>> correct.
>>>>>>>>>
>>>>>>>>> I can't parse that "sentence". The first clause lacking a verb,
>>>>>>>>> and
>>>>>>>>> uses
>>>>>>>>> ridiculously abstract words which disguise the actual meaning, if
>>>>>>>>> any.
>>>>>>>>>
>>>>>>>>> Dumping internal debugging data is hardly evidence of being
>>>>>>>>> "ridiculously
>>>>>>>>> obviously correct".
>>>>>>>>>
>>>>>>>> The halt decider bases its halting decision on the x86utm machine
>>>>>>>> description language that <is> the x86 language.
>>>>>>>>
>>>>>>>> The Microsoft C compiler hands you a fully populated directed
>>>>>>>> graph of
>>>>>>>> all of the control flow of an entire C program when its code is
>>>>>>>> generated as x86 code. When we have such a directed graph we can
>>>>>>>> look
>>>>>>>> for cycles in this graph that indicate infinite execution. We
>>>>>>>> can't do
>>>>>>>> that at the C level.
>>>>>>>>> Your program is allegedly a simulator. Does it actually simulate
>>>>>>>>> accurately?
>>>>>>>> There are decades of development in this open source world class
>>>>>>>> x86
>>>>>>>> emulator. I can correctly excute the whole 80386 instruction set.
>>>>>>>>> As a smoke test, you need to run a function in the simulator,
>>>>>>>>> then run the same function free standing, and check that the two
>>>>>>>>> runs
>>>>>>>>> give the same results. If you can't even do this, why should
>>>>>>>>> anybody
>>>>>>>>> take your program seriously?
>>>>>>>>>
>>>>>>>>>> Every time that the same function is called from the same machine
>>>>>>>>>> address a second time without any control flow instructions
>>>>>>>>>> in-between
>>>>>>>>>> is a case of infinite recursion.
>>>>>>>>>
>>>>>>>>> Somebody (was it Richard?) has pointed out that this condition is
>>>>>>>>> not sufficient to entail infinite recursion.
>>>>>>>>
>>>>>>>> It does not have to be necessary it only has to be sufficient.
>>>>>>>>
>>>>>>> Someone gave an example of code in which function pointers were
>>>>>>> passed
>>>>>>> as parameters, and so you have two calls to the same address with no
>>>>>>> intervening branch instructions, but nevertheless the calculation
>>>>>>> halted.
>>>>>>>
>>>>>>
>>>>>> -Every time that the same function is called from the same machine
>>>>>> -address a second time without any control flow instructions
>>>>>> in-between
>>>>>> -is a case of infinite recursion.
>>>>>> WITHIN AN X86 LEVEL EXECUTION TRACE
>>>>>
>>>>> The trace entries concerned need to be ALL FROM THE SAME EMULATION
>>>>> NESTING LEVEL.
>>>>>
>>>>
>>>> So in other words a correct halt decider is impossible only because it
>>>> is forbidden.
>>>
>>> As usual, you demonstrate an intellectual inability to understand what
>>> other people are saying.
>>>
>>>>
>>>>> In your case, the two branch instructions concerned belong to
>>>>> completely different emulation levels!
>>>>>
>>>>> This means they are not actually part of any one single "x86 processor
>>>>> trace". (Different emulation levels equate to totally different
>>>>> virtual processes and virtual x86 processors.)
>>>>>
>>>>
>>>> UTM X1 simulates UTM X2 which simulates UTM X3 and UTM X1 can see every
>>>> instruction that is simulated by any of its slaves.
>>>>
>>>>> I'm still waiting for your proof that your infinite recursion test is
>>>>> sound when applied spanning multiple code emulation levels... (Hehe,
>>>>> not
>>>>
>>>> There are no categories of thought that could possibly make it unsound.
>>>> It is like trying to find an integer of the set of integers that could
>>>> break the glass of the window to your car: categorically impossible.
>>>
>>> LOL! Perfect example of your proof by "just make the claim again and
>>> keep repeating it". You're actually supporting what I said, viz that
>>> you're intellectually incapable of understanding even what such a
>>> proof would need to look like.
>>>
>>>
>>> Mike.
>>
>> My proof is already sound that you believe that it is possibly unsound
>> is merely your false opinion. The fact that you yourself cannot even
>> point to any hypothetical scenario making my proof unsound proves that
>> your asserted opinion is merely grasping at straws.
>
> But you have never proposed any proof - like I say, you haven't a clue
> what such a proof should look like.
>
>
> Mike.
>
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]
Input Aborted because of INFINITE RECURSION from [000005f2] to [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
Input_Would_Halt = 0
...[00000642](03) 83c408 add esp,+08
...[00000645](01) f4 hlt
Every time that the same function is called from the same machine
address a second time without any control flow instructions in-between
(within an execution trace) is a case of infinite recursion. This is
shown at execution trace lines 14-22 above.
(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.
The semantics specfied by the syntax formal x86 language proves (2) and
(3).
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 9 of 21 — ← Prev page 1 … 7 8 [9] 10 11 … 21 Next page →
Back to top | Article view | comp.software-eng
csiph-web