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 41 of 50 — ← Prev page 1 … 39 40 [41] 42 43 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-25 12:59 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <idadnd_tHaV2MBj9nZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #32148 |
On 4/25/2021 11:44 AM, Richard Damon wrote:
> On 4/25/21 10:54 AM, olcott wrote:
>> On 4/25/2021 4:14 AM, Malcolm McLean wrote:
>> If H_Hat halts, then we can determine that it has halted by running it.
>>> But what if it never halts? Isn't there a difficulty here?
>>>
>>
>> If we hypothesize that Halts() has a correct set of axioms such that
>> every time it decides to stop simulating its input this input would
>> never otherwise halt then:
>>
>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>
>
> Except that we find that 'hypothesis' to be wrong, at least with the
> proper definition of Halting, when we look at H_Hat(H_Hat), which when
> we run it, it halts, and thus we show the hypothesis was incorrect.
Must_be_Stopped(x) means that x would never halt unless the halt decider
stops simulating x.
When we assume that these two premises are true:
(1) ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
(2) Must_be_Stopped(H_Hat)
Then by logical necessity we can conclude that the halt decider
correctly deciding not haling on H_Hat.
That you do not agree that H_Hat(H_Hat) must have its otherwise infinite
recursion stopped at some point is utterly ridiculous because it
directly contradicts easily verifiabled facts.
You might as well say that you know that every single human on the
planet voted for Donald Trump.
H_Hat() does specify infinite recursion that must be terminated at some
point
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
H_Hat((u32)H_Hat);
}
_H_Hat()
[00000b98](01) 55 push ebp
[00000b99](02) 8bec mov ebp,esp
[00000b9b](01) 51 push ecx
[00000b9c](03) 8b4508 mov eax,[ebp+08]
[00000b9f](01) 50 push eax
[00000ba0](03) 8b4d08 mov ecx,[ebp+08]
[00000ba3](01) 51 push ecx
[00000ba4](05) e88ffdffff call 00000938
[00000ba9](03) 83c408 add esp,+08
[00000bac](03) 8945fc mov [ebp-04],eax
[00000baf](04) 837dfc00 cmp dword [ebp-04],+00
[00000bb3](02) 7402 jz 00000bb7
[00000bb5](02) ebfe jmp 00000bb5
[00000bb7](02) 8be5 mov esp,ebp
[00000bb9](01) 5d pop ebp
[00000bba](01) c3 ret
Size in bytes:(0035) [00000bba]
_main()
[00000bc8](01) 55 push ebp
[00000bc9](02) 8bec mov ebp,esp
[00000bcb](05) 68980b0000 push 00000b98
[00000bd0](05) e8c3ffffff call 00000b98
[00000bd5](03) 83c404 add esp,+04
[00000bd8](02) 33c0 xor eax,eax
[00000bda](01) 5d pop ebp
[00000bdb](01) c3 ret
Size in bytes:(0020) [00000bdb]
===============================
...[00000bc8][001015d4][00000000](01) 55 push ebp
...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
...[00000bcb][001015d0][00000b98](05) 68980b0000 push 00000b98
...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call 00000b98
...[00000b98][001015c8][001015d4](01) 55 push ebp
...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
...[00000b9b][001015c4][00000000](01) 51 push ecx
...[00000b9c][001015c4][00000000](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][001015c0][00000b98](01) 50 push eax
...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][001015bc][00000b98](01) 51 push ecx
...[00000ba4][001015b8][00000ba9](05) e88ffdffff call 00000938
Begin Local Halt Decider Simulation at Machine Address:b98
...[00000b98][00211674][00211678](01) 55 push ebp
...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
...[00000b9b][00211670][00201644](01) 51 push ecx
...[00000b9c][00211670][00201644](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][0021166c][00000b98](01) 50 push eax
...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][00211668][00000b98](01) 51 push ecx
...[00000ba4][00211664][00000ba9](05) e88ffdffff call 00000938
...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
...[00000b9b][0025c098][0024c06c](01) 51 push ecx
...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][0025c094][00000b98](01) 50 push eax
...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][0025c090][00000b98](01) 51 push ecx
...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call 00000938
Local Halt Decider: Infinite Recursion Detected Simulation Stopped
...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
...[00000bac][001015c4][00000000](03) 8945fc mov
[ebp-04],eax
...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
[ebp-04],+00
...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
...[00000bba][001015d0][00000b98](01) c3 ret
...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
...[00000bda][001015d8][00100000](01) 5d pop ebp
...[00000bdb][001015dc][00000098](01) c3 ret
Number_of_User_Instructions(39)
Number of Instructions Executed(26567)
--
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-25 20:15 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <tCnhI.24848$N%1.8321@fx28.iad> |
| In reply to | #32153 |
On 4/25/21 1:59 PM, olcott wrote:
> On 4/25/2021 11:44 AM, Richard Damon wrote:
>> On 4/25/21 10:54 AM, olcott wrote:
>>> On 4/25/2021 4:14 AM, Malcolm McLean wrote:
>>> If H_Hat halts, then we can determine that it has halted by running it.
>>>> But what if it never halts? Isn't there a difficulty here?
>>>>
>>>
>>> If we hypothesize that Halts() has a correct set of axioms such that
>>> every time it decides to stop simulating its input this input would
>>> never otherwise halt then:
>>>
>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>
>>
>> Except that we find that 'hypothesis' to be wrong, at least with the
>> proper definition of Halting, when we look at H_Hat(H_Hat), which when
>> we run it, it halts, and thus we show the hypothesis was incorrect.
>
>
> Must_be_Stopped(x) means that x would never halt unless the halt decider
> stops simulating x.
>
> When we assume that these two premises are true:
> (1) ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
> (2) Must_be_Stopped(H_Hat)
But the first statement is ONLY true if Must_Be_Stopped(x) is only true
it ir requires the TOPMOST halt decider to halt the stop the simulation
to make the execution non-infinite. If a copy of the Halt Decider within
the machine X can make that decision, THAT decision can make x a halting
computation. (As shown by H_Hat)
>
> Then by logical necessity we can conclude that the halt decider
> correctly deciding not haling on H_Hat.
>
> That you do not agree that H_Hat(H_Hat) must have its otherwise infinite
> recursion stopped at some point is utterly ridiculous because it
> directly contradicts easily verifiabled facts.
>
> You might as well say that you know that every single human on the
> planet voted for Donald Trump.
>
>
> H_Hat() does specify infinite recursion that must be terminated at some
> point
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
> [00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
> 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
> 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
> 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
> 00000938
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
> 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov
> [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
> [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
>
>
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-25 21:56 +0100 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <87v98ahymg.fsf@bsb.me.uk> |
| In reply to | #32144 |
olcott <NoOne@NoWhere.com> writes: > If we hypothesize that Halts() has a correct set of axioms such that > every time it decides to stop simulating its input this input would > never otherwise halt then: > > ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x)) Putting aside the poetic touches (like giving Halting only an encoded TM and leaving the reader to guess what kind of thing Must_be_Stopped is) you are simply hypothesising a halt decider. The above defines Must_be_Stopped (presumably some algorithm that captures what you call axioms) as a negative halt decider. Flip the result, and you have a halt decider. You don't (I know you don't claim to have one). The best you can hope for from a Must_be_Stopped implementation is that it gets at least an infinite number of cases wrong. Whilst you don't claim to have halt decider, you need be come clean about exactly which cases you permit Must_be_Stopped to be wrong about. It might just be the one case you do care about. (Spoiler: it is!) BTW, if Must_be_Stopped is not intended to stand for some algorithm that makes the determination, then the poem is useless -- all it does is refine one predicate to be the negation of another and it captures nothing of the text you've been pasting into posts for days. Of course, it would be foolish of me to rule that possibility out. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-25 22:53 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <TK6dnTSVDfOSpBv9nZ2dnUU7-Q_NnZ2d@giganews.com> |
| In reply to | #32163 |
On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> If we hypothesize that Halts() has a correct set of axioms such that
>> every time it decides to stop simulating its input this input would
>> never otherwise halt then:
>>
>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>
> Putting aside the poetic touches (like giving Halting only an encoded TM
> and leaving the reader to guess what kind of thing Must_be_Stopped is)
> you are simply hypothesising a halt decider.
>
> The above defines Must_be_Stopped (presumably some algorithm that
> captures what you call axioms) as a negative halt decider. Flip the
> result, and you have a halt decider. You don't (I know you don't claim
> to have one). The best you can hope for from a Must_be_Stopped
> implementation is that it gets at least an infinite number of cases
> wrong.
>
> Whilst you don't claim to have halt decider, you need be come clean
> about exactly which cases you permit Must_be_Stopped to be wrong about.
> It might just be the one case you do care about. (Spoiler: it is!)
void H_Hat(u32 P)
{
Halts(P, P);
}
void H_Hat2(u32 P)
{
Simulate(P, P);
}
void Infinite_Recursion(u32 N)
{
Infinite_Recursion(N);
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
}
The halt decider reports not halting on the above three computations on
the basis that the only way that they ever stop executing is when their
simulator stops simulating them.
> BTW, if Must_be_Stopped is not intended to stand for some algorithm that
> makes the determination, then the poem is useless -- all it does is
> refine one predicate to be the negation of another and it captures
> nothing of the text you've been pasting into posts for days. Of course,
> it would be foolish of me to rule that possibility out.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-25 21:58 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s65doq$53v$1@dont-email.me> |
| In reply to | #32179 |
On 2021-04-25 21:53, olcott wrote:
> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> If we hypothesize that Halts() has a correct set of axioms such that
>>> every time it decides to stop simulating its input this input would
>>> never otherwise halt then:
>>>
>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>
>> Putting aside the poetic touches (like giving Halting only an encoded TM
>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>> you are simply hypothesising a halt decider.
>>
>> The above defines Must_be_Stopped (presumably some algorithm that
>> captures what you call axioms) as a negative halt decider. Flip the
>> result, and you have a halt decider. You don't (I know you don't claim
>> to have one). The best you can hope for from a Must_be_Stopped
>> implementation is that it gets at least an infinite number of cases
>> wrong.
>>
>> Whilst you don't claim to have halt decider, you need be come clean
>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>> It might just be the one case you do care about. (Spoiler: it is!)
>
> void H_Hat(u32 P)
> {
> Halts(P, P);
> }
>
> void H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> void Infinite_Recursion(u32 N)
> {
> Infinite_Recursion(N);
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
> }
>
> The halt decider reports not halting on the above three computations on
> the basis that the only way that they ever stop executing is when their
> simulator stops simulating them.
But this is false for Halts(H_Hat, H_Hat). In this case 'the simulator'
is the *outermost* instance of Halts. The other instances of Halts are
all part of H_Hat and thus part of the computation under evaluation.
If the outermost Halts failed to stop the execution, the execution would
still halt.
That's trivial to demonstrate by simply running H_Hat(H_Hat) on its own.
It does not run forever which is what it means for a computation to be
non-halting.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-26 06:55 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <H_whI.80701$OF5.69470@fx07.iad> |
| In reply to | #32179 |
On 4/25/21 11:53 PM, olcott wrote:
> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> If we hypothesize that Halts() has a correct set of axioms such that
>>> every time it decides to stop simulating its input this input would
>>> never otherwise halt then:
>>>
>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>
>> Putting aside the poetic touches (like giving Halting only an encoded TM
>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>> you are simply hypothesising a halt decider.
>>
>> The above defines Must_be_Stopped (presumably some algorithm that
>> captures what you call axioms) as a negative halt decider. Flip the
>> result, and you have a halt decider. You don't (I know you don't claim
>> to have one). The best you can hope for from a Must_be_Stopped
>> implementation is that it gets at least an infinite number of cases
>> wrong.
>>
>> Whilst you don't claim to have halt decider, you need be come clean
>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>> It might just be the one case you do care about. (Spoiler: it is!)
>
> void H_Hat(u32 P)
> {
> Halts(P, P);
> }
>
> void H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> void Infinite_Recursion(u32 N)
> {
> Infinite_Recursion(N);
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
> }
>
> The halt decider reports not halting on the above three computations on
> the basis that the only way that they ever stop executing is when their
> simulator stops simulating them.
Except that the Halt Decider is wrong for H_Hat, because H_Hat when run
as a top level Computation will Halt.
It can be seen easily that Halts can't be an always right decider
because it gets caught in this infinite loop of decider calls and never
gets a chance to see what the routines are going to do with the answer,
Since it (at least should) know that these calls to Halts are (at least
supposed to) return in finite time, it needs to do something to figure
out what that response would be to decide what the computation will do,
It is basically, just a flawed algorithm, so is wrong. Not that bad to
be wrong, since we know that Halt Deciding is a 'rigged' game, and one
that can not be won.
>> BTW, if Must_be_Stopped is not intended to stand for some algorithm that
>> makes the determination, then the poem is useless -- all it does is
>> refine one predicate to be the negation of another and it captures
>> nothing of the text you've been pasting into posts for days. Of course,
>> it would be foolish of me to rule that possibility out.
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-04-26 05:01 -0700 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <d4151f1b-c79c-4d83-a711-82923616c007n@googlegroups.com> |
| In reply to | #32186 |
On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
> On 4/25/21 11:53 PM, olcott wrote:
> > On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
> >> olcott <No...@NoWhere.com> writes:
> >>
> >>> If we hypothesize that Halts() has a correct set of axioms such that
> >>> every time it decides to stop simulating its input this input would
> >>> never otherwise halt then:
> >>>
> >>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
> >>
> >> Putting aside the poetic touches (like giving Halting only an encoded TM
> >> and leaving the reader to guess what kind of thing Must_be_Stopped is)
> >> you are simply hypothesising a halt decider.
> >>
> >> The above defines Must_be_Stopped (presumably some algorithm that
> >> captures what you call axioms) as a negative halt decider. Flip the
> >> result, and you have a halt decider. You don't (I know you don't claim
> >> to have one). The best you can hope for from a Must_be_Stopped
> >> implementation is that it gets at least an infinite number of cases
> >> wrong.
> >>
> >> Whilst you don't claim to have halt decider, you need be come clean
> >> about exactly which cases you permit Must_be_Stopped to be wrong about.
> >> It might just be the one case you do care about. (Spoiler: it is!)
> >
> > void H_Hat(u32 P)
> > {
> > Halts(P, P);
> > }
> >
> > void H_Hat2(u32 P)
> > {
> > Simulate(P, P);
> > }
> >
> > void Infinite_Recursion(u32 N)
> > {
> > Infinite_Recursion(N);
> > }
> >
> > int main()
> > {
> > u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> > u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> > u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
> > }
> >
> > The halt decider reports not halting on the above three computations on
> > the basis that the only way that they ever stop executing is when their
> > simulator stops simulating them.
> Except that the Halt Decider is wrong for H_Hat, because H_Hat when run
> as a top level Computation will Halt.
>
> It can be seen easily that Halts can't be an always right decider
> because it gets caught in this infinite loop of decider calls and never
> gets a chance to see what the routines are going to do with the answer,
>
> Since it (at least should) know that these calls to Halts are (at least
> supposed to) return in finite time, it needs to do something to figure
> out what that response would be to decide what the computation will do,
>
> It is basically, just a flawed algorithm, so is wrong. Not that bad to
> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
> that can not be won.
>
Yes, the question is not "Can you build a halt decider?" or even "can you
build an H / H_Hat pair in the relationship prescribed by Linz?". It's
"can you change the question in some way that amounts to something
interesting?". However even that is very hard.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 09:22 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <HfudnZQNg8wYURv9nZ2dnUU7-VmdnZ2d@giganews.com> |
| In reply to | #32188 |
On 4/26/2021 7:01 AM, Malcolm McLean wrote:
> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>> On 4/25/21 11:53 PM, olcott wrote:
>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>> olcott <No...@NoWhere.com> writes:
>>>>
>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>> every time it decides to stop simulating its input this input would
>>>>> never otherwise halt then:
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> Putting aside the poetic touches (like giving Halting only an encoded TM
>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>> you are simply hypothesising a halt decider.
>>>>
>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>> implementation is that it gets at least an infinite number of cases
>>>> wrong.
>>>>
>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>
>>> void H_Hat(u32 P)
>>> {
>>> Halts(P, P);
>>> }
>>>
>>> void H_Hat2(u32 P)
>>> {
>>> Simulate(P, P);
>>> }
>>>
>>> void Infinite_Recursion(u32 N)
>>> {
>>> Infinite_Recursion(N);
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>> }
>>>
>>> The halt decider reports not halting on the above three computations on
>>> the basis that the only way that they ever stop executing is when their
>>> simulator stops simulating them.
>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when run
>> as a top level Computation will Halt.
>>
>> It can be seen easily that Halts can't be an always right decider
>> because it gets caught in this infinite loop of decider calls and never
>> gets a chance to see what the routines are going to do with the answer,
>>
>> Since it (at least should) know that these calls to Halts are (at least
>> supposed to) return in finite time, it needs to do something to figure
>> out what that response would be to decide what the computation will do,
>>
>> It is basically, just a flawed algorithm, so is wrong. Not that bad to
>> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
>> that can not be won.
>>
> Yes, the question is not "Can you build a halt decider?" or even "can you
> build an H / H_Hat pair in the relationship prescribed by Linz?". It's
> "can you change the question in some way that amounts to something
> interesting?". However even that is very hard.
>
∀x ∈ Turing_Machine_Descriptions
∀y ∈ Finite_Strings
(UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
In those cases where a partial halt decider can decide:
UTM(x, y) = ∞ the input is non halting.
void H_Hat2(u32 P)
{
Simulate(P, P);
}
void H_Hat(u32 P)
{
Halts(P, P);
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
}
In other words if H_Hat2() does not halt then we know
that Halts must return not halting on H_Hat(H_Hat).
--
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-26 11:01 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <mBAhI.253819$2N3.104776@fx33.iad> |
| In reply to | #32197 |
On 4/26/21 10:22 AM, olcott wrote:
> On 4/26/2021 7:01 AM, Malcolm McLean wrote:
>> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>>> On 4/25/21 11:53 PM, olcott wrote:
>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>> every time it decides to stop simulating its input this input would
>>>>>> never otherwise halt then:
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>
>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>> encoded TM
>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>> you are simply hypothesising a halt decider.
>>>>>
>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>> implementation is that it gets at least an infinite number of cases
>>>>> wrong.
>>>>>
>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>> about.
>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> Halts(P, P);
>>>> }
>>>>
>>>> void H_Hat2(u32 P)
>>>> {
>>>> Simulate(P, P);
>>>> }
>>>>
>>>> void Infinite_Recursion(u32 N)
>>>> {
>>>> Infinite_Recursion(N);
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>>> }
>>>>
>>>> The halt decider reports not halting on the above three computations on
>>>> the basis that the only way that they ever stop executing is when their
>>>> simulator stops simulating them.
>>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when run
>>> as a top level Computation will Halt.
>>>
>>> It can be seen easily that Halts can't be an always right decider
>>> because it gets caught in this infinite loop of decider calls and never
>>> gets a chance to see what the routines are going to do with the answer,
>>>
>>> Since it (at least should) know that these calls to Halts are (at least
>>> supposed to) return in finite time, it needs to do something to figure
>>> out what that response would be to decide what the computation will do,
>>>
>>> It is basically, just a flawed algorithm, so is wrong. Not that bad to
>>> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
>>> that can not be won.
>>>
>> Yes, the question is not "Can you build a halt decider?" or even "can you
>> build an H / H_Hat pair in the relationship prescribed by Linz?". It's
>> "can you change the question in some way that amounts to something
>> interesting?". However even that is very hard.
>>
>
>
> ∀x ∈ Turing_Machine_Descriptions
> ∀y ∈ Finite_Strings
> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>
> In those cases where a partial halt decider can decide:
> UTM(x, y) = ∞ the input is non halting.
>
> void H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> void H_Hat(u32 P)
> {
> Halts(P, P);
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> }
>
> In other words if H_Hat2() does not halt then we know
> that Halts must return not halting on H_Hat(H_Hat).
>
Yes, H_Hat2 is infinite execution, but not H_Hat, as it calls Halts not
Simulate, and Halts, as part of its Computation used by H_Hat, will
terminate the simulation making H_Hat finite in execution.
For some reason, you want to make this halting in Halts of its
SIMULATION conflated with terminating it enclosing machine, which it
isn't. Its deciding to terminate its simulation is EXACTLY why
H_Hat(H_Hat) is finite.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 10:07 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <0KidnWoHVKieShv9nZ2dnUU7-I-dnZ2d@giganews.com> |
| In reply to | #32202 |
On 4/26/2021 10:01 AM, Richard Damon wrote:
> On 4/26/21 10:22 AM, olcott wrote:
>> On 4/26/2021 7:01 AM, Malcolm McLean wrote:
>>> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>>>> On 4/25/21 11:53 PM, olcott wrote:
>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>
>>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>> never otherwise halt then:
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>
>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>> encoded TM
>>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>>> you are simply hypothesising a halt decider.
>>>>>>
>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>> wrong.
>>>>>>
>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>> about.
>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> Halts(P, P);
>>>>> }
>>>>>
>>>>> void H_Hat2(u32 P)
>>>>> {
>>>>> Simulate(P, P);
>>>>> }
>>>>>
>>>>> void Infinite_Recursion(u32 N)
>>>>> {
>>>>> Infinite_Recursion(N);
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>>>> }
>>>>>
>>>>> The halt decider reports not halting on the above three computations on
>>>>> the basis that the only way that they ever stop executing is when their
>>>>> simulator stops simulating them.
>>>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when run
>>>> as a top level Computation will Halt.
>>>>
>>>> It can be seen easily that Halts can't be an always right decider
>>>> because it gets caught in this infinite loop of decider calls and never
>>>> gets a chance to see what the routines are going to do with the answer,
>>>>
>>>> Since it (at least should) know that these calls to Halts are (at least
>>>> supposed to) return in finite time, it needs to do something to figure
>>>> out what that response would be to decide what the computation will do,
>>>>
>>>> It is basically, just a flawed algorithm, so is wrong. Not that bad to
>>>> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
>>>> that can not be won.
>>>>
>>> Yes, the question is not "Can you build a halt decider?" or even "can you
>>> build an H / H_Hat pair in the relationship prescribed by Linz?". It's
>>> "can you change the question in some way that amounts to something
>>> interesting?". However even that is very hard.
>>>
>>
>>
>> ∀x ∈ Turing_Machine_Descriptions
>> ∀y ∈ Finite_Strings
>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>
>> In those cases where a partial halt decider can decide:
>> UTM(x, y) = ∞ the input is non halting.
>>
>> void H_Hat2(u32 P)
>> {
>> Simulate(P, P);
>> }
>>
>> void H_Hat(u32 P)
>> {
>> Halts(P, P);
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>> }
>>
>> In other words if H_Hat2() does not halt then we know
>> that Halts must return not halting on H_Hat(H_Hat).
>>
>
> Yes, H_Hat2 is infinite execution, but not H_Hat, as it calls Halts not
> Simulate, and Halts, as part of its Computation used by H_Hat, will
> terminate the simulation making H_Hat finite in execution.
>
At the point when a correct halt decider would make a correct not
halting decision the computations are equivalent.
> For some reason, you want to make this halting in Halts of its
> SIMULATION conflated with terminating it enclosing machine, which it
> isn't. Its deciding to terminate its simulation is EXACTLY why
> H_Hat(H_Hat) is finite.
>
--
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-26 11:32 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <q2BhI.14286$8O4.686@fx16.iad> |
| In reply to | #32203 |
On 4/26/21 11:07 AM, olcott wrote:
> On 4/26/2021 10:01 AM, Richard Damon wrote:
>> On 4/26/21 10:22 AM, olcott wrote:
>>> On 4/26/2021 7:01 AM, Malcolm McLean wrote:
>>>> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>>>>> On 4/25/21 11:53 PM, olcott wrote:
>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>
>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>> that
>>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>>> never otherwise halt then:
>>>>>>>>
>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>>
>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>> encoded TM
>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>> Must_be_Stopped is)
>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>
>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>>> claim
>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>> wrong.
>>>>>>>
>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>> about.
>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> Halts(P, P);
>>>>>> }
>>>>>>
>>>>>> void H_Hat2(u32 P)
>>>>>> {
>>>>>> Simulate(P, P);
>>>>>> }
>>>>>>
>>>>>> void Infinite_Recursion(u32 N)
>>>>>> {
>>>>>> Infinite_Recursion(N);
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>>>>> }
>>>>>>
>>>>>> The halt decider reports not halting on the above three
>>>>>> computations on
>>>>>> the basis that the only way that they ever stop executing is when
>>>>>> their
>>>>>> simulator stops simulating them.
>>>>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when
>>>>> run
>>>>> as a top level Computation will Halt.
>>>>>
>>>>> It can be seen easily that Halts can't be an always right decider
>>>>> because it gets caught in this infinite loop of decider calls and
>>>>> never
>>>>> gets a chance to see what the routines are going to do with the
>>>>> answer,
>>>>>
>>>>> Since it (at least should) know that these calls to Halts are (at
>>>>> least
>>>>> supposed to) return in finite time, it needs to do something to figure
>>>>> out what that response would be to decide what the computation will
>>>>> do,
>>>>>
>>>>> It is basically, just a flawed algorithm, so is wrong. Not that bad to
>>>>> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
>>>>> that can not be won.
>>>>>
>>>> Yes, the question is not "Can you build a halt decider?" or even
>>>> "can you
>>>> build an H / H_Hat pair in the relationship prescribed by Linz?". It's
>>>> "can you change the question in some way that amounts to something
>>>> interesting?". However even that is very hard.
>>>>
>>>
>>>
>>> ∀x ∈ Turing_Machine_Descriptions
>>> ∀y ∈ Finite_Strings
>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>
>>> In those cases where a partial halt decider can decide:
>>> UTM(x, y) = ∞ the input is non halting.
>>>
>>> void H_Hat2(u32 P)
>>> {
>>> Simulate(P, P);
>>> }
>>>
>>> void H_Hat(u32 P)
>>> {
>>> Halts(P, P);
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> }
>>>
>>> In other words if H_Hat2() does not halt then we know
>>> that Halts must return not halting on H_Hat(H_Hat).
>>>
>>
>> Yes, H_Hat2 is infinite execution, but not H_Hat, as it calls Halts not
>> Simulate, and Halts, as part of its Computation used by H_Hat, will
>> terminate the simulation making H_Hat finite in execution.
>>
>
> At the point when a correct halt decider would make a correct not
> halting decision the computations are equivalent.
Except they aren't. If you want to claim that Halts is the equivalent to
Simulate, then you have to accept that it is now non-halting on H_Hat
and not a decider.
The fact that it stopped too soon, doesn't make it right.
We KNOW that when we run H_Hat as the top level machine, that the Halts
inside will need to make that same decision, and stop it simulation,
thus making H_Hat a finite Computation.
It is Halts own error, that it doesn't give it time to find out.
Halts makes the INCORRECT decision based on not being smart enough to be
able to figure out how the version of Halts it is simulating will
behave. It is a fundamental design issue with how Halts is designed. The
simulating version needs to give the simulate version more time to run.
Note, you can't just change the code to always give more time, as then
the simulating version STILL doesn't give the simulated version enough
time, as it will also take longer.
With your current definition, Halts decides that H_Hat is non-Halting,
and H_Hat will be Halting, and thus wrong.
>
>> For some reason, you want to make this halting in Halts of its
>> SIMULATION conflated with terminating it enclosing machine, which it
>> isn't. Its deciding to terminate its simulation is EXACTLY why
>> H_Hat(H_Hat) is finite.
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 11:01 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <JeOdnfoYma80fhv9nZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #32204 |
On 4/26/2021 10:32 AM, Richard Damon wrote:
> On 4/26/21 11:07 AM, olcott wrote:
>> On 4/26/2021 10:01 AM, Richard Damon wrote:
>>> On 4/26/21 10:22 AM, olcott wrote:
>>>> On 4/26/2021 7:01 AM, Malcolm McLean wrote:
>>>>> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>>>>>> On 4/25/21 11:53 PM, olcott wrote:
>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>>> that
>>>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>>>> never otherwise halt then:
>>>>>>>>>
>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>>>
>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>> encoded TM
>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>> Must_be_Stopped is)
>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>
>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>>>> claim
>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>>> wrong.
>>>>>>>>
>>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>>> about.
>>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> Halts(P, P);
>>>>>>> }
>>>>>>>
>>>>>>> void H_Hat2(u32 P)
>>>>>>> {
>>>>>>> Simulate(P, P);
>>>>>>> }
>>>>>>>
>>>>>>> void Infinite_Recursion(u32 N)
>>>>>>> {
>>>>>>> Infinite_Recursion(N);
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>>>>>> }
>>>>>>>
>>>>>>> The halt decider reports not halting on the above three
>>>>>>> computations on
>>>>>>> the basis that the only way that they ever stop executing is when
>>>>>>> their
>>>>>>> simulator stops simulating them.
>>>>>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when
>>>>>> run
>>>>>> as a top level Computation will Halt.
>>>>>>
>>>>>> It can be seen easily that Halts can't be an always right decider
>>>>>> because it gets caught in this infinite loop of decider calls and
>>>>>> never
>>>>>> gets a chance to see what the routines are going to do with the
>>>>>> answer,
>>>>>>
>>>>>> Since it (at least should) know that these calls to Halts are (at
>>>>>> least
>>>>>> supposed to) return in finite time, it needs to do something to figure
>>>>>> out what that response would be to decide what the computation will
>>>>>> do,
>>>>>>
>>>>>> It is basically, just a flawed algorithm, so is wrong. Not that bad to
>>>>>> be wrong, since we know that Halt Deciding is a 'rigged' game, and one
>>>>>> that can not be won.
>>>>>>
>>>>> Yes, the question is not "Can you build a halt decider?" or even
>>>>> "can you
>>>>> build an H / H_Hat pair in the relationship prescribed by Linz?". It's
>>>>> "can you change the question in some way that amounts to something
>>>>> interesting?". However even that is very hard.
>>>>>
>>>>
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions
>>>> ∀y ∈ Finite_Strings
>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>
>>>> In those cases where a partial halt decider can decide:
>>>> UTM(x, y) = ∞ the input is non halting.
>>>>
>>>> void H_Hat2(u32 P)
>>>> {
>>>> Simulate(P, P);
>>>> }
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> Halts(P, P);
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> }
>>>>
>>>> In other words if H_Hat2() does not halt then we know
>>>> that Halts must return not halting on H_Hat(H_Hat).
>>>>
>>>
>>> Yes, H_Hat2 is infinite execution, but not H_Hat, as it calls Halts not
>>> Simulate, and Halts, as part of its Computation used by H_Hat, will
>>> terminate the simulation making H_Hat finite in execution.
>>>
>>
>> At the point when a correct halt decider would make a correct not
>> halting decision the computations are equivalent.
>
> Except they aren't. If you want to claim that Halts is the equivalent to
> Simulate, then you have to accept that it is now non-halting on H_Hat
> and not a decider.
This halt deciding axiom is true by semantic tautology.
∀x ∈ Turing_Machine_Descriptions
∀y ∈ Finite_Strings
(UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
This logically entails that every input to the halt decider that would
not halt if this same input was input to a simulator then we can know
that this input to the halt decider is non halting input.
01 void H_Hat(u32 P)
02 {
03 Halts(P, P);
04 }
Because we know that swapping line (03) with Simulate(P,P) would be
infinitely recursive we can know that the halt decider must decide not
halting for line (03).
--
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-26 12:22 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <oNBhI.291447$nn2.242799@fx48.iad> |
| In reply to | #32205 |
On 4/26/21 12:01 PM, olcott wrote:
> On 4/26/2021 10:32 AM, Richard Damon wrote:
>> On 4/26/21 11:07 AM, olcott wrote:
>>> On 4/26/2021 10:01 AM, Richard Damon wrote:
>>>> On 4/26/21 10:22 AM, olcott wrote:
>>>>> On 4/26/2021 7:01 AM, Malcolm McLean wrote:
>>>>>> On Monday, 26 April 2021 at 11:55:38 UTC+1, Richard Damon wrote:
>>>>>>> On 4/25/21 11:53 PM, olcott wrote:
>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>>>> that
>>>>>>>>>> every time it decides to stop simulating its input this input
>>>>>>>>>> would
>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>
>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>> ¬Halting(x))
>>>>>>>>>
>>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>>> encoded TM
>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>> Must_be_Stopped is)
>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>
>>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>>> captures what you call axioms) as a negative halt decider. Flip
>>>>>>>>> the
>>>>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>>>>> claim
>>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>>> implementation is that it gets at least an infinite number of
>>>>>>>>> cases
>>>>>>>>> wrong.
>>>>>>>>>
>>>>>>>>> Whilst you don't claim to have halt decider, you need be come
>>>>>>>>> clean
>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>>>> about.
>>>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> Halts(P, P);
>>>>>>>> }
>>>>>>>>
>>>>>>>> void H_Hat2(u32 P)
>>>>>>>> {
>>>>>>>> Simulate(P, P);
>>>>>>>> }
>>>>>>>>
>>>>>>>> void Infinite_Recursion(u32 N)
>>>>>>>> {
>>>>>>>> Infinite_Recursion(N);
>>>>>>>> }
>>>>>>>>
>>>>>>>> int main()
>>>>>>>> {
>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>>>>>>>> }
>>>>>>>>
>>>>>>>> The halt decider reports not halting on the above three
>>>>>>>> computations on
>>>>>>>> the basis that the only way that they ever stop executing is when
>>>>>>>> their
>>>>>>>> simulator stops simulating them.
>>>>>>> Except that the Halt Decider is wrong for H_Hat, because H_Hat when
>>>>>>> run
>>>>>>> as a top level Computation will Halt.
>>>>>>>
>>>>>>> It can be seen easily that Halts can't be an always right decider
>>>>>>> because it gets caught in this infinite loop of decider calls and
>>>>>>> never
>>>>>>> gets a chance to see what the routines are going to do with the
>>>>>>> answer,
>>>>>>>
>>>>>>> Since it (at least should) know that these calls to Halts are (at
>>>>>>> least
>>>>>>> supposed to) return in finite time, it needs to do something to
>>>>>>> figure
>>>>>>> out what that response would be to decide what the computation will
>>>>>>> do,
>>>>>>>
>>>>>>> It is basically, just a flawed algorithm, so is wrong. Not that
>>>>>>> bad to
>>>>>>> be wrong, since we know that Halt Deciding is a 'rigged' game,
>>>>>>> and one
>>>>>>> that can not be won.
>>>>>>>
>>>>>> Yes, the question is not "Can you build a halt decider?" or even
>>>>>> "can you
>>>>>> build an H / H_Hat pair in the relationship prescribed by Linz?".
>>>>>> It's
>>>>>> "can you change the question in some way that amounts to something
>>>>>> interesting?". However even that is very hard.
>>>>>>
>>>>>
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>> ∀y ∈ Finite_Strings
>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>
>>>>> In those cases where a partial halt decider can decide:
>>>>> UTM(x, y) = ∞ the input is non halting.
>>>>>
>>>>> void H_Hat2(u32 P)
>>>>> {
>>>>> Simulate(P, P);
>>>>> }
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> Halts(P, P);
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>> }
>>>>>
>>>>> In other words if H_Hat2() does not halt then we know
>>>>> that Halts must return not halting on H_Hat(H_Hat).
>>>>>
>>>>
>>>> Yes, H_Hat2 is infinite execution, but not H_Hat, as it calls Halts not
>>>> Simulate, and Halts, as part of its Computation used by H_Hat, will
>>>> terminate the simulation making H_Hat finite in execution.
>>>>
>>>
>>> At the point when a correct halt decider would make a correct not
>>> halting decision the computations are equivalent.
>>
>> Except they aren't. If you want to claim that Halts is the equivalent to
>> Simulate, then you have to accept that it is now non-halting on H_Hat
>> and not a decider.
>
> This halt deciding axiom is true by semantic tautology.
>
> ∀x ∈ Turing_Machine_Descriptions
> ∀y ∈ Finite_Strings
> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
But ONY with a proper definition of Must_Be_Stopped that matches the
existing definition of Halting.
>
> This logically entails that every input to the halt decider that would
> not halt if this same input was input to a simulator then we can know
> that this input to the halt decider is non halting input.
Yes, if we run Simulate(H_Hat, H_Hat) (with H_Hat still refering to your
Halts as currently defined) then we see that the Simulation so given
will come to a Halt. Thus it is NOT true that Halts must stop H_Hat.
>
> 01 void H_Hat(u32 P)
> 02 {
> 03 Halts(P, P);
> 04 }
>
> Because we know that swapping line (03) with Simulate(P,P) would be
> infinitely recursive we can know that the halt decider must decide not
> halting for line (03).
Bad Logic. By the way YOU have (erroneously) contstructed your not-quite
equivalent, you are also changing the P to the call to H_Hat. That is
bad logic.
Note, if we accept your logic, we now have proofs that H_Hat is halting
and non-halting, thus the logic system is inconsistent, and thus worthless.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-26 14:15 +0100 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <87r1ixgpa0.fsf@bsb.me.uk> |
| In reply to | #32179 |
olcott <NoOne@NoWhere.com> writes: > On 4/25/2021 3:56 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> If we hypothesize that Halts() has a correct set of axioms such that >>> every time it decides to stop simulating its input this input would >>> never otherwise halt then: >>> >>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x)) >> >> Putting aside the poetic touches (like giving Halting only an encoded TM >> and leaving the reader to guess what kind of thing Must_be_Stopped is) >> you are simply hypothesising a halt decider. >> >> The above defines Must_be_Stopped (presumably some algorithm that >> captures what you call axioms) as a negative halt decider. Flip the >> result, and you have a halt decider. You don't (I know you don't claim >> to have one). The best you can hope for from a Must_be_Stopped >> implementation is that it gets at least an infinite number of cases >> wrong. >> >> Whilst you don't claim to have halt decider, you need be come clean >> about exactly which cases you permit Must_be_Stopped to be wrong about. >> It might just be the one case you do care about. (Spoiler: it is!) > > void H_Hat(u32 P) ... Whoa! It was you that would not move on until your delightful ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x)) was understood. I asked about it in order to try to work it out. Did you see the questions? If you did not understand them, why did you not ask me for clarification. Would you like me to say again what's mysterious about it? Would you prefer to move with me simply guessing what you mean? PO: "I only want an honest dialogue." -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 09:10 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <op6dnUjPv-EDVBv9nZ2dnUU7-fGdnZ2d@giganews.com> |
| In reply to | #32190 |
On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>> every time it decides to stop simulating its input this input would
>>>> never otherwise halt then:
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>
>>> Putting aside the poetic touches (like giving Halting only an encoded TM
>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>> you are simply hypothesising a halt decider.
>>>
>>> The above defines Must_be_Stopped (presumably some algorithm that
>>> captures what you call axioms) as a negative halt decider. Flip the
>>> result, and you have a halt decider. You don't (I know you don't claim
>>> to have one). The best you can hope for from a Must_be_Stopped
>>> implementation is that it gets at least an infinite number of cases
>>> wrong.
>>>
>>> Whilst you don't claim to have halt decider, you need be come clean
>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>> It might just be the one case you do care about. (Spoiler: it is!)
>>
>> void H_Hat(u32 P) ...
>
> Whoa! It was you that would not move on until your delightful
>
> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>
> was understood. I asked about it in order to try to work it out. Did
> you see the questions? If you did not understand them, why did you not
> ask me for clarification. Would you like me to say again what's
> mysterious about it? Would you prefer to move with me simply guessing
> what you mean?
>
> PO: "I only want an honest dialogue."
>
∀x ∈ Turing_Machine_Descriptions
∀y ∈ Finite_Strings
(UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
In those cases where a partial halt decider can decide:
UTM(x, y) = ∞ the input is non halting.
void H_Hat2(u32 P)
{
Simulate(P, P);
}
void H_Hat(u32 P)
{
Halts(P, P);
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
}
In other words if H_Hat2() does not halt then we can know
that H_Hat() must return not halting.
--
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-26 09:16 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <HfudnZUNg8yGVhv9nZ2dnUU7-VnNnZ2d@giganews.com> |
| In reply to | #32193 |
On 4/26/2021 9:10 AM, olcott wrote:
> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>> every time it decides to stop simulating its input this input would
>>>>> never otherwise halt then:
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> Putting aside the poetic touches (like giving Halting only an
>>>> encoded TM
>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>> you are simply hypothesising a halt decider.
>>>>
>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>> implementation is that it gets at least an infinite number of cases
>>>> wrong.
>>>>
>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>
>>> void H_Hat(u32 P) ...
>>
>> Whoa! It was you that would not move on until your delightful
>>
>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>
>> was understood. I asked about it in order to try to work it out. Did
>> you see the questions? If you did not understand them, why did you not
>> ask me for clarification. Would you like me to say again what's
>> mysterious about it? Would you prefer to move with me simply guessing
>> what you mean?
>>
>> PO: "I only want an honest dialogue."
>>
>
> ∀x ∈ Turing_Machine_Descriptions
> ∀y ∈ Finite_Strings
> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>
> In those cases where a partial halt decider can decide:
> UTM(x, y) = ∞ the input is non halting.
>
> void H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> void H_Hat(u32 P)
> {
> Halts(P, P);
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> }
>
> In other words if H_Hat2() does not halt then we can know
Halts must return not halting on H_Hat(H_Hat).
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 08:17 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s66i0u$gfc$1@dont-email.me> |
| In reply to | #32193 |
On 2021-04-26 08:10, olcott wrote:
> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>> every time it decides to stop simulating its input this input would
>>>>> never otherwise halt then:
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> Putting aside the poetic touches (like giving Halting only an
>>>> encoded TM
>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>> you are simply hypothesising a halt decider.
>>>>
>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>> implementation is that it gets at least an infinite number of cases
>>>> wrong.
>>>>
>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>
>>> void H_Hat(u32 P) ...
>>
>> Whoa! It was you that would not move on until your delightful
>>
>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>
>> was understood. I asked about it in order to try to work it out. Did
>> you see the questions? If you did not understand them, why did you not
>> ask me for clarification. Would you like me to say again what's
>> mysterious about it? Would you prefer to move with me simply guessing
>> what you mean?
>>
>> PO: "I only want an honest dialogue."
>>
>
> ∀x ∈ Turing_Machine_Descriptions
> ∀y ∈ Finite_Strings
> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>
> In those cases where a partial halt decider can decide:
> UTM(x, y) = ∞ the input is non halting.
>
> void H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> void H_Hat(u32 P)
> {
> Halts(P, P);
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> }
>
> In other words if H_Hat2() does not halt then we can know
> that H_Hat() must return not halting.
According to your declarations, H_Hat doesn't return anything. Do you
mean Halts(H_Hat, H_Hat) must return not halting?
Why should the behaviour of your H_Hat2 tell us anything about H_Hat?
They are different functions with different behaviours.
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-26 09:25 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <qLmdnQtQ27TaUBv9nZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #32195 |
On 4/26/2021 9:17 AM, André G. Isaak wrote:
> On 2021-04-26 08:10, olcott wrote:
>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>> every time it decides to stop simulating its input this input would
>>>>>> never otherwise halt then:
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>
>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>> encoded TM
>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>> you are simply hypothesising a halt decider.
>>>>>
>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>> claim
>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>> implementation is that it gets at least an infinite number of cases
>>>>> wrong.
>>>>>
>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>> about.
>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>
>>>> void H_Hat(u32 P) ...
>>>
>>> Whoa! It was you that would not move on until your delightful
>>>
>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>
>>> was understood. I asked about it in order to try to work it out. Did
>>> you see the questions? If you did not understand them, why did you not
>>> ask me for clarification. Would you like me to say again what's
>>> mysterious about it? Would you prefer to move with me simply guessing
>>> what you mean?
>>>
>>> PO: "I only want an honest dialogue."
>>>
>>
>> ∀x ∈ Turing_Machine_Descriptions
>> ∀y ∈ Finite_Strings
>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>
>> In those cases where a partial halt decider can decide:
>> UTM(x, y) = ∞ the input is non halting.
>>
>> void H_Hat2(u32 P)
>> {
>> Simulate(P, P);
>> }
>>
>> void H_Hat(u32 P)
>> {
>> Halts(P, P);
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>> }
>>
>> In other words if H_Hat2() does not halt then we can know
>> that H_Hat() must return not halting.
>
> According to your declarations, H_Hat doesn't return anything. Do you
> mean Halts(H_Hat, H_Hat) must return not halting?
>
> Why should the behaviour of your H_Hat2 tell us anything about H_Hat?
> They are different functions with different behaviours.
>
> André
>
Because Halts() decides halting on the basis of simulation Halts() and
Simulate() are computionally equivalent up to the point where the input
demonstrates non halting behavior.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 08:42 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s66jhh$ej6$1@dont-email.me> |
| In reply to | #32198 |
On 2021-04-26 08:25, olcott wrote:
> On 4/26/2021 9:17 AM, André G. Isaak wrote:
>> On 2021-04-26 08:10, olcott wrote:
>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>> never otherwise halt then:
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>
>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>> encoded TM
>>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped
>>>>>> is)
>>>>>> you are simply hypothesising a halt decider.
>>>>>>
>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>> claim
>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>> wrong.
>>>>>>
>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>> about.
>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>
>>>>> void H_Hat(u32 P) ...
>>>>
>>>> Whoa! It was you that would not move on until your delightful
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> was understood. I asked about it in order to try to work it out. Did
>>>> you see the questions? If you did not understand them, why did you not
>>>> ask me for clarification. Would you like me to say again what's
>>>> mysterious about it? Would you prefer to move with me simply guessing
>>>> what you mean?
>>>>
>>>> PO: "I only want an honest dialogue."
>>>>
>>>
>>> ∀x ∈ Turing_Machine_Descriptions
>>> ∀y ∈ Finite_Strings
>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>
>>> In those cases where a partial halt decider can decide:
>>> UTM(x, y) = ∞ the input is non halting.
>>>
>>> void H_Hat2(u32 P)
>>> {
>>> Simulate(P, P);
>>> }
>>>
>>> void H_Hat(u32 P)
>>> {
>>> Halts(P, P);
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> }
>>>
>>> In other words if H_Hat2() does not halt then we can know
>>> that H_Hat() must return not halting.
>>
>> According to your declarations, H_Hat doesn't return anything. Do you
>> mean Halts(H_Hat, H_Hat) must return not halting?
>>
>> Why should the behaviour of your H_Hat2 tell us anything about H_Hat?
>> They are different functions with different behaviours.
>>
>> André
>>
>
> Because Halts() decides halting on the basis of simulation Halts() and
> Simulate() are computionally equivalent up to the point where the input
> demonstrates non halting behavior.
But they're *not* identical after that point, so H_Hat2 and H_Hat won't
behave the same way. The fact that H_Hat2(H_Hat2) is non-halting
provides no support for the claim that H_Hat(H_Hat) is non-halting.
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-26 09:51 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <H6Wdna4Pf-PGThv9nZ2dnUU7-IWdnZ2d@giganews.com> |
| In reply to | #32200 |
On 4/26/2021 9:42 AM, André G. Isaak wrote:
> On 2021-04-26 08:25, olcott wrote:
>> On 4/26/2021 9:17 AM, André G. Isaak wrote:
>>> On 2021-04-26 08:10, olcott wrote:
>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>> that
>>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>>> never otherwise halt then:
>>>>>>>>
>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>>
>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>> encoded TM
>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>> Must_be_Stopped is)
>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>
>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>>> claim
>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>> wrong.
>>>>>>>
>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>> about.
>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>
>>>>>> void H_Hat(u32 P) ...
>>>>>
>>>>> Whoa! It was you that would not move on until your delightful
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>
>>>>> was understood. I asked about it in order to try to work it out. Did
>>>>> you see the questions? If you did not understand them, why did you
>>>>> not
>>>>> ask me for clarification. Would you like me to say again what's
>>>>> mysterious about it? Would you prefer to move with me simply guessing
>>>>> what you mean?
>>>>>
>>>>> PO: "I only want an honest dialogue."
>>>>>
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions
>>>> ∀y ∈ Finite_Strings
>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>
>>>> In those cases where a partial halt decider can decide:
>>>> UTM(x, y) = ∞ the input is non halting.
>>>>
>>>> void H_Hat2(u32 P)
>>>> {
>>>> Simulate(P, P);
>>>> }
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> Halts(P, P);
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> }
>>>>
>>>> In other words if H_Hat2() does not halt then we can know
>>>> that H_Hat() must return not halting.
>>>
>>> According to your declarations, H_Hat doesn't return anything. Do you
>>> mean Halts(H_Hat, H_Hat) must return not halting?
>>>
>>> Why should the behaviour of your H_Hat2 tell us anything about H_Hat?
>>> They are different functions with different behaviours.
>>>
>>> André
>>>
>>
>> Because Halts() decides halting on the basis of simulation Halts() and
>> Simulate() are computionally equivalent up to the point where the
>> input demonstrates non halting behavior.
>
> But they're *not* identical after that point, so H_Hat2 and H_Hat won't
> behave the same way. The fact that H_Hat2(H_Hat2) is non-halting
> provides no support for the claim that H_Hat(H_Hat) is non-halting.
>
> André
>
At the point when a correct halting decider would make a correct not
halting decision the computations are equivalent.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 41 of 50 — ← Prev page 1 … 39 40 [41] 42 43 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web