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 8 of 13 — ← Prev page 1 … 6 7 [8] 9 10 … 13 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 09:21 -0500 |
| Message-ID | <i96dnQP238RsBdX8nZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #39599 |
On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> The two machines are already fully operational.
>> H1 is merely a copy of H.
>
> It's deceptive to call your secret C functions "machines". It hints at
> the formality a clarity of Turing machines, but a TM that is a copy of
> another will have exactly the same transfer function (i.e. it will never
> compute a different result).
>
Unless one of them has a pathological self-reference relationship with
its input and the other one does not.
void P(u32 x)
{
if (H(x, x))
HERE: goto HERE;
}
P was intentionally designed to contradict the H halt decider.
P was not intentionally designed to contradict the H1 halt decider.
--
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:06 +0100 |
| Message-ID | <87fsty6gxi.fsf@bsb.me.uk> |
| In reply to | #39603 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 5:00 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> The two machines are already fully operational. >>> H1 is merely a copy of H. >> It's deceptive to call your secret C functions "machines". It hints at >> the formality a clarity of Turing machines, but a TM that is a copy of >> another will have exactly the same transfer function (i.e. it will never >> compute a different result). > > Unless one of them has a pathological self-reference relationship with > its input and the other one does not. No. I stated a fact (about TMs) that has no exceptions. Your secret C code is another matter, of course. It's just the deception of calling your code a "machine" that I was objecting to. It gives your hidden code an air of formality that it lacks. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 18:33 -0500 |
| Message-ID | <VtmdnSy6oZ3Jh9T8nZ2dnUU7-XvNnZ2d@giganews.com> |
| In reply to | #39628 |
On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> The two machines are already fully operational.
>>>> H1 is merely a copy of H.
>>> It's deceptive to call your secret C functions "machines". It hints at
>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>> another will have exactly the same transfer function (i.e. it will never
>>> compute a different result).
>>
>> Unless one of them has a pathological self-reference relationship with
>> its input and the other one does not.
>
> No. I stated a fact (about TMs) that has no exceptions. Your secret C
> code is another matter, of course. It's just the deception of calling
> your code a "machine" that I was objecting to. It gives your hidden
> code an air of formality that it lacks.
>
This is easily proven in a way that you are incapable of understanding.
void P(u32 x)
{
if (H(x, x))
HERE: goto HERE;
}
int main()
{
Output("Input_Halts = ", H((u32)P, (u32)P));
Output("Input_Halts = ", H1((u32)P, (u32)P));
}
Line 1 of main() specifies a different computation than line 2 of main()
even though the source code of H1 is a copy of H.
--
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:00 +0100 |
| Message-ID | <877dfa6bm8.fsf@bsb.me.uk> |
| In reply to | #39639 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 5:06 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> The two machines are already fully operational. >>>>> H1 is merely a copy of H. >>>> It's deceptive to call your secret C functions "machines". It hints at >>>> the formality a clarity of Turing machines, but a TM that is a copy of >>>> another will have exactly the same transfer function (i.e. it will never >>>> compute a different result). >>> >>> Unless one of them has a pathological self-reference relationship with >>> its input and the other one does not. >> No. I stated a fact (about TMs) that has no exceptions. Your secret C >> code is another matter, of course. It's just the deception of calling >> your code a "machine" that I was objecting to. It gives your hidden >> code an air of formality that it lacks. > > This is easily proven in a way that you are incapable of > understanding. You can't even write English. Saying "This is easily proven" following a quote from me that you are wrong, means you can easily prove what I said in the quote -- that you are wrong. That is indeed the case, but it is unlikely to be what you meant to say. Your junk functions are not "machines". The terms suggests an undeserved formality. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 19:14 -0500 |
| Message-ID | <me2dnZOPq6pzvtT8nZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #39643 |
On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> The two machines are already fully operational.
>>>>>> H1 is merely a copy of H.
>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>> compute a different result).
>>>>
>>>> Unless one of them has a pathological self-reference relationship with
>>>> its input and the other one does not.
>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>> code is another matter, of course. It's just the deception of calling
>>> your code a "machine" that I was objecting to. It gives your hidden
>>> code an air of formality that it lacks.
>>
>> This is easily proven in a way that you are incapable of
>> understanding.
>
> You can't even write English. Saying "This is easily proven" following
> a quote from me that you are wrong, means you can easily prove what I
> said in the quote -- that you are wrong. That is indeed the case, but
> it is unlikely to be what you meant to say.
>
> Your junk functions are not "machines". The terms suggests an
> undeserved formality.
>
void P(u32 x)
{
if (H(x, x))
HERE: goto HERE;
}
The actual correct x86 emulation of the input to H1(P,P) is different
than the actual correct x86 emulation of the input to H(P,P).
This is an objectively verifiable fact.
Many people nowadays don't really give a rat's ass for objectively
verifiable facts.
--
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:56 +0100 |
| Message-ID | <87pmt24uhp.fsf@bsb.me.uk> |
| In reply to | #39644 |
olcott <NoOne@NoWhere.com> writes:
> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> The two machines are already fully operational.
>>>>>>> H1 is merely a copy of H.
>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>> compute a different result).
>>>>>
>>>>> Unless one of them has a pathological self-reference relationship with
>>>>> its input and the other one does not.
>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>> code is another matter, of course. It's just the deception of calling
>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>> code an air of formality that it lacks.
>>>
>>> This is easily proven in a way that you are incapable of
>>> understanding.
>> You can't even write English. Saying "This is easily proven" following
>> a quote from me that you are wrong, means you can easily prove what I
>> said in the quote -- that you are wrong. That is indeed the case, but
>> it is unlikely to be what you meant to say.
>>
>> Your junk functions are not "machines". The terms suggests an
>> undeserved formality.
No reply?
> void P(u32 x)
> {
> if (H(x, x))
> HERE: goto HERE;
> }
>
> The actual correct x86 emulation of the input to H1(P,P) is different
> than the actual correct x86 emulation of the input to H(P,P).
>
> This is an objectively verifiable fact.
But until you post the code, only by you. I'll take your word for it,
since it's trivial, but I can't verify it myself.
Of course we must always consider the possibility that you are using
what you euphemistically call "poetic license" here. Maybe "actual
correct x86 emulation" is not actually correct or maybe not even x86
emulation! After all, two and half years ago, an "actual Turing
machine" wasn't one. And writing a UTM did not mean writing a UTM.
> Many people nowadays don't really give a rat's ass for objectively
> verifiable facts.
And you don't give a rat's ass about honesty. You lie about simple
facts that can be verified by anyone since the lies are in public posts.
I've just shown you two such lies or yours in a recent post.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 20:11 -0500 |
| Message-ID | <cKKdnTZJPZ_PrNT8nZ2dnUU7-U3NnZ2d@giganews.com> |
| In reply to | #39649 |
On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> The two machines are already fully operational.
>>>>>>>> H1 is merely a copy of H.
>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>> compute a different result).
>>>>>>
>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>> its input and the other one does not.
>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>> code is another matter, of course. It's just the deception of calling
>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>> code an air of formality that it lacks.
>>>>
>>>> This is easily proven in a way that you are incapable of
>>>> understanding.
>>> You can't even write English. Saying "This is easily proven" following
>>> a quote from me that you are wrong, means you can easily prove what I
>>> said in the quote -- that you are wrong. That is indeed the case, but
>>> it is unlikely to be what you meant to say.
>>>
>>> Your junk functions are not "machines". The terms suggests an
>>> undeserved formality.
>
> No reply?
>
>> void P(u32 x)
>> {
>> if (H(x, x))
>> HERE: goto HERE;
>> }
>>
>> The actual correct x86 emulation of the input to H1(P,P) is different
>> than the actual correct x86 emulation of the input to H(P,P).
>>
>> This is an objectively verifiable fact.
>
> But until you post the code, only by you. I'll take your word for it,
> since it's trivial, but I can't verify it myself.
>
It is not trivial. It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
thus proving that H exists.
> Of course we must always consider the possibility that you are using
> what you euphemistically call "poetic license" here. Maybe "actual
> correct x86 emulation" is not actually correct or maybe not even x86
> emulation!
This is easy enough to verify in my paper. Iff you know the x86 language:
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
Correct x86 emulation is very easy in the x86utm operating system, the
x86 emulator library does all the real work. Verifying that it is
correct is also very easy simply look at the x86 source code and see
that the emulator emulates this code line by line as it is specified.
I had to manually adapt the emulator library so that it would
disassemble all of the functions in the COFF object file. The library
did more of the work here too. It could correctly disassemble a line as
long as it was pointed to the exact machine address of the line.
> After all, two and half years ago, an "actual Turing
> machine" wasn't one. And writing a UTM did not mean writing a UTM.
>
>> Many people nowadays don't really give a rat's ass for objectively
>> verifiable facts.
>
> And you don't give a rat's ass about honesty. You lie about simple
> facts that can be verified by anyone since the lies are in public posts.
> I've just shown you two such lies or yours in a recent post.
>
--
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 02:45 +0100 |
| Message-ID | <87ee9i4s7f.fsf@bsb.me.uk> |
| In reply to | #39650 |
olcott <NoOne@NoWhere.com> writes:
> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> The two machines are already fully operational.
>>>>>>>>> H1 is merely a copy of H.
>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>> compute a different result).
>>>>>>>
>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>> its input and the other one does not.
>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>> code an air of formality that it lacks.
>>>>>
>>>>> This is easily proven in a way that you are incapable of
>>>>> understanding.
>>>> You can't even write English. Saying "This is easily proven" following
>>>> a quote from me that you are wrong, means you can easily prove what I
>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>> it is unlikely to be what you meant to say.
>>>>
>>>> Your junk functions are not "machines". The terms suggests an
>>>> undeserved formality.
>> No reply?
>>
>>> void P(u32 x)
>>> {
>>> if (H(x, x))
>>> HERE: goto HERE;
>>> }
>>>
>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>> than the actual correct x86 emulation of the input to H(P,P).
>>>
>>> This is an objectively verifiable fact.
>> But until you post the code, only by you. I'll take your word for it,
>> since it's trivial, but I can't verify it myself.
>
> It is not trivial.
I was commenting on what you wrote. What you stated about the mystery
code is utterly trivial.
> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
> thus proving that H exists.
Does anyone doubt that your H exists? You've shown traces of it solving
the POOH problem.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 20:49 -0500 |
| Message-ID | <FrOdnUBMANukp9T8nZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #39655 |
On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>>> compute a different result).
>>>>>>>>
>>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>>> its input and the other one does not.
>>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>>> code an air of formality that it lacks.
>>>>>>
>>>>>> This is easily proven in a way that you are incapable of
>>>>>> understanding.
>>>>> You can't even write English. Saying "This is easily proven" following
>>>>> a quote from me that you are wrong, means you can easily prove what I
>>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>>> it is unlikely to be what you meant to say.
>>>>>
>>>>> Your junk functions are not "machines". The terms suggests an
>>>>> undeserved formality.
>>> No reply?
>>>
>>>> void P(u32 x)
>>>> {
>>>> if (H(x, x))
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>
>>>> This is an objectively verifiable fact.
>>> But until you post the code, only by you. I'll take your word for it,
>>> since it's trivial, but I can't verify it myself.
>>
>> It is not trivial.
>
> I was commenting on what you wrote. What you stated about the mystery
> code is utterly trivial.
>
>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>> thus proving that H exists.
>
> Does anyone doubt that your H exists? You've shown traces of it solving
> the POOH problem.
>
It proves that the Linz H exists nitwit !
Are you too damn stupid like Richard to understand that Ĥ
ALWAYS REFERS TO LINZ
ALWAYS REFERS TO LINZ
ALWAYS REFERS TO LINZ
ALWAYS REFERS TO LINZ
--
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:30 +0100 |
| Message-ID | <87zgs63bjr.fsf@bsb.me.uk> |
| In reply to | #39656 |
olcott <NoOne@NoWhere.com> writes:
> On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>>>> compute a different result).
>>>>>>>>>
>>>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>>>> its input and the other one does not.
>>>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>>>> code an air of formality that it lacks.
>>>>>>>
>>>>>>> This is easily proven in a way that you are incapable of
>>>>>>> understanding.
>>>>>> You can't even write English. Saying "This is easily proven" following
>>>>>> a quote from me that you are wrong, means you can easily prove what I
>>>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>>>> it is unlikely to be what you meant to say.
>>>>>>
>>>>>> Your junk functions are not "machines". The terms suggests an
>>>>>> undeserved formality.
>>>> No reply?
>>>>
>>>>> void P(u32 x)
>>>>> {
>>>>> if (H(x, x))
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>>
>>>>> This is an objectively verifiable fact.
>>>> But until you post the code, only by you. I'll take your word for it,
>>>> since it's trivial, but I can't verify it myself.
>>>
>>> It is not trivial.
>> I was commenting on what you wrote. What you stated about the mystery
>> code is utterly trivial.
>>
>>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>>> thus proving that H exists.
>> Does anyone doubt that your H exists? You've shown traces of it solving
>> the POOH problem.
>
> It proves that the Linz H exists nitwit !
Unfortunately you've also been caught lying about what you claim your H
does. Until you clear that up, what is the point of any discussion?
You could turn round tomorrow and claim you never said that "It proves
that the Linz H exists". Everything a liar says is simply contingent on
the assumption that maybe they are not lying this time.
> Are you too damn stupid like Richard to understand that Ĥ
> ALWAYS REFERS TO LINZ
Are you telling the truth about that? Will you call me a fibber
tomorrow if I say you said that "Ĥ ALWAYS REFERS TO LINZ"? It's a silly
thing to say, but what would be the point of debating it with someone
who might deny it with impunity next week or next month?
By lying so blatantly, you've undermined everything you say until you
come clean. And even then, it will take a while for anyone to trust
what say.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 21:38 -0500 |
| Message-ID | <K7Cdna_-Go0R2NT8nZ2dnUU7-d-dnZ2d@giganews.com> |
| In reply to | #39664 |
On 9/20/2021 9:30 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>>>>> compute a different result).
>>>>>>>>>>
>>>>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>>>>> its input and the other one does not.
>>>>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>>>>> code an air of formality that it lacks.
>>>>>>>>
>>>>>>>> This is easily proven in a way that you are incapable of
>>>>>>>> understanding.
>>>>>>> You can't even write English. Saying "This is easily proven" following
>>>>>>> a quote from me that you are wrong, means you can easily prove what I
>>>>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>>>>> it is unlikely to be what you meant to say.
>>>>>>>
>>>>>>> Your junk functions are not "machines". The terms suggests an
>>>>>>> undeserved formality.
>>>>> No reply?
>>>>>
>>>>>> void P(u32 x)
>>>>>> {
>>>>>> if (H(x, x))
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>>>
>>>>>> This is an objectively verifiable fact.
>>>>> But until you post the code, only by you. I'll take your word for it,
>>>>> since it's trivial, but I can't verify it myself.
>>>>
>>>> It is not trivial.
>>> I was commenting on what you wrote. What you stated about the mystery
>>> code is utterly trivial.
>>>
>>>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>>>> thus proving that H exists.
>>> Does anyone doubt that your H exists? You've shown traces of it solving
>>> the POOH problem.
>>
>> It proves that the Linz H exists nitwit !
>
> Unfortunately you've also been caught lying about what you claim your H
> does. Until you clear that up, what is the point of any discussion?
> You could turn round tomorrow and claim you never said that "It proves
> that the Linz H exists". Everything a liar says is simply contingent on
> the assumption that maybe they are not lying this time.
>
>> Are you too damn stupid like Richard to understand that Ĥ
>> ALWAYS REFERS TO LINZ
>
> Are you telling the truth about that?
So the answer is yes, you are that stupid.
Many months ago H_Hat() referred to what I now call P.
Ĥ has always referred to Linz.
> Will you call me a fibber
> tomorrow if I say you said that "Ĥ ALWAYS REFERS TO LINZ"? It's a silly
> thing to say, but what would be the point of debating it with someone
> who might deny it with impunity next week or next month?
>
> By lying so blatantly, you've undermined everything you say until you
> come clean. And even then, it will take a while for anyone to trust
> what say.
>
--
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:50 +0100 |
| Message-ID | <87lf3q3amz.fsf@bsb.me.uk> |
| In reply to | #39667 |
olcott <NoOne@NoWhere.com> writes:
> On 9/20/2021 9:30 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>>>>>> compute a different result).
>>>>>>>>>>>
>>>>>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>>>>>> its input and the other one does not.
>>>>>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>>>>>> code an air of formality that it lacks.
>>>>>>>>>
>>>>>>>>> This is easily proven in a way that you are incapable of
>>>>>>>>> understanding.
>>>>>>>> You can't even write English. Saying "This is easily proven" following
>>>>>>>> a quote from me that you are wrong, means you can easily prove what I
>>>>>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>>>>>> it is unlikely to be what you meant to say.
>>>>>>>>
>>>>>>>> Your junk functions are not "machines". The terms suggests an
>>>>>>>> undeserved formality.
>>>>>> No reply?
>>>>>>
>>>>>>> void P(u32 x)
>>>>>>> {
>>>>>>> if (H(x, x))
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>>>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>>>>
>>>>>>> This is an objectively verifiable fact.
>>>>>> But until you post the code, only by you. I'll take your word for it,
>>>>>> since it's trivial, but I can't verify it myself.
>>>>>
>>>>> It is not trivial.
>>>> I was commenting on what you wrote. What you stated about the mystery
>>>> code is utterly trivial.
>>>>
>>>>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>>>>> thus proving that H exists.
>>>> Does anyone doubt that your H exists? You've shown traces of it solving
>>>> the POOH problem.
>>>
>>> It proves that the Linz H exists nitwit !
>> Unfortunately you've also been caught lying about what you claim your H
>> does. Until you clear that up, what is the point of any discussion?
>> You could turn round tomorrow and claim you never said that "It proves
>> that the Linz H exists". Everything a liar says is simply contingent on
>> the assumption that maybe they are not lying this time.
>>
>>> Are you too damn stupid like Richard to understand that Ĥ
>>> ALWAYS REFERS TO LINZ
>>
>> Are you telling the truth about that?
>
> So the answer is yes, you are that stupid.
You conclude I'm stupid because I ask someone who has so obviously lied
if they can be trusted in what they have just said? That's an odd
conclusion.
> Many months ago H_Hat() referred to what I now call P.
> Ĥ has always referred to Linz.
I'm happy to discuss this latest nonsense but only if explain which of
your recent statements about H were lies. I can't debate anything on
shifting ground where you will deny having agreed to something 12 days
later!
>> Will you call me a fibber
>> tomorrow if I say you said that "Ĥ ALWAYS REFERS TO LINZ"? It's a silly
>> thing to say, but what would be the point of debating it with someone
>> who might deny it with impunity next week or next month?
>> By lying so blatantly, you've undermined everything you say until you
>> come clean. And even then, it will take a while for anyone to trust
>> what say.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 22:09 -0500 |
| Message-ID | <s9adnRb0Jetj0dT8nZ2dnUU7-SOdnZ2d@giganews.com> |
| In reply to | #39671 |
On 9/20/2021 9:50 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/20/2021 9:30 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>>>>>> It's deceptive to call your secret C functions "machines". It hints at
>>>>>>>>>>>>> the formality a clarity of Turing machines, but a TM that is a copy of
>>>>>>>>>>>>> another will have exactly the same transfer function (i.e. it will never
>>>>>>>>>>>>> compute a different result).
>>>>>>>>>>>>
>>>>>>>>>>>> Unless one of them has a pathological self-reference relationship with
>>>>>>>>>>>> its input and the other one does not.
>>>>>>>>>>> No. I stated a fact (about TMs) that has no exceptions. Your secret C
>>>>>>>>>>> code is another matter, of course. It's just the deception of calling
>>>>>>>>>>> your code a "machine" that I was objecting to. It gives your hidden
>>>>>>>>>>> code an air of formality that it lacks.
>>>>>>>>>>
>>>>>>>>>> This is easily proven in a way that you are incapable of
>>>>>>>>>> understanding.
>>>>>>>>> You can't even write English. Saying "This is easily proven" following
>>>>>>>>> a quote from me that you are wrong, means you can easily prove what I
>>>>>>>>> said in the quote -- that you are wrong. That is indeed the case, but
>>>>>>>>> it is unlikely to be what you meant to say.
>>>>>>>>>
>>>>>>>>> Your junk functions are not "machines". The terms suggests an
>>>>>>>>> undeserved formality.
>>>>>>> No reply?
>>>>>>>
>>>>>>>> void P(u32 x)
>>>>>>>> {
>>>>>>>> if (H(x, x))
>>>>>>>> HERE: goto HERE;
>>>>>>>> }
>>>>>>>>
>>>>>>>> The actual correct x86 emulation of the input to H1(P,P) is different
>>>>>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>>>>>
>>>>>>>> This is an objectively verifiable fact.
>>>>>>> But until you post the code, only by you. I'll take your word for it,
>>>>>>> since it's trivial, but I can't verify it myself.
>>>>>>
>>>>>> It is not trivial.
>>>>> I was commenting on what you wrote. What you stated about the mystery
>>>>> code is utterly trivial.
>>>>>
>>>>>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>>>>>> thus proving that H exists.
>>>>> Does anyone doubt that your H exists? You've shown traces of it solving
>>>>> the POOH problem.
>>>>
>>>> It proves that the Linz H exists nitwit !
>>> Unfortunately you've also been caught lying about what you claim your H
>>> does. Until you clear that up, what is the point of any discussion?
>>> You could turn round tomorrow and claim you never said that "It proves
>>> that the Linz H exists". Everything a liar says is simply contingent on
>>> the assumption that maybe they are not lying this time.
>>>
>>>> Are you too damn stupid like Richard to understand that Ĥ
>>>> ALWAYS REFERS TO LINZ
>>>
>>> Are you telling the truth about that?
>>
>> So the answer is yes, you are that stupid.
>
> You conclude I'm stupid because I
can't keep track of the key detail that Ĥ only refer to Linz from the
perfecly clear conext that has been reiterated hundreds of times over
many months.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-20 23:29 -0400 |
| Message-ID | <Jkc2J.33831$tA2.18577@fx02.iad> |
| In reply to | #39674 |
On 9/20/21 11:09 PM, olcott wrote:
> On 9/20/2021 9:50 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/20/2021 9:30 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/20/2021 8:45 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/20/2021 7:56 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 9/20/2021 7:00 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 9/20/2021 5:00 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The two machines are already fully operational.
>>>>>>>>>>>>>>> H1 is merely a copy of H.
>>>>>>>>>>>>>> It's deceptive to call your secret C functions
>>>>>>>>>>>>>> "machines". It hints at
>>>>>>>>>>>>>> the formality a clarity of Turing machines, but a TM that
>>>>>>>>>>>>>> is a copy of
>>>>>>>>>>>>>> another will have exactly the same transfer function (i.e.
>>>>>>>>>>>>>> it will never
>>>>>>>>>>>>>> compute a different result).
>>>>>>>>>>>>>
>>>>>>>>>>>>> Unless one of them has a pathological self-reference
>>>>>>>>>>>>> relationship with
>>>>>>>>>>>>> its input and the other one does not.
>>>>>>>>>>>> No. I stated a fact (about TMs) that has no exceptions.
>>>>>>>>>>>> Your secret C
>>>>>>>>>>>> code is another matter, of course. It's just the deception
>>>>>>>>>>>> of calling
>>>>>>>>>>>> your code a "machine" that I was objecting to. It gives
>>>>>>>>>>>> your hidden
>>>>>>>>>>>> code an air of formality that it lacks.
>>>>>>>>>>>
>>>>>>>>>>> This is easily proven in a way that you are incapable of
>>>>>>>>>>> understanding.
>>>>>>>>>> You can't even write English. Saying "This is easily proven"
>>>>>>>>>> following
>>>>>>>>>> a quote from me that you are wrong, means you can easily prove
>>>>>>>>>> what I
>>>>>>>>>> said in the quote -- that you are wrong. That is indeed the
>>>>>>>>>> case, but
>>>>>>>>>> it is unlikely to be what you meant to say.
>>>>>>>>>>
>>>>>>>>>> Your junk functions are not "machines". The terms suggests an
>>>>>>>>>> undeserved formality.
>>>>>>>> No reply?
>>>>>>>>
>>>>>>>>> void P(u32 x)
>>>>>>>>> {
>>>>>>>>> if (H(x, x))
>>>>>>>>> HERE: goto HERE;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> The actual correct x86 emulation of the input to H1(P,P) is
>>>>>>>>> different
>>>>>>>>> than the actual correct x86 emulation of the input to H(P,P).
>>>>>>>>>
>>>>>>>>> This is an objectively verifiable fact.
>>>>>>>> But until you post the code, only by you. I'll take your word
>>>>>>>> for it,
>>>>>>>> since it's trivial, but I can't verify it myself.
>>>>>>>
>>>>>>> It is not trivial.
>>>>>> I was commenting on what you wrote. What you stated about the
>>>>>> mystery
>>>>>> code is utterly trivial.
>>>>>>
>>>>>>> It proves that H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy is correct
>>>>>>> thus proving that H exists.
>>>>>> Does anyone doubt that your H exists? You've shown traces of it
>>>>>> solving
>>>>>> the POOH problem.
>>>>>
>>>>> It proves that the Linz H exists nitwit !
>>>> Unfortunately you've also been caught lying about what you claim your H
>>>> does. Until you clear that up, what is the point of any discussion?
>>>> You could turn round tomorrow and claim you never said that "It proves
>>>> that the Linz H exists". Everything a liar says is simply
>>>> contingent on
>>>> the assumption that maybe they are not lying this time.
>>>>
>>>>> Are you too damn stupid like Richard to understand that Ĥ
>>>>> ALWAYS REFERS TO LINZ
>>>>
>>>> Are you telling the truth about that?
>>>
>>> So the answer is yes, you are that stupid.
>>
>> You conclude I'm stupid because I
>
> can't keep track of the key detail that Ĥ only refer to Linz from the
> perfecly clear conext that has been reiterated hundreds of times over
> many months.
>
YOU seem to be INTENTIONALY being deceptive, which is the same as LYING.
From now on, maybe you should prefix ALL lables that are domain specific
with what domain they are from. But that will just make your ruse more
obvious, so you won't do it.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-22 01:44 +0100 |
| Message-ID | <875yut30dd.fsf@bsb.me.uk> |
| In reply to | #39674 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 9:50 PM, Ben Bacarisse wrote: >> You conclude I'm stupid because I (childish snipping) > can't keep track of the key detail that Ĥ only refer to Linz from the > perfecly clear conext that has been reiterated hundreds of times over > many months. Your contradictory statements, and your lies about not having made them, are still contradictory and dishonest not matter what TMs the symbols were supposed to denote. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-21 19:56 -0500 |
| Message-ID | <BuCdna9uIM3G4tf8nZ2dnUU7-RHNnZ2d@giganews.com> |
| In reply to | #39703 |
On 9/21/2021 7:44 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/20/2021 9:50 PM, Ben Bacarisse wrote: > >>> You conclude I'm stupid because I > > (childish snipping) > >> can't keep track of the key detail that Ĥ only refer to Linz from the >> perfecly clear conext that has been reiterated hundreds of times over >> many months. > > Your contradictory statements, and your lies about not having made them, > are still contradictory and dishonest not matter what TMs the symbols > were supposed to denote. > That I always used this symbol Ĥ in the context of the Linz proofs and never used it in any other way and did this many hundreds of times should have been noticed by someone that is not stupid. Richard can't seem to keep track of this distinction when I specifically point it out to him many dozens of times, telling him that this Ĥ only applies to the Linz proofs. -- 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-22 23:58 +0100 |
| Message-ID | <87v92s1alf.fsf@bsb.me.uk> |
| In reply to | #39704 |
olcott <NoOne@NoWhere.com> writes: > On 9/21/2021 7:44 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/20/2021 9:50 PM, Ben Bacarisse wrote: >> >>>> You conclude I'm stupid because I >> (childish snipping) >> >>> can't keep track of the key detail that Ĥ only refer to Linz from the >>> perfecly clear conext that has been reiterated hundreds of times over >>> many months. >> >> Your contradictory statements, and your lies about not having made them, >> are still contradictory and dishonest not matter what TMs the symbols >> were supposed to denote. > > That I always used this symbol Ĥ in the context of the Linz proofs and > never used it in any other way and did this many hundreds of times > should have been noticed by someone that is not stupid. More deflection from the rather obvious lie you've been caught telling. You lied about never having agreed to something you had agreed to less than two weeks earlier. In the mean time you went ahead and said the opposite because it suited you are the time. Truth is of no interest to you. Just boasting. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-20 23:05 -0400 |
| Message-ID | <5_b2J.114449$Kv2.39105@fx47.iad> |
| In reply to | #39656 |
On 9/20/21 9:49 PM, olcott wrote: > > > It proves that the Linz H exists nitwit ! > > Are you too damn stupid like Richard to understand that Ĥ > ALWAYS REFERS TO LINZ > ALWAYS REFERS TO LINZ > ALWAYS REFERS TO LINZ > ALWAYS REFERS TO LINZ Yes, you have decided to not call your 'equivalent' of Linz-H^ H^, I think because it points out to well that what you call 'P' actually changes when you redefine H. The BIG problem is that you have totally confused what 'H' Means. Sometimes it is Linz-H Sometimes it is POOP-H and Sometimes it is POOP-H1 You seem to want to claim that POOP-H1 is the equivalent of Linz-H, but you also need POOP-H to be the equivalent of Linz-H since that is what your 'P' is built on. This last point gets a bit confused as you seem to be also claiming that POOP-H is also Linz-H^, but only sort of, POOP-H is what is at P.qx, but then you say that POOP-H 'maps' to Linz-H^, and P is just the representation (when it is always been shown as actual CODE, just like H and H1). It is clear that POOP-H1 and POOP-H can't be the 'same computation' even though they are claimed to use the same code, as they give different answers to some inputs, and you sometimes seem to admit it, but you also sometimes sort of imply they are to get around the construction issues of your Linz-H^ equivalent. Since BOTH are claimed to be the equivalent of Linz-H, and Linz-H can't be two seperate computations, that doesn't actually prove that Linz-H exists. You haven't shown that the exact computation that Linz-H^ is built from gives the right answer to the halting status of Linz-H^. (because it CAN'T, since Linz-H^ will always do the opposite). All you have shown is that either some other decider can decide H^, which just shows that there IS a right answer that can be given, or that your 'H' isn't
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-20 22:13 -0500 |
| Message-ID | <Da2dnRCQ3Zwg0NT8nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #39672 |
On 9/20/2021 10:05 PM, Richard Damon wrote: > On 9/20/21 9:49 PM, olcott wrote: >> >> >> It proves that the Linz H exists nitwit ! >> >> Are you too damn stupid like Richard to understand that Ĥ >> ALWAYS REFERS TO LINZ >> ALWAYS REFERS TO LINZ >> ALWAYS REFERS TO LINZ >> ALWAYS REFERS TO LINZ > > Yes, you have decided to not call your 'equivalent' of Linz-H^ H^, I > think because it points out to well that what you call 'P' actually > changes when you redefine H. > H/H1/P always refers to Olcott H/Ĥ/⟨Ĥ⟩ always refers to Linz Ĥ has never referred to Olcott H_Hat did refer to Olcott months ago before I renamed it to P. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-20 23:35 -0400 |
| Message-ID | <bqc2J.26393$oY4.12726@fx20.iad> |
| In reply to | #39675 |
On 9/20/21 11:13 PM, olcott wrote: > On 9/20/2021 10:05 PM, Richard Damon wrote: >> On 9/20/21 9:49 PM, olcott wrote: >>> >>> >>> It proves that the Linz H exists nitwit ! >>> >>> Are you too damn stupid like Richard to understand that Ĥ >>> ALWAYS REFERS TO LINZ >>> ALWAYS REFERS TO LINZ >>> ALWAYS REFERS TO LINZ >>> ALWAYS REFERS TO LINZ >> >> Yes, you have decided to not call your 'equivalent' of Linz-H^ H^, I >> think because it points out to well that what you call 'P' actually >> changes when you redefine H. >> > H/H1/P always refers to Olcott > H/Ĥ/⟨Ĥ⟩ always refers to Linz > > Ĥ has never referred to Olcott > H_Hat did refer to Olcott months ago before I renamed it to P. > Right, so H is an ambiguous term, so you need to qualify ALL your uses of it. But the problem is that Linz-H isn't really either of POOP-H or POOP-H1 because it needs to be a bit of both, but they are different. You also seem to what P to be just a representation, when it REALLY is the Linz-H^, but for some reason you are afraid to call it that. Maybe because you want to use JUST the part of Ps history that H traces to be ALL of the execution of P, when it isn't. P IS a full Machine/program and runs independently and P(P) SHOWS that the input to H actually represents a halting computation even though it is impossible to create an H that can see that for its H^/P
[toc] | [prev] | [next] | [standalone]
Page 8 of 13 — ← Prev page 1 … 6 7 [8] 9 10 … 13 Next page →
Back to top | Article view | comp.theory
csiph-web