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 14 of 17 — ← Prev page 1 … 12 13 [14] 15 16 17 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-20 22:56 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <SF4cJ.23$FiQc.14@fx17.iad> |
| In reply to | #40648 |
On 10/20/21 10:22 PM, olcott wrote:
> On 10/20/2021 8:40 PM, Richard Damon wrote:
>>
>> On 10/20/21 9:23 PM, olcott wrote:
>>> On 10/20/2021 8:10 PM, Richard Damon wrote:
>>>>
>>>> On 10/20/21 8:46 PM, olcott wrote:
>>>>> On 10/20/2021 7:35 PM, Richard Damon wrote:
>>>>>> On 10/20/21 8:23 PM, olcott wrote:
>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 10/19/2021 8:21 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 10/19/2021 11:55 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 10/18/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 10/17/2021 7:47 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> Quotes re-ordered for clarity...
>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> But you agree that
>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn
>>>>>>>>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> is (one half of) what Linz means by Ĥ, yes? (I don't
>>>>>>>>>>>>>>>>>> expect an
>>>>>>>>>>>>>>>>>> answer -- I expect you'll just repeat the waffle.)
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> No not at all, not in the least little bit
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> OK, so you are not using Ĥ to denote an exemplar of the
>>>>>>>>>>>>>>>> same class of
>>>>>>>>>>>>>>>> TMs that Linz does. If you were, you would have to
>>>>>>>>>>>>>>>> agree that Linz's
>>>>>>>>>>>>>>>> specification of when Ĥ transitions to qn is the correct
>>>>>>>>>>>>>>>> one.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Oh, and you need to apologise for some very deceptive
>>>>>>>>>>>>>>>> claims to the
>>>>>>>>>>>>>>>> contrary.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>
>>>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf page
>>>>>>>>>>>>> 319
>>>>>>>>>>>>>
>>>>>>>>>>>>> That you do not understand the most basic point that Linz
>>>>>>>>>>>>> has adapted
>>>>>>>>>>>>> TM H by prepending states and appending states such that
>>>>>>>>>>>>> the original
>>>>>>>>>>>>> H "not" path of H remains in the middle is a necessary
>>>>>>>>>>>>> prerequisite.
>>>>>>>>>>>> I'll leave it to others to decide which one of use us is
>>>>>>>>>>>> lacking basic
>>>>>>>>>>>> understanding.
>>>>>>>>>>>> Just stop dishonestly removing the key criterion given in
>>>>>>>>>>>> Linz, or admit
>>>>>>>>>>>> that you are not using this notation as Linz does.
>>>>>>>>>>>>
>>>>>>>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H
>>>>>>>>>>>> Linz says it better: if M applied to wM does not halt. Your
>>>>>>>>>>>> silly
>>>>>>>>>>>> phrase does not state what it is that H is saying "no" to.
>>>>>>>>>>>
>>>>>>>>>>> Linz is vague about the point in the execution trace that
>>>>>>>>>>> matters.
>>>>>>>>>> You replacement is useless. Linz's specification is clear.
>>>>>>>>>> Obviously
>>>>>>>>>> it does not way what you want, but it's not vague.
>>>>>>>>>>
>>>>>>>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H'
>>>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ
>>>>>>>>>>>>
>>>>>>>>>>>> Linz says it better: if Ĥ applied to wM does not halt.
>>>>>>>>>>>
>>>>>>>>>>> The only point in the execution trace that matters is where
>>>>>>>>>>> the halt
>>>>>>>>>>> decider makes its halting decision.
>>>>>>>>>> What matters is that if H is as specified in Linz, the
>>>>>>>>>> corresponding Ĥ
>>>>>>>>>> behaves as Linz says and you keep removing.
>>>>>>>>>>
>>>>>>>>>>>>> This leaves the "no" path of TM H at Linz Ĥq0
>>>>>>>>>>>>>
>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>>>>> And Linz says exactly when this transitions sequence occurs:
>>>>>>>>>>>> if Ĥ
>>>>>>>>>>>> applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>
>>>>>>>>>>> If he is referring to something besides the input to the halt
>>>>>>>>>>> decider
>>>>>>>>>>> then Linz is incorrect.
>>>>>>>>>> I am happy to explain "if Ĥ applied to wM does not halt" when
>>>>>>>>>> attached
>>>>>>>>>> to the line you keep leaving it off if you think it would
>>>>>>>>>> help. What is
>>>>>>>>>> it you don't understand?
>>>>>>>>>
>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ
>>>>>>>>> if M applied to Wm does not halt
>>>>>>>>>
>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because
>>>>>>>>> there
>>>>>>>>> is no halt decider at q0.
>>>>>>>>
>>>>>>>> This notation is hopeless in ASCII. Using the notation that has
>>>>>>>> evolved
>>>>>>>> in these threads (not my preferred one, but I don't want to
>>>>>>>> complicate
>>>>>>>> matters any more) Linz writes:
>>>>>>>>
>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2
>>>>>>>> if M applied to <M> does not halt.
>>>>>>>>
>>>>>>>> And with these changes in notation you seem to be saying
>>>>>>>>
>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because
>>>>>>>>> there
>>>>>>>>> is no halt decider at q0.
>>>>>>>>
>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly
>>>>>>>> referring to
>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should
>>>>>>>> transition to
>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input)
>>>>>>>> applied to
>>>>>>>> <M> (that exactly same string input) does not halt.
>>>>>>>>
>>>>>>>> Your next point helps explain how he comes to say this about Ĥ.
>>>>>>>>
>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the
>>>>>>>>> first
>>>>>>>>> <M> being applied to the machine description of the second <M>.
>>>>>>>>
>>>>>>>> The annotation dose not specifically refer to what this
>>>>>>>> sub-computation
>>>>>>>> does. It simply gives the condition under which Ĥ will
>>>>>>>> transition from
>>>>>>>> Ĥ.q0 to Ĥ.qn.
>>>>>>>>
>>>>>>>
>>>>>>> If a simulating halt decider H correctly determines that the
>>>>>>> simulation of its input <M> applied to <M> never reaches its
>>>>>>> final state whether or not this simulating halt decider aborts
>>>>>>> the simulation of this input then this simulating halt decider
>>>>>>> does correctly decide that this input never halts NO MATTER WHAT
>>>>>>> ELSE.
>>>>>>>
>>>>>>> NO MATTER WHAT ELSE.
>>>>>>
>>>>>> WRONG.
>>>>>>
>>>>>> It is NOT a question 'whether or not this simulating halt decider
>>>>>> aborts is simulation' as this isn't something that can change. The
>>>>>> Halt decider must have some definite programming and thus it will
>>>>>> either ALWAYS abort its simulation of this computation or it never
>>>>>> will.
>>>>>>
>>>>>
>>>>> If the input to a simulating halt decider never reaches its final
>>>>> state even if the halt decider never aborts its simulation then
>>>>> this input never halts and the halt decider can abort its
>>>>> simulation and report this.
>>>>>
>>>>>
>>>>
>>>> If the simulating halt decider never aborts its simulation (lets
>>>> call this Hn) and thus never reaches its halting state, then yes,
>>>> THAT computation (lets call it Hn^(<Hn^>) is non-halting, but the
>>>> halt decider never answered, so it failed to meet the requirements
>>>> of a Halt decider.
>>>>
>>>
>>> If it is the case that {IN THE HYPOTHETICAL SITUATION} that the
>>> input would never reach its final state if {IN THE HYPOTHETICAL
>>> SITUATION} the simulating halt decider would never abort this input
>>> {IN THIS HYPOTHETICAL SITUATION} then the halt decider correctly
>>> aborts its input and reports not halting.
>>>
>>
>> We don't need to talk hypothectical.
>>
> Yes we do. If the input to the halt decider is an infinite loop that
> would execute forever unless its simulation is aborted then the halt
> decider correctly aborts the simulation of this input and reports non
> halting.
No, we don't. If the Halt decider ACTUALLY IS non-aborting (and not just
presumed to be when it isn't) then we have methods to actually prove
that it is an infinite loop.
Now, since we have stipulated that it actually is non-aborting, H can't
change and abort and use that data, so this doesn't help us make a
working Halt Decider, just to determine by hand if it was right or not.
Note that since we aren't part of the algorithm of H, we are able to
determine things that H can't, because our actions aren't countered by H^.
Thus, we can prove that H was wrong.
You can't have a halt decider that does BOTH 'does not abort its
simulation' and at the same time 'does abort its simulation and return
its answer', this are contradictions.
THAT is the case of the statement "This Statement is False".
Thus, to create the H that does it is just as hard as getting the actual
True/False answer that is correct for the truth of the statement: "This
Statement is False."
You make that false assumption that H actually exists (as a correctly
answering Halt Decider), and that leads you to all sorts of contradictions.
No H, that meets the requirements to be a Halt Decider per Computation
Theory, can give the right answer to the H^ built by Linz's template
when applied to its own representation. PERIOD.
>
> It is the same for H(P,P).
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-20 22:00 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <hbadnfX-CKl2Su38nZ2dnUU7-SGdnZ2d@giganews.com> |
| In reply to | #40649 |
On 10/20/2021 9:56 PM, Richard Damon wrote:
> On 10/20/21 10:22 PM, olcott wrote:
>> On 10/20/2021 8:40 PM, Richard Damon wrote:
>>>
>>> On 10/20/21 9:23 PM, olcott wrote:
>>>> On 10/20/2021 8:10 PM, Richard Damon wrote:
>>>>>
>>>>> On 10/20/21 8:46 PM, olcott wrote:
>>>>>> On 10/20/2021 7:35 PM, Richard Damon wrote:
>>>>>>> On 10/20/21 8:23 PM, olcott wrote:
>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 10/19/2021 8:21 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 10/19/2021 11:55 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 10/18/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 10/17/2021 7:47 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>>> Quotes re-ordered for clarity...
>>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> But you agree that
>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn
>>>>>>>>>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not
>>>>>>>>>>>>>>>>>>> halt.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> is (one half of) what Linz means by Ĥ, yes? (I don't
>>>>>>>>>>>>>>>>>>> expect an
>>>>>>>>>>>>>>>>>>> answer -- I expect you'll just repeat the waffle.)
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> No not at all, not in the least little bit
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> OK, so you are not using Ĥ to denote an exemplar of the
>>>>>>>>>>>>>>>>> same class of
>>>>>>>>>>>>>>>>> TMs that Linz does. If you were, you would have to
>>>>>>>>>>>>>>>>> agree that Linz's
>>>>>>>>>>>>>>>>> specification of when Ĥ transitions to qn is the
>>>>>>>>>>>>>>>>> correct one.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Oh, and you need to apologise for some very deceptive
>>>>>>>>>>>>>>>>> claims to the
>>>>>>>>>>>>>>>>> contrary.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>>>>>>>>>> page 319
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> That you do not understand the most basic point that Linz
>>>>>>>>>>>>>> has adapted
>>>>>>>>>>>>>> TM H by prepending states and appending states such that
>>>>>>>>>>>>>> the original
>>>>>>>>>>>>>> H "not" path of H remains in the middle is a necessary
>>>>>>>>>>>>>> prerequisite.
>>>>>>>>>>>>> I'll leave it to others to decide which one of use us is
>>>>>>>>>>>>> lacking basic
>>>>>>>>>>>>> understanding.
>>>>>>>>>>>>> Just stop dishonestly removing the key criterion given in
>>>>>>>>>>>>> Linz, or admit
>>>>>>>>>>>>> that you are not using this notation as Linz does.
>>>>>>>>>>>>>
>>>>>>>>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H
>>>>>>>>>>>>> Linz says it better: if M applied to wM does not halt.
>>>>>>>>>>>>> Your silly
>>>>>>>>>>>>> phrase does not state what it is that H is saying "no" to.
>>>>>>>>>>>>
>>>>>>>>>>>> Linz is vague about the point in the execution trace that
>>>>>>>>>>>> matters.
>>>>>>>>>>> You replacement is useless. Linz's specification is clear.
>>>>>>>>>>> Obviously
>>>>>>>>>>> it does not way what you want, but it's not vague.
>>>>>>>>>>>
>>>>>>>>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H'
>>>>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ
>>>>>>>>>>>>>
>>>>>>>>>>>>> Linz says it better: if Ĥ applied to wM does not halt.
>>>>>>>>>>>>
>>>>>>>>>>>> The only point in the execution trace that matters is where
>>>>>>>>>>>> the halt
>>>>>>>>>>>> decider makes its halting decision.
>>>>>>>>>>> What matters is that if H is as specified in Linz, the
>>>>>>>>>>> corresponding Ĥ
>>>>>>>>>>> behaves as Linz says and you keep removing.
>>>>>>>>>>>
>>>>>>>>>>>>>> This leaves the "no" path of TM H at Linz Ĥq0
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>>>>>> And Linz says exactly when this transitions sequence
>>>>>>>>>>>>> occurs: if Ĥ
>>>>>>>>>>>>> applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>
>>>>>>>>>>>> If he is referring to something besides the input to the
>>>>>>>>>>>> halt decider
>>>>>>>>>>>> then Linz is incorrect.
>>>>>>>>>>> I am happy to explain "if Ĥ applied to wM does not halt" when
>>>>>>>>>>> attached
>>>>>>>>>>> to the line you keep leaving it off if you think it would
>>>>>>>>>>> help. What is
>>>>>>>>>>> it you don't understand?
>>>>>>>>>>
>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ
>>>>>>>>>> if M applied to Wm does not halt
>>>>>>>>>>
>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because
>>>>>>>>>> there
>>>>>>>>>> is no halt decider at q0.
>>>>>>>>>
>>>>>>>>> This notation is hopeless in ASCII. Using the notation that
>>>>>>>>> has evolved
>>>>>>>>> in these threads (not my preferred one, but I don't want to
>>>>>>>>> complicate
>>>>>>>>> matters any more) Linz writes:
>>>>>>>>>
>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2
>>>>>>>>> if M applied to <M> does not halt.
>>>>>>>>>
>>>>>>>>> And with these changes in notation you seem to be saying
>>>>>>>>>
>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because
>>>>>>>>>> there
>>>>>>>>>> is no halt decider at q0.
>>>>>>>>>
>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly
>>>>>>>>> referring to
>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should
>>>>>>>>> transition to
>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input)
>>>>>>>>> applied to
>>>>>>>>> <M> (that exactly same string input) does not halt.
>>>>>>>>>
>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ.
>>>>>>>>>
>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the
>>>>>>>>>> first
>>>>>>>>>> <M> being applied to the machine description of the second <M>.
>>>>>>>>>
>>>>>>>>> The annotation dose not specifically refer to what this
>>>>>>>>> sub-computation
>>>>>>>>> does. It simply gives the condition under which Ĥ will
>>>>>>>>> transition from
>>>>>>>>> Ĥ.q0 to Ĥ.qn.
>>>>>>>>>
>>>>>>>>
>>>>>>>> If a simulating halt decider H correctly determines that the
>>>>>>>> simulation of its input <M> applied to <M> never reaches its
>>>>>>>> final state whether or not this simulating halt decider aborts
>>>>>>>> the simulation of this input then this simulating halt decider
>>>>>>>> does correctly decide that this input never halts NO MATTER WHAT
>>>>>>>> ELSE.
>>>>>>>>
>>>>>>>> NO MATTER WHAT ELSE.
>>>>>>>
>>>>>>> WRONG.
>>>>>>>
>>>>>>> It is NOT a question 'whether or not this simulating halt decider
>>>>>>> aborts is simulation' as this isn't something that can change.
>>>>>>> The Halt decider must have some definite programming and thus it
>>>>>>> will either ALWAYS abort its simulation of this computation or it
>>>>>>> never will.
>>>>>>>
>>>>>>
>>>>>> If the input to a simulating halt decider never reaches its final
>>>>>> state even if the halt decider never aborts its simulation then
>>>>>> this input never halts and the halt decider can abort its
>>>>>> simulation and report this.
>>>>>>
>>>>>>
>>>>>
>>>>> If the simulating halt decider never aborts its simulation (lets
>>>>> call this Hn) and thus never reaches its halting state, then yes,
>>>>> THAT computation (lets call it Hn^(<Hn^>) is non-halting, but the
>>>>> halt decider never answered, so it failed to meet the requirements
>>>>> of a Halt decider.
>>>>>
>>>>
>>>> If it is the case that {IN THE HYPOTHETICAL SITUATION} that the
>>>> input would never reach its final state if {IN THE HYPOTHETICAL
>>>> SITUATION} the simulating halt decider would never abort this input
>>>> {IN THIS HYPOTHETICAL SITUATION} then the halt decider correctly
>>>> aborts its input and reports not halting.
>>>>
>>>
>>> We don't need to talk hypothectical.
>>>
>> Yes we do. If the input to the halt decider is an infinite loop that
>> would execute forever unless its simulation is aborted then the halt
>> decider correctly aborts the simulation of this input and reports non
>> halting.
>
> No, we don't. If the Halt decider ACTUALLY IS non-aborting (and not just
> presumed to be when it isn't) then we have methods to actually prove
> that it is an infinite loop.
>
Yes when the halt deciding basis that the simulation matches an infinite
execution pattern then aborting is mandatory.
> Now, since we have stipulated that it actually is non-aborting, H can't
> change and abort and use that data, so this doesn't help us make a
> working Halt Decider, just to determine by hand if it was right or not.
>
> Note that since we aren't part of the algorithm of H, we are able to
> determine things that H can't, because our actions aren't countered by H^.
>
> Thus, we can prove that H was wrong.
>
> You can't have a halt decider that does BOTH 'does not abort its
> simulation' and at the same time 'does abort its simulation and return
> its answer', this are contradictions.
>
> THAT is the case of the statement "This Statement is False".
>
> Thus, to create the H that does it is just as hard as getting the actual
> True/False answer that is correct for the truth of the statement: "This
> Statement is False."
>
> You make that false assumption that H actually exists (as a correctly
> answering Halt Decider), and that leads you to all sorts of contradictions.
>
> No H, that meets the requirements to be a Halt Decider per Computation
> Theory, can give the right answer to the H^ built by Linz's template
> when applied to its own representation. PERIOD.
>
>>
>> It is the same for H(P,P).
>>
>
--
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-20 23:36 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <9f5cJ.24758$QA4.812@fx37.iad> |
| In reply to | #40650 |
On 10/20/21 11:00 PM, olcott wrote: > On 10/20/2021 9:56 PM, Richard Damon wrote: >> On 10/20/21 10:22 PM, olcott wrote: >>> On 10/20/2021 8:40 PM, Richard Damon wrote: >>>> We don't need to talk hypothectical. >>>> >>> Yes we do. If the input to the halt decider is an infinite loop that >>> would execute forever unless its simulation is aborted then the halt >>> decider correctly aborts the simulation of this input and reports non >>> halting. >> >> No, we don't. If the Halt decider ACTUALLY IS non-aborting (and not >> just presumed to be when it isn't) then we have methods to actually >> prove that it is an infinite loop. >> > > Yes when the halt deciding basis that the simulation matches an infinite > execution pattern then aborting is mandatory. But to be right, so is getting the right answer. That also means assuming that the copy of it inside the computation we are analysing doesn't abort is an INCORRECT assumption. When H sees a copy of itself, it can either get itself stuck in an infinite loop (and fail) or it needs to stop that simulation at some point and SOMEHOW figure out what answer that copy of H will return without just simulating to get there. That is the big problem. It needs the answer that it can't just simulate to get to. This shows that naive simulation is NOT the answer. Yes, you can add patterns to detect many of the infinite executions, but this will NEVER be good enough, as H^ will never match one of them, as if you do put in a pattern that your simulation of H^(<H^>) matches, then H will abort it, return non-halting, and H^ will halt, thus showing that the pattern is NOT necessarily non-halting. The claim that there has to be a pattern to use as the problem needs to be solvable is NOT correct, as there doesn't need to be a way to solve the problem, it is perfectly an acceptable condition that H just can't give the right answer. It turns out that ANY finite set of rules to use to decide on will always be wrong and either incorrectly halt and think it is non-halting when it is halting, or (if you add know to halt rules) incorrectly halt and say you know this will halt in the future, and it will turn out to be non-halting, or the decider just ends up running forever and never halts at all. This all PROVES (with a little bit more logic past this point) that in Computation Theory, there DO exists some Computations that we can not prove if they Halt or Not, but we also know that it is True that they Either Halt or Not, so there are some Truths that are not Provable. What this shows is that the logic of Mathematics is not compatible with your 'precious' concept that all Truth is Provable. A logic system with that definition, can not develop the fullness of Mathematics, but needs to SIGNIFICANTLY limit its scope of what it can describe. Any attempt to try to build to the fullness of Mathematics is doomed to collapse in a pile of inconsistency or reach a barrier it just can't cross. This was settled nearly a Century ago, and Mathematitions accept it now. You are of course free to disagree, and work on the problem, and there is a base of logical system that do restrict themselves to the concept that all Truth must be provable. You WILL find that you reach the walls described, and will NOT be able to get to anywhere near the fullness of Mathematics, in fact, you can't even get the full properties of the Natural Numbers, as Godel has proved. Note, your arguement that Godel is wrong is incorrect, as by saying that the statement isn't a Truth also is saying that other properties shown to exist in the Natural Numbers can not be expressed in your system, and thus your system fails to describe all of the properties of the Natural Numbers. Mathematitions, although they would love it if everything was provable, more perfer to be able to talk about all the properties of the system they are working with, so work under a different set of rules, and accept that not everything that is True will be provable.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-21 02:37 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <87h7db6tv9.fsf@bsb.me.uk> |
| In reply to | #40638 |
olcott <NoOne@NoWhere.com> writes: > On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/19/2021 8:21 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/19/2021 11:55 AM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/18/2021 5:59 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 10/17/2021 7:47 PM, Ben Bacarisse wrote: >>>>>>>>>> Quotes re-ordered for clarity... >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote: >>>>>>>>>>>> >>>>>>>>>>>> But you agree that >>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn >>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>>>>>>>> >>>>>>>>>>>> is (one half of) what Linz means by Ĥ, yes? (I don't expect an >>>>>>>>>>>> answer -- I expect you'll just repeat the waffle.) >>>>>>>>>>> >>>>>>>>>>> No not at all, not in the least little bit >>>>>>>>>> >>>>>>>>>> OK, so you are not using Ĥ to denote an exemplar of the same class of >>>>>>>>>> TMs that Linz does. If you were, you would have to agree that Linz's >>>>>>>>>> specification of when Ĥ transitions to qn is the correct one. >>>>>>>>>> >>>>>>>>>> Oh, and you need to apologise for some very deceptive claims to the >>>>>>>>>> contrary. >>>>>>>>> >>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>>> >>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf page 319 >>>>>>> >>>>>>> That you do not understand the most basic point that Linz has adapted >>>>>>> TM H by prepending states and appending states such that the original >>>>>>> H "not" path of H remains in the middle is a necessary prerequisite. >>>>>> I'll leave it to others to decide which one of use us is lacking basic >>>>>> understanding. >>>>>> Just stop dishonestly removing the key criterion given in Linz, or admit >>>>>> that you are not using this notation as Linz does. >>>>>> >>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H >>>>>> Linz says it better: if M applied to wM does not halt. Your silly >>>>>> phrase does not state what it is that H is saying "no" to. >>>>> >>>>> Linz is vague about the point in the execution trace that matters. >>>> You replacement is useless. Linz's specification is clear. Obviously >>>> it does not way what you want, but it's not vague. >>>> >>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H' >>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>> >>>>>> Linz says it better: if Ĥ applied to wM does not halt. >>>>> >>>>> The only point in the execution trace that matters is where the halt >>>>> decider makes its halting decision. >>>> What matters is that if H is as specified in Linz, the corresponding Ĥ >>>> behaves as Linz says and you keep removing. >>>> >>>>>>> This leaves the "no" path of TM H at Linz Ĥq0 >>>>>>> >>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>> And Linz says exactly when this transitions sequence occurs: if Ĥ >>>>>> applied to ⟨Ĥ⟩ does not halt. >>>>> >>>>> If he is referring to something besides the input to the halt decider >>>>> then Linz is incorrect. >>>> I am happy to explain "if Ĥ applied to wM does not halt" when attached >>>> to the line you keep leaving it off if you think it would help. What is >>>> it you don't understand? >>> >>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>> if M applied to Wm does not halt >>> >>> Linz cannot be correctly referring to q0 applied to Wm because there >>> is no halt decider at q0. >> This notation is hopeless in ASCII. Using the notation that has evolved >> in these threads (not my preferred one, but I don't want to complicate >> matters any more) Linz writes: >> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >> if M applied to <M> does not halt. >> And with these changes in notation you seem to be saying >> >>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>> is no halt decider at q0. >> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >> <M> (that exactly same string input) does not halt. >> Your next point helps explain how he comes to say this about Ĥ. >> >>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>> <M> being applied to the machine description of the second <M>. >> >> The annotation dose not specifically refer to what this sub-computation >> does. It simply gives the condition under which Ĥ will transition from >> Ĥ.q0 to Ĥ.qn. > > If a simulating halt decider H correctly determines that the > simulation of its input <M> applied to <M> never reaches its final > state whether or not this simulating halt decider aborts the > simulation of this input then this simulating halt decider does > correctly decide that this input never halts NO MATTER WHAT ELSE. This is not what Linz is saying. If I can help with any further explanation, I'm happy to have a go but you need to stop repeating what you are saying and try to focus on what Linz is saying. Once you get what he is saying you will see that you can say anything you like about a subclass (those that "simulate") of the empty class of TMs (the halt deciders) that Linz is talking about. Atatements about no TMs are vacuously true (or irrelevant -- take your pick). > Anything and everything that is not input to this halt decider is 100% > totally irrelevant. Technically, there is no halt decider in the TM you are talking about, but that's a detail and you don't do details. Did you follow what I wrote about how the string input to the almost-decider at Ĥ.qx is entirely why Linz's annotation is correct? Here it is: >> But you are correct in that the annotation /derives/ from what we know >> about the modified copy of H embedded at Ĥ.qx. We know that >> H.q0 <M> s ⊢* y1 H.qn y2 >> if M applied to s does not halt. >> and since the TM at Ĥ.qx is (in this regard at least) exactly like H we >> know that >> Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >> if M applied to <M> does not halt. >> Now, because >> Ĥ.q0 s ⊢* Ĥ.qx s s >> for /any/ string s, we know, specifically, that >> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >> if M applied to <M> does not halt. >> Can you now see where this correctly annotated line comes from? Can I >> explain any part of this some other way to make it clearer? I suspect you simply didn't read it since I am agreeing with you about the central role of the Ĥ.qx <M> <M> part in explaining why Linz is correct. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-20 21:18 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <5aOdnb7RJsdqUO38nZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #40645 |
On 10/20/2021 8:37 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/19/2021 8:21 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/19/2021 11:55 AM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/18/2021 5:59 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> On 10/17/2021 7:47 PM, Ben Bacarisse wrote: >>>>>>>>>>> Quotes re-ordered for clarity... >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>> On 10/17/2021 10:03 AM, Ben Bacarisse wrote: >>>>>>>>>>>>> >>>>>>>>>>>>> But you agree that >>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊦ Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊦ Ĥ.qn >>>>>>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>>>>>>>>> >>>>>>>>>>>>> is (one half of) what Linz means by Ĥ, yes? (I don't expect an >>>>>>>>>>>>> answer -- I expect you'll just repeat the waffle.) >>>>>>>>>>>> >>>>>>>>>>>> No not at all, not in the least little bit >>>>>>>>>>> >>>>>>>>>>> OK, so you are not using Ĥ to denote an exemplar of the same class of >>>>>>>>>>> TMs that Linz does. If you were, you would have to agree that Linz's >>>>>>>>>>> specification of when Ĥ transitions to qn is the correct one. >>>>>>>>>>> >>>>>>>>>>> Oh, and you need to apologise for some very deceptive claims to the >>>>>>>>>>> contrary. >>>>>>>>>> >>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>>> if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>>>> >>>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf page 319 >>>>>>>> >>>>>>>> That you do not understand the most basic point that Linz has adapted >>>>>>>> TM H by prepending states and appending states such that the original >>>>>>>> H "not" path of H remains in the middle is a necessary prerequisite. >>>>>>> I'll leave it to others to decide which one of use us is lacking basic >>>>>>> understanding. >>>>>>> Just stop dishonestly removing the key criterion given in Linz, or admit >>>>>>> that you are not using this notation as Linz does. >>>>>>> >>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H >>>>>>> Linz says it better: if M applied to wM does not halt. Your silly >>>>>>> phrase does not state what it is that H is saying "no" to. >>>>>> >>>>>> Linz is vague about the point in the execution trace that matters. >>>>> You replacement is useless. Linz's specification is clear. Obviously >>>>> it does not way what you want, but it's not vague. >>>>> >>>>>>>> q0 Wm Wm ⊢* y1 qn y2 / The "no" path of TM H' >>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>> >>>>>>> Linz says it better: if Ĥ applied to wM does not halt. >>>>>> >>>>>> The only point in the execution trace that matters is where the halt >>>>>> decider makes its halting decision. >>>>> What matters is that if H is as specified in Linz, the corresponding Ĥ >>>>> behaves as Linz says and you keep removing. >>>>> >>>>>>>> This leaves the "no" path of TM H at Linz Ĥq0 >>>>>>>> >>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>> And Linz says exactly when this transitions sequence occurs: if Ĥ >>>>>>> applied to ⟨Ĥ⟩ does not halt. >>>>>> >>>>>> If he is referring to something besides the input to the halt decider >>>>>> then Linz is incorrect. >>>>> I am happy to explain "if Ĥ applied to wM does not halt" when attached >>>>> to the line you keep leaving it off if you think it would help. What is >>>>> it you don't understand? >>>> >>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>> if M applied to Wm does not halt >>>> >>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>> is no halt decider at q0. >>> This notation is hopeless in ASCII. Using the notation that has evolved >>> in these threads (not my preferred one, but I don't want to complicate >>> matters any more) Linz writes: >>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>> if M applied to <M> does not halt. >>> And with these changes in notation you seem to be saying >>> >>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>> is no halt decider at q0. >>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>> <M> (that exactly same string input) does not halt. >>> Your next point helps explain how he comes to say this about Ĥ. >>> >>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>> <M> being applied to the machine description of the second <M>. >>> >>> The annotation dose not specifically refer to what this sub-computation >>> does. It simply gives the condition under which Ĥ will transition from >>> Ĥ.q0 to Ĥ.qn. >> >> If a simulating halt decider H correctly determines that the >> simulation of its input <M> applied to <M> never reaches its final >> state whether or not this simulating halt decider aborts the >> simulation of this input then this simulating halt decider does >> correctly decide that this input never halts NO MATTER WHAT ELSE. > > This is not what Linz is saying. Of course this is not what Linz is saying. Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> would not correctly transition to H.qn. > If I can help with any further > explanation, I'm happy to have a go but you need to stop repeating what > you are saying and try to focus on what Linz is saying. Once you get > what he is saying you will see that you can say anything you like about > a subclass (those that "simulate") of the empty class of TMs (the halt > deciders) that Linz is talking about. Atatements about no TMs are > vacuously true (or irrelevant -- take your pick). > >> Anything and everything that is not input to this halt decider is 100% >> totally irrelevant. > > Technically, there is no halt decider in the TM you are talking about, > but that's a detail and you don't do details. Did you follow what I > wrote about how the string input to the almost-decider at Ĥ.qx is > entirely why Linz's annotation is correct? Here it is: > >>> But you are correct in that the annotation /derives/ from what we know >>> about the modified copy of H embedded at Ĥ.qx. We know that >>> H.q0 <M> s ⊢* y1 H.qn y2 >>> if M applied to s does not halt. >>> and since the TM at Ĥ.qx is (in this regard at least) exactly like H we >>> know that >>> Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>> if M applied to <M> does not halt. >>> Now, because >>> Ĥ.q0 s ⊢* Ĥ.qx s s >>> for /any/ string s, we know, specifically, that >>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>> if M applied to <M> does not halt. >>> Can you now see where this correctly annotated line comes from? Can I >>> explain any part of this some other way to make it clearer? > > I suspect you simply didn't read it since I am agreeing with you about > the central role of the Ĥ.qx <M> <M> part in explaining why Linz is > correct. > So you are agreeing that when Ĥ.qx simulates <Ĥ> applied to <Ĥ> and correctly determines that the simulated <Ĥ> never reaches its final state (whether or not Ĥ.qx stops simulating <Ĥ>) then Ĥ.qx correctly aborts this simulation and transitions to qn ??? If we have to go over this same point thousands of times I will. This one point proves that I have shown how to defeat the halting theorem. Let's standardize on this notation so that new people will be able to more easily see how it relates to the Linz text. ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩ would never reach its final state whether or not this simulation is aborted. // Adapted from bottom of page 319 (definition of Ĥ) q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf All dialogue must be either agreeing with the above or pointing out errors in the above. Changing the subject will generally be ignored except that it will be pointed out as a dishonest dodge away from the point. -- 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-20 23:05 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <kO4cJ.167$Fm6.1@fx15.iad> |
| In reply to | #40647 |
On 10/20/21 10:18 PM, olcott wrote: > > Of course this is not what Linz is saying. Linz is still under the > misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> would not correctly > transition to H.qn. H^ has no 'correct' or 'incorrect' actions. H^ does what it does, so the only thing close to correctness is doing what it is defined to do, that is the opposite of what H decides, so H^(<P>) will use a copy of H to compute H(<P>,<P>) and if this goes to H.qn it halts and if it goes to H.qy it loops forever. It is H that has correct and incorrect results. H(<P>,I) needs to transition to qy if P(I) will halt, and transition to qn if P(I) will never halt. When P := H^ and I := <H^> then H(<P>,I) is H(<H^>,<H^>) which your claim is that this goes to qn as you say <H^>,<H^> represents a non-halting computation. But <H^>,<H^> is ther representation of H^(<H^>) which from above will compute H(<H^>,<H^>) which from above goes to H.qn in H which maps to H^.qn also, and H^ is defined to Halt in that state. Thus H^(<H^>) is shown to be a Halting computation for this definition of H, and thus this H is shown to be wrong.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-21 10:45 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <87bl3i7lu4.fsf@bsb.me.uk> |
| In reply to | #40647 |
olcott <NoOne@NoWhere.com> writes: > On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>> if M applied to Wm does not halt >>>>> >>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>> is no halt decider at q0. >>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>> in these threads (not my preferred one, but I don't want to complicate >>>> matters any more) Linz writes: >>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>> if M applied to <M> does not halt. >>>> And with these changes in notation you seem to be saying >>>> >>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>> is no halt decider at q0. >>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>> <M> (that exactly same string input) does not halt. >>>> Your next point helps explain how he comes to say this about Ĥ. >>>> >>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>> <M> being applied to the machine description of the second <M>. >>>> >>>> The annotation dose not specifically refer to what this sub-computation >>>> does. It simply gives the condition under which Ĥ will transition from >>>> Ĥ.q0 to Ĥ.qn. >>> >>> If a simulating halt decider H correctly determines that the >>> simulation of its input <M> applied to <M> never reaches its final >>> state whether or not this simulating halt decider aborts the >>> simulation of this input then this simulating halt decider does >>> correctly decide that this input never halts NO MATTER WHAT ELSE. >> This is not what Linz is saying. > > Of course this is not what Linz is saying. But until you understand what he is saying, you can't see why you are wrong. The result is that you will continue state things that will be either vacuously true or irrelevant because they refer to an empty class of TMs. Being correct about no Turing machines is just silly. If you want to define your own class of TMs that decide something a bit like halting, go ahead. Such a class may not be empty and your statements about when the "hat" version will or will not transitions to qn can be intelligently discussed (but /don't/ call that class H unless you intend to deliberately confuse your readers). If you continue to insist that your are using Ĥ to refer to the same class of modified deciders that Linz does, you have to accept his definitions and you have to understand the consequences of them. > Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> > would not correctly transition to H.qn. No he is not. He is stating the conditions under which the transition sequence you keep writing occurs. These follow from the definition of Ĥ. You need to understand them if you don't want to keep wasting your time. >> If I can help with any further >> explanation, I'm happy to have a go but you need to stop repeating what >> you are saying and try to focus on what Linz is saying. Once you get >> what he is saying you will see that you can say anything you like about >> a subclass (those that "simulate") of the empty class of TMs (the halt >> deciders) that Linz is talking about. Atatements about no TMs are >> vacuously true (or irrelevant -- take your pick). >> >>> Anything and everything that is not input to this halt decider is 100% >>> totally irrelevant. >> Technically, there is no halt decider in the TM you are talking about, >> but that's a detail and you don't do details. Did you follow what I >> wrote about how the string input to the almost-decider at Ĥ.qx is >> entirely why Linz's annotation is correct? Here it is: >> >>>> But you are correct in that the annotation /derives/ from what we know >>>> about the modified copy of H embedded at Ĥ.qx. We know that >>>> H.q0 <M> s ⊢* y1 H.qn y2 >>>> if M applied to s does not halt. >>>> and since the TM at Ĥ.qx is (in this regard at least) exactly like H we >>>> know that >>>> Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>> if M applied to <M> does not halt. >>>> Now, because >>>> Ĥ.q0 s ⊢* Ĥ.qx s s >>>> for /any/ string s, we know, specifically, that >>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>> if M applied to <M> does not halt. >>>> Can you now see where this correctly annotated line comes from? Can I >>>> explain any part of this some other way to make it clearer? I am wondering if you really read this. In many years of teaching this material I never came across someone who didn't get it, but I suspect you are deliberately trying not to. >> I suspect you simply didn't read it since I am agreeing with you about >> the central role of the Ĥ.qx <M> <M> part in explaining why Linz is >> correct. > > So you are agreeing that when Ĥ.qx simulates <Ĥ> applied to <Ĥ> and > correctly determines that the simulated <Ĥ> never reaches its final > state (whether or not Ĥ.qx stops simulating <Ĥ>) then Ĥ.qx correctly > aborts this simulation and transitions to qn ??? Any statement about no Turing machines is vacuously true because I am taking you at your word, that you use Ĥ to mean what Linz does: a class of TMs that are trivial modifications of machines that do this: H.q0 <M> s ⊢* x1 H.qy x2 if M applied to s halts, and H.q0 <M> s ⊢* y1 H.qn y2 if M applied to s does not halt. You don't like the consequences of that, but you can't just make those consequences go away by stating more things about these non-existent machines. If, however, your often repeated waffle about simulation is intended to define a different, non-empty, class of Turing machines, you need to start there. Give it a name, J, say, and tell us what goes in the ... parts of the specification: J.q0 <M> s ⊢* x1 J.qy x2 if M ... J.q0 <M> s ⊢* y1 J.qn y2 if M ... > If we have to go over this same point thousands of times I will. Sure. You can repeat what you say about no Turing machines as often as you like, but if you repeat the line Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 I will keep adding the key condition under which this is defined to occur: if M applied to <M> does not halt. > Let's standardize on this notation so that new people will > be able to more easily see how it relates to the Linz text. > ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. > > The machine at Ĥq0 Why change the name? You've been calling this state qx for years. At least I think that's what you mean by Ĥq0. (If you mean the machine at Ĥ.q0 then that's just called Ĥ.) > transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied > to ⟨Ĥ⟩ would never reach its final state whether or not this > simulation is aborted. The machine at Ĥ.qx transitions to Ĥ.qn if, and only if, Ĥ applied to <Ĥ> does not halt: Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 if M applied to <M> does not halt. This follows from Linz's definitions and shows that no such TM can exist. You can't make such a machine exist my saying more things about it or about some special kinds of these non-existent machines. Nothing you have said alters the fact that, for Linz-defined H, the Ĥ version does this: Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 if (and only if) M applied to <M> does not halt. I know you don't get why this is the case, but unless you switch into student mode and start reading what I say and asking intelligent questions about the parts you don't think are right, I can't help. > // Adapted from bottom of page 319 (definition of Ĥ) > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >> > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > > All dialogue must be either agreeing with the above or pointing out > errors in the above. If your "adapted" condition means the same as Linz's, just keep Linz's condition since it shows so clearly why no such TM can exist. If your "adapted" condition means something else, then come clean: give the class of TMs you are talking about a new name and lets talk about them. Start by defining what the non-hat TMs do: J.q0 <M> s ⊢* x1 J.qy x2 if M ... J.q0 <M> s ⊢* y1 J.qn y2 if M ... and from that we can talk about what Ĵ.q0 <M> and Ĵ.qx <M> <M> do. > Changing the subject will generally be ignored except that it will be > pointed out as a dishonest dodge away from the point. The subject (as far as I am concerned) is why you are wrong to remove or change a key part of Linz's specification. I have no interest in any waffle about what a special sub-class of non-existent TMs might or might not do. Every time you miss out the key line, I will point that out (unless I get tired of doing it). Alternatively we could discuss some non-empty class of TMs, but you'd have to define what they do first. You can't (honestly) use Linz's H and Ĥ and pretend his conditions don't apply. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-21 09:04 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <kPudnRhQCMvy7uz8nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #40656 |
On 10/21/2021 4:45 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: > >>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>> if M applied to Wm does not halt >>>>>> >>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>> is no halt decider at q0. >>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>> in these threads (not my preferred one, but I don't want to complicate >>>>> matters any more) Linz writes: >>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>> if M applied to <M> does not halt. >>>>> And with these changes in notation you seem to be saying >>>>> >>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>> is no halt decider at q0. >>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>> <M> (that exactly same string input) does not halt. >>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>> >>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>> <M> being applied to the machine description of the second <M>. >>>>> >>>>> The annotation dose not specifically refer to what this sub-computation >>>>> does. It simply gives the condition under which Ĥ will transition from >>>>> Ĥ.q0 to Ĥ.qn. >>>> >>>> If a simulating halt decider H correctly determines that the >>>> simulation of its input <M> applied to <M> never reaches its final >>>> state whether or not this simulating halt decider aborts the >>>> simulation of this input then this simulating halt decider does >>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>> This is not what Linz is saying. >> >> Of course this is not what Linz is saying. > > But until you understand what he is saying, you can't see why you are > wrong. That Linz did not consider a simulating halt decider does not make me wrong. If any of this was wrong someone could point out an actual error: The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩ would never reach its final state whether or not this simulation is aborted. Adapted from bottom of page 319 (definition of Ĥ) ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > The result is that you will continue state things that will be > either vacuously true or irrelevant because they refer to an empty class > of TMs. Being correct about no Turing machines is just silly. > > If you want to define your own class of TMs that decide something a bit > like halting, go ahead. Such a class may not be empty and your > statements about when the "hat" version will or will not transitions to > qn can be intelligently discussed (but /don't/ call that class H unless > you intend to deliberately confuse your readers). > > If you continue to insist that your are using Ĥ to refer to the same > class of modified deciders that Linz does, you have to accept his > definitions and you have to understand the consequences of them. > >> Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> >> would not correctly transition to H.qn. > > No he is not. He is stating the conditions under which the transition > sequence you keep writing occurs. These follow from the definition of > Ĥ. You need to understand them if you don't want to keep wasting your > time. > Because Linz ignores the idea of a simulating halt decider he cannot see that ⟨Ĥ⟩ ⟨Ĥ⟩ presents infinitely nested simulation to ⟨Ĥ⟩ ⟨Ĥ⟩: q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>> If I can help with any further >>> explanation, I'm happy to have a go but you need to stop repeating what >>> you are saying and try to focus on what Linz is saying. Once you get >>> what he is saying you will see that you can say anything you like about >>> a subclass (those that "simulate") of the empty class of TMs (the halt >>> deciders) that Linz is talking about. Atatements about no TMs are >>> vacuously true (or irrelevant -- take your pick). >>> >>>> Anything and everything that is not input to this halt decider is 100% >>>> totally irrelevant. >>> Technically, there is no halt decider in the TM you are talking about, >>> but that's a detail and you don't do details. Did you follow what I >>> wrote about how the string input to the almost-decider at Ĥ.qx is >>> entirely why Linz's annotation is correct? Here it is: >>> >>>>> But you are correct in that the annotation /derives/ from what we know >>>>> about the modified copy of H embedded at Ĥ.qx. We know that >>>>> H.q0 <M> s ⊢* y1 H.qn y2 >>>>> if M applied to s does not halt. >>>>> and since the TM at Ĥ.qx is (in this regard at least) exactly like H we >>>>> know that >>>>> Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>> if M applied to <M> does not halt. >>>>> Now, because >>>>> Ĥ.q0 s ⊢* Ĥ.qx s s >>>>> for /any/ string s, we know, specifically, that >>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>> if M applied to <M> does not halt. >>>>> Can you now see where this correctly annotated line comes from? Can I >>>>> explain any part of this some other way to make it clearer? > > I am wondering if you really read this. I have standardized the notational conventions to this q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > In many years of teaching this > material I never came across someone who didn't get it, but I suspect > you are deliberately trying not to. > Maybe if you were to try and find my mistake instead of perpetually changing the subject you would begin to see what you are failing to understand. >>> I suspect you simply didn't read it since I am agreeing with you about >>> the central role of the Ĥ.qx <M> <M> part in explaining why Linz is >>> correct. >> >> So you are agreeing that when Ĥ.qx simulates <Ĥ> applied to <Ĥ> and >> correctly determines that the simulated <Ĥ> never reaches its final >> state (whether or not Ĥ.qx stops simulating <Ĥ>) then Ĥ.qx correctly >> aborts this simulation and transitions to qn ??? > > Any statement about no Turing machines is vacuously true because I am As I already said at length in another thread the concept of vacuous truth is simply incoherent. This arises because Tarski convinced a bunch of gullible people that Truth cannot be properly defined using his Undefinability Theorem: https://liarparadox.org/Tarski_275_276.pdf > taking you at your word, that you use Ĥ to mean what Linz does: a > class of TMs that are trivial modifications of machines that do this: > > H.q0 <M> s ⊢* x1 H.qy x2 if M applied to s halts, and > H.q0 <M> s ⊢* y1 H.qn y2 if M applied to s does not halt. > That you change the context away from simulating halting deciders is dishonest. I have standardized the notational conventions to this q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > You don't like the consequences of that, but you can't just make those > consequences go away by stating more things about these non-existent > machines. > > If, however, your often repeated waffle about simulation is intended to > define a different, non-empty, class of Turing machines, you need to > start there. Give it a name, J, say, and tell us what goes in the > ... parts of the specification: > > J.q0 <M> s ⊢* x1 J.qy x2 if M ... > J.q0 <M> s ⊢* y1 J.qn y2 if M ... > >> If we have to go over this same point thousands of times I will. > > Sure. You can repeat what you say about no Turing machines as often as > you like, but if you repeat the line > > Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 > > I will keep adding the key condition under which this is defined to > occur: > > if M applied to <M> does not halt. q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn It is about the simulation of the first input to Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ applied to the second input. It is not about the execution of q0 applied to ⟨Ĥ⟩. -- 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-21 19:15 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <%vmcJ.7505$CW2.148@fx43.iad> |
| In reply to | #40667 |
On 10/21/21 10:04 AM, olcott wrote: > On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >> >>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>> if M applied to Wm does not halt >>>>>>> >>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>> is no halt decider at q0. >>>>>> This notation is hopeless in ASCII. Using the notation that has >>>>>> evolved >>>>>> in these threads (not my preferred one, but I don't want to >>>>>> complicate >>>>>> matters any more) Linz writes: >>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>> if M applied to <M> does not halt. >>>>>> And with these changes in notation you seem to be saying >>>>>> >>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>> is no halt decider at q0. >>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly >>>>>> referring to >>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should >>>>>> transition to >>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) >>>>>> applied to >>>>>> <M> (that exactly same string input) does not halt. >>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>> >>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>> <M> being applied to the machine description of the second <M>. >>>>>> >>>>>> The annotation dose not specifically refer to what this >>>>>> sub-computation >>>>>> does. It simply gives the condition under which Ĥ will transition >>>>>> from >>>>>> Ĥ.q0 to Ĥ.qn. >>>>> >>>>> If a simulating halt decider H correctly determines that the >>>>> simulation of its input <M> applied to <M> never reaches its final >>>>> state whether or not this simulating halt decider aborts the >>>>> simulation of this input then this simulating halt decider does >>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>> This is not what Linz is saying. >>> >>> Of course this is not what Linz is saying. >> >> But until you understand what he is saying, you can't see why you are >> wrong. > > That Linz did not consider a simulating halt decider does not make me > wrong. > > If any of this was wrong someone could point out an actual error: > > The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied > to ⟨Ĥ⟩ would never reach its final state whether or not this simulation > is aborted. > > Adapted from bottom of page 319 (definition of Ĥ) > ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > >> The result is that you will continue state things that will be >> either vacuously true or irrelevant because they refer to an empty class >> of TMs. Being correct about no Turing machines is just silly. >> >> If you want to define your own class of TMs that decide something a bit >> like halting, go ahead. Such a class may not be empty and your >> statements about when the "hat" version will or will not transitions to >> qn can be intelligently discussed (but /don't/ call that class H unless >> you intend to deliberately confuse your readers). >> >> If you continue to insist that your are using Ĥ to refer to the same >> class of modified deciders that Linz does, you have to accept his >> definitions and you have to understand the consequences of them. >> >>> Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> >>> would not correctly transition to H.qn. >> >> No he is not. He is stating the conditions under which the transition >> sequence you keep writing occurs. These follow from the definition of >> Ĥ. You need to understand them if you don't want to keep wasting your >> time. >> > > Because Linz ignores the idea of a simulating halt decider he cannot see > that ⟨Ĥ⟩ ⟨Ĥ⟩ presents infinitely nested simulation to ⟨Ĥ⟩ ⟨Ĥ⟩: WHy do you say the Linz ignored it. That the simulating Halt decider appears to get stuck in infinitely nested simulations just shows that such a naive decider fails at its job. > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > But the machine whose representation it is simulating does (at least if H is smart enough to abort the simulation and give the non-halting answer as you claim). It is the actual machine, not the partial simulation in H that matters. FAIL. >>>> If I can help with any further >>>> explanation, I'm happy to have a go but you need to stop repeating what >>>> you are saying and try to focus on what Linz is saying. Once you get >>>> what he is saying you will see that you can say anything you like about >>>> a subclass (those that "simulate") of the empty class of TMs (the halt >>>> deciders) that Linz is talking about. Atatements about no TMs are >>>> vacuously true (or irrelevant -- take your pick). >>>> >>>>> Anything and everything that is not input to this halt decider is 100% >>>>> totally irrelevant. >>>> Technically, there is no halt decider in the TM you are talking about, >>>> but that's a detail and you don't do details. Did you follow what I >>>> wrote about how the string input to the almost-decider at Ĥ.qx is >>>> entirely why Linz's annotation is correct? Here it is: >>>> >>>>>> But you are correct in that the annotation /derives/ from what we >>>>>> know >>>>>> about the modified copy of H embedded at Ĥ.qx. We know that >>>>>> H.q0 <M> s ⊢* y1 H.qn y2 >>>>>> if M applied to s does not halt. >>>>>> and since the TM at Ĥ.qx is (in this regard at least) exactly like >>>>>> H we >>>>>> know that >>>>>> Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>> if M applied to <M> does not halt. >>>>>> Now, because >>>>>> Ĥ.q0 s ⊢* Ĥ.qx s s >>>>>> for /any/ string s, we know, specifically, that >>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>> if M applied to <M> does not halt. >>>>>> Can you now see where this correctly annotated line comes from? >>>>>> Can I >>>>>> explain any part of this some other way to make it clearer? >> >> I am wondering if you really read this. > > I have standardized the notational conventions to this > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts WRONG. That statement is POOP. The Halting criteria (Which Linz gives) is if the Computation represented by the input to the decider Halts. H^(<H^>) DOES Halt (at least if H(<H^>,<H^> gives the non-halting answer you claim) so H is wrong. Only if H does something else, either not Halt and answer or answer Halting is H^ non-Halting, and in those cases H is still wrong. > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > >> In many years of teaching this >> material I never came across someone who didn't get it, but I suspect >> you are deliberately trying not to. >> > > Maybe if you were to try and find my mistake instead of perpetually > changing the subject you would begin to see what you are failing to > understand. > Maybe some day you will read the responses and see that your mistakes have been pointed out many times. Your denial of this just shows you are either mentally incompetent, or a pathological liar. >>>> I suspect you simply didn't read it since I am agreeing with you about >>>> the central role of the Ĥ.qx <M> <M> part in explaining why Linz is >>>> correct. >>> >>> So you are agreeing that when Ĥ.qx simulates <Ĥ> applied to <Ĥ> and >>> correctly determines that the simulated <Ĥ> never reaches its final >>> state (whether or not Ĥ.qx stops simulating <Ĥ>) then Ĥ.qx correctly >>> aborts this simulation and transitions to qn ??? >> >> Any statement about no Turing machines is vacuously true because I am > > As I already said at length in another thread the concept of vacuous > truth is simply incoherent. > > This arises because Tarski convinced a bunch of gullible people that > Truth cannot be properly defined using his Undefinability Theorem: > https://liarparadox.org/Tarski_275_276.pdf PROVE that all truth is provable. If you can't actually prove that statement, by its own rules, it isn't ture. > >> taking you at your word, that you use Ĥ to mean what Linz does: a >> class of TMs that are trivial modifications of machines that do this: >> >> H.q0 <M> s ⊢* x1 H.qy x2 if M applied to s halts, and >> H.q0 <M> s ⊢* y1 H.qn y2 if M applied to s does not halt. >> > > That you change the context away from simulating halting deciders is > dishonest. > > I have standardized the notational conventions to this > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts Just POOP > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not haltPOOP again. > >> You don't like the consequences of that, but you can't just make those >> consequences go away by stating more things about these non-existent >> machines. >> >> If, however, your often repeated waffle about simulation is intended to >> define a different, non-empty, class of Turing machines, you need to >> start there. Give it a name, J, say, and tell us what goes in the >> ... parts of the specification: >> >> J.q0 <M> s ⊢* x1 J.qy x2 if M ... >> J.q0 <M> s ⊢* y1 J.qn y2 if M ... >> >>> If we have to go over this same point thousands of times I will. >> >> Sure. You can repeat what you say about no Turing machines as often as >> you like, but if you repeat the line >> >> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >> >> I will keep adding the key condition under which this is defined to >> occur: >> if M applied to <M> does not halt. > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > > It is about the simulation of the first input to Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ applied to > the second input. It is not about the execution of q0 applied to ⟨Ĥ⟩. > The Halting problem is NOT about the simulation by H/H^ but about the behavior of the actual machine H^. That Halts. FAIL. POOP.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-21 18:30 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] |
| Message-ID | <bMidneSQWdaCZez8nZ2dnUU7-RHNnZ2d@giganews.com> |
| In reply to | #40700 |
On 10/21/2021 6:15 PM, Richard Damon wrote: > On 10/21/21 10:04 AM, olcott wrote: >> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>> >>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>> if M applied to Wm does not halt >>>>>>>> >>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because >>>>>>>> there >>>>>>>> is no halt decider at q0. >>>>>>> This notation is hopeless in ASCII. Using the notation that has >>>>>>> evolved >>>>>>> in these threads (not my preferred one, but I don't want to >>>>>>> complicate >>>>>>> matters any more) Linz writes: >>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>> if M applied to <M> does not halt. >>>>>>> And with these changes in notation you seem to be saying >>>>>>> >>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because >>>>>>>> there >>>>>>>> is no halt decider at q0. >>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly >>>>>>> referring to >>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should >>>>>>> transition to >>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) >>>>>>> applied to >>>>>>> <M> (that exactly same string input) does not halt. >>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>> >>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>> >>>>>>> The annotation dose not specifically refer to what this >>>>>>> sub-computation >>>>>>> does. It simply gives the condition under which Ĥ will >>>>>>> transition from >>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>> >>>>>> If a simulating halt decider H correctly determines that the >>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>> state whether or not this simulating halt decider aborts the >>>>>> simulation of this input then this simulating halt decider does >>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>> This is not what Linz is saying. >>>> >>>> Of course this is not what Linz is saying. >>> >>> But until you understand what he is saying, you can't see why you are >>> wrong. >> >> That Linz did not consider a simulating halt decider does not make me >> wrong. >> >> If any of this was wrong someone could point out an actual error: >> >> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >> to ⟨Ĥ⟩ would never reach its final state whether or not this >> simulation is aborted. >> >> Adapted from bottom of page 319 (definition of Ĥ) >> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >> >> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >> >> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >> >> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >> >>> The result is that you will continue state things that will be >>> either vacuously true or irrelevant because they refer to an empty class >>> of TMs. Being correct about no Turing machines is just silly. >>> >>> If you want to define your own class of TMs that decide something a bit >>> like halting, go ahead. Such a class may not be empty and your >>> statements about when the "hat" version will or will not transitions to >>> qn can be intelligently discussed (but /don't/ call that class H unless >>> you intend to deliberately confuse your readers). >>> >>> If you continue to insist that your are using Ĥ to refer to the same >>> class of modified deciders that Linz does, you have to accept his >>> definitions and you have to understand the consequences of them. >>> >>>> Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> >>>> would not correctly transition to H.qn. >>> >>> No he is not. He is stating the conditions under which the transition >>> sequence you keep writing occurs. These follow from the definition of >>> Ĥ. You need to understand them if you don't want to keep wasting your >>> time. >>> >> >> Because Linz ignores the idea of a simulating halt decider he cannot >> see that ⟨Ĥ⟩ ⟨Ĥ⟩ presents infinitely nested simulation to ⟨Ĥ⟩ ⟨Ĥ⟩: > > WHy do you say the Linz ignored it. > > That the simulating Halt decider appears to get stuck in infinitely > nested simulations just shows that such a naive decider fails at its job. > A SELF-EVIDENT TRUTH is any expression of language that can be verified as completely true entirely on the basis of the meaning of its words.** SELF-EVIDENT TRUTH When a simulating halt correctly decider detects that an input would never reach its final state then this simulating halt decider is always correct when it aborts the simulation of this input and reports not halting. **This also applies to formal language expressions that do not have any words. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-21 18:33 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] |
| Message-ID | <bMidneeQWdYnZez8nZ2dnUU7-RGdnZ2d@giganews.com> |
| In reply to | #40703 |
On 10/21/2021 6:30 PM, olcott wrote: > On 10/21/2021 6:15 PM, Richard Damon wrote: >> On 10/21/21 10:04 AM, olcott wrote: >>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>> if M applied to Wm does not halt >>>>>>>>> >>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because >>>>>>>>> there >>>>>>>>> is no halt decider at q0. >>>>>>>> This notation is hopeless in ASCII. Using the notation that has >>>>>>>> evolved >>>>>>>> in these threads (not my preferred one, but I don't want to >>>>>>>> complicate >>>>>>>> matters any more) Linz writes: >>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>> if M applied to <M> does not halt. >>>>>>>> And with these changes in notation you seem to be saying >>>>>>>> >>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because >>>>>>>>> there >>>>>>>>> is no halt decider at q0. >>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly >>>>>>>> referring to >>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should >>>>>>>> transition to >>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) >>>>>>>> applied to >>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>> >>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the >>>>>>>>> first >>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>> >>>>>>>> The annotation dose not specifically refer to what this >>>>>>>> sub-computation >>>>>>>> does. It simply gives the condition under which Ĥ will >>>>>>>> transition from >>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>> >>>>>>> If a simulating halt decider H correctly determines that the >>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>> state whether or not this simulating halt decider aborts the >>>>>>> simulation of this input then this simulating halt decider does >>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>> This is not what Linz is saying. >>>>> >>>>> Of course this is not what Linz is saying. >>>> >>>> But until you understand what he is saying, you can't see why you are >>>> wrong. >>> >>> That Linz did not consider a simulating halt decider does not make me >>> wrong. >>> >>> If any of this was wrong someone could point out an actual error: >>> >>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ >>> applied to ⟨Ĥ⟩ would never reach its final state whether or not this >>> simulation is aborted. >>> >>> Adapted from bottom of page 319 (definition of Ĥ) >>> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >>> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >>> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>> >>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >>>> The result is that you will continue state things that will be >>>> either vacuously true or irrelevant because they refer to an empty >>>> class >>>> of TMs. Being correct about no Turing machines is just silly. >>>> >>>> If you want to define your own class of TMs that decide something a bit >>>> like halting, go ahead. Such a class may not be empty and your >>>> statements about when the "hat" version will or will not transitions to >>>> qn can be intelligently discussed (but /don't/ call that class H unless >>>> you intend to deliberately confuse your readers). >>>> >>>> If you continue to insist that your are using Ĥ to refer to the same >>>> class of modified deciders that Linz does, you have to accept his >>>> definitions and you have to understand the consequences of them. >>>> >>>>> Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> >>>>> would not correctly transition to H.qn. >>>> >>>> No he is not. He is stating the conditions under which the transition >>>> sequence you keep writing occurs. These follow from the definition of >>>> Ĥ. You need to understand them if you don't want to keep wasting your >>>> time. >>>> >>> >>> Because Linz ignores the idea of a simulating halt decider he cannot >>> see that ⟨Ĥ⟩ ⟨Ĥ⟩ presents infinitely nested simulation to ⟨Ĥ⟩ ⟨Ĥ⟩: >> >> WHy do you say the Linz ignored it. >> >> That the simulating Halt decider appears to get stuck in infinitely >> nested simulations just shows that such a naive decider fails at its job. >> > > A SELF-EVIDENT TRUTH is any expression of language that can be verified > as completely true entirely on the basis of the meaning of its words.** > > SELF-EVIDENT TRUTH > When a simulating halt correctly decider detects that an input would When a simulating halt decider correctly detects that an input would > never reach its final state then this simulating halt decider is always > correct when it aborts the simulation of this input and reports not > halting. > > **This also applies to formal language expressions that do not have any > words. > -- 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-21 23:03 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ SELF-EVIDENT TRUTH ] |
| Message-ID | <4SpcJ.782$3R.575@fx12.iad> |
| In reply to | #40703 |
On 10/21/21 7:30 PM, olcott wrote: > On 10/21/2021 6:15 PM, Richard Damon wrote: >> On 10/21/21 10:04 AM, olcott wrote: >>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>> if M applied to Wm does not halt >>>>>>>>> >>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because >>>>>>>>> there >>>>>>>>> is no halt decider at q0. >>>>>>>> This notation is hopeless in ASCII. Using the notation that has >>>>>>>> evolved >>>>>>>> in these threads (not my preferred one, but I don't want to >>>>>>>> complicate >>>>>>>> matters any more) Linz writes: >>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>> if M applied to <M> does not halt. >>>>>>>> And with these changes in notation you seem to be saying >>>>>>>> >>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because >>>>>>>>> there >>>>>>>>> is no halt decider at q0. >>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly >>>>>>>> referring to >>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should >>>>>>>> transition to >>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) >>>>>>>> applied to >>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>> >>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the >>>>>>>>> first >>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>> >>>>>>>> The annotation dose not specifically refer to what this >>>>>>>> sub-computation >>>>>>>> does. It simply gives the condition under which Ĥ will >>>>>>>> transition from >>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>> >>>>>>> If a simulating halt decider H correctly determines that the >>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>> state whether or not this simulating halt decider aborts the >>>>>>> simulation of this input then this simulating halt decider does >>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>> This is not what Linz is saying. >>>>> >>>>> Of course this is not what Linz is saying. >>>> >>>> But until you understand what he is saying, you can't see why you are >>>> wrong. >>> >>> That Linz did not consider a simulating halt decider does not make me >>> wrong. >>> >>> If any of this was wrong someone could point out an actual error: >>> >>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ >>> applied to ⟨Ĥ⟩ would never reach its final state whether or not this >>> simulation is aborted. >>> >>> Adapted from bottom of page 319 (definition of Ĥ) >>> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >>> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >>> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>> >>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >>>> The result is that you will continue state things that will be >>>> either vacuously true or irrelevant because they refer to an empty >>>> class >>>> of TMs. Being correct about no Turing machines is just silly. >>>> >>>> If you want to define your own class of TMs that decide something a bit >>>> like halting, go ahead. Such a class may not be empty and your >>>> statements about when the "hat" version will or will not transitions to >>>> qn can be intelligently discussed (but /don't/ call that class H unless >>>> you intend to deliberately confuse your readers). >>>> >>>> If you continue to insist that your are using Ĥ to refer to the same >>>> class of modified deciders that Linz does, you have to accept his >>>> definitions and you have to understand the consequences of them. >>>> >>>>> Linz is still under the misconception that Ĥ.q0 applied to <Ĥ> <Ĥ> >>>>> would not correctly transition to H.qn. >>>> >>>> No he is not. He is stating the conditions under which the transition >>>> sequence you keep writing occurs. These follow from the definition of >>>> Ĥ. You need to understand them if you don't want to keep wasting your >>>> time. >>>> >>> >>> Because Linz ignores the idea of a simulating halt decider he cannot >>> see that ⟨Ĥ⟩ ⟨Ĥ⟩ presents infinitely nested simulation to ⟨Ĥ⟩ ⟨Ĥ⟩: >> >> WHy do you say the Linz ignored it. >> >> That the simulating Halt decider appears to get stuck in infinitely >> nested simulations just shows that such a naive decider fails at its job. >> > > A SELF-EVIDENT TRUTH is any expression of language that can be verified > as completely true entirely on the basis of the meaning of its words.** > > SELF-EVIDENT TRUTH > When a simulating halt correctly decider detects that an input would > never reach its final state then this simulating halt decider is always > correct when it aborts the simulation of this input and reports not > halting. > > **This also applies to formal language expressions that do not have any > words. > And you can't jusg claim somethoing to be a 'Self-Evident Truth' unless you can actually show it IS, and other agree to it. If others (and not just one or two people) don't agree, then it is obviously NOT self-evident. You make LOTS of 'Claims' about stuff being self-evident when it isn't. You have fundamental logical errors in your statement, so it really isn't a self evident truth. First, inputs don't do anything, they are just strings, which don't do anything except be data for algorithms to do computations. You apply this data to the wrong algorithm, the question of the halting problem is what happens when this data is interpreted as the representation of a machine and its input, and that machine is applied to that input, and asks if this machine would halt or not. An equivalent question would be what would happen if this input is given to an actual UTM that simulates this input until it reaches a halting state or continues running this simulation forever. THAT is the question. You are looking at what the partial incomplete simulation done by the decider does. THAT IS WRONG. A WRONG THING IS NEVER THE 'TRUTH', so can't be a 'self-evident truth'.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-22 03:19 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost? ] |
| Message-ID | <87v91p6btt.fsf@bsb.me.uk> |
| In reply to | #40667 |
olcott <NoOne@NoWhere.com> writes: > On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >> >>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>> if M applied to Wm does not halt >>>>>>> >>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>> is no halt decider at q0. >>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>> matters any more) Linz writes: >>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>> if M applied to <M> does not halt. >>>>>> And with these changes in notation you seem to be saying >>>>>> >>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>> is no halt decider at q0. >>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>> <M> (that exactly same string input) does not halt. >>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>> >>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>> <M> being applied to the machine description of the second <M>. >>>>>> >>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>> Ĥ.q0 to Ĥ.qn. >>>>> >>>>> If a simulating halt decider H correctly determines that the >>>>> simulation of its input <M> applied to <M> never reaches its final >>>>> state whether or not this simulating halt decider aborts the >>>>> simulation of this input then this simulating halt decider does >>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>> This is not what Linz is saying. >>> >>> Of course this is not what Linz is saying. >> But until you understand what he is saying, you can't see why you are >> wrong. > > That Linz did not consider a simulating halt decider does not make me > wrong. Quite. You are wrong for the reasons I gave. > If any of this was wrong someone could point out an actual error: > > The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied > to ⟨Ĥ⟩ would never reach its final state whether or not this > simulation is aborted. The error is that this is a statement about an sub-set of and empty set of Turing machines. > Adapted from bottom of page 319 (definition of Ĥ) > ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. > > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts This is either the wrong annotation for Linz's Ĥ or a pointless re-wording of it. > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt And again, this is the wrong annotation for Linz's Ĥ. Linz's Ĥ transitions to qn is (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You can't change the specification of what Ĥ does if you want to be taken seriously. You have to accept the logical consequences of his definitions or define your own class of machines. You can't do either and the keep the conversation going, so you have to keep pretend that no one is pointing out an error. > That you change the context away from simulating halting deciders is > dishonest. Linz's class of machines, H, includes any and all halting deciders, "simulating" or otherwise, so I have not changed the subject. You have narrowed it down to pointlessly talking about a subset of an already empty set of Turing machines. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-21 21:33 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <5dSdnaybIud0v-_8nZ2dnUU78LHNnZ2d@giganews.com> |
| In reply to | #40713 |
On 10/21/2021 9:19 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>> >>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>> if M applied to Wm does not halt >>>>>>>> >>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>> is no halt decider at q0. >>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>> matters any more) Linz writes: >>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>> if M applied to <M> does not halt. >>>>>>> And with these changes in notation you seem to be saying >>>>>>> >>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>> is no halt decider at q0. >>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>> <M> (that exactly same string input) does not halt. >>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>> >>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>> >>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>> >>>>>> If a simulating halt decider H correctly determines that the >>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>> state whether or not this simulating halt decider aborts the >>>>>> simulation of this input then this simulating halt decider does >>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>> This is not what Linz is saying. >>>> >>>> Of course this is not what Linz is saying. >>> But until you understand what he is saying, you can't see why you are >>> wrong. >> >> That Linz did not consider a simulating halt decider does not make me >> wrong. > > Quite. You are wrong for the reasons I gave. > >> If any of this was wrong someone could point out an actual error: >> >> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >> to ⟨Ĥ⟩ would never reach its final state whether or not this >> simulation is aborted. > > The error is that this is a statement about an sub-set of and empty set > of Turing machines. > You are simply making a false assumption. You are beginning with the premise that Linz is correct then concluding that Linz is correct on the basis of this premise. >> Adapted from bottom of page 319 (definition of Ĥ) >> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >> >> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts > > This is either the wrong annotation for Linz's Ĥ or a pointless > re-wording of it. > >> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > > And again, this is the wrong annotation for Linz's Ĥ. Linz's Ĥ > transitions to qn is (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. > No you are wrong. Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to Ĥqn when its input never halts. You can't show that this is incorrect only because it is correct. > You can't change the specification of what Ĥ does if you want to be > taken seriously. You have to accept the logical consequences of his > definitions or define your own class of machines. > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is impossible for anything else to show that the halt decider is incorrect. The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is impossible for anything else to show that the halt decider is incorrect. The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is impossible for anything else to show that the halt decider is incorrect. The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is impossible for anything else to show that the halt decider is incorrect. The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is impossible for anything else to show that the halt decider is incorrect. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2021-10-21 21:59 -0600 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <sktcun$495$1@dont-email.me> |
| In reply to | #40715 |
On 10/21/2021 8:33 PM, olcott wrote: > The halt decider must only correctly decide whether or not its input > halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input > halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input > halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input > halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input > halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. <See my recent relevant to this one> N.B. Compulsive repetition such as the above is strong evidence of fixation in the early, anal stages of development. Even though it usually occurs in much younger humans, it is possible (in your case) that either 1) you never passed out of this stage or 2) you have regressed. Typically compulsions completely inhibit the mind from processing other information of sensing the environment. I think your regression has blocked your sanity in addition to your ability to process simple adult tasks. It's no wonder your logic (not simply as part of mathematics but as a part of ordinary life) is so deeply flawed. You can't even engage in simple, pleasant dialogue without tantrums and endless repetition. I would suggest that you do some online searches to learn more about your condition(s). Unfortunately I know better from your behavior here: you would look something up, your eyes would glaze over since you can not concentrate, then you would quote things you do not understand and insist you had novel insights. All the while exhibiting all the signs of a sick adult mired in the anal retentive stage with no self awareness what so ever. Get help. Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-23 00:57 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <877de44npj.fsf@bsb.me.uk> |
| In reply to | #40715 |
olcott <NoOne@NoWhere.com> writes: > On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>> if M applied to Wm does not halt >>>>>>>>> >>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>> is no halt decider at q0. >>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>> matters any more) Linz writes: >>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>> if M applied to <M> does not halt. >>>>>>>> And with these changes in notation you seem to be saying >>>>>>>> >>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>> is no halt decider at q0. >>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>> >>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>> >>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>> >>>>>>> If a simulating halt decider H correctly determines that the >>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>> state whether or not this simulating halt decider aborts the >>>>>>> simulation of this input then this simulating halt decider does >>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>> This is not what Linz is saying. >>>>> >>>>> Of course this is not what Linz is saying. >>>> But until you understand what he is saying, you can't see why you are >>>> wrong. >>> >>> That Linz did not consider a simulating halt decider does not make me >>> wrong. >> >> Quite. You are wrong for the reasons I gave. >> >>> If any of this was wrong someone could point out an actual error: >>> >>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>> simulation is aborted. >> The error is that this is a statement about an sub-set of and empty set >> of Turing machines. > > You are simply making a false assumption. You are beginning with the > premise that Linz is correct then concluding that Linz is correct on > the basis of this premise. A proved theorem is not a "false assumption". You have not invalidated any proof of the halting theorem, much less all of them. You have not even read Linz's real proof, only the simplistic one that you latched on to all those years ago. Even there, I have taken you through the steps (which you appear to agree with right up to the last, or second to last step) and you declined to say what you think is invalid about it. You just keep removing the key line that shows you are wrong. >>> Adapted from bottom of page 319 (definition of Ĥ) >>> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >>> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >> This is either the wrong annotation for Linz's Ĥ or a pointless >> re-wording of it. >> >>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >> And again, this is the wrong annotation for Linz's Ĥ. Linz's Ĥ >> transitions to qn is (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. > > No you are wrong. > Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to Ĥqn when its input never halts. > You can't show that this is incorrect only because it is correct. Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to Ĥqn if (only if) Ĥ applied to ⟨Ĥ⟩ does not halt. All I can do now is just correct the error. I've taken you through the steps from the ones you have no objection to right up to this conclusion and you simply reply by asserting contrary statements. I remain willing to try to explain it, but you exhibit all the signs of someone determined not to learn. >> You can't change the specification of what Ĥ does if you want to be >> taken seriously. You have to accept the logical consequences of his >> definitions or define your own class of machines. > > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. > > The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is > impossible for anything else to show that the halt decider is incorrect. Childish. Unless you tell me you were wrong when you said you are talking about Linz's Ĥ, I will continue to assume that that is what you mean by the symbol. Linz's Ĥ is derived from an H that decides all cases. From that is follows using the simplest of logical steps that no such H (and therefore Ĥ) can exist. A TM J that decides just one case involving Ĵ would have a very different specification. I have invited you give it, but of course you didn't. If you want to stop talking about Linz's Ĥ, define what your "one case" decider really does and we'll discuss it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-22 23:19 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <IM-dnZeda7r5EO78nZ2dnUU7-c3NnZ2d@giganews.com> |
| In reply to | #40733 |
On 10/22/2021 6:57 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>> >>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>>> is no halt decider at q0. >>>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>>> matters any more) Linz writes: >>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>> if M applied to <M> does not halt. >>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>> >>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>>> is no halt decider at q0. >>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>> >>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>>> >>>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>> >>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>>> This is not what Linz is saying. >>>>>> >>>>>> Of course this is not what Linz is saying. >>>>> But until you understand what he is saying, you can't see why you are >>>>> wrong. >>>> >>>> That Linz did not consider a simulating halt decider does not make me >>>> wrong. >>> >>> Quite. You are wrong for the reasons I gave. >>> >>>> If any of this was wrong someone could point out an actual error: >>>> >>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>> simulation is aborted. >>> The error is that this is a statement about an sub-set of and empty set >>> of Turing machines. >> >> You are simply making a false assumption. You are beginning with the >> premise that Linz is correct then concluding that Linz is correct on >> the basis of this premise. > > A proved theorem is not a "false assumption". Ah so you are back to your blasphemy. One can not rely on a proved theorem as exactly equal to infallibility. The problem with the proved theorem is that I have showed how it is proved to be incorrect. Your whole "rebuttal" is simply assuming that I must be wrong. q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its final state (even if infinitely simulated) this makes the undecidable case decidable as not halting. You can't refute this because it is correct. > You have not invalidated > any proof of the halting theorem, much less all of them. You have not > even read Linz's real proof, only the simplistic one that you latched on > to all those years ago. Even there, I have taken you through the steps > (which you appear to agree with right up to the last, or second to last > step) and you declined to say what you think is invalid about it. You > just keep removing the key line that shows you are wrong. > It seem like you are saying that a halt decider that does correctly decide that its input never halts can still be wrong. That would be a woefully foolish mistake on your part. >>>> Adapted from bottom of page 319 (definition of Ĥ) >>>> ⟨Ĥ⟩ indicates the Turing machine description of Ĥ. >>>> >>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ∞ >>>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts >>> This is either the wrong annotation for Linz's Ĥ or a pointless >>> re-wording of it. >>> >>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn >>>> If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>> And again, this is the wrong annotation for Linz's Ĥ. Linz's Ĥ >>> transitions to qn is (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. >> >> No you are wrong. >> Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to Ĥqn when its input never halts. >> You can't show that this is incorrect only because it is correct. > > Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to Ĥqn if (only if) Ĥ applied to ⟨Ĥ⟩ does not > halt. > > All I can do now is just correct the error. I've taken you through the > steps from the ones you have no objection to right up to this conclusion > and you simply reply by asserting contrary statements. I remain willing > to try to explain it, but you exhibit all the signs of someone > determined not to learn. > >>> You can't change the specification of what Ĥ does if you want to be >>> taken seriously. You have to accept the logical consequences of his >>> definitions or define your own class of machines. >> >> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is >> impossible for anything else to show that the halt decider is incorrect. >> >> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is >> impossible for anything else to show that the halt decider is incorrect. >> >> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is >> impossible for anything else to show that the halt decider is incorrect. >> >> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is >> impossible for anything else to show that the halt decider is incorrect. >> >> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is >> impossible for anything else to show that the halt decider is incorrect. > > Childish. > > Unless you tell me you were wrong when you said you are talking about > Linz's Ĥ, I will continue to assume that that is what you mean by the > symbol. Linz's Ĥ is derived from an H that decides all cases. From > that is follows using the simplest of logical steps that no such H (and > therefore Ĥ) can exist. A TM J that decides just one case involving Ĵ > would have a very different specification. I have invited you give it, > but of course you didn't. > > If you want to stop talking about Linz's Ĥ, define what your "one case" > decider really does and we'll discuss it. > -- 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-23 08:58 -0400 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <ZFTcJ.2649$15ue.2071@fx01.iad> |
| In reply to | #40737 |
On 10/23/21 12:19 AM, olcott wrote: > On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>> You are simply making a false assumption. You are beginning with the >>> premise that Linz is correct then concluding that Linz is correct on >>> the basis of this premise. >> >> A proved theorem is not a "false assumption". > > Ah so you are back to your blasphemy. One can not rely on a proved > theorem as exactly equal to infallibility. So, if Proof can't be used to establish truth, I guess you just believe that there isn't really anything that is true. That sore of makes sense from you, if nothing can really ever be proved to be true, then there is no problem in claiming things that are false to be true, so you couldn't ever actually prove that either. Just shows how you are a pathelogical liar. > > The problem with the proved theorem is that I have showed how it is > proved to be incorrect. Your whole "rebuttal" is simply assuming that I > must be wrong. > No, you haven't shown anything incorrect about the proof, you have just shown a 'claimed' counter example. > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn So H^(<H^>) is claimed to halt. THAT is what that line says, H^.q0 <H^> goes to H^.qx/H.q0 <H^> <H^> (the claimed decider) which goes to state qn where H^ Halts and H predicts that it won't ever halt (and thus is wrong) > > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its final > state (even if infinitely simulated) this makes the undecidable case > decidable as not halting. > You have the wrong question. It is does the computation represented ever halt or would this input if given to a real UTM halt, and in both cases the answer is YES. That fact that you can't make an H get there just proves that your technique is insufficient to answer the question. H NEVER needed to be able to simulate its input to a halting state for the computation to be a Halting computation. > You can't refute this because it is correct. WRONG. > > >> You have not invalidated >> any proof of the halting theorem, much less all of them. You have not >> even read Linz's real proof, only the simplistic one that you latched on >> to all those years ago. Even there, I have taken you through the steps >> (which you appear to agree with right up to the last, or second to last >> step) and you declined to say what you think is invalid about it. You >> just keep removing the key line that shows you are wrong. >> > > It seem like you are saying that a halt decider that does correctly > decide that its input never halts can still be wrong. > That would be a woefully foolish mistake on your part. IT is wrong if that input does halt, like H^(<H^>) Just like your Poodle you entered into the cat show. The Halting Question is NOT can the decider simulate the machine to a Halting State, it is will the computation when run by itself reach the Halting State. Uness your decider IS a UTM, it doesn't have the property that its simulation matches the behavior of the computation it is given. But, if your decider actually IS a UTM, it can NEVER answer 'non-halting', as it will continue to simulate the machine, and thus fails to be a proper decider. Which way are you wrong?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-25 00:30 +0100 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <87k0i22e6q.fsf@bsb.me.uk> |
| In reply to | #40737 |
olcott <NoOne@NoWhere.com> writes: > On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>>> >>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>>>> is no halt decider at q0. >>>>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>>>> matters any more) Linz writes: >>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>>> if M applied to <M> does not halt. >>>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>>> >>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>>>> is no halt decider at q0. >>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>>> >>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>>>> >>>>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>>> >>>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>>>> This is not what Linz is saying. >>>>>>> >>>>>>> Of course this is not what Linz is saying. >>>>>> But until you understand what he is saying, you can't see why you are >>>>>> wrong. >>>>> >>>>> That Linz did not consider a simulating halt decider does not make me >>>>> wrong. >>>> >>>> Quite. You are wrong for the reasons I gave. >>>> >>>>> If any of this was wrong someone could point out an actual error: >>>>> >>>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>>> simulation is aborted. >>>> The error is that this is a statement about an sub-set of and empty set >>>> of Turing machines. >>> >>> You are simply making a false assumption. You are beginning with the >>> premise that Linz is correct then concluding that Linz is correct on >>> the basis of this premise. >> >> A proved theorem is not a "false assumption". > > Ah so you are back to your blasphemy. One can not rely on a proved > theorem as exactly equal to infallibility. You are being dishonest again. Setting aside the silly religious language, I am not asserting that any argument is infallible something that was obvious from what I wrote immediate after this. I am simply saying you have not shown any error in the argument. Until you show that, for example, 2+2 is not equal to 4, it is entirely reasonable to assert that it is. That is not blasphemy. > The problem with the proved theorem is that I have showed how it is > proved to be incorrect. Bad use of terms. To invalidate a theorem (which is what I think you mean by "proved to be incorrect"), you must do more than look at one proof. Why? Well you /have/ show Linz's proof to be invalid. You did that years ago. So why are you continuing? > Your whole "rebuttal" is simply assuming that I > must be wrong. No. I agreed, years ago, that you found an error in Linz's proof. The halting theorem is unaffected since there are so many other correct proof (indeed there is one in Linz that you have never mentioned because I suspect you can't understand it) but you /have/ invalidated the proof in Linz's that has so obsessed you. > q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn > > If the simulated input to Ĥq0 ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state (even if infinitely simulated) this makes the undecidable > case decidable as not halting. > > You can't refute this because it is correct. What I assert is that this is not what Linz says about his Ĥ. I don't care if what you also say correct or not. If it is correct about Linz's Ĥ, it is correct about a non-existent Turing machine, and if it is not correct about Linz's Ĥ, I have not reason to care about the TMs it is correct about (and it means you were lying about using Ĥ only as Linz does). I have taken you through the steps by which is it obvious (to those that know what the notation means) that q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You can't point to the step you think is wrong. All you do is, right at the end, state something else. That's not how you do mathematics. >> You have not invalidated any proof of the halting theorem, much less >> all of them. You have not even read Linz's real proof, only the >> simplistic one that you latched on to all those years ago. Even >> there, I have taken you through the steps (which you appear to agree >> with right up to the last, or second to last step) and you declined >> to say what you think is invalid about it. You just keep removing >> the key line that shows you are wrong. > > It seem like you are saying that a halt decider that does correctly > decide that its input never halts can still be wrong. That would be a > woefully foolish mistake on your part. Your track record in knowing what I am saying is very poor. The way to deal with this is to ask intelligent questions so that I can explain in more detail. I am open to such questions if you have any. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-25 09:46 -0500 |
| Subject | Re: Clarification of Linz Ĥ Description [ correct criteria ][ Ben is lost! ] |
| Message-ID | <eZudnYySvu2oXuv8nZ2dnUU7-I3NnZ2d@giganews.com> |
| In reply to | #40784 |
On 10/24/2021 6:30 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/22/2021 6:57 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/21/2021 9:19 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/21/2021 4:45 AM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/20/2021 8:37 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> On 10/20/2021 7:00 PM, Ben Bacarisse wrote: >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>>>>>> q0 Wm ⊢* Ĥq0 Wm Wm ⊢* Ĥ y1 qn y2 // The "no" path of TM Ĥ >>>>>>>>>>>> if M applied to Wm does not halt >>>>>>>>>>>> >>>>>>>>>>>> Linz cannot be correctly referring to q0 applied to Wm because there >>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>> This notation is hopeless in ASCII. Using the notation that has evolved >>>>>>>>>>> in these threads (not my preferred one, but I don't want to complicate >>>>>>>>>>> matters any more) Linz writes: >>>>>>>>>>> Ĥ.q0 <M> ⊢* Ĥ.qx <M> <M> ⊢* y1 Ĥ.qn y2 >>>>>>>>>>> if M applied to <M> does not halt. >>>>>>>>>>> And with these changes in notation you seem to be saying >>>>>>>>>>> >>>>>>>>>>>> Linz cannot be correctly referring to Ĥ applied to <M> because there >>>>>>>>>>>> is no halt decider at q0. >>>>>>>>>>> Yes, there is no halt decider at Ĥ.q0, but he is correctly referring to >>>>>>>>>>> what Ĥ applied to <M> should do: Ĥ applied to <M> should transition to >>>>>>>>>>> Ĥ.qn if (and only if) M (the TM encoded in the string input) applied to >>>>>>>>>>> <M> (that exactly same string input) does not halt. >>>>>>>>>>> Your next point helps explain how he comes to say this about Ĥ. >>>>>>>>>>> >>>>>>>>>>>> Linz can only be referring to Ĥ.qx <M> <M> the machine of the first >>>>>>>>>>>> <M> being applied to the machine description of the second <M>. >>>>>>>>>>> >>>>>>>>>>> The annotation dose not specifically refer to what this sub-computation >>>>>>>>>>> does. It simply gives the condition under which Ĥ will transition from >>>>>>>>>>> Ĥ.q0 to Ĥ.qn. >>>>>>>>>> >>>>>>>>>> If a simulating halt decider H correctly determines that the >>>>>>>>>> simulation of its input <M> applied to <M> never reaches its final >>>>>>>>>> state whether or not this simulating halt decider aborts the >>>>>>>>>> simulation of this input then this simulating halt decider does >>>>>>>>>> correctly decide that this input never halts NO MATTER WHAT ELSE. >>>>>>>>> This is not what Linz is saying. >>>>>>>> >>>>>>>> Of course this is not what Linz is saying. >>>>>>> But until you understand what he is saying, you can't see why you are >>>>>>> wrong. >>>>>> >>>>>> That Linz did not consider a simulating halt decider does not make me >>>>>> wrong. >>>>> >>>>> Quite. You are wrong for the reasons I gave. >>>>> >>>>>> If any of this was wrong someone could point out an actual error: >>>>>> >>>>>> The machine at Ĥq0 transitions to Ĥqn if the simulation of ⟨Ĥ⟩ applied >>>>>> to ⟨Ĥ⟩ would never reach its final state whether or not this >>>>>> simulation is aborted. >>>>> The error is that this is a statement about an sub-set of and empty set >>>>> of Turing machines. >>>> >>>> You are simply making a false assumption. You are beginning with the >>>> premise that Linz is correct then concluding that Linz is correct on >>>> the basis of this premise. >>> >>> A proved theorem is not a "false assumption". >> >> Ah so you are back to your blasphemy. One can not rely on a proved >> theorem as exactly equal to infallibility. > > You are being dishonest again. Setting aside the silly religious > language, I am not asserting that any argument is infallible something > that was obvious from what I wrote immediate after this. > > I am simply saying you have not shown any error in the argument. Until > you show that, for example, 2+2 is not equal to 4, it is entirely > reasonable to assert that it is. That is not blasphemy. I don't see how this is so difficult for you: (a) If it is claimed that X cannot possibly be done (b) I show X being correctly done (c) then I have refuted X cannot possibly be done -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 14 of 17 — ← Prev page 1 … 12 13 [14] 15 16 17 Next page →
Back to top | Article view | comp.theory
csiph-web