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 4 of 17 — ← Prev page 1 2 3 [4] 5 6 … 17 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-29 06:26 -0400 |
| Message-ID | <BbX4J.56427$6U3.19973@fx43.iad> |
| In reply to | #40066 |
On 9/28/21 11:20 PM, olcott wrote: > The halting theorem counter-examples present infinitely nested > simulation (non-halting) behavior to every simulating halt decider. > > -----1-----------2--3---------- > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > > If the simulation of the 2nd ⟨Ĥ⟩ applied to > the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. > > > -----1-----------2--3---------- > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > If the simulation of the 2nd ⟨Ĥ⟩ applied to > the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. > > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > The Halting Problem NEVER says 'If the Simulation of ...' It ALWAYS talks about the behavior of the machine whose representation is given as the input. The fact you CHANGE this shows you are working on the wrong problem. In the version you quote it says: In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Let us look closely at this statement. What is the object of the problem? determining whether the program will finish running or continue to run forever. Thus, the problem is about the PROGRAM (i.e. the actual machine) not the representation. Yes, there is the phrase "from a description of an arbitrary computer program and an input" which gives us details of how this program is specified. It does NOT mean that we are being asked a question about properties of this description. The description is the MEANS of determining the answer, not the GOAL. It seems you fail elementary English. Try Again.
[toc] | [prev] | [next] | [standalone]
| From | wij <wyniijj@gmail.com> |
|---|---|
| Date | 2021-10-01 09:12 -0700 |
| Message-ID | <2436d983-22f8-4555-9a9f-1e9fb3044e9fn@googlegroups.com> |
| In reply to | #40066 |
On Wednesday, 29 September 2021 at 11:20:35 UTC+8, olcott wrote: > The halting theorem counter-examples present infinitely nested > simulation (non-halting) behavior to every simulating halt decider. > > -----1-----------2--3---------- > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > > If the simulation of the 2nd ⟨Ĥ⟩ applied to > the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. > > > -----1-----------2--3---------- > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > If the simulation of the 2nd ⟨Ĥ⟩ applied to > the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. > > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation Apparently, you are trying to solve an undecidable problem: GUR https://groups.google.com/g/comp.theory/c/_tbCYyMox9M Your proof is essentially several lines of "C" program, nothing to do with TM or the traditional Halting Problem. The key basis of your refutation is a refutation to your own conception that no one care. You were denying some part of yourself, not the HP. I find the key essence is that your relevant knowledge is very weak, you read text books but not doing exercises. Do exercises in the text books of C,Assembly or Computation theory you read. That would take much lesser time than 7 years (rumor sayed that you have been working on that several lines of C codes for probably more than 7 years!). > > > -- > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 11:46 -0500 |
| Message-ID | <9f6dnVe1rdbIpsr8nZ2dnUU7-avNnZ2d@giganews.com> |
| In reply to | #40165 |
On 10/1/2021 11:12 AM, wij wrote: > On Wednesday, 29 September 2021 at 11:20:35 UTC+8, olcott wrote: >> The halting theorem counter-examples present infinitely nested >> simulation (non-halting) behavior to every simulating halt decider. >> >> -----1-----------2--3---------- >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >> >> If the simulation of the 2nd ⟨Ĥ⟩ applied to >> the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. >> >> >> -----1-----------2--3---------- >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> >> If the simulation of the 2nd ⟨Ĥ⟩ applied to >> the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. >> >> >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > Apparently, you are trying to solve an undecidable problem: > GUR https://groups.google.com/g/comp.theory/c/_tbCYyMox9M > > Your proof is essentially several lines of "C" program, nothing to do with > TM or the traditional Halting Problem. > > The key basis of your refutation is a refutation to your own conception that > no one care. You were denying some part of yourself, not the HP. > > I find the key essence is that your relevant knowledge is very weak, you read > text books but not doing exercises. > Do exercises in the text books of C,Assembly or Computation theory you read. > That would take much lesser time than 7 years (rumor sayed that you have been > working on that several lines of C codes for probably more than 7 years!). It may superficially seem that way. This is the essence of the basis of my refutation: The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. I created the x86utm operating system so that every single detail of theory of computation problems can be analyzed at the much higher level of abstraction of the C/x86 languages. Without this much higher level abstraction key elements of the HP proof are essentially validated by hand-waving. https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation A key element that had taken me by complete surprise is that some things that are C/x86 computable are not TM computable. I had previously thought that the Church-Turing thesis confirmed that any and all things that any physically existing computer can do a TM can compute. https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions It seems that no aspect of the definition of [computable function] requires it to be a [pure function], none-the-less most expert opinion seems to indicate that this requirement exists. I am on the verge of reproducing my work such that the simulating partial halt deciders H1 and H are pure functions and take finite string parameters. To conform my C/x86 code to the Linz Ĥ template P will copy its input. 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 -- 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 13:19 -0400 |
| Message-ID | <IqH5J.94131$g81.67757@fx33.iad> |
| In reply to | #40168 |
On 10/1/21 12:46 PM, olcott wrote: > On 10/1/2021 11:12 AM, wij wrote: >> On Wednesday, 29 September 2021 at 11:20:35 UTC+8, olcott wrote: >>> The halting theorem counter-examples present infinitely nested >>> simulation (non-halting) behavior to every simulating halt decider. >>> >>> -----1-----------2--3---------- >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>> >>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>> the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. >>> >>> >>> -----1-----------2--3---------- >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> >>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>> the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. >>> >>> >>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>> >> >> Apparently, you are trying to solve an undecidable problem: >> GUR https://groups.google.com/g/comp.theory/c/_tbCYyMox9M >> >> Your proof is essentially several lines of "C" program, nothing to do >> with >> TM or the traditional Halting Problem. >> >> The key basis of your refutation is a refutation to your own >> conception that >> no one care. You were denying some part of yourself, not the HP. >> >> I find the key essence is that your relevant knowledge is very weak, >> you read >> text books but not doing exercises. >> Do exercises in the text books of C,Assembly or Computation theory you >> read. >> That would take much lesser time than 7 years (rumor sayed that you >> have been >> working on that several lines of C codes for probably more than 7 >> years!). > > It may superficially seem that way. > This is the essence of the basis of my refutation: > > The halting theorem counter-examples present infinitely nested > simulation (non-halting) behavior to every simulating halt decider. WRONG. You just ignore when people point out your error here. > > I created the x86utm operating system so that every single detail of > theory of computation problems can be analyzed at the much higher level > of abstraction of the C/x86 languages. Without this much higher level > abstraction key elements of the HP proof are essentially validated by > hand-waving. > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > A key element that had taken me by complete surprise is that some things > that are C/x86 computable are not TM computable. I had previously > thought that the Church-Turing thesis confirmed that any and all things > that any physically existing computer can do a TM can compute. > > You are just using the wrong definition of 'Computable'. > > https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions > > > It seems that no aspect of the definition of [computable function] > requires it to be a [pure function], none-the-less most expert opinion > seems to indicate that this requirement exists. I am on the verge of > reproducing my work such that the simulating partial halt deciders H1 > and H are pure functions and take finite string parameters. To conform > my C/x86 code to the Linz Ĥ template P will copy its input. > > > 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 And as I just explance elsewhere, Pure Function is NOT an identical concept to a Computation. A Pure Function might not meet ALL the requirements of a Computation. > > >>> >>> -- >>> Copyright 2021 Pete Olcott >>> >>> "Great spirits have always encountered violent opposition from mediocre >>> minds." Einstein > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 12:41 -0500 |
| Message-ID | <1qmdnWxwZob91cr8nZ2dnUU7-LXNnZ2d@giganews.com> |
| In reply to | #40174 |
On 10/1/2021 12:19 PM, Richard Damon wrote: > On 10/1/21 12:46 PM, olcott wrote: >> On 10/1/2021 11:12 AM, wij wrote: >>> On Wednesday, 29 September 2021 at 11:20:35 UTC+8, olcott wrote: >>>> The halting theorem counter-examples present infinitely nested >>>> simulation (non-halting) behavior to every simulating halt decider. >>>> >>>> -----1-----------2--3---------- >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>> >>>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>>> the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. >>>> >>>> >>>> -----1-----------2--3---------- >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>> >>>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>>> the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. >>>> >>>> >>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>> >>> >>> Apparently, you are trying to solve an undecidable problem: >>> GUR https://groups.google.com/g/comp.theory/c/_tbCYyMox9M >>> >>> Your proof is essentially several lines of "C" program, nothing to do >>> with >>> TM or the traditional Halting Problem. >>> >>> The key basis of your refutation is a refutation to your own >>> conception that >>> no one care. You were denying some part of yourself, not the HP. >>> >>> I find the key essence is that your relevant knowledge is very weak, >>> you read >>> text books but not doing exercises. >>> Do exercises in the text books of C,Assembly or Computation theory you >>> read. >>> That would take much lesser time than 7 years (rumor sayed that you >>> have been >>> working on that several lines of C codes for probably more than 7 >>> years!). >> >> It may superficially seem that way. >> This is the essence of the basis of my refutation: >> >> The halting theorem counter-examples present infinitely nested >> simulation (non-halting) behavior to every simulating halt decider. > > WRONG. You just ignore when people point out your error here. People merely point out their own confusion with what I am saying. 1----2-----3-----4--5-----6 Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn Ben perpetually pointed out his confusion between (3) applied to (4) (5) and (1) applied to (2) until I numbered the elements making it impossible to misunderstand. The input to Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) never reaches its final state whether or not the simulating halt decider at Ĥ.qx aborts its simulation. This conclusively proves that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn is correct. All of the rebuttals were mere confused double-talk that never directly addressed any of these points. > >> >> I created the x86utm operating system so that every single detail of >> theory of computation problems can be analyzed at the much higher level >> of abstraction of the C/x86 languages. Without this much higher level >> abstraction key elements of the HP proof are essentially validated by >> hand-waving. >> >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> >> >> A key element that had taken me by complete surprise is that some things >> that are C/x86 computable are not TM computable. I had previously >> thought that the Church-Turing thesis confirmed that any and all things >> that any physically existing computer can do a TM can compute. >> >> > > You are just using the wrong definition of 'Computable'. > >> >> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions >> >> >> It seems that no aspect of the definition of [computable function] >> requires it to be a [pure function], none-the-less most expert opinion >> seems to indicate that this requirement exists. I am on the verge of >> reproducing my work such that the simulating partial halt deciders H1 >> and H are pure functions and take finite string parameters. To conform >> my C/x86 code to the Linz Ĥ template P will copy its input. >> >> >> 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 > > And as I just explance elsewhere, Pure Function is NOT an identical > concept to a Computation. > > A Pure Function might not meet ALL the requirements of a Computation. Since you don't actually care about the truth and only seek to win an argument I am sure that you will rule that whatever I come up with will be ruled as insufficient. >> >> >>>> >>>> -- >>>> Copyright 2021 Pete Olcott >>>> >>>> "Great spirits have always encountered violent opposition from mediocre >>>> minds." Einstein >> >> > -- 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 16:34 -0400 |
| Message-ID | <0hK5J.151950$Kv2.14722@fx47.iad> |
| In reply to | #40177 |
On 10/1/21 1:41 PM, olcott wrote: > On 10/1/2021 12:19 PM, Richard Damon wrote: >> On 10/1/21 12:46 PM, olcott wrote: >>> On 10/1/2021 11:12 AM, wij wrote: >>>> On Wednesday, 29 September 2021 at 11:20:35 UTC+8, olcott wrote: >>>>> The halting theorem counter-examples present infinitely nested >>>>> simulation (non-halting) behavior to every simulating halt decider. >>>>> >>>>> -----1-----------2--3---------- >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>> >>>>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>>>> the 3rd ⟨Ĥ⟩ at Ĥ.qx reaches its final state. >>>>> >>>>> >>>>> -----1-----------2--3---------- >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> If the simulation of the 2nd ⟨Ĥ⟩ applied to >>>>> the 3rd ⟨Ĥ⟩ at Ĥ.qx never reaches its final state. >>>>> >>>>> >>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>>> >>>>> >>>> >>>> Apparently, you are trying to solve an undecidable problem: >>>> GUR https://groups.google.com/g/comp.theory/c/_tbCYyMox9M >>>> >>>> Your proof is essentially several lines of "C" program, nothing to do >>>> with >>>> TM or the traditional Halting Problem. >>>> >>>> The key basis of your refutation is a refutation to your own >>>> conception that >>>> no one care. You were denying some part of yourself, not the HP. >>>> >>>> I find the key essence is that your relevant knowledge is very weak, >>>> you read >>>> text books but not doing exercises. >>>> Do exercises in the text books of C,Assembly or Computation theory you >>>> read. >>>> That would take much lesser time than 7 years (rumor sayed that you >>>> have been >>>> working on that several lines of C codes for probably more than 7 >>>> years!). >>> >>> It may superficially seem that way. >>> This is the essence of the basis of my refutation: >>> >>> The halting theorem counter-examples present infinitely nested >>> simulation (non-halting) behavior to every simulating halt decider. >> >> WRONG. You just ignore when people point out your error here. > > People merely point out their own confusion with what I am saying. > > 1----2-----3-----4--5-----6 > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > Ben perpetually pointed out his confusion between (3) applied to (4) (5) > and (1) applied to (2) until I numbered the elements making it > impossible to misunderstand. (3) applied to (4) (5) is the (copy of the) decider. It going to H^.qn says that H has decider that its input, <H^> <H^> is the representation of a non-halting computation. That input, is the representation of the machine of (1) applied to (2), aka H^(<H^>), which by this trace ends up at H^.qn which is a Halting state, so we have that H^(<H^>) is a Halting Computation. Thus H was WRONG about what 'its input' represents (mislabeled as does). > > The input to Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) never reaches its final state whether or not > the simulating halt decider at Ĥ.qx aborts its simulation. > This conclusively proves that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn is correct. You did it again. INPUTS DON'T DO ANYTHING. The machine represented by the input H^(<H^>) DOES reach its terminal state. Your confusion is you keep thinking of the partial simulation done by H of this input, NOBODY (except you) cares what that partial simulation does. The Halting Problem is about the actual machine and its actual behavior. > > All of the rebuttals were mere confused double-talk that never directly > addressed any of these points. Please point to the double talk above (other than YOUR double talk of misusing the term 'input' as if it has its own behavior.)
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 21:44 +0100 |
| Message-ID | <871r54jwzc.fsf@bsb.me.uk> |
| In reply to | #40177 |
Oh dear, you've posted about TMs again... olcott <NoOne@NoWhere.com> writes: > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn And the correct annotation for this line is "if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt". But in that case, Ĥ applied ⟨Ĥ⟩ clearly does halt -- in state Ĥ.qn. No decider, of any sort, can satisfy this part Linz's specification. PO always leaves the annotations off, or replaces them with his own made-up ones. There no other way to avoid the obvious conclusion. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 15:58 -0500 |
| Message-ID | <quGdnaHlLvQU68r8nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #40194 |
On 10/1/2021 3:44 PM, Ben Bacarisse wrote: > Oh dear, you've posted about TMs again... > > olcott <NoOne@NoWhere.com> writes: > ---1----2-----3-----4--5-----6 >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > And the correct annotation for this line is "if (and only if) Ĥ applied > to ⟨Ĥ⟩ does not halt". Flat out totally incorrect. Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its final state whether or not Ĥ.qx aborts this simulation therefore the transition of Ĥ.qx to Ĥ.qn is correct. AKA the simulation of (4) applied to (5) by (3) does not halt. I have explained all of the details of this a dozen times in the last day and you simply ignore it rather than directly address it point-by-point because you know that I am correct. > But in that case, Ĥ applied ⟨Ĥ⟩ clearly does > halt -- in state Ĥ.qn. No decider, of any sort, can satisfy this part > Linz's specification. > > PO always leaves the annotations off, or replaces them with his own > made-up ones. There no other way to avoid the obvious conclusion. > -- 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 17:18 -0400 |
| Message-ID | <ZWK5J.65766$ol1.25092@fx42.iad> |
| In reply to | #40199 |
On 10/1/21 4:58 PM, olcott wrote: > On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >> Oh dear, you've posted about TMs again... >> >> olcott <NoOne@NoWhere.com> writes: >> > ---1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> >> And the correct annotation for this line is "if (and only if) Ĥ applied >> to ⟨Ĥ⟩ does not halt". > > Flat out totally incorrect. > > Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its > final state whether or not Ĥ.qx aborts this simulation therefore the > transition of Ĥ.qx to Ĥ.qn is correct. > > AKA the simulation of (4) applied to (5) by (3) does not halt. > > I have explained all of the details of this a dozen times in the last > day and you simply ignore it rather than directly address it > point-by-point because you know that I am correct. > > That may be the details of what happens, but Ben was quoting the REQUIREMENT that are on the behavior or H. You know, how H is supposed to behave for it to be determined that it is doing what it is supposed to. Requirements are a fundamental part of Software Engineering, so you should understand them. For H to meet is requirements, H is supposed to go to qn if and only if the computation which is represented in the input to H is a non-halting computation. Since that input is (1) applied to (2) i.e. H^(<H^>) and that computation reached the state H^.qn which is a Halting State, then the Computation represented by the input to H (as in (3) applied to (4) (5)) is thus shown to be halting, so the decider H (and its copy at H^.qx) should have gone to the qy state. But of course if it did, H^ will go to the loop at qy -> qa <-> qb and not halt and it would have also been wrong, and in that case it should have gone to qn. That is the basic of the Linz proof. Which ever state H goes to will make the H^ machine do the opposite, and so H will be wrong. This construction is totally legal by the rules of Turing Machines, and is one thing that proves that you concept of Truth must be Provable doesn't work in this area of logic. If you want to hole to that. maybe you need to abandon all use of mathematics beyond the most trivial stuff, and the use of things like computers, as they can't exist in a world where the only thing that is True is what is provable. >> But in that case, Ĥ applied ⟨Ĥ⟩ clearly does >> halt -- in state Ĥ.qn. No decider, of any sort, can satisfy this part >> Linz's specification. >> >> PO always leaves the annotations off, or replaces them with his own >> made-up ones. There no other way to avoid the obvious conclusion. >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 16:28 -0500 |
| Message-ID | <29adnVCuHp754Mr8nZ2dnUU7-b-dnZ2d@giganews.com> |
| In reply to | #40200 |
On 10/1/2021 4:18 PM, Richard Damon wrote: > On 10/1/21 4:58 PM, olcott wrote: >> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>> Oh dear, you've posted about TMs again... >>> >>> olcott <NoOne@NoWhere.com> writes: >>> >> ---1----2-----3-----4--5-----6 >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> >>> And the correct annotation for this line is "if (and only if) Ĥ applied >>> to ⟨Ĥ⟩ does not halt". >> >> Flat out totally incorrect. >> >> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >> final state whether or not Ĥ.qx aborts this simulation therefore the >> transition of Ĥ.qx to Ĥ.qn is correct. >> >> AKA the simulation of (4) applied to (5) by (3) does not halt. >> >> I have explained all of the details of this a dozen times in the last >> day and you simply ignore it rather than directly address it >> point-by-point because you know that I am correct. >> >> > > That may be the details of what happens, but Ben was quoting the > REQUIREMENT that are on the behavior or H. You know, how H is supposed The reason why I quit responding to most of your posts is terribly careless mistakes like that. None of the above ever mentions H. -- 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 17:58 -0400 |
| Message-ID | <EwL5J.22849$4X4.20741@fx27.iad> |
| In reply to | #40201 |
On 10/1/21 5:28 PM, olcott wrote: > On 10/1/2021 4:18 PM, Richard Damon wrote: >> On 10/1/21 4:58 PM, olcott wrote: >>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>> Oh dear, you've posted about TMs again... >>>> >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>> ---1----2-----3-----4--5-----6 >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>> >>>> And the correct annotation for this line is "if (and only if) Ĥ applied >>>> to ⟨Ĥ⟩ does not halt". >>> >>> Flat out totally incorrect. >>> >>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>> final state whether or not Ĥ.qx aborts this simulation therefore the >>> transition of Ĥ.qx to Ĥ.qn is correct. >>> >>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>> >>> I have explained all of the details of this a dozen times in the last >>> day and you simply ignore it rather than directly address it >>> point-by-point because you know that I am correct. >>> >>> >> >> That may be the details of what happens, but Ben was quoting the >> REQUIREMENT that are on the behavior or H. You know, how H is supposed > > The reason why I quit responding to most of your posts is terribly > careless mistakes like that. None of the above ever mentions H. > > Never the less, H is still there as H^.qx is a copy of H, so will act like H will act. If you don't understand requirement flow down, maybe you shouldn't consider yourself qualified to be a programmer. Note there is no machine with an actual name of H^.qx, that is a state within the larger machine H^. We don't talk about behavior of 'states' of a Turing Machine (except talking about individual steps). We only talk about actual Turing Machines, or the extracted sub-machines taken out of a machihe. The machine that represents the sub-machine at H^.qx IS H, so calling it H is appropriate. All statements need to be taken in context, and the context of the above trace line has the definition of H in view. The requirement is and always was, a requirement on the machine H, so that is what should be stated. To do otherwise is just a dishonest dodge. yes, maybe I could have said the requirements on H which are copied to H^.qx, but that is just being needlessly wordy as everyone should know that H^.qx is where H was copied to.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 18:00 -0400 |
| Message-ID | <UxL5J.22850$4X4.4460@fx27.iad> |
| In reply to | #40202 |
On 10/1/21 5:58 PM, Richard Damon wrote: > On 10/1/21 5:28 PM, olcott wrote: >> On 10/1/2021 4:18 PM, Richard Damon wrote: >>> On 10/1/21 4:58 PM, olcott wrote: >>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>> Oh dear, you've posted about TMs again... >>>>> >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>> ---1----2-----3-----4--5-----6 >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> And the correct annotation for this line is "if (and only if) Ĥ applied >>>>> to ⟨Ĥ⟩ does not halt". >>>> >>>> Flat out totally incorrect. >>>> >>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>> >>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>> >>>> I have explained all of the details of this a dozen times in the last >>>> day and you simply ignore it rather than directly address it >>>> point-by-point because you know that I am correct. >>>> >>>> >>> >>> That may be the details of what happens, but Ben was quoting the >>> REQUIREMENT that are on the behavior or H. You know, how H is supposed >> >> The reason why I quit responding to most of your posts is terribly >> careless mistakes like that. None of the above ever mentions H. >> >> > > Never the less, H is still there as H^.qx is a copy of H, so will act > like H will act. > > If you don't understand requirement flow down, maybe you shouldn't > consider yourself qualified to be a programmer. > > Note there is no machine with an actual name of H^.qx, that is a state > within the larger machine H^. We don't talk about behavior of 'states' > of a Turing Machine (except talking about individual steps). > > We only talk about actual Turing Machines, or the extracted sub-machines > taken out of a machihe. > > The machine that represents the sub-machine at H^.qx IS H, so calling it > H is appropriate. > > All statements need to be taken in context, and the context of the above > trace line has the definition of H in view. > > The requirement is and always was, a requirement on the machine H, so > that is what should be stated. > > To do otherwise is just a dishonest dodge. > > yes, maybe I could have said the requirements on H which are copied to > H^.qx, but that is just being needlessly wordy as everyone should know > that H^.qx is where H was copied to. > > Maybe my fault is I assume people have a reasonable amount of intelligence, and I forget how DUMB you are on some things.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 17:21 -0500 |
| Message-ID | <3KGdnS_P4YGcF8r8nZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #40203 |
On 10/1/2021 5:00 PM, Richard Damon wrote: > On 10/1/21 5:58 PM, Richard Damon wrote: >> On 10/1/21 5:28 PM, olcott wrote: >>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>> On 10/1/21 4:58 PM, olcott wrote: >>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>> Oh dear, you've posted about TMs again... >>>>>> >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>> ---1----2-----3-----4--5-----6 >>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>> >>>>>> And the correct annotation for this line is "if (and only if) Ĥ applied >>>>>> to ⟨Ĥ⟩ does not halt". >>>>> >>>>> Flat out totally incorrect. >>>>> >>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>> >>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>> >>>>> I have explained all of the details of this a dozen times in the last >>>>> day and you simply ignore it rather than directly address it >>>>> point-by-point because you know that I am correct. >>>>> >>>>> >>>> >>>> That may be the details of what happens, but Ben was quoting the >>>> REQUIREMENT that are on the behavior or H. You know, how H is supposed >>> >>> The reason why I quit responding to most of your posts is terribly >>> careless mistakes like that. None of the above ever mentions H. >>> >>> >> >> Never the less, H is still there as H^.qx is a copy of H, so will act >> like H will act. >> >> If you don't understand requirement flow down, maybe you shouldn't >> consider yourself qualified to be a programmer. >> >> Note there is no machine with an actual name of H^.qx, that is a state >> within the larger machine H^. We don't talk about behavior of 'states' >> of a Turing Machine (except talking about individual steps). >> >> We only talk about actual Turing Machines, or the extracted sub-machines >> taken out of a machihe. >> >> The machine that represents the sub-machine at H^.qx IS H, so calling it >> H is appropriate. >> >> All statements need to be taken in context, and the context of the above >> trace line has the definition of H in view. >> >> The requirement is and always was, a requirement on the machine H, so >> that is what should be stated. >> >> To do otherwise is just a dishonest dodge. >> >> yes, maybe I could have said the requirements on H which are copied to >> H^.qx, but that is just being needlessly wordy as everyone should know >> that H^.qx is where H was copied to. >> >> > > > Maybe my fault is I assume people have a reasonable amount of > intelligence, and I forget how DUMB you are on some things. > Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without contradiction. This becomes impossible to understand if you can't even keep track of the fact that H and Ĥ are not the same machine. -- 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 18:34 -0400 |
| Message-ID | <U1M5J.8810$fZ.2269@fx06.iad> |
| In reply to | #40206 |
On 10/1/21 6:21 PM, olcott wrote: > On 10/1/2021 5:00 PM, Richard Damon wrote: >> On 10/1/21 5:58 PM, Richard Damon wrote: >>> On 10/1/21 5:28 PM, olcott wrote: >>>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>>> On 10/1/21 4:58 PM, olcott wrote: >>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>> Oh dear, you've posted about TMs again... >>>>>>> >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>> ---1----2-----3-----4--5-----6 >>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>> >>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>> applied >>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>> >>>>>> Flat out totally incorrect. >>>>>> >>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>> >>>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>>> >>>>>> I have explained all of the details of this a dozen times in the last >>>>>> day and you simply ignore it rather than directly address it >>>>>> point-by-point because you know that I am correct. >>>>>> >>>>>> >>>>> >>>>> That may be the details of what happens, but Ben was quoting the >>>>> REQUIREMENT that are on the behavior or H. You know, how H is supposed >>>> >>>> The reason why I quit responding to most of your posts is terribly >>>> careless mistakes like that. None of the above ever mentions H. >>>> >>>> >>> >>> Never the less, H is still there as H^.qx is a copy of H, so will act >>> like H will act. >>> >>> If you don't understand requirement flow down, maybe you shouldn't >>> consider yourself qualified to be a programmer. >>> >>> Note there is no machine with an actual name of H^.qx, that is a state >>> within the larger machine H^. We don't talk about behavior of 'states' >>> of a Turing Machine (except talking about individual steps). >>> >>> We only talk about actual Turing Machines, or the extracted sub-machines >>> taken out of a machihe. >>> >>> The machine that represents the sub-machine at H^.qx IS H, so calling it >>> H is appropriate. >>> >>> All statements need to be taken in context, and the context of the above >>> trace line has the definition of H in view. >>> >>> The requirement is and always was, a requirement on the machine H, so >>> that is what should be stated. >>> >>> To do otherwise is just a dishonest dodge. >>> >>> yes, maybe I could have said the requirements on H which are copied to >>> H^.qx, but that is just being needlessly wordy as everyone should know >>> that H^.qx is where H was copied to. >>> >>> >> >> >> Maybe my fault is I assume people have a reasonable amount of >> intelligence, and I forget how DUMB you are on some things. >> > > Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from > H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without > contradiction. > > This becomes impossible to understand if you can't even keep track of > the fact that H and Ĥ are not the same machine. > If H applied to <H^> <H^> is a different computation than H^.qx applied to <H^> <H^? then you built H^ wrong, as the REQUIREMENT to building H^ was to place a copy of H there (with some very minor modifications that do not affact this path). So yes, H and H^ are different machines, but a copy of H is a sub-machine within H^. If you DID follow the instructions, but the results was a 'different computation' than all that shows is that H wasn't a computation in the first place. FAIL. You have just shown that your setup fails to meet the basic requirements of the proof you are working on. Maybe you just don't understand what you are trying to do?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 17:46 -0500 |
| Message-ID | <tPednVDe2IpYEsr8nZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #40210 |
On 10/1/2021 5:34 PM, Richard Damon wrote: > > On 10/1/21 6:21 PM, olcott wrote: >> On 10/1/2021 5:00 PM, Richard Damon wrote: >>> On 10/1/21 5:58 PM, Richard Damon wrote: >>>> On 10/1/21 5:28 PM, olcott wrote: >>>>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>>>> On 10/1/21 4:58 PM, olcott wrote: >>>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>>> Oh dear, you've posted about TMs again... >>>>>>>> >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>> >>>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>>> applied >>>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>>> >>>>>>> Flat out totally incorrect. >>>>>>> >>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>>> >>>>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>>>> >>>>>>> I have explained all of the details of this a dozen times in the last >>>>>>> day and you simply ignore it rather than directly address it >>>>>>> point-by-point because you know that I am correct. >>>>>>> >>>>>>> >>>>>> >>>>>> That may be the details of what happens, but Ben was quoting the >>>>>> REQUIREMENT that are on the behavior or H. You know, how H is supposed >>>>> >>>>> The reason why I quit responding to most of your posts is terribly >>>>> careless mistakes like that. None of the above ever mentions H. >>>>> >>>>> >>>> >>>> Never the less, H is still there as H^.qx is a copy of H, so will act >>>> like H will act. >>>> >>>> If you don't understand requirement flow down, maybe you shouldn't >>>> consider yourself qualified to be a programmer. >>>> >>>> Note there is no machine with an actual name of H^.qx, that is a state >>>> within the larger machine H^. We don't talk about behavior of 'states' >>>> of a Turing Machine (except talking about individual steps). >>>> >>>> We only talk about actual Turing Machines, or the extracted sub-machines >>>> taken out of a machihe. >>>> >>>> The machine that represents the sub-machine at H^.qx IS H, so calling it >>>> H is appropriate. >>>> >>>> All statements need to be taken in context, and the context of the above >>>> trace line has the definition of H in view. >>>> >>>> The requirement is and always was, a requirement on the machine H, so >>>> that is what should be stated. >>>> >>>> To do otherwise is just a dishonest dodge. >>>> >>>> yes, maybe I could have said the requirements on H which are copied to >>>> H^.qx, but that is just being needlessly wordy as everyone should know >>>> that H^.qx is where H was copied to. >>>> >>>> >>> >>> >>> Maybe my fault is I assume people have a reasonable amount of >>> intelligence, and I forget how DUMB you are on some things. >>> >> >> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from >> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without >> contradiction. >> >> This becomes impossible to understand if you can't even keep track of >> the fact that H and Ĥ are not the same machine. >> > > If H applied to <H^> <H^> is a different computation than H^.qx applied > to <H^> <H^? then you built H^ wrong, This is where the subject matter becomes too difficult for most people to understand. I could not understand it myself until I saw that this is what the code does. Even after I saw that this is what the code does it took me three days of very careful analysis to see why the code does this. Until you see that the code is correct you will not be able to accept this. -- 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 19:04 -0400 |
| Message-ID | <xuM5J.19771$_n1.1046@fx14.iad> |
| In reply to | #40212 |
On 10/1/21 6:46 PM, olcott wrote: > On 10/1/2021 5:34 PM, Richard Damon wrote: >> >> On 10/1/21 6:21 PM, olcott wrote: >>> On 10/1/2021 5:00 PM, Richard Damon wrote: >>>> On 10/1/21 5:58 PM, Richard Damon wrote: >>>>> On 10/1/21 5:28 PM, olcott wrote: >>>>>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>>>>> On 10/1/21 4:58 PM, olcott wrote: >>>>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>>>> Oh dear, you've posted about TMs again... >>>>>>>>> >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>>> >>>>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>>>> applied >>>>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>>>> >>>>>>>> Flat out totally incorrect. >>>>>>>> >>>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches >>>>>>>> its >>>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore >>>>>>>> the >>>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>>>> >>>>>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>>>>> >>>>>>>> I have explained all of the details of this a dozen times in the >>>>>>>> last >>>>>>>> day and you simply ignore it rather than directly address it >>>>>>>> point-by-point because you know that I am correct. >>>>>>>> >>>>>>>> >>>>>>> >>>>>>> That may be the details of what happens, but Ben was quoting the >>>>>>> REQUIREMENT that are on the behavior or H. You know, how H is >>>>>>> supposed >>>>>> >>>>>> The reason why I quit responding to most of your posts is terribly >>>>>> careless mistakes like that. None of the above ever mentions H. >>>>>> >>>>>> >>>>> >>>>> Never the less, H is still there as H^.qx is a copy of H, so will act >>>>> like H will act. >>>>> >>>>> If you don't understand requirement flow down, maybe you shouldn't >>>>> consider yourself qualified to be a programmer. >>>>> >>>>> Note there is no machine with an actual name of H^.qx, that is a state >>>>> within the larger machine H^. We don't talk about behavior of 'states' >>>>> of a Turing Machine (except talking about individual steps). >>>>> >>>>> We only talk about actual Turing Machines, or the extracted >>>>> sub-machines >>>>> taken out of a machihe. >>>>> >>>>> The machine that represents the sub-machine at H^.qx IS H, so >>>>> calling it >>>>> H is appropriate. >>>>> >>>>> All statements need to be taken in context, and the context of the >>>>> above >>>>> trace line has the definition of H in view. >>>>> >>>>> The requirement is and always was, a requirement on the machine H, so >>>>> that is what should be stated. >>>>> >>>>> To do otherwise is just a dishonest dodge. >>>>> >>>>> yes, maybe I could have said the requirements on H which are copied to >>>>> H^.qx, but that is just being needlessly wordy as everyone should know >>>>> that H^.qx is where H was copied to. >>>>> >>>>> >>>> >>>> >>>> Maybe my fault is I assume people have a reasonable amount of >>>> intelligence, and I forget how DUMB you are on some things. >>>> >>> >>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from >>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without >>> contradiction. >>> >>> This becomes impossible to understand if you can't even keep track of >>> the fact that H and Ĥ are not the same machine. >>> >> >> If H applied to <H^> <H^> is a different computation than H^.qx applied >> to <H^> <H^? then you built H^ wrong, > > This is where the subject matter becomes too difficult for most people > to understand. I could not understand it myself until I saw that this is > what the code does. Even after I saw that this is what the code does it > took me three days of very careful analysis to see why the code does > this. Until you see that the code is correct you will not be able to > accept this. > > The fact that you get different answers PROVES they are not the same computation, or maybe even the H is not a Computaton at all. The simple proof would be a REAL instruction by instruction trace of the two supposed identical Computation, and see a what point they first diverse. There MUST be such a point, as if they start at the same point, and supposedly execute the exact same instruction sequence on the exact same data, but arrive at different results, there WILL be a point of first seperation. Then, LOOK at what that instruction is and what data it was processing. It is almost certainly that the input to that instruction will be different in the two machines. Why is it different, it will be the 'hidden' input that wasn't declaired. As I have said, it might be that your H has as one of its 'inputs' the program counter address it is run from. It might be that you didn't actually fully copy the code from one to the other (H1 may have a constant of H1 instead of H in it, that being the 'hidden' input). Since you haven't provided us with the code, no one can help you, but it is a FUNDAMENTAL fact that if the two copes are REALLY the same algorithm, and the inputs are all the same, then the results WILL be identical. The fact that they are different says you have an error. The fact that you are keeping the code secret says no one can help you, and no one will actually believe you that you do have identical code with identical input will give different results, as that is know to be impossible. People won't just take you word that you have done the impossible without proof. You have claimed it too many times and then had to retract it. If you have read what I have wriiten, you will notice that I HAVE made a comment that the Software Engineering term 'Pure Function' is NOT sufficient (or even neccesary) for a function to be a Computation, as the Software Engineering term does NOT require or promise that all 'copies' of a function will return the same values for the same inputs, but just requires/promises that a given copy will. For instance, a function that just returns its program counter meets the definition of a 'Pure Runction' but not a Computation, as different copies give different values, as a Computation, it has a 'hidden' input of its program address.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 18:20 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ key difference ] |
| Message-ID | <V-edne_JmpY8Csr8nZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #40214 |
On 10/1/2021 6:04 PM, Richard Damon wrote: > On 10/1/21 6:46 PM, olcott wrote: >> On 10/1/2021 5:34 PM, Richard Damon wrote: >>> >>> On 10/1/21 6:21 PM, olcott wrote: >>>> On 10/1/2021 5:00 PM, Richard Damon wrote: >>>>> On 10/1/21 5:58 PM, Richard Damon wrote: >>>>>> On 10/1/21 5:28 PM, olcott wrote: >>>>>>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>>>>>> On 10/1/21 4:58 PM, olcott wrote: >>>>>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>>>>> Oh dear, you've posted about TMs again... >>>>>>>>>> >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>>>> >>>>>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>>>>> applied >>>>>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>>>>> >>>>>>>>> Flat out totally incorrect. >>>>>>>>> >>>>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches >>>>>>>>> its >>>>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore >>>>>>>>> the >>>>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>>>>> >>>>>>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>>>>>> >>>>>>>>> I have explained all of the details of this a dozen times in the >>>>>>>>> last >>>>>>>>> day and you simply ignore it rather than directly address it >>>>>>>>> point-by-point because you know that I am correct. >>>>>>>>> >>>>>>>>> >>>>>>>> >>>>>>>> That may be the details of what happens, but Ben was quoting the >>>>>>>> REQUIREMENT that are on the behavior or H. You know, how H is >>>>>>>> supposed >>>>>>> >>>>>>> The reason why I quit responding to most of your posts is terribly >>>>>>> careless mistakes like that. None of the above ever mentions H. >>>>>>> >>>>>>> >>>>>> >>>>>> Never the less, H is still there as H^.qx is a copy of H, so will act >>>>>> like H will act. >>>>>> >>>>>> If you don't understand requirement flow down, maybe you shouldn't >>>>>> consider yourself qualified to be a programmer. >>>>>> >>>>>> Note there is no machine with an actual name of H^.qx, that is a state >>>>>> within the larger machine H^. We don't talk about behavior of 'states' >>>>>> of a Turing Machine (except talking about individual steps). >>>>>> >>>>>> We only talk about actual Turing Machines, or the extracted >>>>>> sub-machines >>>>>> taken out of a machihe. >>>>>> >>>>>> The machine that represents the sub-machine at H^.qx IS H, so >>>>>> calling it >>>>>> H is appropriate. >>>>>> >>>>>> All statements need to be taken in context, and the context of the >>>>>> above >>>>>> trace line has the definition of H in view. >>>>>> >>>>>> The requirement is and always was, a requirement on the machine H, so >>>>>> that is what should be stated. >>>>>> >>>>>> To do otherwise is just a dishonest dodge. >>>>>> >>>>>> yes, maybe I could have said the requirements on H which are copied to >>>>>> H^.qx, but that is just being needlessly wordy as everyone should know >>>>>> that H^.qx is where H was copied to. >>>>>> >>>>>> >>>>> >>>>> >>>>> Maybe my fault is I assume people have a reasonable amount of >>>>> intelligence, and I forget how DUMB you are on some things. >>>>> >>>> >>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from >>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without >>>> contradiction. >>>> >>>> This becomes impossible to understand if you can't even keep track of >>>> the fact that H and Ĥ are not the same machine. >>>> >>> >>> If H applied to <H^> <H^> is a different computation than H^.qx applied >>> to <H^> <H^? then you built H^ wrong, >> >> This is where the subject matter becomes too difficult for most people >> to understand. I could not understand it myself until I saw that this is >> what the code does. Even after I saw that this is what the code does it >> took me three days of very careful analysis to see why the code does >> this. Until you see that the code is correct you will not be able to >> accept this. >> >> > > The fact that you get different answers PROVES they are not the same > computation, Yes that is what I have been saying all along. > or maybe even the H is not a Computaton at all. When they are transformed into pure functions this wold be fully addressed. It can be reviewed again then. > > The simple proof would be a REAL instruction by instruction trace of the > two supposed identical Computation, and see a what point they first > diverse. There MUST be such a point, as if they start at the same point, > and supposedly execute the exact same instruction sequence on the exact > same data, but arrive at different results, there WILL be a point of > first seperation. > The key difference is that H1 is chained to H preceding it. H1(P,P) simulates its input then P calls H(P,P) that simulates its input then P calls H(P,P) that simulates its input ... The above is the correct execution trace that is specified by a pair of functions with identical machine code on the same 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 20:27 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ key difference ] |
| Message-ID | <pIN5J.50390$3p3.15932@fx16.iad> |
| In reply to | #40218 |
On 10/1/21 7:20 PM, olcott wrote: > On 10/1/2021 6:04 PM, Richard Damon wrote: >> On 10/1/21 6:46 PM, olcott wrote: >>> On 10/1/2021 5:34 PM, Richard Damon wrote: >>>> >>>> On 10/1/21 6:21 PM, olcott wrote: >>>>> On 10/1/2021 5:00 PM, Richard Damon wrote: >>>>>> On 10/1/21 5:58 PM, Richard Damon wrote: >>>>>>> On 10/1/21 5:28 PM, olcott wrote: >>>>>>>> On 10/1/2021 4:18 PM, Richard Damon wrote: >>>>>>>>> On 10/1/21 4:58 PM, olcott wrote: >>>>>>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>>>>>> Oh dear, you've posted about TMs again... >>>>>>>>>>> >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>> >>>>>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>>>>> >>>>>>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>>>>>> applied >>>>>>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>>>>>> >>>>>>>>>> Flat out totally incorrect. >>>>>>>>>> >>>>>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches >>>>>>>>>> its >>>>>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore >>>>>>>>>> the >>>>>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>>>>>> >>>>>>>>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>>>>>>>> >>>>>>>>>> I have explained all of the details of this a dozen times in the >>>>>>>>>> last >>>>>>>>>> day and you simply ignore it rather than directly address it >>>>>>>>>> point-by-point because you know that I am correct. >>>>>>>>>> >>>>>>>>>> >>>>>>>>> >>>>>>>>> That may be the details of what happens, but Ben was quoting the >>>>>>>>> REQUIREMENT that are on the behavior or H. You know, how H is >>>>>>>>> supposed >>>>>>>> >>>>>>>> The reason why I quit responding to most of your posts is terribly >>>>>>>> careless mistakes like that. None of the above ever mentions H. >>>>>>>> >>>>>>>> >>>>>>> >>>>>>> Never the less, H is still there as H^.qx is a copy of H, so will >>>>>>> act >>>>>>> like H will act. >>>>>>> >>>>>>> If you don't understand requirement flow down, maybe you shouldn't >>>>>>> consider yourself qualified to be a programmer. >>>>>>> >>>>>>> Note there is no machine with an actual name of H^.qx, that is a >>>>>>> state >>>>>>> within the larger machine H^. We don't talk about behavior of >>>>>>> 'states' >>>>>>> of a Turing Machine (except talking about individual steps). >>>>>>> >>>>>>> We only talk about actual Turing Machines, or the extracted >>>>>>> sub-machines >>>>>>> taken out of a machihe. >>>>>>> >>>>>>> The machine that represents the sub-machine at H^.qx IS H, so >>>>>>> calling it >>>>>>> H is appropriate. >>>>>>> >>>>>>> All statements need to be taken in context, and the context of the >>>>>>> above >>>>>>> trace line has the definition of H in view. >>>>>>> >>>>>>> The requirement is and always was, a requirement on the machine >>>>>>> H, so >>>>>>> that is what should be stated. >>>>>>> >>>>>>> To do otherwise is just a dishonest dodge. >>>>>>> >>>>>>> yes, maybe I could have said the requirements on H which are >>>>>>> copied to >>>>>>> H^.qx, but that is just being needlessly wordy as everyone should >>>>>>> know >>>>>>> that H^.qx is where H was copied to. >>>>>>> >>>>>>> >>>>>> >>>>>> >>>>>> Maybe my fault is I assume people have a reasonable amount of >>>>>> intelligence, and I forget how DUMB you are on some things. >>>>>> >>>>> >>>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally distinct from >>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ and thus can have opposite final states without >>>>> contradiction. >>>>> >>>>> This becomes impossible to understand if you can't even keep track of >>>>> the fact that H and Ĥ are not the same machine. >>>>> >>>> >>>> If H applied to <H^> <H^> is a different computation than H^.qx applied >>>> to <H^> <H^? then you built H^ wrong, >>> >>> This is where the subject matter becomes too difficult for most people >>> to understand. I could not understand it myself until I saw that this is >>> what the code does. Even after I saw that this is what the code does it >>> took me three days of very careful analysis to see why the code does >>> this. Until you see that the code is correct you will not be able to >>> accept this. >>> >>> >> >> The fact that you get different answers PROVES they are not the same >> computation, > > Yes that is what I have been saying all along. But, then NEED to be the same. If the computation at H^.qx is not the exact same computation as H, then H^ was built wrong. > >> or maybe even the H is not a Computaton at all. > > When they are transformed into pure functions this wold be fully > addressed. It can be reviewed again then. As I have said, 'Pure Function' isn't enough, it needs to be a pure function that doesn't use something else, like its address, to make copies of it different from each other. > >> >> The simple proof would be a REAL instruction by instruction trace of the >> two supposed identical Computation, and see a what point they first >> diverse. There MUST be such a point, as if they start at the same point, >> and supposedly execute the exact same instruction sequence on the exact >> same data, but arrive at different results, there WILL be a point of >> first seperation. >> > > The key difference is that H1 is chained to H preceding it. Just shows that either H1 is a different computation (and thus doesn't matter) or that H and H1 aren't even computations (and thus disqualified) > > H1(P,P) simulates its input then > P calls H(P,P) that simulates its input then > P calls H(P,P) that simulates its input ... > > The above is the correct execution trace that is specified by a pair of > functions with identical machine code on the same input. > And if H1 and H give different answers, they aren't the same Computation, and thus not the equivalent of the same Turing Machine 'H' and thus since clearly PO-H is the one that PO-P was built on. it is PO-H that matters for Linz, not PO-H1. Thus, what H1 says is not relevent to the problem, only what H says. Your argument of 'same code' not withstanding, all that proves is that either you are lying or the code actually has another input besides the formal P and I, and thus not the right form of a computation to be a Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 17:10 -0500 |
| Message-ID | <L5-dnVmqCfzVGsr8nZ2dnUU7-amdnZ2d@giganews.com> |
| In reply to | #40202 |
On 10/1/2021 4:58 PM, Richard Damon wrote: > On 10/1/21 5:28 PM, olcott wrote: >> On 10/1/2021 4:18 PM, Richard Damon wrote: >>> On 10/1/21 4:58 PM, olcott wrote: >>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>> Oh dear, you've posted about TMs again... >>>>> >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>> ---1----2-----3-----4--5-----6 >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> And the correct annotation for this line is "if (and only if) Ĥ applied >>>>> to ⟨Ĥ⟩ does not halt". >>>> >>>> Flat out totally incorrect. >>>> >>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>> >>>> AKA the simulation of (4) applied to (5) by (3) does not halt. >>>> >>>> I have explained all of the details of this a dozen times in the last >>>> day and you simply ignore it rather than directly address it >>>> point-by-point because you know that I am correct. >>>> >>>> >>> >>> That may be the details of what happens, but Ben was quoting the >>> REQUIREMENT that are on the behavior or H. You know, how H is supposed >> >> The reason why I quit responding to most of your posts is terribly >> careless mistakes like that. None of the above ever mentions H. >> >> > > Never the less, H is still there as H^.qx is a copy of H, so will act > like H will act. > It is difficult enough when you get the terms exactly right. In all those cases where you refer to Ĥ as H I immediately stop reading and skip the whole post. > If you don't understand requirement flow down, maybe you shouldn't > consider yourself qualified to be a programmer. > > Note there is no machine with an actual name of H^.qx, that is a state > within the larger machine H^. We don't talk about behavior of 'states' > of a Turing Machine (except talking about individual steps). > > We only talk about actual Turing Machines, or the extracted sub-machines > taken out of a machihe. > > The machine that represents the sub-machine at H^.qx IS H, so calling it > H is appropriate. > > All statements need to be taken in context, and the context of the above > trace line has the definition of H in view. > > The requirement is and always was, a requirement on the machine H, so > that is what should be stated. > > To do otherwise is just a dishonest dodge. > > yes, maybe I could have said the requirements on H which are copied to > H^.qx, but that is just being needlessly wordy as everyone should know > that H^.qx is where H was copied to. > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 23:22 +0100 |
| Message-ID | <87pmsoidwg.fsf@bsb.me.uk> |
| In reply to | #40199 |
olcott <NoOne@NoWhere.com> writes: > On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >> Oh dear, you've posted about TMs again... >> olcott <NoOne@NoWhere.com> writes: >> > ---1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> And the correct annotation for this line is "if (and only if) Ĥ applied >> to ⟨Ĥ⟩ does not halt". > > Flat out totally incorrect. Linz is not wrong about how he himself specifies the behaviour of Ĥ. It's his specification. You /could/ reject that specification, but in fact you insist that you only ever use Ĥ to refer to Linz's Ĥ. You dishonestly leave off a key part of his specification because you don't want to keep seeing the problem. > Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its > final state whether or not Ĥ.qx aborts this simulation therefore the > transition of Ĥ.qx to Ĥ.qn is correct. What is correct is determined by the annotation you keep dishonestly omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does not halt. > AKA the simulation of (4) applied to (5) by (3) does not halt. There is no TM (simulating or otherwise) that satisfies this clause from Linz's specification of what Ĥ should do. At least there isn't if you keep the specification intact, but by dishonestly removing the key words you are trying to make it appears as if there could be. > I have explained all of the details of this a dozen times in the last > day and you simply ignore it rather than directly address it > point-by-point because you know that I am correct. It's right there in Linz. His Ĥ has this property: "q0 w^ ⊢* y1 qn y2, if Ĥ applied to w^ does not halt." (His q0 is your Ĥ.q0. His w^ is your ⟨Ĥ⟩. His qn is your Ĥ.qn. His y1 and y2 are string on the tape that you don't bother with.) You /must/ remove this key part of the his specification because you have no answer for the problem is so obviously results in. If your Ĥ truly is Linz's Ĥ you should have no objection to stating under what conditions, according to Linz, Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn. >> But in that case, Ĥ applied ⟨Ĥ⟩ clearly does >> halt -- in state Ĥ.qn. No decider, of any sort, can satisfy this part >> Linz's specification. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 4 of 17 — ← Prev page 1 2 3 [4] 5 6 … 17 Next page →
Back to top | Article view | comp.theory
csiph-web