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 8 of 50 — ← Prev page 1 … 6 7 [8] 9 10 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 10:58 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <9NGdnauWgc0b_-X9nZ2dnUU7-cPNnZ2d@giganews.com> |
| In reply to | #31046 |
On 4/15/2021 10:25 AM, Richard Damon wrote:
> On 4/15/21 10:52 AM, olcott wrote:
>> On 4/15/2021 6:42 AM, Richard Damon wrote:
>>> On 4/14/21 11:18 PM, olcott wrote:
>>>> On 4/14/2021 8:39 PM, Richard Damon wrote:
>>>>> On 4/14/21 9:18 PM, olcott wrote:
>>>>>
>>>>>> and it remains a non-halting computation no matter what happens after
>>>>>> that point in the execution trace, especially including that the halt
>>>>>> stopped simulating it therefore forcing it to halt.
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>
>>>>> That seems like an insaine definition that something is a non-halting
>>>>> computation even if it does come to a halt.
>>>>>
>>>>> Note, YOU only seem to look at the sequence of:
>>>>>
>>>>> Halt -> H_Hat ...
>>>>>
>>>>> but the real question is what happens when we do:
>>>>>
>>>>> H_Hat -> Halt -> H_Hat
>>>>>
>>>>> THERE Halt isn't allowed to abort the outer H_Hat, (not and me a proper
>>>>> decider) so you can't make the 'stop simulated' argument about it.
>>>>>
>>>>
>>>> Halts ONLY takes Turing machine descriptions that it simulates and is
>>>> totally free to abort any of these slave processes at will.
>>>>
>>>> The only reason why this terminates: H_Hat -> Halt -> H_Hat
>>>> is that Halts aborts its H_Hat.
>>>>
>>>
>>> But the sequence in question is:
>>> Main -> H_Hat(1) -> Halt(2) -> H_Hat(3) -> Halt(4) -> H_Hat(5)
>>>
>>> by that logic has Halt(2) will abort H_Hat(3) and return the answer of
>>> non-halting to H_Hat(1) which hasn't been aborted and it will halt
>>> showing the answer to be wrong.
>>>
>>
>> On the computable function aspect of these things your understanding
>> seems to be somewhat better than everyone else here.
>>
>> On things such as the above you seem to be a complete moron. You are
>> correct within the scope of the local halt decider that the first H_Hat
>> would halt. You are woefully stupidly incorrect that this means that
>> Halts decided H_Hat(3) incorrectly.
>>
>> You are far beyond woefully stupidly incorrect that you cannot see that
>> when we simply disable the halt deciding aspect of the halt decider thus
>> causing H_Hat(3) to have infinite recursion that this proves beyond all
>> possible doubt that Halts did decide H_Hat(3) correctly.
>>
>> It is like a smash a Boston cream pie in your face and you continue to
>> insist that there never was any pie even with pie dripping off your face.
>>
>
> Changing Halts everywhere to be a UTM says we are checking the wrong
> computation. A fundamental, kindergarten level of logic is that to say
> somehting about a statement, you need to keep to the definitions of that
> statement.
>
> We start out with a DEFINED H (aka Halts) and from that we define a H^
> (aka H_Hat) and fix that algorithm for the problem. These are FIXED
> defintions we are trying to make a proof on, and can not 'edit' them.
>
> Note, that this definition includes ALL the steps that a machine will
> need to run the operation. It does not include ANY 'external' calls to
> system that might be changeable (like a Halts function in the system).
> THIS IS HOW TURING MACHINES WORK.
>
> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) and
> when it makes that decision, the H_Hat will always call that original
> Halts function that was fixed into the code. THAT IS HOW TURING MACHINES
> WORK.
>
> Thus we can ask that original Halts about what its decision would be on
> H_Hat, and get an answer, which you say will be non-halting. We then
> decide we want to chack that answer, so we say, let us check this answer
> with a slightly different halt decider, one which won't actually halt
> the computation, if the requirement of need to halt, was true, then this
> altered halt decider shouldn't halt and go into an infinite loop. Note,
> this test, like when we run H_Hat on any other halt decider, still used
> the original tape, with the original definition of halts on the tape.
>
> This procedure actually makes some sense as this halts with the abort
> disabled effectively becomes a real UTM so asking it is like running the
> actual machine.
>
> When we do this, by definition, since we have been told that
> Halts(H_Hat,H_Hat) has previously returned non-halting, the execution of
> that top level H_Hat inside this defanged Halts/now UTM will get that
> answer and it will halt and thus we see that H_Hat(H_Hat) is in fact a
> finite computation when it is built on your original Halts machine.
>
No you are flat out incorrect about this. When we remove the halt
detector from Halts the top level H_Hat really is infinitely recursive.
Halting problem undecidability and infinite recursion
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
If your weren't utterly clueless about the x86 language you would see
that the relationship between Halts() and H_Hat() <is> infinite recursion.
Here it is at the C level:
u32 Simulate(u32 P, u32 I)
{
u32 Halted = 0
while (!Halted)
Halted = DebugStep(P, I);
return 1;
}
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Simulate(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
--
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-15 14:32 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <ME%dI.3794$8O4.1675@fx16.iad> |
| In reply to | #31056 |
On 4/15/21 11:58 AM, olcott wrote:
> On 4/15/2021 10:25 AM, Richard Damon wrote:
>> Changing Halts everywhere to be a UTM says we are checking the wrong
>> computation. A fundamental, kindergarten level of logic is that to say
>> somehting about a statement, you need to keep to the definitions of that
>> statement.
>>
>> We start out with a DEFINED H (aka Halts) and from that we define a H^
>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED
>> defintions we are trying to make a proof on, and can not 'edit' them.
>>
>> Note, that this definition includes ALL the steps that a machine will
>> need to run the operation. It does not include ANY 'external' calls to
>> system that might be changeable (like a Halts function in the system).
>> THIS IS HOW TURING MACHINES WORK.
>>
>> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) and
>> when it makes that decision, the H_Hat will always call that original
>> Halts function that was fixed into the code. THAT IS HOW TURING MACHINES
>> WORK.
>>
>> Thus we can ask that original Halts about what its decision would be on
>> H_Hat, and get an answer, which you say will be non-halting. We then
>> decide we want to chack that answer, so we say, let us check this answer
>> with a slightly different halt decider, one which won't actually halt
>> the computation, if the requirement of need to halt, was true, then this
>> altered halt decider shouldn't halt and go into an infinite loop. Note,
>> this test, like when we run H_Hat on any other halt decider, still used
>> the original tape, with the original definition of halts on the tape.
>>
>> This procedure actually makes some sense as this halts with the abort
>> disabled effectively becomes a real UTM so asking it is like running the
>> actual machine.
>>
>> When we do this, by definition, since we have been told that
>> Halts(H_Hat,H_Hat) has previously returned non-halting, the execution of
>> that top level H_Hat inside this defanged Halts/now UTM will get that
>> answer and it will halt and thus we see that H_Hat(H_Hat) is in fact a
>> finite computation when it is built on your original Halts machine.
>>
>
> No you are flat out incorrect about this. When we remove the halt
> detector from Halts the top level H_Hat really is infinitely recursive.
>
Maybe I should make a web page with this proof just so I can keep
refering to it.
Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
Haltx sets up the simulation of H_Hat(H_Hat)
Haltx starts the simulation of H_Hat(H_Hat)
H_Hat(H_Hat) calls the original Halts(H_Hat, H_Hat)
we have been told, that this orignal version of Halts will report
non-halting for this input, so it does
H_Hat sees the non-halting decision so it Halts
Haltx see the Halt, so it returns Halting.
Halts is proven wrong.
Note, the test is change JUST the top level halts and NOT change the
code on the tape which include the original code for halts, or we are
asking a different question.
If this is not what happens, you haven't setup the machines right.
H_Hat is a complete independent copy of its whole computation.
> Halting problem undecidability and infinite recursion
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
> If your weren't utterly clueless about the x86 language you would see
> that the relationship between Halts() and H_Hat() <is> infinite recursion.
>
>
> Here it is at the C level:
>
>
> u32 Simulate(u32 P, u32 I)
> {
> u32 Halted = 0
> while (!Halted)
> Halted = DebugStep(P, I);
> return 1;
> }
>
>
> void H_Hat(u32 P)
> {
> u32 Input_Would_Halt = Simulate(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 14:35 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <mo6dndXeg4wLCOX9nZ2dnUU7-cXNnZ2d@giganews.com> |
| In reply to | #31070 |
On 4/15/2021 1:32 PM, Richard Damon wrote: > On 4/15/21 11:58 AM, olcott wrote: >> On 4/15/2021 10:25 AM, Richard Damon wrote: > >>> Changing Halts everywhere to be a UTM says we are checking the wrong >>> computation. A fundamental, kindergarten level of logic is that to say >>> somehting about a statement, you need to keep to the definitions of that >>> statement. >>> >>> We start out with a DEFINED H (aka Halts) and from that we define a H^ >>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED >>> defintions we are trying to make a proof on, and can not 'edit' them. >>> >>> Note, that this definition includes ALL the steps that a machine will >>> need to run the operation. It does not include ANY 'external' calls to >>> system that might be changeable (like a Halts function in the system). >>> THIS IS HOW TURING MACHINES WORK. >>> >>> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) and >>> when it makes that decision, the H_Hat will always call that original >>> Halts function that was fixed into the code. THAT IS HOW TURING MACHINES >>> WORK. >>> >>> Thus we can ask that original Halts about what its decision would be on >>> H_Hat, and get an answer, which you say will be non-halting. We then >>> decide we want to chack that answer, so we say, let us check this answer >>> with a slightly different halt decider, one which won't actually halt >>> the computation, if the requirement of need to halt, was true, then this >>> altered halt decider shouldn't halt and go into an infinite loop. Note, >>> this test, like when we run H_Hat on any other halt decider, still used >>> the original tape, with the original definition of halts on the tape. >>> >>> This procedure actually makes some sense as this halts with the abort >>> disabled effectively becomes a real UTM so asking it is like running the >>> actual machine. >>> >>> When we do this, by definition, since we have been told that >>> Halts(H_Hat,H_Hat) has previously returned non-halting, the execution of >>> that top level H_Hat inside this defanged Halts/now UTM will get that >>> answer and it will halt and thus we see that H_Hat(H_Hat) is in fact a >>> finite computation when it is built on your original Halts machine. >>> >> >> No you are flat out incorrect about this. When we remove the halt >> detector from Halts the top level H_Hat really is infinitely recursive. >> > > Maybe I should make a web page with this proof just so I can keep > refering to it. > > Main calls the the modified Halt named HaltX(H_Hat, H_Hat) The only modification is that the single line of code in Halts() that tests for non halting compuations is commented out. -- 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-15 16:07 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <J11eI.3991$v3H9.3879@fx01.iad> |
| In reply to | #31074 |
On 4/15/21 3:35 PM, olcott wrote: > On 4/15/2021 1:32 PM, Richard Damon wrote: >> On 4/15/21 11:58 AM, olcott wrote: >>> On 4/15/2021 10:25 AM, Richard Damon wrote: >> >>>> Changing Halts everywhere to be a UTM says we are checking the wrong >>>> computation. A fundamental, kindergarten level of logic is that to say >>>> somehting about a statement, you need to keep to the definitions of >>>> that >>>> statement. >>>> >>>> We start out with a DEFINED H (aka Halts) and from that we define a H^ >>>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED >>>> defintions we are trying to make a proof on, and can not 'edit' them. >>>> >>>> Note, that this definition includes ALL the steps that a machine will >>>> need to run the operation. It does not include ANY 'external' calls to >>>> system that might be changeable (like a Halts function in the system). >>>> THIS IS HOW TURING MACHINES WORK. >>>> >>>> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) and >>>> when it makes that decision, the H_Hat will always call that original >>>> Halts function that was fixed into the code. THAT IS HOW TURING >>>> MACHINES >>>> WORK. >>>> >>>> Thus we can ask that original Halts about what its decision would be on >>>> H_Hat, and get an answer, which you say will be non-halting. We then >>>> decide we want to chack that answer, so we say, let us check this >>>> answer >>>> with a slightly different halt decider, one which won't actually halt >>>> the computation, if the requirement of need to halt, was true, then >>>> this >>>> altered halt decider shouldn't halt and go into an infinite loop. Note, >>>> this test, like when we run H_Hat on any other halt decider, still used >>>> the original tape, with the original definition of halts on the tape. >>>> >>>> This procedure actually makes some sense as this halts with the abort >>>> disabled effectively becomes a real UTM so asking it is like running >>>> the >>>> actual machine. >>>> >>>> When we do this, by definition, since we have been told that >>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the >>>> execution of >>>> that top level H_Hat inside this defanged Halts/now UTM will get that >>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in fact a >>>> finite computation when it is built on your original Halts machine. >>>> >>> >>> No you are flat out incorrect about this. When we remove the halt >>> detector from Halts the top level H_Hat really is infinitely recursive. >>> >> >> Maybe I should make a web page with this proof just so I can keep >> refering to it. >> >> Main calls the the modified Halt named HaltX(H_Hat, H_Hat) > > The only modification is that the single line of code in Halts() that > tests for non halting compuations is commented out. > > NO Modification is allowed to the code on the input tape. READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as the test for halts without the halting in it to see if it really needed to halt. THIS modified function is called to decide on H_Hat(H_Hat) and it shows that H_Hat(H_Hat) with your original halts IS a halting computation. YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. If you system can't do this, then you system is defective.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 15:27 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <sZGdnTBe37YIPOX9nZ2dnUU7-VfNnZ2d@giganews.com> |
| In reply to | #31078 |
On 4/15/2021 3:07 PM, Richard Damon wrote: > On 4/15/21 3:35 PM, olcott wrote: >> On 4/15/2021 1:32 PM, Richard Damon wrote: >>> On 4/15/21 11:58 AM, olcott wrote: >>>> On 4/15/2021 10:25 AM, Richard Damon wrote: >>> >>>>> Changing Halts everywhere to be a UTM says we are checking the wrong >>>>> computation. A fundamental, kindergarten level of logic is that to say >>>>> somehting about a statement, you need to keep to the definitions of >>>>> that >>>>> statement. >>>>> >>>>> We start out with a DEFINED H (aka Halts) and from that we define a H^ >>>>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED >>>>> defintions we are trying to make a proof on, and can not 'edit' them. >>>>> >>>>> Note, that this definition includes ALL the steps that a machine will >>>>> need to run the operation. It does not include ANY 'external' calls to >>>>> system that might be changeable (like a Halts function in the system). >>>>> THIS IS HOW TURING MACHINES WORK. >>>>> >>>>> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) and >>>>> when it makes that decision, the H_Hat will always call that original >>>>> Halts function that was fixed into the code. THAT IS HOW TURING >>>>> MACHINES >>>>> WORK. >>>>> >>>>> Thus we can ask that original Halts about what its decision would be on >>>>> H_Hat, and get an answer, which you say will be non-halting. We then >>>>> decide we want to chack that answer, so we say, let us check this >>>>> answer >>>>> with a slightly different halt decider, one which won't actually halt >>>>> the computation, if the requirement of need to halt, was true, then >>>>> this >>>>> altered halt decider shouldn't halt and go into an infinite loop. Note, >>>>> this test, like when we run H_Hat on any other halt decider, still used >>>>> the original tape, with the original definition of halts on the tape. >>>>> >>>>> This procedure actually makes some sense as this halts with the abort >>>>> disabled effectively becomes a real UTM so asking it is like running >>>>> the >>>>> actual machine. >>>>> >>>>> When we do this, by definition, since we have been told that >>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the >>>>> execution of >>>>> that top level H_Hat inside this defanged Halts/now UTM will get that >>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in fact a >>>>> finite computation when it is built on your original Halts machine. >>>>> >>>> >>>> No you are flat out incorrect about this. When we remove the halt >>>> detector from Halts the top level H_Hat really is infinitely recursive. >>>> >>> >>> Maybe I should make a web page with this proof just so I can keep >>> refering to it. >>> >>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat) >> >> The only modification is that the single line of code in Halts() that >> tests for non halting compuations is commented out. >> >> > > NO Modification is allowed to the code on the input tape. > > READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as > the test for halts without the halting in it to see if it really needed > to halt. > > THIS modified function is called to decide on H_Hat(H_Hat) and it shows > that H_Hat(H_Hat) with your original halts IS a halting computation. > > YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. > > If you system can't do this, then you system is defective. > To see if Halts decided H_Hat correctly we disable the the halt testing ability of Halts and see what H_Hat does. Any other way is the God damned lie of a God damned liar. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 16:03 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <-62dnYOeXOSoN-X9nZ2dnUU7-aHNnZ2d@giganews.com> |
| In reply to | #31080 |
On 4/15/2021 3:27 PM, olcott wrote: > On 4/15/2021 3:07 PM, Richard Damon wrote: >> On 4/15/21 3:35 PM, olcott wrote: >>> On 4/15/2021 1:32 PM, Richard Damon wrote: >>>> On 4/15/21 11:58 AM, olcott wrote: >>>>> On 4/15/2021 10:25 AM, Richard Damon wrote: >>>> >>>>>> Changing Halts everywhere to be a UTM says we are checking the wrong >>>>>> computation. A fundamental, kindergarten level of logic is that to >>>>>> say >>>>>> somehting about a statement, you need to keep to the definitions of >>>>>> that >>>>>> statement. >>>>>> >>>>>> We start out with a DEFINED H (aka Halts) and from that we define >>>>>> a H^ >>>>>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED >>>>>> defintions we are trying to make a proof on, and can not 'edit' them. >>>>>> >>>>>> Note, that this definition includes ALL the steps that a machine will >>>>>> need to run the operation. It does not include ANY 'external' >>>>>> calls to >>>>>> system that might be changeable (like a Halts function in the >>>>>> system). >>>>>> THIS IS HOW TURING MACHINES WORK. >>>>>> >>>>>> Thus we can ask ANY halt decider what it thinks about H_Hat(H_Hat) >>>>>> and >>>>>> when it makes that decision, the H_Hat will always call that original >>>>>> Halts function that was fixed into the code. THAT IS HOW TURING >>>>>> MACHINES >>>>>> WORK. >>>>>> >>>>>> Thus we can ask that original Halts about what its decision would >>>>>> be on >>>>>> H_Hat, and get an answer, which you say will be non-halting. We then >>>>>> decide we want to chack that answer, so we say, let us check this >>>>>> answer >>>>>> with a slightly different halt decider, one which won't actually halt >>>>>> the computation, if the requirement of need to halt, was true, then >>>>>> this >>>>>> altered halt decider shouldn't halt and go into an infinite loop. >>>>>> Note, >>>>>> this test, like when we run H_Hat on any other halt decider, still >>>>>> used >>>>>> the original tape, with the original definition of halts on the tape. >>>>>> >>>>>> This procedure actually makes some sense as this halts with the abort >>>>>> disabled effectively becomes a real UTM so asking it is like running >>>>>> the >>>>>> actual machine. >>>>>> >>>>>> When we do this, by definition, since we have been told that >>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the >>>>>> execution of >>>>>> that top level H_Hat inside this defanged Halts/now UTM will get that >>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in >>>>>> fact a >>>>>> finite computation when it is built on your original Halts machine. >>>>>> >>>>> >>>>> No you are flat out incorrect about this. When we remove the halt >>>>> detector from Halts the top level H_Hat really is infinitely >>>>> recursive. >>>>> >>>> >>>> Maybe I should make a web page with this proof just so I can keep >>>> refering to it. >>>> >>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat) >>> >>> The only modification is that the single line of code in Halts() that >>> tests for non halting compuations is commented out. >>> >>> >> >> NO Modification is allowed to the code on the input tape. >> >> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as >> the test for halts without the halting in it to see if it really needed >> to halt. >> >> THIS modified function is called to decide on H_Hat(H_Hat) and it shows >> that H_Hat(H_Hat) with your original halts IS a halting computation. >> >> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. >> >> If you system can't do this, then you system is defective. >> > > To see if Halts decided H_Hat correctly we disable the the halt testing > ability of Halts and see what H_Hat does. Any other way is the God > damned lie of a God damned liar. > Renaming the function with a different names is a very terrible idea from a software engineering perspective because it requires that this name be changed everywhere that it is referenced. The reason that you keep bringing this up is that you want to dishonestly and deceptively change Halts in one place and not change it in another. By changing the actual body of Halts you can't get away with these dirty tricks. When we reconfigure Halts so that it no longer decides halting then the pure execution of H_Hat calls Halts simulates H_Hat which calls Halts on and on forever... -- 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-15 17:43 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <ws2eI.3194$OF5.595@fx07.iad> |
| In reply to | #31083 |
On 4/15/21 5:03 PM, olcott wrote: > On 4/15/2021 3:27 PM, olcott wrote: >> On 4/15/2021 3:07 PM, Richard Damon wrote: >>> On 4/15/21 3:35 PM, olcott wrote: >>>> On 4/15/2021 1:32 PM, Richard Damon wrote: >>>>> On 4/15/21 11:58 AM, olcott wrote: >>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote: >>>>> >>>>>>> Changing Halts everywhere to be a UTM says we are checking the wrong >>>>>>> computation. A fundamental, kindergarten level of logic is that >>>>>>> to say >>>>>>> somehting about a statement, you need to keep to the definitions of >>>>>>> that >>>>>>> statement. >>>>>>> >>>>>>> We start out with a DEFINED H (aka Halts) and from that we define >>>>>>> a H^ >>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED >>>>>>> defintions we are trying to make a proof on, and can not 'edit' >>>>>>> them. >>>>>>> >>>>>>> Note, that this definition includes ALL the steps that a machine >>>>>>> will >>>>>>> need to run the operation. It does not include ANY 'external' >>>>>>> calls to >>>>>>> system that might be changeable (like a Halts function in the >>>>>>> system). >>>>>>> THIS IS HOW TURING MACHINES WORK. >>>>>>> >>>>>>> Thus we can ask ANY halt decider what it thinks about >>>>>>> H_Hat(H_Hat) and >>>>>>> when it makes that decision, the H_Hat will always call that >>>>>>> original >>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING >>>>>>> MACHINES >>>>>>> WORK. >>>>>>> >>>>>>> Thus we can ask that original Halts about what its decision would >>>>>>> be on >>>>>>> H_Hat, and get an answer, which you say will be non-halting. We then >>>>>>> decide we want to chack that answer, so we say, let us check this >>>>>>> answer >>>>>>> with a slightly different halt decider, one which won't actually >>>>>>> halt >>>>>>> the computation, if the requirement of need to halt, was true, then >>>>>>> this >>>>>>> altered halt decider shouldn't halt and go into an infinite loop. >>>>>>> Note, >>>>>>> this test, like when we run H_Hat on any other halt decider, >>>>>>> still used >>>>>>> the original tape, with the original definition of halts on the >>>>>>> tape. >>>>>>> >>>>>>> This procedure actually makes some sense as this halts with the >>>>>>> abort >>>>>>> disabled effectively becomes a real UTM so asking it is like running >>>>>>> the >>>>>>> actual machine. >>>>>>> >>>>>>> When we do this, by definition, since we have been told that >>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the >>>>>>> execution of >>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get >>>>>>> that >>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in >>>>>>> fact a >>>>>>> finite computation when it is built on your original Halts machine. >>>>>>> >>>>>> >>>>>> No you are flat out incorrect about this. When we remove the halt >>>>>> detector from Halts the top level H_Hat really is infinitely >>>>>> recursive. >>>>>> >>>>> >>>>> Maybe I should make a web page with this proof just so I can keep >>>>> refering to it. >>>>> >>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat) >>>> >>>> The only modification is that the single line of code in Halts() that >>>> tests for non halting compuations is commented out. >>>> >>>> >>> >>> NO Modification is allowed to the code on the input tape. >>> >>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as >>> the test for halts without the halting in it to see if it really needed >>> to halt. >>> >>> THIS modified function is called to decide on H_Hat(H_Hat) and it shows >>> that H_Hat(H_Hat) with your original halts IS a halting computation. >>> >>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. >>> >>> If you system can't do this, then you system is defective. >>> >> >> To see if Halts decided H_Hat correctly we disable the the halt >> testing ability of Halts and see what H_Hat does. Any other way is the >> God damned lie of a God damned liar. >> > > Renaming the function with a different names is a very terrible idea > from a software engineering perspective because it requires that this > name be changed everywhere that it is referenced. Nope, we are renaming it because we need this one example to be different from what the rest of the code needs to use. CHANGE code that is used elsewhere which a thorough check is what violates fundamental principles. Just the other day, I found a small bug in a corner case in some of my code. This was impacting one of my coworkers code. I submitted a fix, but it didn't help because apparently someone else had copied my code block and their old version was shadowing my code. I sugggested that since this was just a bug fix that if their code didn't see the problems never hit that corner case so would be unaffected, by they decided that since that code had already gone though some very thorough testing, they wouldn't change it, but give one of them a new name. Changing a name so you DON'T change code that you don't want to change is a very good idea. > > The reason that you keep bringing this up is that you want to > dishonestly and deceptively change Halts in one place and not change it > in another. By changing the actual body of Halts you can't get away with > these dirty tricks. No, Halts was provided as part of the contract to H_Hat for what it was to show. You CAN'T change it without breaking your proof. When Halts gets called there are SUPPOSED to be three copies of it that are truely distinct. There is the copy of Halts that is being executed (this is the one that we want to adjust to make proofs on if it is doing its job correctly), there is the copy of Halts that is part of H_Hat in the program that is going to be tested, This needs to ALWAYS be the original halts that our problem statement says we are deciding on. And then there is the copy of that description being given to H_Hat as its input so it can continue its work. Note, this second copy doesn't NEED to be a copy of the first, as we are allowed to ask questions like does H_Hat(Foo) halt or not, for some other machine Foo. and the machine we ask doesn't have to match the one on the tape as the representation of H_Hat, as we are allowed to ask other Halt Deciders about H_Hat too. So all three copies are inherently able to be different. > > When we reconfigure Halts so that it no longer decides halting then the > pure execution of H_Hat calls Halts simulates H_Hat which calls Halts on > and on forever... >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 16:51 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <seadnQqLRfboKOX9nZ2dnUU7-RvNnZ2d@giganews.com> |
| In reply to | #31095 |
On 4/15/2021 4:43 PM, Richard Damon wrote:
> On 4/15/21 5:03 PM, olcott wrote:
>> On 4/15/2021 3:27 PM, olcott wrote:
>>> On 4/15/2021 3:07 PM, Richard Damon wrote:
>>>> On 4/15/21 3:35 PM, olcott wrote:
>>>>> On 4/15/2021 1:32 PM, Richard Damon wrote:
>>>>>> On 4/15/21 11:58 AM, olcott wrote:
>>>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote:
>>>>>>
>>>>>>>> Changing Halts everywhere to be a UTM says we are checking the wrong
>>>>>>>> computation. A fundamental, kindergarten level of logic is that
>>>>>>>> to say
>>>>>>>> somehting about a statement, you need to keep to the definitions of
>>>>>>>> that
>>>>>>>> statement.
>>>>>>>>
>>>>>>>> We start out with a DEFINED H (aka Halts) and from that we define
>>>>>>>> a H^
>>>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are FIXED
>>>>>>>> defintions we are trying to make a proof on, and can not 'edit'
>>>>>>>> them.
>>>>>>>>
>>>>>>>> Note, that this definition includes ALL the steps that a machine
>>>>>>>> will
>>>>>>>> need to run the operation. It does not include ANY 'external'
>>>>>>>> calls to
>>>>>>>> system that might be changeable (like a Halts function in the
>>>>>>>> system).
>>>>>>>> THIS IS HOW TURING MACHINES WORK.
>>>>>>>>
>>>>>>>> Thus we can ask ANY halt decider what it thinks about
>>>>>>>> H_Hat(H_Hat) and
>>>>>>>> when it makes that decision, the H_Hat will always call that
>>>>>>>> original
>>>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING
>>>>>>>> MACHINES
>>>>>>>> WORK.
>>>>>>>>
>>>>>>>> Thus we can ask that original Halts about what its decision would
>>>>>>>> be on
>>>>>>>> H_Hat, and get an answer, which you say will be non-halting. We then
>>>>>>>> decide we want to chack that answer, so we say, let us check this
>>>>>>>> answer
>>>>>>>> with a slightly different halt decider, one which won't actually
>>>>>>>> halt
>>>>>>>> the computation, if the requirement of need to halt, was true, then
>>>>>>>> this
>>>>>>>> altered halt decider shouldn't halt and go into an infinite loop.
>>>>>>>> Note,
>>>>>>>> this test, like when we run H_Hat on any other halt decider,
>>>>>>>> still used
>>>>>>>> the original tape, with the original definition of halts on the
>>>>>>>> tape.
>>>>>>>>
>>>>>>>> This procedure actually makes some sense as this halts with the
>>>>>>>> abort
>>>>>>>> disabled effectively becomes a real UTM so asking it is like running
>>>>>>>> the
>>>>>>>> actual machine.
>>>>>>>>
>>>>>>>> When we do this, by definition, since we have been told that
>>>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the
>>>>>>>> execution of
>>>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get
>>>>>>>> that
>>>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in
>>>>>>>> fact a
>>>>>>>> finite computation when it is built on your original Halts machine.
>>>>>>>>
>>>>>>>
>>>>>>> No you are flat out incorrect about this. When we remove the halt
>>>>>>> detector from Halts the top level H_Hat really is infinitely
>>>>>>> recursive.
>>>>>>>
>>>>>>
>>>>>> Maybe I should make a web page with this proof just so I can keep
>>>>>> refering to it.
>>>>>>
>>>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
>>>>>
>>>>> The only modification is that the single line of code in Halts() that
>>>>> tests for non halting compuations is commented out.
>>>>>
>>>>>
>>>>
>>>> NO Modification is allowed to the code on the input tape.
>>>>
>>>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as
>>>> the test for halts without the halting in it to see if it really needed
>>>> to halt.
>>>>
>>>> THIS modified function is called to decide on H_Hat(H_Hat) and it shows
>>>> that H_Hat(H_Hat) with your original halts IS a halting computation.
>>>>
>>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY.
>>>>
>>>> If you system can't do this, then you system is defective.
>>>>
>>>
>>> To see if Halts decided H_Hat correctly we disable the the halt
>>> testing ability of Halts and see what H_Hat does. Any other way is the
>>> God damned lie of a God damned liar.
>>>
>>
>> Renaming the function with a different names is a very terrible idea
>> from a software engineering perspective because it requires that this
>> name be changed everywhere that it is referenced.
>
> Nope, we are renaming it because we need this one example to be
> different from what the rest of the code needs to use.
>
> CHANGE code that is used elsewhere which a thorough check is what
> violates fundamental principles.
>
> Just the other day, I found a small bug in a corner case in some of my
> code. This was impacting one of my coworkers code. I submitted a fix,
> but it didn't help because apparently someone else had copied my code
> block and their old version was shadowing my code. I sugggested that
> since this was just a bug fix that if their code didn't see the problems
> never hit that corner case so would be unaffected, by they decided that
> since that code had already gone though some very thorough testing, they
> wouldn't change it, but give one of them a new name.
>
> Changing a name so you DON'T change code that you don't want to change
> is a very good idea.
>>
>> The reason that you keep bringing this up is that you want to
>> dishonestly and deceptively change Halts in one place and not change it
>> in another. By changing the actual body of Halts you can't get away with
>> these dirty tricks.
>
> No, Halts was provided as part of the contract to H_Hat for what it was
> to show. You CAN'T change it without breaking your proof. When Halts
> gets called there are SUPPOSED to be three copies of it that are truely
> distinct. There is the copy of Halts that is being executed (this is the
> one that we want to adjust to make proofs on if it is doing its job
> correctly), there is the copy of Halts that is part of H_Hat in the
> program that is going to be tested, This needs to ALWAYS be the original
> halts that our problem statement says we are deciding on. And then there
> is the copy of that description being given to H_Hat as its input so it
> can continue its work.
>
> Note, this second copy doesn't NEED to be a copy of the first, as we are
> allowed to ask questions like does H_Hat(Foo) halt or not, for some
> other machine Foo. and the machine we ask doesn't have to match the one
> on the tape as the representation of H_Hat, as we are allowed to ask
> other Halt Deciders about H_Hat too.
>
> So all three copies are inherently able to be different.
>>
>> When we reconfigure Halts so that it no longer decides halting then the
>> pure execution of H_Hat calls Halts simulates H_Hat which calls Halts on
>> and on forever...
>>
>
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
void H_Hat2(u32 P)
{
u32 Input_Would_Halt = Simulate(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
int main()
{
H_Hat((u32)H_Hat);
H_Hat2((u32)H_Hat2);
}
When we do it this way it is waaaaaaaayyyy over your head to understand
that Simulate is merely Halts with a single line-of-code commented out.
--
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-15 18:13 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <QT2eI.8157$b27.3125@fx03.iad> |
| In reply to | #31097 |
On 4/15/21 5:51 PM, olcott wrote:
> On 4/15/2021 4:43 PM, Richard Damon wrote:
>> On 4/15/21 5:03 PM, olcott wrote:
>>> On 4/15/2021 3:27 PM, olcott wrote:
>>>> On 4/15/2021 3:07 PM, Richard Damon wrote:
>>>>> On 4/15/21 3:35 PM, olcott wrote:
>>>>>> On 4/15/2021 1:32 PM, Richard Damon wrote:
>>>>>>> On 4/15/21 11:58 AM, olcott wrote:
>>>>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote:
>>>>>>>
>>>>>>>>> Changing Halts everywhere to be a UTM says we are checking the
>>>>>>>>> wrong
>>>>>>>>> computation. A fundamental, kindergarten level of logic is that
>>>>>>>>> to say
>>>>>>>>> somehting about a statement, you need to keep to the
>>>>>>>>> definitions of
>>>>>>>>> that
>>>>>>>>> statement.
>>>>>>>>>
>>>>>>>>> We start out with a DEFINED H (aka Halts) and from that we define
>>>>>>>>> a H^
>>>>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are
>>>>>>>>> FIXED
>>>>>>>>> defintions we are trying to make a proof on, and can not 'edit'
>>>>>>>>> them.
>>>>>>>>>
>>>>>>>>> Note, that this definition includes ALL the steps that a machine
>>>>>>>>> will
>>>>>>>>> need to run the operation. It does not include ANY 'external'
>>>>>>>>> calls to
>>>>>>>>> system that might be changeable (like a Halts function in the
>>>>>>>>> system).
>>>>>>>>> THIS IS HOW TURING MACHINES WORK.
>>>>>>>>>
>>>>>>>>> Thus we can ask ANY halt decider what it thinks about
>>>>>>>>> H_Hat(H_Hat) and
>>>>>>>>> when it makes that decision, the H_Hat will always call that
>>>>>>>>> original
>>>>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING
>>>>>>>>> MACHINES
>>>>>>>>> WORK.
>>>>>>>>>
>>>>>>>>> Thus we can ask that original Halts about what its decision would
>>>>>>>>> be on
>>>>>>>>> H_Hat, and get an answer, which you say will be non-halting. We
>>>>>>>>> then
>>>>>>>>> decide we want to chack that answer, so we say, let us check this
>>>>>>>>> answer
>>>>>>>>> with a slightly different halt decider, one which won't actually
>>>>>>>>> halt
>>>>>>>>> the computation, if the requirement of need to halt, was true,
>>>>>>>>> then
>>>>>>>>> this
>>>>>>>>> altered halt decider shouldn't halt and go into an infinite loop.
>>>>>>>>> Note,
>>>>>>>>> this test, like when we run H_Hat on any other halt decider,
>>>>>>>>> still used
>>>>>>>>> the original tape, with the original definition of halts on the
>>>>>>>>> tape.
>>>>>>>>>
>>>>>>>>> This procedure actually makes some sense as this halts with the
>>>>>>>>> abort
>>>>>>>>> disabled effectively becomes a real UTM so asking it is like
>>>>>>>>> running
>>>>>>>>> the
>>>>>>>>> actual machine.
>>>>>>>>>
>>>>>>>>> When we do this, by definition, since we have been told that
>>>>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the
>>>>>>>>> execution of
>>>>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get
>>>>>>>>> that
>>>>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in
>>>>>>>>> fact a
>>>>>>>>> finite computation when it is built on your original Halts
>>>>>>>>> machine.
>>>>>>>>>
>>>>>>>>
>>>>>>>> No you are flat out incorrect about this. When we remove the halt
>>>>>>>> detector from Halts the top level H_Hat really is infinitely
>>>>>>>> recursive.
>>>>>>>>
>>>>>>>
>>>>>>> Maybe I should make a web page with this proof just so I can keep
>>>>>>> refering to it.
>>>>>>>
>>>>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
>>>>>>
>>>>>> The only modification is that the single line of code in Halts() that
>>>>>> tests for non halting compuations is commented out.
>>>>>>
>>>>>>
>>>>>
>>>>> NO Modification is allowed to the code on the input tape.
>>>>>
>>>>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as
>>>>> the test for halts without the halting in it to see if it really
>>>>> needed
>>>>> to halt.
>>>>>
>>>>> THIS modified function is called to decide on H_Hat(H_Hat) and it
>>>>> shows
>>>>> that H_Hat(H_Hat) with your original halts IS a halting computation.
>>>>>
>>>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY.
>>>>>
>>>>> If you system can't do this, then you system is defective.
>>>>>
>>>>
>>>> To see if Halts decided H_Hat correctly we disable the the halt
>>>> testing ability of Halts and see what H_Hat does. Any other way is the
>>>> God damned lie of a God damned liar.
>>>>
>>>
>>> Renaming the function with a different names is a very terrible idea
>>> from a software engineering perspective because it requires that this
>>> name be changed everywhere that it is referenced.
>>
>> Nope, we are renaming it because we need this one example to be
>> different from what the rest of the code needs to use.
>>
>> CHANGE code that is used elsewhere which a thorough check is what
>> violates fundamental principles.
>>
>> Just the other day, I found a small bug in a corner case in some of my
>> code. This was impacting one of my coworkers code. I submitted a fix,
>> but it didn't help because apparently someone else had copied my code
>> block and their old version was shadowing my code. I sugggested that
>> since this was just a bug fix that if their code didn't see the problems
>> never hit that corner case so would be unaffected, by they decided that
>> since that code had already gone though some very thorough testing, they
>> wouldn't change it, but give one of them a new name.
>>
>> Changing a name so you DON'T change code that you don't want to change
>> is a very good idea.
>>>
>>> The reason that you keep bringing this up is that you want to
>>> dishonestly and deceptively change Halts in one place and not change it
>>> in another. By changing the actual body of Halts you can't get away with
>>> these dirty tricks.
>>
>> No, Halts was provided as part of the contract to H_Hat for what it was
>> to show. You CAN'T change it without breaking your proof. When Halts
>> gets called there are SUPPOSED to be three copies of it that are truely
>> distinct. There is the copy of Halts that is being executed (this is the
>> one that we want to adjust to make proofs on if it is doing its job
>> correctly), there is the copy of Halts that is part of H_Hat in the
>> program that is going to be tested, This needs to ALWAYS be the original
>> halts that our problem statement says we are deciding on. And then there
>> is the copy of that description being given to H_Hat as its input so it
>> can continue its work.
>>
>> Note, this second copy doesn't NEED to be a copy of the first, as we are
>> allowed to ask questions like does H_Hat(Foo) halt or not, for some
>> other machine Foo. and the machine we ask doesn't have to match the one
>> on the tape as the representation of H_Hat, as we are allowed to ask
>> other Halt Deciders about H_Hat too.
>>
>> So all three copies are inherently able to be different.
>>>
>>> When we reconfigure Halts so that it no longer decides halting then the
>>> pure execution of H_Hat calls Halts simulates H_Hat which calls Halts on
>>> and on forever...
>>>
>>
>
>
> void H_Hat(u32 P)
> {
> u32 Input_Would_Halt = Halts(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
> void H_Hat2(u32 P)
> {
> u32 Input_Would_Halt = Simulate(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
> int main()
> {
> H_Hat((u32)H_Hat);
> H_Hat2((u32)H_Hat2);
> }
>
> When we do it this way it is waaaaaaaayyyy over your head to understand
> that Simulate is merely Halts with a single line-of-code commented out.
>
There is NO need for H_Hat2, as that is not a question in view.
The question is that
Halts(H_Hat, H_Hat)
says H_Hat will not halt, but if in that same program with the same
definition of Halts we run
Simulate(H_Hat, H_Hat)
This will finish and halt. (Assuming Halts works as a pure computation
and always returns the same answer.
This means Halts in
Main -> Halts(H_Hat, H_Hat)
will give the same anwer as Halts in
Main -> Simulate -> H_Hat -> Halts(H_Hat, H_Hat)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 17:18 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <f9adnYZIZPU4JuX9nZ2dnUU7-TnNnZ2d@giganews.com> |
| In reply to | #31102 |
On 4/15/2021 5:13 PM, Richard Damon wrote:
> On 4/15/21 5:51 PM, olcott wrote:
>> On 4/15/2021 4:43 PM, Richard Damon wrote:
>>> On 4/15/21 5:03 PM, olcott wrote:
>>>> On 4/15/2021 3:27 PM, olcott wrote:
>>>>> On 4/15/2021 3:07 PM, Richard Damon wrote:
>>>>>> On 4/15/21 3:35 PM, olcott wrote:
>>>>>>> On 4/15/2021 1:32 PM, Richard Damon wrote:
>>>>>>>> On 4/15/21 11:58 AM, olcott wrote:
>>>>>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote:
>>>>>>>>
>>>>>>>>>> Changing Halts everywhere to be a UTM says we are checking the
>>>>>>>>>> wrong
>>>>>>>>>> computation. A fundamental, kindergarten level of logic is that
>>>>>>>>>> to say
>>>>>>>>>> somehting about a statement, you need to keep to the
>>>>>>>>>> definitions of
>>>>>>>>>> that
>>>>>>>>>> statement.
>>>>>>>>>>
>>>>>>>>>> We start out with a DEFINED H (aka Halts) and from that we define
>>>>>>>>>> a H^
>>>>>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are
>>>>>>>>>> FIXED
>>>>>>>>>> defintions we are trying to make a proof on, and can not 'edit'
>>>>>>>>>> them.
>>>>>>>>>>
>>>>>>>>>> Note, that this definition includes ALL the steps that a machine
>>>>>>>>>> will
>>>>>>>>>> need to run the operation. It does not include ANY 'external'
>>>>>>>>>> calls to
>>>>>>>>>> system that might be changeable (like a Halts function in the
>>>>>>>>>> system).
>>>>>>>>>> THIS IS HOW TURING MACHINES WORK.
>>>>>>>>>>
>>>>>>>>>> Thus we can ask ANY halt decider what it thinks about
>>>>>>>>>> H_Hat(H_Hat) and
>>>>>>>>>> when it makes that decision, the H_Hat will always call that
>>>>>>>>>> original
>>>>>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING
>>>>>>>>>> MACHINES
>>>>>>>>>> WORK.
>>>>>>>>>>
>>>>>>>>>> Thus we can ask that original Halts about what its decision would
>>>>>>>>>> be on
>>>>>>>>>> H_Hat, and get an answer, which you say will be non-halting. We
>>>>>>>>>> then
>>>>>>>>>> decide we want to chack that answer, so we say, let us check this
>>>>>>>>>> answer
>>>>>>>>>> with a slightly different halt decider, one which won't actually
>>>>>>>>>> halt
>>>>>>>>>> the computation, if the requirement of need to halt, was true,
>>>>>>>>>> then
>>>>>>>>>> this
>>>>>>>>>> altered halt decider shouldn't halt and go into an infinite loop.
>>>>>>>>>> Note,
>>>>>>>>>> this test, like when we run H_Hat on any other halt decider,
>>>>>>>>>> still used
>>>>>>>>>> the original tape, with the original definition of halts on the
>>>>>>>>>> tape.
>>>>>>>>>>
>>>>>>>>>> This procedure actually makes some sense as this halts with the
>>>>>>>>>> abort
>>>>>>>>>> disabled effectively becomes a real UTM so asking it is like
>>>>>>>>>> running
>>>>>>>>>> the
>>>>>>>>>> actual machine.
>>>>>>>>>>
>>>>>>>>>> When we do this, by definition, since we have been told that
>>>>>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the
>>>>>>>>>> execution of
>>>>>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get
>>>>>>>>>> that
>>>>>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in
>>>>>>>>>> fact a
>>>>>>>>>> finite computation when it is built on your original Halts
>>>>>>>>>> machine.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> No you are flat out incorrect about this. When we remove the halt
>>>>>>>>> detector from Halts the top level H_Hat really is infinitely
>>>>>>>>> recursive.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Maybe I should make a web page with this proof just so I can keep
>>>>>>>> refering to it.
>>>>>>>>
>>>>>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
>>>>>>>
>>>>>>> The only modification is that the single line of code in Halts() that
>>>>>>> tests for non halting compuations is commented out.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> NO Modification is allowed to the code on the input tape.
>>>>>>
>>>>>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as
>>>>>> the test for halts without the halting in it to see if it really
>>>>>> needed
>>>>>> to halt.
>>>>>>
>>>>>> THIS modified function is called to decide on H_Hat(H_Hat) and it
>>>>>> shows
>>>>>> that H_Hat(H_Hat) with your original halts IS a halting computation.
>>>>>>
>>>>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY.
>>>>>>
>>>>>> If you system can't do this, then you system is defective.
>>>>>>
>>>>>
>>>>> To see if Halts decided H_Hat correctly we disable the the halt
>>>>> testing ability of Halts and see what H_Hat does. Any other way is the
>>>>> God damned lie of a God damned liar.
>>>>>
>>>>
>>>> Renaming the function with a different names is a very terrible idea
>>>> from a software engineering perspective because it requires that this
>>>> name be changed everywhere that it is referenced.
>>>
>>> Nope, we are renaming it because we need this one example to be
>>> different from what the rest of the code needs to use.
>>>
>>> CHANGE code that is used elsewhere which a thorough check is what
>>> violates fundamental principles.
>>>
>>> Just the other day, I found a small bug in a corner case in some of my
>>> code. This was impacting one of my coworkers code. I submitted a fix,
>>> but it didn't help because apparently someone else had copied my code
>>> block and their old version was shadowing my code. I sugggested that
>>> since this was just a bug fix that if their code didn't see the problems
>>> never hit that corner case so would be unaffected, by they decided that
>>> since that code had already gone though some very thorough testing, they
>>> wouldn't change it, but give one of them a new name.
>>>
>>> Changing a name so you DON'T change code that you don't want to change
>>> is a very good idea.
>>>>
>>>> The reason that you keep bringing this up is that you want to
>>>> dishonestly and deceptively change Halts in one place and not change it
>>>> in another. By changing the actual body of Halts you can't get away with
>>>> these dirty tricks.
>>>
>>> No, Halts was provided as part of the contract to H_Hat for what it was
>>> to show. You CAN'T change it without breaking your proof. When Halts
>>> gets called there are SUPPOSED to be three copies of it that are truely
>>> distinct. There is the copy of Halts that is being executed (this is the
>>> one that we want to adjust to make proofs on if it is doing its job
>>> correctly), there is the copy of Halts that is part of H_Hat in the
>>> program that is going to be tested, This needs to ALWAYS be the original
>>> halts that our problem statement says we are deciding on. And then there
>>> is the copy of that description being given to H_Hat as its input so it
>>> can continue its work.
>>>
>>> Note, this second copy doesn't NEED to be a copy of the first, as we are
>>> allowed to ask questions like does H_Hat(Foo) halt or not, for some
>>> other machine Foo. and the machine we ask doesn't have to match the one
>>> on the tape as the representation of H_Hat, as we are allowed to ask
>>> other Halt Deciders about H_Hat too.
>>>
>>> So all three copies are inherently able to be different.
>>>>
>>>> When we reconfigure Halts so that it no longer decides halting then the
>>>> pure execution of H_Hat calls Halts simulates H_Hat which calls Halts on
>>>> and on forever...
>>>>
>>>
>>
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Would_Halt = Halts(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>> void H_Hat2(u32 P)
>> {
>> u32 Input_Would_Halt = Simulate(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> H_Hat2((u32)H_Hat2);
>> }
>>
>> When we do it this way it is waaaaaaaayyyy over your head to understand
>> that Simulate is merely Halts with a single line-of-code commented out.
>>
>
> There is NO need for H_Hat2, as that is not a question in view.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
LIAR LIAR PANTS ON FIRE.
If H_Hat() stops running and H_Hat2() does not stop running THAT PROVES
THAT Halts() DECIDED H_hat() correctly.
--
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-15 18:43 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <7k3eI.1054$mO3.384@fx09.iad> |
| In reply to | #31104 |
On 4/15/21 6:18 PM, olcott wrote:
> On 4/15/2021 5:13 PM, Richard Damon wrote:
>> On 4/15/21 5:51 PM, olcott wrote:
>>> On 4/15/2021 4:43 PM, Richard Damon wrote:
>>>> On 4/15/21 5:03 PM, olcott wrote:
>>>>> On 4/15/2021 3:27 PM, olcott wrote:
>>>>>> On 4/15/2021 3:07 PM, Richard Damon wrote:
>>>>>>> On 4/15/21 3:35 PM, olcott wrote:
>>>>>>>> On 4/15/2021 1:32 PM, Richard Damon wrote:
>>>>>>>>> On 4/15/21 11:58 AM, olcott wrote:
>>>>>>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote:
>>>>>>>>>
>>>>>>>>>>> Changing Halts everywhere to be a UTM says we are checking the
>>>>>>>>>>> wrong
>>>>>>>>>>> computation. A fundamental, kindergarten level of logic is that
>>>>>>>>>>> to say
>>>>>>>>>>> somehting about a statement, you need to keep to the
>>>>>>>>>>> definitions of
>>>>>>>>>>> that
>>>>>>>>>>> statement.
>>>>>>>>>>>
>>>>>>>>>>> We start out with a DEFINED H (aka Halts) and from that we
>>>>>>>>>>> define
>>>>>>>>>>> a H^
>>>>>>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are
>>>>>>>>>>> FIXED
>>>>>>>>>>> defintions we are trying to make a proof on, and can not 'edit'
>>>>>>>>>>> them.
>>>>>>>>>>>
>>>>>>>>>>> Note, that this definition includes ALL the steps that a machine
>>>>>>>>>>> will
>>>>>>>>>>> need to run the operation. It does not include ANY 'external'
>>>>>>>>>>> calls to
>>>>>>>>>>> system that might be changeable (like a Halts function in the
>>>>>>>>>>> system).
>>>>>>>>>>> THIS IS HOW TURING MACHINES WORK.
>>>>>>>>>>>
>>>>>>>>>>> Thus we can ask ANY halt decider what it thinks about
>>>>>>>>>>> H_Hat(H_Hat) and
>>>>>>>>>>> when it makes that decision, the H_Hat will always call that
>>>>>>>>>>> original
>>>>>>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING
>>>>>>>>>>> MACHINES
>>>>>>>>>>> WORK.
>>>>>>>>>>>
>>>>>>>>>>> Thus we can ask that original Halts about what its decision
>>>>>>>>>>> would
>>>>>>>>>>> be on
>>>>>>>>>>> H_Hat, and get an answer, which you say will be non-halting. We
>>>>>>>>>>> then
>>>>>>>>>>> decide we want to chack that answer, so we say, let us check
>>>>>>>>>>> this
>>>>>>>>>>> answer
>>>>>>>>>>> with a slightly different halt decider, one which won't actually
>>>>>>>>>>> halt
>>>>>>>>>>> the computation, if the requirement of need to halt, was true,
>>>>>>>>>>> then
>>>>>>>>>>> this
>>>>>>>>>>> altered halt decider shouldn't halt and go into an infinite
>>>>>>>>>>> loop.
>>>>>>>>>>> Note,
>>>>>>>>>>> this test, like when we run H_Hat on any other halt decider,
>>>>>>>>>>> still used
>>>>>>>>>>> the original tape, with the original definition of halts on the
>>>>>>>>>>> tape.
>>>>>>>>>>>
>>>>>>>>>>> This procedure actually makes some sense as this halts with the
>>>>>>>>>>> abort
>>>>>>>>>>> disabled effectively becomes a real UTM so asking it is like
>>>>>>>>>>> running
>>>>>>>>>>> the
>>>>>>>>>>> actual machine.
>>>>>>>>>>>
>>>>>>>>>>> When we do this, by definition, since we have been told that
>>>>>>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the
>>>>>>>>>>> execution of
>>>>>>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get
>>>>>>>>>>> that
>>>>>>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in
>>>>>>>>>>> fact a
>>>>>>>>>>> finite computation when it is built on your original Halts
>>>>>>>>>>> machine.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> No you are flat out incorrect about this. When we remove the halt
>>>>>>>>>> detector from Halts the top level H_Hat really is infinitely
>>>>>>>>>> recursive.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Maybe I should make a web page with this proof just so I can keep
>>>>>>>>> refering to it.
>>>>>>>>>
>>>>>>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
>>>>>>>>
>>>>>>>> The only modification is that the single line of code in Halts()
>>>>>>>> that
>>>>>>>> tests for non halting compuations is commented out.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> NO Modification is allowed to the code on the input tape.
>>>>>>>
>>>>>>> READ MY WORDS. Halts was unchanged. I created a NEW function
>>>>>>> Haltx as
>>>>>>> the test for halts without the halting in it to see if it really
>>>>>>> needed
>>>>>>> to halt.
>>>>>>>
>>>>>>> THIS modified function is called to decide on H_Hat(H_Hat) and it
>>>>>>> shows
>>>>>>> that H_Hat(H_Hat) with your original halts IS a halting computation.
>>>>>>>
>>>>>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY.
>>>>>>>
>>>>>>> If you system can't do this, then you system is defective.
>>>>>>>
>>>>>>
>>>>>> To see if Halts decided H_Hat correctly we disable the the halt
>>>>>> testing ability of Halts and see what H_Hat does. Any other way is
>>>>>> the
>>>>>> God damned lie of a God damned liar.
>>>>>>
>>>>>
>>>>> Renaming the function with a different names is a very terrible idea
>>>>> from a software engineering perspective because it requires that this
>>>>> name be changed everywhere that it is referenced.
>>>>
>>>> Nope, we are renaming it because we need this one example to be
>>>> different from what the rest of the code needs to use.
>>>>
>>>> CHANGE code that is used elsewhere which a thorough check is what
>>>> violates fundamental principles.
>>>>
>>>> Just the other day, I found a small bug in a corner case in some of my
>>>> code. This was impacting one of my coworkers code. I submitted a fix,
>>>> but it didn't help because apparently someone else had copied my code
>>>> block and their old version was shadowing my code. I sugggested that
>>>> since this was just a bug fix that if their code didn't see the
>>>> problems
>>>> never hit that corner case so would be unaffected, by they decided that
>>>> since that code had already gone though some very thorough testing,
>>>> they
>>>> wouldn't change it, but give one of them a new name.
>>>>
>>>> Changing a name so you DON'T change code that you don't want to change
>>>> is a very good idea.
>>>>>
>>>>> The reason that you keep bringing this up is that you want to
>>>>> dishonestly and deceptively change Halts in one place and not
>>>>> change it
>>>>> in another. By changing the actual body of Halts you can't get away
>>>>> with
>>>>> these dirty tricks.
>>>>
>>>> No, Halts was provided as part of the contract to H_Hat for what it was
>>>> to show. You CAN'T change it without breaking your proof. When Halts
>>>> gets called there are SUPPOSED to be three copies of it that are truely
>>>> distinct. There is the copy of Halts that is being executed (this is
>>>> the
>>>> one that we want to adjust to make proofs on if it is doing its job
>>>> correctly), there is the copy of Halts that is part of H_Hat in the
>>>> program that is going to be tested, This needs to ALWAYS be the
>>>> original
>>>> halts that our problem statement says we are deciding on. And then
>>>> there
>>>> is the copy of that description being given to H_Hat as its input so it
>>>> can continue its work.
>>>>
>>>> Note, this second copy doesn't NEED to be a copy of the first, as we
>>>> are
>>>> allowed to ask questions like does H_Hat(Foo) halt or not, for some
>>>> other machine Foo. and the machine we ask doesn't have to match the one
>>>> on the tape as the representation of H_Hat, as we are allowed to ask
>>>> other Halt Deciders about H_Hat too.
>>>>
>>>> So all three copies are inherently able to be different.
>>>>>
>>>>> When we reconfigure Halts so that it no longer decides halting then
>>>>> the
>>>>> pure execution of H_Hat calls Halts simulates H_Hat which calls
>>>>> Halts on
>>>>> and on forever...
>>>>>
>>>>
>>>
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>> void H_Hat2(u32 P)
>>> {
>>> u32 Input_Would_Halt = Simulate(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> H_Hat((u32)H_Hat);
>>> H_Hat2((u32)H_Hat2);
>>> }
>>>
>>> When we do it this way it is waaaaaaaayyyy over your head to understand
>>> that Simulate is merely Halts with a single line-of-code commented out.
>>>
>>
>> There is NO need for H_Hat2, as that is not a question in view.
>
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
> LIAR LIAR PANTS ON FIRE.
>
> If H_Hat() stops running and H_Hat2() does not stop running THAT PROVES
> THAT Halts() DECIDED H_hat() correctly.
>
>
I ask yoo if a corvet is a good car, you tell me Fiats are awful. It
doesn't mean anything.
We are asking about H_Hat, a machine built on a defined Halts.
The question that Halts is supposed to be answering when given the
question Halts(H_Hat, H_Hat) is when we run H_Hat(H_Hat) will it halt or
run forever.
If when we run H_Hat(H_Hat) it comes to a halt because Halts predicted
that it needed to halt it or it would run forever, then the fact that
H_Hat DID HALT, is the key fact.
There are no would have or if nots in the actual Turing Halting Problem
question, only what does the machine do.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 18:51 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <DeedncKhXd_6TOX9nZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #31108 |
On 4/15/2021 5:43 PM, Richard Damon wrote:
> On 4/15/21 6:18 PM, olcott wrote:
>> On 4/15/2021 5:13 PM, Richard Damon wrote:
>>> On 4/15/21 5:51 PM, olcott wrote:
>>>> On 4/15/2021 4:43 PM, Richard Damon wrote:
>>>>> On 4/15/21 5:03 PM, olcott wrote:
>>>>>> On 4/15/2021 3:27 PM, olcott wrote:
>>>>>>> On 4/15/2021 3:07 PM, Richard Damon wrote:
>>>>>>>> On 4/15/21 3:35 PM, olcott wrote:
>>>>>>>>> On 4/15/2021 1:32 PM, Richard Damon wrote:
>>>>>>>>>> On 4/15/21 11:58 AM, olcott wrote:
>>>>>>>>>>> On 4/15/2021 10:25 AM, Richard Damon wrote:
>>>>>>>>>>
>>>>>>>>>>>> Changing Halts everywhere to be a UTM says we are checking the
>>>>>>>>>>>> wrong
>>>>>>>>>>>> computation. A fundamental, kindergarten level of logic is that
>>>>>>>>>>>> to say
>>>>>>>>>>>> somehting about a statement, you need to keep to the
>>>>>>>>>>>> definitions of
>>>>>>>>>>>> that
>>>>>>>>>>>> statement.
>>>>>>>>>>>>
>>>>>>>>>>>> We start out with a DEFINED H (aka Halts) and from that we
>>>>>>>>>>>> define
>>>>>>>>>>>> a H^
>>>>>>>>>>>> (aka H_Hat) and fix that algorithm for the problem. These are
>>>>>>>>>>>> FIXED
>>>>>>>>>>>> defintions we are trying to make a proof on, and can not 'edit'
>>>>>>>>>>>> them.
>>>>>>>>>>>>
>>>>>>>>>>>> Note, that this definition includes ALL the steps that a machine
>>>>>>>>>>>> will
>>>>>>>>>>>> need to run the operation. It does not include ANY 'external'
>>>>>>>>>>>> calls to
>>>>>>>>>>>> system that might be changeable (like a Halts function in the
>>>>>>>>>>>> system).
>>>>>>>>>>>> THIS IS HOW TURING MACHINES WORK.
>>>>>>>>>>>>
>>>>>>>>>>>> Thus we can ask ANY halt decider what it thinks about
>>>>>>>>>>>> H_Hat(H_Hat) and
>>>>>>>>>>>> when it makes that decision, the H_Hat will always call that
>>>>>>>>>>>> original
>>>>>>>>>>>> Halts function that was fixed into the code. THAT IS HOW TURING
>>>>>>>>>>>> MACHINES
>>>>>>>>>>>> WORK.
>>>>>>>>>>>>
>>>>>>>>>>>> Thus we can ask that original Halts about what its decision
>>>>>>>>>>>> would
>>>>>>>>>>>> be on
>>>>>>>>>>>> H_Hat, and get an answer, which you say will be non-halting. We
>>>>>>>>>>>> then
>>>>>>>>>>>> decide we want to chack that answer, so we say, let us check
>>>>>>>>>>>> this
>>>>>>>>>>>> answer
>>>>>>>>>>>> with a slightly different halt decider, one which won't actually
>>>>>>>>>>>> halt
>>>>>>>>>>>> the computation, if the requirement of need to halt, was true,
>>>>>>>>>>>> then
>>>>>>>>>>>> this
>>>>>>>>>>>> altered halt decider shouldn't halt and go into an infinite
>>>>>>>>>>>> loop.
>>>>>>>>>>>> Note,
>>>>>>>>>>>> this test, like when we run H_Hat on any other halt decider,
>>>>>>>>>>>> still used
>>>>>>>>>>>> the original tape, with the original definition of halts on the
>>>>>>>>>>>> tape.
>>>>>>>>>>>>
>>>>>>>>>>>> This procedure actually makes some sense as this halts with the
>>>>>>>>>>>> abort
>>>>>>>>>>>> disabled effectively becomes a real UTM so asking it is like
>>>>>>>>>>>> running
>>>>>>>>>>>> the
>>>>>>>>>>>> actual machine.
>>>>>>>>>>>>
>>>>>>>>>>>> When we do this, by definition, since we have been told that
>>>>>>>>>>>> Halts(H_Hat,H_Hat) has previously returned non-halting, the
>>>>>>>>>>>> execution of
>>>>>>>>>>>> that top level H_Hat inside this defanged Halts/now UTM will get
>>>>>>>>>>>> that
>>>>>>>>>>>> answer and it will halt and thus we see that H_Hat(H_Hat) is in
>>>>>>>>>>>> fact a
>>>>>>>>>>>> finite computation when it is built on your original Halts
>>>>>>>>>>>> machine.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> No you are flat out incorrect about this. When we remove the halt
>>>>>>>>>>> detector from Halts the top level H_Hat really is infinitely
>>>>>>>>>>> recursive.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Maybe I should make a web page with this proof just so I can keep
>>>>>>>>>> refering to it.
>>>>>>>>>>
>>>>>>>>>> Main calls the the modified Halt named HaltX(H_Hat, H_Hat)
>>>>>>>>>
>>>>>>>>> The only modification is that the single line of code in Halts()
>>>>>>>>> that
>>>>>>>>> tests for non halting compuations is commented out.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> NO Modification is allowed to the code on the input tape.
>>>>>>>>
>>>>>>>> READ MY WORDS. Halts was unchanged. I created a NEW function
>>>>>>>> Haltx as
>>>>>>>> the test for halts without the halting in it to see if it really
>>>>>>>> needed
>>>>>>>> to halt.
>>>>>>>>
>>>>>>>> THIS modified function is called to decide on H_Hat(H_Hat) and it
>>>>>>>> shows
>>>>>>>> that H_Hat(H_Hat) with your original halts IS a halting computation.
>>>>>>>>
>>>>>>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY.
>>>>>>>>
>>>>>>>> If you system can't do this, then you system is defective.
>>>>>>>>
>>>>>>>
>>>>>>> To see if Halts decided H_Hat correctly we disable the the halt
>>>>>>> testing ability of Halts and see what H_Hat does. Any other way is
>>>>>>> the
>>>>>>> God damned lie of a God damned liar.
>>>>>>>
>>>>>>
>>>>>> Renaming the function with a different names is a very terrible idea
>>>>>> from a software engineering perspective because it requires that this
>>>>>> name be changed everywhere that it is referenced.
>>>>>
>>>>> Nope, we are renaming it because we need this one example to be
>>>>> different from what the rest of the code needs to use.
>>>>>
>>>>> CHANGE code that is used elsewhere which a thorough check is what
>>>>> violates fundamental principles.
>>>>>
>>>>> Just the other day, I found a small bug in a corner case in some of my
>>>>> code. This was impacting one of my coworkers code. I submitted a fix,
>>>>> but it didn't help because apparently someone else had copied my code
>>>>> block and their old version was shadowing my code. I sugggested that
>>>>> since this was just a bug fix that if their code didn't see the
>>>>> problems
>>>>> never hit that corner case so would be unaffected, by they decided that
>>>>> since that code had already gone though some very thorough testing,
>>>>> they
>>>>> wouldn't change it, but give one of them a new name.
>>>>>
>>>>> Changing a name so you DON'T change code that you don't want to change
>>>>> is a very good idea.
>>>>>>
>>>>>> The reason that you keep bringing this up is that you want to
>>>>>> dishonestly and deceptively change Halts in one place and not
>>>>>> change it
>>>>>> in another. By changing the actual body of Halts you can't get away
>>>>>> with
>>>>>> these dirty tricks.
>>>>>
>>>>> No, Halts was provided as part of the contract to H_Hat for what it was
>>>>> to show. You CAN'T change it without breaking your proof. When Halts
>>>>> gets called there are SUPPOSED to be three copies of it that are truely
>>>>> distinct. There is the copy of Halts that is being executed (this is
>>>>> the
>>>>> one that we want to adjust to make proofs on if it is doing its job
>>>>> correctly), there is the copy of Halts that is part of H_Hat in the
>>>>> program that is going to be tested, This needs to ALWAYS be the
>>>>> original
>>>>> halts that our problem statement says we are deciding on. And then
>>>>> there
>>>>> is the copy of that description being given to H_Hat as its input so it
>>>>> can continue its work.
>>>>>
>>>>> Note, this second copy doesn't NEED to be a copy of the first, as we
>>>>> are
>>>>> allowed to ask questions like does H_Hat(Foo) halt or not, for some
>>>>> other machine Foo. and the machine we ask doesn't have to match the one
>>>>> on the tape as the representation of H_Hat, as we are allowed to ask
>>>>> other Halt Deciders about H_Hat too.
>>>>>
>>>>> So all three copies are inherently able to be different.
>>>>>>
>>>>>> When we reconfigure Halts so that it no longer decides halting then
>>>>>> the
>>>>>> pure execution of H_Hat calls Halts simulates H_Hat which calls
>>>>>> Halts on
>>>>>> and on forever...
>>>>>>
>>>>>
>>>>
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> void H_Hat2(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> H_Hat((u32)H_Hat);
>>>> H_Hat2((u32)H_Hat2);
>>>> }
>>>>
>>>> When we do it this way it is waaaaaaaayyyy over your head to understand
>>>> that Simulate is merely Halts with a single line-of-code commented out.
>>>>
>>>
>>> There is NO need for H_Hat2, as that is not a question in view.
>>
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>> LIAR LIAR PANTS ON FIRE.
>>
>> If H_Hat() stops running and H_Hat2() does not stop running THAT PROVES
>> THAT Halts() DECIDED H_hat() correctly.
>>
>>
>
> I ask yoo if a corvet is a good car, you tell me Fiats are awful. It
> doesn't mean anything.
>
> We are asking about H_Hat, a machine built on a defined Halts.
Linz stipulates that Halts can be defined as any element of an infinite
set of different sequences of state transitions.
Of this infinite set we hypothetically examine the effects of two
different definitions of Halts:
(1) Halts simulates its input and terminates this input if it recognizes
non halting behavior.
(2) Halts simulates its input and DOES NOT terminate this input if it
recognizes non halting behavior.
The fact that H_Hat halts under hypothetical configuration (1) and does
not halt under hypothetical configuration (2) proves that hypothetical
configuration (1) did decide halting correctly.
--
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-15 21:24 -0400 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <fH5eI.31173$nn2.24759@fx48.iad> |
| In reply to | #31112 |
On 4/15/21 7:51 PM, olcott wrote: > On 4/15/2021 5:43 PM, Richard Damon wrote: >> I ask yoo if a corvet is a good car, you tell me Fiats are awful. It >> doesn't mean anything. >> >> We are asking about H_Hat, a machine built on a defined Halts. > > Linz stipulates that Halts can be defined as any element of an infinite > set of different sequences of state transitions. > > Of this infinite set we hypothetically examine the effects of two > different definitions of Halts: > > (1) Halts simulates its input and terminates this input if it recognizes > non halting behavior. > > (2) Halts simulates its input and DOES NOT terminate this input if it > recognizes non halting behavior. > > The fact that H_Hat halts under hypothetical configuration (1) and does > not halt under hypothetical configuration (2) proves that hypothetical > configuration (1) did decide halting correctly. > Linz says to START with *A* particular H as a Halt Decider. If you want to look at two different once, you can do it twice, once for each. Linz NEVER says anything like your (1) or (2) because is NEVER assumes that it is deciding based on simulating. Linz basically says: 1) Take your definition for H, which you want to claim to be a Universally Correct Halt Decider. a) This Machine will have starting state S0 b) The Machine will take as an input a representation of the Machine to decide and its input. c) If the machine will Halt in finite time, the decider will stop in state S.Halting d) If the machine will run forever and not stop, the decider will stop in state S.nonHalting 2) Build a Turing Machine using a copy of that H with a few minor modifiecations, and call this H^ a) At the beginning, duplicate the input tape which should hold a reperesentation of a Turing Machine. b) Modify the state S.Haliting to not be a terminal state, but instead be an infinite loop c) Keep S.nonHalting as a Terminal State. We can now run the two machines as follows: 3) Run H, with a representation of H^ as the program, and a second copy as the input. a) Observe the Answer 4) Run H^, with a representation of H^ as its input. 5) By construction, if step 3 ended in the Halting decision, the H^ in step 4 will not halt, and if in step 3 it endind in the non-Halting Decision, the H^ will Halt. Thus H was wrong in its decision on H^ There is NOTHING in Linz that talks about this halting vs non-halting deciders. NOTHING. Can you show a reference?? Where that question came was from your definition of 'Had to stop or would not stop'. The test of this is of course to NOT stop simulating and see if it will stop. If anything, this only applies to the run in step 3 when we are asking Halts about what it wants to decide. So the test there is to keep the exact same input (as we aren't questioning what is happening inside H^, we are questioning the validity of this halt decision, and that is NOT based on H^ being in someway related to H but in H's basic method of deciding. So for that test, we JUST change that top most Halt code, and NOT the code on the Tape. The alternate test, is to just run step 4, since the run of step 4 does halt, we know that if Halts simulated a bit longer before it aborted, it would have found that the machine halted, so it turns out it did NOT need to stop the machine or it would not halt. No where in that arguement did we even entertain the idea of changing H^.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-16 17:25 -0600 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <s5d6dn$hdi$1@dont-email.me> |
| In reply to | #31083 |
On 2021-04-15 15:03, olcott wrote: > On 4/15/2021 3:27 PM, olcott wrote: >> On 4/15/2021 3:07 PM, Richard Damon wrote: >>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as >>> the test for halts without the halting in it to see if it really needed >>> to halt. >>> >>> THIS modified function is called to decide on H_Hat(H_Hat) and it shows >>> that H_Hat(H_Hat) with your original halts IS a halting computation. >>> >>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. >>> >>> If you system can't do this, then you system is defective. >>> >> >> To see if Halts decided H_Hat correctly we disable the the halt >> testing ability of Halts and see what H_Hat does. Any other way is the >> God damned lie of a God damned liar. >> > > Renaming the function with a different names is a very terrible idea > from a software engineering perspective because it requires that this > name be changed everywhere that it is referenced. > > The reason that you keep bringing this up is that you want to > dishonestly and deceptively change Halts in one place and not change it > in another. By changing the actual body of Halts you can't get away with > these dirty tricks. But this isn't a dishonest dodge. This is how the systems needs to actually work. Let's consider an entirely different example which might better illustrate this. Let's say I write a computer program (not a Turing Machine) which performs some sort of benchmark tests on other software. This takes an .exe file as its input and runs it in some special environment where it collects various statistics on memory usage, processor usage, etc. Let's call this program TESTER. I compile the source code for this program to generate TESTER.exe I then review my source code and decide that I could have made my tester program more efficient, so I make some changes to it and recompile it as NEWTESTER.exe Now a logical way to verify that my changes really are an improvement would be to run the newtester program on both TESTER.exe and on NEWTESTER.exe to see if NEWTESTER.exe really was more efficient than the original. Crucially here, when I recompiled tester, the changes I made only affected NEWTESTER.exe, not TESTER.exe. If changes made to the source code *after* TESTER.exe was built somehow were magically also reflected in TESTER.exe, then it would be impossible for me to actually test the older version using the new version, but clearly this isn't the case. But that's what you want to do with your Halts and H_Hat. In the Linz proof we construct H_Hat from Halts(). After H_Hat is constructed, though, it is an entirely separate, independent TM, just as my TESTER.exe is entirely independent of the source code once built. When you run Halts(H_Hat, H_Hat), you are purportedly testing whether H_Hat halts. When you alter your Halts to act as a simulator, that simulator needs to run the *original* version of H_Hat since that was the one we tested in out halts decider. If you design your system such that any changes made to Halts are automatically reflected in H_Hat, then when we simulate H_Hat we are simulating a *different* H_Hat than the one we asked Halts() about. H_Hat is a separate program. it is derived from a halting decider. It is not derived from a simulator, and its innards must remain the same regardless of whether we provide it as the input to a Halting decider, a simulator, or run it as an independent Turing Machine. If you want to turn your Halt() into a simulator by commenting out a line, you must only do so in the instance of Halts that you are trying to turn into a simulator, i.e. the outermost instance of halts. The instances which are part of H_Hat must remain unchanged. 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-16 19:13 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <TKKdnYUfUOq1tef9nZ2dnUU7-NnNnZ2d@giganews.com> |
| In reply to | #31166 |
On 4/16/2021 6:25 PM, André G. Isaak wrote: > On 2021-04-15 15:03, olcott wrote: >> On 4/15/2021 3:27 PM, olcott wrote: >>> On 4/15/2021 3:07 PM, Richard Damon wrote: > >>>> READ MY WORDS. Halts was unchanged. I created a NEW function Haltx as >>>> the test for halts without the halting in it to see if it really needed >>>> to halt. >>>> >>>> THIS modified function is called to decide on H_Hat(H_Hat) and it shows >>>> that H_Hat(H_Hat) with your original halts IS a halting computation. >>>> >>>> YOU NEED TO FOLLOW THE RULES OF THE GAME OR YOU CAN'T PLAY. >>>> >>>> If you system can't do this, then you system is defective. >>>> >>> >>> To see if Halts decided H_Hat correctly we disable the the halt >>> testing ability of Halts and see what H_Hat does. Any other way is >>> the God damned lie of a God damned liar. >>> >> >> Renaming the function with a different names is a very terrible idea >> from a software engineering perspective because it requires that this >> name be changed everywhere that it is referenced. >> >> The reason that you keep bringing this up is that you want to >> dishonestly and deceptively change Halts in one place and not change >> it in another. By changing the actual body of Halts you can't get away >> with these dirty tricks. > > But this isn't a dishonest dodge. This is how the systems needs to > actually work. > > Let's consider an entirely different example which might better > illustrate this. Let's say I write a computer program (not a Turing > Machine) which performs some sort of benchmark tests on other software. > This takes an .exe file as its input and runs it in some special > environment where it collects various statistics on memory usage, > processor usage, etc. > > Let's call this program TESTER. I compile the source code for this > program to generate TESTER.exe > > I then review my source code and decide that I could have made my tester > program more efficient, so I make some changes to it and recompile it as > NEWTESTER.exe > > Now a logical way to verify that my changes really are an improvement > would be to run the newtester program on both TESTER.exe and on > NEWTESTER.exe to see if NEWTESTER.exe really was more efficient than the > original. Crucially here, when I recompiled tester, the changes I made > only affected NEWTESTER.exe, not TESTER.exe. > > If changes made to the source code *after* TESTER.exe was built somehow > were magically also reflected in TESTER.exe, then it would be impossible > for me to actually test the older version using the new version, but > clearly this isn't the case. > > But that's what you want to do with your Halts and H_Hat. > > In the Linz proof we construct H_Hat from Halts(). After H_Hat is > constructed, though, it is an entirely separate, independent TM, just as > my TESTER.exe is entirely independent of the source code once built. > > When you run Halts(H_Hat, H_Hat), you are purportedly testing whether > H_Hat halts. > > When you alter your Halts to act as a simulator, that simulator needs to > run the *original* version of H_Hat since that was the one we tested in > out halts decider. If you design your system such that any changes made > to Halts are automatically reflected in H_Hat, then when we simulate > H_Hat we are simulating a *different* H_Hat than the one we asked > Halts() about. > > H_Hat is a separate program. it is derived from a halting decider. It is > not derived from a simulator, and its innards must remain the same > regardless of whether we provide it as the input to a Halting decider, a > simulator, or run it as an independent Turing Machine. > > If you want to turn your Halt() into a simulator by commenting out a > line, you must only do so in the instance of Halts that you are trying > to turn into a simulator, i.e. the outermost instance of halts. The > instances which are part of H_Hat must remain unchanged. > > André > If you simulate H_Hat with Halts as a simulator it runs forever. If you simulate H_Hat with Halts as a halt decider the halt decider aborts this otherwise infinite recursion. It is really not that hard. In fact it is so simple that anyone proposing alternatives is much more likely a liar than someone that does not understand. -- 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-17 01:24 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <87zgxxdagw.fsf@bsb.me.uk> |
| In reply to | #31167 |
olcott <NoOne@NoWhere.com> writes: > It is really not that hard. In fact it is so simple that anyone > proposing alternatives is much more likely a liar than someone that > does not understand. I hope you make this is the final sentence of the paper you submit to the JACM. What would I give to share a common room with the editor on /that/ day! -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-16 19:33 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <H4Cdnenizt1Xsef9nZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #31170 |
On 4/16/2021 7:24 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> It is really not that hard. In fact it is so simple that anyone >> proposing alternatives is much more likely a liar than someone that >> does not understand. > > I hope you make this is the final sentence of the paper you submit to > the JACM. What would I give to share a common room with the editor on > /that/ day! > Yes it is your way to respond with rhetoric when you have no actual reasoning. On the other hand there is no correct rebuttal for my actual point: If you simulate H_Hat with Halts as a simulator it runs forever. If you simulate H_Hat with Halts as a halt decider the halt decider aborts this otherwise infinite recursion. This proves that the halt decider was correct in its decision to abort its input. -- 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-17 02:07 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <87im4ld8h9.fsf@bsb.me.uk> |
| In reply to | #31173 |
olcott <NoOne@NoWhere.com> writes: > On 4/16/2021 7:24 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> It is really not that hard. In fact it is so simple that anyone >>> proposing alternatives is much more likely a liar than someone that >>> does not understand. >> >> I hope you make this is the final sentence of the paper you submit to >> the JACM. What would I give to share a common room with the editor on >> /that/ day! >> > > Yes it is your way to respond with rhetoric when you have no actual > reasoning. Yes. I responded to your rhetoric with rhetoric. > On the other hand there is no correct rebuttal for my actual point: > > If you simulate H_Hat with Halts as a simulator it runs forever. > > If you simulate H_Hat with Halts as a halt decider the halt decider > aborts this otherwise infinite recursion. There a lots of rebuttals to this point. Two very detailed and clear ones have been presented in the last few hours. Is there any point in my adding my own? I will, if you promise to actually address it! > This proves that the halt decider was correct in its decision to abort > its input. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-16 20:15 -0500 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <6ridnXvYfbEIq-f9nZ2dnUU7-TOdnZ2d@giganews.com> |
| In reply to | #31177 |
On 4/16/2021 8:07 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/16/2021 7:24 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> It is really not that hard. In fact it is so simple that anyone >>>> proposing alternatives is much more likely a liar than someone that >>>> does not understand. >>> >>> I hope you make this is the final sentence of the paper you submit to >>> the JACM. What would I give to share a common room with the editor on >>> /that/ day! >>> >> >> Yes it is your way to respond with rhetoric when you have no actual >> reasoning. > > Yes. I responded to your rhetoric with rhetoric. > >> On the other hand there is no correct rebuttal for my actual point: >> >> If you simulate H_Hat with Halts as a simulator it runs forever. >> >> If you simulate H_Hat with Halts as a halt decider the halt decider >> aborts this otherwise infinite recursion. > > There a lots of rebuttals to this point. Two very detailed and clear > ones have been presented in the last few hours. Is there any point in > my adding my own? I will, if you promise to actually address it! > I didn't do it exactly the way Linz did it is not a valid rebuttal unless the way that Linz did it is the only possible correct way to formulate the model of the halting problem undecidability proofs and it is not. >> This proves that the halt decider was correct in its decision to abort >> its input. > -- 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-17 02:18 +0100 |
| Subject | Re: What is a computation? (There is no weaseling out of this) |
| Message-ID | <874kg5d7yj.fsf@bsb.me.uk> |
| In reply to | #31179 |
olcott <NoOne@NoWhere.com> writes: > On 4/16/2021 8:07 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/16/2021 7:24 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> It is really not that hard. In fact it is so simple that anyone >>>>> proposing alternatives is much more likely a liar than someone that >>>>> does not understand. >>>> >>>> I hope you make this is the final sentence of the paper you submit to >>>> the JACM. What would I give to share a common room with the editor on >>>> /that/ day! >>>> >>> >>> Yes it is your way to respond with rhetoric when you have no actual >>> reasoning. >> >> Yes. I responded to your rhetoric with rhetoric. >> >>> On the other hand there is no correct rebuttal for my actual point: >>> >>> If you simulate H_Hat with Halts as a simulator it runs forever. >>> >>> If you simulate H_Hat with Halts as a halt decider the halt decider >>> aborts this otherwise infinite recursion. >> >> There a lots of rebuttals to this point. Two very detailed and clear >> ones have been presented in the last few hours. Is there any point in >> my adding my own? I will, if you promise to actually address it! > > I didn't do it exactly the way Linz did it is not a valid rebuttal > unless the way that Linz did it is the only possible correct way to > formulate the model of the halting problem undecidability proofs and > it is not. Maybe you haven't seen them yet. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 8 of 50 — ← Prev page 1 … 6 7 [8] 9 10 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web