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 15 of 17 — ← Prev page 1 … 13 14 [15] 16 17 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-25 19:13 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <BSGdJ.5$Wm1.0@fx10.iad> |
| In reply to | #40789 |
On 10/25/21 10:46 AM, olcott wrote: > On 10/24/2021 6:30 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>>>>> >>>>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm >>>>>>>>>>>>> because there >>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>> This notation is hopeless in ASCII. Using the notation that >>>>>>>>>>>> has evolved >>>>>>>>>>>> in these threads (not my preferred one, but I don't want to >>>>>>>>>>>> complicate >>>>>>>>>>>> matters any more) Linz writes: >>>>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>>>>> if M applied to <M> does not halt. >>>>>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>>>>> >>>>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> >>>>>>>>>>>>> because there >>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly >>>>>>>>>>>> referring to >>>>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should >>>>>>>>>>>> transition to >>>>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) >>>>>>>>>>>> applied to >>>>>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>>>>> >>>>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of >>>>>>>>>>>>> the first >>>>>>>>>>>>> <M> being applied to the machine description of the second >>>>>>>>>>>>> <M>. >>>>>>>>>>>> >>>>>>>>>>>> The annotation dose not specifically refer to what this >>>>>>>>>>>> sub-computation >>>>>>>>>>>> does. It simply gives the condition under which Ĥ will >>>>>>>>>>>> transition from >>>>>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>>>>> >>>>>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>>>>> simulation of its input <M> applied to <M> never reaches its >>>>>>>>>>> final >>>>>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>>>>> correctly decide that this input never halts NO MATTER WHAT >>>>>>>>>>> ELSE. >>>>>>>>>> This is not what Linz is saying. >>>>>>>>> >>>>>>>>> Of course this is not what Linz is saying. >>>>>>>> But until you understand what he is saying, you can't see why >>>>>>>> you are >>>>>>>> wrong. >>>>>>> >>>>>>> That Linz did not consider a simulating halt decider does not >>>>>>> make me >>>>>>> wrong. >>>>>> >>>>>> Quite. You are wrong for the reasons I gave. >>>>>> >>>>>>> If any of this was wrong someone could point out an actual error: >>>>>>> >>>>>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ >>>>>>> applied >>>>>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>>>>> simulation is aborted. >>>>>> The error is that this is a statement about an sub-set of and >>>>>> empty set >>>>>> of Turing machines. >>>>> >>>>> You are simply making a false assumption. You are beginning with the >>>>> premise that Linz is correct then concluding that Linz is correct on >>>>> the basis of this premise. >>>> >>>> A proved theorem is not a "false assumption". >>> >>> Ah so you are back to your blasphemy. One can not rely on a proved >>> theorem as exactly equal to infallibility. >> >> You are being dishonest again. Setting aside the silly religious >> language, I am not asserting that any argument is infallible something >> that was obvious from what I wrote immediate after this. >> >> I am simply saying you have not shown any error in the argument. Until >> you show that, for example, 2+2 is not equal to 4, it is entirely >> reasonable to assert that it is. That is not blasphemy. > > I don't see how this is so difficult for you: > (a) If it is claimed that X cannot possibly be done > (b) I show X being correctly done > (c) then I have refuted X cannot possibly be done > Except that you haven't actually shown (b) H(<H^>,<H^>) says that H^(<H^>) will be non-halting but H^(<H^>) is halting. You have just shown that the partial simulation of H doesn't see this halting state because it aborts its simulation too soon. In fact you prove that no H can simulate long enough to see that halting state, but Linz established that already, as if H could simulate to that point, it could accurated answer Halting and be right.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-26 01:46 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <87fsso1ul2.fsf@bsb.me.uk> |
| In reply to | #40789 |
olcott <NoOne@NoWhere.com> writes: > On 10/24/2021 6:30 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>>>>> >>>>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>>>>>> matters any more) Linz writes: >>>>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>>>>> if M applied to <M> does not halt. >>>>>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>>>>> >>>>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>>>>> >>>>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>>>>>> >>>>>>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>>>>> >>>>>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>>>>>> This is not what Linz is saying. >>>>>>>>> >>>>>>>>> Of course this is not what Linz is saying. >>>>>>>> But until you understand what he is saying, you can't see why you are >>>>>>>> wrong. >>>>>>> >>>>>>> That Linz did not consider a simulating halt decider does not make me >>>>>>> wrong. >>>>>> >>>>>> Quite. You are wrong for the reasons I gave. >>>>>> >>>>>>> If any of this was wrong someone could point out an actual error: >>>>>>> >>>>>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>>>>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>>>>> simulation is aborted. >>>>>> The error is that this is a statement about an sub-set of and empty set >>>>>> of Turing machines. >>>>> >>>>> You are simply making a false assumption. You are beginning with the >>>>> premise that Linz is correct then concluding that Linz is correct on >>>>> the basis of this premise. >>>> >>>> A proved theorem is not a "false assumption". >>> >>> Ah so you are back to your blasphemy. One can not rely on a proved >>> theorem as exactly equal to infallibility. >> >> You are being dishonest again. Setting aside the silly religious >> language, I am not asserting that any argument is infallible something >> that was obvious from what I wrote immediate after this. >> I am simply saying you have not shown any error in the argument. Until >> you show that, for example, 2+2 is not equal to 4, it is entirely >> reasonable to assert that it is. That is not blasphemy. > > I don't see how this is so difficult for you: > (a) If it is claimed that X cannot possibly be done > (b) I show X being correctly done > (c) then I have refuted X cannot possibly be done I don't think you honestly believe that the logic is difficult for me. Neither do I think you have trouble knowing what part I am saying you have failed at (it's (b) by the way). But my objection to what you've been saying goes my deeper than a failure to show anything of value. You are being dishonest in that you claim to be talking about Linz's class of TMs, but you keep cutting key facts about them while trying to replace those facts with waffle of you your own invention. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-25 20:02 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <duOdneM5KLouzur8nZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #40827 |
On 10/25/2021 7:46 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/24/2021 6:30 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>> >>>>>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>>>>>> >>>>>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>>>>>>> matters any more) Linz writes: >>>>>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>>>>>> if M applied to <M> does not halt. >>>>>>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>>>>>> >>>>>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>>>>>> >>>>>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>>>>>>> >>>>>>>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>>>>>> >>>>>>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>>>>>>> This is not what Linz is saying. >>>>>>>>>> >>>>>>>>>> Of course this is not what Linz is saying. >>>>>>>>> But until you understand what he is saying, you can't see why you are >>>>>>>>> wrong. >>>>>>>> >>>>>>>> That Linz did not consider a simulating halt decider does not make me >>>>>>>> wrong. >>>>>>> >>>>>>> Quite. You are wrong for the reasons I gave. >>>>>>> >>>>>>>> If any of this was wrong someone could point out an actual error: >>>>>>>> >>>>>>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>>>>>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>>>>>> simulation is aborted. >>>>>>> The error is that this is a statement about an sub-set of and empty set >>>>>>> of Turing machines. >>>>>> >>>>>> You are simply making a false assumption. You are beginning with the >>>>>> premise that Linz is correct then concluding that Linz is correct on >>>>>> the basis of this premise. >>>>> >>>>> A proved theorem is not a "false assumption". >>>> >>>> Ah so you are back to your blasphemy. One can not rely on a proved >>>> theorem as exactly equal to infallibility. >>> >>> You are being dishonest again. Setting aside the silly religious >>> language, I am not asserting that any argument is infallible something >>> that was obvious from what I wrote immediate after this. >>> I am simply saying you have not shown any error in the argument. Until >>> you show that, for example, 2+2 is not equal to 4, it is entirely >>> reasonable to assert that it is. That is not blasphemy. >> >> I don't see how this is so difficult for you: >> (a) If it is claimed that X cannot possibly be done >> (b) I show X being correctly done >> (c) then I have refuted X cannot possibly be done > > I don't think you honestly believe that the logic is difficult for me. The alternative is that you are a liar and I prefer to give you the benefit of the doubt. > Neither do I think you have trouble knowing what part I am saying you > have failed at (it's (b) by the way). We have not gotten to B yet. First we must have mutual agreement on the hypothetical. Here is the long form of the hypothetical: THIS STATEMENT IS NECESSARILY ALWAYS TRUE Whenever simulating halt decider H correctly determines that input P never reaches its final state (whether or not its simulation of P is aborted) then H correctly decides that P never halts. > But my objection to what you've been saying goes my deeper than a > failure to show anything of value. You are being dishonest in that you > claim to be talking about Linz's class of TMs, but you keep cutting key > facts about them while trying to replace those facts with waffle of you > your own invention. THIS IS THE SHORT VERSION OF THE HYPOTHETICAL If a halt decider correctly decides that its input never halts then the halt decider did correct decide the halt status of its input. You talk about me being dishonest when you continually refuse to agree that when a halt decider is correct then it is not incorrect. -- 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-19 21:19 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <C8KbJ.2645$587.823@fx07.iad> |
| In reply to | #40550 |
On 10/19/21 10:10 AM, olcott wrote: > On 10/18/2021 5:59 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/17/2021 7:47 PM, Ben Bacarisse wrote: >>>> Quotes re-ordered for clarity... >>>> olcott <NoOne@NoWhere.com> writes: >>>>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote: >>>>>> >>>>>> But you agree that >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn >>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>> >>>>>> is (one half of) what Linz means by Ĥ, yes? (I don't expect an >>>>>> answer -- I expect you'll just repeat the waffle.) >>>>> >>>>> No not at all, not in the least little bit >>>> >>>> OK, so you are not using Ĥ to denote an exemplar of the same class of >>>> TMs that Linz does. If you were, you would have to agree that Linz's >>>> specification of when Ĥ transitions to qn is the correct one. >>>> >>>> Oh, and you need to apologise for some very deceptive claims to the >>>> contrary. >>> >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> >> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. > > > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf page 319 > > That you do not understand the most basic point that Linz has adapted TM > H by prepending states and appending states such that the original H > "not" path of H remains in the middle is a necessary prerequisite. > Note, y1 and y2 are NOT new states, but showing that the tape at state qn is currently y1 | y2 (where | is the location of the read head) or at qy it is x1 | x2 In other words, the content of the tape is irrelevant at that state. This is just like q0 wM w says that at state q0 the contents of the tape are | wM w (i.e. the tape is at the begining of the representation of the computation. > q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H > q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H' > q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ > > This leaves the "no" path of TM H at Linz Ĥq0 > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > This leaves the "no" path of TM H at Olcott Ĥ.qx > > I am stopping here because you get overwhelmed with more than one key > detail. That is much much better than Richard He get overwhelmed with > every key detail. > Since you don't understand what Linz notation meant, maybe you should have read his description of what the transforms were. Oh, maybe the problem is that you still don't understand how Turing Machines work.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-18 21:15 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <N_obJ.13$Rr4.9@fx37.iad> |
| In reply to | #40524 |
On 10/18/21 11:07 AM, olcott wrote: > On 10/17/2021 7:47 PM, Ben Bacarisse wrote: >> Quotes re-ordered for clarity... >> >> olcott <NoOne@NoWhere.com> writes: >>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote: >>>> >>>> But you agree that >>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn >>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>> >>>> is (one half of) what Linz means by Ĥ, yes? (I don't expect an >>>> answer -- I expect you'll just repeat the waffle.) >>> >>> No not at all, not in the least little bit >> >> OK, so you are not using Ĥ to denote an exemplar of the same class of >> TMs that Linz does. If you were, you would have to agree that Linz's >> specification of when Ĥ transitions to qn is the correct one. >> >> Oh, and you need to apologise for some very deceptive claims to the >> contrary. >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > As long as a simulating halt decider correctly decides that its input > never reaches its final state whether or not it aborts the simulation of > this input then this simulating halt decider is necessarily correct when > it decides that its input does not halt. > > This is just like saying as long as we know that we have a black cat > then it is totally certain that we have a cat. > > If H^.q0 <H^> ends up at H^.qn, then H^.q0 <H^> IS a Halting computaiton (since H^.qn is a halting final state). BY DEFINITION, this means that H saying it is non-halting is wrong, as the question of the Halting Problem is about the ACTUAL MACHINE, not a partial simulation done by H. The fact that H doesn't see this final halting state just shows that H isn't good enough to answer this problem coreectly. Just like you. You seem to think that the white poodle in your home is a black cat, so you THINK you have a cat, but you don't H, and YOU, FAILS at the assigned task.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-19 07:34 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <g3ybJ.9$e_6.8@fx36.iad> |
| In reply to | #40524 |
On 10/18/21 11:07 AM, olcott wrote: > On 10/17/2021 7:47 PM, Ben Bacarisse wrote: >> Quotes re-ordered for clarity... >> >> olcott <NoOne@NoWhere.com> writes: >>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote: >>>> >>>> But you agree that >>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn >>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>> >>>> is (one half of) what Linz means by Ĥ, yes? (I don't expect an >>>> answer -- I expect you'll just repeat the waffle.) >>> >>> No not at all, not in the least little bit >> >> OK, so you are not using Ĥ to denote an exemplar of the same class of >> TMs that Linz does. If you were, you would have to agree that Linz's >> specification of when Ĥ transitions to qn is the correct one. >> >> Oh, and you need to apologise for some very deceptive claims to the >> contrary. >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > As long as a simulating halt decider correctly decides that its input > never reaches its final state whether or not it aborts the simulation of > this input then this simulating halt decider is necessarily correct when > it decides that its input does not halt. > > This is just like saying as long as we know that we have a black cat > then it is totally certain that we have a cat. > > Another point, the phrase "whether or not it aborts" is an improper statement. To ask the question if H is correct, H has been defined, and thus its behavior is set. A given H will either abort or not. To 'suppose' it to do otherwise (and in a way that affect the representation of H^) is an improper action. You have messed up your definitions of what are independent variables and what are dependent variables. In showing that THIS H gets the right answer, you need to change just THIS H without changing the copy of H in H^, or you are changing the problem you are verifying. Replace the outer H with a REAL UTM, (and keep the existing defined H as what H^/P is using) and it comes to a Halt. THIS shows H was wrong. Showing that this same thing happens for all H, just shows that it isn't just the one chosed algorithm fails, but ALL such algorithms, so you have in effect just CONFIRMED the claim of Linz, not refuted it. NO Simulating Halt Decider can get the right answer for a machine built on it by the ^ template. QED.
[toc] | [prev] | [next] | [standalone]
| From | Mikko <mikko.levanto@outlook.com> |
|---|---|
| Date | 2021-10-17 15:01 +0300 |
| Subject | Re: Clarification of Linz H^ Description [ correct criteria ] |
| Message-ID | <mikko.levanto-972FB3.15014217102021@news.eternal-september.org> |
| In reply to | #40457 |
In article <878rys8r9p.fsf@bsb.me.uk>,
Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
> But on the other hand, in other posts, it seems
> you don't really know what the symbols you write mean, so maybe you are
> still simply mystified by what
>
> H–.q0 <H–> |-* H–.qx <H–> <H–> |-* H–.qn
> if (and only if) H– applied to <H–> does not halt.
>
> means.
The problem with above is that the two lines are written in different
languages. It would be easier to apply formal logic if both lines were
in the same language, e.g.:
H– applied to <H–> halts in the state H–.qn
if (and only if) H– applied to <H–> does not halt.
Mikko
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 09:06 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <5YCdnY2A9LBCsPH8nZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #40467 |
On 10/17/2021 7:01 AM, Mikko wrote: > In article <878rys8r9p.fsf@bsb.me.uk>, > Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > >> But on the other hand, in other posts, it seems >> you don't really know what the symbols you write mean, so maybe you are >> still simply mystified by what >> >> H–.q0 <H–> |-* H–.qx <H–> <H–> |-* H–.qn >> if (and only if) H– applied to <H–> does not halt. >> >> means. > > The problem with above is that the two lines are written in different > languages. It would be easier to apply formal logic if both lines were > in the same language, e.g.: > > H– applied to <H–> halts in the state H–.qn > if (and only if) H– applied to <H–> does not halt. > > Mikko > -- 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-17 09:27 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <E8qdnUs2zpVYr_H8nZ2dnUU7-R-dnZ2d@giganews.com> |
| In reply to | #40467 |
On 10/17/2021 7:01 AM, Mikko wrote: > In article <878rys8r9p.fsf@bsb.me.uk>, > Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > >> But on the other hand, in other posts, it seems >> you don't really know what the symbols you write mean, so maybe you are >> still simply mystified by what >> >> H–.q0 <H–> |-* H–.qx <H–> <H–> |-* H–.qn >> if (and only if) H– applied to <H–> does not halt. >> >> means. > > The problem with above is that the two lines are written in different > languages. It would be easier to apply formal logic if both lines were > in the same language, e.g.: > > H– applied to <H–> halts in the state H–.qn > if (and only if) H– applied to <H–> does not halt. > > Mikko > A simulating halt decider acts as if it was a UTM simulating its input until it detects an infinite behavior pattern. All of the conventional halting problem proof counter-examples present infinitely nested simulation to a simulating halt decider. https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its final state then this input never halts. When we know that the simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥ.qx never reaches its final state whether or not Ĥ.qx stops simulating it, then we know that ⟨Ĥ⟩ ⟨Ĥ⟩ never halts. This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily correct. -- 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-17 16:09 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <87r1cj7knn.fsf@bsb.me.uk> |
| In reply to | #40474 |
olcott <NoOne@NoWhere.com> writes: > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state then this input never halts. No. The correct criterion for that sequence of transitions is "if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You know this (or your should know this by now) and yet you continue to try to decide your readers. > This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily > correct. It is correct if it occurs under the conditions specified by the person who defined Ĥ -- Peter Linz. Ĥ.qx only correctly transitions to Ĥ.qn if Ĥ applied to ⟨Ĥ⟩ does not halt. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-18 09:09 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <htWdndxC-eS0HfD8nZ2dnUU7-KPNnZ2d@giganews.com> |
| In reply to | #40476 |
On 10/17/2021 10:09 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its >> final state then this input never halts. > > No. The correct criterion for that sequence of transitions is "if (and > only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You know this (or your should > know this by now) and yet you continue to try to decide your readers. > >> This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily >> correct. > > It is correct if it occurs under the conditions specified by the person > who defined Ĥ -- Peter Linz. Ĥ.qx only correctly transitions to Ĥ.qn if > Ĥ applied to ⟨Ĥ⟩ does not halt. > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its final state WHETHER OR NOT ITS SIMULATION IS ABORTED then Ĥ.qx transitions to Ĥ.qn correctly. There is no possible escape from this. It is like I am saying that when we know that we have a black cat then we definitely have a cat. We can determine the truth of the above statements entirely from the meaning of their words. -- 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-18 23:59 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <87ilxuaqhy.fsf@bsb.me.uk> |
| In reply to | #40518 |
olcott <NoOne@NoWhere.com> writes: > On 10/17/2021 10:09 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its >>> final state then this input never halts. >> No. The correct criterion for that sequence of transitions is "if (and >> only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You know this (or your should >> know this by now) and yet you continue to try to decide your readers. >> >>> This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily >>> correct. >> It is correct if it occurs under the conditions specified by the person >> who defined Ĥ -- Peter Linz. Ĥ.qx only correctly transitions to Ĥ.qn if >> Ĥ applied to ⟨Ĥ⟩ does not halt. > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state WHETHER OR NOT ITS SIMULATION IS ABORTED then Ĥ.qx > transitions to Ĥ.qn correctly. You can't make it correct by adding more CAPS. > There is no possible escape from this. Apparently not. You will keep lying about the behaviour of Linz Ĥ for all time. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-18 21:20 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <i3pbJ.133$pJ7.23@fx38.iad> |
| In reply to | #40518 |
On 10/18/21 10:09 AM, olcott wrote: > On 10/17/2021 10:09 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its >>> final state then this input never halts. >> >> No. The correct criterion for that sequence of transitions is "if (and >> only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You know this (or your should >> know this by now) and yet you continue to try to decide your readers. >> >>> This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily >>> correct. >> >> It is correct if it occurs under the conditions specified by the person >> who defined Ĥ -- Peter Linz. Ĥ.qx only correctly transitions to Ĥ.qn if >> Ĥ applied to ⟨Ĥ⟩ does not halt. >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state WHETHER OR NOT ITS SIMULATION IS ABORTED then Ĥ.qx > transitions to Ĥ.qn correctly. WRONG. LINZ requirement is based on M w reaching on not its final state when H is given Wm w M = H^,, w = <H^> From above H^ <H^> -> H^.qn which is a Halting state, so H, to meet the requirement, must go to qy, which it didn't, so it is wrong. > > There is no possible escape from this. It is like I am saying that when > we know that we have a black cat then we definitely have a cat. Right, there is no escape that you quote the wrong requirements and thus are exposed for trying to pass off a White Poodle as a Black Cat. You are shown to be a pathological liar. > > We can determine the truth of the above statements entirely from the > meaning of their words. > > Right, and you are using the WRONG words, so have the wrong meaning. READ LINZ AGAIN.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-17 13:12 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ] |
| Message-ID | <dQYaJ.135510$2Q_3.10976@fx35.iad> |
| In reply to | #40474 |
On 10/17/21 10:27 AM, olcott wrote: > On 10/17/2021 7:01 AM, Mikko wrote: >> In article <878rys8r9p.fsf@bsb.me.uk>, >> Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >> >>> But on the other hand, in other posts, it seems >>> you don't really know what the symbols you write mean, so maybe you are >>> still simply mystified by what >>> >>> H–.q0 <H–> |-* H–.qx <H–> <H–> |-* H–.qn >>> if (and only if) H– applied to <H–> does not halt. >>> >>> means. >> >> The problem with above is that the two lines are written in different >> languages. It would be easier to apply formal logic if both lines were >> in the same language, e.g.: >> >> H– applied to <H–> halts in the state H–.qn >> if (and only if) H– applied to <H–> does not halt. >> >> Mikko >> > > A simulating halt decider acts as if it was a UTM simulating its input > until it detects an infinite behavior pattern. All of the conventional > halting problem proof counter-examples present infinitely nested > simulation to a simulating halt decider. Except that by stopping its simulations, it shows that it NEVER WAS a UTM. A partial simulator that acts 'like a UTM' until it reaches some point, is not a UTM, and its failure to reach a halting state doesn't prove non-halting. > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state then this input never halts. WRONG. Since the algorithm of H terminated its simulation, it provides ZERO proof on non-halting. Can you quote ANY source (other than your own garbage) that makes any similar claim? It is like someone saying they had a 100% on the test, as they had absolutely no wrong answers, until they started filling out the test, so they still deserve the 100% grade. Once H stops simulating, it loses all ability to claim that the machine never halts. At best it can say that it hadn't halted in some number of N steps (the amount it simulated) but since that machine might (and in this case DOES) halt in some number N' > N steps. > > When we know that the simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥ.qx never reaches its > final state whether or not Ĥ.qx stops simulating it, then we know that > ⟨Ĥ⟩ ⟨Ĥ⟩ never halts. > > This means that when Ĥ.qx transitions to Ĥ.qn it is necessarily correct. > > Nope. UNSOUND logic, bad answer. The problem is that you change H globally, including the copy in H^, and thus you aren't asking a consistent question. This is part of your problem in forming H^ incorrectly, creating the 'Pathological Self-Reference' in YOUR system that isn't actually in the problem. FAIL.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-14 23:28 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <Iz6aJ.79486$2B4.41252@fx04.iad> |
| In reply to | #40395 |
On 10/14/21 6:47 PM, olcott wrote:
> On 10/14/2021 5:06 PM, André G. Isaak wrote:
>> On 2021-10-14 08:57, olcott wrote:
>>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>>
>>>>> In any physically existing machine {current_state, current_input} must
>>>>> be represented by integer values, thus providing the machine
>>>>> address of
>>>>> this point in the execution trace. Imagining them away by simply not
>>>>> paying attention does not eliminate this mandatory requirement.
>>>>>
>>>> That's the normal way to represent a machine. It allows for the
>>>> "Godel number",
>>>> a concept that caused some people difficulty at the time it was
>>>> proposed,
>>>> but doesn't seem difficult at all now since we are used to computer
>>>> files
>>>> being just lists of 1s and 0s at the physical level.
>>>>
>>>> However you don't have to use integers, you just need a unique label
>>>> for every state. You could use "State A", "State B", or, if you
>>>> wanted to be
>>>> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
>>>> that the states have ordering. They don't. The integers are just
>>>> labels.
>>>>
>>>
>>> Any means of uniquely identifying the states of a TM can be
>>> arbitrarily mapped to a sequence of natural numbers beginning
>>> with 0.
>>>
>>> The key issue of all of this is that identical copies of a
>>> TM description such that the input to one of these simulated
>>> copies invokes this same machine description may decide this
>>> input differently than an input that does not invoke this
>>> same machine description.
>>
>> Have you really thought this through using *actual* Turing Machines?
>>
>
> I don't have the 100,000 years that this would take.
> This would not be feasible unless we at least define TM's with RAM.
>
>> If you refer to {current_state, current_input} as a "machine address"
>> and arbitrarily map the states and inputs to integers beginning at
>> one, then any two TMs with the same number of states and the same
>> number of symbols will generally have identical sets of "machine
>> addresses"
>
> They will be located at different places in RAM.
>
> 2.3 Random Access Turing Machines
> The reason we don’t like Turing Machines is because
> they have a ridiculous memory model. We solve this
> by allowing random access to the tapes.
> http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
>
>> regardless of what the TMs actually do. So how does this help you to
>> determine whether two machines are the same or not?
>
> We know that two machines are the same when the only way that we execute
> TM's is by simulating their machine description and the second copy of
> the machine description is the other machine.
The problem is:
By the way Turing Machines are defined, A Turing Machine is ALWAYS a
Computation.
As has been pointed out, a given Turing Machine can be described many
different ways.
This means, that a Turing Machine Decider can't acted based on an input
being 'the same' representation as it is, as that would mean that two
different representations of the exact same decider would act
differently on the exact same input (the version having the 'same'
representation, and the version having a different representation).
Thus, you are basing your system on an assumption that you can do what
is impossible. Your top level 'simulator' is not accurately simulating
the first input as an actual Turing Machine, so you whole argument falls
appart.
>>
>> André
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-15 09:37 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <v-CdnXr2sZaoD_T8nZ2dnUU7-LfNnZ2d@giganews.com> |
| In reply to | #40400 |
On 10/14/2021 10:28 PM, Richard Damon wrote:
> On 10/14/21 6:47 PM, olcott wrote:
>> On 10/14/2021 5:06 PM, André G. Isaak wrote:
>>> On 2021-10-14 08:57, olcott wrote:
>>>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>>>
>>>>>> In any physically existing machine {current_state, current_input}
>>>>>> must
>>>>>> be represented by integer values, thus providing the machine
>>>>>> address of
>>>>>> this point in the execution trace. Imagining them away by simply not
>>>>>> paying attention does not eliminate this mandatory requirement.
>>>>>>
>>>>> That's the normal way to represent a machine. It allows for the
>>>>> "Godel number",
>>>>> a concept that caused some people difficulty at the time it was
>>>>> proposed,
>>>>> but doesn't seem difficult at all now since we are used to computer
>>>>> files
>>>>> being just lists of 1s and 0s at the physical level.
>>>>>
>>>>> However you don't have to use integers, you just need a unique label
>>>>> for every state. You could use "State A", "State B", or, if you
>>>>> wanted to be
>>>>> cute "Kentucky", "Alabama". Integers have this disadvantage of
>>>>> implying
>>>>> that the states have ordering. They don't. The integers are just
>>>>> labels.
>>>>>
>>>>
>>>> Any means of uniquely identifying the states of a TM can be
>>>> arbitrarily mapped to a sequence of natural numbers beginning
>>>> with 0.
>>>>
>>>> The key issue of all of this is that identical copies of a
>>>> TM description such that the input to one of these simulated
>>>> copies invokes this same machine description may decide this
>>>> input differently than an input that does not invoke this
>>>> same machine description.
>>>
>>> Have you really thought this through using *actual* Turing Machines?
>>>
>>
>> I don't have the 100,000 years that this would take.
>> This would not be feasible unless we at least define TM's with RAM.
>>
>>> If you refer to {current_state, current_input} as a "machine address"
>>> and arbitrarily map the states and inputs to integers beginning at
>>> one, then any two TMs with the same number of states and the same
>>> number of symbols will generally have identical sets of "machine
>>> addresses"
>>
>> They will be located at different places in RAM.
>>
>> 2.3 Random Access Turing Machines
>> The reason we don’t like Turing Machines is because
>> they have a ridiculous memory model. We solve this
>> by allowing random access to the tapes.
>> http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
>>
>>> regardless of what the TMs actually do. So how does this help you to
>>> determine whether two machines are the same or not?
>>
>> We know that two machines are the same when the only way that we
>> execute TM's is by simulating their machine description and the second
>> copy of the machine description is the other machine.
>
> The problem is:
>
> By the way Turing Machines are defined, A Turing Machine is ALWAYS a
> Computation.
>
> As has been pointed out, a given Turing Machine can be described many
> different ways.
>
> This means, that a Turing Machine Decider can't acted based on an input
> being 'the same' representation as it is, as that would mean that two
Every time that a TM copies its own description we can know with 100%
perfect logical certainty that this copy is identical to the original.
We know this in the same way that we know that a black cat is not an
office building. A digital copy of digital data is necessarily identical
to the original by definition.
> different representations of the exact same decider would act
> differently on the exact same input (the version having the 'same'
> representation, and the version having a different representation).
>
> Thus, you are basing your system on an assumption that you can do what
> is impossible. Your top level 'simulator' is not accurately simulating
> the first input as an actual Turing Machine, so you whole argument falls
> appart.
>
>>>
>>> André
>>>
>>
>>
>
--
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-15 12:18 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <FRhaJ.11420$yk1.6941@fx13.iad> |
| In reply to | #40407 |
On 10/15/21 10:37 AM, olcott wrote:
> On 10/14/2021 10:28 PM, Richard Damon wrote:
>> On 10/14/21 6:47 PM, olcott wrote:
>>> On 10/14/2021 5:06 PM, André G. Isaak wrote:
>>>> On 2021-10-14 08:57, olcott wrote:
>>>>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>>>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>>>>
>>>>>>> In any physically existing machine {current_state, current_input}
>>>>>>> must
>>>>>>> be represented by integer values, thus providing the machine
>>>>>>> address of
>>>>>>> this point in the execution trace. Imagining them away by simply not
>>>>>>> paying attention does not eliminate this mandatory requirement.
>>>>>>>
>>>>>> That's the normal way to represent a machine. It allows for the
>>>>>> "Godel number",
>>>>>> a concept that caused some people difficulty at the time it was
>>>>>> proposed,
>>>>>> but doesn't seem difficult at all now since we are used to
>>>>>> computer files
>>>>>> being just lists of 1s and 0s at the physical level.
>>>>>>
>>>>>> However you don't have to use integers, you just need a unique label
>>>>>> for every state. You could use "State A", "State B", or, if you
>>>>>> wanted to be
>>>>>> cute "Kentucky", "Alabama". Integers have this disadvantage of
>>>>>> implying
>>>>>> that the states have ordering. They don't. The integers are just
>>>>>> labels.
>>>>>>
>>>>>
>>>>> Any means of uniquely identifying the states of a TM can be
>>>>> arbitrarily mapped to a sequence of natural numbers beginning
>>>>> with 0.
>>>>>
>>>>> The key issue of all of this is that identical copies of a
>>>>> TM description such that the input to one of these simulated
>>>>> copies invokes this same machine description may decide this
>>>>> input differently than an input that does not invoke this
>>>>> same machine description.
>>>>
>>>> Have you really thought this through using *actual* Turing Machines?
>>>>
>>>
>>> I don't have the 100,000 years that this would take.
>>> This would not be feasible unless we at least define TM's with RAM.
>>>
>>>> If you refer to {current_state, current_input} as a "machine
>>>> address" and arbitrarily map the states and inputs to integers
>>>> beginning at one, then any two TMs with the same number of states
>>>> and the same number of symbols will generally have identical sets of
>>>> "machine addresses"
>>>
>>> They will be located at different places in RAM.
>>>
>>> 2.3 Random Access Turing Machines
>>> The reason we don’t like Turing Machines is because
>>> they have a ridiculous memory model. We solve this
>>> by allowing random access to the tapes.
>>> http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
>>>
>>>> regardless of what the TMs actually do. So how does this help you to
>>>> determine whether two machines are the same or not?
>>>
>>> We know that two machines are the same when the only way that we
>>> execute TM's is by simulating their machine description and the
>>> second copy of the machine description is the other machine.
>>
>> The problem is:
>>
>> By the way Turing Machines are defined, A Turing Machine is ALWAYS a
>> Computation.
>>
>> As has been pointed out, a given Turing Machine can be described many
>> different ways.
>>
>> This means, that a Turing Machine Decider can't acted based on an
>> input being 'the same' representation as it is, as that would mean
>> that two
>
> Every time that a TM copies its own description we can know with 100%
> perfect logical certainty that this copy is identical to the original.
Right, but a machine that acts differently depending on WHICH
representation of it is being used fails to be a Computation. It has a
effective 'input' that isn't part of its formal inputs.
>
> We know this in the same way that we know that a black cat is not an
> office building. A digital copy of digital data is necessarily identical
> to the original by definition.
Right. We know the copy is an exact copy.
We also know that H can not depend on which representation of it is
being used, or it isn't a Computation.
FAIL.
>
>> different representations of the exact same decider would act
>> differently on the exact same input (the version having the 'same'
>> representation, and the version having a different representation).
>>
>> Thus, you are basing your system on an assumption that you can do what
>> is impossible. Your top level 'simulator' is not accurately simulating
>> the first input as an actual Turing Machine, so you whole argument
>> falls appart.
>>
>>>>
>>>> André
>>>>
>>>
>>>
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-14 22:58 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <y76aJ.66930$md6.11572@fx36.iad> |
| In reply to | #40392 |
On 10/14/21 10:57 AM, olcott wrote:
> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>
>>> In any physically existing machine {current_state, current_input} must
>>> be represented by integer values, thus providing the machine address of
>>> this point in the execution trace. Imagining them away by simply not
>>> paying attention does not eliminate this mandatory requirement.
>>>
>> That's the normal way to represent a machine. It allows for the "Godel
>> number",
>> a concept that caused some people difficulty at the time it was proposed,
>> but doesn't seem difficult at all now since we are used to computer files
>> being just lists of 1s and 0s at the physical level.
>>
>> However you don't have to use integers, you just need a unique label
>> for every state. You could use "State A", "State B", or, if you wanted
>> to be
>> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
>> that the states have ordering. They don't. The integers are just labels.
>>
>
> Any means of uniquely identifying the states of a TM can be
> arbitrarily mapped to a sequence of natural numbers beginning
> with 0.
>
> The key issue of all of this is that identical copies of a
> TM description such that the input to one of these simulated
> copies invokes this same machine description may decide this
> input differently than an input that does not invoke this
> same machine description.
>
> 2.3 Random Access Turing Machines
> The reason we don’t like Turing Machines is because they have a
> ridiculous memory model. We solve this by allowing random access to the
> tapes. http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
>
Perhaps you don't understand that it is, in part, the LACK of Random
Access memory that gives Turing Machines the useful property that proper
sub-machines of a Turing machihne are also Turing Machines and always
generate easily identified Computations.
It is, in part, the random access nature of the digital computer that
makes it hard to define what is the full 'Input' to a partial machine.
Since it can access any of the memory, then all the memory might need to
be considered the input, and this makes partitioning off a 'sub-machine'
with a limited define input harder to do.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-13 14:49 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <VSF9J.53389$gc3.9124@fx12.iad> |
| In reply to | #40368 |
On 10/13/21 1:17 PM, olcott wrote: > On 10/13/2021 11:15 AM, Richard Damon wrote: >> On 10/13/21 11:14 AM, olcott wrote: >>> On 10/12/2021 5:59 PM, Richard Damon wrote: >>>> On 10/12/21 9:35 AM, olcott wrote: >>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote: >>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>>>>>> >>>>>>> I had some health care regulation issues to deal with. >>>>>>> I am have also reformulated my algorithm. It is not yet encoded. >>>>>>> The current guesstimate is that I will be done in a week or two. >>>>>>> >>>>>> I was worried when you suddenly disappeared. It coincided with a >>>>>> confernece I was attending so I wasn't aware until my return. >>>>>> >>>>> >>>>> All is well. I have reformulated my algorithm so that it is a pure >>>>> function: >>>>> >>>>> In computer programming, a pure function is a function that has the >>>>> following properties:[1][2] >>>>> >>>>> (1) The function return values are identical for identical >>>>> arguments (no variation with local static variables, non-local >>>>> variables, mutable reference arguments or input streams). >>>>> >>>>> (2) The function application has no side effects (no mutation of >>>>> local static variables, non-local variables, mutable reference >>>>> arguments or input/output streams). >>>>> https://en.wikipedia.org/wiki/Pure_function >>>>> >>>>> The detailed design that meets the spec has been done for weeks. >>>>> I had to totally drop all work on this for a week so that I could >>>>> complete the research to save chemo therapy patients from a greatly >>>>> increased chance of death. >>>>> >>>> >>>> Remember, just being 'Pure' isn't good enough to be a Computation, >>>> it also must be positionally invariant, so all copies give the save >>>> results, i.e. the PC isn't a 'hidden' input to the function. >>> >>> What documentation do you have to support this, or are you simply >>> shooting from the hip as usual? >>> >> >> How abut the the Definition of a Computation. That ALL 'copies' of a >> Computation will always return the same answer given the same input. > > What link or text reference do you have to support your misconception? > Make sure that it refers to "copies of a computation". > Thinking about it, maybe YOU should publish what definition YOU are intending to use so we can point out where it might be off. Remember, this is dealing with a field of Mathematics developed in the 1920's and 30's, so a 'Computer' was typically a PERSON who did calculations with perhaps simple aids. The 'Digital Computer' that you are probably thinking in terms of did not yet really exist, so the definition should NOT be based on that. Since you claim to be working from 'First Principles', this would seem to be one of the fundamental principles that you got the definition of to start, or did you just dive into unexplored territory without any direction? >> >> Remember, a Computation is a Mathematical concept so things like >> 'Address' don't apply to it. >> >> This seems to beone of your blind spots on the problem, you seem to >> think is is about 'Programming', when it isn't. > >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-02 16:14 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <87lf3bh31u.fsf@bsb.me.uk> |
| In reply to | #40229 |
olcott <NoOne@NoWhere.com> writes: > On 10/2/2021 5:54 AM, Richard Damon wrote: >> On 10/2/21 12:10 AM, olcott wrote: >>>-----1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> >>> There is only one place in the above where this exists: >>> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ >>> >> Right, so the question is does the TM which is described by <H^> applied >> to <H^> Halt, and that is exactly your (1) applied to (2) which you show > > The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > (1) is not a TM description, proving that you are wrong. The TM described by ⟨Ĥ⟩ is Ĥ. (1) is Ĥ, the TM described by ⟨Ĥ⟩. (2) (the string to which (1), AKA Ĥ, is applied) is ⟨Ĥ⟩. The line describes what Ĥ applied to ⟨Ĥ⟩ should do but, crucially, only if Ĥ applied to ⟨Ĥ⟩ does not halt. You always leave this last part of the specification out for obvious reasons. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 15 of 17 — ← Prev page 1 … 13 14 [15] 16 17 Next page →
Back to top | Article view | comp.theory
csiph-web