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 3 of 17 — ← Prev page 1 2 [3] 4 5 … 17 Next page →
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2021-10-01 10:55 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj7eij$32u$1@dont-email.me> |
| In reply to | #40166 |
On 10/1/2021 10:27 AM, Andy Walker wrote: > On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >> Of course an /unrestricted/ x86 program can do that [...] >> If you are concerned with saying things of relevance to TMs and >> Linz's proof, you need to limit your C code to doing things that >> directly correspond with what TMs can do. [...] > > I think it is misleading to talk about what TMs can do as > thought they are interestingly different from what x86 programs or > any real computer can do. An x86 computer /is/ a FSM with extra > storage; in other words, a TM. We tend to write rather simple > TMs to illustrate points, but there is no reason why it should > not have 2^N states, where N is rather large [the number of bits > in your computer]. "Taking the address of a function" is not > "difficult" with a TM, just rather tedious. > > There is no reason why someone [I'm not volunteering!] > should not write a C compiler the target of which is recognisably > a TM. It's just going to be rather complicated. [Probably easier, > AAMOF, to write a microcode as a TM, and describe real computers > in terms of that microcode. In the 1930s, that would have seemed > like magic, but it is how many/most modern computers work.] > > That's why I think people are barking up the wrong tree > when complaining that PO writes C code that is "not a function". > It doesn't matter. It just means that the "hat" construction > is more complicated than PO claims, inc all the states [etc] of > the FSM, inc "hidden" variables. The real errors lie elsewhere. I think what people are trying to say and may be saying badly is that the set of things that can influence an execution must all be considered part of that execution. Trivial but important. Said another way apropos to the current conversation is that when you propose something to play the role of the Linz H, the definition of that something must include everything that influences its execution. PO doesn't do that. 'It' also keeps the piece he calls H from being function- or computation-like. One of the "rules" of software reasoning is that one must carefully delimit the boundaries of what one is talking about. This basic guideline has been ignored into oblivion. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 12:04 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <OImdndzvVKUwosr8nZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #40169 |
On 10/1/2021 11:55 AM, Jeff Barnett wrote:
> On 10/1/2021 10:27 AM, Andy Walker wrote:
>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>> Of course an /unrestricted/ x86 program can do that [...]
>>> If you are concerned with saying things of relevance to TMs and
>>> Linz's proof, you need to limit your C code to doing things that
>>> directly correspond with what TMs can do. [...]
>>
>> I think it is misleading to talk about what TMs can do as
>> thought they are interestingly different from what x86 programs or
>> any real computer can do. An x86 computer /is/ a FSM with extra
>> storage; in other words, a TM. We tend to write rather simple
>> TMs to illustrate points, but there is no reason why it should
>> not have 2^N states, where N is rather large [the number of bits
>> in your computer]. "Taking the address of a function" is not
>> "difficult" with a TM, just rather tedious.
>>
>> There is no reason why someone [I'm not volunteering!]
>> should not write a C compiler the target of which is recognisably
>> a TM. It's just going to be rather complicated. [Probably easier,
>> AAMOF, to write a microcode as a TM, and describe real computers
>> in terms of that microcode. In the 1930s, that would have seemed
>> like magic, but it is how many/most modern computers work.]
>>
>> That's why I think people are barking up the wrong tree
>> when complaining that PO writes C code that is "not a function".
>> It doesn't matter. It just means that the "hat" construction
>> is more complicated than PO claims, inc all the states [etc] of
>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
> I think what people are trying to say and may be saying badly is that
> the set of things that can influence an execution must all be considered
> part of that execution. Trivial but important. Said another way apropos
> to the current conversation is that when you propose something to play
> the role of the Linz H, the definition of that something must include
> everything that influences its execution. PO doesn't do that. 'It' also
> keeps the piece he calls H from being function- or computation-like. One
> of the "rules" of software reasoning is that one must carefully delimit
> the boundaries of what one is talking about. This basic guideline has
> been ignored into oblivion.
It is very difficult to confirm that a [computable function]
https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
Must be a [pure function]
https://en.wikipedia.org/wiki/Pure_function
When no official source say this.
None-the-less my partial halt deciders {H1, H} are being transformed
into [pure functions] that take finite string inputs. Also my C/x86
equivalent P of the Linz Ĥ will copy its input so that it more closely
conforms to the Linz Ĥ.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 13:17 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <woH5J.94130$g81.14743@fx33.iad> |
| In reply to | #40170 |
On 10/1/21 1:04 PM, olcott wrote:
> On 10/1/2021 11:55 AM, Jeff Barnett wrote:
>> On 10/1/2021 10:27 AM, Andy Walker wrote:
>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>>> Of course an /unrestricted/ x86 program can do that [...]
>>>> If you are concerned with saying things of relevance to TMs and
>>>> Linz's proof, you need to limit your C code to doing things that
>>>> directly correspond with what TMs can do. [...]
>>>
>>> I think it is misleading to talk about what TMs can do as
>>> thought they are interestingly different from what x86 programs or
>>> any real computer can do. An x86 computer /is/ a FSM with extra
>>> storage; in other words, a TM. We tend to write rather simple
>>> TMs to illustrate points, but there is no reason why it should
>>> not have 2^N states, where N is rather large [the number of bits
>>> in your computer]. "Taking the address of a function" is not
>>> "difficult" with a TM, just rather tedious.
>>>
>>> There is no reason why someone [I'm not volunteering!]
>>> should not write a C compiler the target of which is recognisably
>>> a TM. It's just going to be rather complicated. [Probably easier,
>>> AAMOF, to write a microcode as a TM, and describe real computers
>>> in terms of that microcode. In the 1930s, that would have seemed
>>> like magic, but it is how many/most modern computers work.]
>>>
>>> That's why I think people are barking up the wrong tree
>>> when complaining that PO writes C code that is "not a function".
>>> It doesn't matter. It just means that the "hat" construction
>>> is more complicated than PO claims, inc all the states [etc] of
>>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
>> I think what people are trying to say and may be saying badly is that
>> the set of things that can influence an execution must all be
>> considered part of that execution. Trivial but important. Said another
>> way apropos to the current conversation is that when you propose
>> something to play the role of the Linz H, the definition of that
>> something must include everything that influences its execution. PO
>> doesn't do that. 'It' also keeps the piece he calls H from being
>> function- or computation-like. One of the "rules" of software
>> reasoning is that one must carefully delimit the boundaries of what
>> one is talking about. This basic guideline has been ignored into
>> oblivion.
>
> It is very difficult to confirm that a [computable function]
> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
>
>
> Must be a [pure function]
> https://en.wikipedia.org/wiki/Pure_function
>
> When no official source say this.
>
> None-the-less my partial halt deciders {H1, H} are being transformed
> into [pure functions] that take finite string inputs. Also my C/x86
> equivalent P of the Linz Ĥ will copy its input so that it more closely
> conforms to the Linz Ĥ.
>
Because they are different concepts and don't actually map directly into
each other.
A Computatble Function will tend to naturally be a Pure Function, but it
is possible to make a Computable Function out of limited forms of
non-Pure Functions (for example, caching of results to avoid recomputing
already computed results).
It is also possible of a Pure Function to not be a Computatble Function
if the pure function depends in some way on the address that it is being
run from. The concept of Pure Functions deal with a single instance of
it always mapping input to output, while a Computable Function deals
with a UNIVERSAL mapping of input to output of ALL copies of it.
Pure Functions are inplementations in physical hardware.
Computable Functions are mathematical abstractions.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 12:30 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] |
| Message-ID | <SeydnU3wH5872Mr8nZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #40172 |
On 10/1/2021 12:17 PM, Richard Damon wrote:
> On 10/1/21 1:04 PM, olcott wrote:
>> On 10/1/2021 11:55 AM, Jeff Barnett wrote:
>>> On 10/1/2021 10:27 AM, Andy Walker wrote:
>>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>>>> Of course an /unrestricted/ x86 program can do that [...]
>>>>> If you are concerned with saying things of relevance to TMs and
>>>>> Linz's proof, you need to limit your C code to doing things that
>>>>> directly correspond with what TMs can do. [...]
>>>>
>>>> I think it is misleading to talk about what TMs can do as
>>>> thought they are interestingly different from what x86 programs or
>>>> any real computer can do. An x86 computer /is/ a FSM with extra
>>>> storage; in other words, a TM. We tend to write rather simple
>>>> TMs to illustrate points, but there is no reason why it should
>>>> not have 2^N states, where N is rather large [the number of bits
>>>> in your computer]. "Taking the address of a function" is not
>>>> "difficult" with a TM, just rather tedious.
>>>>
>>>> There is no reason why someone [I'm not volunteering!]
>>>> should not write a C compiler the target of which is recognisably
>>>> a TM. It's just going to be rather complicated. [Probably easier,
>>>> AAMOF, to write a microcode as a TM, and describe real computers
>>>> in terms of that microcode. In the 1930s, that would have seemed
>>>> like magic, but it is how many/most modern computers work.]
>>>>
>>>> That's why I think people are barking up the wrong tree
>>>> when complaining that PO writes C code that is "not a function".
>>>> It doesn't matter. It just means that the "hat" construction
>>>> is more complicated than PO claims, inc all the states [etc] of
>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
>>> I think what people are trying to say and may be saying badly is that
>>> the set of things that can influence an execution must all be
>>> considered part of that execution. Trivial but important. Said another
>>> way apropos to the current conversation is that when you propose
>>> something to play the role of the Linz H, the definition of that
>>> something must include everything that influences its execution. PO
>>> doesn't do that. 'It' also keeps the piece he calls H from being
>>> function- or computation-like. One of the "rules" of software
>>> reasoning is that one must carefully delimit the boundaries of what
>>> one is talking about. This basic guideline has been ignored into
>>> oblivion.
>>
>> It is very difficult to confirm that a [computable function]
>> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
>>
>>
>> Must be a [pure function]
>> https://en.wikipedia.org/wiki/Pure_function
>>
>> When no official source say this.
>>
>> None-the-less my partial halt deciders {H1, H} are being transformed
>> into [pure functions] that take finite string inputs. Also my C/x86
>> equivalent P of the Linz Ĥ will copy its input so that it more closely
>> conforms to the Linz Ĥ.
>>
> Because they are different concepts and don't actually map directly into
> each other.
>
> A Computatble Function will tend to naturally be a Pure Function, but it
> is possible to make a Computable Function out of limited forms of
> non-Pure Functions (for example, caching of results to avoid recomputing
> already computed results).
>
> It is also possible of a Pure Function to not be a Computatble Function
> if the pure function depends in some way on the address that it is being
> run from. The concept of Pure Functions deal with a single instance of
> it always mapping input to output, while a Computable Function deals
> with a UNIVERSAL mapping of input to output of ALL copies of it.
>
> Pure Functions are inplementations in physical hardware.
>
> Computable Functions are mathematical abstractions.
>
Some of the stuff that you say is well reasoned and can be confirmed.
Some of it is pure bullshit, simply talking out of your ass.
The key pure bullshit item was either you or André that simply rejected
the whole idea of a simulating halt decider out-of-hand.
This is the key basis of my whole proof:
The halting theorem counter-examples present infinitely nested
simulation (non-halting) behavior to every simulating halt decider.
How a simulating halt decider determines that its input is an instance
of infinitely nested simulation is merely an implementation detail.
As long as a simulating halt decider can determine this by one means or
another, then the conventional halting theorem proofs have been refuted.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 16:18 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] |
| Message-ID | <22K5J.123970$z%4.85529@fx37.iad> |
| In reply to | #40176 |
On 10/1/21 1:30 PM, olcott wrote:
> On 10/1/2021 12:17 PM, Richard Damon wrote:
>> On 10/1/21 1:04 PM, olcott wrote:
>>> On 10/1/2021 11:55 AM, Jeff Barnett wrote:
>>>> On 10/1/2021 10:27 AM, Andy Walker wrote:
>>>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>>>>> Of course an /unrestricted/ x86 program can do that [...]
>>>>>> If you are concerned with saying things of relevance to TMs and
>>>>>> Linz's proof, you need to limit your C code to doing things that
>>>>>> directly correspond with what TMs can do. [...]
>>>>>
>>>>> I think it is misleading to talk about what TMs can do as
>>>>> thought they are interestingly different from what x86 programs or
>>>>> any real computer can do. An x86 computer /is/ a FSM with extra
>>>>> storage; in other words, a TM. We tend to write rather simple
>>>>> TMs to illustrate points, but there is no reason why it should
>>>>> not have 2^N states, where N is rather large [the number of bits
>>>>> in your computer]. "Taking the address of a function" is not
>>>>> "difficult" with a TM, just rather tedious.
>>>>>
>>>>> There is no reason why someone [I'm not volunteering!]
>>>>> should not write a C compiler the target of which is recognisably
>>>>> a TM. It's just going to be rather complicated. [Probably easier,
>>>>> AAMOF, to write a microcode as a TM, and describe real computers
>>>>> in terms of that microcode. In the 1930s, that would have seemed
>>>>> like magic, but it is how many/most modern computers work.]
>>>>>
>>>>> That's why I think people are barking up the wrong tree
>>>>> when complaining that PO writes C code that is "not a function".
>>>>> It doesn't matter. It just means that the "hat" construction
>>>>> is more complicated than PO claims, inc all the states [etc] of
>>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
>>>> I think what people are trying to say and may be saying badly is that
>>>> the set of things that can influence an execution must all be
>>>> considered part of that execution. Trivial but important. Said another
>>>> way apropos to the current conversation is that when you propose
>>>> something to play the role of the Linz H, the definition of that
>>>> something must include everything that influences its execution. PO
>>>> doesn't do that. 'It' also keeps the piece he calls H from being
>>>> function- or computation-like. One of the "rules" of software
>>>> reasoning is that one must carefully delimit the boundaries of what
>>>> one is talking about. This basic guideline has been ignored into
>>>> oblivion.
>>>
>>> It is very difficult to confirm that a [computable function]
>>> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
>>>
>>>
>>>
>>> Must be a [pure function]
>>> https://en.wikipedia.org/wiki/Pure_function
>>>
>>> When no official source say this.
>>>
>>> None-the-less my partial halt deciders {H1, H} are being transformed
>>> into [pure functions] that take finite string inputs. Also my C/x86
>>> equivalent P of the Linz Ĥ will copy its input so that it more closely
>>> conforms to the Linz Ĥ.
>>>
>> Because they are different concepts and don't actually map directly into
>> each other.
>>
>> A Computatble Function will tend to naturally be a Pure Function, but it
>> is possible to make a Computable Function out of limited forms of
>> non-Pure Functions (for example, caching of results to avoid recomputing
>> already computed results).
>>
>> It is also possible of a Pure Function to not be a Computatble Function
>> if the pure function depends in some way on the address that it is being
>> run from. The concept of Pure Functions deal with a single instance of
>> it always mapping input to output, while a Computable Function deals
>> with a UNIVERSAL mapping of input to output of ALL copies of it.
>>
>> Pure Functions are inplementations in physical hardware.
>>
>> Computable Functions are mathematical abstractions.
>>
>
> Some of the stuff that you say is well reasoned and can be confirmed.
> Some of it is pure bullshit, simply talking out of your ass.
>
More likely, you THINK stuff is 'pure bullshit' because it doesn't agree
with your own 'bullshit'. You seem to be unable to perform critical
thinking to try to understand stuff that isn't immediate in agreement
with your own preconceptions.
> The key pure bullshit item was either you or André that simply rejected
> the whole idea of a simulating halt decider out-of-hand.
So, you can't even keep who said what straight (maybe I should ask you
to 'prove' this with the quote with time-stamp like you like to do).
I do not out of hand reject a simulating halt decider, but a simulating
halt decider can't solve the problem, because NO decider can.
A simulating Halt decider will ALWAYS be a partial decider, being able
to detect only certain non-halting machines that match a pre-defined set
of 'simple' activity patterns, and should eventually be able to detect
all halting machines unless some of the patterns it uses can generate
'false positives' (like your rules do).
>
> This is the key basis of my whole proof:
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
Except that it doesn't
The Running of P(P) shows that no P gets involved in more than 3 levels
of simulation, because the decider it calls stops after two levels.
>
> How a simulating halt decider determines that its input is an instance
> of infinitely nested simulation is merely an implementation detail.
Which you have wrong, because your decider assumes that all copies of
itself will NEVER abort their simulation, when it will abort the exact
same simulation.
This means either it is just wrong, or it isn't actually a Computation.
>
> As long as a simulating halt decider can determine this by one means or
> another, then the conventional halting theorem proofs have been refuted.
>
Right, if it DID get it right, it might be able to come up with the
right answer. But it doesn't.
Because of the structure of the problem, and the fact that it is
deciding on a machine that knows what decision we will make, the decider
is stuck in a losing game.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 15:25 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] |
| Message-ID | <_-WdneGRkdk088r8nZ2dnUU7-TWdnZ2d@giganews.com> |
| In reply to | #40186 |
On 10/1/2021 3:18 PM, Richard Damon wrote:
> On 10/1/21 1:30 PM, olcott wrote:
>> On 10/1/2021 12:17 PM, Richard Damon wrote:
>>> On 10/1/21 1:04 PM, olcott wrote:
>>>> On 10/1/2021 11:55 AM, Jeff Barnett wrote:
>>>>> On 10/1/2021 10:27 AM, Andy Walker wrote:
>>>>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>>>>>> Of course an /unrestricted/ x86 program can do that [...]
>>>>>>> If you are concerned with saying things of relevance to TMs and
>>>>>>> Linz's proof, you need to limit your C code to doing things that
>>>>>>> directly correspond with what TMs can do. [...]
>>>>>>
>>>>>> I think it is misleading to talk about what TMs can do as
>>>>>> thought they are interestingly different from what x86 programs or
>>>>>> any real computer can do. An x86 computer /is/ a FSM with extra
>>>>>> storage; in other words, a TM. We tend to write rather simple
>>>>>> TMs to illustrate points, but there is no reason why it should
>>>>>> not have 2^N states, where N is rather large [the number of bits
>>>>>> in your computer]. "Taking the address of a function" is not
>>>>>> "difficult" with a TM, just rather tedious.
>>>>>>
>>>>>> There is no reason why someone [I'm not volunteering!]
>>>>>> should not write a C compiler the target of which is recognisably
>>>>>> a TM. It's just going to be rather complicated. [Probably easier,
>>>>>> AAMOF, to write a microcode as a TM, and describe real computers
>>>>>> in terms of that microcode. In the 1930s, that would have seemed
>>>>>> like magic, but it is how many/most modern computers work.]
>>>>>>
>>>>>> That's why I think people are barking up the wrong tree
>>>>>> when complaining that PO writes C code that is "not a function".
>>>>>> It doesn't matter. It just means that the "hat" construction
>>>>>> is more complicated than PO claims, inc all the states [etc] of
>>>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
>>>>> I think what people are trying to say and may be saying badly is that
>>>>> the set of things that can influence an execution must all be
>>>>> considered part of that execution. Trivial but important. Said another
>>>>> way apropos to the current conversation is that when you propose
>>>>> something to play the role of the Linz H, the definition of that
>>>>> something must include everything that influences its execution. PO
>>>>> doesn't do that. 'It' also keeps the piece he calls H from being
>>>>> function- or computation-like. One of the "rules" of software
>>>>> reasoning is that one must carefully delimit the boundaries of what
>>>>> one is talking about. This basic guideline has been ignored into
>>>>> oblivion.
>>>>
>>>> It is very difficult to confirm that a [computable function]
>>>> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
>>>>
>>>>
>>>>
>>>> Must be a [pure function]
>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>
>>>> When no official source say this.
>>>>
>>>> None-the-less my partial halt deciders {H1, H} are being transformed
>>>> into [pure functions] that take finite string inputs. Also my C/x86
>>>> equivalent P of the Linz Ĥ will copy its input so that it more closely
>>>> conforms to the Linz Ĥ.
>>>>
>>> Because they are different concepts and don't actually map directly into
>>> each other.
>>>
>>> A Computatble Function will tend to naturally be a Pure Function, but it
>>> is possible to make a Computable Function out of limited forms of
>>> non-Pure Functions (for example, caching of results to avoid recomputing
>>> already computed results).
>>>
>>> It is also possible of a Pure Function to not be a Computatble Function
>>> if the pure function depends in some way on the address that it is being
>>> run from. The concept of Pure Functions deal with a single instance of
>>> it always mapping input to output, while a Computable Function deals
>>> with a UNIVERSAL mapping of input to output of ALL copies of it.
>>>
>>> Pure Functions are inplementations in physical hardware.
>>>
>>> Computable Functions are mathematical abstractions.
>>>
>>
>> Some of the stuff that you say is well reasoned and can be confirmed.
>> Some of it is pure bullshit, simply talking out of your ass.
>>
>
> More likely, you THINK stuff is 'pure bullshit' because it doesn't agree
> with your own 'bullshit'. You seem to be unable to perform critical
> thinking to try to understand stuff that isn't immediate in agreement
> with your own preconceptions.
>
>> The key pure bullshit item was either you or André that simply rejected
>> the whole idea of a simulating halt decider out-of-hand.
>
> So, you can't even keep who said what straight (maybe I should ask you
> to 'prove' this with the quote with time-stamp like you like to do).
>
> I do not out of hand reject a simulating halt decider, but a simulating
> halt decider can't solve the problem, because NO decider can.
>
> A simulating Halt decider will ALWAYS be a partial decider, being able
> to detect only certain non-halting machines that match a pre-defined set
> of 'simple' activity patterns, and should eventually be able to detect
> all halting machines unless some of the patterns it uses can generate
> 'false positives' (like your rules do).
>
>>
>> This is the key basis of my whole proof:
>> The halting theorem counter-examples present infinitely nested
>> simulation (non-halting) behavior to every simulating halt decider.
>
> Except that it doesn't
>
> The Running of P(P) shows that no P gets involved in more than 3 levels
> of simulation, because the decider it calls stops after two levels.
>
>>
>> How a simulating halt decider determines that its input is an instance
>> of infinitely nested simulation is merely an implementation detail.
>
> Which you have wrong, because your decider assumes that all copies of
> itself will NEVER abort their simulation, when it will abort the exact
> same simulation.
>
> This means either it is just wrong, or it isn't actually a Computation.
>
>>
>> As long as a simulating halt decider can determine this by one means or
>> another, then the conventional halting theorem proofs have been refuted.
>>
>
> Right, if it DID get it right, it might be able to come up with the
> right answer. But it doesn't.
>
> Because of the structure of the problem, and the fact that it is
> deciding on a machine that knows what decision we will make, the decider
> is stuck in a losing game.
>
The whole basis of my rebuttal of the halting problem proofs:
The halting theorem counter-examples present infinitely nested
simulation (non-halting) behavior to every simulating halt decider.
How the simulating halt decider detects that an input is presenting
infinitely nested simulation is merely an implementation detail.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 16:49 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) [ key basis of refutation ] |
| Message-ID | <OvK5J.137783$lC6.128506@fx41.iad> |
| In reply to | #40188 |
On 10/1/21 4:25 PM, olcott wrote:
> On 10/1/2021 3:18 PM, Richard Damon wrote:
>> On 10/1/21 1:30 PM, olcott wrote:
>>> On 10/1/2021 12:17 PM, Richard Damon wrote:
>>>> On 10/1/21 1:04 PM, olcott wrote:
>>>>> On 10/1/2021 11:55 AM, Jeff Barnett wrote:
>>>>>> On 10/1/2021 10:27 AM, Andy Walker wrote:
>>>>>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]:
>>>>>>>> Of course an /unrestricted/ x86 program can do that [...]
>>>>>>>> If you are concerned with saying things of relevance to TMs and
>>>>>>>> Linz's proof, you need to limit your C code to doing things that
>>>>>>>> directly correspond with what TMs can do. [...]
>>>>>>>
>>>>>>> I think it is misleading to talk about what TMs can do as
>>>>>>> thought they are interestingly different from what x86 programs or
>>>>>>> any real computer can do. An x86 computer /is/ a FSM with extra
>>>>>>> storage; in other words, a TM. We tend to write rather simple
>>>>>>> TMs to illustrate points, but there is no reason why it should
>>>>>>> not have 2^N states, where N is rather large [the number of bits
>>>>>>> in your computer]. "Taking the address of a function" is not
>>>>>>> "difficult" with a TM, just rather tedious.
>>>>>>>
>>>>>>> There is no reason why someone [I'm not volunteering!]
>>>>>>> should not write a C compiler the target of which is recognisably
>>>>>>> a TM. It's just going to be rather complicated. [Probably easier,
>>>>>>> AAMOF, to write a microcode as a TM, and describe real computers
>>>>>>> in terms of that microcode. In the 1930s, that would have seemed
>>>>>>> like magic, but it is how many/most modern computers work.]
>>>>>>>
>>>>>>> That's why I think people are barking up the wrong tree
>>>>>>> when complaining that PO writes C code that is "not a function".
>>>>>>> It doesn't matter. It just means that the "hat" construction
>>>>>>> is more complicated than PO claims, inc all the states [etc] of
>>>>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
>>>>>> I think what people are trying to say and may be saying badly is that
>>>>>> the set of things that can influence an execution must all be
>>>>>> considered part of that execution. Trivial but important. Said
>>>>>> another
>>>>>> way apropos to the current conversation is that when you propose
>>>>>> something to play the role of the Linz H, the definition of that
>>>>>> something must include everything that influences its execution. PO
>>>>>> doesn't do that. 'It' also keeps the piece he calls H from being
>>>>>> function- or computation-like. One of the "rules" of software
>>>>>> reasoning is that one must carefully delimit the boundaries of what
>>>>>> one is talking about. This basic guideline has been ignored into
>>>>>> oblivion.
>>>>>
>>>>> It is very difficult to confirm that a [computable function]
>>>>> https://en.wikipedia.org/wiki/Computable_function#Characteristics_of_computable_functions
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> Must be a [pure function]
>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>
>>>>> When no official source say this.
>>>>>
>>>>> None-the-less my partial halt deciders {H1, H} are being transformed
>>>>> into [pure functions] that take finite string inputs. Also my C/x86
>>>>> equivalent P of the Linz Ĥ will copy its input so that it more closely
>>>>> conforms to the Linz Ĥ.
>>>>>
>>>> Because they are different concepts and don't actually map directly
>>>> into
>>>> each other.
>>>>
>>>> A Computatble Function will tend to naturally be a Pure Function,
>>>> but it
>>>> is possible to make a Computable Function out of limited forms of
>>>> non-Pure Functions (for example, caching of results to avoid
>>>> recomputing
>>>> already computed results).
>>>>
>>>> It is also possible of a Pure Function to not be a Computatble Function
>>>> if the pure function depends in some way on the address that it is
>>>> being
>>>> run from. The concept of Pure Functions deal with a single instance of
>>>> it always mapping input to output, while a Computable Function deals
>>>> with a UNIVERSAL mapping of input to output of ALL copies of it.
>>>>
>>>> Pure Functions are inplementations in physical hardware.
>>>>
>>>> Computable Functions are mathematical abstractions.
>>>>
>>>
>>> Some of the stuff that you say is well reasoned and can be confirmed.
>>> Some of it is pure bullshit, simply talking out of your ass.
>>>
>>
>> More likely, you THINK stuff is 'pure bullshit' because it doesn't agree
>> with your own 'bullshit'. You seem to be unable to perform critical
>> thinking to try to understand stuff that isn't immediate in agreement
>> with your own preconceptions.
>>
>>> The key pure bullshit item was either you or André that simply rejected
>>> the whole idea of a simulating halt decider out-of-hand.
>>
>> So, you can't even keep who said what straight (maybe I should ask you
>> to 'prove' this with the quote with time-stamp like you like to do).
>>
>> I do not out of hand reject a simulating halt decider, but a simulating
>> halt decider can't solve the problem, because NO decider can.
>>
>> A simulating Halt decider will ALWAYS be a partial decider, being able
>> to detect only certain non-halting machines that match a pre-defined set
>> of 'simple' activity patterns, and should eventually be able to detect
>> all halting machines unless some of the patterns it uses can generate
>> 'false positives' (like your rules do).
>>
>>>
>>> This is the key basis of my whole proof:
>>> The halting theorem counter-examples present infinitely nested
>>> simulation (non-halting) behavior to every simulating halt decider.
>>
>> Except that it doesn't
>>
>> The Running of P(P) shows that no P gets involved in more than 3 levels
>> of simulation, because the decider it calls stops after two levels.
>>
>>>
>>> How a simulating halt decider determines that its input is an instance
>>> of infinitely nested simulation is merely an implementation detail.
>>
>> Which you have wrong, because your decider assumes that all copies of
>> itself will NEVER abort their simulation, when it will abort the exact
>> same simulation.
>>
>> This means either it is just wrong, or it isn't actually a Computation.
>>
>>>
>>> As long as a simulating halt decider can determine this by one means or
>>> another, then the conventional halting theorem proofs have been refuted.
>>>
>>
>> Right, if it DID get it right, it might be able to come up with the
>> right answer. But it doesn't.
>>
>> Because of the structure of the problem, and the fact that it is
>> deciding on a machine that knows what decision we will make, the decider
>> is stuck in a losing game.
>>
>
> The whole basis of my rebuttal of the halting problem proofs:
>
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
>
> How the simulating halt decider detects that an input is presenting
> infinitely nested simulation is merely an implementation detail.
>
>
Except that they don't. As I have said before, and you have not replied.
P(P) does NOT generate infinite recursion (if H(P,P) answers non-halting).
From our current reveled definitions, where H(P,P) aborts its simulation
after 2 'levels' of simulation, then the fully simulated P(P) will have
precisely 3 'layers' in it and then it will stop as the H in the first
layser will aborts its simulation, return no-halting and P will halt.
Thus H was WRONG in its decision that the simulation would have been
infinitely leveled. Yes, if you change H to simulate for N levels, then
the simulated P will be seen to go for precisely N+1 levels, just out of
reach of the outer simulating H. This doesn't make it 'infinite', just
that H will be wrong.
H needs some 'smarter' code to try to deal with this form of 'recursive'
invocation, and the Linz proof shows that it can NEVER be 'smart enough'
to handle all cases. At best, it can be smart enough to know it has been
had (for this case) and resign in dignity.
It does turn out that there will be other cases where it just won't be
able to tell if it has been defeated, but might just keep processing
forever to make a decision.
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-10-01 21:09 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj7pu6$12m9$1@gioia.aioe.org> |
| In reply to | #40169 |
On 01/10/2021 17:55, Jeff Barnett wrote:
[I wrote:]
>> That's why I think people are barking up the wrong tree
>> when complaining that PO writes C code that is "not a function".
>> It doesn't matter. It just means that the "hat" construction
>> is more complicated than PO claims, inc all the states [etc] of
>> the FSM, inc "hidden" variables. The real errors lie elsewhere.
> I think what people are trying to say and may be saying badly is that
> the set of things that can influence an execution must all be
> considered part of that execution. Trivial but important. [...]
Absolutely. IOW, the "hat" construction is still possible,
but is not the simplistic version that PO presents.
[FTAOD, although I was replying to one of your posts, my
article wasn't "aimed" at you, but at the whole way this "debate"
has been going. It's too easy to get sucked in to PO's way of
"thinking".]
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Balakirev
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 15:23 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <_-WdneaRkdnP88r8nZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #40185 |
On 10/1/2021 3:09 PM, Andy Walker wrote: > On 01/10/2021 17:55, Jeff Barnett wrote: > [I wrote:] >>> That's why I think people are barking up the wrong tree >>> when complaining that PO writes C code that is "not a function". >>> It doesn't matter. It just means that the "hat" construction >>> is more complicated than PO claims, inc all the states [etc] of >>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >> I think what people are trying to say and may be saying badly is that >> the set of things that can influence an execution must all be >> considered part of that execution. Trivial but important. [...] > > Absolutely. IOW, the "hat" construction is still possible, > but is not the simplistic version that PO presents. > > [FTAOD, although I was replying to one of your posts, my > article wasn't "aimed" at you, but at the whole way this "debate" > has been going. It's too easy to get sucked in to PO's way of > "thinking".] > The whole basis of my rebuttal of the halting problem proofs: The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. How the simulating halt decider detects that an input is presenting infinitely nested simulation is merely an implementation detail. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 21:32 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <877dewjxk6.fsf@bsb.me.uk> |
| In reply to | #40185 |
Andy Walker <anw@cuboid.co.uk> writes: > On 01/10/2021 17:55, Jeff Barnett wrote: > [I wrote:] >>> That's why I think people are barking up the wrong tree >>> when complaining that PO writes C code that is "not a function". >>> It doesn't matter. It just means that the "hat" construction >>> is more complicated than PO claims, inc all the states [etc] of >>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >> I think what people are trying to say and may be saying badly is that >> the set of things that can influence an execution must all be >> considered part of that execution. Trivial but important. [...] > > Absolutely. IOW, the "hat" construction is still possible, > but is not the simplistic version that PO presents. > > [FTAOD, although I was replying to one of your posts, my > article wasn't "aimed" at you, but at the whole way this "debate" > has been going. It's too easy to get sucked in to PO's way of > "thinking".] Another pattern I have tried is that of the challenge-response. The challenge is to write a function with some particular specification (in an imaginary "unbounded" dialect of C) and then a case the proposed solution gets wrong is presented as the response. The "challengee" can then come up with another solution that gets round this case, but then there will be another case it gets wrong. This way, there is no way for the challengee to know the "hat" construction in advance. The promise is simply that there will be some case your code won't get right. PO now sees the problem with such things and simply declines. (Well, the last time he told me I'd got the specification wrong!) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 15:46 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <6YOdnfOd3N0z7sr8nZ2dnUU7-V_NnZ2d@giganews.com> |
| In reply to | #40190 |
On 10/1/2021 3:32 PM, Ben Bacarisse wrote: > Andy Walker <anw@cuboid.co.uk> writes: > >> On 01/10/2021 17:55, Jeff Barnett wrote: >> [I wrote:] >>>> That's why I think people are barking up the wrong tree >>>> when complaining that PO writes C code that is "not a function". >>>> It doesn't matter. It just means that the "hat" construction >>>> is more complicated than PO claims, inc all the states [etc] of >>>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>> I think what people are trying to say and may be saying badly is that >>> the set of things that can influence an execution must all be >>> considered part of that execution. Trivial but important. [...] >> >> Absolutely. IOW, the "hat" construction is still possible, >> but is not the simplistic version that PO presents. >> >> [FTAOD, although I was replying to one of your posts, my >> article wasn't "aimed" at you, but at the whole way this "debate" >> has been going. It's too easy to get sucked in to PO's way of >> "thinking".] > > Another pattern I have tried is that of the challenge-response. The > challenge is to write a function with some particular specification (in > an imaginary "unbounded" dialect of C) and then a case the proposed > solution gets wrong is presented as the response. The "challengee" can > then come up with another solution that gets round this case, but then > there will be another case it gets wrong. This way, there is no way for > the challengee to know the "hat" construction in advance. The promise > is simply that there will be some case your code won't get right. > > PO now sees the problem with such things and simply declines. (Well, > the last time he told me I'd got the specification wrong!) > I have said this many hundreds of times. The only case that it is required to get right is the single pattern of an input doing exactly the opposite of whatever the halt decider decides. To actually solve the halting problem requires hundreds of trillions-fold more effort and would thus be the subject of a deep learning solution. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 16:55 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <EAK5J.137784$lC6.65786@fx41.iad> |
| In reply to | #40195 |
On 10/1/21 4:46 PM, olcott wrote: > On 10/1/2021 3:32 PM, Ben Bacarisse wrote: >> Andy Walker <anw@cuboid.co.uk> writes: >> >>> On 01/10/2021 17:55, Jeff Barnett wrote: >>> [I wrote:] >>>>> That's why I think people are barking up the wrong tree >>>>> when complaining that PO writes C code that is "not a function". >>>>> It doesn't matter. It just means that the "hat" construction >>>>> is more complicated than PO claims, inc all the states [etc] of >>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>>> I think what people are trying to say and may be saying badly is that >>>> the set of things that can influence an execution must all be >>>> considered part of that execution. Trivial but important. [...] >>> >>> Absolutely. IOW, the "hat" construction is still possible, >>> but is not the simplistic version that PO presents. >>> >>> [FTAOD, although I was replying to one of your posts, my >>> article wasn't "aimed" at you, but at the whole way this "debate" >>> has been going. It's too easy to get sucked in to PO's way of >>> "thinking".] >> >> Another pattern I have tried is that of the challenge-response. The >> challenge is to write a function with some particular specification (in >> an imaginary "unbounded" dialect of C) and then a case the proposed >> solution gets wrong is presented as the response. The "challengee" can >> then come up with another solution that gets round this case, but then >> there will be another case it gets wrong. This way, there is no way for >> the challengee to know the "hat" construction in advance. The promise >> is simply that there will be some case your code won't get right. >> >> PO now sees the problem with such things and simply declines. (Well, >> the last time he told me I'd got the specification wrong!) >> > > I have said this many hundreds of times. > The only case that it is required to get right is the single pattern of > an input doing exactly the opposite of whatever the halt decider decides. > > To actually solve the halting problem requires hundreds of > trillions-fold more effort and would thus be the subject of a deep > learning solution. > Which you still haven't been able to do. Your latest effort (which doesn't seem to have changed for a long time) is that H(<H^>,<H^>) (or H(P,P)) says that its input represents a non-halting comutation when H^(<H^>) does Halt when run. Since Halting isn't non-Halting, your H isn't right. You sometime try to change the question, to look at the internal partial simulation of the input that H does, but that isn't the problem. You also sometimes try to claim that some H1 that is a copy gets the answer right, but that just shows that either H1 isn't the exact copy claimed or H isn't a computation of JUST its defined input but has some other hidden input that matters.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-02 00:13 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <878rzcibj6.fsf@bsb.me.uk> |
| In reply to | #40195 |
olcott <NoOne@NoWhere.com> writes: > On 10/1/2021 3:32 PM, Ben Bacarisse wrote: >> Andy Walker <anw@cuboid.co.uk> writes: >> >>> On 01/10/2021 17:55, Jeff Barnett wrote: >>> [I wrote:] >>>>> That's why I think people are barking up the wrong tree >>>>> when complaining that PO writes C code that is "not a function". >>>>> It doesn't matter. It just means that the "hat" construction >>>>> is more complicated than PO claims, inc all the states [etc] of >>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>>> I think what people are trying to say and may be saying badly is that >>>> the set of things that can influence an execution must all be >>>> considered part of that execution. Trivial but important. [...] >>> >>> Absolutely. IOW, the "hat" construction is still possible, >>> but is not the simplistic version that PO presents. >>> >>> [FTAOD, although I was replying to one of your posts, my >>> article wasn't "aimed" at you, but at the whole way this "debate" >>> has been going. It's too easy to get sucked in to PO's way of >>> "thinking".] >> Another pattern I have tried is that of the challenge-response. The >> challenge is to write a function with some particular specification (in >> an imaginary "unbounded" dialect of C) and then a case the proposed >> solution gets wrong is presented as the response. The "challengee" can >> then come up with another solution that gets round this case, but then >> there will be another case it gets wrong. This way, there is no way for >> the challengee to know the "hat" construction in advance. The promise >> is simply that there will be some case your code won't get right. >> PO now sees the problem with such things and simply declines. (Well, >> the last time he told me I'd got the specification wrong!) > > I have said this many hundreds of times. > The only case that it is required to get right is the single pattern > of an input doing exactly the opposite of whatever the halt decider > decides. I know. But despite this admirably narrow focus you have foolishly accepted my challenge. Twice. It did not go well. Curiously, in both cases you failed on the exactly the case you do claim to have "solved"! The first time round you just declared the wrong answer to be the right one: "Halts(Confound_Halts, Confound_Halts) returns false." Message-ID: <2aidnV9e3qQaOCDCnZ2dnUU7-c3NnZ2d@giganews.com> but "The input to Halts is only finite because..." Message-ID: <6eSdnYuLBrIuVFzCnZ2dnUU7-cPNnZ2d@giganews.com> (The challenge stated that Halts should return false only for "inputs" that are not finite computations.) The second time, you told me: "You merely stated your incorrect opinion about what the output should be." !!! That's not how a challenge works! I get to say what the output should be. > To actually solve the halting problem requires hundreds of > trillions-fold more effort... So let's not forget what you said in August last year: "I really do have a halting decider. Your failure to understand the details of how this is true is not my fault." -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 13:11 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <3jH5J.33152$oY4.31323@fx20.iad> |
| In reply to | #40166 |
On 10/1/21 12:27 PM, Andy Walker wrote: > On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >> Of course an /unrestricted/ x86 program can do that [...] >> If you are concerned with saying things of relevance to TMs and >> Linz's proof, you need to limit your C code to doing things that >> directly correspond with what TMs can do. [...] > > I think it is misleading to talk about what TMs can do as > thought they are interestingly different from what x86 programs or > any real computer can do. An x86 computer /is/ a FSM with extra > storage; in other words, a TM. We tend to write rather simple > TMs to illustrate points, but there is no reason why it should > not have 2^N states, where N is rather large [the number of bits > in your computer]. "Taking the address of a function" is not > "difficult" with a TM, just rather tedious. > > There is no reason why someone [I'm not volunteering!] > should not write a C compiler the target of which is recognisably > a TM. It's just going to be rather complicated. [Probably easier, > AAMOF, to write a microcode as a TM, and describe real computers > in terms of that microcode. In the 1930s, that would have seemed > like magic, but it is how many/most modern computers work.] > > That's why I think people are barking up the wrong tree > when complaining that PO writes C code that is "not a function". > It doesn't matter. It just means that the "hat" construction > is more complicated than PO claims, inc all the states [etc] of > the FSM, inc "hidden" variables. The real errors lie elsewhere. > The key difference between a Turing Machine and a 'conventional' program is that Turing Machines are ALWAYS looked at as a 'full operation', and any sub-piece looked at, is itself a Turing Machine. When we map that to an conventional computer, the equivalent is the WHOLE machine and programming in it as a whole. When we break appart the programming into sub-pieces, because the computing model is 'more powerful' in some aspects, we can talk about sub-pieces of the whole system tha aren't themselves equivalent to a whole system. We have functions that can 'save' data between calls, or pass data behind the backs of the outside. We have functions that might envoke pieces that are outside of themselves. All of these are things that A Turing Machine, or a 'Complete' computer can't do. This is the difference between talking about the Mathematical concept of a 'Computation' and Computer Programming. Computation Theory and the like deal with the capability of a 'Full Machine' or a sub part that acks like another 'Full Machine. Computer Programming and Software Engineering focuses more on the sub-pieces, and often sub-pieces that are the equivalent of a 'Full Machine' on their own. One key is that ANY piece of a Computer Program, when you make sure the 'code' consists of ALL the code that is run when we run that piece of code, and the input consists of ALL the information that piece of code uses to determine its output, will follow the rules of Computations and there will be an 'equivalent' Turing Machine. The issue is that often, when working in the fields of Programming or Software Engineering, we don't limit our selves to that view. We think of a 'sub-routine' that might depend on code outside of itself as part of its execution, or ignore some of the information that a given invocation might depend on. Those models do NOT correspond to what Compution Theory describes as a Computation. Yes, there are LOTS of interesting things in these non-computation models, and that is an important part of THOSE theories. THey just are NOT part of Comptation Theory. One big reason Computaton Theory focuses on Turing Machines, is that by their structure, what they do is clearly what the Theory wants to talk about. We don't need to worry if the code uses something outside its defined bounds, as the limitations of how a Turing Machine is described, makes it impossible to create such a condition. On the other hand, the 'higher' computation modeles, like the conventional computer, can easily be made to do things that break these definitions, so you need to pay care to stay within the bounds. PO has this basic problem, the thing he wants to do CAN'T be done with Turing Machines, as the Halting Problem Proofs clearly show. He can't accept that this proof is valid. He thus is tryihg to create a program in a conventional computer to show that something like what the Halting Problem Proof says is impossible is possible on that platform. The key is that since a Turing Machine can't do it, neither can a conventional program that actual follows the rules of being the equivalent of a Computation. His basic goal is to try to find a way to make a program that LOOKS like it is a Computation, but actually isn't, that does what is impossible to do as a Computation. Either he needs to come up with a theory shattering example that shows that there IS an actual Computation that an x86 can do that doesn't have a Turing Machine Equivalent (and thus disprove Church-Turing) or he needs to be deceptive and hide is non-computational aspect of his program. All his work seems to be about the latter, and this is hampered by the fact that he seems to refuse to actually study the theory to any depth to actually understand what he is trying to do, so he keeps making primative errors. This comes out in his attempt to try and get approval to use a 'wrong definition' as the equivalent of the right one, like the Computer Science term of a 'Pure Function' to be fully the same as a 'Computation'. The key difference here is that the Computer Scientist is normally only concerned about a single copy of the function always giving the same input to output mapping, while the Computation Theorist wants ALL copies of the function to implement the same input to output mapping.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 12:18 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <8MSdnf6SVcaZ3sr8nZ2dnUU7-fnNnZ2d@giganews.com> |
| In reply to | #40171 |
On 10/1/2021 12:11 PM, Richard Damon wrote: > On 10/1/21 12:27 PM, Andy Walker wrote: >> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >>> Of course an /unrestricted/ x86 program can do that [...] >>> If you are concerned with saying things of relevance to TMs and >>> Linz's proof, you need to limit your C code to doing things that >>> directly correspond with what TMs can do. [...] >> >> I think it is misleading to talk about what TMs can do as >> thought they are interestingly different from what x86 programs or >> any real computer can do. An x86 computer /is/ a FSM with extra >> storage; in other words, a TM. We tend to write rather simple >> TMs to illustrate points, but there is no reason why it should >> not have 2^N states, where N is rather large [the number of bits >> in your computer]. "Taking the address of a function" is not >> "difficult" with a TM, just rather tedious. >> >> There is no reason why someone [I'm not volunteering!] >> should not write a C compiler the target of which is recognisably >> a TM. It's just going to be rather complicated. [Probably easier, >> AAMOF, to write a microcode as a TM, and describe real computers >> in terms of that microcode. In the 1930s, that would have seemed >> like magic, but it is how many/most modern computers work.] >> >> That's why I think people are barking up the wrong tree >> when complaining that PO writes C code that is "not a function". >> It doesn't matter. It just means that the "hat" construction >> is more complicated than PO claims, inc all the states [etc] of >> the FSM, inc "hidden" variables. The real errors lie elsewhere. >> > > The key difference between a Turing Machine and a 'conventional' program > is that Turing Machines are ALWAYS looked at as a 'full operation', and > any sub-piece looked at, is itself a Turing Machine. > > When we map that to an conventional computer, the equivalent is the > WHOLE machine and programming in it as a whole. > > When we break appart the programming into sub-pieces, because the > computing model is 'more powerful' in some aspects, we can talk about > sub-pieces of the whole system tha aren't themselves equivalent to a > whole system. > > We have functions that can 'save' data between calls, or pass data > behind the backs of the outside. We have functions that might envoke > pieces that are outside of themselves. All of these are things that A > Turing Machine, or a 'Complete' computer can't do. > > This is the difference between talking about the Mathematical concept of > a 'Computation' and Computer Programming. > > Computation Theory and the like deal with the capability of a 'Full > Machine' or a sub part that acks like another 'Full Machine. > > Computer Programming and Software Engineering focuses more on the > sub-pieces, and often sub-pieces that are the equivalent of a 'Full > Machine' on their own. > > One key is that ANY piece of a Computer Program, when you make sure the > 'code' consists of ALL the code that is run when we run that piece of > code, and the input consists of ALL the information that piece of code > uses to determine its output, will follow the rules of Computations and > there will be an 'equivalent' Turing Machine. > > The issue is that often, when working in the fields of Programming or > Software Engineering, we don't limit our selves to that view. We think > of a 'sub-routine' that might depend on code outside of itself as part > of its execution, or ignore some of the information that a given > invocation might depend on. Those models do NOT correspond to what > Compution Theory describes as a Computation. > > Yes, there are LOTS of interesting things in these non-computation > models, and that is an important part of THOSE theories. THey just are > NOT part of Comptation Theory. > > One big reason Computaton Theory focuses on Turing Machines, is that by > their structure, what they do is clearly what the Theory wants to talk > about. We don't need to worry if the code uses something outside its > defined bounds, as the limitations of how a Turing Machine is described, > makes it impossible to create such a condition. > > On the other hand, the 'higher' computation modeles, like the > conventional computer, can easily be made to do things that break these > definitions, so you need to pay care to stay within the bounds. > > PO has this basic problem, the thing he wants to do CAN'T be done with > Turing Machines, as the Halting Problem Proofs clearly show. He can't > accept that this proof is valid. He thus is tryihg to create a program > in a conventional computer to show that something like what the Halting > Problem Proof says is impossible is possible on that platform. > > The key is that since a Turing Machine can't do it, neither can a > conventional program that actual follows the rules of being the > equivalent of a Computation. His basic goal is to try to find a way to > make a program that LOOKS like it is a Computation, but actually isn't, > that does what is impossible to do as a Computation. > > Either he needs to come up with a theory shattering example that shows > that there IS an actual Computation that an x86 can do that doesn't have > a Turing Machine Equivalent (and thus disprove Church-Turing) or he > needs to be deceptive and hide is non-computational aspect of his program. > > All his work seems to be about the latter, and this is hampered by the > fact that he seems to refuse to actually study the theory to any depth > to actually understand what he is trying to do, so he keeps making > primative errors. > > This comes out in his attempt to try and get approval to use a 'wrong > definition' as the equivalent of the right one, like the Computer > Science term of a 'Pure Function' to be fully the same as a 'Computation'. > > The key difference here is that the Computer Scientist is normally only > concerned about a single copy of the function always giving the same > input to output mapping, while the Computation Theorist wants ALL copies > of the function to implement the same input to output mapping. > I always glance at you posts to see if they are drivel or not. This is the first one that is not drivel. See my reply to Jeff on this. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 13:22 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <stH5J.94132$g81.65895@fx33.iad> |
| In reply to | #40173 |
On 10/1/21 1:18 PM, olcott wrote: > On 10/1/2021 12:11 PM, Richard Damon wrote: >> On 10/1/21 12:27 PM, Andy Walker wrote: >>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >>>> Of course an /unrestricted/ x86 program can do that [...] >>>> If you are concerned with saying things of relevance to TMs and >>>> Linz's proof, you need to limit your C code to doing things that >>>> directly correspond with what TMs can do. [...] >>> >>> I think it is misleading to talk about what TMs can do as >>> thought they are interestingly different from what x86 programs or >>> any real computer can do. An x86 computer /is/ a FSM with extra >>> storage; in other words, a TM. We tend to write rather simple >>> TMs to illustrate points, but there is no reason why it should >>> not have 2^N states, where N is rather large [the number of bits >>> in your computer]. "Taking the address of a function" is not >>> "difficult" with a TM, just rather tedious. >>> >>> There is no reason why someone [I'm not volunteering!] >>> should not write a C compiler the target of which is recognisably >>> a TM. It's just going to be rather complicated. [Probably easier, >>> AAMOF, to write a microcode as a TM, and describe real computers >>> in terms of that microcode. In the 1930s, that would have seemed >>> like magic, but it is how many/most modern computers work.] >>> >>> That's why I think people are barking up the wrong tree >>> when complaining that PO writes C code that is "not a function". >>> It doesn't matter. It just means that the "hat" construction >>> is more complicated than PO claims, inc all the states [etc] of >>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>> >> >> The key difference between a Turing Machine and a 'conventional' program >> is that Turing Machines are ALWAYS looked at as a 'full operation', and >> any sub-piece looked at, is itself a Turing Machine. >> >> When we map that to an conventional computer, the equivalent is the >> WHOLE machine and programming in it as a whole. >> >> When we break appart the programming into sub-pieces, because the >> computing model is 'more powerful' in some aspects, we can talk about >> sub-pieces of the whole system tha aren't themselves equivalent to a >> whole system. >> >> We have functions that can 'save' data between calls, or pass data >> behind the backs of the outside. We have functions that might envoke >> pieces that are outside of themselves. All of these are things that A >> Turing Machine, or a 'Complete' computer can't do. >> >> This is the difference between talking about the Mathematical concept of >> a 'Computation' and Computer Programming. >> >> Computation Theory and the like deal with the capability of a 'Full >> Machine' or a sub part that acks like another 'Full Machine. >> >> Computer Programming and Software Engineering focuses more on the >> sub-pieces, and often sub-pieces that are the equivalent of a 'Full >> Machine' on their own. >> >> One key is that ANY piece of a Computer Program, when you make sure the >> 'code' consists of ALL the code that is run when we run that piece of >> code, and the input consists of ALL the information that piece of code >> uses to determine its output, will follow the rules of Computations and >> there will be an 'equivalent' Turing Machine. >> >> The issue is that often, when working in the fields of Programming or >> Software Engineering, we don't limit our selves to that view. We think >> of a 'sub-routine' that might depend on code outside of itself as part >> of its execution, or ignore some of the information that a given >> invocation might depend on. Those models do NOT correspond to what >> Compution Theory describes as a Computation. >> >> Yes, there are LOTS of interesting things in these non-computation >> models, and that is an important part of THOSE theories. THey just are >> NOT part of Comptation Theory. >> >> One big reason Computaton Theory focuses on Turing Machines, is that by >> their structure, what they do is clearly what the Theory wants to talk >> about. We don't need to worry if the code uses something outside its >> defined bounds, as the limitations of how a Turing Machine is described, >> makes it impossible to create such a condition. >> >> On the other hand, the 'higher' computation modeles, like the >> conventional computer, can easily be made to do things that break these >> definitions, so you need to pay care to stay within the bounds. >> >> PO has this basic problem, the thing he wants to do CAN'T be done with >> Turing Machines, as the Halting Problem Proofs clearly show. He can't >> accept that this proof is valid. He thus is tryihg to create a program >> in a conventional computer to show that something like what the Halting >> Problem Proof says is impossible is possible on that platform. >> >> The key is that since a Turing Machine can't do it, neither can a >> conventional program that actual follows the rules of being the >> equivalent of a Computation. His basic goal is to try to find a way to >> make a program that LOOKS like it is a Computation, but actually isn't, >> that does what is impossible to do as a Computation. >> >> Either he needs to come up with a theory shattering example that shows >> that there IS an actual Computation that an x86 can do that doesn't have >> a Turing Machine Equivalent (and thus disprove Church-Turing) or he >> needs to be deceptive and hide is non-computational aspect of his >> program. >> >> All his work seems to be about the latter, and this is hampered by the >> fact that he seems to refuse to actually study the theory to any depth >> to actually understand what he is trying to do, so he keeps making >> primative errors. >> >> This comes out in his attempt to try and get approval to use a 'wrong >> definition' as the equivalent of the right one, like the Computer >> Science term of a 'Pure Function' to be fully the same as a >> 'Computation'. >> >> The key difference here is that the Computer Scientist is normally only >> concerned about a single copy of the function always giving the same >> input to output mapping, while the Computation Theorist wants ALL copies >> of the function to implement the same input to output mapping. >> > > I always glance at you posts to see if they are drivel or not. > This is the first one that is not drivel. > See my reply to Jeff on this. > I will admit that I don't always hit the mark of explaining thing in a way that your disturbed mind can understand. My comments have NOT be 'drivel' (at least for the most parts, I will admit to getting at times a bit snarky). They just don't make sense to your with your 'filter' on reality. See my response to your respeonce to him.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-01 12:43 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <1qmdnW9wZoZF1cr8nZ2dnUU7-LWdnZ2d@giganews.com> |
| In reply to | #40175 |
On 10/1/2021 12:22 PM, Richard Damon wrote: > On 10/1/21 1:18 PM, olcott wrote: >> On 10/1/2021 12:11 PM, Richard Damon wrote: >>> On 10/1/21 12:27 PM, Andy Walker wrote: >>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >>>>> Of course an /unrestricted/ x86 program can do that [...] >>>>> If you are concerned with saying things of relevance to TMs and >>>>> Linz's proof, you need to limit your C code to doing things that >>>>> directly correspond with what TMs can do. [...] >>>> >>>> I think it is misleading to talk about what TMs can do as >>>> thought they are interestingly different from what x86 programs or >>>> any real computer can do. An x86 computer /is/ a FSM with extra >>>> storage; in other words, a TM. We tend to write rather simple >>>> TMs to illustrate points, but there is no reason why it should >>>> not have 2^N states, where N is rather large [the number of bits >>>> in your computer]. "Taking the address of a function" is not >>>> "difficult" with a TM, just rather tedious. >>>> >>>> There is no reason why someone [I'm not volunteering!] >>>> should not write a C compiler the target of which is recognisably >>>> a TM. It's just going to be rather complicated. [Probably easier, >>>> AAMOF, to write a microcode as a TM, and describe real computers >>>> in terms of that microcode. In the 1930s, that would have seemed >>>> like magic, but it is how many/most modern computers work.] >>>> >>>> That's why I think people are barking up the wrong tree >>>> when complaining that PO writes C code that is "not a function". >>>> It doesn't matter. It just means that the "hat" construction >>>> is more complicated than PO claims, inc all the states [etc] of >>>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>>> >>> >>> The key difference between a Turing Machine and a 'conventional' program >>> is that Turing Machines are ALWAYS looked at as a 'full operation', and >>> any sub-piece looked at, is itself a Turing Machine. >>> >>> When we map that to an conventional computer, the equivalent is the >>> WHOLE machine and programming in it as a whole. >>> >>> When we break appart the programming into sub-pieces, because the >>> computing model is 'more powerful' in some aspects, we can talk about >>> sub-pieces of the whole system tha aren't themselves equivalent to a >>> whole system. >>> >>> We have functions that can 'save' data between calls, or pass data >>> behind the backs of the outside. We have functions that might envoke >>> pieces that are outside of themselves. All of these are things that A >>> Turing Machine, or a 'Complete' computer can't do. >>> >>> This is the difference between talking about the Mathematical concept of >>> a 'Computation' and Computer Programming. >>> >>> Computation Theory and the like deal with the capability of a 'Full >>> Machine' or a sub part that acks like another 'Full Machine. >>> >>> Computer Programming and Software Engineering focuses more on the >>> sub-pieces, and often sub-pieces that are the equivalent of a 'Full >>> Machine' on their own. >>> >>> One key is that ANY piece of a Computer Program, when you make sure the >>> 'code' consists of ALL the code that is run when we run that piece of >>> code, and the input consists of ALL the information that piece of code >>> uses to determine its output, will follow the rules of Computations and >>> there will be an 'equivalent' Turing Machine. >>> >>> The issue is that often, when working in the fields of Programming or >>> Software Engineering, we don't limit our selves to that view. We think >>> of a 'sub-routine' that might depend on code outside of itself as part >>> of its execution, or ignore some of the information that a given >>> invocation might depend on. Those models do NOT correspond to what >>> Compution Theory describes as a Computation. >>> >>> Yes, there are LOTS of interesting things in these non-computation >>> models, and that is an important part of THOSE theories. THey just are >>> NOT part of Comptation Theory. >>> >>> One big reason Computaton Theory focuses on Turing Machines, is that by >>> their structure, what they do is clearly what the Theory wants to talk >>> about. We don't need to worry if the code uses something outside its >>> defined bounds, as the limitations of how a Turing Machine is described, >>> makes it impossible to create such a condition. >>> >>> On the other hand, the 'higher' computation modeles, like the >>> conventional computer, can easily be made to do things that break these >>> definitions, so you need to pay care to stay within the bounds. >>> >>> PO has this basic problem, the thing he wants to do CAN'T be done with >>> Turing Machines, as the Halting Problem Proofs clearly show. He can't >>> accept that this proof is valid. He thus is tryihg to create a program >>> in a conventional computer to show that something like what the Halting >>> Problem Proof says is impossible is possible on that platform. >>> >>> The key is that since a Turing Machine can't do it, neither can a >>> conventional program that actual follows the rules of being the >>> equivalent of a Computation. His basic goal is to try to find a way to >>> make a program that LOOKS like it is a Computation, but actually isn't, >>> that does what is impossible to do as a Computation. >>> >>> Either he needs to come up with a theory shattering example that shows >>> that there IS an actual Computation that an x86 can do that doesn't have >>> a Turing Machine Equivalent (and thus disprove Church-Turing) or he >>> needs to be deceptive and hide is non-computational aspect of his >>> program. >>> >>> All his work seems to be about the latter, and this is hampered by the >>> fact that he seems to refuse to actually study the theory to any depth >>> to actually understand what he is trying to do, so he keeps making >>> primative errors. >>> >>> This comes out in his attempt to try and get approval to use a 'wrong >>> definition' as the equivalent of the right one, like the Computer >>> Science term of a 'Pure Function' to be fully the same as a >>> 'Computation'. >>> >>> The key difference here is that the Computer Scientist is normally only >>> concerned about a single copy of the function always giving the same >>> input to output mapping, while the Computation Theorist wants ALL copies >>> of the function to implement the same input to output mapping. >>> >> >> I always glance at you posts to see if they are drivel or not. >> This is the first one that is not drivel. >> See my reply to Jeff on this. >> > > I will admit that I don't always hit the mark of explaining thing in a > way that your disturbed mind can understand. > > My comments have NOT be 'drivel' (at least for the most parts, I will > admit to getting at times a bit snarky). > > They just don't make sense to your with your 'filter' on reality. > > See my response to your respeonce to him. > When-so-ever you reject anything out-of-hand without any supporting reasoning what-so-ever I just skip the whole rest of the post. Most of your posts are like this. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-01 16:26 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <_9K5J.42420$nR3.889@fx38.iad> |
| In reply to | #40178 |
On 10/1/21 1:43 PM, olcott wrote: > On 10/1/2021 12:22 PM, Richard Damon wrote: >> On 10/1/21 1:18 PM, olcott wrote: >>> On 10/1/2021 12:11 PM, Richard Damon wrote: >>>> On 10/1/21 12:27 PM, Andy Walker wrote: >>>>> On 01/10/2021 15:12, Mike Terry wrote [to PO, of course]: >>>>>> Of course an /unrestricted/ x86 program can do that [...] >>>>>> If you are concerned with saying things of relevance to TMs and >>>>>> Linz's proof, you need to limit your C code to doing things that >>>>>> directly correspond with what TMs can do. [...] >>>>> >>>>> I think it is misleading to talk about what TMs can do as >>>>> thought they are interestingly different from what x86 programs or >>>>> any real computer can do. An x86 computer /is/ a FSM with extra >>>>> storage; in other words, a TM. We tend to write rather simple >>>>> TMs to illustrate points, but there is no reason why it should >>>>> not have 2^N states, where N is rather large [the number of bits >>>>> in your computer]. "Taking the address of a function" is not >>>>> "difficult" with a TM, just rather tedious. >>>>> >>>>> There is no reason why someone [I'm not volunteering!] >>>>> should not write a C compiler the target of which is recognisably >>>>> a TM. It's just going to be rather complicated. [Probably easier, >>>>> AAMOF, to write a microcode as a TM, and describe real computers >>>>> in terms of that microcode. In the 1930s, that would have seemed >>>>> like magic, but it is how many/most modern computers work.] >>>>> >>>>> That's why I think people are barking up the wrong tree >>>>> when complaining that PO writes C code that is "not a function". >>>>> It doesn't matter. It just means that the "hat" construction >>>>> is more complicated than PO claims, inc all the states [etc] of >>>>> the FSM, inc "hidden" variables. The real errors lie elsewhere. >>>>> >>>> >>>> The key difference between a Turing Machine and a 'conventional' >>>> program >>>> is that Turing Machines are ALWAYS looked at as a 'full operation', and >>>> any sub-piece looked at, is itself a Turing Machine. >>>> >>>> When we map that to an conventional computer, the equivalent is the >>>> WHOLE machine and programming in it as a whole. >>>> >>>> When we break appart the programming into sub-pieces, because the >>>> computing model is 'more powerful' in some aspects, we can talk about >>>> sub-pieces of the whole system tha aren't themselves equivalent to a >>>> whole system. >>>> >>>> We have functions that can 'save' data between calls, or pass data >>>> behind the backs of the outside. We have functions that might envoke >>>> pieces that are outside of themselves. All of these are things that A >>>> Turing Machine, or a 'Complete' computer can't do. >>>> >>>> This is the difference between talking about the Mathematical >>>> concept of >>>> a 'Computation' and Computer Programming. >>>> >>>> Computation Theory and the like deal with the capability of a 'Full >>>> Machine' or a sub part that acks like another 'Full Machine. >>>> >>>> Computer Programming and Software Engineering focuses more on the >>>> sub-pieces, and often sub-pieces that are the equivalent of a 'Full >>>> Machine' on their own. >>>> >>>> One key is that ANY piece of a Computer Program, when you make sure the >>>> 'code' consists of ALL the code that is run when we run that piece of >>>> code, and the input consists of ALL the information that piece of code >>>> uses to determine its output, will follow the rules of Computations and >>>> there will be an 'equivalent' Turing Machine. >>>> >>>> The issue is that often, when working in the fields of Programming or >>>> Software Engineering, we don't limit our selves to that view. We think >>>> of a 'sub-routine' that might depend on code outside of itself as part >>>> of its execution, or ignore some of the information that a given >>>> invocation might depend on. Those models do NOT correspond to what >>>> Compution Theory describes as a Computation. >>>> >>>> Yes, there are LOTS of interesting things in these non-computation >>>> models, and that is an important part of THOSE theories. THey just are >>>> NOT part of Comptation Theory. >>>> >>>> One big reason Computaton Theory focuses on Turing Machines, is that by >>>> their structure, what they do is clearly what the Theory wants to talk >>>> about. We don't need to worry if the code uses something outside its >>>> defined bounds, as the limitations of how a Turing Machine is >>>> described, >>>> makes it impossible to create such a condition. >>>> >>>> On the other hand, the 'higher' computation modeles, like the >>>> conventional computer, can easily be made to do things that break these >>>> definitions, so you need to pay care to stay within the bounds. >>>> >>>> PO has this basic problem, the thing he wants to do CAN'T be done with >>>> Turing Machines, as the Halting Problem Proofs clearly show. He can't >>>> accept that this proof is valid. He thus is tryihg to create a program >>>> in a conventional computer to show that something like what the Halting >>>> Problem Proof says is impossible is possible on that platform. >>>> >>>> The key is that since a Turing Machine can't do it, neither can a >>>> conventional program that actual follows the rules of being the >>>> equivalent of a Computation. His basic goal is to try to find a way to >>>> make a program that LOOKS like it is a Computation, but actually isn't, >>>> that does what is impossible to do as a Computation. >>>> >>>> Either he needs to come up with a theory shattering example that shows >>>> that there IS an actual Computation that an x86 can do that doesn't >>>> have >>>> a Turing Machine Equivalent (and thus disprove Church-Turing) or he >>>> needs to be deceptive and hide is non-computational aspect of his >>>> program. >>>> >>>> All his work seems to be about the latter, and this is hampered by the >>>> fact that he seems to refuse to actually study the theory to any depth >>>> to actually understand what he is trying to do, so he keeps making >>>> primative errors. >>>> >>>> This comes out in his attempt to try and get approval to use a 'wrong >>>> definition' as the equivalent of the right one, like the Computer >>>> Science term of a 'Pure Function' to be fully the same as a >>>> 'Computation'. >>>> >>>> The key difference here is that the Computer Scientist is normally only >>>> concerned about a single copy of the function always giving the same >>>> input to output mapping, while the Computation Theorist wants ALL >>>> copies >>>> of the function to implement the same input to output mapping. >>>> >>> >>> I always glance at you posts to see if they are drivel or not. >>> This is the first one that is not drivel. >>> See my reply to Jeff on this. >>> >> >> I will admit that I don't always hit the mark of explaining thing in a >> way that your disturbed mind can understand. >> >> My comments have NOT be 'drivel' (at least for the most parts, I will >> admit to getting at times a bit snarky). >> >> They just don't make sense to your with your 'filter' on reality. >> >> See my response to your respeonce to him. >> > > When-so-ever you reject anything out-of-hand without any supporting > reasoning what-so-ever I just skip the whole rest of the post. Most of > your posts are like this. > So, you don't read rebuttals but just reject them out-of-hand without any supporting evidence. YOU are the one making a BIG claim. YOU need to prove it, and defend any and all objections to it. Please note, that if you ever do get to the point of submitting a paper on this to some reputable journal, it is quite possible that some review will search of discussions about this and find these conversations, and ANY argument that has been brought up, will be checked if reasonable by the classic theory, and then check that you have answered that point. You might as well make sure you can handle them now, as once you submit the paper, you won't really have the option to go back and change what you have previously written. How many times have you had to backup and redo core pieces because you finally got an understanding of something important?
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-30 21:35 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <BBt5J.79104$QzOf.31081@fx17.iad> |
| In reply to | #40136 |
On 9/30/21 7:21 PM, olcott wrote:
> On 9/30/2021 5:55 PM, André G. Isaak wrote:
>> On 2021-09-30 16:12, olcott wrote:
>>
>>> Because of a critique of my work in another forum I have discovered
>>> that the halt status that H1(P,P) reports is consistent with the
>>> behavior of int main() { P(P); }
>>
>> But how does this address the Linz proof then? You've derived your P
>> from H, not from H1. So all that matter with respect to the Linz proof
>> is what *H*(P, P) returns. That some other decider H1, from which P is
>> *not* derived, can correctly decide P(P) has no bearing on Linz's
>> claim. H1 cannot decide P1(P1) where P1 is derived from H1 in the same
>> way that P is derived from H.
>>
>
> H(P,P) is correct and H1(P,P) is correct.
So P(P) both Halts and doesn't?
Since the REAL Halting problem is that the decider needs to tell the
caller what it thinks the Computation, whose representation is given as
the deciders input, will do when actually run.
The Inputs are the same, so the Machines they represent are the same, so
they will do the exact same thing.
>
>> And your proposed 'best of three' test won't work either, since it
>> will be possible to derive a BestOfThree_Hat construction from your
>> BestOfThree routine which your BestOfThree routine won't be able to
>> decide.
>>
>> You don't seem to grasp that Linz is *not* claiming that there are
>> computations whose halting status cannot be decided.
>
> He is claiming that H does not exist:
> The contradiction tells us that our assumption
> of the existence of H, and hence the assumption
> of the decidability of the halting problem,
> must be false. (Linz 1990:320).
He claims that No H can exist that meets the requirements. And it can't
>
> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
> Not only does the Linz H exist it gets the correct answer and this
> answer is consistent with the behavior of Ĥ applied to ⟨Ĥ⟩>
No, your claimed H says that H^(<H^>) will not halt when it does.
Only your H1, which is NOT the computation that H^ was built on get the
right answer, but it is not the right computation to be H in Linz.
> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
> Lexington/Toronto: D. C. Heath and Company. (318-320)
>
>> He is claiming that there cannot be a *universal* halt decider because
>> for every purported halt decider one can construct a TM which that
>> specific halt decider cannot correctly decide.
>>
>> André
>>
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <news.x.richarddamon@xoxy.net> |
|---|---|
| Date | 2021-09-30 06:25 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description (V2) |
| Message-ID | <sj43ae$fks$1@dont-email.me> |
| In reply to | #40105 |
On 9/29/21 10:11 PM, olcott wrote: > On 9/29/2021 8:57 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2021 8:36 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/29/2021 5:48 PM, Ben Bacarisse wrote: >>>> >>>>>> You must deny what Linz says because you are not talking about halt >>>>>> deciders. You are trying to pretend that Linz was talking about >>>>>> deciders for your other problem: >>>>>> >>>>>> This definition of halting circumvents the pathological >>>>>> self-reference >>>>>> error for every simulating halt decider: >>>>>> An input is decided to be halting only if ... >>>>>> >>>>>> On that basis: >>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>>>>> >>>>>> You don't get to say what halting is. It is already >>>>>> well-defined. Any >>>>>> definition that provides a basis for H rejecting a computation >>>>>> that is >>>>>> finite is garbage. >>>>> >>>>> 1----2-----3-----4--5-----6 >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> (A) The Linz proof is about... >>>> ... halting. You've redefined "halting" so as to permit >>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>> >>> The question about (1) on (2) is not what Linz is referring to. >> >> It is when he refers to it, as he does in the annotation you keep >> removing. >> >>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>> >>> My H1(P,P) proves this: H(<Ĥ>,<Ĥ>) ⊢* H.qy >> >> So which is it, qy or qn? Where you wrong to redefine halting so that >> > > H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said > H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said > H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said > H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said > H(<Ĥ>,<Ĥ>) ⊢* H.qy as I just said If H(<H^>, <H^>) goes to H.qy then since H^ has a copy of it, it will go to H^.qy also, since two copies of the same computation will do the same thing., If this happens then H has said that H^(<H^>) is Halting but H^(<H^>) will go to the infinite loop that was attached to the H^.qy state. H is still wrong. You can't make the copies of H at H.q0 and H^.qx do diferernt things without making H not a computation. DEFINITION. FAIL. > >> "On that basis: >> Ĥ(<Ĥ>) ⊢* Ĥ.qn >> H(<Ĥ>,<Ĥ>) ⊢* H.qn" > > >
[toc] | [prev] | [next] | [standalone]
Page 3 of 17 — ← Prev page 1 2 [3] 4 5 … 17 Next page →
Back to top | Article view | comp.theory
csiph-web