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 16 of 17 — ← Prev page 1 … 14 15 [16] 17 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-02 10:31 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) |
| Message-ID | <qqidnTbsxrWq5sX8nZ2dnUU7-V-dnZ2d@giganews.com> |
| In reply to | #40232 |
On 10/2/2021 10:14 AM, Ben Bacarisse wrote: > 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. > The problem is that when Linz refers to wM he calls it M. The input to H will be the description (encoded in some form) of M, say wM, as well as the input w. There is no M in H, yet he refers to an M in H q0 wM w ⊢* qn if M applied to w does not halt. To correct this error if the TM described by wM applied to w does not halt. There is no M in Ĥ, yet he refers to an M in Ĥ q0 wM ⊢* qx wM wM ⊢* qn if M applied to wM does not halt To correct this error if the TM described by wM applied to wM does not halt. There is only one instance of TM described by wM applied to wM in the above: qx(wM, wM) -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-02 09:58 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) |
| Message-ID | <sj9vip$mdp$1@dont-email.me> |
| In reply to | #40235 |
On 2021-10-02 09:31, olcott wrote: > The problem is that when Linz refers to wM he calls it M. > > The input to H will be the description (encoded in some form) of M, say > wM, as well as the input w. > > There is no M in H, yet he refers to an M in H > q0 wM w ⊢* qn > if M applied to w does not halt. > > To correct this error > if the TM described by wM applied to w does not halt. How on earth is this an "error"? wM means the description of M. "the TM described by wM" and "M" mean exactly the same thing. What need is there for adding this extra verbiage? André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-02 11:23 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) |
| Message-ID | <KJqdnUBd27v3GsX8nZ2dnUU7-YnNnZ2d@giganews.com> |
| In reply to | #40236 |
On 10/2/2021 10:58 AM, André G. Isaak wrote:
> On 2021-10-02 09:31, olcott wrote:
>
>> The problem is that when Linz refers to wM he calls it M.
>>
>> The input to H will be the description (encoded in some form) of M,
>> say wM, as well as the input w.
>>
>> There is no M in H, yet he refers to an M in H
>> q0 wM w ⊢* qn
>> if M applied to w does not halt.
>>
>> To correct this error
>> if the TM described by wM applied to w does not halt.
>
> How on earth is this an "error"?
>
> wM means the description of M.
>
> "the TM described by wM" and "M" mean exactly the same thing. What need
> is there for adding this extra verbiage?
>
> André
>
>
-----1----2-----3-----4--5-----6
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
We need the extra verbiage only because Ben and Richard falsely believe
that the Linz notation refers to (1) halting on (2) and not (4) halting
on (5).
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-02 12:44 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) |
| Message-ID | <L%%5J.21229$2e3.13388@fx29.iad> |
| In reply to | #40239 |
On 10/2/21 12:23 PM, olcott wrote: > On 10/2/2021 10:58 AM, André G. Isaak wrote: >> On 2021-10-02 09:31, olcott wrote: >> >>> The problem is that when Linz refers to wM he calls it M. >>> >>> The input to H will be the description (encoded in some form) of M, >>> say wM, as well as the input w. >>> >>> There is no M in H, yet he refers to an M in H >>> q0 wM w ⊢* qn >>> if M applied to w does not halt. >>> >>> To correct this error >>> if the TM described by wM applied to w does not halt. >> >> How on earth is this an "error"? >> >> wM means the description of M. >> >> "the TM described by wM" and "M" mean exactly the same thing. What >> need is there for adding this extra verbiage? >> >> André >> >> > > -----1----2-----3-----4--5-----6 > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > We need the extra verbiage only because Ben and Richard falsely believe > that the Linz notation refers to (1) halting on (2) and not (4) halting > on (5). > Why do you think that the phrase, "The Turing Machine described by wM" means anything other than M which is his name for the machine we otherwise call H^. M is the name used as a Formal Parameter when describing what H does when given ANY machine, and H^ is the particular example being given in the proof. (4) is NOT a Turing Machine, just a description. It CAN'T be the Turing Machine described by wM. That is like saying the picture of your cat IS your cat, and the picture needs to be feed and have its litter box cleaned. (4) (5) is the DESCRIPTION of the Turing Machine M/H^ being applied to the input w/<H^>. As I have asked, do you not understand the concept of Formal Parameters?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-02 23:00 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V3) |
| Message-ID | <877devf5nt.fsf@bsb.me.uk> |
| In reply to | #40235 |
olcott <NoOne@NoWhere.com> writes: > On 10/2/2021 10:14 AM, Ben Bacarisse wrote: >> 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. > > The problem is that when Linz refers to wM he calls it M. No he does not. Can you quote him making this gross error? (I'm going to put the subscripts back in what follows). > The input to H will be the description in (encoded in some form) of M, > say wM, as well as the input w. > > There is no M in H, yet he refers to an M in H > q0 wM w ⊢* qn > if M applied to w does not halt. Yes, there is no "M in H". (I'm going out on a limb here because it's not clear what you mean by that odd phrase. You don't understand bound and free variables so it would be hard to explain why it's such an odd thing to say.) All he refers to a string, w_M, as part of the input to H. That's not "[referring] to an M in H". That string, w_M, is the encoding of a TM. How else could H be presented with a halting problem instance? > To correct this error > if the TM described by wM applied to w does not halt. Or just "M applied to w does not halt". > There is no M in Ĥ, yet he refers to an M in Ĥ > q0 wM ⊢* qx wM wM ⊢* qn > if M applied to wM does not halt He refers to a string w_M as the sole input to Ĥ. (And you really should put the subscripts back on the ⊢*.) > To correct this error > if the TM described by wM applied to wM does not halt. Or just as Linz puts it, if M applied to wM does not halt. You seem not to have grasped what Linz is saying. How long have you been studying these three pages? Nine years? > There is only one instance of > TM described by wM applied to wM in the above: qx(wM, wM) There are none, in fact. This will take about six months for you work out, and that's only if you really try to work it out. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-02 11:15 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <oI_5J.61779$6U3.647@fx43.iad> |
| In reply to | #40229 |
On 10/2/21 10:16 AM, olcott wrote: > On 10/2/2021 5:54 AM, Richard Damon wrote: >> >> On 10/2/21 12:10 AM, olcott wrote: >>> On 10/1/2021 7:08 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/1/2021 5:22 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/1/2021 3:44 PM, Ben Bacarisse wrote: >>>>>>>> Oh dear, you've posted about TMs again... >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>> And the correct annotation for this line is "if (and only if) Ĥ >>>>>>>> applied >>>>>>>> to ⟨Ĥ⟩ does not halt". >>>>>>> >>>>>>> Flat out totally incorrect. >>>>>> Linz is not wrong about how he himself specifies the behaviour of Ĥ. >>>>>> It's his specification. You /could/ reject that specification, >>>>>> but in >>>>>> fact you insist that you only ever use Ĥ to refer to Linz's Ĥ. >>>>>> You dishonestly leave off a key part of his specification because you >>>>>> don't want to keep seeing the problem. >>>>>> >>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>> >>>>>> What is correct is determined by the annotation you keep dishonestly >>>>>> omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does >>>>>> not >>>>>> halt. >>>>> >>>>> That is flatly false. >>>> >>>> No, it's right there in Linz. It's dishonest to remove the key thing >>>> about the line you keep writing, but I know you have to remove it. >>>> There is no other way for you to avoid Linz's conclusion. >>>> >>> >>> Beginning with the Linz H >>> q0 wM w ⊢* qn >>> if M applied to w does not halt. >>> >>> When Linz refers to M applied to wM there is no M in the Linz template >>> so we have to go back to these words to see what M applied to wM means: >> >> NO. Maybe you don't understand what a 'Formal Parameter' is. Let us go >> back to what Linz said: >> >>> The input to H will be the description (encoded in some form) of M, >>> say WM, as well as the input w. >> >> So M is the Turing Machine previous mentioned in the description of what >> the Halting Problem's Question was: >> >>> Simply stated, the problem is: given the description of a Turing >>> machine M and an input w, does M, when started in the initial >>> configuration qow, perform a computation that eventually halts? >> >> So M is NOT an 'undefined term that we need to figure out what it >> means', that is a lie. >> >> M is the machine that the decider is supposed to decider, it is in >> Software Engineering terms, a Formal Parameter to the Halting Decider. >> >> Just like when we write the definition of H(P,I) as a function >> definition, the P and I are the names of the Formal Parameters, that >> when we later call H(H_hat, H_hat) get filled in by the values from the >> calling site. >> >> Is that why you suddenly changed the name of the machine to be decided, >> because having the formal parameter named P and the passed parameter >> named H_hat was too confusing for you? >> >>> >>> The input to H will be the description (encoded in some form) of M, say >>> wM, as well as the input w. >>> >>> M applied to wM means: The TM described by wM applied to w. >>> >> >> Right, the question is about the behavior of the ACTUAL Turing Machine >> >>> >>> >>> >>> Now onto the Linz Ĥ >>> ---1---2--------3---4---5-------6 >>> q0 wM ⊢* qx wM wM ⊢* qn >>> >>> if M applied to wM does not halt >>> is translated into >>> >>> The TM described by wM applied to wM does not halt >>> is translated into >>> >>> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>> >>> -----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. You don't seem to understand English grammer. The answer to your first statement is of course it does. The Turing Machine describe by <H^> is the machine starting at H^.q0 which is exactly what (1) is. (2) says that this machine is applied to the required input <H^> The Turing Machine described by <H^> applied to <H^> is thus exactly what is shown as (1) applied to (2), which as shown goes to at (6) to H^.qn which halts. Your second statement while true, is irrelevent. The first statement doesn't refer (1) a Turing Machine Description, but the machine desscribed by the description at (4) namely <H^>, which it is. > > There is only one place where a described by ⟨Ĥ⟩ is applied to ⟨Ĥ⟩. You dropped a word (I suspect intentionally) There is only one place where the Turing Machine described by <H^> is applied to <H^> and that is at (1). (4) (5) is a description of this application, which is the input to H at (3), which it needs to use to figure out what will happen from (1) (2). > >> as halting at (6) when it gets to (6) H^.qn which is by definition a >> Halting state as it is the unaltered copy of H.qn which is where H >> halted with its answer. >> >> You quote all the right words, and even start off describing them right, >> and then turn off the road and change the question form being about the >> Turing Machine described to the partial simulaton of the machine by H. >> > >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-02 17:34 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <87zgrrfkr8.fsf@bsb.me.uk> |
| In reply to | #40224 |
olcott <NoOne@NoWhere.com> writes:
> On 10/1/2021 7:08 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/1/2021 5:22 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its
>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the
>>>>> transition of Ĥ.qx to Ĥ.qn is correct.
>>>>
>>>> What is correct is determined by the annotation you keep dishonestly
>>>> omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does not
>>>> halt.
>>>
>>> That is flatly false.
>>
>> No, it's right there in Linz. It's dishonest to remove the key thing
>> about the line you keep writing, but I know you have to remove it.
>> There is no other way for you to avoid Linz's conclusion.
Just a few corrections...
> Beginning with the Linz H
> q0 wM w ⊢* qn
> if M applied to w does not halt.
>
> When Linz refers to M applied to wM there is no M in the Linz template
> so we have to go back to these words to see what M applied to wM
> means:
>
> The input to H will be the description (encoded in some form) of M, say
> wM, as well as the input w.
>
> M applied to wM means: The TM described by wM applied to w.
No, it means the TM described by w_M applied to w_M. I suspect the w at
the end is a typo. But since there's a perfectly good name for the TM
described by w_M -- it's called M -- there was not need for this detour.
His words are perfectly clear.
> Now onto the Linz Ĥ
> ---1---2--------3---4---5-------6
> q0 wM ⊢* qx wM wM ⊢* qn
>
> if M applied to wM does not halt
> is translated into
>
> The TM described by wM
I.e. M
> applied to wM does not halt
You got it right this time. I think the w above is just a typo.
> is translated into
>
> The TM described by ⟨Ĥ⟩
I.e. Ĥ
> applied to ⟨Ĥ⟩ does not halt.
Yup. So why do you keep leaving these crucial words out when you write
> ---1----2-----3-----4--5-----6
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
if Ĥ (the TM described by ⟨Ĥ⟩) applied to ⟨Ĥ⟩ does not halt
?
> There is only one place in the above where this exists:
> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩
Well (1) applied to (2) is the TM described by ⟨Ĥ⟩ (i.e. Ĥ) applied to
⟨Ĥ⟩.
But you are presumably referring to (4) (5). That's a string
/representing/ the computation of Ĥ (the TM described by ⟨Ĥ⟩) applied to
⟨Ĥ⟩.
The fact that there is an extra level of encoding is important. It's
one reason I prefer my notation. It makes all the representations
explicit, but you refused to use it years ago.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-02 12:48 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <a306J.21230$2e3.2256@fx29.iad> |
| In reply to | #40240 |
On 10/2/21 12:34 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/1/2021 7:08 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/1/2021 5:22 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: > >>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>> >>>>> What is correct is determined by the annotation you keep dishonestly >>>>> omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does not >>>>> halt. >>>> >>>> That is flatly false. >>> >>> No, it's right there in Linz. It's dishonest to remove the key thing >>> about the line you keep writing, but I know you have to remove it. >>> There is no other way for you to avoid Linz's conclusion. > > Just a few corrections... > >> Beginning with the Linz H >> q0 wM w ⊢* qn >> if M applied to w does not halt. >> >> When Linz refers to M applied to wM there is no M in the Linz template >> so we have to go back to these words to see what M applied to wM >> means: >> >> The input to H will be the description (encoded in some form) of M, say >> wM, as well as the input w. >> >> M applied to wM means: The TM described by wM applied to w. > > No, it means the TM described by w_M applied to w_M. I suspect the w at > the end is a typo. But since there's a perfectly good name for the TM > described by w_M -- it's called M -- there was not need for this detour. > His words are perfectly clear. > >> Now onto the Linz Ĥ >> ---1---2--------3---4---5-------6 >> q0 wM ⊢* qx wM wM ⊢* qn >> >> if M applied to wM does not halt >> is translated into >> >> The TM described by wM > > I.e. M > >> applied to wM does not halt > > You got it right this time. I think the w above is just a typo. The q0 wM w ⊢* qn is the specification of H, not H^. H is applied to wM w as an input. PO just keeps switching what he talks about and uses characters that are a bit hard to distinguish. > >> is translated into >> >> The TM described by ⟨Ĥ⟩ > > I.e. Ĥ > >> applied to ⟨Ĥ⟩ does not halt. > > Yup. So why do you keep leaving these crucial words out when you write > >> ---1----2-----3-----4--5-----6 >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > if Ĥ (the TM described by ⟨Ĥ⟩) applied to ⟨Ĥ⟩ does not halt > > ? > >> There is only one place in the above where this exists: >> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ > > Well (1) applied to (2) is the TM described by ⟨Ĥ⟩ (i.e. Ĥ) applied to > ⟨Ĥ⟩. > > But you are presumably referring to (4) (5). That's a string > /representing/ the computation of Ĥ (the TM described by ⟨Ĥ⟩) applied to > ⟨Ĥ⟩. > > The fact that there is an extra level of encoding is important. It's > one reason I prefer my notation. It makes all the representations > explicit, but you refused to use it years ago. >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-02 21:15 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <87tuhzfak9.fsf@bsb.me.uk> |
| In reply to | #40243 |
Richard Damon <Richard@Damon-Family.org> writes: > On 10/2/21 12:34 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >>> M applied to wM means: The TM described by wM applied to w. <snip> >>> if M applied to wM does not halt >>> is translated into >>> >>> The TM described by wM >> >> I.e. M >> >>> applied to wM does not halt >> >> You got it right this time. I think the w above is just a typo. > > > The q0 wM w ⊢* qn > > is the specification of H, not H^. > > H is applied to wM w as an input. Yes, but that's not what I'm talking about. (And when I say he got it right I juts mean it's not technically wrong. It's still a silly way to put it.) I'm talking about this line: ||| M applied to wM means: The TM described by wM applied to w. I don't think he intended to write that lone w, but the whole digression is peculiar so goodness knows what he meant. But later on he does not use the same "translation", just a pointless renaming of M as "[t]he TM described by wM": ||| if M applied to wM does not halt ||| is translated into ||| ||| The TM described by wM applied to wM does not halt -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-02 16:02 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <I7ednc8C9phTVcX8nZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #40257 |
On 10/2/2021 3:15 PM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 10/2/21 12:34 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > >>>> M applied to wM means: The TM described by wM applied to w. > <snip> >>>> if M applied to wM does not halt >>>> is translated into >>>> >>>> The TM described by wM >>> >>> I.e. M >>> >>>> applied to wM does not halt >>> >>> You got it right this time. I think the w above is just a typo. >> >> >> The q0 wM w ⊢* qn >> >> is the specification of H, not H^. >> >> H is applied to wM w as an input. > > Yes, but that's not what I'm talking about. (And when I say he got it > right I juts mean it's not technically wrong. It's still a silly way to > put it.) > > I'm talking about this line: > > ||| M applied to wM means: The TM described by wM applied to w. > > I don't think he intended to write that lone w, but the whole digression > is peculiar so goodness knows what he meant. > w is the arbitrary finite string that H deals with. wM is the TM description finite string that Ĥ deals with. > But later on he does not use the same "translation", just a pointless > renaming of M as "[t]he TM described by wM": > > ||| if M applied to wM does not halt > ||| is translated into > ||| > ||| The TM described by wM applied to wM does not halt > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn Transitioning to Ĥ.qn is based on this decision: Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn The fact that Ĥ halts on input ⟨Ĥ⟩ does not contradict the fact that the input to Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ never halts. This is apparently too difficult for you to understand. It is very very difficult and cannot be understood until after every single detail of the actual complete computation has been studied. No one ever does this. The x86utm C/x86 version is as close as anyone has ever come to studying every single detail of the essential algorithm. Most people simply dismiss it as impossible on the basis that they falsely believe it is a contradiction. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-02 17:30 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <dc46J.164572$o45.8486@fx46.iad> |
| In reply to | #40259 |
On 10/2/21 5:02 PM, olcott wrote: > On 10/2/2021 3:15 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 10/2/21 12:34 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >> >>>>> M applied to wM means: The TM described by wM applied to w. >> <snip> >>>>> if M applied to wM does not halt >>>>> is translated into >>>>> >>>>> The TM described by wM >>>> >>>> I.e. M >>>> >>>>> applied to wM does not halt >>>> >>>> You got it right this time. I think the w above is just a typo. >>> >>> >>> The q0 wM w ⊢* qn >>> >>> is the specification of H, not H^. >>> >>> H is applied to wM w as an input. >> >> Yes, but that's not what I'm talking about. (And when I say he got it >> right I juts mean it's not technically wrong. It's still a silly way to >> put it.) >> >> I'm talking about this line: >> >> ||| M applied to wM means: The TM described by wM applied to w. >> >> I don't think he intended to write that lone w, but the whole digression >> is peculiar so goodness knows what he meant. >> > > w is the arbitrary finite string that H deals with. > wM is the TM description finite string that Ĥ deals with. > >> But later on he does not use the same "translation", just a pointless >> renaming of M as "[t]he TM described by wM": >> >> ||| if M applied to wM does not halt >> ||| is translated into >> ||| >> ||| The TM described by wM applied to wM does not halt >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > > Transitioning to Ĥ.qn is based on this decision: Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > The fact that Ĥ halts on input ⟨Ĥ⟩ > does not contradict the fact that the input to Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ never halts. But that isn't the question that H is supposed to answer. So H gets the right answer to the wrong question and the wrong answer to the right question. It is just WRONG. > > This is apparently too difficult for you to understand. > > It is very very difficult and cannot be understood until after every > single detail of the actual complete computation has been studied. No, it doesn't. I just requires looking at the RIGHT question, seeing what the two Computations do, and seeing that H says that H^(<H^>) won't halt when it does, and is thus wrong. > > No one ever does this. The x86utm C/x86 version is as close as anyone > has ever come to studying every single detail of the essential algorithm. > > Most people simply dismiss it as impossible on the basis that they > falsely believe it is a contradiction. Since you won't let anyone else see the 'magical' code that does the impossible, of course no one will believe you. You have been just plain wrong on so many things, you have no reputation to support such a wild claim. Note, the basic answer seems to be that your x86 code is not actually a Computation, the fact that you have just recently seemed to have even a bit of an understanding of this tends to support the idea. You still seem to be claiming that two copies of the computation can return different answers (maybe they are two different computations, but they are the same code and the same data, so that just means it can't be a computation at all). Really, the only way to 'disprove' the Halting Theorem is to find a fatal flaw that just destroys all of the logic of math. You sort of have it, the idea that All Truth is Provable, if you put that into Math, then it is shown to totally fall apart, but that is know, and that is why it is accepted that in Math, not all Truths are provable, and that such a logic system is not compatible with this level of Math.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-02 12:12 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <8_udnUye9uOYDsX8nZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #40240 |
On 10/2/2021 11:34 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 10/1/2021 7:08 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/1/2021 5:22 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>
>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its
>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the
>>>>>> transition of Ĥ.qx to Ĥ.qn is correct.
>>>>>
>>>>> What is correct is determined by the annotation you keep dishonestly
>>>>> omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does not
>>>>> halt.
>>>>
>>>> That is flatly false.
>>>
>>> No, it's right there in Linz. It's dishonest to remove the key thing
>>> about the line you keep writing, but I know you have to remove it.
>>> There is no other way for you to avoid Linz's conclusion.
>
> Just a few corrections...
>
>> Beginning with the Linz H
>> q0 wM w ⊢* qn
>> if M applied to w does not halt.
>>
>> When Linz refers to M applied to wM there is no M in the Linz template
>> so we have to go back to these words to see what M applied to wM
>> means:
>>
>> The input to H will be the description (encoded in some form) of M, say
>> wM, as well as the input w.
>>
>> M applied to wM means: The TM described by wM applied to w.
>
> No, it means the TM described by w_M applied to w_M. I suspect the w at
> the end is a typo.
Not a typo, it is referring to H.
https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
The input to H will be the description (encoded in some form)
of M, say w_M, as well as the input w. (Linz:1990:318)
> But since there's a perfectly good name for the TM
> described by w_M -- it's called M -- there was not need for this detour.
> His words are perfectly clear.
>
>> Now onto the Linz Ĥ
>> ---1---2--------3---4---5-------6
>> q0 wM ⊢* qx wM wM ⊢* qn
>>
>> if M applied to wM does not halt
>> is translated into
>>
>> The TM described by wM
>
> I.e. M
>
>> applied to wM does not halt
>
> You got it right this time. I think the w above is just a typo.
>
H refers to w and Ĥ refers to w_M
For H "w" is an arbitrary finite string
for Ĥ "w_M" is a finite string TM description.
>> is translated into
>>
>> The TM described by ⟨Ĥ⟩
>
> I.e. Ĥ
>
>> applied to ⟨Ĥ⟩ does not halt.
>
> Yup. So why do you keep leaving these crucial words out when you write
>
Because the notational convention of ⟨Ĥ⟩ already says that it is a
finite string TM decription of Ĥ.
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ reaches its final
state. (Halts)
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its
final state. (Does not halt)
>> ---1----2-----3-----4--5-----6
>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>
> if Ĥ (the TM described by ⟨Ĥ⟩) applied to ⟨Ĥ⟩ does not halt
>
> ?
>
>> There is only one place in the above where this exists:
>> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩
>
> Well (1) applied to (2) is the TM described by ⟨Ĥ⟩ (i.e. Ĥ) applied to
> ⟨Ĥ⟩.
You know that (1) is not where the halt decider is.
You know that (1) is only where Ĥ copies its input ⟨Ĥ⟩.
You know the actual input (4)(5) to the actual halt decider (3).
Why lie?
> But you are presumably referring to (4) (5). That's a string
> /representing/ the computation of Ĥ (the TM described by ⟨Ĥ⟩) applied to
> ⟨Ĥ⟩.
>
> The fact that there is an extra level of encoding is important. It's
> one reason I prefer my notation. It makes all the representations
> explicit, but you refused to use it years ago.
>
--
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-02 22:26 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ Are we there yet ? ] (V2) |
| Message-ID | <87lf3bf78d.fsf@bsb.me.uk> |
| In reply to | #40246 |
olcott <NoOne@NoWhere.com> writes: > On 10/2/2021 11:34 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/1/2021 7:08 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/1/2021 5:22 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >> >>>>>>> Ĥ.qx(⟨Ĥ⟩, ⟨Ĥ⟩) the simulation of the input to Ĥ.qx never reaches its >>>>>>> final state whether or not Ĥ.qx aborts this simulation therefore the >>>>>>> transition of Ĥ.qx to Ĥ.qn is correct. >>>>>> >>>>>> What is correct is determined by the annotation you keep dishonestly >>>>>> omitting. Ĥ(⟨Ĥ⟩) transitions to Ĥ.qn if (and only if) Ĥ(⟨Ĥ⟩) does not >>>>>> halt. >>>>> >>>>> That is flatly false. >>>> >>>> No, it's right there in Linz. It's dishonest to remove the key thing >>>> about the line you keep writing, but I know you have to remove it. >>>> There is no other way for you to avoid Linz's conclusion. >> Just a few corrections... >> >>> Beginning with the Linz H >>> q0 wM w ⊢* qn >>> if M applied to w does not halt. >>> >>> When Linz refers to M applied to wM there is no M in the Linz template >>> so we have to go back to these words to see what M applied to wM >>> means: >>> >>> The input to H will be the description (encoded in some form) of M, say >>> wM, as well as the input w. >>> >>> M applied to wM means: The TM described by wM applied to w. >> No, it means the TM described by w_M applied to w_M. I suspect the w at >> the end is a typo. > > Not a typo, Ah, then it's a mistake, plain and simple. Your claim: "M applied to wM means: The TM described by wM applied to w." is just wrong. The two phrases do not mean the same thing at all. I really think you should just stop talking about TMs. The whole topic, with all theis symbolic notation, is just baffling you. > it is referring to H. > > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > The input to H will be the description (encoded in some form) > of M, say w_M, as well as the input w. (Linz:1990:318) *sigh* Nothing here alters the fact that "M applied to wM" does not mean "the TM described by wM applied to w". >> But since there's a perfectly good name for the TM >> described by w_M -- it's called M -- there was not need for this detour. >> His words are perfectly clear. >> >>> Now onto the Linz Ĥ >>> ---1---2--------3---4---5-------6 >>> q0 wM ⊢* qx wM wM ⊢* qn >>> >>> if M applied to wM does not halt >>> is translated into >>> >>> The TM described by wM >> I.e. M >> >>> applied to wM does not halt >> You got it right this time. I think the w above is just a typo. >> > > H refers to w and Ĥ refers to w_M Oh dear. TMs don't "refer" to anything. w and w_M are simply used by Linz to name the strings in his formal descriptions of what the TMs do. > For H "w" is an arbitrary finite string > for Ĥ "w_M" is a finite string TM description. Yes. >>> is translated into >>> >>> The TM described by ⟨Ĥ⟩ >> I.e. Ĥ >> >>> applied to ⟨Ĥ⟩ does not halt. >> Yup. So why do you keep leaving these crucial words out when you write > > Because the notational convention of ⟨Ĥ⟩ already says that it is a > finite string TM decription of Ĥ. You can word it that way -- "the TM described by ⟨Ĥ⟩" rather than simply "Ĥ" -- if you want to but you don't. You either leave it off or replace it with your garbage. > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ reaches its final > state. (Halts) This is not what Linz says about Ĥ. How can you honestly think you can replace part of the specification and be taken seriously? You can copy Linz and say Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ if Ĥ applied to ⟨Ĥ⟩ halts. or you can use you extra wordy form Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ if the TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts. but it's wrong to replace it with your new junk wording. And since you've been told this many times, I can only call it down right dishonest. > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state. (Does not halt) Again, not what Linz says about Ĥ. You've removed the correct specification and replaced it with junk. >>> ---1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> if Ĥ (the TM described by ⟨Ĥ⟩) applied to ⟨Ĥ⟩ does not halt >> ? >> >>> There is only one place in the above where this exists: >>> The TM described by ⟨Ĥ⟩ applied to ⟨Ĥ⟩ >> Well (1) applied to (2) is the TM described by ⟨Ĥ⟩ (i.e. Ĥ) applied to >> ⟨Ĥ⟩. > > You know that (1) is not where the halt decider is. Yes. (1) is where the TM described by ⟨Ĥ⟩, i.e. Ĥ is applied to ⟨Ĥ⟩ as I said. > You know that (1) is only where Ĥ copies its input ⟨Ĥ⟩. Yes. That's the first step performed by the TM described by ⟨Ĥ⟩, i.e. Ĥ, when it is applied to ⟨Ĥ⟩. > You know the actual input (4)(5) to the actual halt decider (3). Yes (give or take the fact that the sub-TM at qx is not a decider at all because it has no accepting state). But that is not where "The TM described by ⟨Ĥ⟩ [is] applied to ⟨Ĥ⟩". That is (1) applied to (2), as I said. > Why lie? I don't lie. (1) applied to (2) is indeed where "[t]he TM described by ⟨Ĥ⟩ [is] applied to ⟨Ĥ⟩". I would appreciate it if you would think back on all times you've accused me of lying, playing word games or, in once case, being mad. It always turns out that you have some basic misunderstanding, such as what a function is in mathematics, or what a triple is in set theory. So, unless you are trolling, when you are tempted to say I am lying remember how often you have been wrong about that. That said, I've never come across someone so at see with this notation so I am struggling to accept that you really believe what you are writing. Are you, in fact, just trolling to see what flies and what goes down in flames? Do you seriously think that removing Linz's annotations and replacing them with your own is in any way reasonable? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-01 12:26 -0600 |
| Message-ID | <sj7js1$gel$1@dont-email.me> |
| In reply to | #40168 |
On 2021-10-01 10:46, olcott wrote:
> A key element that had taken me by complete surprise is that some things
> that are C/x86 computable are not TM computable. I had previously
> thought that the Church-Turing thesis confirmed that any and all things
> that any physically existing computer can do a TM can compute.
As Andy Walker already correctly pointed out this isn't actually true.
What is true, though, is that the formal parameters given to a C
function do not necessarily correspond to the input string of the
corresponding Turing Machine, nor does the return value of that function
necessarily correspond to the 'output' of the corresponding Turing Machine.
When you declare a C function as follows:
int foo(someType x, someOtherType y) { ... }
x and y are not necessarily the only inputs to foo -- they are merely
the input values which are passed on the stack. Any information
retrieved from global or static variables etc. is also part of the
functions input; it's just not explicitly declared as such.
Similarly, the while the above function returns an int, that may or may
not be the only information it returns. In many functions the most
important information might be returned as part of a struct to which it
was passed a pointer as one of its formal parameters and the int
returned might simply indicate success or failure.
As a concrete example, consider the following C function:
typedef struct Record {
int a;
int b;
int c;
};
int someGlobal;
int foo(int x, int y Record *z) {
return ((x * y + z.a - z.c) * someGlobal));
}
The C function has three inputs consisting of two integers and an address.
The corresponding Turing Machine would have a string representing four
integers as its inputs. Those four integers would correspond to
x, y, z.a z.c someGlobal
That is, the input string must include all data which is actually to be
used by the computation. Since z.b is not accessed it needn't be
considered as part of the input. When pointers are used, it will
generally be the data which is pointed to rather than the address itself
which counts as part of the input. If the actual value of the address
plays a critical role in your computation (for example, determining if
two functions are the same by virtue of having the same address), then
that address would consitute a separate piece of information which must
be part of the input string.
So the difference between C and TMs is really that in C code is
expressed in a way which doesn't make clear what the actual input to any
given function is since declarations only explicitly show data that is
communicated in particular ways. In some cases, the data passed on the
stack may correspond to the actual input to the function, but in many
cases it will only represent a subset of the input.
When people state that your H or P are not implementable as Turing
Machines, what's really intended is that your H and P are not
implementable as Turing Machines of the types required by the Linz
proof, i.e. Turing Machines whose input consists of a string consisting
only of a Turing Machine description and a string representing the input
to that machine.
The Halting problem constrains your C function to only making use of
those two pieces of input.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 13:42 -0500 |
| Message-ID | <-ZydnYP5dL0ey8r8nZ2dnUU7-c3NnZ2d@giganews.com> |
| In reply to | #40180 |
On 10/1/2021 1:26 PM, André G. Isaak wrote:
> On 2021-10-01 10:46, olcott wrote:
>
>> A key element that had taken me by complete surprise is that some
>> things that are C/x86 computable are not TM computable. I had
>> previously thought that the Church-Turing thesis confirmed that any
>> and all things that any physically existing computer can do a TM can
>> compute.
>
> As Andy Walker already correctly pointed out this isn't actually true.
>
> What is true, though, is that the formal parameters given to a C
> function do not necessarily correspond to the input string of the
> corresponding Turing Machine, nor does the return value of that function
> necessarily correspond to the 'output' of the corresponding Turing Machine.
>
> When you declare a C function as follows:
>
> int foo(someType x, someOtherType y) { ... }
>
> x and y are not necessarily the only inputs to foo -- they are merely
> the input values which are passed on the stack. Any information
> retrieved from global or static variables etc. is also part of the
> functions input; it's just not explicitly declared as such.
>
> Similarly, the while the above function returns an int, that may or may
> not be the only information it returns. In many functions the most
> important information might be returned as part of a struct to which it
> was passed a pointer as one of its formal parameters and the int
> returned might simply indicate success or failure.
>
> As a concrete example, consider the following C function:
>
> typedef struct Record {
> int a;
> int b;
> int c;
> };
>
> int someGlobal;
>
> int foo(int x, int y Record *z) {
> return ((x * y + z.a - z.c) * someGlobal));
> }
>
> The C function has three inputs consisting of two integers and an address.
>
> The corresponding Turing Machine would have a string representing four
> integers as its inputs. Those four integers would correspond to
>
> x, y, z.a z.c someGlobal
>
> That is, the input string must include all data which is actually to be
> used by the computation. Since z.b is not accessed it needn't be
> considered as part of the input. When pointers are used, it will
> generally be the data which is pointed to rather than the address itself
> which counts as part of the input. If the actual value of the address
> plays a critical role in your computation (for example, determining if
> two functions are the same by virtue of having the same address), then
> that address would consitute a separate piece of information which must
> be part of the input string.
>
> So the difference between C and TMs is really that in C code is
> expressed in a way which doesn't make clear what the actual input to any
> given function is since declarations only explicitly show data that is
> communicated in particular ways. In some cases, the data passed on the
> stack may correspond to the actual input to the function, but in many
> cases it will only represent a subset of the input.
>
> When people state that your H or P are not implementable as Turing
> Machines, what's really intended is that your H and P are not
> implementable as Turing Machines of the types required by the Linz
> proof, i.e. Turing Machines whose input consists of a string consisting
> only of a Turing Machine description and a string representing the input
> to that machine.
>
> The Halting problem constrains your C function to only making use of
> those two pieces of input.
>
> André
>
Let me know if the following does not fully address all of your points:
In my update the inputs are finite strings, P copies its input and both
H1 and H are pure functions according to the following criteria:
In computer programming, a pure function is a function that has the
following properties:
(1) The function return values are identical for identical arguments (no
variation with local static variables, non-local variables, mutable
reference arguments or input streams).
(2) The function application has no side effects (no mutation of local
static variables, non-local variables, mutable reference arguments or
input/output streams).
https://en.wikipedia.org/wiki/Pure_function
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-01 13:07 -0600 |
| Message-ID | <sj7m8p$4ci$1@dont-email.me> |
| In reply to | #40182 |
On 2021-10-01 12:42, olcott wrote: > Let me know if the following does not fully address all of your points: It's pretty much impossible to evaluate what you're doing without seeing actual code. But the main failing of your current model isn't merely that you've got sources of input which aren't declared as formal paramters; it's that you're alleged 'Turing Machines' are not self-contained. They have overlapping code which means you're really only dealing with a single Machine, not two separate ones. Turing Machines, as was pointed out already by Richard, are entirely complete, self-contained objects. They have no operating system. They make no reference to instructions which are not part of themselves. When writing in C, different routines can have overlapping code. It's fine to do this if its done purely as a matter of convenience, but if you wanted to translate different C functions into actual Turing Machines, each machine would have to contain its own copy of all of the shared code. In your approach, however, the sharing of code is *not* being done simply as a matter of convenience. You critically rely on the fact that code of your H is shared by your P since your H checks the address of the call inside P to determine that it is calling 'itself'. That means your H and P cannot be construed as distinct computations but as part of a single, intertwined computation. If you want to claim your H and P correspond to Linz's H and H_Hat you simply cannot do that. They must each be capable of operating entirely independently of one another. > In my update the inputs are finite strings, P copies its input and both > H1 and H are pure functions according to the following criteria: > > In computer programming, a pure function is a function that has the > following properties: > > (1) The function return values are identical for identical arguments (no > variation with local static variables, non-local variables, mutable > reference arguments or input streams). > > (2) The function application has no side effects (no mutation of local > static variables, non-local variables, mutable reference arguments or > input/output streams). > > https://en.wikipedia.org/wiki/Pure_function You're not going to learn computational theory from reading Wikipedia. Why not actually study Linz? That means not just looking at chapter twelve, but also *carefully* going through chapters 1-11 first. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 14:18 -0500 |
| Message-ID | <HeadnTMO8NqJwsr8nZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #40183 |
On 10/1/2021 2:07 PM, André G. Isaak wrote: > On 2021-10-01 12:42, olcott wrote: > >> Let me know if the following does not fully address all of your points: > > > It's pretty much impossible to evaluate what you're doing without seeing > actual code. > > But the main failing of your current model isn't merely that you've got > sources of input which aren't declared as formal paramters; it's that > you're alleged 'Turing Machines' are not self-contained. They have > overlapping code which means you're really only dealing with a single > Machine, not two separate ones. > > Turing Machines, as was pointed out already by Richard, are entirely > complete, self-contained objects. They have no operating system. They > make no reference to instructions which are not part of themselves. > > When writing in C, different routines can have overlapping code. It's > fine to do this if its done purely as a matter of convenience, but if > you wanted to translate different C functions into actual Turing > Machines, each machine would have to contain its own copy of all of the > shared code. > > In your approach, however, the sharing of code is *not* being done > simply as a matter of convenience. You critically rely on the fact that > code of your H is shared by your P since your H checks the address of > the call inside P to determine that it is calling 'itself'. That means > your H and P cannot be construed as distinct computations but as part of > a single, intertwined computation. If you want to claim your H and P > correspond to Linz's H and H_Hat you simply cannot do that. They must > each be capable of operating entirely independently of one another. > When a halt decider is evaluating whether or not its input halts on its input by simulating this input, then we have at least two distinctly different computations. >> In my update the inputs are finite strings, P copies its input and >> both H1 and H are pure functions according to the following criteria: >> >> In computer programming, a pure function is a function that has the >> following properties: >> >> (1) The function return values are identical for identical arguments >> (no variation with local static variables, non-local variables, >> mutable reference arguments or input streams). >> >> (2) The function application has no side effects (no mutation of local >> static variables, non-local variables, mutable reference arguments or >> input/output streams). >> >> https://en.wikipedia.org/wiki/Pure_function > > You're not going to learn computational theory from reading Wikipedia. > Why not actually study Linz? That means not just looking at chapter > twelve, but also *carefully* going through chapters 1-11 first. > > André > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-01 14:34 -0600 |
| Message-ID | <sj7rdh$dga$1@dont-email.me> |
| In reply to | #40184 |
On 2021-10-01 13:18, olcott wrote: > On 10/1/2021 2:07 PM, André G. Isaak wrote: >> On 2021-10-01 12:42, olcott wrote: >> >>> Let me know if the following does not fully address all of your points: >> >> >> It's pretty much impossible to evaluate what you're doing without >> seeing actual code. >> >> But the main failing of your current model isn't merely that you've >> got sources of input which aren't declared as formal paramters; it's >> that you're alleged 'Turing Machines' are not self-contained. They >> have overlapping code which means you're really only dealing with a >> single Machine, not two separate ones. >> >> Turing Machines, as was pointed out already by Richard, are entirely >> complete, self-contained objects. They have no operating system. They >> make no reference to instructions which are not part of themselves. >> >> When writing in C, different routines can have overlapping code. It's >> fine to do this if its done purely as a matter of convenience, but if >> you wanted to translate different C functions into actual Turing >> Machines, each machine would have to contain its own copy of all of >> the shared code. >> >> In your approach, however, the sharing of code is *not* being done >> simply as a matter of convenience. You critically rely on the fact >> that code of your H is shared by your P since your H checks the >> address of the call inside P to determine that it is calling 'itself'. >> That means your H and P cannot be construed as distinct computations >> but as part of a single, intertwined computation. If you want to claim >> your H and P correspond to Linz's H and H_Hat you simply cannot do >> that. They must each be capable of operating entirely independently of >> one another. >> > > When a halt decider is evaluating whether or not its input halts on its > input by simulating this input, then we have at least two distinctly > different computations. Yes, but the problem is that in your code H and P are *not* distinct computations. You have P calling H which means that P is not actually independent from H because P shares the code of H. If the input to H is to be construed as a distinct, independent computation, then it must be *entirely* self-contained. It must contain *all* of the code which it makes use of within itself. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 15:52 -0500 |
| Message-ID | <b6Wdnc0Xsttk6cr8nZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #40192 |
On 10/1/2021 3:34 PM, André G. Isaak wrote: > On 2021-10-01 13:18, olcott wrote: >> On 10/1/2021 2:07 PM, André G. Isaak wrote: >>> On 2021-10-01 12:42, olcott wrote: >>> >>>> Let me know if the following does not fully address all of your points: >>> >>> >>> It's pretty much impossible to evaluate what you're doing without >>> seeing actual code. >>> >>> But the main failing of your current model isn't merely that you've >>> got sources of input which aren't declared as formal paramters; it's >>> that you're alleged 'Turing Machines' are not self-contained. They >>> have overlapping code which means you're really only dealing with a >>> single Machine, not two separate ones. >>> >>> Turing Machines, as was pointed out already by Richard, are entirely >>> complete, self-contained objects. They have no operating system. They >>> make no reference to instructions which are not part of themselves. >>> >>> When writing in C, different routines can have overlapping code. It's >>> fine to do this if its done purely as a matter of convenience, but if >>> you wanted to translate different C functions into actual Turing >>> Machines, each machine would have to contain its own copy of all of >>> the shared code. >>> >>> In your approach, however, the sharing of code is *not* being done >>> simply as a matter of convenience. You critically rely on the fact >>> that code of your H is shared by your P since your H checks the >>> address of the call inside P to determine that it is calling >>> 'itself'. That means your H and P cannot be construed as distinct >>> computations but as part of a single, intertwined computation. If you >>> want to claim your H and P correspond to Linz's H and H_Hat you >>> simply cannot do that. They must each be capable of operating >>> entirely independently of one another. >>> >> >> When a halt decider is evaluating whether or not its input halts on >> its input by simulating this input, then we have at least two >> distinctly different computations. > > > Yes, but the problem is that in your code H and P are *not* distinct > computations. You have P calling H which means that P is not actually > independent from H because P shares the code of H. > It turns out that for my revised computation it is equivalent to a monolithic single block of code. For my revised computation I could embed H directly in P and the results of the computation would not change. > If the input to H is to be construed as a distinct, independent > computation, then it must be *entirely* self-contained. It must contain > *all* of the code which it makes use of within itself. > > André > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-01 16:17 -0600 |
| Message-ID | <sj81di$12i$1@dont-email.me> |
| In reply to | #40197 |
On 2021-10-01 14:52, olcott wrote: > On 10/1/2021 3:34 PM, André G. Isaak wrote: >> On 2021-10-01 13:18, olcott wrote: >>> When a halt decider is evaluating whether or not its input halts on >>> its input by simulating this input, then we have at least two >>> distinctly different computations. >> >> >> Yes, but the problem is that in your code H and P are *not* distinct >> computations. You have P calling H which means that P is not actually >> independent from H because P shares the code of H. >> > > It turns out that for my revised computation it is equivalent to a > monolithic single block of code. > > For my revised computation I could embed H directly in P and the results > of the computation would not change. Then show us this revised computation. Saying that it will do something isn't of much value unless you show that you can deliver. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
Page 16 of 17 — ← Prev page 1 … 14 15 [16] 17 Next page →
Back to top | Article view | comp.theory
csiph-web