Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #30472 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-04-01 12:39 -0500 |
| Last post | 2021-04-29 20:18 -0500 |
| Articles |
20 on this page of 1000+
— 12 participants
Thread has 1355 articles; only the first 1000 are indexed. |
Back to article view | Back to comp.theory | Browse in flat view
Thread has 1355 articles; showing the first 1000 in depth-first order. Use the flat group view to see the rest.
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) olcott <NoOne@NoWhere.com> - 2021-04-01 12:39 -0500
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 13:58 -0400
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) olcott <NoOne@NoWhere.com> - 2021-04-01 13:28 -0500
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) olcott <NoOne@NoWhere.com> - 2021-04-09 20:51 -0500
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-10 15:54 +0100
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) olcott <NoOne@NoWhere.com> - 2021-04-10 10:04 -0500
Re: April Fools Day Challenge (Liar Paradox specifies an unsatisfiable cyclic structure) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-10 18:06 +0000
What is a computation? olcott <NoOne@NoWhere.com> - 2021-04-10 13:27 -0500
Re: What is a computation? Richard Damon <Richard@Damon-Family.org> - 2021-04-10 14:56 -0400
Re: What is a computation? olcott <NoOne@NoWhere.com> - 2021-04-10 14:54 -0500
Re: What is a computation? André G. Isaak <agisaak@gm.invalid> - 2021-04-10 14:42 -0600
Re: What is a computation? olcott <NoOne@NoWhere.com> - 2021-04-10 16:10 -0500
Re: What is a computation? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-10 14:55 -0700
Re: What is a computation? olcott <NoOne@NoWhere.com> - 2021-04-10 17:36 -0500
Re: What is a computation? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 02:04 +0100
Re: What is a computation? (halting problem configuration) olcott <NoOne@NoWhere.com> - 2021-04-10 20:34 -0500
Re: What is a computation? (halting problem configuration) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 03:21 +0100
Re: What is a computation? (halting problem configuration) Richard Damon <Richard@Damon-Family.org> - 2021-04-10 22:33 -0400
Re: What is a computation? (halting problem configuration) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 13:49 +0100
Re: What is a computation? (halting problem configuration) olcott <NoOne@NoWhere.com> - 2021-04-10 21:58 -0500
Re: What is a computation? (halting problem configuration) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 07:31 -0400
Re: What is a computation? (halting problem configuration) olcott <NoOne@NoWhere.com> - 2021-04-11 09:56 -0500
Re: What is a computation? (halting problem configuration) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 16:20 +0100
Re: What is a computation? (halting problem configuration) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 13:49 -0400
Re: What is a computation? (halting problem configuration) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 13:55 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-11 09:43 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 13:52 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-11 13:08 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 16:47 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-11 16:03 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 17:35 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-11 17:10 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 18:19 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-11 17:45 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-11 22:40 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-12 10:32 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 11:57 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-12 11:31 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 13:04 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-12 21:46 -0500
Re: What is a computation? (over Richard's head) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-12 20:14 -0700
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 23:17 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-12 22:37 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 23:49 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-14 10:09 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-14 20:55 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-14 20:14 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-14 21:36 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-14 20:53 -0500
Re: What is a computation? (over Richard's head) André G. Isaak <agisaak@gm.invalid> - 2021-04-14 20:13 -0600
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 07:19 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 10:26 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 14:04 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 15:01 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 16:50 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 16:07 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 17:25 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 16:33 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:02 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 17:10 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:32 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 18:35 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 21:35 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 17:40 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 19:12 -0400
Re: What is a computation? (over Richard's head) olcott <NoOne@NoWhere.com> - 2021-04-15 18:53 -0500
Re: What is a computation? (over Richard's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 20:59 -0400
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-12 02:31 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 10:19 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 11:43 -0400
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 11:41 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 13:45 -0400
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 21:51 -0500
Re: What is a computation? (over Ben's head) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-12 20:13 -0700
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 23:21 -0400
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 22:44 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-12 23:52 -0400
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-14 10:13 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-14 21:11 -0400
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-13 03:59 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 22:06 -0500
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-13 04:35 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-12 22:45 -0500
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-13 15:29 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-13 10:22 -0500
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-14 03:27 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-13 22:14 -0500
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-14 13:49 +0100
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-14 09:56 -0500
Re: What is a computation? (over Ben's head) André G. Isaak <agisaak@gm.invalid> - 2021-04-14 09:34 -0600
Re: What is a computation? (over Ben's head) olcott <NoOne@NoWhere.com> - 2021-04-14 12:32 -0500
Re: What is a computation? (over Ben's head) Richard Damon <Richard@Damon-Family.org> - 2021-04-14 21:17 -0400
Re: What is a computation? (over Ben's head) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-14 14:14 -0700
Re: What is a computation? (over Ben's head) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-14 23:36 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-14 17:49 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-15 02:11 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-14 20:18 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-14 21:39 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-14 22:14 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-15 11:14 +0100
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 07:38 -0400
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-15 04:48 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 09:07 -0400
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-15 07:10 -0700
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-15 16:46 +0100
Re: What is a computation? (There is no weaseling out of this)(Gödel and logical incoherence) olcott <NoOne@NoWhere.com> - 2021-04-15 09:34 -0500
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 09:16 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 10:48 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 10:33 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 14:13 -0400
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-15 10:22 -0700
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 12:27 -0500
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-15 10:46 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 14:18 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-14 22:18 -0500
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-15 03:37 -0700
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 09:07 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 10:56 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 10:37 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 14:22 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 14:32 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 16:03 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 15:21 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 17:03 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 16:09 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 17:27 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 16:35 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 16:42 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:08 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:05 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 17:14 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:38 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 18:38 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 21:02 -0400
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-16 01:50 +0100
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) olcott <NoOne@NoWhere.com> - 2021-04-15 19:56 -0500
Re: What is a computation? (There is no weaseling out of this)(Validity v Soundness) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-16 02:10 +0100
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 07:42 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 09:52 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 11:25 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 10:58 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 14:32 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 14:35 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 16:07 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 15:27 -0500
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 16:03 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 17:43 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 16:51 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:13 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 17:18 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 18:43 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-15 18:51 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-15 21:24 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 17:25 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 19:13 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-17 01:24 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 19:33 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-17 02:07 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:15 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-17 02:18 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:33 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 21:35 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:44 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 22:52 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:01 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 20:34 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 21:39 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 20:49 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 21:58 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 23:10 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:33 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 21:55 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 23:26 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 11:36 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 11:04 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:34 -0400
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-16 22:04 -0700
Re: What is a computation? (There is no weaseling out of this) R Kym Horsell <kym@kymhorsell.com> - 2021-04-17 05:12 +0000
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-20 13:09 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 11:31 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 10:48 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:41 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 21:11 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:36 -0500
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-16 21:55 -0700
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 18:36 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 19:47 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 21:09 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:31 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 21:42 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:54 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 22:59 -0400
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 06:29 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 08:22 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 11:41 -0400
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 21:07 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:27 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 21:47 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 20:57 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 23:02 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:25 -0500
Re: What is a computation? (There is no weaseling out of this) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-17 05:03 +0000
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 06:30 -0400
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-16 22:14 -0700
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-16 22:16 -0700
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 20:37 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 21:55 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 21:09 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:30 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 21:44 -0600
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 06:34 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 08:30 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 11:48 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 11:07 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:44 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-17 14:38 -0600
Re: What is a computation? (The halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-17 15:48 -0500
Re: What is a computation? (The halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 23:18 -0400
Re: What is a computation? (The halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-17 22:26 -0500
Re: What is a computation? (The halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 00:04 -0400
Re: What is a computation? (The halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-17 23:17 -0500
Re: What is a computation? (The halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 07:40 -0400
Re: What is a computation? (The halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-18 10:04 -0500
Re: What is a computation? (The halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:25 -0400
Re: What is a computation? (denial-of-service attack) olcott <NoOne@NoWhere.com> - 2021-04-18 14:32 -0500
Re: What is a computation? (denial-of-service attack) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:54 -0400
Re: What is a computation? (denial-of-service attack) olcott <NoOne@NoWhere.com> - 2021-04-18 15:16 -0500
Re: What is a computation? (denial-of-service attack) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:35 -0400
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 23:21 -0400
Re: What is a computation? (Halts is a pure function of its inputs) olcott <NoOne@NoWhere.com> - 2021-04-17 22:39 -0500
Re: What is a computation? (Halts is a pure function of its inputs) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 00:07 -0400
Re: What is a computation? (Halts is a pure function of its inputs) olcott <NoOne@NoWhere.com> - 2021-04-17 23:21 -0500
Re: What is a computation? (Halts is a pure function of its inputs) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 07:43 -0400
Re: What is a computation? (Halts is a pure function of its inputs) olcott <NoOne@NoWhere.com> - 2021-04-18 09:55 -0500
Re: What is a computation? (Halts is a pure function of its inputs) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:29 -0400
Re: What is a computation? (Halts is a pure function of its inputs) olcott <NoOne@NoWhere.com> - 2021-04-18 14:36 -0500
Re: What is a computation? (Halts is a pure function of its inputs) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:56 -0400
Re: What is a computation? (André is wrong and he knows it) olcott <NoOne@NoWhere.com> - 2021-04-16 22:54 -0500
Re: What is a computation? (André is wrong and he knows it) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 22:28 -0600
Re: What is a computation? (André is wrong and he knows it) olcott <NoOne@NoWhere.com> - 2021-04-16 23:36 -0500
Re: What is a computation? (André is wrong and he knows it) André G. Isaak <agisaak@gm.invalid> - 2021-04-16 22:41 -0600
Re: What is a computation? (André is wrong and he knows it) olcott <NoOne@NoWhere.com> - 2021-04-16 23:44 -0500
Re: What is a computation? (André is wrong and he knows it) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 08:50 -0400
Re: What is a computation? (André is wrong and he knows it) olcott <NoOne@NoWhere.com> - 2021-04-17 08:50 -0500
Re: What is a computation? (André is wrong and he knows it) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 11:53 -0400
Re: What is a computation? (André is wrong and he knows it) olcott <NoOne@NoWhere.com> - 2021-04-17 11:10 -0500
Re: What is a computation? (André is wrong and he knows it) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:45 -0400
Re: What is a computation? (André is wrong and he knows it) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-17 13:59 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-16 23:15 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-16 22:37 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 06:54 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 08:44 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:02 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 11:13 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:53 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-17 14:44 -0600
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-16 22:11 -0700
Re: What is a computation? (There is no weaseling out of this) R Kym Horsell <kym@kymhorsell.com> - 2021-04-17 05:31 +0000
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-17 03:05 -0700
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 08:05 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-17 16:07 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 10:25 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:06 -0400
Re: What is a computation? (random access memory ) olcott <NoOne@NoWhere.com> - 2021-04-17 11:18 -0500
Re: What is a computation? (random access memory ) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 12:57 -0400
Re: What is a computation? (random access memory ) olcott <NoOne@NoWhere.com> - 2021-04-17 12:02 -0500
Re: What is a computation? (random access memory ) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 13:23 -0400
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-17 11:29 -0700
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-17 13:50 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 07:44 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 10:06 -0500
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-18 10:08 -0700
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 12:19 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:36 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 14:43 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:59 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 15:17 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:37 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 16:43 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:58 -0400
Re: Infinite recursion detection criteria (correct C code) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-18 15:06 -0700
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 18:16 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 19:35 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 18:47 -0500
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 20:27 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 22:13 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 21:16 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 22:26 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-18 21:29 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 07:16 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-19 10:12 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 11:28 -0400
Re: Infinite recursion detection criteria (correct C code) olcott <NoOne@NoWhere.com> - 2021-04-19 10:40 -0500
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 12:09 -0400
Re: Infinite recursion detection criteria (correct C code) Richard Harnden <richard.nospam@gmail.com> - 2021-04-22 15:04 +0100
Re: Infinite recursion detection criteria (correct C code) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 19:42 -0400
Re: Infinite recursion detection criteria (correct C code) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-18 22:57 +0000
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-18 20:13 -0500
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-18 20:16 -0500
Re: Infinite recursion detection criteria (agreement check) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-19 16:59 +0000
Re: Infinite recursion detection criteria (agreement check) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-19 17:40 +0000
Re: Infinite recursion detection criteria (agreement check) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 13:45 -0400
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-19 12:57 -0500
Re: Infinite recursion detection criteria (agreement check) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 14:22 -0400
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-19 13:50 -0500
Re: Infinite recursion detection criteria (agreement check) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 15:11 -0400
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-19 14:23 -0500
Re: Infinite recursion detection criteria (agreement check) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 16:44 -0400
Re: Infinite recursion detection criteria (agreement check) olcott <NoOne@NoWhere.com> - 2021-04-19 16:01 -0500
Re: Infinite recursion detection criteria (agreement check) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:52 -0400
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 20:01 +0100
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-18 13:18 -0700
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 22:44 +0100
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-18 15:23 -0700
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 00:21 +0100
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:31 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 14:40 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 16:05 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 15:26 -0500
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-18 13:56 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:45 -0400
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 01:12 +0100
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-18 02:24 -0700
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 22:07 +0100
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-19 01:45 -0700
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 17:17 +0100
Re: What is a computation? (erroneous conflation) olcott <NoOne@NoWhere.com> - 2021-04-19 13:16 -0500
Re: What is a computation? (erroneous conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 00:48 +0100
Re: What is a computation? (erroneous conflation) olcott <polcott2@gmail.com> - 2021-04-19 21:07 -0500
Re: What is a computation? (erroneous conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 22:22 -0400
Re: What is a computation? (erroneous conflation) olcott <NoOne@NoWhere.com> - 2021-04-19 21:29 -0500
Re: What is a computation? (erroneous conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 07:21 -0400
Re: What is a computation? (erroneous conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 03:27 +0100
Re: What is a computation? (erroneous conflation) olcott <NoOne@NoWhere.com> - 2021-04-19 21:30 -0500
Re: What is a computation? (erroneous conflation) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-19 20:56 -0700
Re: What is a computation? (erroneous conflation) olcott <NoOne@NoWhere.com> - 2021-04-19 22:59 -0500
Re: What is a computation? (erroneous conflation) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-19 21:52 -0700
Re: What is a computation? (erroneous conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 07:24 -0400
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-19 13:20 -0700
Re: What is a computation? (Infinite recursion detection criteria) olcott <NoOne@NoWhere.com> - 2021-04-19 15:28 -0500
Re: What is a computation? (There is no weaseling out of this) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-19 13:35 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:11 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 10:57 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 22:02 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 16:10 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:52 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 17:01 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 18:13 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 18:27 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 19:39 -0400
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 00:15 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 18:36 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 01:19 +0100
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 19:51 -0500
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 02:12 +0100
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 22:19 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 21:23 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-18 21:36 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 22:44 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-18 22:05 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 23:13 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-18 22:50 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-18 23:55 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-18 23:47 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 10:08 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 11:37 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 10:59 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 12:17 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 12:27 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 15:23 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 14:41 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 15:56 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:55 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 12:23 -0600
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 14:47 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 15:19 -0500
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 14:37 -0600
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 15:48 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:28 -0400
Re: What is a computation? (There is no weaseling out of this) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 15:51 -0600
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:14 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 16:19 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 17:31 -0400
Re: What is a computation? (Simulating a function call to a TM) olcott <NoOne@NoWhere.com> - 2021-04-19 16:40 -0500
Re: What is a computation? (Simulating a function call to a TM) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 18:00 -0400
Re: What is a computation? (There is no weaseling out of this) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-18 23:00 -0700
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 07:21 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 10:13 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 07:20 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 10:13 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 11:38 -0400
Re: What is a computation? (There is no weaseling out of this) olcott <NoOne@NoWhere.com> - 2021-04-19 11:00 -0500
Re: What is a computation? (There is no weaseling out of this) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 12:26 -0400
Re: What is a computation? (There is no weaseling out of this) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 23:28 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 17:31 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 18:40 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 21:14 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 22:26 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 21:36 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 07:31 -0400
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 16:59 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 21:12 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 20:47 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 22:01 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 21:22 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 22:39 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 21:43 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 22:56 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-19 21:10 -0700
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 22:29 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 23:35 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 22:42 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-19 23:51 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-19 23:02 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 00:06 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 11:50 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 10:35 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:50 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 10:56 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:01 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 11:14 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:40 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 11:47 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 15:03 -0400
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 11:57 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 13:21 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 12:45 -0600
Re: What is a computation? (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 14:47 -0500
Re: What is a computation? (equivalent definitions) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 14:06 -0600
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 15:21 -0500
Re: What is a computation? (too stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 20:32 +0000
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 15:50 -0500
Re: What is a computation? (too stupid?) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 16:01 -0600
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 17:08 -0500
Re: What is a computation? (too stupid?) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 16:18 -0600
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 17:36 -0500
Re: What is a computation? (too stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 18:46 -0400
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 17:58 -0500
Re: What is a computation? (too stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:24 -0400
Re: What is a computation? (too stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 22:28 +0000
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 17:45 -0500
Re: What is a computation? (internal state) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 20:56 -0400
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 20:11 -0500
Re: What is a computation? (too stupid?) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 14:34 -0600
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 15:42 -0500
Re: What is a computation? (too stupid?) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 15:19 -0600
Re: What is a computation? (too stupid!) olcott <NoOne@NoWhere.com> - 2021-04-20 16:35 -0500
Re: What is a computation? (too stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 16:35 -0400
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 15:51 -0500
Re: What is a computation? (too stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 17:30 -0400
Re: What is a computation? (too stupid?) olcott <NoOne@NoWhere.com> - 2021-04-20 16:57 -0500
Re: What is a computation? (too stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 18:50 -0400
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-20 12:59 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 15:15 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 20:14 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 14:34 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 13:39 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 14:50 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 14:11 -0600
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 16:31 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 16:30 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 16:33 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-20 14:56 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 17:11 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 15:09 -0700
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 17:57 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 17:13 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 16:25 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 17:39 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 16:56 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 18:05 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 17:29 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 18:43 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 18:02 -0600
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 18:04 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 19:12 -0500
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 19:19 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 18:29 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 19:44 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 19:25 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 21:56 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 22:20 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 23:32 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 22:40 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 23:47 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 23:10 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 00:19 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 23:34 -0600
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 23:40 -0600
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 08:03 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 07:26 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:40 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:34 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:29 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 18:59 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 18:09 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:42 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 18:53 -0400
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 22:26 +0000
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 17:44 -0500
Re: What is a computation? (internal state) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-20 15:49 -0700
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 17:59 -0500
Re: What is a computation? (internal state) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-20 16:22 -0700
Re: What is a computation? (internal state) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 19:23 -0400
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 18:32 -0500
Re: What is a computation? (internal state) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:47 -0400
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-20 21:59 -0500
Re: What is a computation? (internal state) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 08:08 -0400
Re: What is a computation? (internal state) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-21 05:27 -0700
Re: What is a computation? (internal state) olcott <NoOne@NoWhere.com> - 2021-04-21 09:16 -0500
Re: What is a computation? (internal state) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 16:12 +0100
Re: What is a computation? (internal state) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 15:05 -0700
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 03:34 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 21:53 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 04:00 +0100
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 07:42 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-20 22:15 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 07:53 -0400
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 15:40 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 10:30 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-21 16:19 +0000
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 12:47 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 12:57 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 15:03 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 15:09 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 16:34 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 15:47 -0500
Re: What is a computation? (sufficiently Turing equivalent) André G. Isaak <agisaak@gm.invalid> - 2021-04-21 15:13 -0600
Re: What is a computation? (sufficiently Turing equivalent) Jeff Barnett <jbb@notatt.com> - 2021-04-22 02:17 -0600
Re: What is a computation? (sufficiently Turing equivalent) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 01:26 -0700
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 15:54 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 17:10 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 16:19 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 17:33 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 16:54 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 18:06 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 17:34 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 18:55 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-21 19:19 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 07:44 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-22 09:40 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 11:28 -0400
Re: What is a computation? (sufficiently Turing equivalent) olcott <NoOne@NoWhere.com> - 2021-04-22 10:44 -0500
Re: What is a computation? (sufficiently Turing equivalent) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 12:04 -0400
Re: What is a computation? (sufficiently Turing equivalent) André G. Isaak <agisaak@gm.invalid> - 2021-04-21 17:45 -0600
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 19:45 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 15:06 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 00:09 +0100
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 16:17 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 19:00 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 01:57 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 20:13 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 19:38 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 21:43 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 19:55 -0700
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:37 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 09:50 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 11:30 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 10:46 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 12:05 -0400
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 12:57 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 14:59 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 13:05 -0700
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 17:13 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 12:18 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 13:06 -0700
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 20:53 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:01 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 21:22 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:36 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 14:42 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 17:23 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 15:37 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 17:52 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 22:05 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:21 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 14:44 -0700
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 23:09 +0100
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 23:40 -0700
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 18:26 -0700
Re: What is a computation? (TM Y calls TM X) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-04-22 04:04 +0100
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 20:27 -0700
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 22:23 -0700
Re: What is a computation? (TM Y calls TM X) Jeff Barnett <jbb@notatt.com> - 2021-04-22 02:30 -0600
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 01:46 -0700
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:32 -0400
Re: What is a computation? (RIP relative TM) olcott <NoOne@NoWhere.com> - 2021-04-22 09:45 -0500
Re: What is a computation? (RIP relative TM) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 11:38 -0400
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 14:45 -0700
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-21 20:08 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 15:16 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 17:04 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 16:10 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-21 15:22 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 16:24 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 17:40 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 17:04 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 18:18 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 18:35 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 01:14 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 19:20 -0500
Re: What is a computation? (identical set)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-21 19:39 -0500
Re: What is a computation? (identical set)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:45 -0400
Re: What is a computation? (identical set)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 09:57 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:42 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 09:55 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 11:43 -0400
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-21 15:53 -0600
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 17:01 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 18:47 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 17:26 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 16:48 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 18:16 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 17:45 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 19:00 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:48 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 09:58 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 11:51 -0400
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 03:16 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-21 22:29 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 22:34 -0700
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-21 22:37 -0700
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 09:37 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 12:22 -0700
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 08:51 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 10:01 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 15:45 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 10:51 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 17:19 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 12:36 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 18:44 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 14:01 -0500
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 12:26 -0700
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 19:51 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 14:58 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 20:52 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:00 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 17:17 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:23 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 17:47 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 17:26 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 18:39 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 17:58 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 21:47 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 20:57 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 22:17 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 22:01 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 07:33 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 09:22 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 11:11 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 10:22 -0500
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-23 15:26 +0000
Re: What is a computation? (x86 TM) olcott <NoOne@NoWhere.com> - 2021-04-23 10:42 -0500
Re: What is a computation? (x86 TM) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:07 -0400
Re: What is a computation? (x86 TM) olcott <NoOne@NoWhere.com> - 2021-04-23 11:15 -0500
Re: What is a computation? (x86 TM) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:27 -0400
Re: What is a computation? (x86 TM) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-23 09:33 -0700
Re: What is a computation? (x86 TM) olcott <NoOne@NoWhere.com> - 2021-04-23 11:43 -0500
Re: What is a computation? (x86 TM) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 13:31 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:09 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 11:18 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:28 -0400
Re: What is a computation? (TM Y calls TM X) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-22 21:21 +0000
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 16:32 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 17:56 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 17:34 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 18:43 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 18:06 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 00:49 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 19:03 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 01:15 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 19:21 -0500
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 01:51 +0100
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 20:08 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 21:55 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 21:48 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 21:50 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 21:47 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 07:35 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 09:24 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 11:15 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 10:29 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:17 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-23 11:23 -0500
Re: What is a computation? (TM Y calls TM X) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 10:56 -0600
Re: What is a computation? (unlimited linked list) olcott <NoOne@NoWhere.com> - 2021-04-23 12:04 -0500
Re: What is a computation? (unlimited linked list) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 13:35 -0400
Re: What is a computation? (unlimited linked list) olcott <NoOne@NoWhere.com> - 2021-04-23 12:42 -0500
Re: What is a computation? (unlimited linked list) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 12:05 -0600
Re: What is a computation? (unlimited linked list) olcott <NoOne@NoWhere.com> - 2021-04-23 13:43 -0500
Re: What is a computation? (unlimited linked list) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 12:58 -0600
Re: What is a computation? (unlimited linked list) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 14:26 -0400
Re: What is a computation? (unlimited linked list) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 11:57 -0600
Re: What is a computation? (unlimited linked list) olcott <NoOne@NoWhere.com> - 2021-04-23 13:38 -0500
Re: What is a computation? (unlimited linked list) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 12:53 -0600
Re: What is a computation? (unlimited linked list) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 15:26 -0400
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 13:33 -0400
Re: What is a computation? (TM Y calls TM X) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-22 12:25 -0700
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 15:45 -0400
Re: What is a computation? (TM Y calls TM X) olcott <NoOne@NoWhere.com> - 2021-04-22 15:11 -0500
Re: What is a computation? (TM Y calls TM X) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 17:21 -0400
Re: What is a computation? (TM Y calls TM X) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 22:39 +0100
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 17:17 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 18:30 -0400
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 17:40 -0500
Re: What is a computation? (key element) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 00:55 +0100
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 19:05 -0500
Re: What is a computation? (key element) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 01:41 +0100
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 20:05 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 22:08 -0400
Re: What is a computation? (key element) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 03:10 +0100
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 21:17 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 22:42 -0400
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-22 22:17 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 07:41 -0400
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-23 09:26 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 11:16 -0400
Re: What is a computation? (key element) olcott <NoOne@NoWhere.com> - 2021-04-23 10:33 -0500
Re: What is a computation? (key element) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:20 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 11:29 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 13:36 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 12:40 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 14:36 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 14:01 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 15:27 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 14:51 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 19:29 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 18:49 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 21:42 -0400
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 14:47 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 15:53 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 15:49 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 17:30 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 19:32 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 18:54 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 21:44 -0400
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 17:49 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 19:01 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 18:24 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 20:26 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 19:51 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 22:30 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-23 22:20 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-23 23:38 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 09:44 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 09:17 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 14:43 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 13:47 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 15:12 -0400
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 09:43 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 09:13 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-24 09:26 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 10:42 -0500
Re: What is a computation? (tautology) André G. Isaak <agisaak@gm.invalid> - 2021-04-24 11:28 -0600
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 12:40 -0500
Re: What is a computation? (tautology) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-24 18:07 +0000
Re: What is a computation? (tautology)(Kaz is proved wrong) olcott <NoOne@NoWhere.com> - 2021-04-24 13:22 -0500
Re: What is a computation? (tautology)(Kaz is proved wrong) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-25 03:06 +0000
Re: What is a computation? (tautology)(Kaz is proved wrong) olcott <NoOne@NoWhere.com> - 2021-04-24 22:20 -0500
Re: What is a computation? (tautology)(Kaz is proved wrong) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-25 19:38 +0000
Re: What is a computation? (tautology)(Kaz is proved wrong) olcott <NoOne@NoWhere.com> - 2021-04-25 14:45 -0500
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 12:53 -0500
Re: What is a computation? (tautology) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-24 12:15 -0700
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 14:20 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 15:38 -0400
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 14:50 -0500
Re: What is a computation? (tautology) olcott <NoOne@NoWhere.com> - 2021-04-24 14:56 -0500
Re: What is a computation? (tautology) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 16:28 -0400
Re: What is a computation? (freaking numbskull) olcott <NoOne@NoWhere.com> - 2021-04-24 15:32 -0500
Re: What is a computation? (freaking numbskull) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 16:35 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-24 20:47 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 22:16 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-24 21:27 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-24 23:11 -0400
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-24 22:24 -0500
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 07:30 -0400
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 09:38 -0500
Re: What is a computation? (ultimate authority) André G. Isaak <agisaak@gm.invalid> - 2021-04-25 10:33 -0600
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 12:53 -0500
Re: What is a computation? (ultimate authority) André G. Isaak <agisaak@gm.invalid> - 2021-04-25 12:10 -0600
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 13:14 -0500
Re: What is a computation? (ultimate authority) André G. Isaak <agisaak@gm.invalid> - 2021-04-25 12:47 -0600
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 14:28 -0500
Re: What is a computation? (ultimate authority) André G. Isaak <agisaak@gm.invalid> - 2021-04-25 13:42 -0600
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 22:25 -0500
Re: What is a computation? (ultimate authority) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-26 11:39 +0100
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 06:49 -0400
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 19:44 -0400
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 19:42 -0400
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 19:37 -0400
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 12:39 -0400
Re: What is a computation? (ultimate authority) olcott <NoOne@NoWhere.com> - 2021-04-25 12:54 -0500
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 19:45 -0400
Re: What is a computation? (ultimate authority) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 07:36 -0400
Re: What is a computation? (legitimate difficulty) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-25 02:14 -0700
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-25 09:11 -0500
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-25 09:54 -0500
Re: What is a computation? (legitimate difficulty) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-25 09:22 -0700
Re: What is a computation? [ Must_be_Stopped(x) ] olcott <NoOne@NoWhere.com> - 2021-04-25 12:50 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 12:44 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-25 12:59 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 20:15 -0400
Re: What is a computation? (legitimate difficulty) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-25 21:56 +0100
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-25 22:53 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-25 21:58 -0600
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 06:55 -0400
Re: What is a computation? (legitimate difficulty) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-26 05:01 -0700
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 09:22 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 11:01 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 10:07 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 11:32 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 11:01 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 12:22 -0400
Re: What is a computation? (legitimate difficulty) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-26 14:15 +0100
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 09:10 -0500
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 09:16 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 08:17 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 09:25 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 08:42 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 09:51 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 11:32 -0600
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 13:39 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 13:51 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 15:26 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 15:03 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 16:16 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 15:28 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 16:53 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 13:48 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 13:08 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 14:59 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 16:07 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 15:15 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 16:57 -0400
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 14:35 -0600
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 21:02 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 20:53 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 22:11 -0400
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 23:15 -0500
Re: What is a computation? (legitimate difficulty) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-27 01:21 +0100
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 19:31 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 20:54 -0400
Re: What is a computation? (legitimate difficulty) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-27 02:18 +0100
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 21:02 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-26 22:13 -0400
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 20:56 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 22:06 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 22:14 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 23:16 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 22:32 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 23:44 -0500
Re: What is a computation? (legitimate difficulty) André G. Isaak <agisaak@gm.invalid> - 2021-04-26 22:48 -0600
Re: What is a computation? (legitimate difficulty) olcott <NoOne@NoWhere.com> - 2021-04-26 23:55 -0500
Re: What is a computation? (legitimate difficulty) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 07:14 -0400
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 09:13 -0500
Re: What is a computation? (lack of software engineering skill) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 10:53 -0400
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 09:59 -0500
Re: What is a computation? (lack of software engineering skill) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 11:25 -0400
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 17:38 -0500
Re: What is a computation? (lack of software engineering skill) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 19:12 -0400
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 18:22 -0500
Re: What is a computation? (lack of software engineering skill) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 19:26 -0400
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-27 09:06 -0600
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 17:34 -0500
Re: What is a computation? (lack of software engineering skill) Richard Damon <Richard@Damon-Family.org> - 2021-04-27 19:23 -0400
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-27 18:32 -0600
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 19:50 -0500
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-27 19:01 -0600
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 21:42 -0500
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-27 21:38 -0600
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-27 23:15 -0500
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-27 23:04 -0600
Re: What is a computation? (lack of software engineering skill) olcott <NoOne@NoWhere.com> - 2021-04-28 09:11 -0500
Re: What is a computation? (lack of software engineering skill) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 08:33 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 10:25 -0500
Re: What is a computation? (honest dialogue ?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-28 09:12 -0700
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 11:46 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 11:33 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 12:37 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 13:06 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 14:24 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 13:36 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 15:16 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 14:53 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 16:09 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 15:42 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 16:50 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 16:34 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 17:39 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 17:18 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 18:45 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 18:01 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 19:11 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 19:00 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 20:07 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 19:20 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 20:28 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 20:31 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 22:12 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 22:01 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-28 23:09 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-28 23:37 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 08:53 -0500
Re: What is a computation? (honest dialogue ?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-29 15:45 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-29 11:41 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-29 16:50 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-29 12:28 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-29 21:41 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-29 19:24 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-30 02:38 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-29 22:01 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-30 05:47 +0000
Re: What is a computation? (honest dialogue ?)(conflation) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-30 05:15 -0700
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 15:32 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 09:36 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:14 -0400
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 16:32 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 20:12 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 02:21 +0100
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 21:35 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 20:40 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-05-01 09:04 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 08:25 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-01 14:31 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 09:49 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-01 15:22 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 12:13 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-01 18:47 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 13:57 -0500
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 09:43 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-05-01 12:04 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 12:26 -0500
Re: What is a computation? (honest dialogue ?)(conflation) André G. Isaak <agisaak@gm.invalid> - 2021-05-01 12:28 -0600
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 13:40 -0500
Re: What is a computation? (honest dialogue ?)(conflation) André G. Isaak <agisaak@gm.invalid> - 2021-05-01 13:06 -0600
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 14:11 -0500
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 14:21 -0500
Re: What is a computation? (honest dialogue ?)(conflation) André G. Isaak <agisaak@gm.invalid> - 2021-05-01 14:17 -0600
Re: What is a computation? (honest dialogue ?)(conflation) Jeff Barnett <jbb@notatt.com> - 2021-05-01 16:49 -0600
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-05-01 17:56 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 17:35 -0500
Re: What is a computation? (honest dialogue ?)(conflation) André G. Isaak <agisaak@gm.invalid> - 2021-05-01 16:48 -0600
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-05-01 18:52 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 08:33 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 15:42 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 10:10 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:15 -0400
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 23:14 +0100
Re: What is a computation? (honest dialogue ?)(conflation) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-30 16:40 +0000
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 11:48 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 16:38 -0400
Re: What is a computation? (honest dialogue ?)(semantic tautology) olcott <NoOne@NoWhere.com> - 2021-04-30 12:09 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 08:49 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 09:24 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 16:12 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 20:08 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 02:58 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-30 21:48 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 22:49 +0100
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-05-01 18:11 -0500
Re: What is a computation? (honest dialogue ?)(conflation) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 01:49 +0100
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:13 -0400
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:45 -0400
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:23 -0400
Re: What is a computation? (honest dialogue ?)(conflation) Jeff Barnett <jbb@notatt.com> - 2021-04-29 21:44 -0600
Re: What is a computation? (honest dialogue ?)(conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:22 -0400
Re: What is a computation? (honest dialogue ?)(conflation) olcott <NoOne@NoWhere.com> - 2021-04-29 11:39 -0500
Re: What is a computation? (honest dialogue ?) André G. Isaak <agisaak@gm.invalid> - 2021-04-29 10:58 -0600
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 12:38 -0500
Re: What is a computation? (honest dialogue ?)(keeps repeating until addressed) olcott <NoOne@NoWhere.com> - 2021-04-29 20:36 -0500
Re: What is a computation? (honest dialogue ?)(keeps repeating until addressed) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 22:01 -0400
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:18 -0400
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:14 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-29 23:24 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 19:06 -0500
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:32 -0400
Re: What is a computation? (honest dialogue ?) olcott <polcott2@gmail.com> - 2021-04-29 19:08 -0500
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 01:17 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 19:27 -0500
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 01:50 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 20:42 -0500
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 14:10 +0100
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 09:19 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 15:29 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-30 09:35 -0500
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:50 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 22:24 +0100
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:47 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 22:12 +0100
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 18:46 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 00:44 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-30 19:53 -0500
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-30 09:10 -0500
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 10:21 -0400
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-30 09:28 -0500
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-30 11:52 -0400
Re: What is a computation? (honest dialogue ?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-30 16:30 +0100
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 19:29 -0500
Re: What is a computation? (honest dialogue ?) Richard Damon <Richard@Damon-Family.org> - 2021-04-29 21:35 -0400
Re: What is a computation? (honest dialogue ?) olcott <NoOne@NoWhere.com> - 2021-04-29 20:18 -0500
Page 16 of 50 — ← Prev page 1 … 14 15 [16] 17 18 … 50 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-19 17:40 +0000 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <20210419103306.292@kylheku.com> |
| In reply to | #31464 |
On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: > Although it may be true that all pure functions are computations it is > apparently not true that computations are limited to only pure functions. In the context in which we find ourselves, "computation" and "pure function" are synonymous. A computation is a transformation of a specific input (that is defined in every detail, down to the last bit) to an output. The only way in which we can regard an imperative procedure as a computation is by regarding regard the global, mutating state which it works with to be part of the input. Note that I am not looking for comments in regard to what I am writing here; I am simply a messenger, passing on a small bit of standard education that you are lacking. I didn't invent that education, so if you have a problem with it, I invite you to take it up with the tomes laying on the shelves of your nearest computer science or mathematics library. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-19 13:45 -0400 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <nljfI.9090$AU5.3216@fx29.iad> |
| In reply to | #31465 |
On 4/19/21 1:40 PM, Kaz Kylheku wrote: > On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >> Although it may be true that all pure functions are computations it is >> apparently not true that computations are limited to only pure functions. > > In the context in which we find ourselves, "computation" and "pure > function" are synonymous. A computation is a transformation of a > specific input (that is defined in every detail, down to the last bit) > to an output. > > The only way in which we can regard an imperative procedure as a > computation is by regarding regard the global, mutating state which it > works with to be part of the input. > > Note that I am not looking for comments in regard to what I am writing > here; I am simply a messenger, passing on a small bit of standard > education that you are lacking. > > I didn't invent that education, so if you have a problem with it, I > invite you to take it up with the tomes laying on the shelves of your > nearest computer science or mathematics library. > Yes, I will often add the intensifies to the words to remind PO that in the discipline, we are really talking about a fairly specific thing, and that not just anything that a computer does taken as a piece is actually what is defined as a Computation, since he seems to want to use the word that way. PO seems a bit dense when it comes to needing to follow the definition in a field to be working in that field.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 12:57 -0500 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <gv-dnaeOkPg_WeD9nZ2dnUU78L3NnZ2d@giganews.com> |
| In reply to | #31465 |
On 4/19/2021 12:40 PM, Kaz Kylheku wrote: > On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >> Although it may be true that all pure functions are computations it is >> apparently not true that computations are limited to only pure functions. > > In the context in which we find ourselves, "computation" and "pure > function" are synonymous. A computation is a transformation of a > specific input (that is defined in every detail, down to the last bit) > to an output. > > The only way in which we can regard an imperative procedure as a > computation is by regarding regard the global, mutating state which it > works with to be part of the input. > When A halt decider simulates the execution of a pair of finite string inputs then all of this simulation is a pure function of its inputs including the parts where the halt decider may be simulating the execution of itself. > Note that I am not looking for comments in regard to what I am writing > here; I am simply a messenger, passing on a small bit of standard > education that you are lacking. > > I didn't invent that education, so if you have a problem with it, I > invite you to take it up with the tomes laying on the shelves of your > nearest computer science or mathematics library. > -- 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-04-19 14:22 -0400 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <mTjfI.3028$mT7.935@fx22.iad> |
| In reply to | #31469 |
On 4/19/21 1:57 PM, olcott wrote: > On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>> Although it may be true that all pure functions are computations it is >>> apparently not true that computations are limited to only pure >>> functions. >> >> In the context in which we find ourselves, "computation" and "pure >> function" are synonymous. A computation is a transformation of a >> specific input (that is defined in every detail, down to the last bit) >> to an output. >> >> The only way in which we can regard an imperative procedure as a >> computation is by regarding regard the global, mutating state which it >> works with to be part of the input. >> > > When A halt decider simulates the execution of a pair of finite string > inputs then all of this simulation is a pure function of its inputs > including the parts where the halt decider may be simulating the > execution of itself. > IF the halt decider is a pure function of its inputs, and those inputs are, and only are, the provide machine and input descriptions (which means that any version of itself used by the machine will be in that input) then it will ALWAYS answer the same to every invocation of it, whether or not the halt decider is the sole Top Level Turing Machine or a Sub Computation of a machine that sets up the tape properly for it, and regardless of whether that input description happens to be a description of the Machine that is invoking it. Right? Any machine that doesn't meet the above requirements doesn't meet the requirements to BE a Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 13:50 -0500 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <AuGdnc0bCJx6TeD9nZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #31471 |
On 4/19/2021 1:22 PM, Richard Damon wrote: > On 4/19/21 1:57 PM, olcott wrote: >> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>> Although it may be true that all pure functions are computations it is >>>> apparently not true that computations are limited to only pure >>>> functions. >>> >>> In the context in which we find ourselves, "computation" and "pure >>> function" are synonymous. A computation is a transformation of a >>> specific input (that is defined in every detail, down to the last bit) >>> to an output. >>> >>> The only way in which we can regard an imperative procedure as a >>> computation is by regarding regard the global, mutating state which it >>> works with to be part of the input. >>> >> >> When A halt decider simulates the execution of a pair of finite string >> inputs then all of this simulation is a pure function of its inputs >> including the parts where the halt decider may be simulating the >> execution of itself. >> > > IF the halt decider is a pure function of its inputs, and those inputs > are, and only are, the provide machine and input descriptions (which > means that any version of itself used by the machine will be in that > input) then it will ALWAYS answer the same to every invocation of it, > whether or not the halt decider is the sole Top Level Turing Machine or > a Sub Computation of a machine that sets up the tape properly for it, > and regardless of whether that input description happens to be a > description of the Machine that is invoking it. > > Right? > > Any machine that doesn't meet the above requirements doesn't meet the > requirements to BE a Halt Decider. > What I said above AND the halt decider cannot provide its correct non halting decision until it has sufficiently simulated its input to the point where it can correctly decide non halting. The halt decider does not decide halting it simply waits until the input halts on its own then returns 1 for halting. Halts and H_Hat only exist as unique machine descriptions on the master UTM tape. When the master UTM simulates Halts with its input Halts simulates H_Hat with its input. In the x86 model of computation The simuluted H_Hat simply invokes Halts within this same simulation controlled by Halts. -- 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-04-19 15:11 -0400 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <iBkfI.19568$ft1.8815@fx10.iad> |
| In reply to | #31476 |
On 4/19/21 2:50 PM, olcott wrote: > On 4/19/2021 1:22 PM, Richard Damon wrote: >> On 4/19/21 1:57 PM, olcott wrote: >>> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>>> Although it may be true that all pure functions are computations it is >>>>> apparently not true that computations are limited to only pure >>>>> functions. >>>> >>>> In the context in which we find ourselves, "computation" and "pure >>>> function" are synonymous. A computation is a transformation of a >>>> specific input (that is defined in every detail, down to the last bit) >>>> to an output. >>>> >>>> The only way in which we can regard an imperative procedure as a >>>> computation is by regarding regard the global, mutating state which it >>>> works with to be part of the input. >>>> >>> >>> When A halt decider simulates the execution of a pair of finite string >>> inputs then all of this simulation is a pure function of its inputs >>> including the parts where the halt decider may be simulating the >>> execution of itself. >>> >> >> IF the halt decider is a pure function of its inputs, and those inputs >> are, and only are, the provide machine and input descriptions (which >> means that any version of itself used by the machine will be in that >> input) then it will ALWAYS answer the same to every invocation of it, >> whether or not the halt decider is the sole Top Level Turing Machine or >> a Sub Computation of a machine that sets up the tape properly for it, >> and regardless of whether that input description happens to be a >> description of the Machine that is invoking it. >> >> Right? >> >> Any machine that doesn't meet the above requirements doesn't meet the >> requirements to BE a Halt Decider. >> > > What I said above AND the halt decider cannot provide its correct non > halting decision until it has sufficiently simulated its input to the > point where it can correctly decide non halting. The fact that you need to perform this cheat, doesn't make the cheat legal. As I mentioned before, try peeking at the other players cards in poker, only way to make sure you win, good way to get dead in a cutthroat game. > > The halt decider does not decide halting it simply waits until the input > halts on its own then returns 1 for halting. A decider that does JUST that will never decide non-halting and fails to meet the requirements, it is basically worthless. > > Halts and H_Hat only exist as unique machine descriptions on the master > UTM tape. > To express the system properly, ie to Run Halts(H_Hat, H_Hat) you will need one copy of an unalderated Halts decription on the tape, it will then have a copy of the description for H_Hat, which MUST include its own copy of a slightly modified Halts, and then there will be a second copy of H_Hat as H_Hats input, which also includes a copyt of the modified Halts. The description of H_Hat MUST include a copy of Halts, as that description needs to be a description of the actual machine H_Hat, which needs to be able to run on its own, and thus must have ALL the code that is in it. This is fundamental to the nature or Turing Machines, despite you futile claims to the contrary, Thus, the input tape to your master UTM will have 3 copies of things that are representations of the algorithm of Halts. Those representations also do NOT need to be identical (just the same algorithm). > When the master UTM simulates Halts with its input Halts simulates H_Hat > with its input. > > In the x86 model of computation The simuluted H_Hat simply invokes Halts > within this same simulation controlled by Halts. > But, we need to have the machines expressed in the equivalent of the Turning Machine model of computation, so everything needs to be self contained. You can only optimize out duplication if this provides IDENTICAL resutls, if it doesn't then you are not running the Turing Equivalent Machine, by definition.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 14:23 -0500 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <hbqdnVWnot4BReD9nZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #31477 |
On 4/19/2021 2:11 PM, Richard Damon wrote: > On 4/19/21 2:50 PM, olcott wrote: >> On 4/19/2021 1:22 PM, Richard Damon wrote: >>> On 4/19/21 1:57 PM, olcott wrote: >>>> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>>>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>>>> Although it may be true that all pure functions are computations it is >>>>>> apparently not true that computations are limited to only pure >>>>>> functions. >>>>> >>>>> In the context in which we find ourselves, "computation" and "pure >>>>> function" are synonymous. A computation is a transformation of a >>>>> specific input (that is defined in every detail, down to the last bit) >>>>> to an output. >>>>> >>>>> The only way in which we can regard an imperative procedure as a >>>>> computation is by regarding regard the global, mutating state which it >>>>> works with to be part of the input. >>>>> >>>> >>>> When A halt decider simulates the execution of a pair of finite string >>>> inputs then all of this simulation is a pure function of its inputs >>>> including the parts where the halt decider may be simulating the >>>> execution of itself. >>>> >>> >>> IF the halt decider is a pure function of its inputs, and those inputs >>> are, and only are, the provide machine and input descriptions (which >>> means that any version of itself used by the machine will be in that >>> input) then it will ALWAYS answer the same to every invocation of it, >>> whether or not the halt decider is the sole Top Level Turing Machine or >>> a Sub Computation of a machine that sets up the tape properly for it, >>> and regardless of whether that input description happens to be a >>> description of the Machine that is invoking it. >>> >>> Right? >>> >>> Any machine that doesn't meet the above requirements doesn't meet the >>> requirements to BE a Halt Decider. >>> >> >> What I said above AND the halt decider cannot provide its correct non >> halting decision until it has sufficiently simulated its input to the >> point where it can correctly decide non halting. > > The fact that you need to perform this cheat, doesn't make the cheat > legal. As I mentioned before, try peeking at the other players cards in > poker, only way to make sure you win, good way to get dead in a > cutthroat game. > >> >> The halt decider does not decide halting it simply waits until the input >> halts on its own then returns 1 for halting. > > A decider that does JUST that will never decide non-halting and fails to > meet the requirements, it is basically worthless. If it never decides not halting then the default is halting. >> >> Halts and H_Hat only exist as unique machine descriptions on the master >> UTM tape. >> > > To express the system properly, ie to Run Halts(H_Hat, H_Hat) you will > need one copy of an unadulterated Halts description on the tape, it will > then have a copy of the description for H_Hat, which MUST include its > own copy of a slightly modified Halts, and then there will be a second > copy of H_Hat as H_Hats input, which also includes a copy of the > modified Halts. > The description of H_Hat MUST include a copy of Halts, as that > description needs to be a description of the actual machine H_Hat, which > needs to be able to run on its own, and thus must have ALL the code that > is in it. This is fundamental to the nature or Turing Machines, despite > you futile claims to the contrary, > Because You are a Jackass I am stopping here: When UTM X has the machine description of UTM Y on its tape then UTM X can simulate UTM Y and examine the portion of its own tape allocated to UTM Y for the result of the computation of Y. This is how UTM X can simulate a function call to UTM Y. It is stipulated that UTM X has the Turing machine description of UTM Y and the input to UTM Y on the UTM X tape. I will no longer tolerate fake rebuttals that use dogmatic assertions and ignoring my replies as their fundamental basis. -- 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-04-19 16:44 -0400 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <tYlfI.13453$Ms7.3126@fx34.iad> |
| In reply to | #31478 |
On 4/19/21 3:23 PM, olcott wrote: > On 4/19/2021 2:11 PM, Richard Damon wrote: >> On 4/19/21 2:50 PM, olcott wrote: >>> On 4/19/2021 1:22 PM, Richard Damon wrote: >>>> On 4/19/21 1:57 PM, olcott wrote: >>>>> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>>>>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>>>>> Although it may be true that all pure functions are computations >>>>>>> it is >>>>>>> apparently not true that computations are limited to only pure >>>>>>> functions. >>>>>> >>>>>> In the context in which we find ourselves, "computation" and "pure >>>>>> function" are synonymous. A computation is a transformation of a >>>>>> specific input (that is defined in every detail, down to the last >>>>>> bit) >>>>>> to an output. >>>>>> >>>>>> The only way in which we can regard an imperative procedure as a >>>>>> computation is by regarding regard the global, mutating state >>>>>> which it >>>>>> works with to be part of the input. >>>>>> >>>>> >>>>> When A halt decider simulates the execution of a pair of finite string >>>>> inputs then all of this simulation is a pure function of its inputs >>>>> including the parts where the halt decider may be simulating the >>>>> execution of itself. >>>>> >>>> >>>> IF the halt decider is a pure function of its inputs, and those inputs >>>> are, and only are, the provide machine and input descriptions (which >>>> means that any version of itself used by the machine will be in that >>>> input) then it will ALWAYS answer the same to every invocation of it, >>>> whether or not the halt decider is the sole Top Level Turing Machine or >>>> a Sub Computation of a machine that sets up the tape properly for it, >>>> and regardless of whether that input description happens to be a >>>> description of the Machine that is invoking it. >>>> >>>> Right? >>>> >>>> Any machine that doesn't meet the above requirements doesn't meet the >>>> requirements to BE a Halt Decider. >>>> >>> >>> What I said above AND the halt decider cannot provide its correct non >>> halting decision until it has sufficiently simulated its input to the >>> point where it can correctly decide non halting. >> >> The fact that you need to perform this cheat, doesn't make the cheat >> legal. As I mentioned before, try peeking at the other players cards in >> poker, only way to make sure you win, good way to get dead in a >> cutthroat game. >> >>> >>> The halt decider does not decide halting it simply waits until the input >>> halts on its own then returns 1 for halting. >> >> A decider that does JUST that will never decide non-halting and fails to >> meet the requirements, it is basically worthless. > > If it never decides not halting then the default is halting. > Mistyped that. A decider that never decides non-halting will fail to meet the requirements, as it won't answer in time. It is actually better to just run the machine and avoid the decider overhead, and you get the answer too >>> >>> Halts and H_Hat only exist as unique machine descriptions on the master >>> UTM tape. >>> >> >> To express the system properly, ie to Run Halts(H_Hat, H_Hat) you will >> need one copy of an unadulterated Halts description on the tape, it will >> then have a copy of the description for H_Hat, which MUST include its >> own copy of a slightly modified Halts, and then there will be a second >> copy of H_Hat as H_Hats input, which also includes a copy of the >> modified Halts. > >> The description of H_Hat MUST include a copy of Halts, as that >> description needs to be a description of the actual machine H_Hat, which >> needs to be able to run on its own, and thus must have ALL the code that >> is in it. This is fundamental to the nature or Turing Machines, despite >> you futile claims to the contrary, >> > > Because You are a Jackass I am stopping here: > > When UTM X has the machine description of UTM Y on its tape then UTM X > can simulate UTM Y and examine the portion of its own tape allocated to > UTM Y for the result of the computation of Y. This is how UTM X can > simulate a function call to UTM Y. It is stipulated that UTM X has the > Turing machine description of UTM Y and the input to UTM Y on the UTM X > tape. > > I will no longer tolerate fake rebuttals that use dogmatic assertions > and ignoring my replies as their fundamental basis. > > Yes, UTM X can execute whatever code TM Y wants to give it. Y CAN'T ask X to execute code it doesn't have. If X provides a 'back door' to allow Y to ask it to execute something that is just in X's space, then X fails to be a UTM, and Y fails to be a TM, because Y when run without the UTM has nobody to ask. Remember, fundamentally Turing Machine are TOTALLY SELF CONTAINED COMPUTING ENGINES. A Turing machine holds the FULL algorithm for its computation in its State Transition Table. It gets its input from its tape. It has NO access to any other information, so can not execute any parts of algorithms that are not there. If your coding requires you to be run under some special TM that is somewhat like a UTM but not exactly, then that code is NOT a Turing Machine by itself, but an instruction sequence to that outer TM, and together they perform a Computation. If a Computation like that needs something like that on the tape, then either that code needs to be considered as part of the input to that outer machine, or you put a prefix to that machine that writes that code to the tape from starting it. Which means that code IS in the machine when it starts. You REALLY need to study what Turing Machines are about before spouting all this nonsense.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 16:01 -0500 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <OOmdnUzSdfwScuD9nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #31487 |
On 4/19/2021 3:44 PM, Richard Damon wrote: > On 4/19/21 3:23 PM, olcott wrote: >> On 4/19/2021 2:11 PM, Richard Damon wrote: >>> On 4/19/21 2:50 PM, olcott wrote: >>>> On 4/19/2021 1:22 PM, Richard Damon wrote: >>>>> On 4/19/21 1:57 PM, olcott wrote: >>>>>> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>>>>>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> Although it may be true that all pure functions are computations >>>>>>>> it is >>>>>>>> apparently not true that computations are limited to only pure >>>>>>>> functions. >>>>>>> >>>>>>> In the context in which we find ourselves, "computation" and "pure >>>>>>> function" are synonymous. A computation is a transformation of a >>>>>>> specific input (that is defined in every detail, down to the last >>>>>>> bit) >>>>>>> to an output. >>>>>>> >>>>>>> The only way in which we can regard an imperative procedure as a >>>>>>> computation is by regarding regard the global, mutating state >>>>>>> which it >>>>>>> works with to be part of the input. >>>>>>> >>>>>> >>>>>> When A halt decider simulates the execution of a pair of finite string >>>>>> inputs then all of this simulation is a pure function of its inputs >>>>>> including the parts where the halt decider may be simulating the >>>>>> execution of itself. >>>>>> >>>>> >>>>> IF the halt decider is a pure function of its inputs, and those inputs >>>>> are, and only are, the provide machine and input descriptions (which >>>>> means that any version of itself used by the machine will be in that >>>>> input) then it will ALWAYS answer the same to every invocation of it, >>>>> whether or not the halt decider is the sole Top Level Turing Machine or >>>>> a Sub Computation of a machine that sets up the tape properly for it, >>>>> and regardless of whether that input description happens to be a >>>>> description of the Machine that is invoking it. >>>>> >>>>> Right? >>>>> >>>>> Any machine that doesn't meet the above requirements doesn't meet the >>>>> requirements to BE a Halt Decider. >>>>> >>>> >>>> What I said above AND the halt decider cannot provide its correct non >>>> halting decision until it has sufficiently simulated its input to the >>>> point where it can correctly decide non halting. >>> >>> The fact that you need to perform this cheat, doesn't make the cheat >>> legal. As I mentioned before, try peeking at the other players cards in >>> poker, only way to make sure you win, good way to get dead in a >>> cutthroat game. >>> >>>> >>>> The halt decider does not decide halting it simply waits until the input >>>> halts on its own then returns 1 for halting. >>> >>> A decider that does JUST that will never decide non-halting and fails to >>> meet the requirements, it is basically worthless. >> >> If it never decides not halting then the default is halting. >> > > Mistyped that. A decider that never decides non-halting will fail to > meet the requirements, as it won't answer in time. It is actually better > to just run the machine and avoid the decider overhead, and you get the > answer too > >>>> >>>> Halts and H_Hat only exist as unique machine descriptions on the master >>>> UTM tape. >>>> >>> >>> To express the system properly, ie to Run Halts(H_Hat, H_Hat) you will >>> need one copy of an unadulterated Halts description on the tape, it will >>> then have a copy of the description for H_Hat, which MUST include its >>> own copy of a slightly modified Halts, and then there will be a second >>> copy of H_Hat as H_Hats input, which also includes a copy of the >>> modified Halts. >> >>> The description of H_Hat MUST include a copy of Halts, as that >>> description needs to be a description of the actual machine H_Hat, which >>> needs to be able to run on its own, and thus must have ALL the code that >>> is in it. This is fundamental to the nature or Turing Machines, despite >>> you futile claims to the contrary, >>> >> >> Because You are a Jackass I am stopping here: >> >> When UTM X has the machine description of UTM Y on its tape then UTM X >> can simulate UTM Y and examine the portion of its own tape allocated to >> UTM Y for the result of the computation of Y. This is how UTM X can >> simulate a function call to UTM Y. It is stipulated that UTM X has the >> Turing machine description of UTM Y and the input to UTM Y on the UTM X >> tape. >> > Yes, UTM X can execute whatever code TM Y wants to give it. Do you agree with the above YES or NO? Everything else you said was quite dodgy, like you knew that the answer is YES yet wanted to avoid anything as straight forward as any sort of honest and direct answer. -- 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-04-19 17:52 -0400 |
| Subject | Re: Infinite recursion detection criteria (agreement check) |
| Message-ID | <QYmfI.22630$OF5.12045@fx07.iad> |
| In reply to | #31490 |
On 4/19/21 5:01 PM, olcott wrote: > On 4/19/2021 3:44 PM, Richard Damon wrote: >> On 4/19/21 3:23 PM, olcott wrote: >>> On 4/19/2021 2:11 PM, Richard Damon wrote: >>>> On 4/19/21 2:50 PM, olcott wrote: >>>>> On 4/19/2021 1:22 PM, Richard Damon wrote: >>>>>> On 4/19/21 1:57 PM, olcott wrote: >>>>>>> On 4/19/2021 12:40 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-04-19, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> Although it may be true that all pure functions are computations >>>>>>>>> it is >>>>>>>>> apparently not true that computations are limited to only pure >>>>>>>>> functions. >>>>>>>> >>>>>>>> In the context in which we find ourselves, "computation" and "pure >>>>>>>> function" are synonymous. A computation is a transformation of a >>>>>>>> specific input (that is defined in every detail, down to the last >>>>>>>> bit) >>>>>>>> to an output. >>>>>>>> >>>>>>>> The only way in which we can regard an imperative procedure as a >>>>>>>> computation is by regarding regard the global, mutating state >>>>>>>> which it >>>>>>>> works with to be part of the input. >>>>>>>> >>>>>>> >>>>>>> When A halt decider simulates the execution of a pair of finite >>>>>>> string >>>>>>> inputs then all of this simulation is a pure function of its inputs >>>>>>> including the parts where the halt decider may be simulating the >>>>>>> execution of itself. >>>>>>> >>>>>> >>>>>> IF the halt decider is a pure function of its inputs, and those >>>>>> inputs >>>>>> are, and only are, the provide machine and input descriptions (which >>>>>> means that any version of itself used by the machine will be in that >>>>>> input) then it will ALWAYS answer the same to every invocation of it, >>>>>> whether or not the halt decider is the sole Top Level Turing >>>>>> Machine or >>>>>> a Sub Computation of a machine that sets up the tape properly for it, >>>>>> and regardless of whether that input description happens to be a >>>>>> description of the Machine that is invoking it. >>>>>> >>>>>> Right? >>>>>> >>>>>> Any machine that doesn't meet the above requirements doesn't meet the >>>>>> requirements to BE a Halt Decider. >>>>>> >>>>> >>>>> What I said above AND the halt decider cannot provide its correct non >>>>> halting decision until it has sufficiently simulated its input to the >>>>> point where it can correctly decide non halting. >>>> >>>> The fact that you need to perform this cheat, doesn't make the cheat >>>> legal. As I mentioned before, try peeking at the other players cards in >>>> poker, only way to make sure you win, good way to get dead in a >>>> cutthroat game. >>>> >>>>> >>>>> The halt decider does not decide halting it simply waits until the >>>>> input >>>>> halts on its own then returns 1 for halting. >>>> >>>> A decider that does JUST that will never decide non-halting and >>>> fails to >>>> meet the requirements, it is basically worthless. >>> >>> If it never decides not halting then the default is halting. >>> >> >> Mistyped that. A decider that never decides non-halting will fail to >> meet the requirements, as it won't answer in time. It is actually better >> to just run the machine and avoid the decider overhead, and you get the >> answer too >> >>>>> >>>>> Halts and H_Hat only exist as unique machine descriptions on the >>>>> master >>>>> UTM tape. >>>>> >>>> >>>> To express the system properly, ie to Run Halts(H_Hat, H_Hat) you will >>>> need one copy of an unadulterated Halts description on the tape, it >>>> will >>>> then have a copy of the description for H_Hat, which MUST include its >>>> own copy of a slightly modified Halts, and then there will be a second >>>> copy of H_Hat as H_Hats input, which also includes a copy of the >>>> modified Halts. >>> >>>> The description of H_Hat MUST include a copy of Halts, as that >>>> description needs to be a description of the actual machine H_Hat, >>>> which >>>> needs to be able to run on its own, and thus must have ALL the code >>>> that >>>> is in it. This is fundamental to the nature or Turing Machines, despite >>>> you futile claims to the contrary, >>>> >>> >>> Because You are a Jackass I am stopping here: >>> >>> When UTM X has the machine description of UTM Y on its tape then UTM X >>> can simulate UTM Y and examine the portion of its own tape allocated to >>> UTM Y for the result of the computation of Y. This is how UTM X can >>> simulate a function call to UTM Y. It is stipulated that UTM X has the >>> Turing machine description of UTM Y and the input to UTM Y on the UTM X >>> tape. >>> > >> Yes, UTM X can execute whatever code TM Y wants to give it. > > Do you agree with the above YES or NO? > > Everything else you said was quite dodgy, like you knew that the answer > is YES yet wanted to avoid anything as straight forward as any sort of > honest and direct answer. > YES, UTM X works by operating on the code that is in Y. Y as it runs instructs X as to what it wants done. But Y can only ask X to make it perform based on what Y has available. You keep on asserting that Y can perform instuctions that it does not have. Remember the limits of what a Turing Machine can express. It asks that based on the current tape input symbol, go to one of a list of states, and possible write or move the tape. That input symbol is something that is on the tape that Y has, the virtual tape that X provides for it. The states it asks to go to are amound the states listed in its state transition table. There is no command 'Call H', only go to such and such a state. So it can't ask X to do that. X can execute what every code TM Y gives it, but what that code can be is very limited, and needed to be in Y.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-18 20:01 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <87r1j75sdm.fsf@bsb.me.uk> |
| In reply to | #31343 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Sunday, 18 April 2021 at 16:06:43 UTC+1, olcott wrote: >> On 4/18/2021 6:44 AM, Richard Damon wrote: >> > On 4/17/21 2:50 PM, olcott wrote: >> >> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >> >> >>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO >> >>> has fudged >> >>> this), >> >> >> >> It is not fudging to say that source code is interpreted rather than >> >> compiled. >> > >> > Just remember that H^ has a COPY of halt, not a 'call' to the version >> > that is in the halt decider. >> >> Just remember that I have and continue to stipulate otherwise. >> > This is one of those things like insisting on putting the hat in the > microwave before extracting the rabbit. It's legitimate in itself, but > it's eccentric, and it opens the door wide open to cheating. > > You can insist on x86 code instead of a Turing machine, you can even > reference external subroutine calls in the code. But the arrangement > means that is now extremely easy to use data that the Turing machine > does not have. That makes it sound like the halting theorem is a result of some kind of restriction that sets it apart from the sort of computing that we do every day. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-04-18 13:18 -0700 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <e330525b-ccf7-44fa-b969-bf4242f94ab2n@googlegroups.com> |
| In reply to | #31347 |
On Sunday, 18 April 2021 at 20:01:44 UTC+1, Ben Bacarisse wrote: > Malcolm McLean <malcolm.ar...@gmail.com> writes: > > > On Sunday, 18 April 2021 at 16:06:43 UTC+1, olcott wrote: > >> On 4/18/2021 6:44 AM, Richard Damon wrote: > >> > On 4/17/21 2:50 PM, olcott wrote: > >> >> On 4/17/2021 1:29 PM, Malcolm McLean wrote: > >> > >> >>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO > >> >>> has fudged > >> >>> this), > >> >> > >> >> It is not fudging to say that source code is interpreted rather than > >> >> compiled. > >> > > >> > Just remember that H^ has a COPY of halt, not a 'call' to the version > >> > that is in the halt decider. > >> > >> Just remember that I have and continue to stipulate otherwise. > >> > > This is one of those things like insisting on putting the hat in the > > microwave before extracting the rabbit. It's legitimate in itself, but > > it's eccentric, and it opens the door wide open to cheating. > > > > You can insist on x86 code instead of a Turing machine, you can even > > reference external subroutine calls in the code. But the arrangement > > means that is now extremely easy to use data that the Turing machine > > does not have. > That makes it sound like the halting theorem is a result of some kind of > restriction that sets it apart from the sort of computing that we do > every day. > It does a bit. In fact it's the proof which creates these restrictions.The proof absolutely requires that we can't pass a "depth of call" parameter to H, however disguised, that enables it to determine if it running at the top level or as part of H_Hat. Of course if we relax these restrictions, we'll still find that a universal halt decider cannot be built. But the proof will need a bit of modification, probably very simple modifications to declare the whole system the "machine", but modifications all the same. Whilst we have had claims to have built a universal decider, usually the claim if far more modest, to have refuted Linz.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-18 22:44 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <87y2df46a7.fsf@bsb.me.uk> |
| In reply to | #31364 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Sunday, 18 April 2021 at 20:01:44 UTC+1, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.ar...@gmail.com> writes: >> >> > On Sunday, 18 April 2021 at 16:06:43 UTC+1, olcott wrote: >> >> On 4/18/2021 6:44 AM, Richard Damon wrote: >> >> > On 4/17/21 2:50 PM, olcott wrote: >> >> >> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >> >> >> >> >>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO >> >> >>> has fudged >> >> >>> this), >> >> >> >> >> >> It is not fudging to say that source code is interpreted rather than >> >> >> compiled. >> >> > >> >> > Just remember that H^ has a COPY of halt, not a 'call' to the version >> >> > that is in the halt decider. >> >> >> >> Just remember that I have and continue to stipulate otherwise. >> >> >> > This is one of those things like insisting on putting the hat in the >> > microwave before extracting the rabbit. It's legitimate in itself, but >> > it's eccentric, and it opens the door wide open to cheating. >> > >> > You can insist on x86 code instead of a Turing machine, you can even >> > reference external subroutine calls in the code. But the arrangement >> > means that is now extremely easy to use data that the Turing machine >> > does not have. >> That makes it sound like the halting theorem is a result of some kind of >> restriction that sets it apart from the sort of computing that we do >> every day. >> > It does a bit. Which is why it's not a good starting point. > In fact it's the proof which creates these restrictions. That's an odd way to look at it. Does the proof of the infinitude of primes create the restriction that only some number are prime? The proof is about TMs and it assumes absolutely nothing about what the purported solution might do. > The proof absolutely > requires that we can't pass a "depth of call" parameter to H, however > disguised, that enables it to determine if it running at the top level or as > part of H_Hat. What an odd way to look at the proof. It says (well the better proofs say) that for every TM, there is an input for which M(i) != halts(i). Not a restriction in sight, just a proof about Turing machines and not things with "calls" and "parameters". Proofs are about the things being reasoned about. That's not a restriction. > Of course if we relax these restrictions, we'll still find that a > universal halt decider cannot be built. But the proof will need a bit > of modification, probably very simple modifications to declare the > whole system the "machine", but modifications all the same. Exactly. You have to do the proper maths. What constitutes an instance of the halting problem and what instances any particular decider will be wrong about varies from model to model. You can't import a pattern (specifically the "hat" construction) from one model into another. Switch to lambda forms and there is a halting theorem for them (with lots of interesting variations in fact). Switch to Post systems and there's one for that model too. Pick a new model and either prove it's own halting theorem (if it has one) or prove that one of the known halting problems is reducible to the halting problem in the new model. PO is not doing any of this. He has not defined a model. He has not defined the halting problem for his preferred model. He has not shown any proofs of anything. So how do we know that all these flags and parameters and depths of call don't make a difference? Because a formally unbounded Intel-like RASP machine can perfectly simulate any TM. A halt decider for that machine would decide TM halting. > Whilst we have had claims to have built a universal decider, usually > the claim if far more modest, to have refuted Linz. You can't refute a theorem about TMs using a pile of x86 code. You need to find a flaw in the chain of reasoning. PO did once claim to have done that, but that turned out to be a lie. It's worth remembering the human aspect to this. PO posts that false, deluded, claim during a manic episode following (or closely linked to) the death of his dog. I think his mother may also have been ill at the time. Such things should elicit sympathy, but the string of deceptive posts that have followed in an attempt to distract from not have what was claimed makes it hard to maintain sympathy. That and the insults. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-18 15:23 -0700 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <s5ibh5$1gch$1@gioia.aioe.org> |
| In reply to | #31380 |
On 4/18/2021 2:44 PM, Ben Bacarisse wrote: > Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > >> On Sunday, 18 April 2021 at 20:01:44 UTC+1, Ben Bacarisse wrote: >>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>> >>>> On Sunday, 18 April 2021 at 16:06:43 UTC+1, olcott wrote: >>>>> On 4/18/2021 6:44 AM, Richard Damon wrote: >>>>>> On 4/17/21 2:50 PM, olcott wrote: >>>>>>> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >>>>> >>>>>>>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO >>>>>>>> has fudged >>>>>>>> this), >>>>>>> >>>>>>> It is not fudging to say that source code is interpreted rather than >>>>>>> compiled. >>>>>> >>>>>> Just remember that H^ has a COPY of halt, not a 'call' to the version >>>>>> that is in the halt decider. >>>>> >>>>> Just remember that I have and continue to stipulate otherwise. >>>>> >>>> This is one of those things like insisting on putting the hat in the >>>> microwave before extracting the rabbit. It's legitimate in itself, but >>>> it's eccentric, and it opens the door wide open to cheating. >>>> >>>> You can insist on x86 code instead of a Turing machine, you can even >>>> reference external subroutine calls in the code. But the arrangement >>>> means that is now extremely easy to use data that the Turing machine >>>> does not have. >>> That makes it sound like the halting theorem is a result of some kind of >>> restriction that sets it apart from the sort of computing that we do >>> every day. >>> >> It does a bit. > > Which is why it's not a good starting point. > >> In fact it's the proof which creates these restrictions. > > That's an odd way to look at it. Does the proof of the infinitude of > primes create the restriction that only some number are prime? > > The proof is about TMs and it assumes absolutely nothing about what the > purported solution might do. > >> The proof absolutely >> requires that we can't pass a "depth of call" parameter to H, however >> disguised, that enables it to determine if it running at the top level or as >> part of H_Hat. > > What an odd way to look at the proof. It says (well the better proofs > say) that for every TM, there is an input for which M(i) != halts(i). > Not a restriction in sight, just a proof about Turing machines and not > things with "calls" and "parameters". Proofs are about the things being > reasoned about. That's not a restriction. > >> Of course if we relax these restrictions, we'll still find that a >> universal halt decider cannot be built. But the proof will need a bit >> of modification, probably very simple modifications to declare the >> whole system the "machine", but modifications all the same. > > Exactly. You have to do the proper maths. What constitutes an instance > of the halting problem and what instances any particular decider will be > wrong about varies from model to model. You can't import a pattern > (specifically the "hat" construction) from one model into another. > > Switch to lambda forms and there is a halting theorem for them (with > lots of interesting variations in fact). Switch to Post systems and > there's one for that model too. > > Pick a new model and either prove it's own halting theorem (if it has > one) or prove that one of the known halting problems is reducible to the > halting problem in the new model. > > PO is not doing any of this. He has not defined a model. He has not > defined the halting problem for his preferred model. He has not shown > any proofs of anything. > > So how do we know that all these flags and parameters and depths of call > don't make a difference? Because a formally unbounded Intel-like RASP > machine can perfectly simulate any TM. A halt decider for that machine > would decide TM halting. > >> Whilst we have had claims to have built a universal decider, usually >> the claim if far more modest, to have refuted Linz. > > You can't refute a theorem about TMs using a pile of x86 code. You need > to find a flaw in the chain of reasoning. PO did once claim to have > done that, but that turned out to be a lie. > > It's worth remembering the human aspect to this. PO posts that false, > deluded, claim during a manic episode following (or closely linked to) > the death of his dog. I did not see the post where PO mentioned his Dog passing away. That is very bad. Damn. I wish PO well, and imvvvho, his wonderful little buddy, his Dog, is waiting for him on the "other side". Fwiw, the family dog, our little maltipoo named Roxy is 15 years old, going on 16. Still hanging in there, not blind at all, and can sometimes hear; her hearing is going out, shit. I am going to miss her when she finally goes to the "other side". Damn. Here is a picture of little Roxy when she was young: https://i.ibb.co/LY2nCW9/ct-little-roxy.png > I think his mother may also have been ill at the > time. Such things should elicit sympathy, but the string of deceptive > posts that have followed in an attempt to distract from not have what > was claimed makes it hard to maintain sympathy. That and the insults. >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-19 00:21 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <87blab41rz.fsf@bsb.me.uk> |
| In reply to | #31390 |
"Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > On 4/18/2021 2:44 PM, Ben Bacarisse wrote: <cut> >> It's worth remembering the human aspect to this. PO posts that false, >> deluded, claim during a manic episode following (or closely linked to) >> the death of his dog. > > I did not see the post where PO mentioned his Dog passing away. That > is very bad. Damn. I wish PO well, and imvvvho, his wonderful little > buddy, his Dog, is waiting for him on the "other side". > > Fwiw, the family dog, our little maltipoo named Roxy is 15 years old, > going on 16. Still hanging in there, not blind at all, and can > sometimes hear; her hearing is going out, shit. I am going to miss her > when she finally goes to the "other side". Damn. Here is a picture of > little Roxy when she was young: > > https://i.ibb.co/LY2nCW9/ct-little-roxy.png Very cute. I have become something of a crazy dog person in my retirement so I, too, sympathise. (I'll resist the urge to post pictures.) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-18 15:31 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <%N%eI.2984$mT7.549@fx22.iad> |
| In reply to | #31339 |
On 4/18/21 11:06 AM, olcott wrote: > On 4/18/2021 6:44 AM, Richard Damon wrote: >> On 4/17/21 2:50 PM, olcott wrote: >>> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >>>> On Saturday, 17 April 2021 at 16:07:47 UTC+1, Ben Bacarisse wrote: >>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>> >>>>>> On Saturday, 17 April 2021 at 06:31:12 UTC+1, R Kym Horsell wrote: >>>>>>> >>>>>>> In this case we have apparently a simulator based on the idea a >>>>>>> program >>>>>>> can find whether any other program contains an "invalid self >>>>>>> reference". >>>>>>> Unfortunately this is equivalent to the halting problem so is a >>>>>>> question begging exercise and ipso facto an error. >>>>>>> >>>>>> Linz doesn't specify a notation for the Turing machines. >>>>> Are we reading the same book? >>>>> >>>> Linz might use notation for Turing machines elsewhere. But he doesn't >>>> specify that H_Hat has to use any particular notation. >>>>> >>>>>> So we could use his >>>>>> own schematic, where "H" is labelled as "H". We can use that to >>>>>> detect the >>>>>> self-reference, >>>>> I can't see what do you mean by that. Can you sketch how a TM could do >>>>> that? >>>>> >>>> Yes, we use notation like this >>>> >>>> Copy_Loop; >>>> H >>>> Read_Flag >>>> if (flag_set) >>>> Infinite_Loop >>>> Halt >>>> >>>> This is placed as ASCII sybmols on an ASCII "tape" and fed to H and >>>> H_Hat. >>>> >>>>>> and that is legitimate. >>>>> >>>>> A TM has no labels so in what sense is it legitimate to say a TM >>>>> can do >>>>> something with labels? >>>>> >>>> The notation I have just given has labels. We have to understand that >>>> Copy_Loop >>>> means "This is the symbol that represents the series of states that >>>> copies the >>>> input". The machine H_Hat has no labels, if we want to construct it we >>>> have to >>>> understand what the labels mean and replace them with parts. But the >>>> notation >>>> for the machine can have labels. >>>> >>>> Just as the Queen Elizabeth doesn't have a label saying "propeller". >>>> But the blueprint >>>> might well have. The engineers constructing her read "propeller" in >>>> the blueprint, >>>> and know that that is the place to insert a fan-like object which >>>> drives the ship >>>> forwards. >>>> >>>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO >>>> has fudged >>>> this), >>> >>> It is not fudging to say that source code is interpreted rather than >>> compiled. >> >> Just remember that H^ has a COPY of halt, not a 'call' to the version >> that is in the halt decider. > > Just remember that I have and continue to stipulate otherwise. You CAN'T stipulate that and be within the bounds of the proof you are referring to. Basically, you are stipulating that you aren't working with Turing Machine equivalents. FAIL. > >>> >>>> it's legitimate to say "My H demands a certain notation for H_Hat, >>>> and it >>>> looks for the symbol that indicates that H_hat contains a copy of H". >>>> If given that >>>> stipulation, you can produce an H / H_Hat pair, you have still met my >>>> challenge. >>>> >>> >>> >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-18 14:40 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <S5-dncG8mtSBFuH9nZ2dnUU78LXNnZ2d@giganews.com> |
| In reply to | #31350 |
On 4/18/2021 2:31 PM, Richard Damon wrote: > On 4/18/21 11:06 AM, olcott wrote: >> On 4/18/2021 6:44 AM, Richard Damon wrote: >>> On 4/17/21 2:50 PM, olcott wrote: >>>> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >>>>> On Saturday, 17 April 2021 at 16:07:47 UTC+1, Ben Bacarisse wrote: >>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>> >>>>>>> On Saturday, 17 April 2021 at 06:31:12 UTC+1, R Kym Horsell wrote: >>>>>>>> >>>>>>>> In this case we have apparently a simulator based on the idea a >>>>>>>> program >>>>>>>> can find whether any other program contains an "invalid self >>>>>>>> reference". >>>>>>>> Unfortunately this is equivalent to the halting problem so is a >>>>>>>> question begging exercise and ipso facto an error. >>>>>>>> >>>>>>> Linz doesn't specify a notation for the Turing machines. >>>>>> Are we reading the same book? >>>>>> >>>>> Linz might use notation for Turing machines elsewhere. But he doesn't >>>>> specify that H_Hat has to use any particular notation. >>>>>> >>>>>>> So we could use his >>>>>>> own schematic, where "H" is labelled as "H". We can use that to >>>>>>> detect the >>>>>>> self-reference, >>>>>> I can't see what do you mean by that. Can you sketch how a TM could do >>>>>> that? >>>>>> >>>>> Yes, we use notation like this >>>>> >>>>> Copy_Loop; >>>>> H >>>>> Read_Flag >>>>> if (flag_set) >>>>> Infinite_Loop >>>>> Halt >>>>> >>>>> This is placed as ASCII sybmols on an ASCII "tape" and fed to H and >>>>> H_Hat. >>>>> >>>>>>> and that is legitimate. >>>>>> >>>>>> A TM has no labels so in what sense is it legitimate to say a TM >>>>>> can do >>>>>> something with labels? >>>>>> >>>>> The notation I have just given has labels. We have to understand that >>>>> Copy_Loop >>>>> means "This is the symbol that represents the series of states that >>>>> copies the >>>>> input". The machine H_Hat has no labels, if we want to construct it we >>>>> have to >>>>> understand what the labels mean and replace them with parts. But the >>>>> notation >>>>> for the machine can have labels. >>>>> >>>>> Just as the Queen Elizabeth doesn't have a label saying "propeller". >>>>> But the blueprint >>>>> might well have. The engineers constructing her read "propeller" in >>>>> the blueprint, >>>>> and know that that is the place to insert a fan-like object which >>>>> drives the ship >>>>> forwards. >>>>> >>>>> Because H deals with a notation for H_Hat, not H_Hat itself (I know PO >>>>> has fudged >>>>> this), >>>> >>>> It is not fudging to say that source code is interpreted rather than >>>> compiled. >>> >>> Just remember that H^ has a COPY of halt, not a 'call' to the version >>> that is in the halt decider. >> >> Just remember that I have and continue to stipulate otherwise. > > You CAN'T stipulate that and be within the bounds of the proof you are > referring to. I am stipulating that I am not referring to the Linz proof to that degree of detail. I am referring to the proof at the Sipser degree of detail. http://www.liarparadox.org/sipser_165.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-04-18 16:05 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <Qh0fI.4669$XW6.4415@fx11.iad> |
| In reply to | #31354 |
On 4/18/21 3:40 PM, olcott wrote: > On 4/18/2021 2:31 PM, Richard Damon wrote: >> On 4/18/21 11:06 AM, olcott wrote: >>> On 4/18/2021 6:44 AM, Richard Damon wrote: >>>> On 4/17/21 2:50 PM, olcott wrote: >>>>> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >>>>>> On Saturday, 17 April 2021 at 16:07:47 UTC+1, Ben Bacarisse wrote: >>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>>> >>>>>>>> On Saturday, 17 April 2021 at 06:31:12 UTC+1, R Kym Horsell wrote: >>>>>>>>> >>>>>>>>> In this case we have apparently a simulator based on the idea a >>>>>>>>> program >>>>>>>>> can find whether any other program contains an "invalid self >>>>>>>>> reference". >>>>>>>>> Unfortunately this is equivalent to the halting problem so is a >>>>>>>>> question begging exercise and ipso facto an error. >>>>>>>>> >>>>>>>> Linz doesn't specify a notation for the Turing machines. >>>>>>> Are we reading the same book? >>>>>>> >>>>>> Linz might use notation for Turing machines elsewhere. But he doesn't >>>>>> specify that H_Hat has to use any particular notation. >>>>>>> >>>>>>>> So we could use his >>>>>>>> own schematic, where "H" is labelled as "H". We can use that to >>>>>>>> detect the >>>>>>>> self-reference, >>>>>>> I can't see what do you mean by that. Can you sketch how a TM >>>>>>> could do >>>>>>> that? >>>>>>> >>>>>> Yes, we use notation like this >>>>>> >>>>>> Copy_Loop; >>>>>> H >>>>>> Read_Flag >>>>>> if (flag_set) >>>>>> Infinite_Loop >>>>>> Halt >>>>>> >>>>>> This is placed as ASCII sybmols on an ASCII "tape" and fed to H and >>>>>> H_Hat. >>>>>> >>>>>>>> and that is legitimate. >>>>>>> >>>>>>> A TM has no labels so in what sense is it legitimate to say a TM >>>>>>> can do >>>>>>> something with labels? >>>>>>> >>>>>> The notation I have just given has labels. We have to understand that >>>>>> Copy_Loop >>>>>> means "This is the symbol that represents the series of states that >>>>>> copies the >>>>>> input". The machine H_Hat has no labels, if we want to construct >>>>>> it we >>>>>> have to >>>>>> understand what the labels mean and replace them with parts. But the >>>>>> notation >>>>>> for the machine can have labels. >>>>>> >>>>>> Just as the Queen Elizabeth doesn't have a label saying "propeller". >>>>>> But the blueprint >>>>>> might well have. The engineers constructing her read "propeller" in >>>>>> the blueprint, >>>>>> and know that that is the place to insert a fan-like object which >>>>>> drives the ship >>>>>> forwards. >>>>>> >>>>>> Because H deals with a notation for H_Hat, not H_Hat itself (I >>>>>> know PO >>>>>> has fudged >>>>>> this), >>>>> >>>>> It is not fudging to say that source code is interpreted rather than >>>>> compiled. >>>> >>>> Just remember that H^ has a COPY of halt, not a 'call' to the version >>>> that is in the halt decider. >>> >>> Just remember that I have and continue to stipulate otherwise. >> >> You CAN'T stipulate that and be within the bounds of the proof you are >> referring to. > I am stipulating that I am not referring to the Linz proof to that > degree of detail. I am referring to the proof at the Sipser degree of > detail. http://www.liarparadox.org/sipser_165.pdf > But Sipser's machine D DOES have the Computation H within it, as a copy. For a Turing Machine to act on an algorthm, it needs that algorthm to either exist with its state transition table, or it needs it on its initial tape. Since D doesn't have H as part of its defined input tape, it can only access the algorithm of H if it has a copy of it as part of its State Transition Table.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-18 15:26 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <HsCdnZkuR4FhCOH9nZ2dnUU7-YfNnZ2d@giganews.com> |
| In reply to | #31361 |
On 4/18/2021 3:05 PM, Richard Damon wrote:
> On 4/18/21 3:40 PM, olcott wrote:
>> On 4/18/2021 2:31 PM, Richard Damon wrote:
>>> On 4/18/21 11:06 AM, olcott wrote:
>>>> On 4/18/2021 6:44 AM, Richard Damon wrote:
>>>>> On 4/17/21 2:50 PM, olcott wrote:
>>>>>> On 4/17/2021 1:29 PM, Malcolm McLean wrote:
>>>>>>> On Saturday, 17 April 2021 at 16:07:47 UTC+1, Ben Bacarisse wrote:
>>>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes:
>>>>>>>>
>>>>>>>>> On Saturday, 17 April 2021 at 06:31:12 UTC+1, R Kym Horsell wrote:
>>>>>>>>>>
>>>>>>>>>> In this case we have apparently a simulator based on the idea a
>>>>>>>>>> program
>>>>>>>>>> can find whether any other program contains an "invalid self
>>>>>>>>>> reference".
>>>>>>>>>> Unfortunately this is equivalent to the halting problem so is a
>>>>>>>>>> question begging exercise and ipso facto an error.
>>>>>>>>>>
>>>>>>>>> Linz doesn't specify a notation for the Turing machines.
>>>>>>>> Are we reading the same book?
>>>>>>>>
>>>>>>> Linz might use notation for Turing machines elsewhere. But he doesn't
>>>>>>> specify that H_Hat has to use any particular notation.
>>>>>>>>
>>>>>>>>> So we could use his
>>>>>>>>> own schematic, where "H" is labelled as "H". We can use that to
>>>>>>>>> detect the
>>>>>>>>> self-reference,
>>>>>>>> I can't see what do you mean by that. Can you sketch how a TM
>>>>>>>> could do
>>>>>>>> that?
>>>>>>>>
>>>>>>> Yes, we use notation like this
>>>>>>>
>>>>>>> Copy_Loop;
>>>>>>> H
>>>>>>> Read_Flag
>>>>>>> if (flag_set)
>>>>>>> Infinite_Loop
>>>>>>> Halt
>>>>>>>
>>>>>>> This is placed as ASCII sybmols on an ASCII "tape" and fed to H and
>>>>>>> H_Hat.
>>>>>>>
>>>>>>>>> and that is legitimate.
>>>>>>>>
>>>>>>>> A TM has no labels so in what sense is it legitimate to say a TM
>>>>>>>> can do
>>>>>>>> something with labels?
>>>>>>>>
>>>>>>> The notation I have just given has labels. We have to understand that
>>>>>>> Copy_Loop
>>>>>>> means "This is the symbol that represents the series of states that
>>>>>>> copies the
>>>>>>> input". The machine H_Hat has no labels, if we want to construct
>>>>>>> it we
>>>>>>> have to
>>>>>>> understand what the labels mean and replace them with parts. But the
>>>>>>> notation
>>>>>>> for the machine can have labels.
>>>>>>>
>>>>>>> Just as the Queen Elizabeth doesn't have a label saying "propeller".
>>>>>>> But the blueprint
>>>>>>> might well have. The engineers constructing her read "propeller" in
>>>>>>> the blueprint,
>>>>>>> and know that that is the place to insert a fan-like object which
>>>>>>> drives the ship
>>>>>>> forwards.
>>>>>>>
>>>>>>> Because H deals with a notation for H_Hat, not H_Hat itself (I
>>>>>>> know PO
>>>>>>> has fudged
>>>>>>> this),
>>>>>>
>>>>>> It is not fudging to say that source code is interpreted rather than
>>>>>> compiled.
>>>>>
>>>>> Just remember that H^ has a COPY of halt, not a 'call' to the version
>>>>> that is in the halt decider.
>>>>
>>>> Just remember that I have and continue to stipulate otherwise.
>>>
>>> You CAN'T stipulate that and be within the bounds of the proof you are
>>> referring to.
>> I am stipulating that I am not referring to the Linz proof to that
>> degree of detail. I am referring to the proof at the Sipser degree of
>> detail. http://www.liarparadox.org/sipser_165.pdf
>>
>
> But Sipser's machine D DOES have the Computation H within it, as a copy.
> For a Turing Machine to act on an algorthm, it needs that algorthm to
> either exist with its state transition table, or it needs it on its
> initial tape.
>
> Since D doesn't have H as part of its defined input tape, it can only
> access the algorithm of H if it has a copy of it as part of its State
> Transition Table.
>
I don't give a rat's ass. My system is computationally equivalent to a
machine that correctly decides the conventional
"Do the opposite of whatever the halt decider decides"
That you do not understand that this overturns the proofs is none of my
concern.
PROOF We assume that ATM is decidable and obtain a
contradiction. Suppose that H is a decider for ATM.
Now we construct a new Turing machine D with H as a
subroutine. This new TM calls H to determine what M
does when the input to M is its own description <M>.
Once D has determined this information, it does the
opposite.
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-18 13:56 -0700 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <s5i6d4$1dro$2@gioia.aioe.org> |
| In reply to | #31365 |
On 4/18/2021 1:26 PM, olcott wrote: > On 4/18/2021 3:05 PM, Richard Damon wrote: >> On 4/18/21 3:40 PM, olcott wrote: >>> On 4/18/2021 2:31 PM, Richard Damon wrote: >>>> On 4/18/21 11:06 AM, olcott wrote: >>>>> On 4/18/2021 6:44 AM, Richard Damon wrote: >>>>>> On 4/17/21 2:50 PM, olcott wrote: >>>>>>> On 4/17/2021 1:29 PM, Malcolm McLean wrote: >>>>>>>> On Saturday, 17 April 2021 at 16:07:47 UTC+1, Ben Bacarisse wrote: >>>>>>>>> Malcolm McLean <malcolm.ar...@gmail.com> writes: >>>>>>>>> >>>>>>>>>> On Saturday, 17 April 2021 at 06:31:12 UTC+1, R Kym Horsell >>>>>>>>>> wrote: >>>>>>>>>>> >>>>>>>>>>> In this case we have apparently a simulator based on the idea a >>>>>>>>>>> program >>>>>>>>>>> can find whether any other program contains an "invalid self >>>>>>>>>>> reference". >>>>>>>>>>> Unfortunately this is equivalent to the halting problem so is a >>>>>>>>>>> question begging exercise and ipso facto an error. >>>>>>>>>>> >>>>>>>>>> Linz doesn't specify a notation for the Turing machines. >>>>>>>>> Are we reading the same book? >>>>>>>>> >>>>>>>> Linz might use notation for Turing machines elsewhere. But he >>>>>>>> doesn't >>>>>>>> specify that H_Hat has to use any particular notation. >>>>>>>>> >>>>>>>>>> So we could use his >>>>>>>>>> own schematic, where "H" is labelled as "H". We can use that to >>>>>>>>>> detect the >>>>>>>>>> self-reference, >>>>>>>>> I can't see what do you mean by that. Can you sketch how a TM >>>>>>>>> could do >>>>>>>>> that? >>>>>>>>> >>>>>>>> Yes, we use notation like this >>>>>>>> >>>>>>>> Copy_Loop; >>>>>>>> H >>>>>>>> Read_Flag >>>>>>>> if (flag_set) >>>>>>>> Infinite_Loop >>>>>>>> Halt >>>>>>>> >>>>>>>> This is placed as ASCII sybmols on an ASCII "tape" and fed to H and >>>>>>>> H_Hat. >>>>>>>> >>>>>>>>>> and that is legitimate. >>>>>>>>> >>>>>>>>> A TM has no labels so in what sense is it legitimate to say a TM >>>>>>>>> can do >>>>>>>>> something with labels? >>>>>>>>> >>>>>>>> The notation I have just given has labels. We have to understand >>>>>>>> that >>>>>>>> Copy_Loop >>>>>>>> means "This is the symbol that represents the series of states that >>>>>>>> copies the >>>>>>>> input". The machine H_Hat has no labels, if we want to construct >>>>>>>> it we >>>>>>>> have to >>>>>>>> understand what the labels mean and replace them with parts. But >>>>>>>> the >>>>>>>> notation >>>>>>>> for the machine can have labels. >>>>>>>> >>>>>>>> Just as the Queen Elizabeth doesn't have a label saying >>>>>>>> "propeller". >>>>>>>> But the blueprint >>>>>>>> might well have. The engineers constructing her read "propeller" in >>>>>>>> the blueprint, >>>>>>>> and know that that is the place to insert a fan-like object which >>>>>>>> drives the ship >>>>>>>> forwards. >>>>>>>> >>>>>>>> Because H deals with a notation for H_Hat, not H_Hat itself (I >>>>>>>> know PO >>>>>>>> has fudged >>>>>>>> this), >>>>>>> >>>>>>> It is not fudging to say that source code is interpreted rather than >>>>>>> compiled. >>>>>> >>>>>> Just remember that H^ has a COPY of halt, not a 'call' to the version >>>>>> that is in the halt decider. >>>>> >>>>> Just remember that I have and continue to stipulate otherwise. >>>> >>>> You CAN'T stipulate that and be within the bounds of the proof you are >>>> referring to. >>> I am stipulating that I am not referring to the Linz proof to that >>> degree of detail. I am referring to the proof at the Sipser degree of >>> detail. http://www.liarparadox.org/sipser_165.pdf >>> >> >> But Sipser's machine D DOES have the Computation H within it, as a copy. >> For a Turing Machine to act on an algorthm, it needs that algorthm to >> either exist with its state transition table, or it needs it on its >> initial tape. >> >> Since D doesn't have H as part of its defined input tape, it can only >> access the algorithm of H if it has a copy of it as part of its State >> Transition Table. >> > > I don't give a rat's ass. That is one of your major flaws. ;^o [...]
[toc] | [prev] | [next] | [standalone]
Page 16 of 50 — ← Prev page 1 … 14 15 [16] 17 18 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web