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 23 of 50 — ← Prev page 1 … 21 22 [23] 24 25 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 17:45 -0500 |
| Subject | Re: What is a computation? (internal state) |
| Message-ID | <qIudnfCcSLobxOL9nZ2dnUU7-c-dnZ2d@giganews.com> |
| In reply to | #31681 |
On 4/20/2021 5:28 PM, Kaz Kylheku wrote:
> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>> On 4/20/2021 3:32 PM, Kaz Kylheku wrote:
>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>>>> I stipulate that I have transformed the proofs into their simulated
>>>
>>> You've transformed proofs that require pure functions into some
>>> cockamamie idiocy in which imperative procedures which *look*
>>> like those functions are connected together in exactly the same way.
>>>
>>
>> When Sipser D is defined to be able to simulate H, then D does not
>> have to have any aspect of H embedded within.
>>
>> void D(u32 P)
>> {
>> u32 Input_Would_Halt = Simulate(H, P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>
> Your D mentions H, which makes H embedded in it.
When H simulates D simulating H simulating D simulating H
this is all an aspect of the internal state of the first H.
--
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-20 20:56 -0400 |
| Subject | Re: What is a computation? (internal state) |
| Message-ID | <OKKfI.20335$ft1.7257@fx10.iad> |
| In reply to | #31685 |
On 4/20/21 6:45 PM, olcott wrote:
> On 4/20/2021 5:28 PM, Kaz Kylheku wrote:
>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>>> On 4/20/2021 3:32 PM, Kaz Kylheku wrote:
>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>>>>> I stipulate that I have transformed the proofs into their simulated
>>>>
>>>> You've transformed proofs that require pure functions into some
>>>> cockamamie idiocy in which imperative procedures which *look*
>>>> like those functions are connected together in exactly the same way.
>>>>
>>>
>>> When Sipser D is defined to be able to simulate H, then D does not
>>> have to have any aspect of H embedded within.
>>>
>>> void D(u32 P)
>>> {
>>> u32 Input_Would_Halt = Simulate(H, P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>
>> Your D mentions H, which makes H embedded in it.
>
> When H simulates D simulating H simulating D simulating H
> this is all an aspect of the internal state of the first H.
>
>
The issue is that even though the machines are running via simulation,
they are defined as machines, and as such actually exist as machines.
D is NOT 'just a description', as if it is just a descripition, it isn;t
the descrpition of a Turing Machine.
The same with the H that D uses, it can't be just a description, it
needs to be a description of a Turing machine, and once you actually
create that description, you have created the Turing Machine. If that
description does NOT create a Turing Machine, then the description is
not a description of a Turing Machine.
Think of it this way, can you create a computation to compute the sin of
an angle without creating the mathematical function sin. NO. The act of
creating the computation will create that function (or at least whatever
approximation that computation generates).
If you ONLY think in terms of physical hardware executing actual code,
you will miss the real nature of a Turing Machine. No one can build a
physical Turing Machine, you can create a Turing Machine simulator. But
Turing Machines ARE created. The exist just as much as the number 5 or
the sin function.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 20:11 -0500 |
| Subject | Re: What is a computation? (internal state) |
| Message-ID | <2vSdnbrSoKY45uL9nZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #31708 |
On 4/20/2021 7:56 PM, Richard Damon wrote:
> On 4/20/21 6:45 PM, olcott wrote:
>> On 4/20/2021 5:28 PM, Kaz Kylheku wrote:
>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>>>> On 4/20/2021 3:32 PM, Kaz Kylheku wrote:
>>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote:
>>>>>> I stipulate that I have transformed the proofs into their simulated
>>>>>
>>>>> You've transformed proofs that require pure functions into some
>>>>> cockamamie idiocy in which imperative procedures which *look*
>>>>> like those functions are connected together in exactly the same way.
>>>>>
>>>>
>>>> When Sipser D is defined to be able to simulate H, then D does not
>>>> have to have any aspect of H embedded within.
>>>>
>>>> void D(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Simulate(H, P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>
>>> Your D mentions H, which makes H embedded in it.
>>
>> When H simulates D simulating H simulating D simulating H
>> this is all an aspect of the internal state of the first H.
>>
>>
>
> The issue is that even though the machines are running via simulation,
> they are defined as machines, and as such actually exist as machines.
>
<sarcasm>
In this same way we can say that interpreted BASIC programs are not
actually interpreted at all. "Interpreted" is merely an idiom for a
compiled executable.
Because these interpreted BASIC programs have no interpreter the
non-existent interpreter has no information what-so-ever about what
these programs are doing because it does not exist, it is only a figure
of speech.
</sarcasm>
> D is NOT 'just a description', as if it is just a descripition, it isn;t
> the descrpition of a Turing Machine.
>
> The same with the H that D uses, it can't be just a description, it
> needs to be a description of a Turing machine, and once you actually
> create that description, you have created the Turing Machine. If that
> description does NOT create a Turing Machine, then the description is
> not a description of a Turing Machine.
>
> Think of it this way, can you create a computation to compute the sin of
> an angle without creating the mathematical function sin. NO. The act of
> creating the computation will create that function (or at least whatever
> approximation that computation generates).
>
> If you ONLY think in terms of physical hardware executing actual code,
> you will miss the real nature of a Turing Machine. No one can build a
> physical Turing Machine, you can create a Turing Machine simulator. But
> Turing Machines ARE created. The exist just as much as the number 5 or
> the sin function.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-20 14:34 -0600 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <s5ndsf$qid$1@dont-email.me> |
| In reply to | #31640 |
On 2021-04-20 14:21, olcott wrote: > On 4/20/2021 3:06 PM, André G. Isaak wrote: >> On 2021-04-20 13:47, olcott wrote: >>> On 4/20/2021 1:45 PM, André G. Isaak wrote: >>>> On 2021-04-20 12:21, olcott wrote: >>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote: >>>>>> On 2021-04-20 10:14, olcott wrote: >>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote: >>>>>>>> On 4/20/21 11:56 AM, olcott wrote: >>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote: >>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote: >>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>> >>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>>>>>>>>> >>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM. >>>>>>>>>>>>>>>> And X will >>>>>>>>>>>>>>>> only have a description of Y on its tape if that >>>>>>>>>>>>>>>> description is >>>>>>>>>>>>>>>> given to X as a formal input parameter. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Not really that is not the way that TM actually work. >>>>>>>>>>>>>> >>>>>>>>>>>>>> Yes, that IS the way TMs actually work. >>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this. >>>>>>>>>>>> >>>>>>>>>>>> You are confusing the way adults talk to each other with the >>>>>>>>>>>> way they >>>>>>>>>>>> must talk to children. Siper talks of "calling H" because >>>>>>>>>>>> he assumes >>>>>>>>>>>> his readers know what a TM is. I know what André means by a >>>>>>>>>>>> parameter >>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms >>>>>>>>>>>> with other >>>>>>>>>>>> people who won't get confused. I don't think you can do that. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> None-the-less you do know that no TM every has any parameter. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Your English is a bit fractured here. >>>>>>>>>> >>>>>>>>>> Some TM will not use their tape to get an input, and do a >>>>>>>>>> singular >>>>>>>>>> calculation that gives a singular answer (every time it is run) >>>>>>>>>> >>>>>>>>>> Most TM will use the Tape as an input, which when we use the >>>>>>>>>> functional >>>>>>>>>> view of a TM, that input is the parameter(s) to the function. >>>>>>>>>> >>>>>>>>> >>>>>>>>> A parmeter is a data value that has been pushed on the stack >>>>>>>>> before a >>>>>>>>> function call. No TM ever does anything like this. >>>>>>>>> >>>>>>>> >>>>>>>> Nope, not even in Software Engineering. >>>>>>>> >>>>>>>> Look at C++ templates, they have 'parameters' and they aren't >>>>>>>> put on a >>>>>>>> stack. >>>>>>>> >>>>>>>> Look at machines with register based calling conventions, the first >>>>>>>> couple of parameters are not put on the stack either, but are just >>>>>>>> placed in registers R0, R1, etc. >>>>>>>> >>>>>>>> Parameters are inputs to a function or procedure. >>>>>>>> >>>>>>>> On some systems it is even the setting of a dial or the position >>>>>>>> of a >>>>>>>> switch. >>>>>>>> >>>>>>> >>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming) >>>>>>> TMs never have anything like the conventional notion of a parameter. >>>>>>> Their only "input" is data that is already on their tape. >>>>>> >>>>>> There is definite irony in you attempting to argue that some very >>>>>> specific meaning must be attached to 'parameter' given that you >>>>>> are perfectly happy to call C programs "Turing Machines", Halt >>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical Formalism". >>>>>> It's a bit mystifying why you should suddenly feel the need to >>>>>> abandon your normally Lewis Carrollesque approach to language on >>>>>> this one specific point. >>>>>> >>>>>> Regardless of what you want to call it, the initial contents of a >>>>>> Turing Machine's tape are defined by the computation that a given >>>>>> Turing Machine performs. >>>>>> >>>>> >>>>> That is flat out not true. For any TM its initial tape contents can >>>>> be pure gibberish thus having nothing to do with its own defined >>>>> set of states. >>>> >>>> Not if you want it to perform the computation which it encodes. >>> You stipulated the restriction incorrectly. >>> >>>>>> Linz's proof involves a putative Halt Decider and a second TM, H_Hat. >>>>>> >>>>>> The input of a Halt Decider is well-defined. It consists of the >>>>>> description of a Turing Machine and an input string. Nothing else. >>>>>> >>>>> >>>>> We are OK here. >>>>> >>>>>> H_Hat's input is also well-defined by Linz. It consists of the >>>>>> description of a Turing Machine. Nothing Else. >>>>>> >>>>> >>>>> That is the way Linz specifies it. As I have repeated countless >>>>> times I am not required strictly follow every detail of Linz. That >>>>> you believe that I am is merely a false belief on your part. >>>> >>>> If you're addressing the Linz proof, then you need to follow Linz. >>>> Since H_Hat is derived from H using a very specific method, its >>>> inputs are determined by that method. >>> >>> Lets just say that I am swicthing to the Sipser proof. D() calls H(). >> >> The Sipser and Linz proofs are identical. >> >> Sipser's D includes a copy of H. If you're going to read proofs about >> Turing Machines, you need to learn the vocabulary of Turing Machines. >> >> Is it that hard for you to grasp that different models make use of >> different vocabularies? '=' means something entirely different in C >> than it does in Pascal. You can't interpret it the pascal way when >> talking about C. Similarly, you can't interpret 'subroutine' in terms >> of procedural programming when discussing Turing Machines. >> >>>> But putting that aside, since you agreed with me above that when >>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is >>>> two descriptions of H_Hat, how exactly is H supposed to supply H_Hat >>>> with a description of H? It has no description of H to pass to H_Hat. >>> >>> I changed the spec when we digress from x86 machines to TMs. >> >> What does that even mean? These proofs have always been about TMs. And >> the input is defined in the proofs. >> >>>>>> When H is called with H_Hat, H_Hat as its input, those will be the >>>>>> *only* things placed on the tape before running H: Two identical >>>>>> descriptions of H_Hat. There will not be a description of H placed >>>>>> on the tape. >>>>>> >>>>> >>>>> Linz does not explicitly forbid this and an equivalent problem can >>>>> be defined with the Turing machine description of H on the tape. >>>> >>>> And how does it get onto the tape? >>> >>> I summon a majick TM tape Genie. >>> >>>> H_Hat is called by H, and H has no description of H on its tape. >>> >>> That is a false assumption. >> >> No. Your repetition of this is pointless. > > No one says that a computation based on the simulation of Turing machine > descriptions is necessarily not equivalent and it is indeed a known fact > that such a computation <is> equivalent. What does that have to do with anything I write above? Whether you run H/H_Hats directly or simulate them, the inputs given to H and to H_Hat don't change. If your 'simulation' provides these with information they don't have when run directly, then your simulation isn't an accurate simulation and is ergo *not* an equivalent computation. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 15:42 -0500 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <YpWdneo70JpMoeL9nZ2dnUU78KPNnZ2d@giganews.com> |
| In reply to | #31648 |
On 4/20/2021 3:34 PM, André G. Isaak wrote:
> On 2021-04-20 14:21, olcott wrote:
>> On 4/20/2021 3:06 PM, André G. Isaak wrote:
>>> On 2021-04-20 13:47, olcott wrote:
>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote:
>>>>> On 2021-04-20 12:21, olcott wrote:
>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote:
>>>>>>> On 2021-04-20 10:14, olcott wrote:
>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote:
>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote:
>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote:
>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote:
>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a
>>>>>>>>>>>>>>>>> UTM. And X will
>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that
>>>>>>>>>>>>>>>>> description is
>>>>>>>>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You are confusing the way adults talk to each other with
>>>>>>>>>>>>> the way they
>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because
>>>>>>>>>>>>> he assumes
>>>>>>>>>>>>> his readers know what a TM is. I know what André means by
>>>>>>>>>>>>> a parameter
>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms
>>>>>>>>>>>>> with other
>>>>>>>>>>>>> people who won't get confused. I don't think you can do that.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Your English is a bit fractured here.
>>>>>>>>>>>
>>>>>>>>>>> Some TM will not use their tape to get an input, and do a
>>>>>>>>>>> singular
>>>>>>>>>>> calculation that gives a singular answer (every time it is run)
>>>>>>>>>>>
>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the
>>>>>>>>>>> functional
>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> A parmeter is a data value that has been pushed on the stack
>>>>>>>>>> before a
>>>>>>>>>> function call. No TM ever does anything like this.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Nope, not even in Software Engineering.
>>>>>>>>>
>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't
>>>>>>>>> put on a
>>>>>>>>> stack.
>>>>>>>>>
>>>>>>>>> Look at machines with register based calling conventions, the
>>>>>>>>> first
>>>>>>>>> couple of parameters are not put on the stack either, but are just
>>>>>>>>> placed in registers R0, R1, etc.
>>>>>>>>>
>>>>>>>>> Parameters are inputs to a function or procedure.
>>>>>>>>>
>>>>>>>>> On some systems it is even the setting of a dial or the
>>>>>>>>> position of a
>>>>>>>>> switch.
>>>>>>>>>
>>>>>>>>
>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming)
>>>>>>>> TMs never have anything like the conventional notion of a
>>>>>>>> parameter.
>>>>>>>> Their only "input" is data that is already on their tape.
>>>>>>>
>>>>>>> There is definite irony in you attempting to argue that some very
>>>>>>> specific meaning must be attached to 'parameter' given that you
>>>>>>> are perfectly happy to call C programs "Turing Machines", Halt
>>>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical
>>>>>>> Formalism". It's a bit mystifying why you should suddenly feel
>>>>>>> the need to abandon your normally Lewis Carrollesque approach to
>>>>>>> language on this one specific point.
>>>>>>>
>>>>>>> Regardless of what you want to call it, the initial contents of a
>>>>>>> Turing Machine's tape are defined by the computation that a given
>>>>>>> Turing Machine performs.
>>>>>>>
>>>>>>
>>>>>> That is flat out not true. For any TM its initial tape contents
>>>>>> can be pure gibberish thus having nothing to do with its own
>>>>>> defined set of states.
>>>>>
>>>>> Not if you want it to perform the computation which it encodes.
>>>> You stipulated the restriction incorrectly.
>>>>
>>>>>>> Linz's proof involves a putative Halt Decider and a second TM,
>>>>>>> H_Hat.
>>>>>>>
>>>>>>> The input of a Halt Decider is well-defined. It consists of the
>>>>>>> description of a Turing Machine and an input string. Nothing else.
>>>>>>>
>>>>>>
>>>>>> We are OK here.
>>>>>>
>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the
>>>>>>> description of a Turing Machine. Nothing Else.
>>>>>>>
>>>>>>
>>>>>> That is the way Linz specifies it. As I have repeated countless
>>>>>> times I am not required strictly follow every detail of Linz. That
>>>>>> you believe that I am is merely a false belief on your part.
>>>>>
>>>>> If you're addressing the Linz proof, then you need to follow Linz.
>>>>> Since H_Hat is derived from H using a very specific method, its
>>>>> inputs are determined by that method.
>>>>
>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H().
>>>
>>> The Sipser and Linz proofs are identical.
>>>
>>> Sipser's D includes a copy of H. If you're going to read proofs about
>>> Turing Machines, you need to learn the vocabulary of Turing Machines.
>>>
>>> Is it that hard for you to grasp that different models make use of
>>> different vocabularies? '=' means something entirely different in C
>>> than it does in Pascal. You can't interpret it the pascal way when
>>> talking about C. Similarly, you can't interpret 'subroutine' in terms
>>> of procedural programming when discussing Turing Machines.
>>>
>>>>> But putting that aside, since you agreed with me above that when
>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is
>>>>> two descriptions of H_Hat, how exactly is H supposed to supply
>>>>> H_Hat with a description of H? It has no description of H to pass
>>>>> to H_Hat.
>>>>
>>>> I changed the spec when we digress from x86 machines to TMs.
>>>
>>> What does that even mean? These proofs have always been about TMs.
>>> And the input is defined in the proofs.
>>>
>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be
>>>>>>> the *only* things placed on the tape before running H: Two
>>>>>>> identical descriptions of H_Hat. There will not be a description
>>>>>>> of H placed on the tape.
>>>>>>>
>>>>>>
>>>>>> Linz does not explicitly forbid this and an equivalent problem can
>>>>>> be defined with the Turing machine description of H on the tape.
>>>>>
>>>>> And how does it get onto the tape?
>>>>
>>>> I summon a majick TM tape Genie.
>>>>
>>>>> H_Hat is called by H, and H has no description of H on its tape.
>>>>
>>>> That is a false assumption.
>>>
>>> No. Your repetition of this is pointless.
>>
>> No one says that a computation based on the simulation of Turing
>> machine descriptions is necessarily not equivalent and it is indeed a
>> known fact that such a computation <is> equivalent.
>
> What does that have to do with anything I write above? Whether you run
> H/H_Hats directly or simulate them, the inputs given to H and to H_Hat
> don't change.
When Sipser D is defined to be able to simulate H, then D does not
have to have any aspect of H embedded within.
void D(u32 P)
{
u32 Input_Would_Halt = Simulate(H, P, P);
Output("Input_Halts:", Input_Would_Halt);
if (Input_Would_Halt)
HERE: goto HERE;
}
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 | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-20 15:19 -0600 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <s5nghs$ddp$1@dont-email.me> |
| In reply to | #31652 |
On 2021-04-20 14:42, olcott wrote: > On 4/20/2021 3:34 PM, André G. Isaak wrote: >> On 2021-04-20 14:21, olcott wrote: >>> On 4/20/2021 3:06 PM, André G. Isaak wrote: >>>> On 2021-04-20 13:47, olcott wrote: >>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote: >>>>>> On 2021-04-20 12:21, olcott wrote: >>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote: >>>>>>>> On 2021-04-20 10:14, olcott wrote: >>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote: >>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote: >>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote: >>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote: >>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>> >>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a >>>>>>>>>>>>>>>>>> UTM. And X will >>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that >>>>>>>>>>>>>>>>>> description is >>>>>>>>>>>>>>>>>> given to X as a formal input parameter. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work. >>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this. >>>>>>>>>>>>>> >>>>>>>>>>>>>> You are confusing the way adults talk to each other with >>>>>>>>>>>>>> the way they >>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because >>>>>>>>>>>>>> he assumes >>>>>>>>>>>>>> his readers know what a TM is. I know what André means by >>>>>>>>>>>>>> a parameter >>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms >>>>>>>>>>>>>> with other >>>>>>>>>>>>>> people who won't get confused. I don't think you can do >>>>>>>>>>>>>> that. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Your English is a bit fractured here. >>>>>>>>>>>> >>>>>>>>>>>> Some TM will not use their tape to get an input, and do a >>>>>>>>>>>> singular >>>>>>>>>>>> calculation that gives a singular answer (every time it is run) >>>>>>>>>>>> >>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the >>>>>>>>>>>> functional >>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> A parmeter is a data value that has been pushed on the stack >>>>>>>>>>> before a >>>>>>>>>>> function call. No TM ever does anything like this. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Nope, not even in Software Engineering. >>>>>>>>>> >>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't >>>>>>>>>> put on a >>>>>>>>>> stack. >>>>>>>>>> >>>>>>>>>> Look at machines with register based calling conventions, the >>>>>>>>>> first >>>>>>>>>> couple of parameters are not put on the stack either, but are >>>>>>>>>> just >>>>>>>>>> placed in registers R0, R1, etc. >>>>>>>>>> >>>>>>>>>> Parameters are inputs to a function or procedure. >>>>>>>>>> >>>>>>>>>> On some systems it is even the setting of a dial or the >>>>>>>>>> position of a >>>>>>>>>> switch. >>>>>>>>>> >>>>>>>>> >>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming) >>>>>>>>> TMs never have anything like the conventional notion of a >>>>>>>>> parameter. >>>>>>>>> Their only "input" is data that is already on their tape. >>>>>>>> >>>>>>>> There is definite irony in you attempting to argue that some >>>>>>>> very specific meaning must be attached to 'parameter' given that >>>>>>>> you are perfectly happy to call C programs "Turing Machines", >>>>>>>> Halt Deciders "UTMs" and the book of Isaiah a "Mathematical >>>>>>>> Formalism". It's a bit mystifying why you should suddenly feel >>>>>>>> the need to abandon your normally Lewis Carrollesque approach to >>>>>>>> language on this one specific point. >>>>>>>> >>>>>>>> Regardless of what you want to call it, the initial contents of >>>>>>>> a Turing Machine's tape are defined by the computation that a >>>>>>>> given Turing Machine performs. >>>>>>>> >>>>>>> >>>>>>> That is flat out not true. For any TM its initial tape contents >>>>>>> can be pure gibberish thus having nothing to do with its own >>>>>>> defined set of states. >>>>>> >>>>>> Not if you want it to perform the computation which it encodes. >>>>> You stipulated the restriction incorrectly. >>>>> >>>>>>>> Linz's proof involves a putative Halt Decider and a second TM, >>>>>>>> H_Hat. >>>>>>>> >>>>>>>> The input of a Halt Decider is well-defined. It consists of the >>>>>>>> description of a Turing Machine and an input string. Nothing else. >>>>>>>> >>>>>>> >>>>>>> We are OK here. >>>>>>> >>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the >>>>>>>> description of a Turing Machine. Nothing Else. >>>>>>>> >>>>>>> >>>>>>> That is the way Linz specifies it. As I have repeated countless >>>>>>> times I am not required strictly follow every detail of Linz. >>>>>>> That you believe that I am is merely a false belief on your part. >>>>>> >>>>>> If you're addressing the Linz proof, then you need to follow Linz. >>>>>> Since H_Hat is derived from H using a very specific method, its >>>>>> inputs are determined by that method. >>>>> >>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H(). >>>> >>>> The Sipser and Linz proofs are identical. >>>> >>>> Sipser's D includes a copy of H. If you're going to read proofs >>>> about Turing Machines, you need to learn the vocabulary of Turing >>>> Machines. >>>> >>>> Is it that hard for you to grasp that different models make use of >>>> different vocabularies? '=' means something entirely different in C >>>> than it does in Pascal. You can't interpret it the pascal way when >>>> talking about C. Similarly, you can't interpret 'subroutine' in >>>> terms of procedural programming when discussing Turing Machines. >>>> >>>>>> But putting that aside, since you agreed with me above that when >>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is >>>>>> two descriptions of H_Hat, how exactly is H supposed to supply >>>>>> H_Hat with a description of H? It has no description of H to pass >>>>>> to H_Hat. >>>>> >>>>> I changed the spec when we digress from x86 machines to TMs. >>>> >>>> What does that even mean? These proofs have always been about TMs. >>>> And the input is defined in the proofs. >>>> >>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be >>>>>>>> the *only* things placed on the tape before running H: Two >>>>>>>> identical descriptions of H_Hat. There will not be a description >>>>>>>> of H placed on the tape. >>>>>>>> >>>>>>> >>>>>>> Linz does not explicitly forbid this and an equivalent problem >>>>>>> can be defined with the Turing machine description of H on the tape. >>>>>> >>>>>> And how does it get onto the tape? >>>>> >>>>> I summon a majick TM tape Genie. >>>>> >>>>>> H_Hat is called by H, and H has no description of H on its tape. >>>>> >>>>> That is a false assumption. >>>> >>>> No. Your repetition of this is pointless. >>> >>> No one says that a computation based on the simulation of Turing >>> machine descriptions is necessarily not equivalent and it is indeed a >>> known fact that such a computation <is> equivalent. >> >> What does that have to do with anything I write above? Whether you run >> H/H_Hats directly or simulate them, the inputs given to H and to H_Hat >> don't change. > > When Sipser D is defined to be able to simulate H, then D does not > have to have any aspect of H embedded within. Sipser's D is already defined by Sipser. Siper's D *isn't* defined in a way which would allow it to simulate H. Sisper’s D is defined to have an embedded copy of H within it with some additional state transitions added, just as is the case in the Linz proof. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 16:35 -0500 |
| Subject | Re: What is a computation? (too stupid!) |
| Message-ID | <BY6dnQk0GOKP1OL9nZ2dnUU7-K2dnZ2d@giganews.com> |
| In reply to | #31657 |
On 4/20/2021 4:19 PM, André G. Isaak wrote: > On 2021-04-20 14:42, olcott wrote: >> On 4/20/2021 3:34 PM, André G. Isaak wrote: >>> On 2021-04-20 14:21, olcott wrote: >>>> On 4/20/2021 3:06 PM, André G. Isaak wrote: >>>>> On 2021-04-20 13:47, olcott wrote: >>>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote: >>>>>>> On 2021-04-20 12:21, olcott wrote: >>>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote: >>>>>>>>> On 2021-04-20 10:14, olcott wrote: >>>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote: >>>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote: >>>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote: >>>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote: >>>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a >>>>>>>>>>>>>>>>>>> UTM. And X will >>>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that >>>>>>>>>>>>>>>>>>> description is >>>>>>>>>>>>>>>>>>> given to X as a formal input parameter. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work. >>>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> You are confusing the way adults talk to each other with >>>>>>>>>>>>>>> the way they >>>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" >>>>>>>>>>>>>>> because he assumes >>>>>>>>>>>>>>> his readers know what a TM is. I know what André means >>>>>>>>>>>>>>> by a parameter >>>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms >>>>>>>>>>>>>>> with other >>>>>>>>>>>>>>> people who won't get confused. I don't think you can do >>>>>>>>>>>>>>> that. >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Your English is a bit fractured here. >>>>>>>>>>>>> >>>>>>>>>>>>> Some TM will not use their tape to get an input, and do a >>>>>>>>>>>>> singular >>>>>>>>>>>>> calculation that gives a singular answer (every time it is >>>>>>>>>>>>> run) >>>>>>>>>>>>> >>>>>>>>>>>>> Most TM will use the Tape as an input, which when we use >>>>>>>>>>>>> the functional >>>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> A parmeter is a data value that has been pushed on the stack >>>>>>>>>>>> before a >>>>>>>>>>>> function call. No TM ever does anything like this. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Nope, not even in Software Engineering. >>>>>>>>>>> >>>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't >>>>>>>>>>> put on a >>>>>>>>>>> stack. >>>>>>>>>>> >>>>>>>>>>> Look at machines with register based calling conventions, the >>>>>>>>>>> first >>>>>>>>>>> couple of parameters are not put on the stack either, but are >>>>>>>>>>> just >>>>>>>>>>> placed in registers R0, R1, etc. >>>>>>>>>>> >>>>>>>>>>> Parameters are inputs to a function or procedure. >>>>>>>>>>> >>>>>>>>>>> On some systems it is even the setting of a dial or the >>>>>>>>>>> position of a >>>>>>>>>>> switch. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming) >>>>>>>>>> TMs never have anything like the conventional notion of a >>>>>>>>>> parameter. >>>>>>>>>> Their only "input" is data that is already on their tape. >>>>>>>>> >>>>>>>>> There is definite irony in you attempting to argue that some >>>>>>>>> very specific meaning must be attached to 'parameter' given >>>>>>>>> that you are perfectly happy to call C programs "Turing >>>>>>>>> Machines", Halt Deciders "UTMs" and the book of Isaiah a >>>>>>>>> "Mathematical Formalism". It's a bit mystifying why you should >>>>>>>>> suddenly feel the need to abandon your normally Lewis >>>>>>>>> Carrollesque approach to language on this one specific point. >>>>>>>>> >>>>>>>>> Regardless of what you want to call it, the initial contents of >>>>>>>>> a Turing Machine's tape are defined by the computation that a >>>>>>>>> given Turing Machine performs. >>>>>>>>> >>>>>>>> >>>>>>>> That is flat out not true. For any TM its initial tape contents >>>>>>>> can be pure gibberish thus having nothing to do with its own >>>>>>>> defined set of states. >>>>>>> >>>>>>> Not if you want it to perform the computation which it encodes. >>>>>> You stipulated the restriction incorrectly. >>>>>> >>>>>>>>> Linz's proof involves a putative Halt Decider and a second TM, >>>>>>>>> H_Hat. >>>>>>>>> >>>>>>>>> The input of a Halt Decider is well-defined. It consists of the >>>>>>>>> description of a Turing Machine and an input string. Nothing else. >>>>>>>>> >>>>>>>> >>>>>>>> We are OK here. >>>>>>>> >>>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the >>>>>>>>> description of a Turing Machine. Nothing Else. >>>>>>>>> >>>>>>>> >>>>>>>> That is the way Linz specifies it. As I have repeated countless >>>>>>>> times I am not required strictly follow every detail of Linz. >>>>>>>> That you believe that I am is merely a false belief on your part. >>>>>>> >>>>>>> If you're addressing the Linz proof, then you need to follow >>>>>>> Linz. Since H_Hat is derived from H using a very specific method, >>>>>>> its inputs are determined by that method. >>>>>> >>>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H(). >>>>> >>>>> The Sipser and Linz proofs are identical. >>>>> >>>>> Sipser's D includes a copy of H. If you're going to read proofs >>>>> about Turing Machines, you need to learn the vocabulary of Turing >>>>> Machines. >>>>> >>>>> Is it that hard for you to grasp that different models make use of >>>>> different vocabularies? '=' means something entirely different in C >>>>> than it does in Pascal. You can't interpret it the pascal way when >>>>> talking about C. Similarly, you can't interpret 'subroutine' in >>>>> terms of procedural programming when discussing Turing Machines. >>>>> >>>>>>> But putting that aside, since you agreed with me above that when >>>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape >>>>>>> is two descriptions of H_Hat, how exactly is H supposed to supply >>>>>>> H_Hat with a description of H? It has no description of H to pass >>>>>>> to H_Hat. >>>>>> >>>>>> I changed the spec when we digress from x86 machines to TMs. >>>>> >>>>> What does that even mean? These proofs have always been about TMs. >>>>> And the input is defined in the proofs. >>>>> >>>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be >>>>>>>>> the *only* things placed on the tape before running H: Two >>>>>>>>> identical descriptions of H_Hat. There will not be a >>>>>>>>> description of H placed on the tape. >>>>>>>>> >>>>>>>> >>>>>>>> Linz does not explicitly forbid this and an equivalent problem >>>>>>>> can be defined with the Turing machine description of H on the >>>>>>>> tape. >>>>>>> >>>>>>> And how does it get onto the tape? >>>>>> >>>>>> I summon a majick TM tape Genie. >>>>>> >>>>>>> H_Hat is called by H, and H has no description of H on its tape. >>>>>> >>>>>> That is a false assumption. >>>>> >>>>> No. Your repetition of this is pointless. >>>> >>>> No one says that a computation based on the simulation of Turing >>>> machine descriptions is necessarily not equivalent and it is indeed >>>> a known fact that such a computation <is> equivalent. >>> >>> What does that have to do with anything I write above? Whether you >>> run H/H_Hats directly or simulate them, the inputs given to H and to >>> H_Hat don't change. >> >> When Sipser D is defined to be able to simulate H, then D does not >> have to have any aspect of H embedded within. > > Sipser's D is already defined by Sipser. > > Siper's D *isn't* defined in a way which would allow it to simulate H. > OK you are too stupid, good bye. > Sisper’s D is defined to have an embedded copy of H within it with some > additional state transitions added, just as is the case in the Linz proof. > > André > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 16:35 -0400 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <BWGfI.20334$ft1.2250@fx10.iad> |
| In reply to | #31640 |
On 4/20/21 4:21 PM, olcott wrote: > On 4/20/2021 3:06 PM, André G. Isaak wrote: >> On 2021-04-20 13:47, olcott wrote: >>> On 4/20/2021 1:45 PM, André G. Isaak wrote: >>>> On 2021-04-20 12:21, olcott wrote: >>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote: >>>>>> On 2021-04-20 10:14, olcott wrote: >>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote: >>>>>>>> On 4/20/21 11:56 AM, olcott wrote: >>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote: >>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote: >>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>> >>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>>>>>>>>> >>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM. >>>>>>>>>>>>>>>> And X will >>>>>>>>>>>>>>>> only have a description of Y on its tape if that >>>>>>>>>>>>>>>> description is >>>>>>>>>>>>>>>> given to X as a formal input parameter. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Not really that is not the way that TM actually work. >>>>>>>>>>>>>> >>>>>>>>>>>>>> Yes, that IS the way TMs actually work. >>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this. >>>>>>>>>>>> >>>>>>>>>>>> You are confusing the way adults talk to each other with the >>>>>>>>>>>> way they >>>>>>>>>>>> must talk to children. Siper talks of "calling H" because >>>>>>>>>>>> he assumes >>>>>>>>>>>> his readers know what a TM is. I know what André means by a >>>>>>>>>>>> parameter >>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms >>>>>>>>>>>> with other >>>>>>>>>>>> people who won't get confused. I don't think you can do that. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> None-the-less you do know that no TM every has any parameter. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Your English is a bit fractured here. >>>>>>>>>> >>>>>>>>>> Some TM will not use their tape to get an input, and do a >>>>>>>>>> singular >>>>>>>>>> calculation that gives a singular answer (every time it is run) >>>>>>>>>> >>>>>>>>>> Most TM will use the Tape as an input, which when we use the >>>>>>>>>> functional >>>>>>>>>> view of a TM, that input is the parameter(s) to the function. >>>>>>>>>> >>>>>>>>> >>>>>>>>> A parmeter is a data value that has been pushed on the stack >>>>>>>>> before a >>>>>>>>> function call. No TM ever does anything like this. >>>>>>>>> >>>>>>>> >>>>>>>> Nope, not even in Software Engineering. >>>>>>>> >>>>>>>> Look at C++ templates, they have 'parameters' and they aren't >>>>>>>> put on a >>>>>>>> stack. >>>>>>>> >>>>>>>> Look at machines with register based calling conventions, the first >>>>>>>> couple of parameters are not put on the stack either, but are just >>>>>>>> placed in registers R0, R1, etc. >>>>>>>> >>>>>>>> Parameters are inputs to a function or procedure. >>>>>>>> >>>>>>>> On some systems it is even the setting of a dial or the position >>>>>>>> of a >>>>>>>> switch. >>>>>>>> >>>>>>> >>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming) >>>>>>> TMs never have anything like the conventional notion of a parameter. >>>>>>> Their only "input" is data that is already on their tape. >>>>>> >>>>>> There is definite irony in you attempting to argue that some very >>>>>> specific meaning must be attached to 'parameter' given that you >>>>>> are perfectly happy to call C programs "Turing Machines", Halt >>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical Formalism". >>>>>> It's a bit mystifying why you should suddenly feel the need to >>>>>> abandon your normally Lewis Carrollesque approach to language on >>>>>> this one specific point. >>>>>> >>>>>> Regardless of what you want to call it, the initial contents of a >>>>>> Turing Machine's tape are defined by the computation that a given >>>>>> Turing Machine performs. >>>>>> >>>>> >>>>> That is flat out not true. For any TM its initial tape contents can >>>>> be pure gibberish thus having nothing to do with its own defined >>>>> set of states. >>>> >>>> Not if you want it to perform the computation which it encodes. >>> You stipulated the restriction incorrectly. >>> >>>>>> Linz's proof involves a putative Halt Decider and a second TM, H_Hat. >>>>>> >>>>>> The input of a Halt Decider is well-defined. It consists of the >>>>>> description of a Turing Machine and an input string. Nothing else. >>>>>> >>>>> >>>>> We are OK here. >>>>> >>>>>> H_Hat's input is also well-defined by Linz. It consists of the >>>>>> description of a Turing Machine. Nothing Else. >>>>>> >>>>> >>>>> That is the way Linz specifies it. As I have repeated countless >>>>> times I am not required strictly follow every detail of Linz. That >>>>> you believe that I am is merely a false belief on your part. >>>> >>>> If you're addressing the Linz proof, then you need to follow Linz. >>>> Since H_Hat is derived from H using a very specific method, its >>>> inputs are determined by that method. >>> >>> Lets just say that I am swicthing to the Sipser proof. D() calls H(). >> >> The Sipser and Linz proofs are identical. >> >> Sipser's D includes a copy of H. If you're going to read proofs about >> Turing Machines, you need to learn the vocabulary of Turing Machines. >> >> Is it that hard for you to grasp that different models make use of >> different vocabularies? '=' means something entirely different in C >> than it does in Pascal. You can't interpret it the pascal way when >> talking about C. Similarly, you can't interpret 'subroutine' in terms >> of procedural programming when discussing Turing Machines. >> >>>> But putting that aside, since you agreed with me above that when >>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is >>>> two descriptions of H_Hat, how exactly is H supposed to supply H_Hat >>>> with a description of H? It has no description of H to pass to H_Hat. >>> >>> I changed the spec when we digress from x86 machines to TMs. >> >> What does that even mean? These proofs have always been about TMs. And >> the input is defined in the proofs. >> >>>>>> When H is called with H_Hat, H_Hat as its input, those will be the >>>>>> *only* things placed on the tape before running H: Two identical >>>>>> descriptions of H_Hat. There will not be a description of H placed >>>>>> on the tape. >>>>>> >>>>> >>>>> Linz does not explicitly forbid this and an equivalent problem can >>>>> be defined with the Turing machine description of H on the tape. >>>> >>>> And how does it get onto the tape? >>> >>> I summon a majick TM tape Genie. >>> >>>> H_Hat is called by H, and H has no description of H on its tape. >>> >>> That is a false assumption. >> >> No. Your repetition of this is pointless. > > No one says that a computation based on the simulation of Turing machine > descriptions is necessarily not equivalent and it is indeed a known fact > that such a computation <is> equivalent. > > I stipulate that I have transformed the proofs into their simulated > Turing machine description equivalent. If you are too stupid to > understand that this is equivalent then you are too stupid for me to > continue to talk to. > IF your machines were in fact equivalents to Turing Machines that would be correct. But they are not. You can NOT stipulate that you are 'right'
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 15:51 -0500 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <74-dnTzZrotWo-L9nZ2dnUU7-amdnZ2d@giganews.com> |
| In reply to | #31650 |
On 4/20/2021 3:35 PM, Richard Damon wrote:
> On 4/20/21 4:21 PM, olcott wrote:
>> On 4/20/2021 3:06 PM, André G. Isaak wrote:
>>> On 2021-04-20 13:47, olcott wrote:
>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote:
>>>>> On 2021-04-20 12:21, olcott wrote:
>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote:
>>>>>>> On 2021-04-20 10:14, olcott wrote:
>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote:
>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote:
>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote:
>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote:
>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM.
>>>>>>>>>>>>>>>>> And X will
>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that
>>>>>>>>>>>>>>>>> description is
>>>>>>>>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You are confusing the way adults talk to each other with the
>>>>>>>>>>>>> way they
>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because
>>>>>>>>>>>>> he assumes
>>>>>>>>>>>>> his readers know what a TM is. I know what André means by a
>>>>>>>>>>>>> parameter
>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms
>>>>>>>>>>>>> with other
>>>>>>>>>>>>> people who won't get confused. I don't think you can do that.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Your English is a bit fractured here.
>>>>>>>>>>>
>>>>>>>>>>> Some TM will not use their tape to get an input, and do a
>>>>>>>>>>> singular
>>>>>>>>>>> calculation that gives a singular answer (every time it is run)
>>>>>>>>>>>
>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the
>>>>>>>>>>> functional
>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> A parmeter is a data value that has been pushed on the stack
>>>>>>>>>> before a
>>>>>>>>>> function call. No TM ever does anything like this.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Nope, not even in Software Engineering.
>>>>>>>>>
>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't
>>>>>>>>> put on a
>>>>>>>>> stack.
>>>>>>>>>
>>>>>>>>> Look at machines with register based calling conventions, the first
>>>>>>>>> couple of parameters are not put on the stack either, but are just
>>>>>>>>> placed in registers R0, R1, etc.
>>>>>>>>>
>>>>>>>>> Parameters are inputs to a function or procedure.
>>>>>>>>>
>>>>>>>>> On some systems it is even the setting of a dial or the position
>>>>>>>>> of a
>>>>>>>>> switch.
>>>>>>>>>
>>>>>>>>
>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming)
>>>>>>>> TMs never have anything like the conventional notion of a parameter.
>>>>>>>> Their only "input" is data that is already on their tape.
>>>>>>>
>>>>>>> There is definite irony in you attempting to argue that some very
>>>>>>> specific meaning must be attached to 'parameter' given that you
>>>>>>> are perfectly happy to call C programs "Turing Machines", Halt
>>>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical Formalism".
>>>>>>> It's a bit mystifying why you should suddenly feel the need to
>>>>>>> abandon your normally Lewis Carrollesque approach to language on
>>>>>>> this one specific point.
>>>>>>>
>>>>>>> Regardless of what you want to call it, the initial contents of a
>>>>>>> Turing Machine's tape are defined by the computation that a given
>>>>>>> Turing Machine performs.
>>>>>>>
>>>>>>
>>>>>> That is flat out not true. For any TM its initial tape contents can
>>>>>> be pure gibberish thus having nothing to do with its own defined
>>>>>> set of states.
>>>>>
>>>>> Not if you want it to perform the computation which it encodes.
>>>> You stipulated the restriction incorrectly.
>>>>
>>>>>>> Linz's proof involves a putative Halt Decider and a second TM, H_Hat.
>>>>>>>
>>>>>>> The input of a Halt Decider is well-defined. It consists of the
>>>>>>> description of a Turing Machine and an input string. Nothing else.
>>>>>>>
>>>>>>
>>>>>> We are OK here.
>>>>>>
>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the
>>>>>>> description of a Turing Machine. Nothing Else.
>>>>>>>
>>>>>>
>>>>>> That is the way Linz specifies it. As I have repeated countless
>>>>>> times I am not required strictly follow every detail of Linz. That
>>>>>> you believe that I am is merely a false belief on your part.
>>>>>
>>>>> If you're addressing the Linz proof, then you need to follow Linz.
>>>>> Since H_Hat is derived from H using a very specific method, its
>>>>> inputs are determined by that method.
>>>>
>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H().
>>>
>>> The Sipser and Linz proofs are identical.
>>>
>>> Sipser's D includes a copy of H. If you're going to read proofs about
>>> Turing Machines, you need to learn the vocabulary of Turing Machines.
>>>
>>> Is it that hard for you to grasp that different models make use of
>>> different vocabularies? '=' means something entirely different in C
>>> than it does in Pascal. You can't interpret it the pascal way when
>>> talking about C. Similarly, you can't interpret 'subroutine' in terms
>>> of procedural programming when discussing Turing Machines.
>>>
>>>>> But putting that aside, since you agreed with me above that when
>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is
>>>>> two descriptions of H_Hat, how exactly is H supposed to supply H_Hat
>>>>> with a description of H? It has no description of H to pass to H_Hat.
>>>>
>>>> I changed the spec when we digress from x86 machines to TMs.
>>>
>>> What does that even mean? These proofs have always been about TMs. And
>>> the input is defined in the proofs.
>>>
>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be the
>>>>>>> *only* things placed on the tape before running H: Two identical
>>>>>>> descriptions of H_Hat. There will not be a description of H placed
>>>>>>> on the tape.
>>>>>>>
>>>>>>
>>>>>> Linz does not explicitly forbid this and an equivalent problem can
>>>>>> be defined with the Turing machine description of H on the tape.
>>>>>
>>>>> And how does it get onto the tape?
>>>>
>>>> I summon a majick TM tape Genie.
>>>>
>>>>> H_Hat is called by H, and H has no description of H on its tape.
>>>>
>>>> That is a false assumption.
>>>
>>> No. Your repetition of this is pointless.
>>
>> No one says that a computation based on the simulation of Turing machine
>> descriptions is necessarily not equivalent and it is indeed a known fact
>> that such a computation <is> equivalent.
>>
>> I stipulate that I have transformed the proofs into their simulated
>> Turing machine description equivalent. If you are too stupid to
>> understand that this is equivalent then you are too stupid for me to
>> continue to talk to.
>>
>
> IF your machines were in fact equivalents to Turing Machines that would
> be correct. But they are not.
>
> You can NOT stipulate that you are 'right'
>
When Sipser D is defined to be able to simulate H, then D does not
have to have any aspect of H embedded within.
void D(u32 P)
{
u32 Input_Would_Halt = Simulate(H, P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
int main()
{
H((u32)D,(u32)D);
}
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 | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 17:30 -0400 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <UJHfI.18412$9L1.10584@fx05.iad> |
| In reply to | #31654 |
On 4/20/21 4:51 PM, olcott wrote:
> On 4/20/2021 3:35 PM, Richard Damon wrote:
>> On 4/20/21 4:21 PM, olcott wrote:
>>> On 4/20/2021 3:06 PM, André G. Isaak wrote:
>>>> On 2021-04-20 13:47, olcott wrote:
>>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote:
>>>>>> On 2021-04-20 12:21, olcott wrote:
>>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote:
>>>>>>>> On 2021-04-20 10:14, olcott wrote:
>>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote:
>>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote:
>>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote:
>>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote:
>>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM.
>>>>>>>>>>>>>>>>>> And X will
>>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that
>>>>>>>>>>>>>>>>>> description is
>>>>>>>>>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You are confusing the way adults talk to each other with the
>>>>>>>>>>>>>> way they
>>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because
>>>>>>>>>>>>>> he assumes
>>>>>>>>>>>>>> his readers know what a TM is. I know what André means by a
>>>>>>>>>>>>>> parameter
>>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms
>>>>>>>>>>>>>> with other
>>>>>>>>>>>>>> people who won't get confused. I don't think you can do
>>>>>>>>>>>>>> that.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Your English is a bit fractured here.
>>>>>>>>>>>>
>>>>>>>>>>>> Some TM will not use their tape to get an input, and do a
>>>>>>>>>>>> singular
>>>>>>>>>>>> calculation that gives a singular answer (every time it is run)
>>>>>>>>>>>>
>>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the
>>>>>>>>>>>> functional
>>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> A parmeter is a data value that has been pushed on the stack
>>>>>>>>>>> before a
>>>>>>>>>>> function call. No TM ever does anything like this.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Nope, not even in Software Engineering.
>>>>>>>>>>
>>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't
>>>>>>>>>> put on a
>>>>>>>>>> stack.
>>>>>>>>>>
>>>>>>>>>> Look at machines with register based calling conventions, the
>>>>>>>>>> first
>>>>>>>>>> couple of parameters are not put on the stack either, but are
>>>>>>>>>> just
>>>>>>>>>> placed in registers R0, R1, etc.
>>>>>>>>>>
>>>>>>>>>> Parameters are inputs to a function or procedure.
>>>>>>>>>>
>>>>>>>>>> On some systems it is even the setting of a dial or the position
>>>>>>>>>> of a
>>>>>>>>>> switch.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming)
>>>>>>>>> TMs never have anything like the conventional notion of a
>>>>>>>>> parameter.
>>>>>>>>> Their only "input" is data that is already on their tape.
>>>>>>>>
>>>>>>>> There is definite irony in you attempting to argue that some very
>>>>>>>> specific meaning must be attached to 'parameter' given that you
>>>>>>>> are perfectly happy to call C programs "Turing Machines", Halt
>>>>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical Formalism".
>>>>>>>> It's a bit mystifying why you should suddenly feel the need to
>>>>>>>> abandon your normally Lewis Carrollesque approach to language on
>>>>>>>> this one specific point.
>>>>>>>>
>>>>>>>> Regardless of what you want to call it, the initial contents of a
>>>>>>>> Turing Machine's tape are defined by the computation that a given
>>>>>>>> Turing Machine performs.
>>>>>>>>
>>>>>>>
>>>>>>> That is flat out not true. For any TM its initial tape contents can
>>>>>>> be pure gibberish thus having nothing to do with its own defined
>>>>>>> set of states.
>>>>>>
>>>>>> Not if you want it to perform the computation which it encodes.
>>>>> You stipulated the restriction incorrectly.
>>>>>
>>>>>>>> Linz's proof involves a putative Halt Decider and a second TM,
>>>>>>>> H_Hat.
>>>>>>>>
>>>>>>>> The input of a Halt Decider is well-defined. It consists of the
>>>>>>>> description of a Turing Machine and an input string. Nothing else.
>>>>>>>>
>>>>>>>
>>>>>>> We are OK here.
>>>>>>>
>>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the
>>>>>>>> description of a Turing Machine. Nothing Else.
>>>>>>>>
>>>>>>>
>>>>>>> That is the way Linz specifies it. As I have repeated countless
>>>>>>> times I am not required strictly follow every detail of Linz. That
>>>>>>> you believe that I am is merely a false belief on your part.
>>>>>>
>>>>>> If you're addressing the Linz proof, then you need to follow Linz.
>>>>>> Since H_Hat is derived from H using a very specific method, its
>>>>>> inputs are determined by that method.
>>>>>
>>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H().
>>>>
>>>> The Sipser and Linz proofs are identical.
>>>>
>>>> Sipser's D includes a copy of H. If you're going to read proofs about
>>>> Turing Machines, you need to learn the vocabulary of Turing Machines.
>>>>
>>>> Is it that hard for you to grasp that different models make use of
>>>> different vocabularies? '=' means something entirely different in C
>>>> than it does in Pascal. You can't interpret it the pascal way when
>>>> talking about C. Similarly, you can't interpret 'subroutine' in terms
>>>> of procedural programming when discussing Turing Machines.
>>>>
>>>>>> But putting that aside, since you agreed with me above that when
>>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is
>>>>>> two descriptions of H_Hat, how exactly is H supposed to supply H_Hat
>>>>>> with a description of H? It has no description of H to pass to H_Hat.
>>>>>
>>>>> I changed the spec when we digress from x86 machines to TMs.
>>>>
>>>> What does that even mean? These proofs have always been about TMs. And
>>>> the input is defined in the proofs.
>>>>
>>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be the
>>>>>>>> *only* things placed on the tape before running H: Two identical
>>>>>>>> descriptions of H_Hat. There will not be a description of H placed
>>>>>>>> on the tape.
>>>>>>>>
>>>>>>>
>>>>>>> Linz does not explicitly forbid this and an equivalent problem can
>>>>>>> be defined with the Turing machine description of H on the tape.
>>>>>>
>>>>>> And how does it get onto the tape?
>>>>>
>>>>> I summon a majick TM tape Genie.
>>>>>
>>>>>> H_Hat is called by H, and H has no description of H on its tape.
>>>>>
>>>>> That is a false assumption.
>>>>
>>>> No. Your repetition of this is pointless.
>>>
>>> No one says that a computation based on the simulation of Turing machine
>>> descriptions is necessarily not equivalent and it is indeed a known fact
>>> that such a computation <is> equivalent.
>>>
>>> I stipulate that I have transformed the proofs into their simulated
>>> Turing machine description equivalent. If you are too stupid to
>>> understand that this is equivalent then you are too stupid for me to
>>> continue to talk to.
>>>
>>
>> IF your machines were in fact equivalents to Turing Machines that would
>> be correct. But they are not.
>>
>> You can NOT stipulate that you are 'right'
>>
>
> When Sipser D is defined to be able to simulate H, then D does not
> have to have any aspect of H embedded within.
If Sipser D is defined to simulate H, then Sipser D needs to be given
its own copy of the description of H.
Your use of H below is illegal in a Turing Machine, they can access no
information not built into the machine or provide as an input.
I Thought you knew that and you system disabled the access of any global
memory to your machines?
If you redefine Sipser D to that as inputs both H and P then you need to
define in your system some way to pass multi-part tapes between machines
Also, it now becomes EXTREAMLY clear that when we talk about changing H
from Halting to just simulating, that affects just that global, because
there is a unique copy of the original H as an input to D, tha copy
needs to contain ALL of the instructions for running that version of H.
>
> void D(u32 P)
> {
> u32 Input_Would_Halt = Simulate(H, P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
> int main()
> {
> H((u32)D,(u32)D);
> }
>
> 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)
>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 16:57 -0500 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <f7GdndShvenK0-L9nZ2dnUU7-VnNnZ2d@giganews.com> |
| In reply to | #31659 |
On 4/20/2021 4:30 PM, Richard Damon wrote:
> On 4/20/21 4:51 PM, olcott wrote:
>> On 4/20/2021 3:35 PM, Richard Damon wrote:
>>> On 4/20/21 4:21 PM, olcott wrote:
>>>> On 4/20/2021 3:06 PM, André G. Isaak wrote:
>>>>> On 2021-04-20 13:47, olcott wrote:
>>>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote:
>>>>>>> On 2021-04-20 12:21, olcott wrote:
>>>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-04-20 10:14, olcott wrote:
>>>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote:
>>>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote:
>>>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote:
>>>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote:
>>>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM.
>>>>>>>>>>>>>>>>>>> And X will
>>>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that
>>>>>>>>>>>>>>>>>>> description is
>>>>>>>>>>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You are confusing the way adults talk to each other with the
>>>>>>>>>>>>>>> way they
>>>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because
>>>>>>>>>>>>>>> he assumes
>>>>>>>>>>>>>>> his readers know what a TM is. I know what André means by a
>>>>>>>>>>>>>>> parameter
>>>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms
>>>>>>>>>>>>>>> with other
>>>>>>>>>>>>>>> people who won't get confused. I don't think you can do
>>>>>>>>>>>>>>> that.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> None-the-less you do know that no TM every has any parameter.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Your English is a bit fractured here.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Some TM will not use their tape to get an input, and do a
>>>>>>>>>>>>> singular
>>>>>>>>>>>>> calculation that gives a singular answer (every time it is run)
>>>>>>>>>>>>>
>>>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the
>>>>>>>>>>>>> functional
>>>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> A parmeter is a data value that has been pushed on the stack
>>>>>>>>>>>> before a
>>>>>>>>>>>> function call. No TM ever does anything like this.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Nope, not even in Software Engineering.
>>>>>>>>>>>
>>>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't
>>>>>>>>>>> put on a
>>>>>>>>>>> stack.
>>>>>>>>>>>
>>>>>>>>>>> Look at machines with register based calling conventions, the
>>>>>>>>>>> first
>>>>>>>>>>> couple of parameters are not put on the stack either, but are
>>>>>>>>>>> just
>>>>>>>>>>> placed in registers R0, R1, etc.
>>>>>>>>>>>
>>>>>>>>>>> Parameters are inputs to a function or procedure.
>>>>>>>>>>>
>>>>>>>>>>> On some systems it is even the setting of a dial or the position
>>>>>>>>>>> of a
>>>>>>>>>>> switch.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming)
>>>>>>>>>> TMs never have anything like the conventional notion of a
>>>>>>>>>> parameter.
>>>>>>>>>> Their only "input" is data that is already on their tape.
>>>>>>>>>
>>>>>>>>> There is definite irony in you attempting to argue that some very
>>>>>>>>> specific meaning must be attached to 'parameter' given that you
>>>>>>>>> are perfectly happy to call C programs "Turing Machines", Halt
>>>>>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical Formalism".
>>>>>>>>> It's a bit mystifying why you should suddenly feel the need to
>>>>>>>>> abandon your normally Lewis Carrollesque approach to language on
>>>>>>>>> this one specific point.
>>>>>>>>>
>>>>>>>>> Regardless of what you want to call it, the initial contents of a
>>>>>>>>> Turing Machine's tape are defined by the computation that a given
>>>>>>>>> Turing Machine performs.
>>>>>>>>>
>>>>>>>>
>>>>>>>> That is flat out not true. For any TM its initial tape contents can
>>>>>>>> be pure gibberish thus having nothing to do with its own defined
>>>>>>>> set of states.
>>>>>>>
>>>>>>> Not if you want it to perform the computation which it encodes.
>>>>>> You stipulated the restriction incorrectly.
>>>>>>
>>>>>>>>> Linz's proof involves a putative Halt Decider and a second TM,
>>>>>>>>> H_Hat.
>>>>>>>>>
>>>>>>>>> The input of a Halt Decider is well-defined. It consists of the
>>>>>>>>> description of a Turing Machine and an input string. Nothing else.
>>>>>>>>>
>>>>>>>>
>>>>>>>> We are OK here.
>>>>>>>>
>>>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the
>>>>>>>>> description of a Turing Machine. Nothing Else.
>>>>>>>>>
>>>>>>>>
>>>>>>>> That is the way Linz specifies it. As I have repeated countless
>>>>>>>> times I am not required strictly follow every detail of Linz. That
>>>>>>>> you believe that I am is merely a false belief on your part.
>>>>>>>
>>>>>>> If you're addressing the Linz proof, then you need to follow Linz.
>>>>>>> Since H_Hat is derived from H using a very specific method, its
>>>>>>> inputs are determined by that method.
>>>>>>
>>>>>> Lets just say that I am swicthing to the Sipser proof. D() calls H().
>>>>>
>>>>> The Sipser and Linz proofs are identical.
>>>>>
>>>>> Sipser's D includes a copy of H. If you're going to read proofs about
>>>>> Turing Machines, you need to learn the vocabulary of Turing Machines.
>>>>>
>>>>> Is it that hard for you to grasp that different models make use of
>>>>> different vocabularies? '=' means something entirely different in C
>>>>> than it does in Pascal. You can't interpret it the pascal way when
>>>>> talking about C. Similarly, you can't interpret 'subroutine' in terms
>>>>> of procedural programming when discussing Turing Machines.
>>>>>
>>>>>>> But putting that aside, since you agreed with me above that when
>>>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is
>>>>>>> two descriptions of H_Hat, how exactly is H supposed to supply H_Hat
>>>>>>> with a description of H? It has no description of H to pass to H_Hat.
>>>>>>
>>>>>> I changed the spec when we digress from x86 machines to TMs.
>>>>>
>>>>> What does that even mean? These proofs have always been about TMs. And
>>>>> the input is defined in the proofs.
>>>>>
>>>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be the
>>>>>>>>> *only* things placed on the tape before running H: Two identical
>>>>>>>>> descriptions of H_Hat. There will not be a description of H placed
>>>>>>>>> on the tape.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Linz does not explicitly forbid this and an equivalent problem can
>>>>>>>> be defined with the Turing machine description of H on the tape.
>>>>>>>
>>>>>>> And how does it get onto the tape?
>>>>>>
>>>>>> I summon a majick TM tape Genie.
>>>>>>
>>>>>>> H_Hat is called by H, and H has no description of H on its tape.
>>>>>>
>>>>>> That is a false assumption.
>>>>>
>>>>> No. Your repetition of this is pointless.
>>>>
>>>> No one says that a computation based on the simulation of Turing machine
>>>> descriptions is necessarily not equivalent and it is indeed a known fact
>>>> that such a computation <is> equivalent.
>>>>
>>>> I stipulate that I have transformed the proofs into their simulated
>>>> Turing machine description equivalent. If you are too stupid to
>>>> understand that this is equivalent then you are too stupid for me to
>>>> continue to talk to.
>>>>
>>>
>>> IF your machines were in fact equivalents to Turing Machines that would
>>> be correct. But they are not.
>>>
>>> You can NOT stipulate that you are 'right'
>>>
>>
>> When Sipser D is defined to be able to simulate H, then D does not
>> have to have any aspect of H embedded within.
>
> If Sipser D is defined to simulate H, then Sipser D needs to be given
> its own copy of the description of H.
This would be the conventional way. In actuality it does not need any
separate copy of H. As long as D seems to have its own copy of H on its
own virtual tape then this is sufficient.
> Your use of H below is illegal in a Turing Machine, they can access no
> information not built into the machine or provide as an input.
>
It is merely a higher level abstraction of saying that D has access to H
on D tape.
> I Thought you knew that and you system disabled the access of any global
> memory to your machines?
>
TM's do not really have any parameters at all, they only have a tape.
> If you redefine Sipser D to that as inputs both H and P then you need to
> define in your system some way to pass multi-part tapes between machines
>
H is merely at the beginning of D's tape.
> Also, it now becomes EXTREAMLY clear that when we talk about changing H
> from Halting to just simulating, that affects just that global, because
> there is a unique copy of the original H as an input to D, tha copy
> needs to contain ALL of the instructions for running that version of H.
>
>
>>
>> void D(u32 P)
>> {
>> u32 Input_Would_Halt = Simulate(H, P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> H((u32)D,(u32)D);
>> }
>>
>> 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 | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 18:50 -0400 |
| Subject | Re: What is a computation? (too stupid?) |
| Message-ID | <KUIfI.28331$wd1.25989@fx41.iad> |
| In reply to | #31665 |
On 4/20/21 5:57 PM, olcott wrote:
> On 4/20/2021 4:30 PM, Richard Damon wrote:
>> On 4/20/21 4:51 PM, olcott wrote:
>>> On 4/20/2021 3:35 PM, Richard Damon wrote:
>>>> On 4/20/21 4:21 PM, olcott wrote:
>>>>> On 4/20/2021 3:06 PM, André G. Isaak wrote:
>>>>>> On 2021-04-20 13:47, olcott wrote:
>>>>>>> On 4/20/2021 1:45 PM, André G. Isaak wrote:
>>>>>>>> On 2021-04-20 12:21, olcott wrote:
>>>>>>>>> On 4/20/2021 12:57 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-04-20 10:14, olcott wrote:
>>>>>>>>>>> On 4/20/2021 11:01 AM, Richard Damon wrote:
>>>>>>>>>>>> On 4/20/21 11:56 AM, olcott wrote:
>>>>>>>>>>>>> On 4/20/2021 10:50 AM, Richard Damon wrote:
>>>>>>>>>>>>>> On 4/20/21 11:35 AM, olcott wrote:
>>>>>>>>>>>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>>>>>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Right, but X can only simulate Y if X is actually a
>>>>>>>>>>>>>>>>>>>> UTM.
>>>>>>>>>>>>>>>>>>>> And X will
>>>>>>>>>>>>>>>>>>>> only have a description of Y on its tape if that
>>>>>>>>>>>>>>>>>>>> description is
>>>>>>>>>>>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>>>>>>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You are confusing the way adults talk to each other with
>>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>>> way they
>>>>>>>>>>>>>>>> must talk to children. Siper talks of "calling H" because
>>>>>>>>>>>>>>>> he assumes
>>>>>>>>>>>>>>>> his readers know what a TM is. I know what André means
>>>>>>>>>>>>>>>> by a
>>>>>>>>>>>>>>>> parameter
>>>>>>>>>>>>>>>> and I'll happily discuss TMs in these metaphorical terms
>>>>>>>>>>>>>>>> with other
>>>>>>>>>>>>>>>> people who won't get confused. I don't think you can do
>>>>>>>>>>>>>>>> that.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> None-the-less you do know that no TM every has any
>>>>>>>>>>>>>>> parameter.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Your English is a bit fractured here.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Some TM will not use their tape to get an input, and do a
>>>>>>>>>>>>>> singular
>>>>>>>>>>>>>> calculation that gives a singular answer (every time it is
>>>>>>>>>>>>>> run)
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Most TM will use the Tape as an input, which when we use the
>>>>>>>>>>>>>> functional
>>>>>>>>>>>>>> view of a TM, that input is the parameter(s) to the function.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> A parmeter is a data value that has been pushed on the stack
>>>>>>>>>>>>> before a
>>>>>>>>>>>>> function call. No TM ever does anything like this.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Nope, not even in Software Engineering.
>>>>>>>>>>>>
>>>>>>>>>>>> Look at C++ templates, they have 'parameters' and they aren't
>>>>>>>>>>>> put on a
>>>>>>>>>>>> stack.
>>>>>>>>>>>>
>>>>>>>>>>>> Look at machines with register based calling conventions, the
>>>>>>>>>>>> first
>>>>>>>>>>>> couple of parameters are not put on the stack either, but are
>>>>>>>>>>>> just
>>>>>>>>>>>> placed in registers R0, R1, etc.
>>>>>>>>>>>>
>>>>>>>>>>>> Parameters are inputs to a function or procedure.
>>>>>>>>>>>>
>>>>>>>>>>>> On some systems it is even the setting of a dial or the
>>>>>>>>>>>> position
>>>>>>>>>>>> of a
>>>>>>>>>>>> switch.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> https://en.wikipedia.org/wiki/Parameter_(computer_programming)
>>>>>>>>>>> TMs never have anything like the conventional notion of a
>>>>>>>>>>> parameter.
>>>>>>>>>>> Their only "input" is data that is already on their tape.
>>>>>>>>>>
>>>>>>>>>> There is definite irony in you attempting to argue that some very
>>>>>>>>>> specific meaning must be attached to 'parameter' given that you
>>>>>>>>>> are perfectly happy to call C programs "Turing Machines", Halt
>>>>>>>>>> Deciders "UTMs" and the book of Isaiah a "Mathematical
>>>>>>>>>> Formalism".
>>>>>>>>>> It's a bit mystifying why you should suddenly feel the need to
>>>>>>>>>> abandon your normally Lewis Carrollesque approach to language on
>>>>>>>>>> this one specific point.
>>>>>>>>>>
>>>>>>>>>> Regardless of what you want to call it, the initial contents of a
>>>>>>>>>> Turing Machine's tape are defined by the computation that a given
>>>>>>>>>> Turing Machine performs.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> That is flat out not true. For any TM its initial tape contents
>>>>>>>>> can
>>>>>>>>> be pure gibberish thus having nothing to do with its own defined
>>>>>>>>> set of states.
>>>>>>>>
>>>>>>>> Not if you want it to perform the computation which it encodes.
>>>>>>> You stipulated the restriction incorrectly.
>>>>>>>
>>>>>>>>>> Linz's proof involves a putative Halt Decider and a second TM,
>>>>>>>>>> H_Hat.
>>>>>>>>>>
>>>>>>>>>> The input of a Halt Decider is well-defined. It consists of the
>>>>>>>>>> description of a Turing Machine and an input string. Nothing
>>>>>>>>>> else.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> We are OK here.
>>>>>>>>>
>>>>>>>>>> H_Hat's input is also well-defined by Linz. It consists of the
>>>>>>>>>> description of a Turing Machine. Nothing Else.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> That is the way Linz specifies it. As I have repeated countless
>>>>>>>>> times I am not required strictly follow every detail of Linz. That
>>>>>>>>> you believe that I am is merely a false belief on your part.
>>>>>>>>
>>>>>>>> If you're addressing the Linz proof, then you need to follow Linz.
>>>>>>>> Since H_Hat is derived from H using a very specific method, its
>>>>>>>> inputs are determined by that method.
>>>>>>>
>>>>>>> Lets just say that I am swicthing to the Sipser proof. D() calls
>>>>>>> H().
>>>>>>
>>>>>> The Sipser and Linz proofs are identical.
>>>>>>
>>>>>> Sipser's D includes a copy of H. If you're going to read proofs about
>>>>>> Turing Machines, you need to learn the vocabulary of Turing Machines.
>>>>>>
>>>>>> Is it that hard for you to grasp that different models make use of
>>>>>> different vocabularies? '=' means something entirely different in C
>>>>>> than it does in Pascal. You can't interpret it the pascal way when
>>>>>> talking about C. Similarly, you can't interpret 'subroutine' in terms
>>>>>> of procedural programming when discussing Turing Machines.
>>>>>>
>>>>>>>> But putting that aside, since you agreed with me above that when
>>>>>>>> H(H_Hat, H_Hat) is called, the only thing initially on the tape is
>>>>>>>> two descriptions of H_Hat, how exactly is H supposed to supply
>>>>>>>> H_Hat
>>>>>>>> with a description of H? It has no description of H to pass to
>>>>>>>> H_Hat.
>>>>>>>
>>>>>>> I changed the spec when we digress from x86 machines to TMs.
>>>>>>
>>>>>> What does that even mean? These proofs have always been about TMs.
>>>>>> And
>>>>>> the input is defined in the proofs.
>>>>>>
>>>>>>>>>> When H is called with H_Hat, H_Hat as its input, those will be
>>>>>>>>>> the
>>>>>>>>>> *only* things placed on the tape before running H: Two identical
>>>>>>>>>> descriptions of H_Hat. There will not be a description of H
>>>>>>>>>> placed
>>>>>>>>>> on the tape.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Linz does not explicitly forbid this and an equivalent problem can
>>>>>>>>> be defined with the Turing machine description of H on the tape.
>>>>>>>>
>>>>>>>> And how does it get onto the tape?
>>>>>>>
>>>>>>> I summon a majick TM tape Genie.
>>>>>>>
>>>>>>>> H_Hat is called by H, and H has no description of H on its tape.
>>>>>>>
>>>>>>> That is a false assumption.
>>>>>>
>>>>>> No. Your repetition of this is pointless.
>>>>>
>>>>> No one says that a computation based on the simulation of Turing
>>>>> machine
>>>>> descriptions is necessarily not equivalent and it is indeed a known
>>>>> fact
>>>>> that such a computation <is> equivalent.
>>>>>
>>>>> I stipulate that I have transformed the proofs into their simulated
>>>>> Turing machine description equivalent. If you are too stupid to
>>>>> understand that this is equivalent then you are too stupid for me to
>>>>> continue to talk to.
>>>>>
>>>>
>>>> IF your machines were in fact equivalents to Turing Machines that would
>>>> be correct. But they are not.
>>>>
>>>> You can NOT stipulate that you are 'right'
>>>>
>>>
>>> When Sipser D is defined to be able to simulate H, then D does not
>>> have to have any aspect of H embedded within.
>>
>> If Sipser D is defined to simulate H, then Sipser D needs to be given
>> its own copy of the description of H.
>
> This would be the conventional way. In actuality it does not need any
> separate copy of H. As long as D seems to have its own copy of H on its
> own virtual tape then this is sufficient.
IF D seems to have its own copy of H on its own virtual tape, then H
needs to be listed as an input to D. IF some supposed UTM provides it
without it being listed there, then the machine is NOT a UTM.
>
>> Your use of H below is illegal in a Turing Machine, they can access no
>> information not built into the machine or provide as an input.
>>
>
> It is merely a higher level abstraction of saying that D has access to H
> on D tape.
That MEANS, that as far as TM D is concerned, it IS on the tape for D.
>
>> I Thought you knew that and you system disabled the access of any global
>> memory to your machines?
>>
>
> TM's do not really have any parameters at all, they only have a tape.
The Tape IS the parameter(s) to the Turing Machine.
>
>> If you redefine Sipser D to that as inputs both H and P then you need to
>> define in your system some way to pass multi-part tapes between machines
>>
>
> H is merely at the beginning of D's tape.
Then D needs to be described as taking input of H and P. Which it isn't
>
>> Also, it now becomes EXTREAMLY clear that when we talk about changing H
>> from Halting to just simulating, that affects just that global, because
>> there is a unique copy of the original H as an input to D, tha copy
>> needs to contain ALL of the instructions for running that version of H.
>>
>>
>>>
>>> void D(u32 P)
>>> {
>>> u32 Input_Would_Halt = Simulate(H, P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> H((u32)D,(u32)D);
>>> }
>>>
>>> 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)
>>>
>>>
>>>
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-04-20 12:59 -0700 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <s5nbq5$1fk8$1@gioia.aioe.org> |
| In reply to | #31586 |
On 4/20/2021 8:56 AM, olcott wrote: > On 4/20/2021 10:50 AM, Richard Damon wrote: >> On 4/20/21 11:35 AM, olcott wrote: >>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>> >>>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X will >>>>>>>> only have a description of Y on its tape if that description is >>>>>>>> given to X as a formal input parameter. >>>>>>> >>>>>>> Not really that is not the way that TM actually work. >>>>>> >>>>>> Yes, that IS the way TMs actually work. >>>>> TMs do not ever have parameters, Ben knows this. >>>> >>>> You are confusing the way adults talk to each other with the way they >>>> must talk to children. Siper talks of "calling H" because he assumes >>>> his readers know what a TM is. I know what André means by a parameter >>>> and I'll happily discuss TMs in these metaphorical terms with other >>>> people who won't get confused. I don't think you can do that. >>>> >>> >>> None-the-less you do know that no TM every has any parameter. >>> >> >> Your English is a bit fractured here. >> >> Some TM will not use their tape to get an input, and do a singular >> calculation that gives a singular answer (every time it is run) >> >> Most TM will use the Tape as an input, which when we use the functional >> view of a TM, that input is the parameter(s) to the function. >> > > A parmeter is a data value that has been pushed on the stack before a > function call. No TM ever does anything like this. > What calling conventions are you familiar with? Keep in mind that storing function parameters in registers is a real thing.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 15:15 -0500 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <O4adnfk7r8H0q-L9nZ2dnUU7-emdnZ2d@giganews.com> |
| In reply to | #31635 |
On 4/20/2021 2:59 PM, Chris M. Thomasson wrote: > On 4/20/2021 8:56 AM, olcott wrote: >> On 4/20/2021 10:50 AM, Richard Damon wrote: >>> On 4/20/21 11:35 AM, olcott wrote: >>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>> >>>>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X >>>>>>>>> will >>>>>>>>> only have a description of Y on its tape if that description is >>>>>>>>> given to X as a formal input parameter. >>>>>>>> >>>>>>>> Not really that is not the way that TM actually work. >>>>>>> >>>>>>> Yes, that IS the way TMs actually work. >>>>>> TMs do not ever have parameters, Ben knows this. >>>>> >>>>> You are confusing the way adults talk to each other with the way they >>>>> must talk to children. Siper talks of "calling H" because he assumes >>>>> his readers know what a TM is. I know what André means by a parameter >>>>> and I'll happily discuss TMs in these metaphorical terms with other >>>>> people who won't get confused. I don't think you can do that. >>>>> >>>> >>>> None-the-less you do know that no TM every has any parameter. >>>> >>> >>> Your English is a bit fractured here. >>> >>> Some TM will not use their tape to get an input, and do a singular >>> calculation that gives a singular answer (every time it is run) >>> >>> Most TM will use the Tape as an input, which when we use the functional >>> view of a TM, that input is the parameter(s) to the function. >>> >> >> A parmeter is a data value that has been pushed on the stack before a >> function call. No TM ever does anything like this. >> > > What calling conventions are you familiar with? Keep in mind that > storing function parameters in registers is a real thing. Good point -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-20 20:14 +0100 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <871rb4wyys.fsf@bsb.me.uk> |
| In reply to | #31579 |
olcott <NoOne@NoWhere.com> writes:
> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>> On 2021-04-19 22:51, olcott wrote:
>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>
>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X will
>>>>>> only have a description of Y on its tape if that description is
>>>>>> given to X as a formal input parameter.
>>>>>
>>>>> Not really that is not the way that TM actually work.
>>>>
>>>> Yes, that IS the way TMs actually work.
>>> TMs do not ever have parameters, Ben knows this.
>>
>> You are confusing the way adults talk to each other with the way they
>> must talk to children. Siper talks of "calling H" because he assumes
>> his readers know what a TM is. I know what André means by a parameter
>> and I'll happily discuss TMs in these metaphorical terms with other
>> people who won't get confused. I don't think you can do that.
>
> None-the-less you do know that no TM every has any parameter.
They do and they don't. Both are metaphorical ways of speaking, and
what matters is what the speaker means by it and what the listener gets
from it. Neither is right or wrong in any formal sense. I am sure that
I got the intended meaning from André's words. I don't know if you did.
It seems unlikely.
Mathematical truths are essentially wordless. A TM is what it is
defined to be, no more and no less. It does not "do" anything (another
metaphor that confuses many people, you included). Everything, apart
from what can be formally deduced form the definitions, is metaphor.
The art (and it definitely is an art) is to talk about mathematics using
metaphors that explain without confusing.
This is what talking about TMs with minimal metaphors looks like:
X = ({a, b}, {0, 1}, d)
with d a 0 = (a, 1, R)
d a 1 = (a, 1, R)
d a _ = (b, _, L)
a 001 ⊦ 1 a 01 ⊦ 11 a 1 ⊦ 111 a ⊦ 111 b
Not much fun! Saying that X scans it's input swapping zeros for ones
is, if you think about it, a total fantasy. The only point of saying it
is that it might help someone understand.
Your use of metaphor is off the charts.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 14:34 -0500 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <MsGdnZXAVKwnseL9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #31625 |
On 4/20/2021 2:14 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>> On 2021-04-19 22:51, olcott wrote: >>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>> >>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X will >>>>>>> only have a description of Y on its tape if that description is >>>>>>> given to X as a formal input parameter. >>>>>> >>>>>> Not really that is not the way that TM actually work. >>>>> >>>>> Yes, that IS the way TMs actually work. >>>> TMs do not ever have parameters, Ben knows this. >>> >>> You are confusing the way adults talk to each other with the way they >>> must talk to children. Siper talks of "calling H" because he assumes >>> his readers know what a TM is. I know what André means by a parameter >>> and I'll happily discuss TMs in these metaphorical terms with other >>> people who won't get confused. I don't think you can do that. >> >> None-the-less you do know that no TM every has any parameter. > > They do and they don't. Both are metaphorical ways of speaking, and > what matters is what the speaker means by it and what the listener gets > from it. Neither is right or wrong in any formal sense. I am sure that > I got the intended meaning from André's words. I don't know if you did. > It seems unlikely. > That a TM must represent a pure function is a false statement based on false assumptions. A TM need not be anything like a pure function. That a halt decider must be a pure function of its input seems reasonably plausible. That it is not allowed to have side-effects seem unreasonably implausible. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-20 13:39 -0600 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <s5nam9$4ae$1@dont-email.me> |
| In reply to | #31630 |
On 2021-04-20 13:34, olcott wrote: > On 4/20/2021 2:14 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>> >>>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X will >>>>>>>> only have a description of Y on its tape if that description is >>>>>>>> given to X as a formal input parameter. >>>>>>> >>>>>>> Not really that is not the way that TM actually work. >>>>>> >>>>>> Yes, that IS the way TMs actually work. >>>>> TMs do not ever have parameters, Ben knows this. >>>> >>>> You are confusing the way adults talk to each other with the way they >>>> must talk to children. Siper talks of "calling H" because he assumes >>>> his readers know what a TM is. I know what André means by a parameter >>>> and I'll happily discuss TMs in these metaphorical terms with other >>>> people who won't get confused. I don't think you can do that. >>> >>> None-the-less you do know that no TM every has any parameter. >> >> They do and they don't. Both are metaphorical ways of speaking, and >> what matters is what the speaker means by it and what the listener gets >> from it. Neither is right or wrong in any formal sense. I am sure that >> I got the intended meaning from André's words. I don't know if you did. >> It seems unlikely. >> > > That a TM must represent a pure function is a false statement based on > false assumptions. A TM need not be anything like a pure function. > > That a halt decider must be a pure function of its input seems > reasonably plausible. That it is not allowed to have side-effects seem > unreasonably implausible. What would it even MEAN for a Turing Machine to have side-effects? That statement is uninterpretable as far as I can tell. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 14:50 -0500 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <uISdnb6gHITmreL9nZ2dnUU7-fGdnZ2d@giganews.com> |
| In reply to | #31632 |
On 4/20/2021 2:39 PM, André G. Isaak wrote: > On 2021-04-20 13:34, olcott wrote: >> On 4/20/2021 2:14 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote: >>>>>>> On 2021-04-19 22:51, olcott wrote: >>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote: >>>>> >>>>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X >>>>>>>>> will >>>>>>>>> only have a description of Y on its tape if that description is >>>>>>>>> given to X as a formal input parameter. >>>>>>>> >>>>>>>> Not really that is not the way that TM actually work. >>>>>>> >>>>>>> Yes, that IS the way TMs actually work. >>>>>> TMs do not ever have parameters, Ben knows this. >>>>> >>>>> You are confusing the way adults talk to each other with the way they >>>>> must talk to children. Siper talks of "calling H" because he assumes >>>>> his readers know what a TM is. I know what André means by a parameter >>>>> and I'll happily discuss TMs in these metaphorical terms with other >>>>> people who won't get confused. I don't think you can do that. >>>> >>>> None-the-less you do know that no TM every has any parameter. >>> >>> They do and they don't. Both are metaphorical ways of speaking, and >>> what matters is what the speaker means by it and what the listener gets >>> from it. Neither is right or wrong in any formal sense. I am sure that >>> I got the intended meaning from André's words. I don't know if you did. >>> It seems unlikely. >>> >> >> That a TM must represent a pure function is a false statement based on >> false assumptions. A TM need not be anything like a pure function. >> >> That a halt decider must be a pure function of its input seems >> reasonably plausible. That it is not allowed to have side-effects seem >> unreasonably implausible. > > What would it even MEAN for a Turing Machine to have side-effects? That > statement is uninterpretable as far as I can tell. > > André > > Sipser H decides that Sipser D halts by overwriting Sipser D with with the TM description of a machine that halts. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-20 14:11 -0600 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <s5nchl$hke$1@dont-email.me> |
| In reply to | #31634 |
On 2021-04-20 13:50, olcott wrote:
> On 4/20/2021 2:39 PM, André G. Isaak wrote:
>> On 2021-04-20 13:34, olcott wrote:
>>> On 4/20/2021 2:14 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/20/2021 5:50 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/20/2021 12:02 AM, André G. Isaak wrote:
>>>>>>>> On 2021-04-19 22:51, olcott wrote:
>>>>>>>>> On 4/19/2021 11:42 PM, André G. Isaak wrote:
>>>>>>
>>>>>>>>>> Right, but X can only simulate Y if X is actually a UTM. And X
>>>>>>>>>> will
>>>>>>>>>> only have a description of Y on its tape if that description is
>>>>>>>>>> given to X as a formal input parameter.
>>>>>>>>>
>>>>>>>>> Not really that is not the way that TM actually work.
>>>>>>>>
>>>>>>>> Yes, that IS the way TMs actually work.
>>>>>>> TMs do not ever have parameters, Ben knows this.
>>>>>>
>>>>>> You are confusing the way adults talk to each other with the way they
>>>>>> must talk to children. Siper talks of "calling H" because he assumes
>>>>>> his readers know what a TM is. I know what André means by a
>>>>>> parameter
>>>>>> and I'll happily discuss TMs in these metaphorical terms with other
>>>>>> people who won't get confused. I don't think you can do that.
>>>>>
>>>>> None-the-less you do know that no TM every has any parameter.
>>>>
>>>> They do and they don't. Both are metaphorical ways of speaking, and
>>>> what matters is what the speaker means by it and what the listener gets
>>>> from it. Neither is right or wrong in any formal sense. I am sure
>>>> that
>>>> I got the intended meaning from André's words. I don't know if you
>>>> did.
>>>> It seems unlikely.
>>>>
>>>
>>> That a TM must represent a pure function is a false statement based
>>> on false assumptions. A TM need not be anything like a pure function.
>>>
>>> That a halt decider must be a pure function of its input seems
>>> reasonably plausible. That it is not allowed to have side-effects
>>> seem unreasonably implausible.
>>
>> What would it even MEAN for a Turing Machine to have side-effects?
>> That statement is uninterpretable as far as I can tell.
>>
>> André
>>
>>
>
> Sipser H decides that Sipser D halts by overwriting Sipser D with with
> the TM description of a machine that halts.
Sort of like this function decides that 34 is prime by overwriting it
with 2?
boolean IsXPrime(int x) {
x = 2; # overwrite input to make it prime
return(true); # I stipulate that this is always the correct answer
}
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 16:31 -0400 |
| Subject | Re: What is a computation? (TM Y calls TM X) |
| Message-ID | <KSGfI.89538$ST2.78487@fx47.iad> |
| In reply to | #31634 |
On 4/20/21 3:50 PM, olcott wrote: > On 4/20/2021 2:39 PM, André G. Isaak wrote: >> What would it even MEAN for a Turing Machine to have side-effects? >> That statement is uninterpretable as far as I can tell. >> >> André >> >> > > Sipser H decides that Sipser D halts by overwriting Sipser D with with > the TM description of a machine that halts. > A Turing Machine can NOT 'overwrite' another. Even when running under a UTM, the tape with the description is out of reach of the TM.
[toc] | [prev] | [next] | [standalone]
Page 23 of 50 — ← Prev page 1 … 21 22 [23] 24 25 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web