Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #39388 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-09-17 21:40 -0500 |
| Last post | 2021-09-19 23:11 +0100 |
| Articles | 20 on this page of 243 — 10 participants |
Back to article view | Back to comp.theory
Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-17 21:40 -0500
Re: Why do theory of computation problems require pure functions? "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-09-17 21:48 -0700
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-17 22:50 -0600
Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 00:02 -0600
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 00:13 -0600
Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 00:29 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 08:54 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 10:43 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 09:49 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:02 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:13 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:23 -0400
Re: Why do theory of computation problems require pure functions? olcott <polcott2@gmail.com> - 2021-09-18 10:28 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:42 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:51 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:00 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:34 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:29 -0600
Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 11:31 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:47 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:34 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:45 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:06 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:20 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 21:46 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 16:06 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:14 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:58 +0100
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:04 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:13 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:19 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:25 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:37 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:44 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:08 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:32 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:04 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:12 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:02 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 16:11 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:30 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:03 +0100
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:01 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:10 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:09 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:36 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 07:14 -0400
Re: Why do theory of computation problems require pure functions? Andy Walker <anw@cuboid.co.uk> - 2021-09-18 13:02 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 08:57 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 10:53 -0400
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 09:04 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:17 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:24 -0400
Re: Why do theory of computation problems require pure functions? olcott <polcott2@gmail.com> - 2021-09-18 10:29 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:37 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 10:39 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 11:52 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:15 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 12:28 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:50 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:08 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:30 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:52 -0400
Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 15:07 -0500
Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:55 -0400
Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 16:22 -0500
Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:38 -0400
Re: Why do theory of computation problems require pure functions? [mow lawn] olcott <NoOne@NoWhere.com> - 2021-09-18 16:48 -0500
Re: Why do theory of computation problems require pure functions? [mow lawn] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:01 -0400
Re: Why do theory of computation problems require pure functions? [defeat Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:10 -0500
Re: Why do theory of computation problems require pure functions? [defeat Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:26 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:55 +0100
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:10 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 11:39 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 10:52 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 12:08 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:24 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:39 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:57 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:17 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:45 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 15:55 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:11 -0400
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:08 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:15 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:28 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:32 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 16:55 -0600
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:58 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:58 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:09 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 22:32 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 22:10 -0600
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 22:19 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 00:12 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 00:00 -0600
Re: Why do theory of computation problems require pure functions?[ decidability decider citation ] olcott <NoOne@NoWhere.com> - 2021-09-19 06:56 -0500
Re: Why do theory of computation problems require pure functions?[ decidability decider citation ] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 08:05 -0600
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 06:28 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 09:34 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 09:40 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 10:46 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 10:11 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 11:39 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 10:56 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 12:07 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 11:25 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 12:54 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 12:24 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 13:33 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 15:11 -0400
Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 20:22 +0100
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 14:31 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 21:39 +0100
Re: Why do theory of computation problems require pure functions? [ PSR error] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 18:59 -0400
Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 13:23 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] olcott <NoOne@NoWhere.com> - 2021-09-19 14:37 -0500
Re: Why do theory of computation problems require pure functions? [ PSR error] André G. Isaak <agisaak@gm.invalid> - 2021-09-19 13:45 -0600
Re: Why do theory of computation problems require pure functions? [ PSR error] Andy Walker <anw@cuboid.co.uk> - 2021-09-19 21:33 +0100
Re: Why do theory of computation problems require pure functions? [ PSR error] Jeff Barnett <jbb@notatt.com> - 2021-09-19 11:36 -0600
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 13:37 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 06:31 -0400
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 17:14 -0600
Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-18 16:11 -0700
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-18 17:16 -0600
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:52 +0100
Re: Why do theory of computation problems require pure functions? [ Bingo !] olcott <NoOne@NoWhere.com> - 2021-09-18 18:17 -0500
Re: Why do theory of computation problems require pure functions? [ Bingo !] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:20 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 19:17 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:38 +0100
Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-19 15:36 -0700
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:01 +0100
Re: Why do theory of computation problems require pure functions? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-19 16:23 -0700
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:37 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:49 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 10:54 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 08:58 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:02 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:21 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 11:00 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 09:21 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 23:06 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 18:33 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:00 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 19:14 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:56 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:11 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 02:45 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:49 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:30 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 21:38 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:50 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:09 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:29 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-22 01:44 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-21 19:56 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-22 23:58 +0100
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:05 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:13 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:35 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-21 10:21 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-21 22:12 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:16 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:12 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 21:25 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:21 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 23:03 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 00:42 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-20 23:55 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 01:17 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 08:23 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 10:19 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 11:51 -0600
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 13:22 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 12:43 -0600
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 14:25 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 21:33 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-21 21:45 -0600
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 23:05 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 07:03 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] André G. Isaak <agisaak@gm.invalid> - 2021-09-22 14:46 -0600
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-22 15:52 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 19:55 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 19:23 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 19:21 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 18:56 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 21:39 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-22 08:01 -0400
Re: Why do theory of computation problems require pure functions? [ computation ? ] olcott <NoOne@NoWhere.com> - 2021-09-21 10:16 -0500
Re: Why do theory of computation problems require pure functions? [ computation ? ] Richard Damon <Richard@Damon-Family.org> - 2021-09-21 22:10 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 21:28 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 20:33 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:21 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 21:35 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:45 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 22:07 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:24 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:04 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 20:18 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 19:48 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 21:00 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:10 -0400
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 20:20 -0600
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-19 21:55 -0500
Re: Why do theory of computation problems require pure functions? André G. Isaak <agisaak@gm.invalid> - 2021-09-19 22:16 -0600
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 06:47 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-20 09:22 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:19 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:15 -0400
Re: Why do theory of computation problems require pure functions? Jeff Barnett <jbb@notatt.com> - 2021-09-18 18:21 -0600
Re: Why do theory of computation problems require pure functions? Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-09-19 03:15 +0100
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:29 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:54 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:02 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:24 -0400
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 17:29 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:35 -0400
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 00:43 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-19 20:56 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 22:22 -0400
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 10:54 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 09:02 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 23:05 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 18:37 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:43 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-20 19:51 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:10 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:27 -0400
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 18:32 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 22:07 +0100
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 14:55 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:06 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 15:40 -0400
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 14:52 -0500
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 16:15 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:51 +0100
Re: Why do theory of computation problems require pure functions? olcott <NoOne@NoWhere.com> - 2021-09-18 17:00 -0500
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:26 +0100
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 22:45 +0100
Re: Why do theory of computation problems require pure functions? Richard Damon <Richard@Damon-Family.org> - 2021-09-18 17:51 -0400
Re: Why do theory of computation problems require pure functions? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-18 23:24 +0100
Re: Why do theory of computation problems require pure functions? [defeating Rice] olcott <NoOne@NoWhere.com> - 2021-09-18 16:57 -0500
Re: Why do theory of computation problems require pure functions? [defeating Rice] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:11 +0100
Page 7 of 13 — ← Prev page 1 … 5 6 [7] 8 9 … 13 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-19 13:37 -0400 |
| Message-ID | <JzK1J.55421$jm6.43154@fx07.iad> |
| In reply to | #39526 |
On 9/19/21 11:46 AM, olcott wrote: > On 9/19/2021 10:40 AM, André G. Isaak wrote: >> On 2021-09-19 08:34, olcott wrote: >>> On 9/18/2021 11:19 PM, André G. Isaak wrote: >>>> On 2021-09-18 22:10, André G. Isaak wrote: >>>> >>>>> And note that Rice is talking about properties of Turing Machines >>>>> (or, more properly, of the language accepted by a TM), not >>>>> computations. >>>> >>>> I realized immediately after hitting 'send' that the above will no >>>> doubt confuse you since people have been telling you that Turing >>>> Machines can only express computations whereas C/x86 aren't thus >>>> constrained. >>>> >>>> A computation is a Turing Machine description PLUS an input string. >>>> >>>> Rice's theorem is concerned with the Turing Machine's themselves. >>>> >>>> The Linz proof shows that you cannot construct a halting decider, >>>> i.e. a decider which correctly determines for any given TM + input >>>> string pair, whether that pair represents a halting computation. >>>> >>>> Rice's theorem, on the other hand, would rule out the construction >>>> of something like a Decider Decider, i.e. a TM which takes as its >>>> input a TM description and determines whether that TM qualifies as a >>>> decider, i.e. is guaranteed to halt on *any* possible input. >>>> >>>> André >>>> >>> >>> Here is where I referred to my code defining a >>> a decidability decider nine days before you did: >> >> Where did I define or even mention a 'decidability decider'? Above I >> discussed (but did not define) a DECIDER decider, i.e. a TM which >> determines whether another TM qualifies as a decider. >> >>> On 9/9/2021 10:25 AM, olcott wrote: >>> > It is the case that H(P,P)==0 is correct >>> > It is the case that H1((P,P)==1 is correct >>> > It is the case the this is inconsistent. >>> > It is the case that this inconsistency >>> >>> > defines a decidability decider that correctly >>> > defines a decidability decider that correctly >>> > defines a decidability decider that correctly >>> >>> > rejects P on the basis that P has the >>> > pathological self-reference(Olcott 2004) error. >> >> So what exactly is it that the above is deciding? And how does this >> relate to Rice? If you want to claim this is somehow related to rice, >> you need to identify some semantic property that you claim to be able >> to decide. >> >> André >> > > It is deciding that either H/P or H1/P form the pathological > self-reference error(Olcott 2004). As I said in 2004 this is the same > error as the Liar Paradox. This means that either H/P or H1/P are not > correctly decidable. > Except that P, in both cases is most definitely decidable, just not by a given decider. Thus, the error is NOT in P, but with H.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-19 06:31 -0400 |
| Message-ID | <ekE1J.14488$YG4.6462@fx15.iad> |
| In reply to | #39506 |
On 9/18/21 11:32 PM, olcott wrote:
> On 9/18/2021 6:09 PM, Richard Damon wrote:
>> On 9/18/21 6:58 PM, olcott wrote:
>>> On 9/18/2021 5:55 PM, André G. Isaak wrote:
>>>> On 2021-09-18 16:32, olcott wrote:
>>>>> On 9/18/2021 5:28 PM, André G. Isaak wrote:
>>>>>> On 2021-09-18 16:15, olcott wrote:
>>>>>>> On 9/18/2021 5:08 PM, André G. Isaak wrote:
>>>>>>
>>>>>>>> Basically (subject to seeing your actual code), you have a machine
>>>>>>>> H which cannot correctly decide whether P(P) halts but which can
>>>>>>>> correctly decide whether P1(P1) halts. You also have a machine H1
>>>>>>>> which can correctly decide whether P(P) halts but which cannot
>>>>>>>> correctly decide whether P1(P1) halts. So neither of these can
>>>>>>>> possibly count as a universal halt decider since each has a case
>>>>>>>> it cannot decide. Neither your H nor your H1 can decide the
>>>>>>>> corresponding case described by the Linz Proof.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> By using the H1/H pair we have a universal halt decider.
>>>>>>> Whenever they don't provide the same result then one of them is
>>>>>>> wrong.
>>>>>>
>>>>>> And since you have no idea *which* one of them is wrong, how exactly
>>>>>> is it that you have a 'universal halt decider'?
>>>>>>
>>>>>> André
>>>>>>
>>>>>>
>>>>>
>>>>> I just defeated Rice's theorem, the other details are for another day.
>>>>
>>>> How exactly have you managed to do that?
>>>>
>>>
>>> I already told you. I wish you would pay attention.
>>>
>>> int main()
>>> {
>>> if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
>>> OutputString("Pathological self-reference error!");
>>> }
>>>
>>>
>>
>> Which itself proves nothing.
>>
>> What is the precise Semantic Property that you are deciding on.
>>
>> Also, Rice's theorem requires a Decider to give the answer, so an if in
>> main isn't the decider that disproves Rice.
>>
>> Define your property precisely enough that others can verify it.
>>
>> Define a decider (maybe call it R) that decides that property on a
>> machine given to it.
>>
>> My first guess is that you mean R to be:
>>
>> u32 R(u32 P) {
>> return H1(P,P) != H(P,P);
>> }
>>
>> but now you have to specify what semantic property of P it is detecting.
>>
>
> As I have been saying since at least 2004:
> As I have been saying since at least 2004:
> As I have been saying since at least 2004:
> As I have been saying since at least 2004:
>
> The input has the exact same error as the Liar Paradox
No, it does NOT.
The input is a description of a Turing Machine (or is if H is a Turing
Machine)
ALL Turing Machines will either Halt or be Non-Halting, so there IS a
proper answer for every machine.
The problem is you are asking the wrong question.
The question that H needs to answer is does the machine H^ Halt, and
since you algorithm for H says H^ is non-halting, H^ will Halt.
The problem that is like the equivalent to the Liar's Paradox is the
DESIGN question for H, what can H do to get this one question right, and
that IS the equivalent to the Liar's Paradox, but that doesn't prove
that the input is malformed, as the input doesn't exist yet, it shows
that an H that 'beat' Linz ^ machine doesn't exist.
You error seems to be an implied assumption that all problems must have
a solution. They don't.
>
> [Halting Problem Final Conclusion]
> comp.theory
> Peter Olcott
> Sep 5, 2004, 11:21:57 AM
>
> The Liar Paradox can be shown to be nothing more than
> a incorrectly formed statement because of its pathological
> self-reference. The Halting Problem can only exist because
> of this same sort of pathological self-reference.
> https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ
>
> u32 PSR_Olcott_2004(u32 P)
> {
> return H1(P,P) != H(P,P);
> }
>
> int main()
> {
> Output("Pathological Self-Reference(Olcott 2004) = ",
> PSR_Olcott_2004((u32) P));
> }
>
>
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-18 17:14 -0600 |
| Message-ID | <si5rsi$f4t$1@dont-email.me> |
| In reply to | #39495 |
On 2021-09-18 16:58, olcott wrote:
> On 9/18/2021 5:55 PM, André G. Isaak wrote:
>> On 2021-09-18 16:32, olcott wrote:
>>> On 9/18/2021 5:28 PM, André G. Isaak wrote:
>>>> On 2021-09-18 16:15, olcott wrote:
>>>>> On 9/18/2021 5:08 PM, André G. Isaak wrote:
>>>>
>>>>>> Basically (subject to seeing your actual code), you have a machine
>>>>>> H which cannot correctly decide whether P(P) halts but which can
>>>>>> correctly decide whether P1(P1) halts. You also have a machine H1
>>>>>> which can correctly decide whether P(P) halts but which cannot
>>>>>> correctly decide whether P1(P1) halts. So neither of these can
>>>>>> possibly count as a universal halt decider since each has a case
>>>>>> it cannot decide. Neither your H nor your H1 can decide the
>>>>>> corresponding case described by the Linz Proof.
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> By using the H1/H pair we have a universal halt decider.
>>>>> Whenever they don't provide the same result then one of them is wrong.
>>>>
>>>> And since you have no idea *which* one of them is wrong, how exactly
>>>> is it that you have a 'universal halt decider'?
>>>>
>>>> André
>>>>
>>>>
>>>
>>> I just defeated Rice's theorem, the other details are for another day.
>>
>> How exactly have you managed to do that?
>>
>
> I already told you. I wish you would pay attention.
>
> int main()
> {
> if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
> OutputString("Pathological self-reference error!");
> }
And how exactly does that refute Rice? All you're testing is whether
your H and H1 disagree. What does that have to do with Rice or anything
else for that matter?
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-09-18 16:11 -0700 |
| Message-ID | <b885b582-6153-4184-8dad-aed5dfc83cecn@googlegroups.com> |
| In reply to | #39493 |
On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: > On 2021-09-18 16:32, olcott wrote: > > > > > I just defeated Rice's theorem, the other details are for another day. > How exactly have you managed to do that? > > Unless you know which is correct, your H1/H pair are unable to reach a > decision at all regarding halting. > We construct two halt deciders, which are known to be correct, other than for "pathological" inputs. When fed such a "pathological" input, one returns true and the other returns false. Therefore using the two halt deciders and selecting the instances where they disagree, we have classified the "pathological inputs", something that Rice's theorem states that cannot be achieved.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-18 17:16 -0600 |
| Message-ID | <si5s0j$f4t$2@dont-email.me> |
| In reply to | #39497 |
On 2021-09-18 17:11, Malcolm McLean wrote: > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> On 2021-09-18 16:32, olcott wrote: >> >>> >>> I just defeated Rice's theorem, the other details are for another day. >> How exactly have you managed to do that? >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> decision at all regarding halting. >> > We construct two halt deciders, which are known to be correct, other > than for "pathological" inputs. When fed such a "pathological" input, > one returns true and the other returns false. > > Therefore using the two halt deciders and selecting the instances where > they disagree, we have classified the "pathological inputs", something that > Rice's theorem states that cannot be achieved. How is that a semantic property? "Pathological Inputs" isn't even *defined*. It just means something that Olcott doesn't like. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-19 22:52 +0100 |
| Message-ID | <875yuw9qs0.fsf@bsb.me.uk> |
| In reply to | #39499 |
André G. Isaak <agisaak@gm.invalid> writes: > On 2021-09-18 17:11, Malcolm McLean wrote: >> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >>> On 2021-09-18 16:32, olcott wrote: >>> >>>> >>>> I just defeated Rice's theorem, the other details are for another day. >>> How exactly have you managed to do that? >>> >>> Unless you know which is correct, your H1/H pair are unable to reach a >>> decision at all regarding halting. >>> >> We construct two halt deciders, which are known to be correct, other >> than for "pathological" inputs. When fed such a "pathological" input, >> one returns true and the other returns false. >> Therefore using the two halt deciders and selecting the instances where >> they disagree, we have classified the "pathological inputs", something that >> Rice's theorem states that cannot be achieved. > > How is that a semantic property? "Pathological Inputs" isn't even > *defined*. It just means something that Olcott doesn't like. To be fair, he has, on occasion, been clear enough to be wrong about this. He does sometimes claim that a pathological input is the encoding of a computation that behaves like <H^><H^> in the sense of being able to recognise all the possible "hat"-like constructions that could be applied to H in the proof. With that meaning, even having one of the magic TMs is contrary to Rice's theorem, so it's not clear why he needs two. In fact, having such a TM contravenes the halting theorem. He's often claimed to be building a halt decider based on an algorithm that is already a halt decider! But then he also sometimes claims to be simply observing either a static pattern or a decidable semantic one. Both are possible and two different such TMs can be constructed but having both does not contravene Rice's theorem since the combined effect is still not deciding an "interesting" property. The flip-flopping is probably not deliberate. Half the time he knows not what he says. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 18:17 -0500 |
| Subject | Re: Why do theory of computation problems require pure functions? [ Bingo !] |
| Message-ID | <SeWdnWnjSZwR7tv8nZ2dnUU7-YOdnZ2d@giganews.com> |
| In reply to | #39497 |
On 9/18/2021 6:11 PM, Malcolm McLean wrote: > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> On 2021-09-18 16:32, olcott wrote: >> >>> >>> I just defeated Rice's theorem, the other details are for another day. >> How exactly have you managed to do that? >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> decision at all regarding halting. >> > We construct two halt deciders, which are known to be correct, other > than for "pathological" inputs. When fed such a "pathological" input, > one returns true and the other returns false. > > Therefore using the two halt deciders and selecting the instances where > they disagree, we have classified the "pathological inputs", something that > Rice's theorem states that cannot be achieved. > Bingo !!! -- 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-09-18 19:20 -0400 |
| Subject | Re: Why do theory of computation problems require pure functions? [ Bingo !] |
| Message-ID | <Tuu1J.30886$6U3.20645@fx43.iad> |
| In reply to | #39500 |
On 9/18/21 7:17 PM, olcott wrote: > On 9/18/2021 6:11 PM, Malcolm McLean wrote: >> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >>> On 2021-09-18 16:32, olcott wrote: >>> >>>> >>>> I just defeated Rice's theorem, the other details are for another day. >>> How exactly have you managed to do that? >>> >>> Unless you know which is correct, your H1/H pair are unable to reach a >>> decision at all regarding halting. >>> >> We construct two halt deciders, which are known to be correct, other >> than for "pathological" inputs. When fed such a "pathological" input, >> one returns true and the other returns false. >> >> Therefore using the two halt deciders and selecting the instances where >> they disagree, we have classified the "pathological inputs", something >> that >> Rice's theorem states that cannot be achieved. >> > > Bingo !!! > See my reply, FAIL-O!
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 19:17 -0400 |
| Message-ID | <msu1J.30885$6U3.860@fx43.iad> |
| In reply to | #39497 |
On 9/18/21 7:11 PM, Malcolm McLean wrote: > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> On 2021-09-18 16:32, olcott wrote: >> >>> >>> I just defeated Rice's theorem, the other details are for another day. >> How exactly have you managed to do that? >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> decision at all regarding halting. >> > We construct two halt deciders, which are known to be correct, other > than for "pathological" inputs. When fed such a "pathological" input, > one returns true and the other returns false. > > Therefore using the two halt deciders and selecting the instances where > they disagree, we have classified the "pathological inputs", something that > Rice's theorem states that cannot be achieved. > But it won't find H2^ which is just as pathological as H^, so it fails, that could only be detected by testing with H2, another copy of H and H1. Both H and H1 will get H2^(<H2^>) as correctly halting, but it is pathological to H2.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-19 22:38 +0100 |
| Message-ID | <87bl4o9rfk.fsf@bsb.me.uk> |
| In reply to | #39497 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> On 2021-09-18 16:32, olcott wrote: >> >> > >> > I just defeated Rice's theorem, the other details are for another day. >> How exactly have you managed to do that? >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> decision at all regarding halting. >> > We construct two halt deciders, which are known to be correct, other > than for "pathological" inputs. When fed such a "pathological" input, > one returns true and the other returns false. > > Therefore using the two halt deciders and selecting the instances where > they disagree, we have classified the "pathological inputs", something that > Rice's theorem states that cannot be achieved. Why do you say that? Surely that depends entirely on the parts you put in scare quotes. PO (deliberately?) flip-lops between stating that "pathological" inputs are characterised by a syntactic pattern and by a semantic property. Why do you even think he knows which one he is talking about today? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-09-19 15:36 -0700 |
| Message-ID | <9f3d89f7-6040-4d9f-96e8-4fb18bf6985fn@googlegroups.com> |
| In reply to | #39570 |
On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: > >> On 2021-09-18 16:32, olcott wrote: > >> > >> > > >> > I just defeated Rice's theorem, the other details are for another day. > >> How exactly have you managed to do that? > >> > >> Unless you know which is correct, your H1/H pair are unable to reach a > >> decision at all regarding halting. > >> > > We construct two halt deciders, which are known to be correct, other > > than for "pathological" inputs. When fed such a "pathological" input, > > one returns true and the other returns false. > > > > Therefore using the two halt deciders and selecting the instances where > > they disagree, we have classified the "pathological inputs", something that > > Rice's theorem states that cannot be achieved. > > Why do you say that? Surely that depends entirely on the parts you put > in scare quotes. PO (deliberately?) flip-lops between stating that > "pathological" inputs are characterised by a syntactic pattern and by a > semantic property. Why do you even think he knows which one he is > talking about today? > I'm just summarising PO's argument so that others can understand where he is coming from. You can poke holes in the argument, of course, but to try to do that at the same time as summarising it would be unfiar and counter-productive.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-20 00:01 +0100 |
| Message-ID | <877dfc891e.fsf@bsb.me.uk> |
| In reply to | #39576 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >> > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> >> On 2021-09-18 16:32, olcott wrote: >> >> >> >> > >> >> > I just defeated Rice's theorem, the other details are for another day. >> >> How exactly have you managed to do that? >> >> >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> >> decision at all regarding halting. >> >> >> > We construct two halt deciders, which are known to be correct, other >> > than for "pathological" inputs. When fed such a "pathological" input, >> > one returns true and the other returns false. >> > >> > Therefore using the two halt deciders and selecting the instances where >> > they disagree, we have classified the "pathological inputs", something that >> > Rice's theorem states that cannot be achieved. >> >> Why do you say that? Surely that depends entirely on the parts you put >> in scare quotes. PO (deliberately?) flip-lops between stating that >> "pathological" inputs are characterised by a syntactic pattern and by a >> semantic property. Why do you even think he knows which one he is >> talking about today? >> > I'm just summarising PO's argument so that others can understand where > he is coming from. So help me understand where he is coming from today. Is he wrong because two TMs that decide trivial properties don't refute Rice, or is he wrong because even one would do the job just as well as two? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-09-19 16:23 -0700 |
| Message-ID | <95d4a88f-8fbe-4151-a6bf-c83103d77f1bn@googlegroups.com> |
| In reply to | #39579 |
On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > > On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: > >> Malcolm McLean <malcolm.ar...@gmail.com> writes: > >> > >> > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: > >> >> On 2021-09-18 16:32, olcott wrote: > >> >> > >> >> > > >> >> > I just defeated Rice's theorem, the other details are for another day. > >> >> How exactly have you managed to do that? > >> >> > >> >> Unless you know which is correct, your H1/H pair are unable to reach a > >> >> decision at all regarding halting. > >> >> > >> > We construct two halt deciders, which are known to be correct, other > >> > than for "pathological" inputs. When fed such a "pathological" input, > >> > one returns true and the other returns false. > >> > > >> > Therefore using the two halt deciders and selecting the instances where > >> > they disagree, we have classified the "pathological inputs", something that > >> > Rice's theorem states that cannot be achieved. > >> > >> Why do you say that? Surely that depends entirely on the parts you put > >> in scare quotes. PO (deliberately?) flip-lops between stating that > >> "pathological" inputs are characterised by a syntactic pattern and by a > >> semantic property. Why do you even think he knows which one he is > >> talking about today? > >> > > I'm just summarising PO's argument so that others can understand where > > he is coming from. > So help me understand where he is coming from today. Is he wrong > because two TMs that decide trivial properties don't refute Rice, or is > he wrong because even one would do the job just as well as two? > The snag I see is that the two machines cannot be built, unless we define "pathological input" in a very narrow way, so narrow that it doesn't constitute one of the properties Rice was talking about. But there might be other weaknesses in the argument.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-20 00:37 +0100 |
| Message-ID | <87y27s6ssl.fsf@bsb.me.uk> |
| In reply to | #39581 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >> > On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >> >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >> >> >> > On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >> >> >> On 2021-09-18 16:32, olcott wrote: >> >> >> >> >> >> > >> >> >> > I just defeated Rice's theorem, the other details are for another day. >> >> >> How exactly have you managed to do that? >> >> >> >> >> >> Unless you know which is correct, your H1/H pair are unable to reach a >> >> >> decision at all regarding halting. >> >> >> >> >> > We construct two halt deciders, which are known to be correct, other >> >> > than for "pathological" inputs. When fed such a "pathological" input, >> >> > one returns true and the other returns false. >> >> > >> >> > Therefore using the two halt deciders and selecting the instances where >> >> > they disagree, we have classified the "pathological inputs", something that >> >> > Rice's theorem states that cannot be achieved. >> >> >> >> Why do you say that? Surely that depends entirely on the parts you put >> >> in scare quotes. PO (deliberately?) flip-lops between stating that >> >> "pathological" inputs are characterised by a syntactic pattern and by a >> >> semantic property. Why do you even think he knows which one he is >> >> talking about today? >> >> >> > I'm just summarising PO's argument so that others can understand where >> > he is coming from. >> >> So help me understand where he is coming from today. Is he wrong >> because two TMs that decide trivial properties don't refute Rice, or is >> he wrong because even one would do the job just as well as two? >> > The snag I see is that the two machines cannot be built, unless we > define "pathological input" in a very narrow way, so narrow that it > doesn't constitute one of the properties Rice was talking about. That does not help me understand where he is coming from. Is that what he is doing today? You are not summarising his argument, but flattering it by suggesting PO means something (one thing) by it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-19 20:49 -0500 |
| Message-ID | <77OdndEx-cAoddr8nZ2dnUU7-QOdnZ2d@giganews.com> |
| In reply to | #39582 |
On 9/19/2021 6:37 PM, Ben Bacarisse wrote: > Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > >> On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: >>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>> >>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>> >>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >>>>>>> On 2021-09-18 16:32, olcott wrote: >>>>>>> >>>>>>>> >>>>>>>> I just defeated Rice's theorem, the other details are for another day. >>>>>>> How exactly have you managed to do that? >>>>>>> >>>>>>> Unless you know which is correct, your H1/H pair are unable to reach a >>>>>>> decision at all regarding halting. >>>>>>> >>>>>> We construct two halt deciders, which are known to be correct, other >>>>>> than for "pathological" inputs. When fed such a "pathological" input, >>>>>> one returns true and the other returns false. >>>>>> >>>>>> Therefore using the two halt deciders and selecting the instances where >>>>>> they disagree, we have classified the "pathological inputs", something that >>>>>> Rice's theorem states that cannot be achieved. >>>>> >>>>> Why do you say that? Surely that depends entirely on the parts you put >>>>> in scare quotes. PO (deliberately?) flip-lops between stating that >>>>> "pathological" inputs are characterised by a syntactic pattern and by a >>>>> semantic property. Why do you even think he knows which one he is >>>>> talking about today? >>>>> >>>> I'm just summarising PO's argument so that others can understand where >>>> he is coming from. >>> >>> So help me understand where he is coming from today. Is he wrong >>> because two TMs that decide trivial properties don't refute Rice, or is >>> he wrong because even one would do the job just as well as two? >>> >> The snag I see is that the two machines cannot be built, unless we >> define "pathological input" in a very narrow way, so narrow that it >> doesn't constitute one of the properties Rice was talking about. > > That does not help me understand where he is coming from. Is that what > he is doing today? > > You are not summarising his argument, but flattering it by suggesting PO > means something (one thing) by it. > He summed it up accurately. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-20 10:54 +0100 |
| Message-ID | <87ee9j7ess.fsf@bsb.me.uk> |
| In reply to | #39587 |
olcott <NoOne@NoWhere.com> writes: > On 9/19/2021 6:37 PM, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >> >>> On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: >>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>> >>>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>> >>>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >>>>>>>> On 2021-09-18 16:32, olcott wrote: >>>>>>>> >>>>>>>>> >>>>>>>>> I just defeated Rice's theorem, the other details are for another day. >>>>>>>> How exactly have you managed to do that? >>>>>>>> >>>>>>>> Unless you know which is correct, your H1/H pair are unable to reach a >>>>>>>> decision at all regarding halting. >>>>>>>> >>>>>>> We construct two halt deciders, which are known to be correct, other >>>>>>> than for "pathological" inputs. When fed such a "pathological" input, >>>>>>> one returns true and the other returns false. >>>>>>> >>>>>>> Therefore using the two halt deciders and selecting the instances where >>>>>>> they disagree, we have classified the "pathological inputs", something that >>>>>>> Rice's theorem states that cannot be achieved. >>>>>> >>>>>> Why do you say that? Surely that depends entirely on the parts you put >>>>>> in scare quotes. PO (deliberately?) flip-lops between stating that >>>>>> "pathological" inputs are characterised by a syntactic pattern and by a >>>>>> semantic property. Why do you even think he knows which one he is >>>>>> talking about today? >>>>>> >>>>> I'm just summarising PO's argument so that others can understand where >>>>> he is coming from. >>>> >>>> So help me understand where he is coming from today. Is he wrong >>>> because two TMs that decide trivial properties don't refute Rice, or is >>>> he wrong because even one would do the job just as well as two? >>>> >>> The snag I see is that the two machines cannot be built, unless we >>> define "pathological input" in a very narrow way, so narrow that it >>> doesn't constitute one of the properties Rice was talking about. >> That does not help me understand where he is coming from. Is that what >> he is doing today? >> >> You are not summarising his argument, but flattering it by suggesting PO >> means something (one thing) by it. > > He summed it up accurately. ... by leaving out the important bit. I note you too will not commit to saying which mistake you are making today but that is likely just because you have no idea what I'm saying. Let me try again: are you wrong because the property is trivial (in the technical sense) or wrong because it is not trivial and either of the two functions would contravene the halting theorem (what you incorrectly describe as "refuting") and therefore also Rice's theorem? I.e. is your recent plan trivial or pointless? At this point you should inject that quote of mine you are so enamoured with. Maybe you'll get what it means this time. I can't remember the details but it's something like "any algorithm that decides non-halting in already a halt decider". Mind you, since you've now moved on to deliberate, direct, lying to confuse the bigger picture (i.e. what the halting problem is actually about) I'm not sure these details are worth discussing anymore. Which of "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many times." "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many times." Is true and which is, or was, a lie? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 08:58 -0500 |
| Message-ID | <xPudnZ8XN8DrDtX8nZ2dnUU7-THNnZ2d@giganews.com> |
| In reply to | #39597 |
On 9/20/2021 4:54 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/19/2021 6:37 PM, Ben Bacarisse wrote: >>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >>> >>>> On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: >>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>> >>>>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>>> >>>>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote: >>>>>>>>> On 2021-09-18 16:32, olcott wrote: >>>>>>>>> >>>>>>>>>> >>>>>>>>>> I just defeated Rice's theorem, the other details are for another day. >>>>>>>>> How exactly have you managed to do that? >>>>>>>>> >>>>>>>>> Unless you know which is correct, your H1/H pair are unable to reach a >>>>>>>>> decision at all regarding halting. >>>>>>>>> >>>>>>>> We construct two halt deciders, which are known to be correct, other >>>>>>>> than for "pathological" inputs. When fed such a "pathological" input, >>>>>>>> one returns true and the other returns false. >>>>>>>> >>>>>>>> Therefore using the two halt deciders and selecting the instances where >>>>>>>> they disagree, we have classified the "pathological inputs", something that >>>>>>>> Rice's theorem states that cannot be achieved. >>>>>>> >>>>>>> Why do you say that? Surely that depends entirely on the parts you put >>>>>>> in scare quotes. PO (deliberately?) flip-lops between stating that >>>>>>> "pathological" inputs are characterised by a syntactic pattern and by a >>>>>>> semantic property. Why do you even think he knows which one he is >>>>>>> talking about today? >>>>>>> >>>>>> I'm just summarising PO's argument so that others can understand where >>>>>> he is coming from. >>>>> >>>>> So help me understand where he is coming from today. Is he wrong >>>>> because two TMs that decide trivial properties don't refute Rice, or is >>>>> he wrong because even one would do the job just as well as two? >>>>> >>>> The snag I see is that the two machines cannot be built, unless we >>>> define "pathological input" in a very narrow way, so narrow that it >>>> doesn't constitute one of the properties Rice was talking about. >>> That does not help me understand where he is coming from. Is that what >>> he is doing today? >>> >>> You are not summarising his argument, but flattering it by suggesting PO >>> means something (one thing) by it. >> >> He summed it up accurately. > > ... by leaving out the important bit. I note you too will not commit to > saying which mistake you are making today but that is likely just > because you have no idea what I'm saying. Let me try again: are you > wrong because the property is trivial (in the technical sense) or wrong > because it is not trivial and either of the two functions would > contravene the halting theorem (what you incorrectly describe as > "refuting") and therefore also Rice's theorem? I.e. is your recent plan > trivial or pointless? > "This sentence is not true" cannot be correctly evaluated as true or false because it contradicts itself. "This sentence is not true: 2 + 3 = 7" is true and does not congtradict itself. The same thing goes for Olcott H1/H on input (P,P) and Linz H/Ĥ.qx on input ⟨Ĥ⟩ ⟨Ĥ⟩ > At this point you should inject that quote of mine you are so enamoured > with. Maybe you'll get what it means this time. I can't remember the > details but it's something like "any algorithm that decides non-halting > in already a halt decider". > > Mind you, since you've now moved on to deliberate, direct, lying to > confuse the bigger picture (i.e. what the halting problem is actually > about) I'm not sure these details are worth discussing anymore. > > Which of > > "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many times." > > "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many times." > > Is true and which is, or was, a lie? > -- 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-09-20 19:02 -0400 |
| Message-ID | <gq82J.30303$6u6.5889@fx03.iad> |
| In reply to | #39601 |
On 9/20/21 9:58 AM, olcott wrote: > On 9/20/2021 4:54 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/19/2021 6:37 PM, Ben Bacarisse wrote: >>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >>>> >>>>> On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote: >>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>> >>>>>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote: >>>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>>>> >>>>>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. >>>>>>>>> Isaak wrote: >>>>>>>>>> On 2021-09-18 16:32, olcott wrote: >>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> I just defeated Rice's theorem, the other details are for >>>>>>>>>>> another day. >>>>>>>>>> How exactly have you managed to do that? >>>>>>>>>> >>>>>>>>>> Unless you know which is correct, your H1/H pair are unable to >>>>>>>>>> reach a >>>>>>>>>> decision at all regarding halting. >>>>>>>>>> >>>>>>>>> We construct two halt deciders, which are known to be correct, >>>>>>>>> other >>>>>>>>> than for "pathological" inputs. When fed such a "pathological" >>>>>>>>> input, >>>>>>>>> one returns true and the other returns false. >>>>>>>>> >>>>>>>>> Therefore using the two halt deciders and selecting the >>>>>>>>> instances where >>>>>>>>> they disagree, we have classified the "pathological inputs", >>>>>>>>> something that >>>>>>>>> Rice's theorem states that cannot be achieved. >>>>>>>> >>>>>>>> Why do you say that? Surely that depends entirely on the parts >>>>>>>> you put >>>>>>>> in scare quotes. PO (deliberately?) flip-lops between stating that >>>>>>>> "pathological" inputs are characterised by a syntactic pattern >>>>>>>> and by a >>>>>>>> semantic property. Why do you even think he knows which one he is >>>>>>>> talking about today? >>>>>>>> >>>>>>> I'm just summarising PO's argument so that others can understand >>>>>>> where >>>>>>> he is coming from. >>>>>> >>>>>> So help me understand where he is coming from today. Is he wrong >>>>>> because two TMs that decide trivial properties don't refute Rice, >>>>>> or is >>>>>> he wrong because even one would do the job just as well as two? >>>>>> >>>>> The snag I see is that the two machines cannot be built, unless we >>>>> define "pathological input" in a very narrow way, so narrow that it >>>>> doesn't constitute one of the properties Rice was talking about. >>>> That does not help me understand where he is coming from. Is that what >>>> he is doing today? >>>> >>>> You are not summarising his argument, but flattering it by >>>> suggesting PO >>>> means something (one thing) by it. >>> >>> He summed it up accurately. >> >> ... by leaving out the important bit. I note you too will not commit to >> saying which mistake you are making today but that is likely just >> because you have no idea what I'm saying. Let me try again: are you >> wrong because the property is trivial (in the technical sense) or wrong >> because it is not trivial and either of the two functions would >> contravene the halting theorem (what you incorrectly describe as >> "refuting") and therefore also Rice's theorem? I.e. is your recent plan >> trivial or pointless? >> > > "This sentence is not true" cannot be correctly evaluated as true or > false because it contradicts itself. > > "This sentence is not true: 2 + 3 = 7" is true and does not congtradict > itself. > > The same thing goes for > Olcott H1/H on input (P,P) > and Linz H/Ĥ.qx on input ⟨Ĥ⟩ ⟨Ĥ⟩ No, it isn't. The question that H needs to answer is "Does the machine and input given as a represented by the input to the decider Halt in finite time or never Halt?" Since to pose this question, The decider needs to have been fully defined, and thus the machine H^ is also fully defined, this ALWAYS has a definite answer. Since H and H^ are definitely defined, the output of H (<H^>, <H^>) is defined by those definitions, and the behavior of H^ is also definitely defined. FAIL. Since you claim that your H will answer Non-Halting when given H(<H^>,<H^>) then by the definition of H^, it will Halt. NONE of that can't be correctly evaluated unless you have LIED about having defined your code of H. PERIOD. Your faulty arguement is based on changing the code for H after the fact to allow it to possibly give some other answer. THAT is not allowed.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-19 20:21 -0500 |
| Message-ID | <GdSdnbDQ5umIf9r8nZ2dnUU7-UednZ2d@giganews.com> |
| In reply to | #39581 |
On 9/19/2021 6:23 PM, Malcolm McLean wrote:
> On Monday, 20 September 2021 at 00:01:19 UTC+1, Ben Bacarisse wrote:
>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>
>>> On Sunday, 19 September 2021 at 22:38:41 UTC+1, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>
>>>>> On Saturday, 18 September 2021 at 23:55:52 UTC+1, André G. Isaak wrote:
>>>>>> On 2021-09-18 16:32, olcott wrote:
>>>>>>
>>>>>>>
>>>>>>> I just defeated Rice's theorem, the other details are for another day.
>>>>>> How exactly have you managed to do that?
>>>>>>
>>>>>> Unless you know which is correct, your H1/H pair are unable to reach a
>>>>>> decision at all regarding halting.
>>>>>>
>>>>> We construct two halt deciders, which are known to be correct, other
>>>>> than for "pathological" inputs. When fed such a "pathological" input,
>>>>> one returns true and the other returns false.
>>>>>
>>>>> Therefore using the two halt deciders and selecting the instances where
>>>>> they disagree, we have classified the "pathological inputs", something that
>>>>> Rice's theorem states that cannot be achieved.
>>>>
>>>> Why do you say that? Surely that depends entirely on the parts you put
>>>> in scare quotes. PO (deliberately?) flip-lops between stating that
>>>> "pathological" inputs are characterised by a syntactic pattern and by a
>>>> semantic property. Why do you even think he knows which one he is
>>>> talking about today?
>>>>
>>> I'm just summarising PO's argument so that others can understand where
>>> he is coming from.
>> So help me understand where he is coming from today. Is he wrong
>> because two TMs that decide trivial properties don't refute Rice, or is
>> he wrong because even one would do the job just as well as two?
>>
> The snag I see is that the two machines cannot be built, unless we define
> "pathological input" in a very narrow way, so narrow that it doesn't constitute
> one of the properties Rice was talking about.
>
> But there might be other weaknesses in the argument.
>
The two machines are already fully operational.
H1 is merely a copy of H.
H has pathological self-reference and H1 does not because P calls H yet
never calls H1.
void P1(u32 x)
{
if (H(x, x))
HERE: goto HERE;
}
u32 PSR_Olcott_2004(u32 P)
{
return H1(P,P) != H(P,P);
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-20 11:00 +0100 |
| Message-ID | <875yuv7ei8.fsf@bsb.me.uk> |
| In reply to | #39585 |
olcott <NoOne@NoWhere.com> writes: > The two machines are already fully operational. > H1 is merely a copy of H. It's deceptive to call your secret C functions "machines". It hints at the formality a clarity of Turing machines, but a TM that is a copy of another will have exactly the same transfer function (i.e. it will never compute a different result). -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 7 of 13 — ← Prev page 1 … 5 6 [7] 8 9 … 13 Next page →
Back to top | Article view | comp.theory
csiph-web