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 7 of 17 — ← Prev page 1 … 5 6 [7] 8 9 … 17 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-12 08:35 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <VOadnaKiNpC5Evj8nZ2dnUU7-dPNnZ2d@giganews.com> |
| In reply to | #40326 |
On 10/12/2021 4:41 AM, Malcolm McLean wrote: > On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >> >> I had some health care regulation issues to deal with. >> I am have also reformulated my algorithm. It is not yet encoded. >> The current guesstimate is that I will be done in a week or two. >> > I was worried when you suddenly disappeared. It coincided with a > confernece I was attending so I wasn't aware until my return. > All is well. I have reformulated my algorithm so that it is a pure function: In computer programming, a pure function is a function that has the following properties:[1][2] (1) The function return values are identical for identical arguments (no variation with local static variables, non-local variables, mutable reference arguments or input streams). (2) The function application has no side effects (no mutation of local static variables, non-local variables, mutable reference arguments or input/output streams). https://en.wikipedia.org/wiki/Pure_function The detailed design that meets the spec has been done for weeks. I had to totally drop all work on this for a week so that I could complete the research to save chemo therapy patients from a greatly increased chance of death. -- 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-12 18:59 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <gro9J.85178$QzOf.78567@fx17.iad> |
| In reply to | #40345 |
On 10/12/21 9:35 AM, olcott wrote: > On 10/12/2021 4:41 AM, Malcolm McLean wrote: >> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>> >>> I had some health care regulation issues to deal with. >>> I am have also reformulated my algorithm. It is not yet encoded. >>> The current guesstimate is that I will be done in a week or two. >>> >> I was worried when you suddenly disappeared. It coincided with a >> confernece I was attending so I wasn't aware until my return. >> > > All is well. I have reformulated my algorithm so that it is a pure > function: > > In computer programming, a pure function is a function that has the > following properties:[1][2] > > (1) The function return values are identical for identical arguments (no > variation with local static variables, non-local variables, mutable > reference arguments or input streams). > > (2) The function application has no side effects (no mutation of local > static variables, non-local variables, mutable reference arguments or > input/output streams). https://en.wikipedia.org/wiki/Pure_function > > The detailed design that meets the spec has been done for weeks. > I had to totally drop all work on this for a week so that I could > complete the research to save chemo therapy patients from a greatly > increased chance of death. > Remember, just being 'Pure' isn't good enough to be a Computation, it also must be positionally invariant, so all copies give the save results, i.e. the PC isn't a 'hidden' input to the function.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-13 10:14 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <BqWdnX7_dcROavv8nZ2dnUU7-TudnZ2d@giganews.com> |
| In reply to | #40358 |
On 10/12/2021 5:59 PM, Richard Damon wrote: > On 10/12/21 9:35 AM, olcott wrote: >> On 10/12/2021 4:41 AM, Malcolm McLean wrote: >>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>>> >>>> I had some health care regulation issues to deal with. >>>> I am have also reformulated my algorithm. It is not yet encoded. >>>> The current guesstimate is that I will be done in a week or two. >>>> >>> I was worried when you suddenly disappeared. It coincided with a >>> confernece I was attending so I wasn't aware until my return. >>> >> >> All is well. I have reformulated my algorithm so that it is a pure >> function: >> >> In computer programming, a pure function is a function that has the >> following properties:[1][2] >> >> (1) The function return values are identical for identical arguments >> (no variation with local static variables, non-local variables, >> mutable reference arguments or input streams). >> >> (2) The function application has no side effects (no mutation of local >> static variables, non-local variables, mutable reference arguments or >> input/output streams). https://en.wikipedia.org/wiki/Pure_function >> >> The detailed design that meets the spec has been done for weeks. >> I had to totally drop all work on this for a week so that I could >> complete the research to save chemo therapy patients from a greatly >> increased chance of death. >> > > Remember, just being 'Pure' isn't good enough to be a Computation, it > also must be positionally invariant, so all copies give the save > results, i.e. the PC isn't a 'hidden' input to the function. What documentation do you have to support this, or are you simply shooting from the hip as usual? -- 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-13 12:15 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <oCD9J.101449$Dr.9956@fx40.iad> |
| In reply to | #40365 |
On 10/13/21 11:14 AM, olcott wrote: > On 10/12/2021 5:59 PM, Richard Damon wrote: >> On 10/12/21 9:35 AM, olcott wrote: >>> On 10/12/2021 4:41 AM, Malcolm McLean wrote: >>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>>>> >>>>> I had some health care regulation issues to deal with. >>>>> I am have also reformulated my algorithm. It is not yet encoded. >>>>> The current guesstimate is that I will be done in a week or two. >>>>> >>>> I was worried when you suddenly disappeared. It coincided with a >>>> confernece I was attending so I wasn't aware until my return. >>>> >>> >>> All is well. I have reformulated my algorithm so that it is a pure >>> function: >>> >>> In computer programming, a pure function is a function that has the >>> following properties:[1][2] >>> >>> (1) The function return values are identical for identical arguments >>> (no variation with local static variables, non-local variables, >>> mutable reference arguments or input streams). >>> >>> (2) The function application has no side effects (no mutation of >>> local static variables, non-local variables, mutable reference >>> arguments or input/output streams). >>> https://en.wikipedia.org/wiki/Pure_function >>> >>> The detailed design that meets the spec has been done for weeks. >>> I had to totally drop all work on this for a week so that I could >>> complete the research to save chemo therapy patients from a greatly >>> increased chance of death. >>> >> >> Remember, just being 'Pure' isn't good enough to be a Computation, it >> also must be positionally invariant, so all copies give the save >> results, i.e. the PC isn't a 'hidden' input to the function. > > What documentation do you have to support this, or are you simply > shooting from the hip as usual? > How abut the the Definition of a Computation. That ALL 'copies' of a Computation will always return the same answer given the same input. Remember, a Computation is a Mathematical concept so things like 'Address' don't apply to it. This seems to beone of your blind spots on the problem, you seem to think is is about 'Programming', when it isn't.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-13 12:17 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <08GdnT4cO8gKifr8nZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #40367 |
On 10/13/2021 11:15 AM, Richard Damon wrote: > On 10/13/21 11:14 AM, olcott wrote: >> On 10/12/2021 5:59 PM, Richard Damon wrote: >>> On 10/12/21 9:35 AM, olcott wrote: >>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote: >>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>>>>> >>>>>> I had some health care regulation issues to deal with. >>>>>> I am have also reformulated my algorithm. It is not yet encoded. >>>>>> The current guesstimate is that I will be done in a week or two. >>>>>> >>>>> I was worried when you suddenly disappeared. It coincided with a >>>>> confernece I was attending so I wasn't aware until my return. >>>>> >>>> >>>> All is well. I have reformulated my algorithm so that it is a pure >>>> function: >>>> >>>> In computer programming, a pure function is a function that has the >>>> following properties:[1][2] >>>> >>>> (1) The function return values are identical for identical arguments >>>> (no variation with local static variables, non-local variables, >>>> mutable reference arguments or input streams). >>>> >>>> (2) The function application has no side effects (no mutation of >>>> local static variables, non-local variables, mutable reference >>>> arguments or input/output streams). >>>> https://en.wikipedia.org/wiki/Pure_function >>>> >>>> The detailed design that meets the spec has been done for weeks. >>>> I had to totally drop all work on this for a week so that I could >>>> complete the research to save chemo therapy patients from a greatly >>>> increased chance of death. >>>> >>> >>> Remember, just being 'Pure' isn't good enough to be a Computation, it >>> also must be positionally invariant, so all copies give the save >>> results, i.e. the PC isn't a 'hidden' input to the function. >> >> What documentation do you have to support this, or are you simply >> shooting from the hip as usual? >> > > How abut the the Definition of a Computation. That ALL 'copies' of a > Computation will always return the same answer given the same input. What link or text reference do you have to support your misconception? Make sure that it refers to "copies of a computation". > > Remember, a Computation is a Mathematical concept so things like > 'Address' don't apply to it. > > This seems to beone of your blind spots on the problem, you seem to > think is is about 'Programming', when it isn't. -- 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-13 14:37 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <VHF9J.34235$dI3.16072@fx10.iad> |
| In reply to | #40368 |
On 10/13/21 1:17 PM, olcott wrote: > On 10/13/2021 11:15 AM, Richard Damon wrote: >> On 10/13/21 11:14 AM, olcott wrote: >>> On 10/12/2021 5:59 PM, Richard Damon wrote: >>>> On 10/12/21 9:35 AM, olcott wrote: >>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote: >>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote: >>>>>>> >>>>>>> I had some health care regulation issues to deal with. >>>>>>> I am have also reformulated my algorithm. It is not yet encoded. >>>>>>> The current guesstimate is that I will be done in a week or two. >>>>>>> >>>>>> I was worried when you suddenly disappeared. It coincided with a >>>>>> confernece I was attending so I wasn't aware until my return. >>>>>> >>>>> >>>>> All is well. I have reformulated my algorithm so that it is a pure >>>>> function: >>>>> >>>>> In computer programming, a pure function is a function that has the >>>>> following properties:[1][2] >>>>> >>>>> (1) The function return values are identical for identical >>>>> arguments (no variation with local static variables, non-local >>>>> variables, mutable reference arguments or input streams). >>>>> >>>>> (2) The function application has no side effects (no mutation of >>>>> local static variables, non-local variables, mutable reference >>>>> arguments or input/output streams). >>>>> https://en.wikipedia.org/wiki/Pure_function >>>>> >>>>> The detailed design that meets the spec has been done for weeks. >>>>> I had to totally drop all work on this for a week so that I could >>>>> complete the research to save chemo therapy patients from a greatly >>>>> increased chance of death. >>>>> >>>> >>>> Remember, just being 'Pure' isn't good enough to be a Computation, >>>> it also must be positionally invariant, so all copies give the save >>>> results, i.e. the PC isn't a 'hidden' input to the function. >>> >>> What documentation do you have to support this, or are you simply >>> shooting from the hip as usual? >>> >> >> How abut the the Definition of a Computation. That ALL 'copies' of a >> Computation will always return the same answer given the same input. > > What link or text reference do you have to support your misconception? > Make sure that it refers to "copies of a computation". I am not going to do your research for you. Maybe if you actually Studied the field you would understand. I will admit that I don't have any texts 'on hand' as my study of them was decades ago, but it is fairly basic material that shouldn't require the form of 'citation' you seem to want. Remember that a Computaiton is the application of an Algorithm to an Input to compute a Function, and produce the Output pretaining to that Function. Function in this sense, being the MATHEMATICAL definition of a consistent mapping of input to output, so the same input always produces the same output. Algorithm, being just a detail list of steps to perform to get to the result, is inherently 'copyable'. When we refer to a given mathematical function, it doesn't even have the concept of 'distinct copies', only when we 'Code' that function. Once we fix our imbodyment of the Algorithm as a piece of code, the key point is that the results of this code need to match the Mathematical function it is computing, and THAT Function has no concept of 'Address' (unless it EXPLICITLY defines itself to do so), so copies in the computer all need to behave the same as the mathematic form, which will be independent of which 'copy' of it is running. In the Halting Problem, the Halting decider is specifically defined to be an Algorithm that performs a Computation having as its input only the Computation to decide on, which is the combination of Algorithm/Turing Machine and the input to that Algorithm/Turing Machine. If two copies of that Halt Decider give different answers, then the Halt Decider either must not have a proper Algorithm or that Algorithm has additional inputs making it not the right form of Computation.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-13 13:57 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <7oydneObhaCxsfr8nZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #40373 |
On 10/13/2021 1:37 PM, Richard Damon wrote:
> On 10/13/21 1:17 PM, olcott wrote:
>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>>> On 10/13/21 11:14 AM, olcott wrote:
>>>> On 10/12/2021 5:59 PM, Richard Damon wrote:
>>>>> On 10/12/21 9:35 AM, olcott wrote:
>>>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote:
>>>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote:
>>>>>>>>
>>>>>>>> I had some health care regulation issues to deal with.
>>>>>>>> I am have also reformulated my algorithm. It is not yet encoded.
>>>>>>>> The current guesstimate is that I will be done in a week or two.
>>>>>>>>
>>>>>>> I was worried when you suddenly disappeared. It coincided with a
>>>>>>> confernece I was attending so I wasn't aware until my return.
>>>>>>>
>>>>>>
>>>>>> All is well. I have reformulated my algorithm so that it is a pure
>>>>>> function:
>>>>>>
>>>>>> In computer programming, a pure function is a function that has
>>>>>> the following properties:[1][2]
>>>>>>
>>>>>> (1) The function return values are identical for identical
>>>>>> arguments (no variation with local static variables, non-local
>>>>>> variables, mutable reference arguments or input streams).
>>>>>>
>>>>>> (2) The function application has no side effects (no mutation of
>>>>>> local static variables, non-local variables, mutable reference
>>>>>> arguments or input/output streams).
>>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>>
>>>>>> The detailed design that meets the spec has been done for weeks.
>>>>>> I had to totally drop all work on this for a week so that I could
>>>>>> complete the research to save chemo therapy patients from a
>>>>>> greatly increased chance of death.
>>>>>>
>>>>>
>>>>> Remember, just being 'Pure' isn't good enough to be a Computation,
>>>>> it also must be positionally invariant, so all copies give the save
>>>>> results, i.e. the PC isn't a 'hidden' input to the function.
>>>>
>>>> What documentation do you have to support this, or are you simply
>>>> shooting from the hip as usual?
>>>>
>>>
>>> How abut the the Definition of a Computation. That ALL 'copies' of a
>>> Computation will always return the same answer given the same input.
>>
>> What link or text reference do you have to support your misconception?
>> Make sure that it refers to "copies of a computation".
>
> I am not going to do your research for you. Maybe if you actually
> Studied the field you would understand.
>
> I will admit that I don't have any texts 'on hand' as my study of them
> was decades ago, but it is fairly basic material that shouldn't require
> the form of 'citation' you seem to want.
>
> Remember that a Computaiton is the application of an Algorithm to an
> Input to compute a Function, and produce the Output pretaining to that
> Function. Function in this sense, being the MATHEMATICAL definition of a
> consistent mapping of input to output, so the same input always produces
> the same output.
>
Yes.
> Algorithm, being just a detail list of steps to perform to get to the
> result, is inherently 'copyable'. When we refer to a given mathematical
> function, it doesn't even have the concept of 'distinct copies', only
> when we 'Code' that function.
>
That is how I knew that your comment was bullshit:
On 10/13/2021 11:15 AM, Richard Damon wrote:
> How abut the the Definition of a Computation. That ALL 'copies' of a
> Computation will always return the same answer given the same input.
> Once we fix our imbodyment of the Algorithm as a piece of code, the key
> point is that the results of this code need to match the Mathematical
> function it is computing, and THAT Function has no concept of 'Address'
TM's certainly always have the equivalent of a machine address within
their execution trace: {current_state, current_input}
> (unless it EXPLICITLY defines itself to do so), so copies in the
> computer all need to behave the same as the mathematic form, which will
> be independent of which 'copy' of it is running.
>
> In the Halting Problem, the Halting decider is specifically defined to
> be an Algorithm that performs a Computation having as its input only the
> Computation to decide on, which is the combination of Algorithm/Turing
> Machine and the input to that Algorithm/Turing Machine. If two copies of
> that Halt Decider give different answers, then the Halt Decider either
> must not have a proper Algorithm or that Algorithm has additional inputs
> making it not the right form of Computation.
>
That false assumption is based on simply not paying enough attention to
the underlying details. Although we can imagine that TM's do not have
machine addresses simply because math never bothers to examine all of
the required details any physically implemented machine can't get away
with ignoring these details.
In any physically existing machine {current_state, current_input} must
be represented by integer values, thus providing the machine address of
this point in the execution trace. Imagining them away by simply not
paying attention does not eliminate this mandatory requirement.
--
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-13 16:49 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <VDH9J.205707$Kv2.156529@fx47.iad> |
| In reply to | #40375 |
On 10/13/21 2:57 PM, olcott wrote:
> On 10/13/2021 1:37 PM, Richard Damon wrote:
>> On 10/13/21 1:17 PM, olcott wrote:
>>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>>>> On 10/13/21 11:14 AM, olcott wrote:
>>>>> On 10/12/2021 5:59 PM, Richard Damon wrote:
>>>>>> On 10/12/21 9:35 AM, olcott wrote:
>>>>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote:
>>>>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote:
>>>>>>>>>
>>>>>>>>> I had some health care regulation issues to deal with.
>>>>>>>>> I am have also reformulated my algorithm. It is not yet encoded.
>>>>>>>>> The current guesstimate is that I will be done in a week or two.
>>>>>>>>>
>>>>>>>> I was worried when you suddenly disappeared. It coincided with a
>>>>>>>> confernece I was attending so I wasn't aware until my return.
>>>>>>>>
>>>>>>>
>>>>>>> All is well. I have reformulated my algorithm so that it is a
>>>>>>> pure function:
>>>>>>>
>>>>>>> In computer programming, a pure function is a function that has
>>>>>>> the following properties:[1][2]
>>>>>>>
>>>>>>> (1) The function return values are identical for identical
>>>>>>> arguments (no variation with local static variables, non-local
>>>>>>> variables, mutable reference arguments or input streams).
>>>>>>>
>>>>>>> (2) The function application has no side effects (no mutation of
>>>>>>> local static variables, non-local variables, mutable reference
>>>>>>> arguments or input/output streams).
>>>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>>>
>>>>>>> The detailed design that meets the spec has been done for weeks.
>>>>>>> I had to totally drop all work on this for a week so that I could
>>>>>>> complete the research to save chemo therapy patients from a
>>>>>>> greatly increased chance of death.
>>>>>>>
>>>>>>
>>>>>> Remember, just being 'Pure' isn't good enough to be a Computation,
>>>>>> it also must be positionally invariant, so all copies give the
>>>>>> save results, i.e. the PC isn't a 'hidden' input to the function.
>>>>>
>>>>> What documentation do you have to support this, or are you simply
>>>>> shooting from the hip as usual?
>>>>>
>>>>
>>>> How abut the the Definition of a Computation. That ALL 'copies' of a
>>>> Computation will always return the same answer given the same input.
>>>
>>> What link or text reference do you have to support your misconception?
>>> Make sure that it refers to "copies of a computation".
>>
>> I am not going to do your research for you. Maybe if you actually
>> Studied the field you would understand.
>>
>> I will admit that I don't have any texts 'on hand' as my study of them
>> was decades ago, but it is fairly basic material that shouldn't
>> require the form of 'citation' you seem to want.
>>
>> Remember that a Computaiton is the application of an Algorithm to an
>> Input to compute a Function, and produce the Output pretaining to that
>> Function. Function in this sense, being the MATHEMATICAL definition of
>> a consistent mapping of input to output, so the same input always
>> produces the same output.
>>
>
> Yes.
Ok, as long as what ever you call 'The Same Computation' always gives
the same answer for the same input, and that the Algorithm H^ is built
on the exact same Algorithm (with the specified edits) as the H that is
deciding it, then we are ok.
This FAILS for you last attempt as the 'H' that was copied into H^ (aka
P) didn't give the same results as the H1 that you claimed to be the H
of Linz. That is impossible.
>
>> Algorithm, being just a detail list of steps to perform to get to the
>> result, is inherently 'copyable'. When we refer to a given
>> mathematical function, it doesn't even have the concept of 'distinct
>> copies', only when we 'Code' that function.
>>
>
> That is how I knew that your comment was bullshit:
>
> On 10/13/2021 11:15 AM, Richard Damon wrote:
> > How abut the the Definition of a Computation. That ALL 'copies' of a
> > Computation will always return the same answer given the same input.
Right, 'Copies' is a term that only come into existance when you move
from the abstract mathematics to the physical computer. When you talk
about 'Code instances', we get copies that need to act identically.
Since the definitons PREDATE that concept, the definition don't talk
about it. It is a necessary consequence of the meaning of the words that
if function H inplements the Mathematical Concept of Linz-H, and
function H1 also implements the Mathematical Concept of Linz-H, then we
have two 'copies' in the code domain, that both need to act exa
>
>> Once we fix our imbodyment of the Algorithm as a piece of code, the
>> key point is that the results of this code need to match the
>> Mathematical function it is computing, and THAT Function has no
>> concept of 'Address'
>
> TM's certainly always have the equivalent of a machine address within
> their execution trace: {current_state, current_input}
You can call 'Current State' the equivalent of a machine address, but it
acts very differently than an 'address' in a conventional computer, in
that Turing Machine can't actually DO anything with that 'address'. The
'symbol set' of the states doesn't map to the symbol set of the tape the
machine uses.
This is one BIG reason a UTM and a Decider need to work with a
DESCRIPTION of the Turing Machine, where some defined method of mapping
'states' to symbol sequences on the tape.
You also have the fact that two Turing Machine can be embodiments of the
exact same algortithm, and thus perform the exact same computation, but
have completely different 'state' assigments (which may still have a
one-to-one mapping). One Turing Machine might call the state Qx and the
other call it Qz.
>
>> (unless it EXPLICITLY defines itself to do so), so copies in the
>> computer all need to behave the same as the mathematic form, which
>> will be independent of which 'copy' of it is running.
>>
>> In the Halting Problem, the Halting decider is specifically defined to
>> be an Algorithm that performs a Computation having as its input only
>> the Computation to decide on, which is the combination of
>> Algorithm/Turing Machine and the input to that Algorithm/Turing
>> Machine. If two copies of that Halt Decider give different answers,
>> then the Halt Decider either must not have a proper Algorithm or that
>> Algorithm has additional inputs making it not the right form of
>> Computation.
>>
>
> That false assumption is based on simply not paying enough attention to
> the underlying details. Although we can imagine that TM's do not have
> machine addresses simply because math never bothers to examine all of
> the required details any physically implemented machine can't get away
> with ignoring these details.
>
> In any physically existing machine {current_state, current_input} must
> be represented by integer values, thus providing the machine address of
> this point in the execution trace. Imagining them away by simply not
> paying attention does not eliminate this mandatory requirement.
>
>
Who said that Computatiuon Theory was about 'physically existing
machines'? It very much is NOT about such things, it is about an
abstract definition of "computaiton' which doesn't requring anything
like an 'address'.
Yes, there is a consequence that any finite computation can be put into
at least theoretically buildable hardware (it might exceed the size of
the universe though), but nothing in the theory assuems that such a
physical embodyment exists. This is part of the big distinction between
the Theoretical space of Mathematics, of which Computation Theory is
part of, and the Practical space of Software Engineering which focuses
on what can actually be done with realizable hardware. Computer Science
sort of spans the gap between these two ends, having feet in both camps.
As I said, yes, you can produce a mapping of 'states' to numbers, as
there are a finite number of them, that you can map ANY state to ANY
number and get an equally valid map, so there is an INFINITE number of
ways to map a given machine to 'addresses'. Yes, it becomes finite if
you restrict that they must use the lowest possible numbers. The problem
is that the 'Numbers' of the states in the machine Linz-H for its states
might not match the numbers for the corresponding states in Linz-H^ for
its included copy of them, in fact if you define that the starting state
will be numerical 0, then they CAN't be as H^.q0 is a different part of
the algorithm then H.q0, and H^.qx will be a non-zero 'address' mapping
to H.q0 which will be zero. Thus your idea of 'comparing' the addresses
fails as H doesn't know what 'address' in H^ correspond to the copy of
it. It doesn't even know that there IS a copy of it in H^.
This is part of the FLAW of your setup, The provided computation needs
to be defined in a totally seperate 'address space' as the decider,
which means H can't use the trick you want to detect the recursion.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-13 18:31 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <WoGdna3cMNSi8fr8nZ2dnUU7-SHNnZ2d@giganews.com> |
| In reply to | #40380 |
On 10/13/2021 3:49 PM, Richard Damon wrote:
> On 10/13/21 2:57 PM, olcott wrote:
>> On 10/13/2021 1:37 PM, Richard Damon wrote:
>>> On 10/13/21 1:17 PM, olcott wrote:
>>>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>>>>> On 10/13/21 11:14 AM, olcott wrote:
>>>>>> On 10/12/2021 5:59 PM, Richard Damon wrote:
>>>>>>> On 10/12/21 9:35 AM, olcott wrote:
>>>>>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote:
>>>>>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote:
>>>>>>>>>>
>>>>>>>>>> I had some health care regulation issues to deal with.
>>>>>>>>>> I am have also reformulated my algorithm. It is not yet encoded.
>>>>>>>>>> The current guesstimate is that I will be done in a week or two.
>>>>>>>>>>
>>>>>>>>> I was worried when you suddenly disappeared. It coincided with a
>>>>>>>>> confernece I was attending so I wasn't aware until my return.
>>>>>>>>>
>>>>>>>>
>>>>>>>> All is well. I have reformulated my algorithm so that it is a
>>>>>>>> pure function:
>>>>>>>>
>>>>>>>> In computer programming, a pure function is a function that has
>>>>>>>> the following properties:[1][2]
>>>>>>>>
>>>>>>>> (1) The function return values are identical for identical
>>>>>>>> arguments (no variation with local static variables, non-local
>>>>>>>> variables, mutable reference arguments or input streams).
>>>>>>>>
>>>>>>>> (2) The function application has no side effects (no mutation of
>>>>>>>> local static variables, non-local variables, mutable reference
>>>>>>>> arguments or input/output streams).
>>>>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>>>>
>>>>>>>> The detailed design that meets the spec has been done for weeks.
>>>>>>>> I had to totally drop all work on this for a week so that I
>>>>>>>> could complete the research to save chemo therapy patients from
>>>>>>>> a greatly increased chance of death.
>>>>>>>>
>>>>>>>
>>>>>>> Remember, just being 'Pure' isn't good enough to be a
>>>>>>> Computation, it also must be positionally invariant, so all
>>>>>>> copies give the save results, i.e. the PC isn't a 'hidden' input
>>>>>>> to the function.
>>>>>>
>>>>>> What documentation do you have to support this, or are you simply
>>>>>> shooting from the hip as usual?
>>>>>>
>>>>>
>>>>> How abut the the Definition of a Computation. That ALL 'copies' of
>>>>> a Computation will always return the same answer given the same input.
>>>>
>>>> What link or text reference do you have to support your misconception?
>>>> Make sure that it refers to "copies of a computation".
>>>
>>> I am not going to do your research for you. Maybe if you actually
>>> Studied the field you would understand.
>>>
>>> I will admit that I don't have any texts 'on hand' as my study of
>>> them was decades ago, but it is fairly basic material that shouldn't
>>> require the form of 'citation' you seem to want.
>>>
>>> Remember that a Computaiton is the application of an Algorithm to an
>>> Input to compute a Function, and produce the Output pretaining to
>>> that Function. Function in this sense, being the MATHEMATICAL
>>> definition of a consistent mapping of input to output, so the same
>>> input always produces the same output.
>>>
>>
>> Yes.
>
> Ok, as long as what ever you call 'The Same Computation' always gives
> the same answer for the same input, and that the Algorithm H^ is built
> on the exact same Algorithm (with the specified edits) as the H that is
> deciding it, then we are ok.
>
> This FAILS for you last attempt as the 'H' that was copied into H^ (aka
> P) didn't give the same results as the H1 that you claimed to be the H
> of Linz. That is impossible.
>
>>
>>> Algorithm, being just a detail list of steps to perform to get to the
>>> result, is inherently 'copyable'. When we refer to a given
>>> mathematical function, it doesn't even have the concept of 'distinct
>>> copies', only when we 'Code' that function.
>>>
>>
>> That is how I knew that your comment was bullshit:
>>
>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>> > How abut the the Definition of a Computation. That ALL 'copies' of a
>> > Computation will always return the same answer given the same input.
>
> Right, 'Copies' is a term that only come into existance when you move
> from the abstract mathematics to the physical computer. When you talk
> about 'Code instances', we get copies that need to act identically.
> Since the definitons PREDATE that concept, the definition don't talk
> about it. It is a necessary consequence of the meaning of the words that
> if function H inplements the Mathematical Concept of Linz-H, and
> function H1 also implements the Mathematical Concept of Linz-H, then we
> have two 'copies' in the code domain, that both need to act exa
>>
>>> Once we fix our imbodyment of the Algorithm as a piece of code, the
>>> key point is that the results of this code need to match the
>>> Mathematical function it is computing, and THAT Function has no
>>> concept of 'Address'
>>
>> TM's certainly always have the equivalent of a machine address within
>> their execution trace: {current_state, current_input}
>
> You can call 'Current State' the equivalent of a machine address, but it
> acts very differently than an 'address' in a conventional computer, in
> that Turing Machine can't actually DO anything with that 'address'. The
> 'symbol set' of the states doesn't map to the symbol set of the tape the
> machine uses.
>
> This is one BIG reason a UTM and a Decider need to work with a
> DESCRIPTION of the Turing Machine, where some defined method of mapping
> 'states' to symbol sequences on the tape.
>
> You also have the fact that two Turing Machine can be embodiments of the
> exact same algortithm, and thus perform the exact same computation, but
> have completely different 'state' assigments (which may still have a
> one-to-one mapping). One Turing Machine might call the state Qx and the
> other call it Qz.
>
>>
>>> (unless it EXPLICITLY defines itself to do so), so copies in the
>>> computer all need to behave the same as the mathematic form, which
>>> will be independent of which 'copy' of it is running.
>>>
>>> In the Halting Problem, the Halting decider is specifically defined
>>> to be an Algorithm that performs a Computation having as its input
>>> only the Computation to decide on, which is the combination of
>>> Algorithm/Turing Machine and the input to that Algorithm/Turing
>>> Machine. If two copies of that Halt Decider give different answers,
>>> then the Halt Decider either must not have a proper Algorithm or that
>>> Algorithm has additional inputs making it not the right form of
>>> Computation.
>>>
>>
>> That false assumption is based on simply not paying enough attention
>> to the underlying details. Although we can imagine that TM's do not
>> have machine addresses simply because math never bothers to examine
>> all of the required details any physically implemented machine can't
>> get away with ignoring these details.
>>
>> In any physically existing machine {current_state, current_input} must
>> be represented by integer values, thus providing the machine address
>> of this point in the execution trace. Imagining them away by simply
>> not paying attention does not eliminate this mandatory requirement.
>>
>>
>
> Who said that Computatiuon Theory was about 'physically existing
> machines'? It very much is NOT about such things, it is about an
> abstract definition of "computaiton' which doesn't requring anything
> like an 'address'.
>
> Yes, there is a consequence that any finite computation can be put into
> at least theoretically buildable hardware (it might exceed the size of
> the universe though), but nothing in the theory assuems that such a
> physical embodyment exists. This is part of the big distinction between
> the Theoretical space of Mathematics, of which Computation Theory is
> part of, and the Practical space of Software Engineering which focuses
> on what can actually be done with realizable hardware. Computer Science
> sort of spans the gap between these two ends, having feet in both camps.
>
> As I said, yes, you can produce a mapping of 'states' to numbers, as
> there are a finite number of them, that you can map ANY state to ANY
> number and get an equally valid map, so there is an INFINITE number of
> ways to map a given machine to 'addresses'. Yes, it becomes finite if
> you restrict that they must use the lowest possible numbers. The problem
Not at all. The number of states of a TM is stipulated to be finite,
thus all states must map to some finite natural number.
Also one cannot even work out the pencil-and-paper idea of a TM that
Turing had for a specific complete computation without having some way
to uniquely identify each state.
This uniquely identifiable set of states corresponds to a subset of
natural numbers beginning with zero thus essentially specifying the
machine address of this state. All TM's can be construed as having a
finite set of numbered states beginning with zero.
> is that the 'Numbers' of the states in the machine Linz-H for its states
> might not match the numbers for the corresponding states in Linz-H^ for
> its included copy of them, in fact if you define that the starting state
> will be numerical 0, then they CAN't be as H^.q0 is a different part of
> the algorithm then H.q0, and H^.qx will be a non-zero 'address' mapping
> to H.q0 which will be zero. Thus your idea of 'comparing' the addresses
> fails as H doesn't know what 'address' in H^ correspond to the copy of
> it. It doesn't even know that there IS a copy of it in H^.
>
> This is part of the FLAW of your setup, The provided computation needs
> to be defined in a totally seperate 'address space' as the decider,
> which means H can't use the trick you want to detect the recursion.
--
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-13 18:01 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <sk7s1c$2m0$1@dont-email.me> |
| In reply to | #40384 |
On 2021-10-13 17:31, olcott wrote:
>> As I said, yes, you can produce a mapping of 'states' to numbers, as
>> there are a finite number of them, that you can map ANY state to ANY
>> number and get an equally valid map, so there is an INFINITE number of
>> ways to map a given machine to 'addresses'. Yes, it becomes finite if
>> you restrict that they must use the lowest possible numbers. The problem
>
> Not at all. The number of states of a TM is stipulated to be finite,
> thus all states must map to some finite natural number.
>
> Also one cannot even work out the pencil-and-paper idea of a TM that
> Turing had for a specific complete computation without having some way
> to uniquely identify each state.
>
> This uniquely identifiable set of states corresponds to a subset of
> natural numbers beginning with zero thus essentially specifying the
> machine address of this state. All TM's can be construed as having a
> finite set of numbered states beginning with zero.
Turing Machines are defined as having a *set* of states. Sets are
inherently unordered, meaning that the following three sets are all
identical sets:
{Z, Ω, Я}
{Я, Ω, Z}
{Z, Я, Z, Ω}
Each state is identified by a unique *symbol* but there is no unique way
to map those symbols to integers, nor is there a need for them to be
mapped to integers.
That's very different from machine addresses which are inherently
ordered. Each machine address, save the first and last, has a
well-defined successor and predecessor. That's very different from the
states of a Turing Machine.
Apart from the fact that they are ordered, machine addresses refer to
specific locations where *data* can be stored or read from. Your
{current_state, current_input} lacks either of these properties so it
seems entirely pointless to refer to these as 'machine addresses'. There
is no meaningful analogy between the two that I can think of.
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-13 21:09 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <YM6dnYeKl7PZDPr8nZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #40385 |
On 10/13/2021 7:01 PM, André G. Isaak wrote:
> On 2021-10-13 17:31, olcott wrote:
>
>>> As I said, yes, you can produce a mapping of 'states' to numbers, as
>>> there are a finite number of them, that you can map ANY state to ANY
>>> number and get an equally valid map, so there is an INFINITE number
>>> of ways to map a given machine to 'addresses'. Yes, it becomes finite
>>> if you restrict that they must use the lowest possible numbers. The
>>> problem
>>
>> Not at all. The number of states of a TM is stipulated to be finite,
>> thus all states must map to some finite natural number.
>>
>> Also one cannot even work out the pencil-and-paper idea of a TM that
>> Turing had for a specific complete computation without having some way
>> to uniquely identify each state.
>>
>> This uniquely identifiable set of states corresponds to a subset of
>> natural numbers beginning with zero thus essentially specifying the
>> machine address of this state. All TM's can be construed as having a
>> finite set of numbered states beginning with zero.
>
> Turing Machines are defined as having a *set* of states. Sets are
> inherently unordered, meaning that the following three sets are all
> identical sets:
>
> {Z, Ω, Я}
> {Я, Ω, Z}
> {Z, Я, Z, Ω}
>
> Each state is identified by a unique *symbol*
Affirming that the states must be uniquely identifiable thus able to be
mapped in some purely arbitrary sequence to a sequence of natural
numbers beginning with 0.
> but there is no unique way
> to map those symbols to integers, nor is there a need for them to be
> mapped to integers.
>
> That's very different from machine addresses which are inherently
> ordered. Each machine address, save the first and last, has a
> well-defined successor and predecessor. That's very different from the
> states of a Turing Machine.
>
> Apart from the fact that they are ordered, machine addresses refer to
> specific locations where *data* can be stored or read from. Your
> {current_state, current_input} lacks either of these properties so it
> seems entirely pointless to refer to these as 'machine addresses'. There
> is no meaningful analogy between the two that I can think of.
>
> André
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-13 22:33 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <gGM9J.185099$rl3.106663@fx45.iad> |
| In reply to | #40388 |
On 10/13/21 10:09 PM, olcott wrote:
> On 10/13/2021 7:01 PM, André G. Isaak wrote:
>> On 2021-10-13 17:31, olcott wrote:
>>
>>>> As I said, yes, you can produce a mapping of 'states' to numbers, as
>>>> there are a finite number of them, that you can map ANY state to ANY
>>>> number and get an equally valid map, so there is an INFINITE number
>>>> of ways to map a given machine to 'addresses'. Yes, it becomes
>>>> finite if you restrict that they must use the lowest possible
>>>> numbers. The problem
>>>
>>> Not at all. The number of states of a TM is stipulated to be finite,
>>> thus all states must map to some finite natural number.
>>>
>>> Also one cannot even work out the pencil-and-paper idea of a TM that
>>> Turing had for a specific complete computation without having some
>>> way to uniquely identify each state.
>>>
>>> This uniquely identifiable set of states corresponds to a subset of
>>> natural numbers beginning with zero thus essentially specifying the
>>> machine address of this state. All TM's can be construed as having a
>>> finite set of numbered states beginning with zero.
>>
>> Turing Machines are defined as having a *set* of states. Sets are
>> inherently unordered, meaning that the following three sets are all
>> identical sets:
>>
>> {Z, Ω, Я}
>> {Я, Ω, Z}
>> {Z, Я, Z, Ω}
>>
>> Each state is identified by a unique *symbol*
>
> Affirming that the states must be uniquely identifiable thus able to be
> mapped in some purely arbitrary sequence to a sequence of natural
> numbers beginning with 0.
>
Right, but the mapping isn't uniquiely defined, and when a machine is
converted into a representation, that mapping might be different each
time you create a representation.
The key point here is that your routine 'H' when run as an independent
machine doesn't know what 'address' a copy of it might be in another
machine, or even if there IS a copy of it in another machine.
This means you can't 'compare the address' in the simulation to see if
the machine being simulated is entering a copy of the simulator.
In the simulator, that is what H.q0 gets mapped to (maybe defined to be
0), while is H^, it is whatever H^.qx gets mapped to, which likely CAN'T
be 0.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-13 20:37 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <sk855k$6ph$1@dont-email.me> |
| In reply to | #40388 |
On 2021-10-13 20:09, olcott wrote:
> On 10/13/2021 7:01 PM, André G. Isaak wrote:
>> On 2021-10-13 17:31, olcott wrote:
>>
>>>> As I said, yes, you can produce a mapping of 'states' to numbers, as
>>>> there are a finite number of them, that you can map ANY state to ANY
>>>> number and get an equally valid map, so there is an INFINITE number
>>>> of ways to map a given machine to 'addresses'. Yes, it becomes
>>>> finite if you restrict that they must use the lowest possible
>>>> numbers. The problem
>>>
>>> Not at all. The number of states of a TM is stipulated to be finite,
>>> thus all states must map to some finite natural number.
>>>
>>> Also one cannot even work out the pencil-and-paper idea of a TM that
>>> Turing had for a specific complete computation without having some
>>> way to uniquely identify each state.
>>>
>>> This uniquely identifiable set of states corresponds to a subset of
>>> natural numbers beginning with zero thus essentially specifying the
>>> machine address of this state. All TM's can be construed as having a
>>> finite set of numbered states beginning with zero.
>>
>> Turing Machines are defined as having a *set* of states. Sets are
>> inherently unordered, meaning that the following three sets are all
>> identical sets:
>>
>> {Z, Ω, Я}
>> {Я, Ω, Z}
>> {Z, Я, Z, Ω}
>>
>> Each state is identified by a unique *symbol*
>
> Affirming that the states must be uniquely identifiable thus able to be
> mapped in some purely arbitrary sequence to a sequence of natural
> numbers beginning with 0.
The key word there is *arbitary*. And while it can be construed in such
a way, there's certainly no reason why it must, or even should, be
construed in that way.
Assume a TM with five states {Ξ, R, Ю, ᚡ, Բ} and which makes use of
three symbols {Ѩ, ℵ, क}. What 'machine addresses' would you assign to
these combinations, and what advantage would there be to mapping these
to arbitrary integers as opposed to simply using the symbols themselves?
If you search online you'll find that many people have constructed
mechanical Turing Machines (i.e out of wood, or lego, or gears and
levers), albeit with finite tapes. The states in such machines have no
obvious integer values. They're simply the configuration of some set of
gears, levers, or other mechanical parts which may or may not be
arranged in any sort of way which suggests a logical sequence of these
parts.
And you entirely skipped the other critical differences between machine
addresses and your Turing Machine "machine addresses" which I point out
in the part of my post you ignored.
André
>> but there is no unique way to map those symbols to integers, nor is
>> there a need for them to be mapped to integers.
>>
>> That's very different from machine addresses which are inherently
>> ordered. Each machine address, save the first and last, has a
>> well-defined successor and predecessor. That's very different from the
>> states of a Turing Machine.
>>
>> Apart from the fact that they are ordered, machine addresses refer to
>> specific locations where *data* can be stored or read from. Your
>> {current_state, current_input} lacks either of these properties so it
>> seems entirely pointless to refer to these as 'machine addresses'.
>> There is no meaningful analogy between the two that I can think of.
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-13 20:08 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <uyK9J.111209$jl2.67647@fx34.iad> |
| In reply to | #40384 |
On 10/13/21 7:31 PM, olcott wrote:
> On 10/13/2021 3:49 PM, Richard Damon wrote:
>> On 10/13/21 2:57 PM, olcott wrote:
>>> On 10/13/2021 1:37 PM, Richard Damon wrote:
>>>> On 10/13/21 1:17 PM, olcott wrote:
>>>>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>>>>>> On 10/13/21 11:14 AM, olcott wrote:
>>>>>>> On 10/12/2021 5:59 PM, Richard Damon wrote:
>>>>>>>> On 10/12/21 9:35 AM, olcott wrote:
>>>>>>>>> On 10/12/2021 4:41 AM, Malcolm McLean wrote:
>>>>>>>>>> On Tuesday, 12 October 2021 at 02:08:10 UTC+1, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>> I had some health care regulation issues to deal with.
>>>>>>>>>>> I am have also reformulated my algorithm. It is not yet encoded.
>>>>>>>>>>> The current guesstimate is that I will be done in a week or two.
>>>>>>>>>>>
>>>>>>>>>> I was worried when you suddenly disappeared. It coincided with a
>>>>>>>>>> confernece I was attending so I wasn't aware until my return.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> All is well. I have reformulated my algorithm so that it is a
>>>>>>>>> pure function:
>>>>>>>>>
>>>>>>>>> In computer programming, a pure function is a function that has
>>>>>>>>> the following properties:[1][2]
>>>>>>>>>
>>>>>>>>> (1) The function return values are identical for identical
>>>>>>>>> arguments (no variation with local static variables, non-local
>>>>>>>>> variables, mutable reference arguments or input streams).
>>>>>>>>>
>>>>>>>>> (2) The function application has no side effects (no mutation
>>>>>>>>> of local static variables, non-local variables, mutable
>>>>>>>>> reference arguments or input/output streams).
>>>>>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>>>>>
>>>>>>>>> The detailed design that meets the spec has been done for weeks.
>>>>>>>>> I had to totally drop all work on this for a week so that I
>>>>>>>>> could complete the research to save chemo therapy patients from
>>>>>>>>> a greatly increased chance of death.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Remember, just being 'Pure' isn't good enough to be a
>>>>>>>> Computation, it also must be positionally invariant, so all
>>>>>>>> copies give the save results, i.e. the PC isn't a 'hidden' input
>>>>>>>> to the function.
>>>>>>>
>>>>>>> What documentation do you have to support this, or are you simply
>>>>>>> shooting from the hip as usual?
>>>>>>>
>>>>>>
>>>>>> How abut the the Definition of a Computation. That ALL 'copies' of
>>>>>> a Computation will always return the same answer given the same
>>>>>> input.
>>>>>
>>>>> What link or text reference do you have to support your misconception?
>>>>> Make sure that it refers to "copies of a computation".
>>>>
>>>> I am not going to do your research for you. Maybe if you actually
>>>> Studied the field you would understand.
>>>>
>>>> I will admit that I don't have any texts 'on hand' as my study of
>>>> them was decades ago, but it is fairly basic material that shouldn't
>>>> require the form of 'citation' you seem to want.
>>>>
>>>> Remember that a Computaiton is the application of an Algorithm to an
>>>> Input to compute a Function, and produce the Output pretaining to
>>>> that Function. Function in this sense, being the MATHEMATICAL
>>>> definition of a consistent mapping of input to output, so the same
>>>> input always produces the same output.
>>>>
>>>
>>> Yes.
>>
>> Ok, as long as what ever you call 'The Same Computation' always gives
>> the same answer for the same input, and that the Algorithm H^ is built
>> on the exact same Algorithm (with the specified edits) as the H that
>> is deciding it, then we are ok.
>>
>> This FAILS for you last attempt as the 'H' that was copied into H^
>> (aka P) didn't give the same results as the H1 that you claimed to be
>> the H of Linz. That is impossible.
>>
>>>
>>>> Algorithm, being just a detail list of steps to perform to get to
>>>> the result, is inherently 'copyable'. When we refer to a given
>>>> mathematical function, it doesn't even have the concept of 'distinct
>>>> copies', only when we 'Code' that function.
>>>>
>>>
>>> That is how I knew that your comment was bullshit:
>>>
>>> On 10/13/2021 11:15 AM, Richard Damon wrote:
>>> > How abut the the Definition of a Computation. That ALL 'copies' of a
>>> > Computation will always return the same answer given the same input.
>>
>> Right, 'Copies' is a term that only come into existance when you move
>> from the abstract mathematics to the physical computer. When you talk
>> about 'Code instances', we get copies that need to act identically.
>> Since the definitons PREDATE that concept, the definition don't talk
>> about it. It is a necessary consequence of the meaning of the words
>> that if function H inplements the Mathematical Concept of Linz-H, and
>> function H1 also implements the Mathematical Concept of Linz-H, then
>> we have two 'copies' in the code domain, that both need to act exa
>>>
>>>> Once we fix our imbodyment of the Algorithm as a piece of code, the
>>>> key point is that the results of this code need to match the
>>>> Mathematical function it is computing, and THAT Function has no
>>>> concept of 'Address'
>>>
>>> TM's certainly always have the equivalent of a machine address within
>>> their execution trace: {current_state, current_input}
>>
>> You can call 'Current State' the equivalent of a machine address, but
>> it acts very differently than an 'address' in a conventional computer,
>> in that Turing Machine can't actually DO anything with that 'address'.
>> The 'symbol set' of the states doesn't map to the symbol set of the
>> tape the machine uses.
>>
>> This is one BIG reason a UTM and a Decider need to work with a
>> DESCRIPTION of the Turing Machine, where some defined method of
>> mapping 'states' to symbol sequences on the tape.
>>
>> You also have the fact that two Turing Machine can be embodiments of
>> the exact same algortithm, and thus perform the exact same
>> computation, but have completely different 'state' assigments (which
>> may still have a one-to-one mapping). One Turing Machine might call
>> the state Qx and the other call it Qz.
>>
>>>
>>>> (unless it EXPLICITLY defines itself to do so), so copies in the
>>>> computer all need to behave the same as the mathematic form, which
>>>> will be independent of which 'copy' of it is running.
>>>>
>>>> In the Halting Problem, the Halting decider is specifically defined
>>>> to be an Algorithm that performs a Computation having as its input
>>>> only the Computation to decide on, which is the combination of
>>>> Algorithm/Turing Machine and the input to that Algorithm/Turing
>>>> Machine. If two copies of that Halt Decider give different answers,
>>>> then the Halt Decider either must not have a proper Algorithm or
>>>> that Algorithm has additional inputs making it not the right form of
>>>> Computation.
>>>>
>>>
>>> That false assumption is based on simply not paying enough attention
>>> to the underlying details. Although we can imagine that TM's do not
>>> have machine addresses simply because math never bothers to examine
>>> all of the required details any physically implemented machine can't
>>> get away with ignoring these details.
>>>
>>> In any physically existing machine {current_state, current_input}
>>> must be represented by integer values, thus providing the machine
>>> address of this point in the execution trace. Imagining them away by
>>> simply not paying attention does not eliminate this mandatory
>>> requirement.
>>>
>>>
>>
>> Who said that Computatiuon Theory was about 'physically existing
>> machines'? It very much is NOT about such things, it is about an
>> abstract definition of "computaiton' which doesn't requring anything
>> like an 'address'.
>>
>> Yes, there is a consequence that any finite computation can be put
>> into at least theoretically buildable hardware (it might exceed the
>> size of the universe though), but nothing in the theory assuems that
>> such a physical embodyment exists. This is part of the big distinction
>> between the Theoretical space of Mathematics, of which Computation
>> Theory is part of, and the Practical space of Software Engineering
>> which focuses on what can actually be done with realizable hardware.
>> Computer Science sort of spans the gap between these two ends, having
>> feet in both camps.
>>
>> As I said, yes, you can produce a mapping of 'states' to numbers, as
>> there are a finite number of them, that you can map ANY state to ANY
>> number and get an equally valid map, so there is an INFINITE number of
>> ways to map a given machine to 'addresses'. Yes, it becomes finite if
>> you restrict that they must use the lowest possible numbers. The problem
>
> Not at all. The number of states of a TM is stipulated to be finite,
> thus all states must map to some finite natural number.
But there are an infinite number of mappings of 'states' to finite numbers.
For example, how many ways do you think you can number a 4 state Turing
Machine. The simplest mapping might use the set {0, 1, 2, 3} but you
also could use something like {0, 1000, 50, 20} and so on. The number of
possibilities is INFINITE.
As I added, if you restrict yourself to the lowest numbers only, the
count is finite, but there can still be many, and a sub-machine included
in the Turing Machine will likely be numbered differently than when that
machine was used as a independent machine (and you you have two
sub-machines, one of them MUST be).
>
> Also one cannot even work out the pencil-and-paper idea of a TM that
> Turing had for a specific complete computation without having some way
> to uniquely identify each state.
Right, you give each state a 'Name' (not a numeric address). Possibly
even a 'heirarchial' name to represent 'sub-machines' within the machine.
>
> This uniquely identifiable set of states corresponds to a subset of
> natural numbers beginning with zero thus essentially specifying the
> machine address of this state. All TM's can be construed as having a
> finite set of numbered states beginning with zero.
There is no reason, except to make it easier to put into a digital
computer, to assign natural numbers, and as pointed out, the mapping is
totally meaningless. State '1' has no relationship to State '2' except
what the transitons might say. In no sense is State '2' 'after' State
'1' except by some arbitrary ordering.
Turing Machine definitions are Mathematical SETS, totally unordered.
There is nothing to say what order states qx, qn, and qy (for example)
are in.
>
>> is that the 'Numbers' of the states in the machine Linz-H for its
>> states might not match the numbers for the corresponding states in
>> Linz-H^ for its included copy of them, in fact if you define that the
>> starting state will be numerical 0, then they CAN't be as H^.q0 is a
>> different part of the algorithm then H.q0, and H^.qx will be a
>> non-zero 'address' mapping to H.q0 which will be zero. Thus your idea
>> of 'comparing' the addresses fails as H doesn't know what 'address' in
>> H^ correspond to the copy of it. It doesn't even know that there IS a
>> copy of it in H^.
>>
>> This is part of the FLAW of your setup, The provided computation needs
>> to be defined in a totally seperate 'address space' as the decider,
>> which means H can't use the trick you want to detect the recursion.
>
>
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-10-14 01:24 -0700 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <43e79946-0cb7-4d83-8011-3fffc4c844a2n@googlegroups.com> |
| In reply to | #40375 |
On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>
> In any physically existing machine {current_state, current_input} must
> be represented by integer values, thus providing the machine address of
> this point in the execution trace. Imagining them away by simply not
> paying attention does not eliminate this mandatory requirement.
>
That's the normal way to represent a machine. It allows for the "Godel number",
a concept that caused some people difficulty at the time it was proposed,
but doesn't seem difficult at all now since we are used to computer files
being just lists of 1s and 0s at the physical level.
However you don't have to use integers, you just need a unique label
for every state. You could use "State A", "State B", or, if you wanted to be
cute "Kentucky", "Alabama". Integers have this disadvantage of implying
that the states have ordering. They don't. The integers are just labels.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-14 09:57 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <IamdnZMLh5b92PX8nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #40391 |
On 10/14/2021 3:24 AM, Malcolm McLean wrote:
> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>
>> In any physically existing machine {current_state, current_input} must
>> be represented by integer values, thus providing the machine address of
>> this point in the execution trace. Imagining them away by simply not
>> paying attention does not eliminate this mandatory requirement.
>>
> That's the normal way to represent a machine. It allows for the "Godel number",
> a concept that caused some people difficulty at the time it was proposed,
> but doesn't seem difficult at all now since we are used to computer files
> being just lists of 1s and 0s at the physical level.
>
> However you don't have to use integers, you just need a unique label
> for every state. You could use "State A", "State B", or, if you wanted to be
> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
> that the states have ordering. They don't. The integers are just labels.
>
Any means of uniquely identifying the states of a TM can be
arbitrarily mapped to a sequence of natural numbers beginning
with 0.
The key issue of all of this is that identical copies of a
TM description such that the input to one of these simulated
copies invokes this same machine description may decide this
input differently than an input that does not invoke this
same machine description.
2.3 Random Access Turing Machines
The reason we don’t like Turing Machines is because they have a
ridiculous memory model. We solve this by allowing random access to the
tapes. http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
--
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-14 16:06 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <ska9l3$p8r$1@dont-email.me> |
| In reply to | #40392 |
On 2021-10-14 08:57, olcott wrote:
> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>
>>> In any physically existing machine {current_state, current_input} must
>>> be represented by integer values, thus providing the machine address of
>>> this point in the execution trace. Imagining them away by simply not
>>> paying attention does not eliminate this mandatory requirement.
>>>
>> That's the normal way to represent a machine. It allows for the "Godel
>> number",
>> a concept that caused some people difficulty at the time it was proposed,
>> but doesn't seem difficult at all now since we are used to computer files
>> being just lists of 1s and 0s at the physical level.
>>
>> However you don't have to use integers, you just need a unique label
>> for every state. You could use "State A", "State B", or, if you wanted
>> to be
>> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
>> that the states have ordering. They don't. The integers are just labels.
>>
>
> Any means of uniquely identifying the states of a TM can be
> arbitrarily mapped to a sequence of natural numbers beginning
> with 0.
>
> The key issue of all of this is that identical copies of a
> TM description such that the input to one of these simulated
> copies invokes this same machine description may decide this
> input differently than an input that does not invoke this
> same machine description.
Have you really thought this through using *actual* Turing Machines?
If you refer to {current_state, current_input} as a "machine address"
and arbitrarily map the states and inputs to integers beginning at one,
then any two TMs with the same number of states and the same number of
symbols will generally have identical sets of "machine addresses"
regardless of what the TMs actually do. So how does this help you to
determine whether two machines are the same or not?
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-14 17:47 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <PbqdndvnxerzLvX8nZ2dnUU7-RHNnZ2d@giganews.com> |
| In reply to | #40394 |
On 10/14/2021 5:06 PM, André G. Isaak wrote:
> On 2021-10-14 08:57, olcott wrote:
>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>
>>>> In any physically existing machine {current_state, current_input} must
>>>> be represented by integer values, thus providing the machine address of
>>>> this point in the execution trace. Imagining them away by simply not
>>>> paying attention does not eliminate this mandatory requirement.
>>>>
>>> That's the normal way to represent a machine. It allows for the
>>> "Godel number",
>>> a concept that caused some people difficulty at the time it was
>>> proposed,
>>> but doesn't seem difficult at all now since we are used to computer
>>> files
>>> being just lists of 1s and 0s at the physical level.
>>>
>>> However you don't have to use integers, you just need a unique label
>>> for every state. You could use "State A", "State B", or, if you
>>> wanted to be
>>> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
>>> that the states have ordering. They don't. The integers are just labels.
>>>
>>
>> Any means of uniquely identifying the states of a TM can be
>> arbitrarily mapped to a sequence of natural numbers beginning
>> with 0.
>>
>> The key issue of all of this is that identical copies of a
>> TM description such that the input to one of these simulated
>> copies invokes this same machine description may decide this
>> input differently than an input that does not invoke this
>> same machine description.
>
> Have you really thought this through using *actual* Turing Machines?
>
I don't have the 100,000 years that this would take.
This would not be feasible unless we at least define TM's with RAM.
> If you refer to {current_state, current_input} as a "machine address"
> and arbitrarily map the states and inputs to integers beginning at one,
> then any two TMs with the same number of states and the same number of
> symbols will generally have identical sets of "machine addresses"
They will be located at different places in RAM.
2.3 Random Access Turing Machines
The reason we don’t like Turing Machines is because
they have a ridiculous memory model. We solve this
by allowing random access to the tapes.
http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
> regardless of what the TMs actually do. So how does this help you to
> determine whether two machines are the same or not?
We know that two machines are the same when the only way that we execute
TM's is by simulating their machine description and the second copy of
the machine description is the other machine.
>
> 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-14 17:32 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <skaelt$jmk$1@dont-email.me> |
| In reply to | #40395 |
On 2021-10-14 16:47, olcott wrote:
> On 10/14/2021 5:06 PM, André G. Isaak wrote:
>> On 2021-10-14 08:57, olcott wrote:
>>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>>
>>>>> In any physically existing machine {current_state, current_input} must
>>>>> be represented by integer values, thus providing the machine
>>>>> address of
>>>>> this point in the execution trace. Imagining them away by simply not
>>>>> paying attention does not eliminate this mandatory requirement.
>>>>>
>>>> That's the normal way to represent a machine. It allows for the
>>>> "Godel number",
>>>> a concept that caused some people difficulty at the time it was
>>>> proposed,
>>>> but doesn't seem difficult at all now since we are used to computer
>>>> files
>>>> being just lists of 1s and 0s at the physical level.
>>>>
>>>> However you don't have to use integers, you just need a unique label
>>>> for every state. You could use "State A", "State B", or, if you
>>>> wanted to be
>>>> cute "Kentucky", "Alabama". Integers have this disadvantage of implying
>>>> that the states have ordering. They don't. The integers are just
>>>> labels.
>>>>
>>>
>>> Any means of uniquely identifying the states of a TM can be
>>> arbitrarily mapped to a sequence of natural numbers beginning
>>> with 0.
>>>
>>> The key issue of all of this is that identical copies of a
>>> TM description such that the input to one of these simulated
>>> copies invokes this same machine description may decide this
>>> input differently than an input that does not invoke this
>>> same machine description.
>>
>> Have you really thought this through using *actual* Turing Machines?
>>
>
> I don't have the 100,000 years that this would take.
You really like inventing these numbers out of thin air, don't you?
I simply want you to explain how a TM is supposed to use your 'machine
addresses' to determine whether a given TM description is the same as
another or not.
> This would not be feasible unless we at least define TM's with RAM.
Which means you're no longer talking about TMs.
>> If you refer to {current_state, current_input} as a "machine address"
>> and arbitrarily map the states and inputs to integers beginning at
>> one, then any two TMs with the same number of states and the same
>> number of symbols will generally have identical sets of "machine
>> addresses"
>
> They will be located at different places in RAM.
TMs don't have RAM.
> 2.3 Random Access Turing Machines
> The reason we don’t like Turing Machines is because
> they have a ridiculous memory model. We solve this
> by allowing random access to the tapes.
> http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
The model described in the above link, despite the name used, is not a
class of Turing Machines. It also doesn't lend to what you are trying to
do since the indices used refer to positions on the *tape*, which don't
correspond to what you are calling 'machine addresses'. All copies of
H_Hat copied to the tape will be at different locations on the tape and
thus will have different indices.
>> regardless of what the TMs actually do. So how does this help you to
>> determine whether two machines are the same or not?
>
> We know that two machines are the same when the only way that we execute
> TM's is by simulating their machine description
What do you mean 'the only way'? Linz's H is *not* simulated. It is an
actual Turing Machine. In your model, the *input* description given to H
is simulated.
> and the second copy of the machine description is the other machine.
I can't figure out what you mean by the above. What is 'the other machine'?
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-14 19:27 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ untainted decision ] |
| Message-ID | <IvWdnYCcUbZ3V_X8nZ2dnUU7-I_NnZ2d@giganews.com> |
| In reply to | #40396 |
On 10/14/2021 6:32 PM, André G. Isaak wrote:
> On 2021-10-14 16:47, olcott wrote:
>> On 10/14/2021 5:06 PM, André G. Isaak wrote:
>>> On 2021-10-14 08:57, olcott wrote:
>>>> On 10/14/2021 3:24 AM, Malcolm McLean wrote:
>>>>> On Wednesday, 13 October 2021 at 19:57:55 UTC+1, olcott wrote:
>>>>>>
>>>>>> In any physically existing machine {current_state, current_input}
>>>>>> must
>>>>>> be represented by integer values, thus providing the machine
>>>>>> address of
>>>>>> this point in the execution trace. Imagining them away by simply not
>>>>>> paying attention does not eliminate this mandatory requirement.
>>>>>>
>>>>> That's the normal way to represent a machine. It allows for the
>>>>> "Godel number",
>>>>> a concept that caused some people difficulty at the time it was
>>>>> proposed,
>>>>> but doesn't seem difficult at all now since we are used to computer
>>>>> files
>>>>> being just lists of 1s and 0s at the physical level.
>>>>>
>>>>> However you don't have to use integers, you just need a unique label
>>>>> for every state. You could use "State A", "State B", or, if you
>>>>> wanted to be
>>>>> cute "Kentucky", "Alabama". Integers have this disadvantage of
>>>>> implying
>>>>> that the states have ordering. They don't. The integers are just
>>>>> labels.
>>>>>
>>>>
>>>> Any means of uniquely identifying the states of a TM can be
>>>> arbitrarily mapped to a sequence of natural numbers beginning
>>>> with 0.
>>>>
>>>> The key issue of all of this is that identical copies of a
>>>> TM description such that the input to one of these simulated
>>>> copies invokes this same machine description may decide this
>>>> input differently than an input that does not invoke this
>>>> same machine description.
>>>
>>> Have you really thought this through using *actual* Turing Machines?
>>>
>>
>> I don't have the 100,000 years that this would take.
>
> You really like inventing these numbers out of thin air, don't you?
>
> I simply want you to explain how a TM is supposed to use your 'machine
> addresses' to determine whether a given TM description is the same as
> another or not.
>
>> This would not be feasible unless we at least define TM's with RAM.
>
> Which means you're no longer talking about TMs.
>
>>> If you refer to {current_state, current_input} as a "machine address"
>>> and arbitrarily map the states and inputs to integers beginning at
>>> one, then any two TMs with the same number of states and the same
>>> number of symbols will generally have identical sets of "machine
>>> addresses"
>>
>> They will be located at different places in RAM.
>
> TMs don't have RAM.
>
>> 2.3 Random Access Turing Machines
>> The reason we don’t like Turing Machines is because
>> they have a ridiculous memory model. We solve this
>> by allowing random access to the tapes.
>> http://www.cs.cmu.edu/~odonnell/toolkit13/lecture05-anonymous.pdf
>
> The model described in the above link, despite the name used, is not a
> class of Turing Machines. It also doesn't lend to what you are trying to
> do since the indices used refer to positions on the *tape*, which don't
> correspond to what you are calling 'machine addresses'. All copies of
> H_Hat copied to the tape will be at different locations on the tape and
> thus will have different indices.
Yes that is what I mean by machine addresses.
>
>>> regardless of what the TMs actually do. So how does this help you to
>>> determine whether two machines are the same or not?
>>
>> We know that two machines are the same when the only way that we
>> execute TM's is by simulating their machine description
>
> What do you mean 'the only way'? Linz's H is *not* simulated. It is an
> actual Turing Machine. In your model, the *input* description given to H
> is simulated.
Linz explicitly specified that H is any TM that gets the right answer.
He is incorrect that H does not exist.
>
>> and the second copy of the machine description is the other machine.
>
> I can't figure out what you mean by the above. What is 'the other machine'?
Look at your own words and see.
>
> André
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 7 of 17 — ← Prev page 1 … 5 6 [7] 8 9 … 17 Next page →
Back to top | Article view | comp.theory
csiph-web