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 3 of 13 — ← Prev page 1 2 [3] 4 5 … 13 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 17:30 -0400 |
| Message-ID | <lUs1J.75977$z%4.53614@fx37.iad> |
| In reply to | #39466 |
On 9/18/21 5:11 PM, olcott wrote:
> On 9/18/2021 4:02 PM, Ben Bacarisse wrote:
>> Richard Damon <Richard@Damon-Family.org> writes:
>>
>>> On 9/18/21 1:04 PM, olcott wrote:
>>>> On 9/18/2021 11:32 AM, Richard Damon wrote:
>>>>> On 9/18/21 12:08 PM, olcott wrote:
>>>>>> On 9/18/2021 10:44 AM, Richard Damon wrote:
>>
>>>>>>> Have you stopped lying about your Halt Decider?
>>>>>>
>>>>>> To the best of my knowledge I have only actually lied once in the
>>>>>> last
>>>>>> ten years. I lied to a close friend about a very hurtful truth to
>>>>>> protect them from this very hurtful truth.
>>>>>
>>>>> Since it has been reported that you claimed years ago that you did
>>>>> have
>>>>> a version of your Halt Decider totally coded as a ACTUAL Turing
>>>>> Machine,
>>>>> and you have since retracted that statement, wasn't the first
>>>>> statement
>>>>> a LIE.
>>>>
>>>> Since the key element of the algorithm that correctly decides the halt
>>>> status of the conventional impossible inputs was fully encoded in C and
>>>> code written in C can be applied to Turing machines saying that I had a
>>>> fully encoded Turing machine was poetic license.
>>>
>>> No, it is a LIE. Neither C code nor x86 code is an encoded Turing
>>> Machine, any more than your dog spot is a cat.
>>>
>>> Unless you have a C compiler that can generate Turing Machine Code, you
>>> didn't have an encoded Turing Machine.
>>>
>>>> Now that I know that Turing machine equivalence is a concept that does
>>>> exist I can more accurately refer to my code as Turing equivalent. Even
>>>> when I do this I must augment the common notion of Turing
>>>> equivalence to
>>>> only apply to the subset of computations that have all the memory that
>>>> they need.
>>>
>>> So you lied out of ignorance, but it is still a lie.
>>
>> He calls it "poetic license", but it was simply a false claim made
>> during a particularly delusional episode. The real dishonest lies were
>> in the cover-up. If you read the exchanges at the time (mid Dec 2018)
>> it is abundantly clear that he was not taking about C code. He really
>> did claim to have what everyone else understands by "an actual Turing
>> machine". Even if we extend his recent defence of "poetic license" to
>> include the term "Universal Turing Machine", we'd have to believe that
>> he intended to write a C-code simulator and that that would take him a
>> couple of weeks!
>>
>> Now I suspect the delusion was that he had a code sketch of something or
>> other that he was certain could be turned into "an actual Turing
>> machine", "fully encoded", "exactly and precisely as in Linz" (his
>> words) but when that hope evaporated, the backpedalling started.
>>
>
> None-the-less I do have fully operational C/x86 code now and the only
> actual issue with it is whether or not its use of two static local
> variables makes it not apply to the halting theorem.
>
> If that is not any issue then this function refutes Rice's theorem.
>
> int main()
> {
> if (H1((u32)P, (u32)P) != H((u32)P, (u32)P))
> OutputString("Pathological self-reference error!");
> }
>
Since by your claims H1(P,P) being the same computation as the H(P,P)
used inside of P yet they return different values, it is clear that your
H is NOT a computation.
FAIL.
The only way to get this right is to make an H that return the right
answer to H^ (aka P) even though it will do the opposite.
This is, of course, impossible.
Anything that gives the other answer to H^/P so that it matches what the
decider says makes either H^/P not defined by the right rules or makes
the decider not a computation, both of which negate your proof.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-19 23:03 +0100 |
| Message-ID | <87tuig8bpn.fsf@bsb.me.uk> |
| In reply to | #39466 |
olcott <NoOne@NoWhere.com> writes: > On 9/18/2021 4:02 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 9/18/21 1:04 PM, olcott wrote: >>>> On 9/18/2021 11:32 AM, Richard Damon wrote: >>>>> On 9/18/21 12:08 PM, olcott wrote: >>>>>> On 9/18/2021 10:44 AM, Richard Damon wrote: >> >>>>>>> Have you stopped lying about your Halt Decider? >>>>>> >>>>>> To the best of my knowledge I have only actually lied once in the last >>>>>> ten years. I lied to a close friend about a very hurtful truth to >>>>>> protect them from this very hurtful truth. >>>>> >>>>> Since it has been reported that you claimed years ago that you did have >>>>> a version of your Halt Decider totally coded as a ACTUAL Turing Machine, >>>>> and you have since retracted that statement, wasn't the first statement >>>>> a LIE. >>>> >>>> Since the key element of the algorithm that correctly decides the halt >>>> status of the conventional impossible inputs was fully encoded in C and >>>> code written in C can be applied to Turing machines saying that I had a >>>> fully encoded Turing machine was poetic license. >>> >>> No, it is a LIE. Neither C code nor x86 code is an encoded Turing >>> Machine, any more than your dog spot is a cat. >>> >>> Unless you have a C compiler that can generate Turing Machine Code, you >>> didn't have an encoded Turing Machine. >>> >>>> Now that I know that Turing machine equivalence is a concept that does >>>> exist I can more accurately refer to my code as Turing equivalent. Even >>>> when I do this I must augment the common notion of Turing equivalence to >>>> only apply to the subset of computations that have all the memory that >>>> they need. >>> >>> So you lied out of ignorance, but it is still a lie. >> He calls it "poetic license", but it was simply a false claim made >> during a particularly delusional episode. The real dishonest lies were >> in the cover-up. If you read the exchanges at the time (mid Dec 2018) >> it is abundantly clear that he was not taking about C code. He really >> did claim to have what everyone else understands by "an actual Turing >> machine". Even if we extend his recent defence of "poetic license" to >> include the term "Universal Turing Machine", we'd have to believe that >> he intended to write a C-code simulator and that that would take him a >> couple of weeks! >> Now I suspect the delusion was that he had a code sketch of something or >> other that he was certain could be turned into "an actual Turing >> machine", "fully encoded", "exactly and precisely as in Linz" (his >> words) but when that hope evaporated, the backpedalling started. > > None-the-less I do have fully operational C/x86 code now... By which you mean "believe me when I say what my secret C code does despite my previous dishonesty". -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-18 09:01 -0600 |
| Message-ID | <si4v0f$u4l$1@dont-email.me> |
| In reply to | #39396 |
On 2021-09-18 07:54, olcott wrote: > On 9/17/2021 11:50 PM, André G. Isaak wrote: >> On 2021-09-17 20:40, olcott wrote: >>> Why do theory of computation problems require pure functions? >> >> Because the theory of computation isn't about C or x86. It isn't about >> computer programs at all, nor about modern computers. Just because >> 'computation' and 'computer' share the same root doesn't mean they >> deal with the same set of phenomena. Remember that the theory of >> computation developed before there even were digital computers or >> programming languages. >> >> Computational theory is concerned with describing *mathematical* >> functions, and all mathematical functions are pure functions. A >> computation is a method for determining the value of the mathematical >> function f(x) for a given x. A computable function is one for which it >> is possible to construct a TM which, given an input string >> representing x, will determine the value of f(x). >> >> You can write computer programs which perform computations, but the >> majority of computer programs don't. >> >> If you really want to learn about the theory of computation, I'd >> suggest that you forget about C or x86 assembly or any sort of >> computer language altogether and focus on Turing Machines. >> >> And don't try to mentally translate anything you read about Turing >> Machines into computer languages. Don't think about loop counters, or >> calls, or machine addresses, because all of these things pertain to >> computers and computer programming rather than computations and they >> will get in the way of you actually understanding either turing >> machines or the theory of computation more generally. >> >> André >> > > I only need to know this for one reason. That's a very odd statement to make. Since you purport to have 'overturned' a significant result in computational theory, I would think you would want to have a *thorough* understanding of all of the above issues > When my halt decider is examining the behavior of its input and the > input calls this halt decider in infinite recursion it cannot keep track > of the behavior of this input without having a single pseudo static > variable that is directly embedded in its machine code. I have no idea what a 'pseudo static variable' is. > This pseudo static variable stores the ongoing execution trace. When the > variable is an ordinary local variable it loses all of its data between > each recursive simulation. > > It still seems to be a pure function of its input in that > (1) The function return values are identical for identical arguments Except that it doesn't. According to you P(P) when run from main halts, and thus returns a value, whereas P(P), when simulated within H doesn't halt, and thus does not return a value. Returning a value in one case and not returning a value in another hardly qualifies as "identical [return values] for identical arguments" André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 10:10 -0500 |
| Message-ID | <XMWdnTGSKtQenNv8nZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #39401 |
On 9/18/2021 10:01 AM, André G. Isaak wrote: > On 2021-09-18 07:54, olcott wrote: >> On 9/17/2021 11:50 PM, André G. Isaak wrote: >>> On 2021-09-17 20:40, olcott wrote: >>>> Why do theory of computation problems require pure functions? >>> >>> Because the theory of computation isn't about C or x86. It isn't >>> about computer programs at all, nor about modern computers. Just >>> because 'computation' and 'computer' share the same root doesn't mean >>> they deal with the same set of phenomena. Remember that the theory of >>> computation developed before there even were digital computers or >>> programming languages. >>> >>> Computational theory is concerned with describing *mathematical* >>> functions, and all mathematical functions are pure functions. A >>> computation is a method for determining the value of the mathematical >>> function f(x) for a given x. A computable function is one for which >>> it is possible to construct a TM which, given an input string >>> representing x, will determine the value of f(x). >>> >>> You can write computer programs which perform computations, but the >>> majority of computer programs don't. >>> >>> If you really want to learn about the theory of computation, I'd >>> suggest that you forget about C or x86 assembly or any sort of >>> computer language altogether and focus on Turing Machines. >>> >>> And don't try to mentally translate anything you read about Turing >>> Machines into computer languages. Don't think about loop counters, or >>> calls, or machine addresses, because all of these things pertain to >>> computers and computer programming rather than computations and they >>> will get in the way of you actually understanding either turing >>> machines or the theory of computation more generally. >>> >>> André >>> >> >> I only need to know this for one reason. > > That's a very odd statement to make. Since you purport to have > 'overturned' a significant result in computational theory, I would think > you would want to have a *thorough* understanding of all of the above > issues > Anything that does not directly apply to my work is moot. >> When my halt decider is examining the behavior of its input and the >> input calls this halt decider in infinite recursion it cannot keep >> track of the behavior of this input without having a single pseudo >> static variable that is directly embedded in its machine code. > > I have no idea what a 'pseudo static variable' is. Instead of simply declaring the variable as static where the compiler places it in global data I directly embed the variable in the function's machine code. > >> This pseudo static variable stores the ongoing execution trace. When >> the variable is an ordinary local variable it loses all of its data >> between each recursive simulation. >> >> It still seems to be a pure function of its input in that >> (1) The function return values are identical for identical arguments > > Except that it doesn't. > For the purpose of this dialogue it is stipulated that it does, thus even if it does not it is to be construed that it does. If we assume that all cats are dogs then the question: Do cats bark is correctly anwered as: yes. > According to you P(P) when run from main halts, and thus returns a > value, whereas P(P), when simulated within H doesn't halt, and thus does > not return a value. Returning a value in one case and not returning a > value in another hardly qualifies as "identical [return values] for > identical arguments" > > André > I am not going to get into your lack of comprehension of this. I merely need to know, does my use of a static variable by-itself make my system no longer apply to the halting problem? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-18 10:09 -0600 |
| Message-ID | <si5307$q3f$1@dont-email.me> |
| In reply to | #39404 |
On 2021-09-18 09:10, olcott wrote: > On 9/18/2021 10:01 AM, André G. Isaak wrote: >> On 2021-09-18 07:54, olcott wrote: >>> It still seems to be a pure function of its input in that >>> (1) The function return values are identical for identical arguments >> >> Except that it doesn't. >> > > For the purpose of this dialogue it is stipulated that it does, thus > even if it does not it is to be construed that it does. So your proof is going to rest on 'stipulating' that your program behaves in a way which it does not? I hate to break it to you, but that's not how proofs work. Otherwise, I could offer the following proof. (1) I stipulate that P = NP (2) Therefore P = NP How much money do do you think I should demand from the global ecommerce industry to keep this result secret from the world? > If we assume that all cats are dogs then the question: > Do cats bark is correctly anwered as: yes. Umm. No. It is not. For starters, not all dogs bark to begin with. So unless you also 'stipulate' that all dogs bark your conclusion doesn't follow. Secondly, and more importantly, your 'stipulation' isn't going to have any effect whatsoever on the behavior of my cat. When you stipulate counterfactuals, you leave open a huge range of possible interpretations: Are you envisioning an alternate universe in which cats behave differently? Or an alternate universe in which the word 'cat' refers to a different set of entities? Or an alternate universe in which there are no cats? Or, were it actually the case that all dogs bark, are you envisioning an alternate universe in which this is not the case? Or some other possibility altogether? Crucially, though, your 'stipulation' remains a counterfactual. It tells us nothing whatsoever about the *actual* universe, nor can it be used in a proof regarding the actual universe. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 11:36 -0500 |
| Message-ID | <-oidnUk9zccCiNv8nZ2dnUU7-YGdnZ2d@giganews.com> |
| In reply to | #39423 |
On 9/18/2021 11:09 AM, André G. Isaak wrote: > On 2021-09-18 09:10, olcott wrote: >> On 9/18/2021 10:01 AM, André G. Isaak wrote: >>> On 2021-09-18 07:54, olcott wrote: > >>>> It still seems to be a pure function of its input in that >>>> (1) The function return values are identical for identical arguments >>> >>> Except that it doesn't. >>> >> >> For the purpose of this dialogue it is stipulated that it does, thus >> even if it does not it is to be construed that it does. > > So your proof is going to rest on 'stipulating' that your program > behaves in a way which it does not? I hate to break it to you, but > that's not how proofs work. Otherwise, I could offer the following proof. > Richard seems to understand these things better than you do. > (1) I stipulate that P = NP > (2) Therefore P = NP > > How much money do do you think I should demand from the global ecommerce > industry to keep this result secret from the world? > >> If we assume that all cats are dogs then the question: >> Do cats bark is correctly anwered as: yes. > > Umm. No. It is not. > > For starters, not all dogs bark to begin with. So unless you also > 'stipulate' that all dogs bark your conclusion doesn't follow. > > Secondly, and more importantly, your 'stipulation' isn't going to have > any effect whatsoever on the behavior of my cat. > > When you stipulate counterfactuals, you leave open a huge range of > possible interpretations: Are you envisioning an alternate universe in > which cats behave differently? Or an alternate universe in which the > word 'cat' refers to a different set of entities? Or an alternate > universe in which there are no cats? Or, were it actually the case that > all dogs bark, are you envisioning an alternate universe in which this > is not the case? Or some other possibility altogether? > > Crucially, though, your 'stipulation' remains a counterfactual. It tells > us nothing whatsoever about the *actual* universe, nor can it be used in > a proof regarding the actual universe. > > André > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-18 07:14 -0400 |
| Message-ID | <dSj1J.10135$mg5.470@fx26.iad> |
| In reply to | #39388 |
On 9/17/21 10:40 PM, olcott wrote: > Why do theory of computation problems require pure functions? > > I am trying to write C code that would be acceptable to computer > scientists in the field of the theory of computation. > > In computer programming, a pure function is a function that has the > following properties: > > (1) The function return values are identical for identical arguments (no > variation with local static variables, non-local variables, mutable > reference arguments or input streams). > > (2) The function application has no side effects (no mutation of local > static variables, non-local variables, mutable reference arguments or > input/output streams). > > https://en.wikipedia.org/wiki/Pure_function#Compiler_optimizations > Good Question! The key thing to understand is that the Theory of Computations isn't really about what computers can do, at least not in the 'modern' sense. But is about basic mathematics, and limits of what is knowable. In Mathematics, they started with a definition of a function, as a mapping of input values to output values, with the output value fully defined by the input. (This is where the computer term 'Pure' Function comes from, it is a computer function that matches the mathematical definition). The next question that came up, can we actually calculate what this function is for a given input? Some problems are easy to calculate, like how many ways can you order N distinct items. Some can't be easily answered, maybe requiring a form of exhaustive searching that you might not actually be sure you would be able to get an answer. This gets us into the question of is the function 'Computible', meaning could someone with a 'formula' or an 'algorithm' be able to calculate the value of the function in a finite amount of time. This is the problem field of Computation Theory, looking at what things can be computed by that sort of method, and some estimates of how long it might take (complexity theory) It doesn't directly relate to the 'Modern Computer' and its programming, except to the extent that the modern computer was created to get these answers by following those algorithms. So, Computation Theory wants 'pure functions' because that is what the field was built on.
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-09-18 13:02 +0100 |
| Message-ID | <si4khe$1nvt$1@gioia.aioe.org> |
| In reply to | #39388 |
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. ...
> 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.
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].
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Hummel
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 08:57 -0500 |
| Message-ID | <mJmdnfaWlv7Kbdj8nZ2dnUU7-YHNnZ2d@giganews.com> |
| In reply to | #39395 |
On 9/18/2021 7:02 AM, Andy Walker wrote: > 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. ... > >> 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. > > 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]. > 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. -- 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 10:53 -0400 |
| Message-ID | <T3n1J.168983$T_8.63230@fx48.iad> |
| In reply to | #39397 |
On 9/18/21 9:57 AM, olcott wrote: > On 9/18/2021 7:02 AM, Andy Walker wrote: >> 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]. >> > > 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. > Note, your traces have exactly the same problem, because you skip over the tracing of the embedded H with a specious claim that we can ignore that behavior and replace the simulation of the simulator with a simulation of the machine that it was simulating. It is just as possible to provide a full trace of the execution of a Turing Machine. yes, the trace gets longer, so there is more to wade through, but it gets around the problem that you actually need to prove that your C/x86 or RASP code is a Computation. I think that is the issue, because it appears that it is not, that you have assumed you H can do things that are NOT possible to actually implement as an actual Turing Machine of the form claimed, and you need to stick with those because you can't handle that problem.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-09-18 09:04 -0600 |
| Message-ID | <si4v6h$u4l$3@dont-email.me> |
| In reply to | #39397 |
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é -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 10:17 -0500 |
| Message-ID | <Nc6dnYeBOsuRntv8nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #39403 |
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 ⟨Ĥ⟩ ⟨Ĥ⟩. 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 11:24 -0400 |
| Message-ID | <Awn1J.130330$o45.49337@fx46.iad> |
| In reply to | #39407 |
On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. > > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > Except that it doesn't, as H says H^(H^) is non-halting when it actually Halts.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott2@gmail.com> |
|---|---|
| Date | 2021-09-18 10:29 -0500 |
| Message-ID | <si50lp$960$2@dont-email.me> |
| In reply to | #39410 |
On 9/18/2021 10:24 AM, Richard Damon wrote: > On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >> >> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >> > > Except that it doesn't, as H says H^(H^) is non-halting when it actually > Halts. > H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. -- 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 11:37 -0400 |
| Message-ID | <PIn1J.39327$2Q_3.774@fx35.iad> |
| In reply to | #39413 |
On 9/18/21 11:29 AM, olcott wrote: > On 9/18/2021 10:24 AM, Richard Damon wrote: >> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>> >>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >> >> Except that it doesn't, as H says H^(H^) is non-halting when it actually >> Halts. >> > > H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. > Which says that it is deciding that H^(<H^>) is a non-halting computation, but if we run H^(<H^>) it ends up at its terminal state H^.qy which halts. (Since the code for H^ is derived from the code of H, and the state H^.qn is the corresponding state to H.qn)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 10:39 -0500 |
| Message-ID | <goidnch2gvbNldv8nZ2dnUU7-QmdnZ2d@giganews.com> |
| In reply to | #39414 |
On 9/18/2021 10:37 AM, Richard Damon wrote: > On 9/18/21 11:29 AM, olcott wrote: >> On 9/18/2021 10:24 AM, Richard Damon wrote: >>> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>>> >>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>> >>> >>> Except that it doesn't, as H says H^(H^) is non-halting when it actually >>> Halts. >>> >> >> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. >> > > Which says that it is deciding that H^(<H^>) is a non-halting > computation, but if we run H^(<H^>) it ends up at its terminal state > H^.qy which halts. (Since the code for H^ is derived from the code of H, > and the state H^.qn is the corresponding state to H.qn) > So does my use of a static local variable by itself make my code not apply to the halting problem or not? -- 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 11:52 -0400 |
| Message-ID | <_Wn1J.168986$T_8.81874@fx48.iad> |
| In reply to | #39416 |
On 9/18/21 11:39 AM, olcott wrote: > On 9/18/2021 10:37 AM, Richard Damon wrote: >> On 9/18/21 11:29 AM, olcott wrote: >>> On 9/18/2021 10:24 AM, Richard Damon wrote: >>>> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>> >>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>> >>>> >>>> Except that it doesn't, as H says H^(H^) is non-halting when it >>>> actually >>>> Halts. >>>> >>> >>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. >>> >> >> Which says that it is deciding that H^(<H^>) is a non-halting >> computation, but if we run H^(<H^>) it ends up at its terminal state >> H^.qy which halts. (Since the code for H^ is derived from the code of H, >> and the state H^.qn is the corresponding state to H.qn) >> > > So does my use of a static local variable by itself make my code not > apply to the halting problem or not? > No, but that doesn't mean that the presence of the static local variable is unconditionally allowed. You need to PROVE that your program is a Computation. Lack of things like static local variables make that proof much easier. as if all information inside the program can only be derived from the official input, then there is no source of 'illegal' information. Presence of things like static local variables don't by themselves invalidate you ability to be a Computation, but do mean you really do need to show that it is one. So, as of now, the proposition that your code is eligible to be a decider is unproven, and can not just be 'assumed' If we ever see a case where two copies of H given the same input act differently, then this statement is proved in the negative.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 11:15 -0500 |
| Message-ID | <2f6dnYwdyrUFjdv8nZ2dnUU7-dHNnZ2d@giganews.com> |
| In reply to | #39420 |
On 9/18/2021 10:52 AM, Richard Damon wrote: > On 9/18/21 11:39 AM, olcott wrote: >> On 9/18/2021 10:37 AM, Richard Damon wrote: >>> On 9/18/21 11:29 AM, olcott wrote: >>>> On 9/18/2021 10:24 AM, Richard Damon wrote: >>>>> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>>> >>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>> >>>>> >>>>> Except that it doesn't, as H says H^(H^) is non-halting when it >>>>> actually >>>>> Halts. >>>>> >>>> >>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. >>>> >>> >>> Which says that it is deciding that H^(<H^>) is a non-halting >>> computation, but if we run H^(<H^>) it ends up at its terminal state >>> H^.qy which halts. (Since the code for H^ is derived from the code of H, >>> and the state H^.qn is the corresponding state to H.qn) >>> >> >> So does my use of a static local variable by itself make my code not >> apply to the halting problem or not? >> > > No, but that doesn't mean that the presence of the static local variable > is unconditionally allowed. > > You need to PROVE that your program is a Computation. > > Lack of things like static local variables make that proof much easier. > as if all information inside the program can only be derived from the > official input, then there is no source of 'illegal' information. > The halt status decision is entirely based on the execution trace derived from the input machine address pair. > Presence of things like static local variables don't by themselves > invalidate you ability to be a Computation, but do mean you really do > need to show that it is one. > That is great. What are the requirements of a computation? given an input of the function domain it can return the corresponding output. https://en.wikipedia.org/wiki/Computable_function > So, as of now, the proposition that your code is eligible to be a > decider is unproven, and can not just be 'assumed' > > If we ever see a case where two copies of H given the same input act > differently, then this statement is proved in the negative. > -- 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 12:28 -0400 |
| Message-ID | <4to1J.96063$Kv2.76439@fx47.iad> |
| In reply to | #39426 |
On 9/18/21 12:15 PM, olcott wrote: > On 9/18/2021 10:52 AM, Richard Damon wrote: >> On 9/18/21 11:39 AM, olcott wrote: >>> On 9/18/2021 10:37 AM, Richard Damon wrote: >>>> On 9/18/21 11:29 AM, olcott wrote: >>>>> On 9/18/2021 10:24 AM, Richard Damon wrote: >>>>>> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>>>> >>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>> >>>>>> >>>>>> Except that it doesn't, as H says H^(H^) is non-halting when it >>>>>> actually >>>>>> Halts. >>>>>> >>>>> >>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. >>>>> >>>> >>>> Which says that it is deciding that H^(<H^>) is a non-halting >>>> computation, but if we run H^(<H^>) it ends up at its terminal state >>>> H^.qy which halts. (Since the code for H^ is derived from the code >>>> of H, >>>> and the state H^.qn is the corresponding state to H.qn) >>>> >>> >>> So does my use of a static local variable by itself make my code not >>> apply to the halting problem or not? >>> >> >> No, but that doesn't mean that the presence of the static local variable >> is unconditionally allowed. >> >> You need to PROVE that your program is a Computation. >> >> Lack of things like static local variables make that proof much easier. >> as if all information inside the program can only be derived from the >> official input, then there is no source of 'illegal' information. >> > > The halt status decision is entirely based on the execution trace > derived from the input machine address pair. Right, but that ALSO applies to the simulated copies of H, which need to give the exact same answer given the exact same input. This means that since the 'master' H(P,P) returns non-halting, that must be consistent with the copy of H inside P ALSO return the answer of non-halting when given that exact same input. The 'assumption' that it will not return is a violation of that. Either H is using unsound logic, or H is not a computation because the 'slave' H doesn't behave the same way. > >> Presence of things like static local variables don't by themselves >> invalidate you ability to be a Computation, but do mean you really do >> need to show that it is one. >> > > That is great. What are the requirements of a computation? > > given an input of the function domain it can return the corresponding > output. https://en.wikipedia.org/wiki/Computable_function It is a bit more that a function with a specific value for a specific input, as it also needs to be the results of an 'algorithm', a step by step listing of instructions to get to the result. If all of the inputs to the algorithm are part of the formal input to the function, then you get a computation. > >> So, as of now, the proposition that your code is eligible to be a >> decider is unproven, and can not just be 'assumed' >> >> If we ever see a case where two copies of H given the same input act >> differently, then this statement is proved in the negative. >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-18 11:50 -0500 |
| Message-ID | <yo-dnfxINuFThdv8nZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #39427 |
On 9/18/2021 11:28 AM, Richard Damon wrote: > On 9/18/21 12:15 PM, olcott wrote: >> On 9/18/2021 10:52 AM, Richard Damon wrote: >>> On 9/18/21 11:39 AM, olcott wrote: >>>> On 9/18/2021 10:37 AM, Richard Damon wrote: >>>>> On 9/18/21 11:29 AM, olcott wrote: >>>>>> On 9/18/2021 10:24 AM, Richard Damon wrote: >>>>>>> On 9/18/21 11:17 AM, 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 ⟨Ĥ⟩ ⟨Ĥ⟩. >>>>>>>> >>>>>>>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>> >>>>>>> >>>>>>> Except that it doesn't, as H says H^(H^) is non-halting when it >>>>>>> actually >>>>>>> Halts. >>>>>>> >>>>>> >>>>>> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy. >>>>>> >>>>> >>>>> Which says that it is deciding that H^(<H^>) is a non-halting >>>>> computation, but if we run H^(<H^>) it ends up at its terminal state >>>>> H^.qy which halts. (Since the code for H^ is derived from the code >>>>> of H, >>>>> and the state H^.qn is the corresponding state to H.qn) >>>>> >>>> >>>> So does my use of a static local variable by itself make my code not >>>> apply to the halting problem or not? >>>> >>> >>> No, but that doesn't mean that the presence of the static local variable >>> is unconditionally allowed. >>> >>> You need to PROVE that your program is a Computation. >>> >>> Lack of things like static local variables make that proof much easier. >>> as if all information inside the program can only be derived from the >>> official input, then there is no source of 'illegal' information. >>> >> >> The halt status decision is entirely based on the execution trace >> derived from the input machine address pair. > > Right, but that ALSO applies to the simulated copies of H, which need to > give the exact same answer given the exact same input. > The original way that it worked was that the very first slave that saw that an infinite behavior pattern was matched reported this through a static variable that every master/slave instance of H used as their while (**Aborted == 0) termination condition. Then I changed this so that only the master made the halt status decision. Its trigger for testing the halt status was that the local static execution trace is longer than it was the last time that it tested the halt status. > This means that since the 'master' H(P,P) returns non-halting, that must > be consistent with the copy of H inside P ALSO return the answer of > non-halting when given that exact same input. > > The 'assumption' that it will not return is a violation of that. > > Either H is using unsound logic, or H is not a computation because the > 'slave' H doesn't behave the same way. > >> >>> Presence of things like static local variables don't by themselves >>> invalidate you ability to be a Computation, but do mean you really do >>> need to show that it is one. >>> >> >> That is great. What are the requirements of a computation? >> >> given an input of the function domain it can return the corresponding >> output. https://en.wikipedia.org/wiki/Computable_function > > It is a bit more that a function with a specific value for a specific > input, as it also needs to be the results of an 'algorithm', a step by > step listing of instructions to get to the result. > > If all of the inputs to the algorithm are part of the formal input to > the function, then you get a computation. > Formal input is typically restricted to input parameters. The use of the static local execution_trace is to store intermediate results that are derived on the basis of the input parameters. >> >>> So, as of now, the proposition that your code is eligible to be a >>> decider is unproven, and can not just be 'assumed' >>> >>> If we ever see a case where two copies of H given the same input act >>> differently, then this statement is proved in the negative. >>> >> >> > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 3 of 13 — ← Prev page 1 2 [3] 4 5 … 13 Next page →
Back to top | Article view | comp.theory
csiph-web