Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #40066 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-09-28 22:20 -0500 |
| Last post | 2021-10-01 16:40 -0400 |
| Articles | 20 on this page of 325 — 13 participants |
Back to article view | Back to comp.theory
Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-09-28 22:20 -0500
Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-28 22:47 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-09-29 06:28 -0400
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <news.x.richarddamon@xoxy.net> - 2021-09-29 07:52 -0400
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-29 23:48 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-29 18:19 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-09-29 20:20 -0400
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 02:36 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-29 20:39 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-09-29 21:50 -0400
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 02:57 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-29 21:11 -0500
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 03:42 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-29 21:52 -0500
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 17:35 +0100
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] olcott <NoOne@NoWhere.com> - 2021-09-30 12:08 -0500
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 00:14 +0100
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] olcott <NoOne@NoWhere.com> - 2021-09-30 18:58 -0500
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 02:50 +0100
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] olcott <NoOne@NoWhere.com> - 2021-09-30 21:07 -0500
Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 03:22 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-30 17:12 -0500
Re: Clarification of Linz Ĥ Description (V2) André G. Isaak <agisaak@gm.invalid> - 2021-09-30 16:55 -0600
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-30 18:21 -0500
Re: Clarification of Linz Ĥ Description (V2) André G. Isaak <agisaak@gm.invalid> - 2021-09-30 18:18 -0600
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-30 19:26 -0500
Re: Clarification of Linz Ĥ Description (V2) André G. Isaak <agisaak@gm.invalid> - 2021-09-30 18:39 -0600
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-30 19:54 -0500
Re: Clarification of Linz Ĥ Description (V2) André G. Isaak <agisaak@gm.invalid> - 2021-09-30 19:07 -0600
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-09-30 20:27 -0500
Re: Clarification of Linz Ĥ Description (V2) André G. Isaak <agisaak@gm.invalid> - 2021-09-30 19:40 -0600
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-09-30 21:38 -0400
Re: Clarification of Linz Ĥ Description (V2) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-10-01 15:12 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 09:36 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 11:44 -0400
Re: Clarification of Linz Ĥ Description (V2) Jeff Barnett <jbb@notatt.com> - 2021-10-01 10:45 -0600
Re: Clarification of Linz Ĥ Description (V2) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-10-02 01:09 +0100
Re: Clarification of Linz Ĥ Description (V2) [ basis of my rebuttal ] olcott <NoOne@NoWhere.com> - 2021-10-01 22:42 -0500
Re: Clarification of Linz Ĥ Description (V2) [ basis of my rebuttal ] Richard Damon <Richard@Damon-Family.org> - 2021-10-02 06:58 -0400
Re: Clarification of Linz Ĥ Description (V2) Andy Walker <anw@cuboid.co.uk> - 2021-10-01 17:27 +0100
Re: Clarification of Linz Ĥ Description (V2) Jeff Barnett <jbb@notatt.com> - 2021-10-01 10:55 -0600
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 12:04 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 13:17 -0400
Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] olcott <NoOne@NoWhere.com> - 2021-10-01 12:30 -0500
Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:18 -0400
Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] olcott <NoOne@NoWhere.com> - 2021-10-01 15:25 -0500
Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:49 -0400
Re: Clarification of Linz Ĥ Description (V2) Andy Walker <anw@cuboid.co.uk> - 2021-10-01 21:09 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 15:23 -0500
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 21:32 +0100
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 15:46 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:55 -0400
Re: Clarification of Linz Ĥ Description (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 00:13 +0100
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 13:11 -0400
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 12:18 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 13:22 -0400
Re: Clarification of Linz Ĥ Description (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 12:43 -0500
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:26 -0400
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <Richard@Damon-Family.org> - 2021-09-30 21:35 -0400
Re: Clarification of Linz Ĥ Description (V2) Richard Damon <news.x.richarddamon@xoxy.net> - 2021-09-30 06:25 -0400
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-09-29 06:26 -0400
Re: Clarification of Linz Ĥ Description wij <wyniijj@gmail.com> - 2021-10-01 09:12 -0700
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 11:46 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 13:19 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 12:41 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:34 -0400
Re: Clarification of Linz Ĥ Description Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 21:44 +0100
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 15:58 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 17:18 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 16:28 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 17:58 -0400
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 18:00 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 17:21 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 18:34 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 17:46 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 19:04 -0400
Re: Clarification of Linz Ĥ Description [ key difference ] olcott <NoOne@NoWhere.com> - 2021-10-01 18:20 -0500
Re: Clarification of Linz Ĥ Description [ key difference ] Richard Damon <Richard@Damon-Family.org> - 2021-10-01 20:27 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 17:10 -0500
Re: Clarification of Linz Ĥ Description Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 23:22 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] olcott <NoOne@NoWhere.com> - 2021-10-01 17:29 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-01 19:12 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 01:08 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] olcott <NoOne@NoWhere.com> - 2021-10-01 22:38 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-02 06:34 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 17:10 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) olcott <NoOne@NoWhere.com> - 2021-10-02 11:58 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 22:59 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) olcott <NoOne@NoWhere.com> - 2021-10-01 23:10 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 06:54 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) olcott <NoOne@NoWhere.com> - 2021-10-02 09:16 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) olcott <NoOne@NoWhere.com> - 2021-10-02 09:26 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 11:08 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) olcott <NoOne@NoWhere.com> - 2021-10-02 10:29 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 12:02 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) olcott <NoOne@NoWhere.com> - 2021-10-02 11:39 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 13:04 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) olcott <NoOne@NoWhere.com> - 2021-10-02 12:32 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 13:50 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) olcott <NoOne@NoWhere.com> - 2021-10-02 13:08 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 14:40 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) olcott <NoOne@NoWhere.com> - 2021-10-02 13:47 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 15:42 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) olcott <NoOne@NoWhere.com> - 2021-10-02 14:54 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V4) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 16:14 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-02 15:50 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Jeff Barnett <jbb@notatt.com> - 2021-10-02 15:12 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-02 17:53 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-02 17:20 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-02 15:43 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-02 17:43 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-02 19:19 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-02 17:52 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-02 18:27 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] DV <xlt.pjw@gmail.com> - 2021-10-11 06:32 -0700
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-11 20:08 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] DV <xlt.pjw@gmail.com> - 2021-10-11 19:02 -0700
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-11 22:24 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Jeff Barnett <jbb@notatt.com> - 2021-10-11 22:30 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-12 02:41 -0700
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-12 08:35 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-12 18:59 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-13 10:14 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 12:15 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-13 12:17 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 14:37 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-13 13:57 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 16:49 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-13 18:31 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-13 18:01 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-13 21:09 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 22:33 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-13 20:37 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 20:08 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-14 01:24 -0700
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-14 09:57 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-14 16:06 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-14 17:47 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-14 17:32 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-14 19:27 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-14 18:59 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-15 00:29 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-15 09:47 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-15 11:17 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-15 10:39 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-15 12:16 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-15 12:27 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] André G. Isaak <agisaak@gm.invalid> - 2021-10-15 12:31 -0600
Re: Clarification of Linz Ĥ Description [ untainted decision ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-15 22:31 +0100
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-15 22:18 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-15 23:30 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-16 04:11 -0700
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-16 08:07 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 10:30 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-16 17:28 +0100
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-15 22:22 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 10:39 -0400
Re: Clarification of Linz Ĥ Description [ correct halt deciding criteria ] olcott <NoOne@NoWhere.com> - 2021-10-16 10:47 -0500
Re: Clarification of Linz Ĥ Description [ correct halt deciding criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 12:05 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-16 17:27 +0100
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-16 10:49 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 12:10 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-16 17:27 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-16 13:07 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 18:39 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-16 18:41 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 22:24 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-16 22:40 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-16 21:44 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] André G. Isaak <agisaak@gm.invalid> - 2021-10-16 21:34 -0600
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-16 22:59 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-17 08:02 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] André G. Isaak <agisaak@gm.invalid> - 2021-10-17 10:17 -0600
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-18 09:00 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] André G. Isaak <agisaak@gm.invalid> - 2021-10-18 08:54 -0600
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:11 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-19 09:51 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] olcott <NoOne@NoWhere.com> - 2021-10-19 10:36 -0500
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 17:44 +0100
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-19 19:21 -0400
Re: Clarification of Linz Ĥ Description [ conclusive proof ] Richard Damon <Richard@Damon-Family.org> - 2021-10-17 07:57 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-17 00:49 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-16 19:52 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-17 16:03 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-17 12:02 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-17 13:36 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-18 01:47 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-18 10:07 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-18 13:56 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 07:22 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 07:24 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 07:26 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 16:10 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-19 10:26 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 09:17 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 09:20 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 17:42 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 10:36 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 11:16 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 23:53 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-19 16:50 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-20 02:29 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-20 04:14 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-20 05:41 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-20 06:29 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-20 09:01 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-20 12:13 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Alan Mackenzie <acm@muc.de> - 2021-10-20 20:01 +0000
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-20 13:37 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] Alan Mackenzie <acm@muc.de> - 2021-10-22 16:56 +0000
Re: Clarification of Linz Ĥ Description [ correct criteria ] DV <xlt.pjw@gmail.com> - 2021-10-22 12:33 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-20 08:29 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 20:04 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-20 19:29 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Jeff Barnett <jbb@notatt.com> - 2021-10-20 23:23 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-21 01:52 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Jeff Barnett <jbb@notatt.com> - 2021-10-21 02:05 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-21 07:45 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-21 05:18 -0700
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-20 08:35 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-18 23:59 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-19 09:10 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 17:55 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-19 12:17 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-19 19:12 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-20 02:21 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 08:57 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 09:13 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 10:25 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 09:42 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 10:51 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 10:46 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 11:53 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 11:04 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 12:37 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 11:55 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 13:15 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 13:00 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 15:00 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 14:06 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 15:34 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 15:40 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 16:59 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 16:52 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 18:04 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 20:23 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-21 01:01 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 15:06 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 14:32 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 16:55 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ André is lost? ] André G. Isaak <agisaak@gm.invalid> - 2021-10-20 16:50 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 19:46 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-21 01:00 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 19:23 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 20:35 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 19:46 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 21:10 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 20:23 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 21:40 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 21:22 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 22:56 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 22:00 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 23:36 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-21 02:37 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-20 21:18 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-20 23:05 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-21 10:45 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] olcott <NoOne@NoWhere.com> - 2021-10-21 09:04 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Richard Damon <Richard@Damon-Family.org> - 2021-10-21 19:15 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] olcott <NoOne@NoWhere.com> - 2021-10-21 18:30 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] olcott <NoOne@NoWhere.com> - 2021-10-21 18:33 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] Richard Damon <Richard@Damon-Family.org> - 2021-10-21 23:03 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-22 03:19 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] olcott <NoOne@NoWhere.com> - 2021-10-21 21:33 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Jeff Barnett <jbb@notatt.com> - 2021-10-21 21:59 -0600
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-23 00:57 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] olcott <NoOne@NoWhere.com> - 2021-10-22 23:19 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Richard Damon <Richard@Damon-Family.org> - 2021-10-23 08:58 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-25 00:30 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] olcott <NoOne@NoWhere.com> - 2021-10-25 09:46 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Richard Damon <Richard@Damon-Family.org> - 2021-10-25 19:13 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 01:46 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] olcott <NoOne@NoWhere.com> - 2021-10-25 20:02 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-19 21:19 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:15 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-19 07:34 -0400
Re: Clarification of Linz H^ Description [ correct criteria ] Mikko <mikko.levanto@outlook.com> - 2021-10-17 15:01 +0300
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-17 09:06 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-17 09:27 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-17 16:09 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] olcott <NoOne@NoWhere.com> - 2021-10-18 09:09 -0500
Re: Clarification of Linz Ĥ Description [ correct criteria ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-18 23:59 +0100
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:20 -0400
Re: Clarification of Linz Ĥ Description [ correct criteria ] Richard Damon <Richard@Damon-Family.org> - 2021-10-17 13:12 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-14 23:28 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] olcott <NoOne@NoWhere.com> - 2021-10-15 09:37 -0500
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-15 12:18 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-14 22:58 -0400
Re: Clarification of Linz Ĥ Description [ untainted decision ] Richard Damon <Richard@Damon-Family.org> - 2021-10-13 14:49 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 16:14 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) olcott <NoOne@NoWhere.com> - 2021-10-02 10:31 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) André G. Isaak <agisaak@gm.invalid> - 2021-10-02 09:58 -0600
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) olcott <NoOne@NoWhere.com> - 2021-10-02 11:23 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 12:44 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 23:00 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 11:15 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 17:34 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 12:48 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 21:15 +0100
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) olcott <NoOne@NoWhere.com> - 2021-10-02 16:02 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Richard Damon <Richard@Damon-Family.org> - 2021-10-02 17:30 -0400
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) olcott <NoOne@NoWhere.com> - 2021-10-02 12:12 -0500
Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-02 22:26 +0100
Re: Clarification of Linz Ĥ Description André G. Isaak <agisaak@gm.invalid> - 2021-10-01 12:26 -0600
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 13:42 -0500
Re: Clarification of Linz Ĥ Description André G. Isaak <agisaak@gm.invalid> - 2021-10-01 13:07 -0600
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 14:18 -0500
Re: Clarification of Linz Ĥ Description André G. Isaak <agisaak@gm.invalid> - 2021-10-01 14:34 -0600
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 15:52 -0500
Re: Clarification of Linz Ĥ Description André G. Isaak <agisaak@gm.invalid> - 2021-10-01 16:17 -0600
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 17:23 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 18:36 -0400
Re: Clarification of Linz Ĥ Description olcott <NoOne@NoWhere.com> - 2021-10-01 17:48 -0500
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 19:15 -0400
Re: Clarification of Linz Ĥ Description Richard Damon <Richard@Damon-Family.org> - 2021-10-01 16:40 -0400
Page 2 of 17 — ← Prev page 1 [2] 3 4 … 17 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 03:22 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ dishonest dodge ] |
| Message-ID | <87r1d5jxh1.fsf@bsb.me.uk> |
| In reply to | #40152 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2021 8:50 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/30/2021 6:14 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>>> If the above is an accurate quote (which has not been properly >>>>> established) then--->H(<Ĥ>,<Ĥ>) ⊢* H.qn is a typographical error. >>>> >>>> This is an appallingly dishonest claim. There is no possibility it is a >>>> typo. Why would you even try to pretend that it is? You say the same >>>> thing again in another post >>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>>> Message-ID: <M9Kdnab-FpOgUD_9nZ2dnUU7-UHNnZ2d@giganews.com> >>>> and again using words this time >>>> H applied to input (Ĥ, Ĥ) transitions to H.qn >>>> Message-ID: <0cudnXyibs7OuDz9nZ2dnUU7-QfNnZ2d@giganews.com> >>>> and again in words >>>> H(<Ĥ>,<Ĥ>) must abort the simulation of its input ∴ this input <is> >>>> correctly decided as non-halting. >>>> Message-ID: <_LednVXB0N9FGT_9nZ2dnUU7-RWdnZ2d@giganews.com> >>>> and again using a slightly different notion here >>>> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn >>>> Message-ID: <2-adncuMeNUVpY78nZ2dnUU7-fPNnZ2d@giganews.com> >>>> And then there is the fact that you've been saying exactly this in other >>>> ways for months: >>>> "Halts(Confound_Halts, Confound_Halts) returns false." >>>> Message-ID: <2aidnV9e3qQaOCDCnZ2dnUU7-c3NnZ2d@giganews.com> >>>> and >>>> "The input to Halts is only finite because..." >>>> Message-ID: <6eSdnYuLBrIuVFzCnZ2dnUU7-cPNnZ2d@giganews.com> >>>> >>>> And H(H_Hat, H_Hat) == false though H_Hat(H_Hat) halts. Post after post >>>> explaining why H(H_Hat, H_Hat) == 0 with H_Hat(H_Hat) halting might >>>> /seem/ wrong but is in fact correct because of how you define halting. >>>> >>>> No, it is not a typo. You are lying. You meant what you wrote, and >>>> people have been addressing what you now pretend is a typo for months. >>> You quoted me from five months ago my view has changed. >> >> So you were just lying when you tried to pretend it was as typographical >> error! > > Becauzsse you did not provide the time and date stampo Liar: "If the above is an accurate quote (which has not been properly established) then--->H(<Ĥ>,<Ĥ>) ⊢* H.qn is a typographical error". It has been established that you said it so you /were/ claiming it was a typo. That failed when you saw you'd said it again and again and again in multiple forms. Quick, change the story! >>> Now that I know that H(<Ĥ>,<Ĥ>) ⊢* H.qy <snip> >>> Ĥ.qx(<Ĥ>,<Ĥ>) ⊢* H.qn is correct because the simulation of <Ĥ> applied >>> to <Ĥ> never reaches any final state whether or not the simulating >>> halt decider at Ĥ.qx aborts its simulation of this input. >> >> For any Ĥ that behaves as you say, its corresponding H will transition >> to H's equivalent state H.qn. But apparently you somehow know that >> H(<Ĥ>,<Ĥ>) ⊢* H.qy. Not possible. <snip> > I am done with you for the moment you do not address the points that I > raise. As I have always said, not replying to me is your best option as well as the one I prefer. But right there is the latest reason you are wrong, directly placed after the incorrect point you raised. Fingers in your ears, and... la, la, la, la, la! -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 17:12 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <kJCdnTPuWpmpq8v8nZ2dnUU7-evNnZ2d@giganews.com> |
| In reply to | #40118 |
On 9/30/2021 11:35 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/29/2021 9:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/29/2021 8:57 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/29/2021 8:36 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 9/29/2021 5:48 PM, Ben Bacarisse wrote:
>>>>>>>
>>>>>>>>> You must deny what Linz says because you are not talking about halt
>>>>>>>>> deciders. You are trying to pretend that Linz was talking about
>>>>>>>>> deciders for your other problem:
>>>>>>>>>
>>>>>>>>> This definition of halting circumvents the pathological self-reference
>>>>>>>>> error for every simulating halt decider:
>>>>>>>>> An input is decided to be halting only if ...
>>>>>>>>>
>>>>>>>>> On that basis:
>>>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn
>>>>>>>>>
>>>>>>>>> You don't get to say what halting is. It is already well-defined. Any
>>>>>>>>> definition that provides a basis for H rejecting a computation that is
>>>>>>>>> finite is garbage.
>>>>>>>>
>>>>>>>> 1----2-----3-----4--5-----6
>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>
>>>>>>>> (A) The Linz proof is about...
>>>>>>> ... halting. You've redefined "halting" so as to permit
>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>
>>>>>> The question about (1) on (2) is not what Linz is referring to.
>>>>> It is when he refers to it, as he does in the annotation you keep
>>>>> removing.
>>>>>
>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn
>>>>>>
>>>>>> My H1(P,P) proves this: H(<Ĥ>,<Ĥ>) ⊢* H.qy
>>>>> So which is it, qy or qn? Where you wrong to redefine halting so that
>>>>
>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said
>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said
>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said
>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said
>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said
>>> But you previously also said that H(<Ĥ>,<Ĥ>) ⊢* H.qn. You can't get mad
>>> because people believe what you write!
>>> Now I need to know how much of the post where you said that your new
>>> basis for halting gives H(<Ĥ>,<Ĥ>) ⊢* H.qn was /also/ wrong. All of it?
>>> It formed what appeared to be your entire justification for having
>>> "solved" the halting problem. Here is the whole thing:
>>> | My current proof simply shows exactly how the exact Peter Linz H would
>>> | correctly decide not halting on the exact Peter Linz Ĥ.
>>> |
>>> | This definition of halting circumvents the pathological self-reference
>>> | error for every simulating halt decider:
>>> |
>>> | An input is decided to be halting only if its simulation never needs
>>> | to be stopped by any simulating halt decider anywhere in its entire
>>> | invocation chain.
>>> |
>>> | On that basis:
>>> | Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>> | H(<Ĥ>,<Ĥ>) ⊢* H.qn
>>
>> It seems a little shady that you don't cut-and-paste it with the time
>> and date stamp as I ALWAYS do.
>
> It's Message-ID: <FL2dnU-wypwbXz_9nZ2dnUU7-d_NnZ2d@giganews.com>
>
> Are you accusing me of misquoting you?
>
> Are you going to address the substantive points or not?
On 5/17/2021 2:23 PM, olcott wrote:
> I have no dependency on Linz, his coverage of the halting
> problem is superior to all others because it precisely
> defines the problem in terms of the precision of state
> transitions and it does so as simply as possible.
>
> My current proof simply shows exactly how the exact Peter
> Linz H would correctly decide not halting on the exact Peter
> Linz Ĥ.
>
> This definition of halting circumvents the pathological
> self-reference error for every simulating halt decider:
>
> An input is decided to be halting only if its simulation
> never needs to be stopped by any simulating halt decider
> anywhere in its entire invocation chain.
>
> On that basis:
> Ĥ(<Ĥ>) ⊢* Ĥ.qn
> H(<Ĥ>,<Ĥ>) ⊢* H.qn
>
I have addressed the substantive points in my other reply. The above
analysis is not a typo it has been superseded by updated analysis.
Because of a critique of my work in another forum I have discovered that
the halt status that H1(P,P) reports is consistent with the behavior of
int main() { P(P); }
As long as this behavior is the same when I convert H1 and H to pure
functions this indicates that this: H(<Ĥ>,<Ĥ>) ⊢* H.qn must be updated
to this: H(<Ĥ>,<Ĥ>) ⊢* H.qy.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-30 16:55 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj5f9m$28p$1@dont-email.me> |
| In reply to | #40128 |
On 2021-09-30 16:12, olcott wrote:
> Because of a critique of my work in another forum I have discovered that
> the halt status that H1(P,P) reports is consistent with the behavior of
> int main() { P(P); }
But how does this address the Linz proof then? You've derived your P
from H, not from H1. So all that matter with respect to the Linz proof
is what *H*(P, P) returns. That some other decider H1, from which P is
*not* derived, can correctly decide P(P) has no bearing on Linz's claim.
H1 cannot decide P1(P1) where P1 is derived from H1 in the same way that
P is derived from H.
And your proposed 'best of three' test won't work either, since it will
be possible to derive a BestOfThree_Hat construction from your
BestOfThree routine which your BestOfThree routine won't be able to decide.
You don't seem to grasp that Linz is *not* claiming that there are
computations whose halting status cannot be decided. He is claiming that
there cannot be a *universal* halt decider because for every purported
halt decider one can construct a TM which that specific halt decider
cannot correctly decide.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 18:21 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <FpydnRFFZtsO28v8nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #40129 |
On 9/30/2021 5:55 PM, André G. Isaak wrote:
> On 2021-09-30 16:12, olcott wrote:
>
>> Because of a critique of my work in another forum I have discovered
>> that the halt status that H1(P,P) reports is consistent with the
>> behavior of int main() { P(P); }
>
> But how does this address the Linz proof then? You've derived your P
> from H, not from H1. So all that matter with respect to the Linz proof
> is what *H*(P, P) returns. That some other decider H1, from which P is
> *not* derived, can correctly decide P(P) has no bearing on Linz's claim.
> H1 cannot decide P1(P1) where P1 is derived from H1 in the same way that
> P is derived from H.
>
H(P,P) is correct and H1(P,P) is correct.
> And your proposed 'best of three' test won't work either, since it will
> be possible to derive a BestOfThree_Hat construction from your
> BestOfThree routine which your BestOfThree routine won't be able to decide.
>
> You don't seem to grasp that Linz is *not* claiming that there are
> computations whose halting status cannot be decided.
He is claiming that H does not exist:
The contradiction tells us that our assumption
of the existence of H, and hence the assumption
of the decidability of the halting problem,
must be false. (Linz 1990:320).
https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Not only does the Linz H exist it gets the correct answer and this
answer is consistent with the behavior of Ĥ applied to ⟨Ĥ⟩
Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company. (318-320)
> He is claiming that
> there cannot be a *universal* halt decider because for every purported
> halt decider one can construct a TM which that specific halt decider
> cannot correctly decide.
>
> André
>
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-30 18:18 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj5k45$s0q$1@dont-email.me> |
| In reply to | #40136 |
On 2021-09-30 17:21, olcott wrote:
> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>> On 2021-09-30 16:12, olcott wrote:
>>
>>> Because of a critique of my work in another forum I have discovered
>>> that the halt status that H1(P,P) reports is consistent with the
>>> behavior of int main() { P(P); }
>>
>> But how does this address the Linz proof then? You've derived your P
>> from H, not from H1. So all that matter with respect to the Linz proof
>> is what *H*(P, P) returns. That some other decider H1, from which P is
>> *not* derived, can correctly decide P(P) has no bearing on Linz's
>> claim. H1 cannot decide P1(P1) where P1 is derived from H1 in the same
>> way that P is derived from H.
>>
>
> H(P,P) is correct and H1(P,P) is correct.
So you're saying they both return true? If so, why on earth do you
*need* H1? Why bring it up at all?
>> And your proposed 'best of three' test won't work either, since it
>> will be possible to derive a BestOfThree_Hat construction from your
>> BestOfThree routine which your BestOfThree routine won't be able to
>> decide.
>>
>> You don't seem to grasp that Linz is *not* claiming that there are
>> computations whose halting status cannot be decided.
>
> He is claiming that H does not exist:
Yes, that's what I said immediately below. So why bother with this
quote? Does it have any relevance to the point I was making?
André
> The contradiction tells us that our assumption
> of the existence of H, and hence the assumption
> of the decidability of the halting problem,
> must be false. (Linz 1990:320).
>
> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
> Not only does the Linz H exist it gets the correct answer and this
> answer is consistent with the behavior of Ĥ applied to ⟨Ĥ⟩
>
> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
> Lexington/Toronto: D. C. Heath and Company. (318-320)
>
>> He is claiming that there cannot be a *universal* halt decider because
>> for every purported halt decider one can construct a TM which that
>> specific halt decider cannot correctly decide.
>>
>> André
>>
>>
>
>
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 19:26 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <wsOdnV1gD4FOyMv8nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #40140 |
On 9/30/2021 7:18 PM, André G. Isaak wrote:
> On 2021-09-30 17:21, olcott wrote:
>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>> On 2021-09-30 16:12, olcott wrote:
>>>
>>>> Because of a critique of my work in another forum I have discovered
>>>> that the halt status that H1(P,P) reports is consistent with the
>>>> behavior of int main() { P(P); }
>>>
>>> But how does this address the Linz proof then? You've derived your P
>>> from H, not from H1. So all that matter with respect to the Linz
>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>> which P is *not* derived, can correctly decide P(P) has no bearing on
>>> Linz's claim. H1 cannot decide P1(P1) where P1 is derived from H1 in
>>> the same way that P is derived from H.
>>>
>>
>> H(P,P) is correct and H1(P,P) is correct.
>
> So you're saying they both return true? If so, why on earth do you
> *need* H1? Why bring it up at all?
>
H(P,P) correctly determines that its input never reaches its final state
whether or not H aborts the simulation of this input.
H1(P,P) correctly determines that its input reaches its final state.
>>> And your proposed 'best of three' test won't work either, since it
>>> will be possible to derive a BestOfThree_Hat construction from your
>>> BestOfThree routine which your BestOfThree routine won't be able to
>>> decide.
>>>
>>> You don't seem to grasp that Linz is *not* claiming that there are
>>> computations whose halting status cannot be decided.
>>
>> He is claiming that H does not exist:
>
> Yes, that's what I said immediately below. So why bother with this
> quote? Does it have any relevance to the point I was making?
>
> André
>
>> The contradiction tells us that our assumption
>> of the existence of H, and hence the assumption
>> of the decidability of the halting problem,
>> must be false. (Linz 1990:320).
>>
>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>> Not only does the Linz H exist it gets the correct answer and this
>> answer is consistent with the behavior of Ĥ applied to ⟨Ĥ⟩
>>
>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>> Lexington/Toronto: D. C. Heath and Company. (318-320)
>>
>>> He is claiming that there cannot be a *universal* halt decider
>>> because for every purported halt decider one can construct a TM which
>>> that specific halt decider cannot correctly decide.
>>>
>>> André
>>>
>>>
>>
>>
>
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-30 18:39 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj5lc9$24g$1@dont-email.me> |
| In reply to | #40141 |
On 2021-09-30 18:26, olcott wrote:
> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>> On 2021-09-30 17:21, olcott wrote:
>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>> On 2021-09-30 16:12, olcott wrote:
>>>>
>>>>> Because of a critique of my work in another forum I have discovered
>>>>> that the halt status that H1(P,P) reports is consistent with the
>>>>> behavior of int main() { P(P); }
>>>>
>>>> But how does this address the Linz proof then? You've derived your P
>>>> from H, not from H1. So all that matter with respect to the Linz
>>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>>> which P is *not* derived, can correctly decide P(P) has no bearing
>>>> on Linz's claim. H1 cannot decide P1(P1) where P1 is derived from H1
>>>> in the same way that P is derived from H.
>>>>
>>>
>>> H(P,P) is correct and H1(P,P) is correct.
>>
>> So you're saying they both return true? If so, why on earth do you
>> *need* H1? Why bring it up at all?
>>
>
> H(P,P) correctly determines that its input never reaches its final state
> whether or not H aborts the simulation of this input.
>
> H1(P,P) correctly determines that its input reaches its final state.
They have the *same* input. Therefore they cannot both be correct unless
they give the same answer. You can't have one of them claim that P(P)
never reaches its final state and the other say that P(P) does reach its
final state *and* claim they are both correct.
That's Trump Logic.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 19:54 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <L6ednRstCI7Fwcv8nZ2dnUU7-YfNnZ2d@giganews.com> |
| In reply to | #40142 |
On 9/30/2021 7:39 PM, André G. Isaak wrote:
> On 2021-09-30 18:26, olcott wrote:
>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>> On 2021-09-30 17:21, olcott wrote:
>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>
>>>>>> Because of a critique of my work in another forum I have
>>>>>> discovered that the halt status that H1(P,P) reports is consistent
>>>>>> with the behavior of int main() { P(P); }
>>>>>
>>>>> But how does this address the Linz proof then? You've derived your
>>>>> P from H, not from H1. So all that matter with respect to the Linz
>>>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>>>> which P is *not* derived, can correctly decide P(P) has no bearing
>>>>> on Linz's claim. H1 cannot decide P1(P1) where P1 is derived from
>>>>> H1 in the same way that P is derived from H.
>>>>>
>>>>
>>>> H(P,P) is correct and H1(P,P) is correct.
>>>
>>> So you're saying they both return true? If so, why on earth do you
>>> *need* H1? Why bring it up at all?
>>>
>>
>> H(P,P) correctly determines that its input never reaches its final
>> state whether or not H aborts the simulation of this input.
>>
>> H1(P,P) correctly determines that its input reaches its final state.
>
> They have the *same* input. Therefore they cannot both be correct unless
> they give the same answer. You can't have one of them claim that P(P)
> never reaches its final state and the other say that P(P) does reach its
> final state *and* claim they are both correct.
>
> That's Trump Logic.
>
> André
>
>
You have to wait until finish converting functions H1 and H to pure
functions. They do derive this result now yet it is possible that this
result is an artifact of their requirement of static local data to
derive these results.
If it works out like preliminary analysis indicates a pair of functions
with identical machine code and identical inputs really do have
different output because the input to H(P,P) calls H and the input to
H1(P,P) calls H (thus does not call H1).
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-30 19:07 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj5n09$anr$1@dont-email.me> |
| In reply to | #40143 |
On 2021-09-30 18:54, olcott wrote:
> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>> On 2021-09-30 18:26, olcott wrote:
>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>> On 2021-09-30 17:21, olcott wrote:
>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>
>>>>>>> Because of a critique of my work in another forum I have
>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>
>>>>>> But how does this address the Linz proof then? You've derived your
>>>>>> P from H, not from H1. So all that matter with respect to the Linz
>>>>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>>>>> which P is *not* derived, can correctly decide P(P) has no bearing
>>>>>> on Linz's claim. H1 cannot decide P1(P1) where P1 is derived from
>>>>>> H1 in the same way that P is derived from H.
>>>>>>
>>>>>
>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>
>>>> So you're saying they both return true? If so, why on earth do you
>>>> *need* H1? Why bring it up at all?
>>>>
>>>
>>> H(P,P) correctly determines that its input never reaches its final
>>> state whether or not H aborts the simulation of this input.
>>>
>>> H1(P,P) correctly determines that its input reaches its final state.
>>
>> They have the *same* input. Therefore they cannot both be correct
>> unless they give the same answer. You can't have one of them claim
>> that P(P) never reaches its final state and the other say that P(P)
>> does reach its final state *and* claim they are both correct.
>>
>> That's Trump Logic.
>>
>> André
>>
>>
>
> You have to wait until finish converting functions H1 and H to pure
> functions. They do derive this result now yet it is possible that this
> result is an artifact of their requirement of static local data to
> derive these results.
>
> If it works out like preliminary analysis indicates a pair of functions
> with identical machine code and identical inputs really do have
> different output because the input to H(P,P) calls H and the input to
> H1(P,P) calls H (thus does not call H1).
Your statement is entirely incoherent. If H(P, P) and H1(P, P) give
different results then either:
(A) one is wrong.
or
(B) they are not computing the same function, in which case at most
*one* of them can actually be deciding the halting function.
You understand that the halting function (which maps computations to
halting values) is a mathematical object which exists independently of
any Turing Machine or algorithm and has a fixed mapping from
computations to {true, false}, right?
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 20:27 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <eJednZvSnpq_-cv8nZ2dnUU7-cvNnZ2d@giganews.com> |
| In reply to | #40144 |
On 9/30/2021 8:07 PM, André G. Isaak wrote:
> On 2021-09-30 18:54, olcott wrote:
>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>> On 2021-09-30 18:26, olcott wrote:
>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>
>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>
>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>> the Linz proof is what *H*(P, P) returns. That some other decider
>>>>>>> H1, from which P is *not* derived, can correctly decide P(P) has
>>>>>>> no bearing on Linz's claim. H1 cannot decide P1(P1) where P1 is
>>>>>>> derived from H1 in the same way that P is derived from H.
>>>>>>>
>>>>>>
>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>
>>>>> So you're saying they both return true? If so, why on earth do you
>>>>> *need* H1? Why bring it up at all?
>>>>>
>>>>
>>>> H(P,P) correctly determines that its input never reaches its final
>>>> state whether or not H aborts the simulation of this input.
>>>>
>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>
>>> They have the *same* input. Therefore they cannot both be correct
>>> unless they give the same answer. You can't have one of them claim
>>> that P(P) never reaches its final state and the other say that P(P)
>>> does reach its final state *and* claim they are both correct.
>>>
>>> That's Trump Logic.
>>>
>>> André
>>>
>>>
>>
>> You have to wait until finish converting functions H1 and H to pure
>> functions. They do derive this result now yet it is possible that this
>> result is an artifact of their requirement of static local data to
>> derive these results.
>>
>> If it works out like preliminary analysis indicates a pair of
>> functions with identical machine code and identical inputs really do
>> have different output because the input to H(P,P) calls H and the
>> input to H1(P,P) calls H (thus does not call H1).
>
> Your statement is entirely incoherent. If H(P, P) and H1(P, P) give
> different results then either:
>
> (A) one is wrong.
>
> or
>
> (B) they are not computing the same function, in which case at most
> *one* of them can actually be deciding the halting function.
>
> You understand that the halting function (which maps computations to
> halting values) is a mathematical object which exists independently of
> any Turing Machine or algorithm and has a fixed mapping from
> computations to {true, false}, right?
>
> André
>
It will continue to be impossible for you to overcome your false
assumptions until you see that:
(a) H1(P,P) correctly reports that its input reaches its final state.
(b) H(P,P) correctly reports that its input NEVER reaches its final
state (whether or not it aborts the simulation of this input).
(c) Both H1 and H are pure functions and have identical machine code.
In computer programming, a pure function is a function that has the
following properties:
(1) The function return values are identical for identical arguments (no
variation with local static variables, non-local variables, mutable
reference arguments or input streams).
(2) The function application has no side effects (no mutation of local
static variables, non-local variables, mutable reference arguments or
input/output streams).
https://en.wikipedia.org/wiki/Pure_function
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-30 19:40 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj5oul$9i9$1@dont-email.me> |
| In reply to | #40145 |
On 2021-09-30 19:27, olcott wrote:
> On 9/30/2021 8:07 PM, André G. Isaak wrote:
>> On 2021-09-30 18:54, olcott wrote:
>>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>>> On 2021-09-30 18:26, olcott wrote:
>>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>>
>>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>>
>>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>>> the Linz proof is what *H*(P, P) returns. That some other
>>>>>>>> decider H1, from which P is *not* derived, can correctly decide
>>>>>>>> P(P) has no bearing on Linz's claim. H1 cannot decide P1(P1)
>>>>>>>> where P1 is derived from H1 in the same way that P is derived
>>>>>>>> from H.
>>>>>>>>
>>>>>>>
>>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>>
>>>>>> So you're saying they both return true? If so, why on earth do you
>>>>>> *need* H1? Why bring it up at all?
>>>>>>
>>>>>
>>>>> H(P,P) correctly determines that its input never reaches its final
>>>>> state whether or not H aborts the simulation of this input.
>>>>>
>>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>>
>>>> They have the *same* input. Therefore they cannot both be correct
>>>> unless they give the same answer. You can't have one of them claim
>>>> that P(P) never reaches its final state and the other say that P(P)
>>>> does reach its final state *and* claim they are both correct.
>>>>
>>>> That's Trump Logic.
>>>>
>>>> André
>>>>
>>>>
>>>
>>> You have to wait until finish converting functions H1 and H to pure
>>> functions. They do derive this result now yet it is possible that
>>> this result is an artifact of their requirement of static local data
>>> to derive these results.
>>>
>>> If it works out like preliminary analysis indicates a pair of
>>> functions with identical machine code and identical inputs really do
>>> have different output because the input to H(P,P) calls H and the
>>> input to H1(P,P) calls H (thus does not call H1).
>>
>> Your statement is entirely incoherent. If H(P, P) and H1(P, P) give
>> different results then either:
>>
>> (A) one is wrong.
>>
>> or
>>
>> (B) they are not computing the same function, in which case at most
>> *one* of them can actually be deciding the halting function.
>>
>> You understand that the halting function (which maps computations to
>> halting values) is a mathematical object which exists independently of
>> any Turing Machine or algorithm and has a fixed mapping from
>> computations to {true, false}, right?
>>
>> André
>>
>
> It will continue to be impossible for you to overcome your false
> assumptions until you see that:
If you think I am making false assumptions, please identify those
assumptions.
> (a) H1(P,P) correctly reports that its input reaches its final state.
>
> (b) H(P,P) correctly reports that its input NEVER reaches its final
> state (whether or not it aborts the simulation of this input).
>
> (c) Both H1 and H are pure functions and have identical machine code.
>
> In computer programming, a pure function is a function that has the
> following properties:
There's no need for you to keep providing wikipedia definitions for
things. Everyone here knows what these terms mean (well, everyone other
than you).
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-30 21:38 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <oEt5J.79105$QzOf.58037@fx17.iad> |
| In reply to | #40143 |
On 9/30/21 8:54 PM, olcott wrote:
> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>> On 2021-09-30 18:26, olcott wrote:
>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>> On 2021-09-30 17:21, olcott wrote:
>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>
>>>>>>> Because of a critique of my work in another forum I have
>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>
>>>>>> But how does this address the Linz proof then? You've derived your
>>>>>> P from H, not from H1. So all that matter with respect to the Linz
>>>>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>>>>> which P is *not* derived, can correctly decide P(P) has no bearing
>>>>>> on Linz's claim. H1 cannot decide P1(P1) where P1 is derived from
>>>>>> H1 in the same way that P is derived from H.
>>>>>>
>>>>>
>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>
>>>> So you're saying they both return true? If so, why on earth do you
>>>> *need* H1? Why bring it up at all?
>>>>
>>>
>>> H(P,P) correctly determines that its input never reaches its final
>>> state whether or not H aborts the simulation of this input.
>>>
>>> H1(P,P) correctly determines that its input reaches its final state.
>>
>> They have the *same* input. Therefore they cannot both be correct
>> unless they give the same answer. You can't have one of them claim
>> that P(P) never reaches its final state and the other say that P(P)
>> does reach its final state *and* claim they are both correct.
>>
>> That's Trump Logic.
>>
>> André
>>
>>
>
> You have to wait until finish converting functions H1 and H to pure
> functions. They do derive this result now yet it is possible that this
> result is an artifact of their requirement of static local data to
> derive these results.
>
> If it works out like preliminary analysis indicates a pair of functions
> with identical machine code and identical inputs really do have
> different output because the input to H(P,P) calls H and the input to
> H1(P,P) calls H (thus does not call H1).
>
So, you are quoting the results of experements not yet run?
You are telling the answers that programs will give that aren't yet
fully written?
That sounds like a real good use of the scientific method to me. Who
needs any actual proof, we just need to trust the guy who has been dead
wrong for the last many years.
RIGHT?
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2021-10-01 15:12 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj74vv$1ebj$1@gioia.aioe.org> |
| In reply to | #40143 |
On 01/10/2021 01:54, olcott wrote:
> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>> On 2021-09-30 18:26, olcott wrote:
>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>> On 2021-09-30 17:21, olcott wrote:
>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>
>>>>>>> Because of a critique of my work in another forum I have
>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>
>>>>>> But how does this address the Linz proof then? You've derived your
>>>>>> P from H, not from H1. So all that matter with respect to the Linz
>>>>>> proof is what *H*(P, P) returns. That some other decider H1, from
>>>>>> which P is *not* derived, can correctly decide P(P) has no bearing
>>>>>> on Linz's claim. H1 cannot decide P1(P1) where P1 is derived from
>>>>>> H1 in the same way that P is derived from H.
>>>>>>
>>>>>
>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>
>>>> So you're saying they both return true? If so, why on earth do you
>>>> *need* H1? Why bring it up at all?
>>>>
>>>
>>> H(P,P) correctly determines that its input never reaches its final
>>> state whether or not H aborts the simulation of this input.
>>>
>>> H1(P,P) correctly determines that its input reaches its final state.
>>
>> They have the *same* input. Therefore they cannot both be correct
>> unless they give the same answer. You can't have one of them claim
>> that P(P) never reaches its final state and the other say that P(P)
>> does reach its final state *and* claim they are both correct.
>>
>> That's Trump Logic.
>>
>> André
>>
>>
>
> You have to wait until finish converting functions H1 and H to pure
> functions. They do derive this result now yet it is possible that this
> result is an artifact of their requirement of static local data to
> derive these results.
Or some other form of cheating such as a function taking its own
address, and varying its processing according to that address.
(I suggested this was all that was going on a couple of weeks ago, but
you neither confirmed nor denied that. Almost as though you actually
don't understand /yourself/ what's going on. (Surely that cannot be...!))
>
> If it works out like preliminary analysis indicates a pair of functions
> with identical machine code and identical inputs really do have
> different output because the input to H(P,P) calls H and the input to
> H1(P,P) calls H (thus does not call H1).
Of course an /unrestricted/ x86 program can do that - all it has to do
is look at its own address and behave differently according to that
address. (Like your H/H1 routines.) Or cheat with global variables etc..
If you are concerned with saying things of relevance to TMs and Linz's
proof, you need to limit your C code to doing things that directly
correspond with what TMs can do. Otherwise the relationship between
your computing model and TMs will become distorted and the conclusions
you want to draw from your program's behaviour to TM behaviour may
simply not apply.
I know that last paragraph is WAAAAAY over your head (computation
models? too abstract!) so you will just ignore it. Or perhaps spray
your "Objection Begone!" Turing-equivalence spray at it, which never
works for you. :)
Anyway, you need to work out /why/ copying an algorithm can produce
different behaviour in the copy, and STOP DOING IT!! (Just like you
seem to have recognised that non-pure functions are to be avoided. I'm
not sure whether using your own machine code address breaks the "pure
function" rules per se, but the effect on your efforts is the same so it
doesn't really matter.)
Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 09:36 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <88WdncjFceR9gcr8nZ2dnUU7-cfNnZ2d@giganews.com> |
| In reply to | #40157 |
On 10/1/2021 9:12 AM, Mike Terry wrote:
> On 01/10/2021 01:54, olcott wrote:
>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>> On 2021-09-30 18:26, olcott wrote:
>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>
>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>
>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>> the Linz proof is what *H*(P, P) returns. That some other decider
>>>>>>> H1, from which P is *not* derived, can correctly decide P(P) has
>>>>>>> no bearing on Linz's claim. H1 cannot decide P1(P1) where P1 is
>>>>>>> derived from H1 in the same way that P is derived from H.
>>>>>>>
>>>>>>
>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>
>>>>> So you're saying they both return true? If so, why on earth do you
>>>>> *need* H1? Why bring it up at all?
>>>>>
>>>>
>>>> H(P,P) correctly determines that its input never reaches its final
>>>> state whether or not H aborts the simulation of this input.
>>>>
>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>
>>> They have the *same* input. Therefore they cannot both be correct
>>> unless they give the same answer. You can't have one of them claim
>>> that P(P) never reaches its final state and the other say that P(P)
>>> does reach its final state *and* claim they are both correct.
>>>
>>> That's Trump Logic.
>>>
>>> André
>>>
>>>
>>
>> You have to wait until finish converting functions H1 and H to pure
>> functions. They do derive this result now yet it is possible that this
>> result is an artifact of their requirement of static local data to
>> derive these results.
>
> Or some other form of cheating such as a function taking its own
> address, and varying its processing according to that address.
>
> (I suggested this was all that was going on a couple of weeks ago, but
> you neither confirmed nor denied that. Almost as though you actually
> don't understand /yourself/ what's going on. (Surely that cannot be...!))
I don't reply to nonsense.
>>
>> If it works out like preliminary analysis indicates a pair of
>> functions with identical machine code and identical inputs really do
>> have different output because the input to H(P,P) calls H and the
>> input to H1(P,P) calls H (thus does not call H1).
>
> Of course an /unrestricted/ x86 program can do that - all it has to do
> is look at its own address and behave differently according to that
> address. (Like your H/H1 routines.) Or cheat with global variables etc..
>
The halting theorem counter-examples present infinitely nested
simulation (non-halting) behavior to every simulating halt decider.
When the input P to a simulating halt decider H1 does not call this same
decider and instead calls another different decider H, then infinitely
nested simulation is not specified for H1(P,P) as it is for H(P,P).
> If you are concerned with saying things of relevance to TMs and Linz's
> proof, you need to limit your C code to doing things that directly
> correspond with what TMs can do.
Yes that was my biggest challenge. I didn't even know the criteria for
that even though Kaz gave me this criteria months ago. After carefully
checking and double checking this criteria seems sufficient:
In computer programming, a pure function is a function that has the
following properties:[1][2]
(1) The function return values are identical for identical arguments (no
variation with local static variables, non-local variables, mutable
reference arguments or input streams).
(2) The function application has no side effects (no mutation of local
static variables, non-local variables, mutable reference arguments or
input/output streams).
https://en.wikipedia.org/wiki/Pure_function
> Otherwise the relationship between
> your computing model and TMs will become distorted and the conclusions
> you want to draw from your program's behaviour to TM behaviour may
> simply not apply.
>
> I know that last paragraph is WAAAAAY over your head (computation
> models? too abstract!) so you will just ignore it. Or perhaps spray
> your "Objection Begone!" Turing-equivalence spray at it, which never
> works for you. :)
>
> Anyway, you need to work out /why/ copying an algorithm can produce
> different behaviour in the copy, and STOP DOING IT!! (Just like you
> seem to have recognised that non-pure functions are to be avoided. I'm
> not sure whether using your own machine code address breaks the "pure
> function" rules per se, but the effect on your efforts is the same so it
> doesn't really matter.)
>
>
> Mike.
My redesign meets all of the above pure function criteria.
It really is the case that a pair of pure functions with identical
machine code will have different behavior on the same input when this
input calls one of these functions in pathological self-reference and
not the other. Identical functions, identical input, differing
relationships between the functions and their input.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 11:44 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <A1G5J.48760$md6.6148@fx36.iad> |
| In reply to | #40159 |
On 10/1/21 10:36 AM, olcott wrote:
> On 10/1/2021 9:12 AM, Mike Terry wrote:
>> On 01/10/2021 01:54, olcott wrote:
>>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>>> On 2021-09-30 18:26, olcott wrote:
>>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>>
>>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>>
>>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>>> the Linz proof is what *H*(P, P) returns. That some other
>>>>>>>> decider H1, from which P is *not* derived, can correctly decide
>>>>>>>> P(P) has no bearing on Linz's claim. H1 cannot decide P1(P1)
>>>>>>>> where P1 is derived from H1 in the same way that P is derived
>>>>>>>> from H.
>>>>>>>>
>>>>>>>
>>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>>
>>>>>> So you're saying they both return true? If so, why on earth do you
>>>>>> *need* H1? Why bring it up at all?
>>>>>>
>>>>>
>>>>> H(P,P) correctly determines that its input never reaches its final
>>>>> state whether or not H aborts the simulation of this input.
>>>>>
>>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>>
>>>> They have the *same* input. Therefore they cannot both be correct
>>>> unless they give the same answer. You can't have one of them claim
>>>> that P(P) never reaches its final state and the other say that P(P)
>>>> does reach its final state *and* claim they are both correct.
>>>>
>>>> That's Trump Logic.
>>>>
>>>> André
>>>>
>>>>
>>>
>>> You have to wait until finish converting functions H1 and H to pure
>>> functions. They do derive this result now yet it is possible that
>>> this result is an artifact of their requirement of static local data
>>> to derive these results.
>>
>> Or some other form of cheating such as a function taking its own
>> address, and varying its processing according to that address.
>>
>> (I suggested this was all that was going on a couple of weeks ago, but
>> you neither confirmed nor denied that. Almost as though you actually
>> don't understand /yourself/ what's going on. (Surely that cannot
>> be...!))
>
> I don't reply to nonsense.
>
>
>>>
>>> If it works out like preliminary analysis indicates a pair of
>>> functions with identical machine code and identical inputs really do
>>> have different output because the input to H(P,P) calls H and the
>>> input to H1(P,P) calls H (thus does not call H1).
>>
>> Of course an /unrestricted/ x86 program can do that - all it has to do
>> is look at its own address and behave differently according to that
>> address. (Like your H/H1 routines.) Or cheat with global variables
>> etc..
>>
>
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
>
No, it doesn't, only to Simulating Halt Deciders that can't handle that
problem and thus can't answer those cases.
IF the Halt Decider can actually answer the equivalent of H(P,P), then
P(P) does NOT have infinitely nested simulation behavior. PERIOD.
> When the input P to a simulating halt decider H1 does not call this same
> decider and instead calls another different decider H, then infinitely
> nested simulation is not specified for H1(P,P) as it is for H(P,P).
Which means that H1 is a DIFFERENT computation than H, and thus its
answer is irrelevant to the Halting Problem Theory.
Linz proof only claims that the Halt Decider that his H^ was built on
would get that decision wrong, or in converse, that given any Halt
Decider, he describes how to make a Computation that it won't be able to
get right.
>
>> If you are concerned with saying things of relevance to TMs and Linz's
>> proof, you need to limit your C code to doing things that directly
>> correspond with what TMs can do.
>
> Yes that was my biggest challenge. I didn't even know the criteria for
> that even though Kaz gave me this criteria months ago. After carefully
> checking and double checking this criteria seems sufficient:
Yes, as you say, you don't know what you are talking about, and making
claims about things being 'obvious' about things that you don't even
know what they are.
>
> In computer programming, a pure function is a function that has the
> following properties:[1][2]>
> (1) The function return values are identical for identical arguments (no
> variation with local static variables, non-local variables, mutable
> reference arguments or input streams).
>
> (2) The function application has no side effects (no mutation of local
> static variables, non-local variables, mutable reference arguments or
> input/output streams).
> https://en.wikipedia.org/wiki/Pure_function
This comes close, but I am not positive if it is truly exhaustive, as if
it allows for two copies of the function to return different value
because the have different 'addresses' then it says that the address the
function is run at becomes an 'input' to the function. This makes an
individual copy of the function a pure computation, as it always will
have the same address, it doesn't make it the direct equivalent of a
Turing Machine, as the 'algorithm' of that machine has an extra 'hidden'
input, the address the code was run at.
>
>> Otherwise the relationship between your computing model and TMs will
>> become distorted and the conclusions you want to draw from your
>> program's behaviour to TM behaviour may simply not apply.
>>
>> I know that last paragraph is WAAAAAY over your head (computation
>> models? too abstract!) so you will just ignore it. Or perhaps spray
>> your "Objection Begone!" Turing-equivalence spray at it, which never
>> works for you. :)
>>
>> Anyway, you need to work out /why/ copying an algorithm can produce
>> different behaviour in the copy, and STOP DOING IT!! (Just like you
>> seem to have recognised that non-pure functions are to be avoided.
>> I'm not sure whether using your own machine code address breaks the
>> "pure function" rules per se, but the effect on your efforts is the
>> same so it doesn't really matter.)
>>
>>
>> Mike.
>
> My redesign meets all of the above pure function criteria.
But, if it uses the trick I described, it means that the function is not
a computation in the sense that it can be copied and be the same
computation. This break Turing Machine Equivalence.
>
> It really is the case that a pair of pure functions with identical
> machine code will have different behavior on the same input when this
> input calls one of these functions in pathological self-reference and
> not the other. Identical functions, identical input, differing
> relationships between the functions and their input.
>
Right, and as I said, if the 'PC' code uses operations that depend on
the address the code is run at, then the 'Computation' that the code
represents contains a 'hidden' input of what address the computation is
run at.
When converted to a Turing Machine, or a real Computation, that 'hidden'
input needs to become an explicit input parameter.
H(addr, P, I) is NOT the proper form for a Halt Decider, it must be just
H(P,I).
I suspect this 'breaks' your argument. H and H1 are DIFFERENT
Comutations, and thus you can't build H^ off of H and then use H1 to get
your needed correct answer.
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2021-10-01 10:45 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj7dut$tim$1@dont-email.me> |
| In reply to | #40159 |
On 10/1/2021 8:36 AM, olcott wrote: > > I don't reply to nonsense. > You do very frequently. You have written messages "in reply to" your own messages more than any other (sub)human alive to day or in the past for that matter. Your nonsense and repetitive behavior reminds me of a neurotic chimpanzee at our local zoo. It hurts to watch. The Guinness Book of World Records is holding a place for you in this regards as well as several other categories. Be proud son/daughter; be proud. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2021-10-02 01:09 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj87v7$1v8p$1@gioia.aioe.org> |
| In reply to | #40159 |
On 01/10/2021 15:36, olcott wrote:
> On 10/1/2021 9:12 AM, Mike Terry wrote:
>> On 01/10/2021 01:54, olcott wrote:
>>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>>> On 2021-09-30 18:26, olcott wrote:
>>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>>
>>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>>
>>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>>> the Linz proof is what *H*(P, P) returns. That some other
>>>>>>>> decider H1, from which P is *not* derived, can correctly decide
>>>>>>>> P(P) has no bearing on Linz's claim. H1 cannot decide P1(P1)
>>>>>>>> where P1 is derived from H1 in the same way that P is derived
>>>>>>>> from H.
>>>>>>>>
>>>>>>>
>>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>>
>>>>>> So you're saying they both return true? If so, why on earth do you
>>>>>> *need* H1? Why bring it up at all?
>>>>>>
>>>>>
>>>>> H(P,P) correctly determines that its input never reaches its final
>>>>> state whether or not H aborts the simulation of this input.
>>>>>
>>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>>
>>>> They have the *same* input. Therefore they cannot both be correct
>>>> unless they give the same answer. You can't have one of them claim
>>>> that P(P) never reaches its final state and the other say that P(P)
>>>> does reach its final state *and* claim they are both correct.
>>>>
>>>> That's Trump Logic.
>>>>
>>>> André
>>>>
>>>>
>>>
>>> You have to wait until finish converting functions H1 and H to pure
>>> functions. They do derive this result now yet it is possible that
>>> this result is an artifact of their requirement of static local data
>>> to derive these results.
>>
>> Or some other form of cheating such as a function taking its own
>> address, and varying its processing according to that address.
>>
>> (I suggested this was all that was going on a couple of weeks ago, but
>> you neither confirmed nor denied that. Almost as though you actually
>> don't understand /yourself/ what's going on. (Surely that cannot
>> be...!))
>
> I don't reply to nonsense.
>
>
>>>
>>> If it works out like preliminary analysis indicates a pair of
>>> functions with identical machine code and identical inputs really do
>>> have different output because the input to H(P,P) calls H and the
>>> input to H1(P,P) calls H (thus does not call H1).
>>
>> Of course an /unrestricted/ x86 program can do that - all it has to do
>> is look at its own address and behave differently according to that
>> address. (Like your H/H1 routines.) Or cheat with global variables
>> etc..
>>
>
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
>
> When the input P to a simulating halt decider H1 does not call this same
> decider and instead calls another different decider H, then infinitely
> nested simulation is not specified for H1(P,P) as it is for H(P,P).
>
>> If you are concerned with saying things of relevance to TMs and Linz's
>> proof, you need to limit your C code to doing things that directly
>> correspond with what TMs can do.
>
> Yes that was my biggest challenge. I didn't even know the criteria for
> that even though Kaz gave me this criteria months ago. After carefully
> checking and double checking this criteria seems sufficient:
>
> In computer programming, a pure function is a function that has the
> following properties:[1][2]
>
> (1) The function return values are identical for identical arguments (no
> variation with local static variables, non-local variables, mutable
> reference arguments or input streams).
>
> (2) The function application has no side effects (no mutation of local
> static variables, non-local variables, mutable reference arguments or
> input/output streams).
> https://en.wikipedia.org/wiki/Pure_function
And maybe you also should also be adhering to:
(3) The function does not take its own address and use that as a basis
to modify its processing.
I mean, you say "after careful checking this criteria seems sufficient:
...", but we all know you've not done any such "careful checking" or
given any serious thought at all to your underlying computing model and
its relationship to Linz's TM-based proof. Perhaps there are a whole
host of other restrictions you need to keep things workable? How would
you know if there were? You can't analyse the situation yourself - and
you've only settled on "pure functions" because that's what Kaz
mentioned. [btw, "criteria" is plural]
The Linz proof works because TMs have certain features:
[PURE]
- the same TM start state (including tape) always implies exactly
the same follow-on computation step states, and so properties
based on those follow-on step states like
"one of the follow-on step states is a halt state" aka
"computation halts" are well defined.
[COMPOSE]
- it is possible to include one TMs coded algorithm as a sub-part of
a second machine's coded algorithm, and computations running in
the second TM from the start of the incoporated "TM coded
algorithm" will likewise follow exactly the same computation steps
as for the original TM [given the same tape input, of course], and
so produce the same final result.
(COMPOSE is my name for the second feature...)
The COMPOSE feature is what supports Linz's use of a (modified) copy of
H incorporated into his derived H^. For a given input, his
H_Incoporated within H^ is guaranteed to track exactly the same
calculation steps as the H TM with that same input, and so is guaranteed
to arrive at the same qn/qy state as the original H. That is quite
trivial, and would be understood by anyone with a basic understanding of
TMs.
So your H/H1 give different answers for the same input, yet have "the
same machine code" - what does this imply? One way of looking at it
would be to say that copying the code within your computation model
doesn't satisfy COMPOSE. I think Andy would take that position, and
it's ok but I think not very useful for someone trying to write x86 code
as a more convenient (but broadly equivalent) alternative to discussing
TM-based proofs directly. If this is to be the way of looking at it,
then /what actually is/ the right way of copying an algorithm that
guarantees COMPOSE? Which of your H/H1 is the correct composition for
the original H machine, and why that one and not the other? Strictly
speaking, I suspect the answer is /neither/ of them, but this is all way
too complicated for what you're doing. Don't go there! :)
A better approach (IMO) is to say that the original idea for using C/x86
was maybe reasonable, but needs some restrictions to ensure basic [PURE]
and [COMPOSE] features hold. So you say you want to have pure
functions, which seems reasonable to me because then the correspondence
between your C code and TMs is more direct, making it easier to discuss
the Linz (TM) proof in terms of your C code. (I don't think you
understand those reasons, but hey...)
But for exactly the same reason, you would need to ensure COMPOSE
feature holds and algorithms are composable, preferably as "equivalent
code" callable functions, within your system. That fails when a
function can take its own address and vary its behaviour based on that
address. The function needs to base all its logic on JUST its input
arguments.
Just to confirm - that is what you're doing in your H/H1, right? (Like
I suggested a couple of weeks ago. You still seem to be avoiding this
question.)
A quick note - I don't see any problem with you using machine addresses
observed from your emulation traces. After all, your code can control
the way it emulates, including assigning machine addresses (in effect
state identifiers) to the code being emulated if required - nothing
there a TM can't directly do so that wouldn't break the simple
correspondence you need. The problems come if H/H1 take their /own/
address and then use that when analysing the trace data they receive.
>
>> Otherwise the relationship between your computing model and TMs will
>> become distorted and the conclusions you want to draw from your
>> program's behaviour to TM behaviour may simply not apply.
>>
>> I know that last paragraph is WAAAAAY over your head (computation
>> models? too abstract!) so you will just ignore it. Or perhaps spray
>> your "Objection Begone!" Turing-equivalence spray at it, which never
>> works for you. :)
>>
>> Anyway, you need to work out /why/ copying an algorithm can produce
>> different behaviour in the copy, and STOP DOING IT!! (Just like you
>> seem to have recognised that non-pure functions are to be avoided.
>> I'm not sure whether using your own machine code address breaks the
>> "pure function" rules per se, but the effect on your efforts is the
>> same so it doesn't really matter.)
>>
>>
>> Mike.
>
> My redesign meets all of the above pure function criteria.
>
> It really is the case that a pair of pure functions with identical
> machine code will have different behavior on the same input when this
> input calls one of these functions in pathological self-reference and
> not the other. Identical functions, identical input, differing
> relationships between the functions and their input.
And what do you think that means for your refutation of the Linz proof?
Linz is about TMs, and in TM-world the TM H, and the embedded (modified)
copy of H within H^ DO NECESSARILY behave identically for the same input.
If you have concocted some programming environment where that doesn't
hold, that wouldn't refute Linz - at most it would just mean that the
Linz proof isn't (directly) applicable for that environment, so you were
never "refuting" anything to start with. And of course that wouldn't
mean HP undecidability didn't hold for that environment, just in case
you're thinking of trying that one! (Proof of HP in that environment
could probably just use reduction to the HP-for-TMs problem.)
And if it does hold, then the Linz proof is going to work, and H will
decide (H^,H^) incorrectly like it's been doing for you so far.
Mike.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 22:42 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ basis of my rebuttal ] |
| Message-ID | <Y9adnYFJPLmoSMr8nZ2dnUU7-LGdnZ2d@giganews.com> |
| In reply to | #40220 |
On 10/1/2021 7:09 PM, Mike Terry wrote:
> On 01/10/2021 15:36, olcott wrote:
>> On 10/1/2021 9:12 AM, Mike Terry wrote:
>>> On 01/10/2021 01:54, olcott wrote:
>>>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>>>> On 2021-09-30 18:26, olcott wrote:
>>>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>>>
>>>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>>>
>>>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>>>> the Linz proof is what *H*(P, P) returns. That some other
>>>>>>>>> decider H1, from which P is *not* derived, can correctly decide
>>>>>>>>> P(P) has no bearing on Linz's claim. H1 cannot decide P1(P1)
>>>>>>>>> where P1 is derived from H1 in the same way that P is derived
>>>>>>>>> from H.
>>>>>>>>>
>>>>>>>>
>>>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>>>
>>>>>>> So you're saying they both return true? If so, why on earth do
>>>>>>> you *need* H1? Why bring it up at all?
>>>>>>>
>>>>>>
>>>>>> H(P,P) correctly determines that its input never reaches its final
>>>>>> state whether or not H aborts the simulation of this input.
>>>>>>
>>>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>>>
>>>>> They have the *same* input. Therefore they cannot both be correct
>>>>> unless they give the same answer. You can't have one of them claim
>>>>> that P(P) never reaches its final state and the other say that P(P)
>>>>> does reach its final state *and* claim they are both correct.
>>>>>
>>>>> That's Trump Logic.
>>>>>
>>>>> André
>>>>>
>>>>>
>>>>
>>>> You have to wait until finish converting functions H1 and H to pure
>>>> functions. They do derive this result now yet it is possible that
>>>> this result is an artifact of their requirement of static local data
>>>> to derive these results.
>>>
>>> Or some other form of cheating such as a function taking its own
>>> address, and varying its processing according to that address.
>>>
>>> (I suggested this was all that was going on a couple of weeks ago,
>>> but you neither confirmed nor denied that. Almost as though you
>>> actually don't understand /yourself/ what's going on. (Surely that
>>> cannot be...!))
>>
>> I don't reply to nonsense.
>>
>>
>>>>
>>>> If it works out like preliminary analysis indicates a pair of
>>>> functions with identical machine code and identical inputs really do
>>>> have different output because the input to H(P,P) calls H and the
>>>> input to H1(P,P) calls H (thus does not call H1).
>>>
>>> Of course an /unrestricted/ x86 program can do that - all it has to
>>> do is look at its own address and behave differently according to
>>> that address. (Like your H/H1 routines.) Or cheat with global
>>> variables etc..
>>>
>>
>> The halting theorem counter-examples present infinitely nested
>> simulation (non-halting) behavior to every simulating halt decider.
>>
>> When the input P to a simulating halt decider H1 does not call this
>> same decider and instead calls another different decider H, then
>> infinitely nested simulation is not specified for H1(P,P) as it is for
>> H(P,P).
>>
>>> If you are concerned with saying things of relevance to TMs and
>>> Linz's proof, you need to limit your C code to doing things that
>>> directly correspond with what TMs can do.
>>
>> Yes that was my biggest challenge. I didn't even know the criteria for
>> that even though Kaz gave me this criteria months ago. After carefully
>> checking and double checking this criteria seems sufficient:
>>
>> In computer programming, a pure function is a function that has the
>> following properties:[1][2]
>>
>> (1) The function return values are identical for identical arguments
>> (no variation with local static variables, non-local variables,
>> mutable reference arguments or input streams).
>>
>> (2) The function application has no side effects (no mutation of local
>> static variables, non-local variables, mutable reference arguments or
>> input/output streams).
>> https://en.wikipedia.org/wiki/Pure_function
>
> And maybe you also should also be adhering to:
>
> (3) The function does not take its own address and use that as a basis
> to modify its processing.
>
> I mean, you say "after careful checking this criteria seems sufficient:
> ...", but we all know you've not done any such "careful checking" or
> given any serious thought at all to your underlying computing model and
> its relationship to Linz's TM-based proof. Perhaps there are a whole
> host of other restrictions you need to keep things workable? How would
> you know if there were? You can't analyse the situation yourself - and
> you've only settled on "pure functions" because that's what Kaz
> mentioned. [btw, "criteria" is plural]
>
> The Linz proof works because TMs have certain features:
> [PURE]
> - the same TM start state (including tape) always implies exactly
> the same follow-on computation step states, and so properties
> based on those follow-on step states like
> "one of the follow-on step states is a halt state" aka
> "computation halts" are well defined.
> [COMPOSE]
> - it is possible to include one TMs coded algorithm as a sub-part of
> a second machine's coded algorithm, and computations running in
> the second TM from the start of the incoporated "TM coded
> algorithm" will likewise follow exactly the same computation steps
> as for the original TM [given the same tape input, of course], and
> so produce the same final result.
>
> (COMPOSE is my name for the second feature...)
>
> The COMPOSE feature is what supports Linz's use of a (modified) copy of
> H incorporated into his derived H^. For a given input, his
> H_Incoporated within H^ is guaranteed to track exactly the same
> calculation steps as the H TM with that same input, and so is guaranteed
> to arrive at the same qn/qy state as the original H. That is quite
> trivial, and would be understood by anyone with a basic understanding of
> TMs.
>
> So your H/H1 give different answers for the same input, yet have "the
> same machine code" - what does this imply? One way of looking at it
> would be to say that copying the code within your computation model
> doesn't satisfy COMPOSE. I think Andy would take that position, and
> it's ok but I think not very useful for someone trying to write x86 code
> as a more convenient (but broadly equivalent) alternative to discussing
> TM-based proofs directly. If this is to be the way of looking at it,
> then /what actually is/ the right way of copying an algorithm that
> guarantees COMPOSE? Which of your H/H1 is the correct composition for
> the original H machine, and why that one and not the other? Strictly
> speaking, I suspect the answer is /neither/ of them, but this is all way
> too complicated for what you're doing. Don't go there! :)
>
> A better approach (IMO) is to say that the original idea for using C/x86
> was maybe reasonable, but needs some restrictions to ensure basic [PURE]
> and [COMPOSE] features hold. So you say you want to have pure
> functions, which seems reasonable to me because then the correspondence
> between your C code and TMs is more direct, making it easier to discuss
> the Linz (TM) proof in terms of your C code. (I don't think you
> understand those reasons, but hey...)
>
> But for exactly the same reason, you would need to ensure COMPOSE
> feature holds and algorithms are composable, preferably as "equivalent
> code" callable functions, within your system. That fails when a
> function can take its own address and vary its behaviour based on that
> address. The function needs to base all its logic on JUST its input
> arguments.
>
> Just to confirm - that is what you're doing in your H/H1, right? (Like
> I suggested a couple of weeks ago. You still seem to be avoiding this
> question.)
>
> A quick note - I don't see any problem with you using machine addresses
> observed from your emulation traces. After all, your code can control
> the way it emulates, including assigning machine addresses (in effect
> state identifiers) to the code being emulated if required - nothing
> there a TM can't directly do so that wouldn't break the simple
> correspondence you need. The problems come if H/H1 take their /own/
> address and then use that when analysing the trace data they receive.
>
>>
>>> Otherwise the relationship between your computing model and TMs will
>>> become distorted and the conclusions you want to draw from your
>>> program's behaviour to TM behaviour may simply not apply.
>>>
>>> I know that last paragraph is WAAAAAY over your head (computation
>>> models? too abstract!) so you will just ignore it. Or perhaps spray
>>> your "Objection Begone!" Turing-equivalence spray at it, which never
>>> works for you. :)
>>>
>>> Anyway, you need to work out /why/ copying an algorithm can produce
>>> different behaviour in the copy, and STOP DOING IT!! (Just like you
>>> seem to have recognised that non-pure functions are to be avoided.
>>> I'm not sure whether using your own machine code address breaks the
>>> "pure function" rules per se, but the effect on your efforts is the
>>> same so it doesn't really matter.)
>>>
>>>
>>> Mike.
>>
>> My redesign meets all of the above pure function criteria.
>>
>> It really is the case that a pair of pure functions with identical
>> machine code will have different behavior on the same input when this
>> input calls one of these functions in pathological self-reference and
>> not the other. Identical functions, identical input, differing
>> relationships between the functions and their input.
>
> And what do you think that means for your refutation of the Linz proof?
> Linz is about TMs, and in TM-world the TM H, and the embedded (modified)
> copy of H within H^ DO NECESSARILY behave identically for the same input.
>
> If you have concocted some programming environment where that doesn't
> hold, that wouldn't refute Linz - at most it would just mean that the
> Linz proof isn't (directly) applicable for that environment, so you were
> never "refuting" anything to start with. And of course that wouldn't
> mean HP undecidability didn't hold for that environment, just in case
> you're thinking of trying that one! (Proof of HP in that environment
> could probably just use reduction to the HP-for-TMs problem.)
>
> And if it does hold, then the Linz proof is going to work, and H will
> decide (H^,H^) incorrectly like it's been doing for you so far.
>
> Mike.
The whole basis of my rebuttal of the halting problem proofs:
The halting theorem counter-examples present infinitely nested
simulation (non-halting) behavior to every simulating halt decider.
How the simulating halt decider detects that an input is presenting
infinitely nested simulation is merely an implementation detail.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-02 06:58 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ basis of my rebuttal ] |
| Message-ID | <kXW5J.138159$lC6.57886@fx41.iad> |
| In reply to | #40223 |
On 10/1/21 11:42 PM, olcott wrote:
> On 10/1/2021 7:09 PM, Mike Terry wrote:
>> On 01/10/2021 15:36, olcott wrote:
>>> On 10/1/2021 9:12 AM, Mike Terry wrote:
>>>> On 01/10/2021 01:54, olcott wrote:
>>>>> On 9/30/2021 7:39 PM, André G. Isaak wrote:
>>>>>> On 2021-09-30 18:26, olcott wrote:
>>>>>>> On 9/30/2021 7:18 PM, André G. Isaak wrote:
>>>>>>>> On 2021-09-30 17:21, olcott wrote:
>>>>>>>>> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-09-30 16:12, olcott wrote:
>>>>>>>>>>
>>>>>>>>>>> Because of a critique of my work in another forum I have
>>>>>>>>>>> discovered that the halt status that H1(P,P) reports is
>>>>>>>>>>> consistent with the behavior of int main() { P(P); }
>>>>>>>>>>
>>>>>>>>>> But how does this address the Linz proof then? You've derived
>>>>>>>>>> your P from H, not from H1. So all that matter with respect to
>>>>>>>>>> the Linz proof is what *H*(P, P) returns. That some other
>>>>>>>>>> decider H1, from which P is *not* derived, can correctly
>>>>>>>>>> decide P(P) has no bearing on Linz's claim. H1 cannot decide
>>>>>>>>>> P1(P1) where P1 is derived from H1 in the same way that P is
>>>>>>>>>> derived from H.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> H(P,P) is correct and H1(P,P) is correct.
>>>>>>>>
>>>>>>>> So you're saying they both return true? If so, why on earth do
>>>>>>>> you *need* H1? Why bring it up at all?
>>>>>>>>
>>>>>>>
>>>>>>> H(P,P) correctly determines that its input never reaches its
>>>>>>> final state whether or not H aborts the simulation of this input.
>>>>>>>
>>>>>>> H1(P,P) correctly determines that its input reaches its final state.
>>>>>>
>>>>>> They have the *same* input. Therefore they cannot both be correct
>>>>>> unless they give the same answer. You can't have one of them claim
>>>>>> that P(P) never reaches its final state and the other say that
>>>>>> P(P) does reach its final state *and* claim they are both correct.
>>>>>>
>>>>>> That's Trump Logic.
>>>>>>
>>>>>> André
>>>>>>
>>>>>>
>>>>>
>>>>> You have to wait until finish converting functions H1 and H to pure
>>>>> functions. They do derive this result now yet it is possible that
>>>>> this result is an artifact of their requirement of static local
>>>>> data to derive these results.
>>>>
>>>> Or some other form of cheating such as a function taking its own
>>>> address, and varying its processing according to that address.
>>>>
>>>> (I suggested this was all that was going on a couple of weeks ago,
>>>> but you neither confirmed nor denied that. Almost as though you
>>>> actually don't understand /yourself/ what's going on. (Surely that
>>>> cannot be...!))
>>>
>>> I don't reply to nonsense.
>>>
>>>
>>>>>
>>>>> If it works out like preliminary analysis indicates a pair of
>>>>> functions with identical machine code and identical inputs really
>>>>> do have different output because the input to H(P,P) calls H and
>>>>> the input to H1(P,P) calls H (thus does not call H1).
>>>>
>>>> Of course an /unrestricted/ x86 program can do that - all it has to
>>>> do is look at its own address and behave differently according to
>>>> that address. (Like your H/H1 routines.) Or cheat with global
>>>> variables etc..
>>>>
>>>
>>> The halting theorem counter-examples present infinitely nested
>>> simulation (non-halting) behavior to every simulating halt decider.
>>>
>>> When the input P to a simulating halt decider H1 does not call this
>>> same decider and instead calls another different decider H, then
>>> infinitely nested simulation is not specified for H1(P,P) as it is
>>> for H(P,P).
>>>
>>>> If you are concerned with saying things of relevance to TMs and
>>>> Linz's proof, you need to limit your C code to doing things that
>>>> directly correspond with what TMs can do.
>>>
>>> Yes that was my biggest challenge. I didn't even know the criteria
>>> for that even though Kaz gave me this criteria months ago. After
>>> carefully checking and double checking this criteria seems sufficient:
>>>
>>> In computer programming, a pure function is a function that has the
>>> following properties:[1][2]
>>>
>>> (1) The function return values are identical for identical arguments
>>> (no variation with local static variables, non-local variables,
>>> mutable reference arguments or input streams).
>>>
>>> (2) The function application has no side effects (no mutation of
>>> local static variables, non-local variables, mutable reference
>>> arguments or input/output streams).
>>> https://en.wikipedia.org/wiki/Pure_function
>>
>> And maybe you also should also be adhering to:
>>
>> (3) The function does not take its own address and use that as a basis
>> to modify its processing.
>>
>> I mean, you say "after careful checking this criteria seems
>> sufficient: ...", but we all know you've not done any such "careful
>> checking" or given any serious thought at all to your underlying
>> computing model and its relationship to Linz's TM-based proof.
>> Perhaps there are a whole host of other restrictions you need to keep
>> things workable? How would you know if there were? You can't analyse
>> the situation yourself - and you've only settled on "pure functions"
>> because that's what Kaz mentioned. [btw, "criteria" is plural]
>>
>> The Linz proof works because TMs have certain features:
>> [PURE]
>> - the same TM start state (including tape) always implies exactly
>> the same follow-on computation step states, and so properties
>> based on those follow-on step states like
>> "one of the follow-on step states is a halt state" aka
>> "computation halts" are well defined.
>> [COMPOSE]
>> - it is possible to include one TMs coded algorithm as a sub-part of
>> a second machine's coded algorithm, and computations running in
>> the second TM from the start of the incoporated "TM coded
>> algorithm" will likewise follow exactly the same computation steps
>> as for the original TM [given the same tape input, of course], and
>> so produce the same final result.
>>
>> (COMPOSE is my name for the second feature...)
>>
>> The COMPOSE feature is what supports Linz's use of a (modified) copy
>> of H incorporated into his derived H^. For a given input, his
>> H_Incoporated within H^ is guaranteed to track exactly the same
>> calculation steps as the H TM with that same input, and so is
>> guaranteed to arrive at the same qn/qy state as the original H. That
>> is quite trivial, and would be understood by anyone with a basic
>> understanding of TMs.
>>
>> So your H/H1 give different answers for the same input, yet have "the
>> same machine code" - what does this imply? One way of looking at it
>> would be to say that copying the code within your computation model
>> doesn't satisfy COMPOSE. I think Andy would take that position, and
>> it's ok but I think not very useful for someone trying to write x86
>> code as a more convenient (but broadly equivalent) alternative to
>> discussing TM-based proofs directly. If this is to be the way of
>> looking at it, then /what actually is/ the right way of copying an
>> algorithm that guarantees COMPOSE? Which of your H/H1 is the correct
>> composition for the original H machine, and why that one and not the
>> other? Strictly speaking, I suspect the answer is /neither/ of them,
>> but this is all way too complicated for what you're doing. Don't go
>> there! :)
>>
>> A better approach (IMO) is to say that the original idea for using
>> C/x86 was maybe reasonable, but needs some restrictions to ensure
>> basic [PURE] and [COMPOSE] features hold. So you say you want to have
>> pure functions, which seems reasonable to me because then the
>> correspondence between your C code and TMs is more direct, making it
>> easier to discuss the Linz (TM) proof in terms of your C code. (I
>> don't think you understand those reasons, but hey...)
>>
>> But for exactly the same reason, you would need to ensure COMPOSE
>> feature holds and algorithms are composable, preferably as "equivalent
>> code" callable functions, within your system. That fails when a
>> function can take its own address and vary its behaviour based on that
>> address. The function needs to base all its logic on JUST its input
>> arguments.
>>
>> Just to confirm - that is what you're doing in your H/H1, right?
>> (Like I suggested a couple of weeks ago. You still seem to be
>> avoiding this question.)
>>
>> A quick note - I don't see any problem with you using machine
>> addresses observed from your emulation traces. After all, your code
>> can control the way it emulates, including assigning machine addresses
>> (in effect state identifiers) to the code being emulated if required -
>> nothing there a TM can't directly do so that wouldn't break the simple
>> correspondence you need. The problems come if H/H1 take their /own/
>> address and then use that when analysing the trace data they receive.
>>
>>>
>>>> Otherwise the relationship between your computing model and TMs will
>>>> become distorted and the conclusions you want to draw from your
>>>> program's behaviour to TM behaviour may simply not apply.
>>>>
>>>> I know that last paragraph is WAAAAAY over your head (computation
>>>> models? too abstract!) so you will just ignore it. Or perhaps
>>>> spray your "Objection Begone!" Turing-equivalence spray at it, which
>>>> never works for you. :)
>>>>
>>>> Anyway, you need to work out /why/ copying an algorithm can produce
>>>> different behaviour in the copy, and STOP DOING IT!! (Just like you
>>>> seem to have recognised that non-pure functions are to be avoided.
>>>> I'm not sure whether using your own machine code address breaks the
>>>> "pure function" rules per se, but the effect on your efforts is the
>>>> same so it doesn't really matter.)
>>>>
>>>>
>>>> Mike.
>>>
>>> My redesign meets all of the above pure function criteria.
>>>
>>> It really is the case that a pair of pure functions with identical
>>> machine code will have different behavior on the same input when this
>>> input calls one of these functions in pathological self-reference and
>>> not the other. Identical functions, identical input, differing
>>> relationships between the functions and their input.
>>
>> And what do you think that means for your refutation of the Linz
>> proof? Linz is about TMs, and in TM-world the TM H, and the embedded
>> (modified) copy of H within H^ DO NECESSARILY behave identically for
>> the same input.
>>
>> If you have concocted some programming environment where that doesn't
>> hold, that wouldn't refute Linz - at most it would just mean that the
>> Linz proof isn't (directly) applicable for that environment, so you
>> were never "refuting" anything to start with. And of course that
>> wouldn't mean HP undecidability didn't hold for that environment, just
>> in case you're thinking of trying that one! (Proof of HP in that
>> environment could probably just use reduction to the HP-for-TMs problem.)
>>
>> And if it does hold, then the Linz proof is going to work, and H will
>> decide (H^,H^) incorrectly like it's been doing for you so far.
>>
>> Mike.
>
> The whole basis of my rebuttal of the halting problem proofs:
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
>
> How the simulating halt decider detects that an input is presenting
> infinitely nested simulation is merely an implementation detail.
>
Except that ther never actually is any infintly nested simulations if
the decider is able to answer the question. If the decider aborts the
simulation after N cycles based on whatever rules it uses, it turns out
that the actual machine will stop after N+1 cycles, because ITS copy of
H will stop after it does N cycles.
If this doesn't happen, then H wasn't a computation.
H gets the wrong answer because it was assuming that all deciders it was
looking at were not going to stop their simulations, but they will, if
it does.
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-10-01 17:27 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj7csq$1aje$1@gioia.aioe.org> |
| In reply to | #40157 |
On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
> Of course an /unrestricted/ x86 program can do that [...]
> If you are concerned with saying things of relevance to TMs and
> Linz's proof, you need to limit your C code to doing things that
> directly correspond with what TMs can do. [...]
I think it is misleading to talk about what TMs can do as
thought they are interestingly different from what x86 programs or
any real computer can do. An x86 computer /is/ a FSM with extra
storage; in other words, a TM. We tend to write rather simple
TMs to illustrate points, but there is no reason why it should
not have 2^N states, where N is rather large [the number of bits
in your computer]. "Taking the address of a function" is not
"difficult" with a TM, just rather tedious.
There is no reason why someone [I'm not volunteering!]
should not write a C compiler the target of which is recognisably
a TM. It's just going to be rather complicated. [Probably easier,
AAMOF, to write a microcode as a TM, and describe real computers
in terms of that microcode. In the 1930s, that would have seemed
like magic, but it is how many/most modern computers work.]
That's why I think people are barking up the wrong tree
when complaining that PO writes C code that is "not a function".
It doesn't matter. It just means that the "hat" construction
is more complicated than PO claims, inc all the states [etc] of
the FSM, inc "hidden" variables. The real errors lie elsewhere.
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Balakirev
[toc] | [prev] | [next] | [standalone]
Page 2 of 17 — ← Prev page 1 [2] 3 4 … 17 Next page →
Back to top | Article view | comp.theory
csiph-web