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 12 of 13 — ← Prev page 1 … 10 11 [12] 13 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-20 10:54 +0100 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <87bl4n7erw.fsf@bsb.me.uk> |
| In reply to | #39588 |
olcott <NoOne@NoWhere.com> writes: > On 9/19/2021 6:43 PM, Ben Bacarisse wrote: >> But things have moved on because you are now just lying about >> something. As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to >> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions >> to H.qn many times". >> Putting aside how many times you've said each of these, which one is >> true and which one is the lie? > > Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never > halts unless it aborts the simulation of its input. Won't answer? I am not surprised. Here are the two things you've been very insistent upon (to the point of childish rudeness): "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." Which is, or was, true and which is, or was, a lie? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 09:02 -0500 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <A6Gdnc2zas3-CdX8nZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #39598 |
On 9/20/2021 4:54 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/19/2021 6:43 PM, Ben Bacarisse wrote: > >>> But things have moved on because you are now just lying about >>> something. As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to >>> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions >>> to H.qn many times". >>> Putting aside how many times you've said each of these, which one is >>> true and which one is the lie? >> >> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never >> halts unless it aborts the simulation of its input. > > Won't answer? I am not surprised. Here are the two things you've been > very insistent upon (to the point of childish rudeness): > You are bright enough to know that questions having false presuppositions do not have any correct answer. > "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." > > Which is, or was, true and which is, or was, a lie? > Self-contradictory expressions of language seem to be over your head. H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory -- 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 23:05 +0100 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <87ilyu6gxz.fsf@bsb.me.uk> |
| In reply to | #39602 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 4:54 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/19/2021 6:43 PM, Ben Bacarisse wrote: >> >>>> But things have moved on because you are now just lying about >>>> something. As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to >>>> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions >>>> to H.qn many times". >>>> Putting aside how many times you've said each of these, which one is >>>> true and which one is the lie? >>> >>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never >>> halts unless it aborts the simulation of its input. >> >> Won't answer? I am not surprised. Here are the two things you've been >> very insistent upon (to the point of childish rudeness): > > You are bright enough to know that questions having false > presuppositions do not have any correct answer. > >> "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." >> >> Which is, or was, true and which is, or was, a lie? > > Self-contradictory expressions of language seem to be over your head. > > H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory > H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory No, you can't wriggle out of it by pretending there is a difference like that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy. Your exact words in reply to my saying this were: | I have already said that a bunch of times yet you did not notice | because you diligently want to remain focused in disagreement mode. But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" "many times". On which occasions were you lying? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 18:37 -0500 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <U9udncLaM-LNhtT8nZ2dnUU7-fvNnZ2d@giganews.com> |
| In reply to | #39627 |
On 9/20/2021 5:05 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/20/2021 4:54 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/19/2021 6:43 PM, Ben Bacarisse wrote: >>> >>>>> But things have moved on because you are now just lying about >>>>> something. As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to >>>>> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions >>>>> to H.qn many times". >>>>> Putting aside how many times you've said each of these, which one is >>>>> true and which one is the lie? >>>> >>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never >>>> halts unless it aborts the simulation of its input. >>> >>> Won't answer? I am not surprised. Here are the two things you've been >>> very insistent upon (to the point of childish rudeness): >> >> You are bright enough to know that questions having false >> presuppositions do not have any correct answer. >> >>> "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." >>> >>> Which is, or was, true and which is, or was, a lie? >> >> Self-contradictory expressions of language seem to be over your head. >> >> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory >> H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory > > No, you can't wriggle out of it by pretending there is a difference like > that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy. > Your exact words in reply to my saying this were: > > | I have already said that a bunch of times yet you did not notice > | because you diligently want to remain focused in disagreement mode. > > But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" > "many times". On which occasions were you lying? > I never said the latter for one reason that I never include q0, you must have gotten confused. H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy because Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn -- 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-21 01:43 +0100 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <871r5i69nj.fsf@bsb.me.uk> |
| In reply to | #39641 |
olcott <NoOne@NoWhere.com> writes:
> On 9/20/2021 5:05 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 4:54 AM, Ben Bacarisse wrote:
>>>> "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."
>>>>
>>>> Which is, or was, true and which is, or was, a lie?
>>>
>>> Self-contradictory expressions of language seem to be over your head.
>>>
>>> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory
>>> H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory
>>
>> No, you can't wriggle out of it by pretending there is a difference like
>> that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy.
>> Your exact words in reply to my saying this were:
>>
>> | I have already said that a bunch of times yet you did not notice
>> | because you diligently want to remain focused in disagreement mode.
>>
>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn"
>> "many times". On which occasions were you lying?
>
> I never said the latter for one reason that I never include q0, you
> must have gotten confused.
Liar. Let's not allow your dishonesty to get lost in your smoke screen
replies. On the 18th Sep I said
"You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to H.qy"
and you called that a fib. But I only said that you agreed because on
the 6th you had explicitly done so:
Me: "If your H has any pretensions of being a halt decider, it should
accept that string: H.q0 <H^><H^> |- H.qy"
You: "I have already said that a bunch of times yet you did not notice
because you diligently want to remain focused in disagreement
mode."
You see? There you are saying I am fibbing about you agreeing to
something you agreed to less that two weeks earlier. You simply have no
concept of what being honest and truthful means. You will say whatever
you need to say to keep the boasting going.
But that's only lie number one. Let's look and anther new lie in this
very post. Re-quoting from above:
>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn"
>> "many times". On which occasions were you lying?
>
> I never said the latter for one reason that I never include q0, you
> must have gotten confused.
So what is "the latter" that you now say you never said? Surely it can
only mean "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn", something you know you
never said that because you never include q0. But here is, word for
word, what you said on the 18th, right after accusing me of fibbing:
"Furthermore I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many
times."
So it's a bold-face lie to say you "never said the latter for one reason
that I never include q0". There you are saying it, q0 included, while
having the brass neck to call me a liar.
And as for your dishonest and, frankly, cowardly ploy of trying to
pretend that "H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to ..." means something different to
"H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to ..." words fail me. What you think H is
transitioning from? Some unspecified state other than q0? No, "H ⟨Ĥ⟩
⟨Ĥ⟩ transitions to ..." means that H does so from it's initial state, or
the notation is simply meaningless noise. (Mind you, meaningless noise
might be your intention. I'm sure you'll say so if that's the case.)
> H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy because Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
What do you think H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy means? That H transitions to H.qy
(on that input) from state H.q67? Don't be silly.
Anyway, dishonest notational ploys aside, you explicitly agreed to the
statement you called me a liar for saying you agreed to it. How can you
hold you head up in public?
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 19:51 -0500 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <262dnRxYQsw_sdT8nZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #39645 |
On 9/20/2021 7:43 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/20/2021 5:05 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/20/2021 4:54 AM, Ben Bacarisse wrote: > >>>>> "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." >>>>> >>>>> Which is, or was, true and which is, or was, a lie? >>>> >>>> Self-contradictory expressions of language seem to be over your head. >>>> >>>> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory >>>> H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory >>> >>> No, you can't wriggle out of it by pretending there is a difference like >>> that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy. >>> Your exact words in reply to my saying this were: >>> >>> | I have already said that a bunch of times yet you did not notice >>> | because you diligently want to remain focused in disagreement mode. >>> >>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" >>> "many times". On which occasions were you lying? >> >> I never said the latter for one reason that I never include q0, you >> must have gotten confused. > > Liar. Let's not allow your dishonesty to get lost in your smoke screen > replies. On the 18th Sep I said > > "You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to H.qy" > > and you called that a fib. But I only said that you agreed because on > the 6th you had explicitly done so: > > Me: "If your H has any pretensions of being a halt decider, it should > accept that string: H.q0 <H^><H^> |- H.qy" > > You: "I have already said that a bunch of times yet you did not notice > because you diligently want to remain focused in disagreement > mode." > > You see? There you are saying I am fibbing about you agreeing to > something you agreed to less that two weeks earlier. You simply have no > concept of what being honest and truthful means. You will say whatever > you need to say to keep the boasting going. > > But that's only lie number one. Let's look and anther new lie in this > very post. Re-quoting from above: > >>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" >>> "many times". On which occasions were you lying? >> >> I never said the latter for one reason that I never include q0, you >> must have gotten confused. > > So what is "the latter" that you now say you never said? Surely it can > only mean "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn", something you know you > never said that because you never include q0. But here is, word for > word, what you said on the 18th, right after accusing me of fibbing: > H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy because Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn It is not really that hard ... -- 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-21 03:10 +0100 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <878rzq4r1g.fsf@bsb.me.uk> |
| In reply to | #39647 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 7:43 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/20/2021 5:05 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/20/2021 4:54 AM, Ben Bacarisse wrote: >> >>>>>> "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." >>>>>> >>>>>> Which is, or was, true and which is, or was, a lie? >>>>> >>>>> Self-contradictory expressions of language seem to be over your head. >>>>> >>>>> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory >>>>> H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory >>>> >>>> No, you can't wriggle out of it by pretending there is a difference like >>>> that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy. >>>> Your exact words in reply to my saying this were: >>>> >>>> | I have already said that a bunch of times yet you did not notice >>>> | because you diligently want to remain focused in disagreement mode. >>>> >>>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" >>>> "many times". On which occasions were you lying? >>> >>> I never said the latter for one reason that I never include q0, you >>> must have gotten confused. >> >> Liar. Let's not allow your dishonesty to get lost in your smoke screen >> replies. On the 18th Sep I said >> "You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to H.qy" >> and you called that a fib. But I only said that you agreed because on >> the 6th you had explicitly done so: >> Me: "If your H has any pretensions of being a halt decider, it should >> accept that string: H.q0 <H^><H^> |- H.qy" >> You: "I have already said that a bunch of times yet you did not notice >> because you diligently want to remain focused in disagreement >> mode." >> You see? There you are saying I am fibbing about you agreeing to >> something you agreed to less that two weeks earlier. You simply have no >> concept of what being honest and truthful means. You will say whatever >> you need to say to keep the boasting going. >> But that's only lie number one. Let's look and anther new lie in this >> very post. Re-quoting from above: >> >>>> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" >>>> "many times". On which occasions were you lying? >>> >>> I never said the latter for one reason that I never include q0, you >>> must have gotten confused. >> >> So what is "the latter" that you now say you never said? Surely it can >> only mean "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn", something you know you >> never said that because you never include q0. But here is, word for >> word, what you said on the 18th, right after accusing me of fibbing: You cut the evidence of your latest lie. My post continued >> "Furthermore I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many >> times." >> >> So it's a bold-face lie to say you "never said the latter for one reason >> that I never include q0". There you are saying it, q0 included, while >> having the brass neck to call me a liar. You have a depressingly casual reaction to having your lies laid out like this. You don't even seem to care that you've been caught being so dishonest. Has it just become a part of how you do things now? > H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy because Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn > > It is not really that hard ... But while you continue to lie with impunity, no one should take notice of a thing you say. Tomorrow you might call me a liar for saying exactly what you've said just now. You might deny ever having said it. How can any debate happen if, when you don't like the way things are going, you are prepared to say the opposite and accuse anyone who reminds you of your former claims of fibbing? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-20 22:27 -0400 |
| Subject | Re: Why do theory of computation problems require pure functions? [defeating Rice] |
| Message-ID | <4qb2J.17547$dI3.11387@fx10.iad> |
| In reply to | #39641 |
On 9/20/21 7:37 PM, olcott wrote: > On 9/20/2021 5:05 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/20/2021 4:54 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/19/2021 6:43 PM, Ben Bacarisse wrote: >>>> >>>>>> But things have moved on because you are now just lying about >>>>>> something. As well as "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to >>>>>> H.qy" you are telling me that "I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ >>>>>> transitions >>>>>> to H.qn many times". >>>>>> Putting aside how many times you've said each of these, which one is >>>>>> true and which one is the lie? >>>>> >>>>> Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does correctly decide that its input never >>>>> halts unless it aborts the simulation of its input. >>>> >>>> Won't answer? I am not surprised. Here are the two things you've been >>>> very insistent upon (to the point of childish rudeness): >>> >>> You are bright enough to know that questions having false >>> presuppositions do not have any correct answer. >>> >>>> "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." >>>> >>>> Which is, or was, true and which is, or was, a lie? >>> >>> Self-contradictory expressions of language seem to be over your head. >>> >>> H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ is self-contradictory >>> H ⟨Ĥ⟩ ⟨Ĥ⟩ is not self-contradictory >> >> No, you can't wriggle out of it by pretending there is a difference like >> that because you also wholeheartedly agreed that H.q0 <H^><H^> |- H.qy. >> Your exact words in reply to my saying this were: >> >> | I have already said that a bunch of times yet you did not notice >> | because you diligently want to remain focused in disagreement mode. >> >> But you have, apparently, also said "H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn" >> "many times". On which occasions were you lying? >> > > I never said the latter for one reason that I never include q0, you must > have gotten confused. > > H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy because Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn > Except here your 'H' isn't really H, it is your POOP-H1 that you CLAIM is the equivalent of Linz-H, but since POOP-H is the actual machine that your equivalent to Linz-H^ is built on and POOP-H and POOP-H1 act differently and thus can NOT be Computationally Equivalent, POOP-H1 is NOT the equivalent of Linz-H FALSE CLAIM, so bad, it is really a LIE. You really need to label your terms as you have so badly mangled what means what. It is so bad it really qualifies as being deceptive. Anytime someone gets the wrong meaning for 'H', it is really YOUR fault.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 18:32 -0400 |
| Message-ID | <qOt1J.169009$T_8.52065@fx48.iad> |
| In reply to | #39475 |
On 9/18/21 5:54 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy. > > Yet you keep telling us that and "exact copy" of H transitions to the > rejecting state when presented with that input of the tape. Identical > state transition functions determine the exact same sequence of machine > configurations given identical tape contents. > This is Olcotts new double speak. He has destroyed the meaning of H. I think in the above he actually means that PO-H1 goes to the accepting state, Which is fine, since Linz-H^/PO-P was built from PO-H, not PO-H1, so PO-H1 is allowed to get the answer right, but then he says that PO-H1 is actually the equivalent of Linz-H even though Linz-H^/PO-P wasn't built from it, just because it is a copy of the machine that it was built from. Just showing that PO-H1/H is not a Computation and is disqualified for the title of Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-19 22:07 +0100 |
| Message-ID | <87h7eg9svd.fsf@bsb.me.uk> |
| In reply to | #39491 |
Richard Damon <Richard@Damon-Family.org> writes: > On 9/18/21 5:54 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy. >> >> Yet you keep telling us that and "exact copy" of H transitions to the >> rejecting state when presented with that input of the tape. Identical >> state transition functions determine the exact same sequence of machine >> configurations given identical tape contents. > > This is Olcotts new double speak. > > He has destroyed the meaning of H. I won't let him. If he writes ⟨Ĥ⟩ he is talking about a Turing machine (an actual one) that he (confusingly) chooses to call H. The notation is meaningless in any other context. That TM must have a single accepting state and a single rejecting state, or the ^ is meaningless. The <>s relate to some agreed encoding of TMs in the tape alphabet of H or it's just so much smoke and mirrors. If he does not mean these things when he writes this notation, he is being dishonest. And if he does mean these things he keeps making false statements. I can't know which one is false (H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ |- H.qy or or Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ |- Ĥ.qn) but they can't both be true. For the moment I have to assume he is making false statements out of ignorance. It could be that he is being dishonest and not talking about Turing machines at all, but he'd have to admit that first. > I think in the above he actually means that PO-H1 goes to the accepting > state, H1 is some junk hidden C code, is it not? I've stopped talking about his junk hidden C code other than to say he should post it. The above says that some Turing machine H, with one accepting and one rejecting state, transitions to its accepting state when presented with an initial tape containing the agreed encoding of that TM's "hat" version repeated twice on the tape. If he does not mean that, he should stop saying it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 14:55 -0400 |
| Message-ID | <fCq1J.13872$Im6.8113@fx09.iad> |
| In reply to | #39432 |
On 9/18/21 12:39 PM, olcott wrote: > On 9/18/2021 11:10 AM, André G. Isaak wrote: >> On 2021-09-18 09:17, olcott wrote: >>> On 9/18/2021 10:04 AM, André G. Isaak wrote: >>>> On 2021-09-18 07:57, olcott wrote: >>>> >>>>> I either must stick with C/x86 code or write a RASP machine, the >>>>> only way that my key insights can possible be fully understood is >>>>> to have every single detail as fully operational code such that we >>>>> can simply see what it does and thus not merely imagine what it >>>>> would do. >>>> >>>> Why do you insist on continuously repeating this rather ridiculous >>>> claim? >>>> >>>> When working with Turing Machines one doesn't need to 'merely >>>> imagine what it would do.' One can see *exactly* what it does. >>>> >>>> André >>>> >>> >>> When H is defined as a simulating halt decider then H correctly >>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >> >> And this statement relates to my post how exactly? >> >> André >> >> > > How can [One can see *exactly* what it does] show that my claim that > simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly decide > the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ? > > > The fact that H(<H^>,<H^>) says non-halting, while the machine H^(<H^>) which is the machine that the question refers to is Halting? The decision of Non-Halting is an incorrect decision for in input that represents a Halting Computation. DEFINITION.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 14:06 -0500 |
| Message-ID | <RPudnROyVaoBpdv8nZ2dnUU7-QvNnZ2d@giganews.com> |
| In reply to | #39440 |
On 9/18/2021 1:55 PM, Richard Damon wrote: > On 9/18/21 12:39 PM, olcott wrote: >> On 9/18/2021 11:10 AM, André G. Isaak wrote: >>> On 2021-09-18 09:17, olcott wrote: >>>> On 9/18/2021 10:04 AM, André G. Isaak wrote: >>>>> On 2021-09-18 07:57, olcott wrote: >>>>> >>>>>> I either must stick with C/x86 code or write a RASP machine, the >>>>>> only way that my key insights can possible be fully understood is >>>>>> to have every single detail as fully operational code such that we >>>>>> can simply see what it does and thus not merely imagine what it >>>>>> would do. >>>>> >>>>> Why do you insist on continuously repeating this rather ridiculous >>>>> claim? >>>>> >>>>> When working with Turing Machines one doesn't need to 'merely >>>>> imagine what it would do.' One can see *exactly* what it does. >>>>> >>>>> André >>>>> >>>> >>>> When H is defined as a simulating halt decider then H correctly >>>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >>> >>> And this statement relates to my post how exactly? >>> >>> André >>> >>> >> >> How can [One can see *exactly* what it does] show that my claim that >> simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly decide >> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ? >> >> >> > > The fact that H(<H^>,<H^>) says non-halting, while the machine H^(<H^>) > which is the machine that the question refers to is Halting? > > The decision of Non-Halting is an incorrect decision for in input that > represents a Halting Computation. DEFINITION. > When H is applied to ⟨Ĥ⟩ ⟨Ĥ⟩ it transitions to H.qy Do you know what it means when H transitions to H.qy ??? H.qy is defined at the bottom of page 318 https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf -- 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 15:40 -0400 |
| Message-ID | <5hr1J.31209$nR3.23823@fx38.iad> |
| In reply to | #39441 |
On 9/18/21 3:06 PM, olcott wrote: > On 9/18/2021 1:55 PM, Richard Damon wrote: >> On 9/18/21 12:39 PM, olcott wrote: >>> On 9/18/2021 11:10 AM, André G. Isaak wrote: >>>> On 2021-09-18 09:17, olcott wrote: >>>>> On 9/18/2021 10:04 AM, André G. Isaak wrote: >>>>>> On 2021-09-18 07:57, olcott wrote: >>>>>> >>>>>>> I either must stick with C/x86 code or write a RASP machine, the >>>>>>> only way that my key insights can possible be fully understood is >>>>>>> to have every single detail as fully operational code such that we >>>>>>> can simply see what it does and thus not merely imagine what it >>>>>>> would do. >>>>>> >>>>>> Why do you insist on continuously repeating this rather ridiculous >>>>>> claim? >>>>>> >>>>>> When working with Turing Machines one doesn't need to 'merely >>>>>> imagine what it would do.' One can see *exactly* what it does. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> When H is defined as a simulating halt decider then H correctly >>>>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >>>> >>>> And this statement relates to my post how exactly? >>>> >>>> André >>>> >>>> >>> >>> How can [One can see *exactly* what it does] show that my claim that >>> simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly decide >>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ? >>> >>> >>> >> >> The fact that H(<H^>,<H^>) says non-halting, while the machine H^(<H^>) >> which is the machine that the question refers to is Halting? >> >> The decision of Non-Halting is an incorrect decision for in input that >> represents a Halting Computation. DEFINITION. >> > > When H is applied to ⟨Ĥ⟩ ⟨Ĥ⟩ it transitions to H.qy > Do you know what it means when H transitions to H.qy ??? Your H has NEVER said that H^(<H^>) is halting, which is what H.qy says. Your H1 says that, but H1 is a different computation than H, as it gives a different answer for the same input. If H went to qy, then H^ would not halt, being an even clearer demonstartion that H was wrong or not a computation. Remember, the Linz specification is what a CORRECT decider would do, it doesn't provide a definition for what the provide H will actually do, that is controlled by its algorithm. > > H.qy is defined at the bottom of page 318 > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > > Right, H,qy is the state that H SHOULD go to if the input specifies a Halting Computation, but your have DEFINED that your H will see an infinite recursion and answer Non-Halting.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 14:52 -0500 |
| Message-ID | <MvWdnRq9n4Pv3tv8nZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #39448 |
On 9/18/2021 2:40 PM, Richard Damon wrote: > > On 9/18/21 3:06 PM, olcott wrote: >> On 9/18/2021 1:55 PM, Richard Damon wrote: >>> On 9/18/21 12:39 PM, olcott wrote: >>>> On 9/18/2021 11:10 AM, André G. Isaak wrote: >>>>> On 2021-09-18 09:17, olcott wrote: >>>>>> On 9/18/2021 10:04 AM, André G. Isaak wrote: >>>>>>> On 2021-09-18 07:57, olcott wrote: >>>>>>> >>>>>>>> I either must stick with C/x86 code or write a RASP machine, the >>>>>>>> only way that my key insights can possible be fully understood is >>>>>>>> to have every single detail as fully operational code such that we >>>>>>>> can simply see what it does and thus not merely imagine what it >>>>>>>> would do. >>>>>>> >>>>>>> Why do you insist on continuously repeating this rather ridiculous >>>>>>> claim? >>>>>>> >>>>>>> When working with Turing Machines one doesn't need to 'merely >>>>>>> imagine what it would do.' One can see *exactly* what it does. >>>>>>> >>>>>>> André >>>>>>> >>>>>> >>>>>> When H is defined as a simulating halt decider then H correctly >>>>>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>> >>>>> And this statement relates to my post how exactly? >>>>> >>>>> André >>>>> >>>>> >>>> >>>> How can [One can see *exactly* what it does] show that my claim that >>>> simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly decide >>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ? >>>> >>>> >>>> >>> >>> The fact that H(<H^>,<H^>) says non-halting, while the machine H^(<H^>) >>> which is the machine that the question refers to is Halting? >>> >>> The decision of Non-Halting is an incorrect decision for in input that >>> represents a Halting Computation. DEFINITION. >>> >> >> When H is applied to ⟨Ĥ⟩ ⟨Ĥ⟩ it transitions to H.qy >> Do you know what it means when H transitions to H.qy ??? > > Your H has NEVER said that H^(<H^>) is halting, which is what H.qy says. > > Your H1 says that, but H1 is a different computation than H, as it gives > a different answer for the same input. > > If H went to qy, then H^ would not halt, being an even clearer > demonstartion that H was wrong or not a computation. > > Remember, the Linz specification is what a CORRECT decider would do, it > doesn't provide a definition for what the provide H will actually do, > that is controlled by its algorithm. > Olcott C/x86 H1/H is analogous to Linz H/Ĥ In that the first element of the pair does not have the pathological self-reference(Olcott 2004) error and the second element of the pair does have this error. Olcott H1 and Linz H both say halts. Olcott H and Linz Ĥ both say never halts. >> >> H.qy is defined at the bottom of page 318 >> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >> >> > > Right, H,qy is the state that H SHOULD go to if the input specifies a > Halting Computation, but your have DEFINED that your H will see an > infinite recursion and answer Non-Halting. > -- 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 16:15 -0400 |
| Message-ID | <pNr1J.87119$rl3.64294@fx45.iad> |
| In reply to | #39450 |
On 9/18/21 3:52 PM, olcott wrote: > On 9/18/2021 2:40 PM, Richard Damon wrote: >> >> On 9/18/21 3:06 PM, olcott wrote: >>> On 9/18/2021 1:55 PM, Richard Damon wrote: >>>> On 9/18/21 12:39 PM, olcott wrote: >>>>> On 9/18/2021 11:10 AM, André G. Isaak wrote: >>>>>> On 2021-09-18 09:17, olcott wrote: >>>>>>> On 9/18/2021 10:04 AM, André G. Isaak wrote: >>>>>>>> On 2021-09-18 07:57, olcott wrote: >>>>>>>> >>>>>>>>> I either must stick with C/x86 code or write a RASP machine, the >>>>>>>>> only way that my key insights can possible be fully understood is >>>>>>>>> to have every single detail as fully operational code such that we >>>>>>>>> can simply see what it does and thus not merely imagine what it >>>>>>>>> would do. >>>>>>>> >>>>>>>> Why do you insist on continuously repeating this rather ridiculous >>>>>>>> claim? >>>>>>>> >>>>>>>> When working with Turing Machines one doesn't need to 'merely >>>>>>>> imagine what it would do.' One can see *exactly* what it does. >>>>>>>> >>>>>>>> André >>>>>>>> >>>>>>> >>>>>>> When H is defined as a simulating halt decider then H correctly >>>>>>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>>> >>>>>> And this statement relates to my post how exactly? >>>>>> >>>>>> André >>>>>> >>>>>> >>>>> >>>>> How can [One can see *exactly* what it does] show that my claim that >>>>> simulating halt decider H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ does not correctly decide >>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ ? >>>>> >>>>> >>>>> >>>> >>>> The fact that H(<H^>,<H^>) says non-halting, while the machine H^(<H^>) >>>> which is the machine that the question refers to is Halting? >>>> >>>> The decision of Non-Halting is an incorrect decision for in input that >>>> represents a Halting Computation. DEFINITION. >>>> >>> >>> When H is applied to ⟨Ĥ⟩ ⟨Ĥ⟩ it transitions to H.qy >>> Do you know what it means when H transitions to H.qy ??? >> >> Your H has NEVER said that H^(<H^>) is halting, which is what H.qy says. >> >> Your H1 says that, but H1 is a different computation than H, as it gives >> a different answer for the same input. >> >> If H went to qy, then H^ would not halt, being an even clearer >> demonstartion that H was wrong or not a computation. >> >> Remember, the Linz specification is what a CORRECT decider would do, it >> doesn't provide a definition for what the provide H will actually do, >> that is controlled by its algorithm. >> > > Olcott C/x86 H1/H is analogous to Linz H/Ĥ > > In that the first element of the pair does not have the pathological > self-reference(Olcott 2004) error and the second element of the pair > does have this error. > > Olcott H1 and Linz H both say halts. > Olcott H and Linz Ĥ both say never halts. > So Olcott H1/H isn't a computation since it doesn't always produce the same answer when given the same input. FAIL. Note, Linz NEVER says what H actually gives as an answer, as Linz shows that a machine that meets the specification can't exist, and non-existant machines don't answer. Linz says that an H that is correct of Olcott H^ would go to H.qy, just like your H1 does, but doesn't actually say that it does. Since a given H^ defines what H we are taling about, the fact that this H says non-halting says it fails to meet the definition of being a correct Halting Decider. Olcott H^ is built from Olcott H, and Olcott H says H^ doesn't halt but Olcott H^ does haot, so Olcott H was WRONG. Olcott H1 is a DIFFERENT machine, so the fact that Olcott H1 says correctly that Olcott H^ halts doesn't prove anything. All you establish by claiming that Olcott H and Olcott H1 are the same computation is the proof that it isn't actually a computation as it gives different answers for the same input. The DEFINITION of a non-computation. > >>> >>> H.qy is defined at the bottom of page 318 >>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >>> >> >> Right, H,qy is the state that H SHOULD go to if the input specifies a >> Halting Computation, but your have DEFINED that your H will see an >> infinite recursion and answer Non-Halting. >> > >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-18 22:51 +0100 |
| Message-ID | <87ilyxbli9.fsf@bsb.me.uk> |
| In reply to | #39407 |
olcott <NoOne@NoWhere.com> writes: > When H is defined as a simulating halt decider then H correctly > decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. Not according to you. You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to H.qy but you keep telling us an identical computation transitions to the rejecting state. Identical state transition functions determine the same sequence of machine configurations when presented with the same input. There is no "context" for a TM other than the tape and the state. (Please, stop pretending to talk about TMs. You don't know enough about them, and I feel I have to point out the mistakes. What the mistakes are in your secret C code will be guesswork until you post the code.) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 17:00 -0500 |
| Message-ID | <h7ydndcbPtXr_Nv8nZ2dnUU7-IWdnZ2d@giganews.com> |
| In reply to | #39474 |
On 9/18/2021 4:51 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> When H is defined as a simulating halt decider then H correctly >> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. > > Not according to you. You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to > H.qy I never said anything like that so I am stopping at your first fib. Furthermore I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many times. > but you keep telling us an identical computation transitions to the > rejecting state. Identical state transition functions determine the > same sequence of machine configurations when presented with the same > input. There is no "context" for a TM other than the tape and the > state. > > (Please, stop pretending to talk about TMs. You don't know enough about > them, and I feel I have to point out the mistakes. What the mistakes > are in your secret C code will be guesswork until you post the code.) > -- 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-19 23:26 +0100 |
| Message-ID | <87ilyw8amx.fsf@bsb.me.uk> |
| In reply to | #39478 |
olcott <NoOne@NoWhere.com> writes: > On 9/18/2021 4:51 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> When H is defined as a simulating halt decider then H correctly >>> decides the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩. >> Not according to you. You agree that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ should transition to >> H.qy > > I never said anything like that so I am stopping at your first fib. > Furthermore I have repeated H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn many > times. Liar: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many times" [Message-ID: <xo6dnWS9F6hkHKT8nZ2dnUU7-LfNnZ2d@giganews.com>] "H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ correctly transitions to H.qy" [Message-ID: <caKdncaNf93r3dv8nZ2dnUU7-UfNnZ2d@giganews.com>] and when I stated it: || If your H has any pretensions || of being a halt decider, it should accept that string: || || H.q0 <H^><H^> |- H.qy You agreed and claimed to have said so may times: | I have already said that a bunch of times yet you did not notice | because you diligently want to remain focused in disagreement mode. Now you say you repeated many times that H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn. Which is it? On which occasions were lies? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-18 22:45 +0100 |
| Message-ID | <87o88pbls7.fsf@bsb.me.uk> |
| In reply to | #39395 |
Andy Walker <anw@cuboid.co.uk> writes:
> On 18/09/2021 03:40, olcott wrote:
>> Why do theory of computation problems require pure functions?
>
> This hasn't yet had a good answer. IMO, they don't. But
> they do require a level of abstraction that you have thus far been
> trying to evade. Problems require solutions, not "Well, it could
> be /this/, or perhaps /that/ or on the other hand, especially on
> the Monday of a full moon, /something else/. The HP requires us
> to say, of a program/input pair, "this instance terminates" or
> "this instance doesn't terminate", not "well, it might if ...".
> What normally has to be "pure" in a "computation problem" is the
> program, not individual bits thereof. ...
Agreed. But, further, the halting function is a (mathematical) pure
total function from N to {0,1}. This comes from the fact that every N
either does or does not encode a halting computation, something PO has
never unequivocally accepted.
It's therefore irrelevant what "tricks" (like static variable might or
might not be used). What matters is whether the "decider" gets the
right answer for every input and the depends on an initial mutual
agreement about how the inputs are to be specified and what the right
answer is in each case. PO's game is to (a) change the definition of
what the right answer is, and (b) obscure what the "inputs" mean in an
attempt to justify the wrong answer. If you can avoid being sucking
into the details, it's a stupendously silly ploy.
(This is not 100% true as for some reason he recently accepted that the
right answer is indeed right when talking about Turing machines. But
that went horribly wrong so he stopped talking about TMs.)
>> I am trying to write C code that would be acceptable to computer
>> scientists in the field of the theory of computation.
>
> ... Then write it and stop worrying. But you have become
> mired in levels of simulation and [alleged] recursion. A C program
> describes an abstract machine, as defined [not all that well, but
> well enough for our purposes] by the C Standard [qv]. Either work
> within that abstract machine, or extend it in ways that you can
> define [eg, to have arbitrarily large integers]. But if you want
> to apply this program/machine to [eg] the "Linz proof", then you
> need to remember that the edited program/machine that produces
> the contradiction is not an edit of part of your code, but an
> edit of the entire program/machine. That is why people have been
> jumping all over your arguments and saying "But ..., but ..., but
> ..." and going on about purity and computations.
There are undecidable problems that can be specified in term of this
abstract C model. When challenged PO to write a C function that
determines if a function call returns to its caller, he bottled it.
That's because I got to specify what the inputs to the decider mean and
what cases should give a true result and which a false one.
PO's "decider" would have to return false for some calls that return and
he'd try to justify it be pretending that the input means two different
things depending on the context. If the problem is specified by someone
else, this won't wash.
> Incidentally, please, pretty please, forget about 386
> machine code. It really, really doesn't help. It just obscures
> whatever argument you're trying to make. Indeed, it gives the
> impression that obscurity is what you want [which may, of course,
> be the case, but if so then stop wasting everyone's time].
Oh, God, yes please. What a mess to use x86 code. The whole idea is
bonkers because with the limited x86 model he seems to have adopted,
halting is in fact decidable! A paper that started "x86 programs that
don't process unbounded input are decidable" would not go in the "junk"
bin but in the "yeah? so what?" bin.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 17:51 -0400 |
| Message-ID | <fbt1J.39833$2B4.15204@fx04.iad> |
| In reply to | #39471 |
On 9/18/21 5:45 PM, Ben Bacarisse wrote:
> Andy Walker <anw@cuboid.co.uk> writes:
>
>> On 18/09/2021 03:40, olcott wrote:
>>> Why do theory of computation problems require pure functions?
>>
>> This hasn't yet had a good answer. IMO, they don't. But
>> they do require a level of abstraction that you have thus far been
>> trying to evade. Problems require solutions, not "Well, it could
>> be /this/, or perhaps /that/ or on the other hand, especially on
>> the Monday of a full moon, /something else/. The HP requires us
>> to say, of a program/input pair, "this instance terminates" or
>> "this instance doesn't terminate", not "well, it might if ...".
>> What normally has to be "pure" in a "computation problem" is the
>> program, not individual bits thereof. ...
>
> Agreed. But, further, the halting function is a (mathematical) pure
> total function from N to {0,1}. This comes from the fact that every N
> either does or does not encode a halting computation, something PO has
> never unequivocally accepted.
>
> It's therefore irrelevant what "tricks" (like static variable might or
> might not be used). What matters is whether the "decider" gets the
> right answer for every input and the depends on an initial mutual
> agreement about how the inputs are to be specified and what the right
> answer is in each case. PO's game is to (a) change the definition of
> what the right answer is, and (b) obscure what the "inputs" mean in an
> attempt to justify the wrong answer. If you can avoid being sucking
> into the details, it's a stupendously silly ploy.
>
> (This is not 100% true as for some reason he recently accepted that the
> right answer is indeed right when talking about Turing machines. But
> that went horribly wrong so he stopped talking about TMs.)
>
The problem with allowing a non-computation into the mix is that if the
decider can detect that it is being called by H^, then it could return
to H^ the non-halting answer but when not, return the Halting answer and
claim that when run as a decider it gave the right answer so it is correct.
This is his H1/H ploy.
You just need to talk around the issue that the answer given to H^ was
wrong, but since that is an internal to H^ detail, you can perhaps put
up enough smoke and mirrors to say it doesn't matter.
[toc] | [prev] | [next] | [standalone]
Page 12 of 13 — ← Prev page 1 … 10 11 [12] 13 Next page →
Back to top | Article view | comp.theory
csiph-web