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 2 of 50 — ← Prev page 1 [2] 3 4 … 50 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-11 07:31 -0400 |
| Subject | Re: What is a computation? (halting problem configuration) |
| Message-ID | <s6BcI.2991$ko4.2293@fx13.iad> |
| In reply to | #30758 |
On 4/10/21 10:58 PM, olcott wrote:
> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>> problem configuration.
>>
>> Still trying to hide the trick, I see. You did once tip your hand by
>> posting a code sketch of Halts so we all know what you are trying to
>> pull off, but if you want see the problem for yourself, post Halts (and
>> all the code it uses or depends on) and we'll show you what the "hat"
>> version of it really looks like.
>
> It is as obvious as a Boston Cream pie to the face that Halts() does
> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
> would not otherwise halt:
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
> If you make sure not to look at what I wrote it is infinitely less
> obvious. It really seems to me to be ridiculously stupid for anyone to
> call this any sort of trick.
>
> The source code for the halt decider itself is down to two pages. The
> x86utm operating system is many more pages. The x86 emulator is many
> many more pages.
>
Maybe it is obvious to you, but that by itself doesn't make it true.
To me it is obvioud that if Halts decides that H_Hat is non-halting and
returns that answer to the calling H_Hat, that this H_Hat will halt, and
thus show that Halts was wrong.
Other possible events include Halts just not returning an answer to
H_Hat, which if it returned an answer when asked in other conditions
just proves that Halts is not a true proper Computation, and thus can't
really be the equivalent to a Turing Machine, and thus doesn't qualify
to be put into the proof.
Thus we have that either Halts is wrong, or it doesn't meet the
requirements to be used in the first place, so in neither case is a a
correct Halt Decider.
Please note that AGAIN, you have stated the decision requirements for a
Halt Decider incorrectly. It absolutely make no difference what happens
within the simulation of the Halt Decider (if it even uses simulation),
the only thing that actually matters is what happens when we actually
run H_Hat as an actual Turing Machine (in an environment that runs
Turing Machines accurately).
I will also point out that the rule you are (mis-)using to decide that
there is an infinite recursive loop does not apply, as there IS a
conditional in the loop, within Halts, as demonstrated by the test case
of just running Halts(H_Hat, H_Hat) making a decision inside to
terminate. This is a flaw in your argument, which make it come up with
an incorrect result.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 09:56 -0500 |
| Subject | Re: What is a computation? (halting problem configuration) |
| Message-ID | <iqadnexC6qC9k-79nZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #30766 |
On 4/11/2021 6:31 AM, Richard Damon wrote:
> On 4/10/21 10:58 PM, olcott wrote:
>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>> problem configuration.
>>>
>>> Still trying to hide the trick, I see. You did once tip your hand by
>>> posting a code sketch of Halts so we all know what you are trying to
>>> pull off, but if you want see the problem for yourself, post Halts (and
>>> all the code it uses or depends on) and we'll show you what the "hat"
>>> version of it really looks like.
>>
>> It is as obvious as a Boston Cream pie to the face that Halts() does
>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>> would not otherwise halt:
>>
>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>
>>
>> If you make sure not to look at what I wrote it is infinitely less
>> obvious. It really seems to me to be ridiculously stupid for anyone to
>> call this any sort of trick.
>>
>> The source code for the halt decider itself is down to two pages. The
>> x86utm operating system is many more pages. The x86 emulator is many
>> many more pages.
>>
>
> Maybe it is obvious to you, but that by itself doesn't make it true.
>
> To me it is obvioud that if Halts decides that H_Hat is non-halting and
> returns that answer to the calling H_Hat, that this H_Hat will halt, and
> thus show that Halts was wrong.
When the halt decider is based on simulating its input it must answer
the question: Does the input program stop executing without aborting the
simulation of this input?
If a halt decider that simulates its input is answering the question:
Does the input program halt on its input?
The inputs that halt and their own and inputs that must be aborted both
halt and the halt decider knows the difference yet is prevented from
reporting this difference.
Halting can be correctly decided yet is forbidden from being reported.
This is just like the dog walking problem:
(1) You must walk you dog all the way across the street.
(2) Your dog cannot ever arrive on the other side of the street.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-11 16:20 +0100 |
| Subject | Re: What is a computation? (halting problem configuration) |
| Message-ID | <87zgy4q23y.fsf@bsb.me.uk> |
| In reply to | #30773 |
olcott <NoOne@NoWhere.com> writes: > When the halt decider is based on simulating its input it must answer > the question: Does the input program stop executing without aborting > the simulation of this input? No. A halt decider must return true, if and only if the input represents a finite computation. It must return false in every other case. (I'm using "return" generically -- the indication might be a state, are tape configuration or a particular lambda form -- whatever.) This requirement does not depend on any misguided ideas on how you might choose to fail to implement one. It's what a halt decider is. And remember, every instance of the halting problem has a correct yes/no result. Every instance either does represent a finite computation or it does not. Surely you now accept that, don't you? Remember also the theorem that tells you that no TM decides the set of numbers representing finite TM computations. > Halting can be correctly decided yet is forbidden from being reported. Incorrect use of technical terms (that's to be expected, after all you don't know what they mean) but it seems you might actually get that no TM can decide the set of numbers representing finite TM computations. I wonder if you have the intellectual courage to say one way or the other. I doubt it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-11 13:49 -0400 |
| Subject | Re: What is a computation? (halting problem configuration) |
| Message-ID | <8FGcI.4940$pn4.2091@fx38.iad> |
| In reply to | #30773 |
On 4/11/21 10:56 AM, olcott wrote: > On 4/11/2021 6:31 AM, Richard Damon wrote: >> Maybe it is obvious to you, but that by itself doesn't make it true. >> >> To me it is obvious that if Halts decides that H_Hat is non-halting and >> returns that answer to the calling H_Hat, that this H_Hat will halt, and >> thus show that Halts was wrong. > > When the halt decider is based on simulating its input it must answer > the question: Does the input program stop executing without aborting the > simulation of this input? > > If a halt decider that simulates its input is answering the question: > Does the input program halt on its input? Wrong, if it is a Halt Decider, the ONLY question that it is answering is will the machine, whose representation has been given as an input, with the input also provided as a representation, when actually run, halt in finite time or not. It might base its attempt to answer this on simulating the machine and making its decision on this simulation, but it its own responsibility to be accurate in that simulation and interpreting the results correctly. The ultimate check is ALWAY to the original machine, and some representation of it. > > The inputs that halt and their own and inputs that must be aborted both > halt and the halt decider knows the difference yet is prevented from > reporting this difference. > > Halting can be correctly decided yet is forbidden from being reported. How has it been forbiden from reporting it. It is in fact REQUIRED to report the answer, it just must be consistent in how it reports it, since with Turing Machines, a given machine with a given input will always either halt in finite time or not. > > This is just like the dog walking problem: > (1) You must walk you dog all the way across the street. > (2) Your dog cannot ever arrive on the other side of the street. > > Where in the statement of the Halting Problem is the equivalent of the not bring allowed to arrive on the other side of the street? There is an enomous difference between not being 'allowed' to answer and there not being an answer. Let me give you a very real case that hopefully you can understand, there is a class of 'Games', with two players taking moves in turns with full information, moves being fully deterministic. This includes things like Chess, Checkers, Go, Tic-Tac-Toe, Nim, etc. One common problem for games like this is to determine a strategy for the first or second player that will let them always win. By simple analysis, there can't be an answer to both of these questions for a given game, as if there is a strategy that lets the first player always win there can't be a strategy that lets the second player always win. If the game allows draws, there may not be a strategy for either to win. Tic-Tac-Toe is such a game, It is a 'small' enough game it can be fully analysized, and it can be shown that if both sides play optimally, the game will end in a draw. Nim doesn't allow draws, so there will be strategy for one of the players to allow them to always win (it depends on exactly which variant of Nim you are playing to determine which). Chess, Checkers, and the like, are big enough games that they haven't been 'solved' yet, so we don't yet know, which side, if any, has a strategy to always win (since they allow ties, there might not BE a strategy for either side. Of course, once one of those games does get 'solved' it likely will get a lot less popular as it then changes the game from skill at playing to remembering the optimal strategy.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-11 13:55 +0100 |
| Subject | Re: What is a computation? (halting problem configuration) |
| Message-ID | <87mtu5q8ty.fsf@bsb.me.uk> |
| In reply to | #30758 |
olcott <NoOne@NoWhere.com> writes:
> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>
>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>
>>>>>>
>>>>>>> The tape of a Turing Machine isn't like persistent storage. When you run
>>>>>>> a TM, the only thing initially on the tape is the input string. If you
>>>>>>> run it again, you start over with a new tape which again contains only
>>>>>>> the input string.
>>>>>> It is not running itself from the beginning it is emulating a recursive
>>>>>> function call where some data about prior calls is on the stack.
>>>>>>
>>>>> It's utterly trivial to write H if we have a flag on the tape which indicates
>>>>> whether H is invoked directly, or if it is incorporated into H_Hat. Simply
>>>>> read the flag and return it.
>>>>
>>>> Have you studied the "hat" construction? It would appear not.
>>>>
>>>> The reason this matters is that the bottom line is much simpler than all
>>>> these posts seem to suggest. PO does not have two "things"
>>>> (computations, functions, programs, whatever) that are related as they
>>>> should be. There is no problem in having more input or saved state or
>>>> extra data. All those can be permitted provided someone else constructs
>>>> the confounding computation. PO is being allowed to provide both and to
>>>> assert, as you have done, that calling something H_Hat makes it the
>>>> actual "hat" version of H.
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>
>> Malcolm was talking about Turing machines as in Linz, so I was
>> responding about Turing machines. You used to pretend you had actual
>> Turing machines, so Malcolm's remark suggests that you pull off the
>> current ruse using TMs. You can't.
>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>> problem configuration.
>>
>> Still trying to hide the trick, I see. You did once tip your hand by
>> posting a code sketch of Halts so we all know what you are trying to
>> pull off, but if you want see the problem for yourself, post Halts (and
>> all the code it uses or depends on) and we'll show you what the "hat"
>> version of it really looks like.
>
> It is as obvious as a Boston Cream pie to the face that Halts() does
> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
> would not otherwise halt:
Nothing about code you won't publish is obvious. Publish it, and we'll
show you the proper hat construction. Keep it hidden and you can get a
few more years of empty boasting out if it.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 09:43 -0500 |
| Subject | Re: What is a computation? (over Ben's head) |
| Message-ID | <yKSdneFMVbtgl-79nZ2dnUU7-aPNnZ2d@giganews.com> |
| In reply to | #30768 |
On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>
>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>
>>>>>>>
>>>>>>>> The tape of a Turing Machine isn't like persistent storage. When you run
>>>>>>>> a TM, the only thing initially on the tape is the input string. If you
>>>>>>>> run it again, you start over with a new tape which again contains only
>>>>>>>> the input string.
>>>>>>> It is not running itself from the beginning it is emulating a recursive
>>>>>>> function call where some data about prior calls is on the stack.
>>>>>>>
>>>>>> It's utterly trivial to write H if we have a flag on the tape which indicates
>>>>>> whether H is invoked directly, or if it is incorporated into H_Hat. Simply
>>>>>> read the flag and return it.
>>>>>
>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>
>>>>> The reason this matters is that the bottom line is much simpler than all
>>>>> these posts seem to suggest. PO does not have two "things"
>>>>> (computations, functions, programs, whatever) that are related as they
>>>>> should be. There is no problem in having more input or saved state or
>>>>> extra data. All those can be permitted provided someone else constructs
>>>>> the confounding computation. PO is being allowed to provide both and to
>>>>> assert, as you have done, that calling something H_Hat makes it the
>>>>> actual "hat" version of H.
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>
>>> Malcolm was talking about Turing machines as in Linz, so I was
>>> responding about Turing machines. You used to pretend you had actual
>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>> current ruse using TMs. You can't.
>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>> problem configuration.
>>>
>>> Still trying to hide the trick, I see. You did once tip your hand by
>>> posting a code sketch of Halts so we all know what you are trying to
>>> pull off, but if you want see the problem for yourself, post Halts (and
>>> all the code it uses or depends on) and we'll show you what the "hat"
>>> version of it really looks like.
>>
>> It is as obvious as a Boston Cream pie to the face that Halts() does
>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>> would not otherwise halt:
>
> Nothing about code you won't publish is obvious. Publish it, and we'll
> show you the proper hat construction. Keep it hidden and you can get a
> few more years of empty boasting out if it.
>
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
The fact that on line 22 of the execution trace it can be verified that
H_Hat() has called Halts() twice from the same machine address with the
same data having no conditional branch instructions inbetween proves
that H_Hat() meets the halt deciding criteria.
The halt deciding criteria is:
Does the simulation of the input have to be aborted to prevent its
otherwise infinite execution?
At this point Halts() knows that it must stop simulating H_Hat() to
prevent infinite recursion.
I am estimating that the reason that you have not actually ever
critiqued the details of this is that these details are simply over your
head.
--
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-11 13:52 -0400 |
| Subject | Re: What is a computation? (over Ben's head) |
| Message-ID | <kHGcI.5897$0u4.5408@fx43.iad> |
| In reply to | #30772 |
On 4/11/21 10:43 AM, olcott wrote:
> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>
>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>
>>>>>>>>
>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>> When you run
>>>>>>>>> a TM, the only thing initially on the tape is the input string.
>>>>>>>>> If you
>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>> contains only
>>>>>>>>> the input string.
>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>> recursive
>>>>>>>> function call where some data about prior calls is on the stack.
>>>>>>>>
>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>> which indicates
>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>> H_Hat. Simply
>>>>>>> read the flag and return it.
>>>>>>
>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>
>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>> than all
>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>> they
>>>>>> should be. There is no problem in having more input or saved
>>>>>> state or
>>>>>> extra data. All those can be permitted provided someone else
>>>>>> constructs
>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>> and to
>>>>>> assert, as you have done, that calling something H_Hat makes it the
>>>>>> actual "hat" version of H.
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>> if (Input_Would_Halt)
>>>>> HERE: goto HERE;
>>>>> }
>>>>
>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>> responding about Turing machines. You used to pretend you had actual
>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>> current ruse using TMs. You can't.
>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>>> problem configuration.
>>>>
>>>> Still trying to hide the trick, I see. You did once tip your hand by
>>>> posting a code sketch of Halts so we all know what you are trying to
>>>> pull off, but if you want see the problem for yourself, post Halts (and
>>>> all the code it uses or depends on) and we'll show you what the "hat"
>>>> version of it really looks like.
>>>
>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>>> would not otherwise halt:
>>
>> Nothing about code you won't publish is obvious. Publish it, and we'll
>> show you the proper hat construction. Keep it hidden and you can get a
>> few more years of empty boasting out if it.
>>
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
> The fact that on line 22 of the execution trace it can be verified that
> H_Hat() has called Halts() twice from the same machine address with the
> same data having no conditional branch instructions inbetween proves
> that H_Hat() meets the halt deciding criteria.
Except that other traces have shown that there MUST be some form of
conditional execution within the set of code that has been skipped over,
so that rule is not applicable. There is no version of that rule that
allows you to skip some conditions.
Thus the decsion was made by faulty logic, which is how it could be wrong.
>
> The halt deciding criteria is:
> Does the simulation of the input have to be aborted to prevent its
> otherwise infinite execution?
>
> At this point Halts() knows that it must stop simulating H_Hat() to
> prevent infinite recursion.
>
> I am estimating that the reason that you have not actually ever
> critiqued the details of this is that these details are simply over your
> head.
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 13:08 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <v-OdnUB1o6-Kpu79nZ2dnUU7-XHNnZ2d@giganews.com> |
| In reply to | #30779 |
On 4/11/2021 12:52 PM, Richard Damon wrote:
> On 4/11/21 10:43 AM, olcott wrote:
>> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>>
>>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>>> When you run
>>>>>>>>>> a TM, the only thing initially on the tape is the input string.
>>>>>>>>>> If you
>>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>>> contains only
>>>>>>>>>> the input string.
>>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>>> recursive
>>>>>>>>> function call where some data about prior calls is on the stack.
>>>>>>>>>
>>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>>> which indicates
>>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>>> H_Hat. Simply
>>>>>>>> read the flag and return it.
>>>>>>>
>>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>>
>>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>>> than all
>>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>>> they
>>>>>>> should be. There is no problem in having more input or saved
>>>>>>> state or
>>>>>>> extra data. All those can be permitted provided someone else
>>>>>>> constructs
>>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>>> and to
>>>>>>> assert, as you have done, that calling something H_Hat makes it the
>>>>>>> actual "hat" version of H.
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>> if (Input_Would_Halt)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>
>>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>>> responding about Turing machines. You used to pretend you had actual
>>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>>> current ruse using TMs. You can't.
>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>> }
>>>>>>
>>>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>>>> problem configuration.
>>>>>
>>>>> Still trying to hide the trick, I see. You did once tip your hand by
>>>>> posting a code sketch of Halts so we all know what you are trying to
>>>>> pull off, but if you want see the problem for yourself, post Halts (and
>>>>> all the code it uses or depends on) and we'll show you what the "hat"
>>>>> version of it really looks like.
>>>>
>>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>>>> would not otherwise halt:
>>>
>>> Nothing about code you won't publish is obvious. Publish it, and we'll
>>> show you the proper hat construction. Keep it hidden and you can get a
>>> few more years of empty boasting out if it.
>>>
>>
>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>
>>
>> The fact that on line 22 of the execution trace it can be verified that
>> H_Hat() has called Halts() twice from the same machine address with the
>> same data having no conditional branch instructions inbetween proves
>> that H_Hat() meets the halt deciding criteria.
>
> Except that other traces have shown that there MUST be some form of
> conditional execution within the set of code that has been skipped over,
> so that rule is not applicable. There is no version of that rule that
> allows you to skip some conditions.
>
> Thus the decsion was made by faulty logic, which is how it could be wrong.
>
That a halt decider based on simulating its input determines whether or
not its input would halt IF ITS SIMULATION WAS NOT STOPPED, is over your
head.
Every halt decider that makes its halting decision on the basis of
whether or not its input would halt IF ITS SIMULATION WAS NOT STOPPED,
would decide that some simulations must be forced to stop and other
simulations need not be forced to stop.
Since every input either halts on its own or is forced to halt by the
halt decider all of the inputs halt. To force such a halt decider to
only report whether or not the input halts instead of whether or not
this input had to be forced to stop is to simply muzzle an otherwise
correct halt decider (A totally numbskull idea).
>>
>> The halt deciding criteria is:
>> Does the simulation of the input have to be aborted to prevent its
>> otherwise infinite execution?
>>
>> At this point Halts() knows that it must stop simulating H_Hat() to
>> prevent infinite recursion.
>>
>> I am estimating that the reason that you have not actually ever
>> critiqued the details of this is that these details are simply over your
>> head.
>>
>>
>
--
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-11 16:47 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <wfJcI.1746$NU5.23@fx10.iad> |
| In reply to | #30780 |
On 4/11/21 2:08 PM, olcott wrote:
> On 4/11/2021 12:52 PM, Richard Damon wrote:
>> On 4/11/21 10:43 AM, olcott wrote:
>>> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>>>
>>>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>>>> When you run
>>>>>>>>>>> a TM, the only thing initially on the tape is the input string.
>>>>>>>>>>> If you
>>>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>>>> contains only
>>>>>>>>>>> the input string.
>>>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>>>> recursive
>>>>>>>>>> function call where some data about prior calls is on the stack.
>>>>>>>>>>
>>>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>>>> which indicates
>>>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>>>> H_Hat. Simply
>>>>>>>>> read the flag and return it.
>>>>>>>>
>>>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>>>
>>>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>>>> than all
>>>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>>>> they
>>>>>>>> should be. There is no problem in having more input or saved
>>>>>>>> state or
>>>>>>>> extra data. All those can be permitted provided someone else
>>>>>>>> constructs
>>>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>>>> and to
>>>>>>>> assert, as you have done, that calling something H_Hat makes it the
>>>>>>>> actual "hat" version of H.
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>>> if (Input_Would_Halt)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>
>>>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>>>> responding about Turing machines. You used to pretend you had actual
>>>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>>>> current ruse using TMs. You can't.
>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>> }
>>>>>>>
>>>>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>>>>> problem configuration.
>>>>>>
>>>>>> Still trying to hide the trick, I see. You did once tip your hand by
>>>>>> posting a code sketch of Halts so we all know what you are trying to
>>>>>> pull off, but if you want see the problem for yourself, post Halts
>>>>>> (and
>>>>>> all the code it uses or depends on) and we'll show you what the "hat"
>>>>>> version of it really looks like.
>>>>>
>>>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>>>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>>>>> would not otherwise halt:
>>>>
>>>> Nothing about code you won't publish is obvious. Publish it, and we'll
>>>> show you the proper hat construction. Keep it hidden and you can get a
>>>> few more years of empty boasting out if it.
>>>>
>>>
>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>
>>>
>>>
>>> The fact that on line 22 of the execution trace it can be verified that
>>> H_Hat() has called Halts() twice from the same machine address with the
>>> same data having no conditional branch instructions inbetween proves
>>> that H_Hat() meets the halt deciding criteria.
>>
>> Except that other traces have shown that there MUST be some form of
>> conditional execution within the set of code that has been skipped over,
>> so that rule is not applicable. There is no version of that rule that
>> allows you to skip some conditions.
>>
>> Thus the decsion was made by faulty logic, which is how it could be
>> wrong.
>>
>
> That a halt decider based on simulating its input determines whether or
> not its input would halt IF ITS SIMULATION WAS NOT STOPPED, is over your
> head.
That the Halting Problem question is what does would the ACTUAL machine
do seems to be over YOUR head.
To change your analogy, it would be like trying to solve the walk your
dog to the park across the street, but you mommy won't let you cross the
street alone, so you can't do the problem.
>
> Every halt decider that makes its halting decision on the basis of
> whether or not its input would halt IF ITS SIMULATION WAS NOT STOPPED,
> would decide that some simulations must be forced to stop and other
> simulations need not be forced to stop.
And, if that answer differs from what the Turing Machine would actually
do if it was run, they would be wrong.
>
> Since every input either halts on its own or is forced to halt by the
> halt decider all of the inputs halt. To force such a halt decider to
> only report whether or not the input halts instead of whether or not
> this input had to be forced to stop is to simply muzzle an otherwise
> correct halt decider (A totally numbskull idea).
>
Who says they are forced to only report when the input halts. The key is
that if the simulator decided that it needed to abort the simulation,
but when we actually DO run the actual machine, it does halt, then the
simulator was WRONG.
It doesn't matter that it can 'prove' that it needed to, the fact that
the behavior was different says its proof was wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 16:03 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <kKSdnZPHsMOU-e79nZ2dnUU7-c_NnZ2d@giganews.com> |
| In reply to | #30784 |
On 4/11/2021 3:47 PM, Richard Damon wrote:
> On 4/11/21 2:08 PM, olcott wrote:
>> On 4/11/2021 12:52 PM, Richard Damon wrote:
>>> On 4/11/21 10:43 AM, olcott wrote:
>>>> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>>>>
>>>>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>>>>> When you run
>>>>>>>>>>>> a TM, the only thing initially on the tape is the input string.
>>>>>>>>>>>> If you
>>>>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>>>>> contains only
>>>>>>>>>>>> the input string.
>>>>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>>>>> recursive
>>>>>>>>>>> function call where some data about prior calls is on the stack.
>>>>>>>>>>>
>>>>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>>>>> which indicates
>>>>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>>>>> H_Hat. Simply
>>>>>>>>>> read the flag and return it.
>>>>>>>>>
>>>>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>>>>
>>>>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>>>>> than all
>>>>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>>>>> they
>>>>>>>>> should be. There is no problem in having more input or saved
>>>>>>>>> state or
>>>>>>>>> extra data. All those can be permitted provided someone else
>>>>>>>>> constructs
>>>>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>>>>> and to
>>>>>>>>> assert, as you have done, that calling something H_Hat makes it the
>>>>>>>>> actual "hat" version of H.
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>>>> if (Input_Would_Halt)
>>>>>>>> HERE: goto HERE;
>>>>>>>> }
>>>>>>>
>>>>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>>>>> responding about Turing machines. You used to pretend you had actual
>>>>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>>>>> current ruse using TMs. You can't.
>>>>>>>
>>>>>>>> int main()
>>>>>>>> {
>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>>> }
>>>>>>>>
>>>>>>>> The fact that no matter what value Halts() returns to H_Hat() is the
>>>>>>>> wrong answer proves that Halts() and H_Hat() are in the key halting
>>>>>>>> problem configuration.
>>>>>>>
>>>>>>> Still trying to hide the trick, I see. You did once tip your hand by
>>>>>>> posting a code sketch of Halts so we all know what you are trying to
>>>>>>> pull off, but if you want see the problem for yourself, post Halts
>>>>>>> (and
>>>>>>> all the code it uses or depends on) and we'll show you what the "hat"
>>>>>>> version of it really looks like.
>>>>>>
>>>>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>>>>> correctly decide to stop simulating H_Hat() on the basis that H_Hat()
>>>>>> would not otherwise halt:
>>>>>
>>>>> Nothing about code you won't publish is obvious. Publish it, and we'll
>>>>> show you the proper hat construction. Keep it hidden and you can get a
>>>>> few more years of empty boasting out if it.
>>>>>
>>>>
>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>
>>>>
>>>>
>>>> The fact that on line 22 of the execution trace it can be verified that
>>>> H_Hat() has called Halts() twice from the same machine address with the
>>>> same data having no conditional branch instructions inbetween proves
>>>> that H_Hat() meets the halt deciding criteria.
>>>
>>> Except that other traces have shown that there MUST be some form of
>>> conditional execution within the set of code that has been skipped over,
>>> so that rule is not applicable. There is no version of that rule that
>>> allows you to skip some conditions.
>>>
>>> Thus the decsion was made by faulty logic, which is how it could be
>>> wrong.
>>>
>>
>> That a halt decider based on simulating its input determines whether or
>> not its input would halt IF ITS SIMULATION WAS NOT STOPPED, is over your
>> head.
>
> That the Halting Problem question is what does would the ACTUAL machine
> do seems to be over YOUR head.
>
> To change your analogy, it would be like trying to solve the walk your
> dog to the park across the street, but you mommy won't let you cross the
> street alone, so you can't do the problem.
>
>>
>> Every halt decider that makes its halting decision on the basis of
>> whether or not its input would halt IF ITS SIMULATION WAS NOT STOPPED,
>> would decide that some simulations must be forced to stop and other
>> simulations need not be forced to stop.
>
> And, if that answer differs from what the Turing Machine would actually
> do if it was run, they would be wrong.
>>
>> Since every input either halts on its own or is forced to halt by the
>> halt decider all of the inputs halt. To force such a halt decider to
>> only report whether or not the input halts instead of whether or not
>> this input had to be forced to stop is to simply muzzle an otherwise
>> correct halt decider (A totally numbskull idea).
>>
>
> Who says they are forced to only report when the input halts. The key is
> that if the simulator decided that it needed to abort the simulation,
> but when we actually DO run the actual machine, it does halt, then the
> simulator was WRONG.
The only reason that H_Hat() ever halts is that Halts() stops simulating
it. If Halts() never stops simulating H_Hat() then H_Hat() never stops.
The ONLY reason why H_Hat() halts is that Halts() stops simulating it:
int main()
{
H_Hat(H_Hat, H_Hat);
}
If Halts() did not stop simulating the above H_Hat() then it would never
halt.
> It doesn't matter that it can 'prove' that it needed to, the fact that
> the behavior was different says its proof was wrong.
--
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-11 17:35 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <lYJcI.1001$Es.373@fx26.iad> |
| In reply to | #30785 |
On 4/11/21 5:03 PM, olcott wrote:
> On 4/11/2021 3:47 PM, Richard Damon wrote:
>> On 4/11/21 2:08 PM, olcott wrote:
>>> On 4/11/2021 12:52 PM, Richard Damon wrote:
>>>> On 4/11/21 10:43 AM, olcott wrote:
>>>>> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>>>>>> When you run
>>>>>>>>>>>>> a TM, the only thing initially on the tape is the input
>>>>>>>>>>>>> string.
>>>>>>>>>>>>> If you
>>>>>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>>>>>> contains only
>>>>>>>>>>>>> the input string.
>>>>>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>>>>>> recursive
>>>>>>>>>>>> function call where some data about prior calls is on the
>>>>>>>>>>>> stack.
>>>>>>>>>>>>
>>>>>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>>>>>> which indicates
>>>>>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>>>>>> H_Hat. Simply
>>>>>>>>>>> read the flag and return it.
>>>>>>>>>>
>>>>>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>>>>>
>>>>>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>>>>>> than all
>>>>>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>>>>>> they
>>>>>>>>>> should be. There is no problem in having more input or saved
>>>>>>>>>> state or
>>>>>>>>>> extra data. All those can be permitted provided someone else
>>>>>>>>>> constructs
>>>>>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>>>>>> and to
>>>>>>>>>> assert, as you have done, that calling something H_Hat makes
>>>>>>>>>> it the
>>>>>>>>>> actual "hat" version of H.
>>>>>>>>>
>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>> {
>>>>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>>>>> if (Input_Would_Halt)
>>>>>>>>> HERE: goto HERE;
>>>>>>>>> }
>>>>>>>>
>>>>>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>>>>>> responding about Turing machines. You used to pretend you had
>>>>>>>> actual
>>>>>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>>>>>> current ruse using TMs. You can't.
>>>>>>>>
>>>>>>>>> int main()
>>>>>>>>> {
>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> The fact that no matter what value Halts() returns to H_Hat()
>>>>>>>>> is the
>>>>>>>>> wrong answer proves that Halts() and H_Hat() are in the key
>>>>>>>>> halting
>>>>>>>>> problem configuration.
>>>>>>>>
>>>>>>>> Still trying to hide the trick, I see. You did once tip your
>>>>>>>> hand by
>>>>>>>> posting a code sketch of Halts so we all know what you are
>>>>>>>> trying to
>>>>>>>> pull off, but if you want see the problem for yourself, post Halts
>>>>>>>> (and
>>>>>>>> all the code it uses or depends on) and we'll show you what the
>>>>>>>> "hat"
>>>>>>>> version of it really looks like.
>>>>>>>
>>>>>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>>>>>> correctly decide to stop simulating H_Hat() on the basis that
>>>>>>> H_Hat()
>>>>>>> would not otherwise halt:
>>>>>>
>>>>>> Nothing about code you won't publish is obvious. Publish it, and
>>>>>> we'll
>>>>>> show you the proper hat construction. Keep it hidden and you can
>>>>>> get a
>>>>>> few more years of empty boasting out if it.
>>>>>>
>>>>>
>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> The fact that on line 22 of the execution trace it can be verified
>>>>> that
>>>>> H_Hat() has called Halts() twice from the same machine address with
>>>>> the
>>>>> same data having no conditional branch instructions inbetween proves
>>>>> that H_Hat() meets the halt deciding criteria.
>>>>
>>>> Except that other traces have shown that there MUST be some form of
>>>> conditional execution within the set of code that has been skipped
>>>> over,
>>>> so that rule is not applicable. There is no version of that rule that
>>>> allows you to skip some conditions.
>>>>
>>>> Thus the decsion was made by faulty logic, which is how it could be
>>>> wrong.
>>>>
>>>
>>> That a halt decider based on simulating its input determines whether or
>>> not its input would halt IF ITS SIMULATION WAS NOT STOPPED, is over your
>>> head.
>>
>> That the Halting Problem question is what does would the ACTUAL machine
>> do seems to be over YOUR head.
>>
>> To change your analogy, it would be like trying to solve the walk your
>> dog to the park across the street, but you mommy won't let you cross the
>> street alone, so you can't do the problem.
>>
>>>
>>> Every halt decider that makes its halting decision on the basis of
>>> whether or not its input would halt IF ITS SIMULATION WAS NOT STOPPED,
>>> would decide that some simulations must be forced to stop and other
>>> simulations need not be forced to stop.
>>
>> And, if that answer differs from what the Turing Machine would actually
>> do if it was run, they would be wrong.
>>>
>>> Since every input either halts on its own or is forced to halt by the
>>> halt decider all of the inputs halt. To force such a halt decider to
>>> only report whether or not the input halts instead of whether or not
>>> this input had to be forced to stop is to simply muzzle an otherwise
>>> correct halt decider (A totally numbskull idea).
>>>
>>
>> Who says they are forced to only report when the input halts. The key is
>> that if the simulator decided that it needed to abort the simulation,
>> but when we actually DO run the actual machine, it does halt, then the
>> simulator was WRONG.
>
> The only reason that H_Hat() ever halts is that Halts() stops simulating
> it. If Halts() never stops simulating H_Hat() then H_Hat() never stops.
But the top level H_Hat DOES halt, even if Halts doesn't 'abort' that
copy (because it isn't allowed to since it is outside Halts). Thus, it
does Halt.
>
> The ONLY reason why H_Hat() halts is that Halts() stops simulating it:
>
> int main()
> {
> H_Hat(H_Hat, H_Hat);
I Presume you mean H_Hat(H_Hat)
> }
>
> If Halts() did not stop simulating the above H_Hat() then it would never
> hal
The above H_Hat is NOT being simulated (or it shouldn't be if you system
is really a UTM). It calls Halts(H_Hat, H_Hat). We know that given a
main()
{
Halts(H_Hat, H_Hat);
}
will finish and return non-halting, thus if Halts meets the requirements
of a Computation, it MUST return non-Halting to the above H_Hat, and
then the above H_Hat will halt. Thus, if your hidden Halts outside main
decides that this top level call in non-Halting, it must be wrong.
This is your problem. You have built a 'UTM' system that isn't really a
UTM, but a non-Turing complete execution environment.
Actually the fact that we can 'prove' that H_Hat must be non-Halting and
Halting, says that you logic system has gone inconsistent and NOTHING
'proven' in it is usable, as ANYTHING can be proved in it with the right
argument.
To disprove this statement you must actually show an error in the logic
of one of the contradictory proofs (not just that you can prove the
other side). If you can't show exactly where I made a logical error in
my analysis (and not just that you can show the opposite) you have NO
argument against the claim that you system is inconsistent.
Perhaps you should study a bit more about the issue of the stance that
all Truth is Provable and the inconsistent logic system that can come
from that. It is a decent logic basis for First Order Logic, but it can
not handle logic that needs to handle mathematics, as that gets into
second order logics, which can easily get the system inconsistent.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 17:10 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <05GdnR0qbMdT7u79nZ2dnUU7-d_NnZ2d@giganews.com> |
| In reply to | #30786 |
On 4/11/2021 4:35 PM, Richard Damon wrote:
> On 4/11/21 5:03 PM, olcott wrote:
>> On 4/11/2021 3:47 PM, Richard Damon wrote:
>>> On 4/11/21 2:08 PM, olcott wrote:
>>>> On 4/11/2021 12:52 PM, Richard Damon wrote:
>>>>> On 4/11/21 10:43 AM, olcott wrote:
>>>>>> On 4/11/2021 7:55 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 4/10/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 4/10/2021 8:04 PM, Ben Bacarisse wrote:
>>>>>>>>>>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On Saturday, 10 April 2021 at 22:10:23 UTC+1, olcott wrote:
>>>>>>>>>>>>> On 4/10/2021 3:42 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>>> The tape of a Turing Machine isn't like persistent storage.
>>>>>>>>>>>>>> When you run
>>>>>>>>>>>>>> a TM, the only thing initially on the tape is the input
>>>>>>>>>>>>>> string.
>>>>>>>>>>>>>> If you
>>>>>>>>>>>>>> run it again, you start over with a new tape which again
>>>>>>>>>>>>>> contains only
>>>>>>>>>>>>>> the input string.
>>>>>>>>>>>>> It is not running itself from the beginning it is emulating a
>>>>>>>>>>>>> recursive
>>>>>>>>>>>>> function call where some data about prior calls is on the
>>>>>>>>>>>>> stack.
>>>>>>>>>>>>>
>>>>>>>>>>>> It's utterly trivial to write H if we have a flag on the tape
>>>>>>>>>>>> which indicates
>>>>>>>>>>>> whether H is invoked directly, or if it is incorporated into
>>>>>>>>>>>> H_Hat. Simply
>>>>>>>>>>>> read the flag and return it.
>>>>>>>>>>>
>>>>>>>>>>> Have you studied the "hat" construction? It would appear not.
>>>>>>>>>>>
>>>>>>>>>>> The reason this matters is that the bottom line is much simpler
>>>>>>>>>>> than all
>>>>>>>>>>> these posts seem to suggest. PO does not have two "things"
>>>>>>>>>>> (computations, functions, programs, whatever) that are related as
>>>>>>>>>>> they
>>>>>>>>>>> should be. There is no problem in having more input or saved
>>>>>>>>>>> state or
>>>>>>>>>>> extra data. All those can be permitted provided someone else
>>>>>>>>>>> constructs
>>>>>>>>>>> the confounding computation. PO is being allowed to provide both
>>>>>>>>>>> and to
>>>>>>>>>>> assert, as you have done, that calling something H_Hat makes
>>>>>>>>>>> it the
>>>>>>>>>>> actual "hat" version of H.
>>>>>>>>>>
>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>>>>>>> if (Input_Would_Halt)
>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> Malcolm was talking about Turing machines as in Linz, so I was
>>>>>>>>> responding about Turing machines. You used to pretend you had
>>>>>>>>> actual
>>>>>>>>> Turing machines, so Malcolm's remark suggests that you pull off the
>>>>>>>>> current ruse using TMs. You can't.
>>>>>>>>>
>>>>>>>>>> int main()
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> The fact that no matter what value Halts() returns to H_Hat()
>>>>>>>>>> is the
>>>>>>>>>> wrong answer proves that Halts() and H_Hat() are in the key
>>>>>>>>>> halting
>>>>>>>>>> problem configuration.
>>>>>>>>>
>>>>>>>>> Still trying to hide the trick, I see. You did once tip your
>>>>>>>>> hand by
>>>>>>>>> posting a code sketch of Halts so we all know what you are
>>>>>>>>> trying to
>>>>>>>>> pull off, but if you want see the problem for yourself, post Halts
>>>>>>>>> (and
>>>>>>>>> all the code it uses or depends on) and we'll show you what the
>>>>>>>>> "hat"
>>>>>>>>> version of it really looks like.
>>>>>>>>
>>>>>>>> It is as obvious as a Boston Cream pie to the face that Halts() does
>>>>>>>> correctly decide to stop simulating H_Hat() on the basis that
>>>>>>>> H_Hat()
>>>>>>>> would not otherwise halt:
>>>>>>>
>>>>>>> Nothing about code you won't publish is obvious. Publish it, and
>>>>>>> we'll
>>>>>>> show you the proper hat construction. Keep it hidden and you can
>>>>>>> get a
>>>>>>> few more years of empty boasting out if it.
>>>>>>>
>>>>>>
>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> The fact that on line 22 of the execution trace it can be verified
>>>>>> that
>>>>>> H_Hat() has called Halts() twice from the same machine address with
>>>>>> the
>>>>>> same data having no conditional branch instructions inbetween proves
>>>>>> that H_Hat() meets the halt deciding criteria.
>>>>>
>>>>> Except that other traces have shown that there MUST be some form of
>>>>> conditional execution within the set of code that has been skipped
>>>>> over,
>>>>> so that rule is not applicable. There is no version of that rule that
>>>>> allows you to skip some conditions.
>>>>>
>>>>> Thus the decsion was made by faulty logic, which is how it could be
>>>>> wrong.
>>>>>
>>>>
>>>> That a halt decider based on simulating its input determines whether or
>>>> not its input would halt IF ITS SIMULATION WAS NOT STOPPED, is over your
>>>> head.
>>>
>>> That the Halting Problem question is what does would the ACTUAL machine
>>> do seems to be over YOUR head.
>>>
>>> To change your analogy, it would be like trying to solve the walk your
>>> dog to the park across the street, but you mommy won't let you cross the
>>> street alone, so you can't do the problem.
>>>
>>>>
>>>> Every halt decider that makes its halting decision on the basis of
>>>> whether or not its input would halt IF ITS SIMULATION WAS NOT STOPPED,
>>>> would decide that some simulations must be forced to stop and other
>>>> simulations need not be forced to stop.
>>>
>>> And, if that answer differs from what the Turing Machine would actually
>>> do if it was run, they would be wrong.
>>>>
>>>> Since every input either halts on its own or is forced to halt by the
>>>> halt decider all of the inputs halt. To force such a halt decider to
>>>> only report whether or not the input halts instead of whether or not
>>>> this input had to be forced to stop is to simply muzzle an otherwise
>>>> correct halt decider (A totally numbskull idea).
>>>>
>>>
>>> Who says they are forced to only report when the input halts. The key is
>>> that if the simulator decided that it needed to abort the simulation,
>>> but when we actually DO run the actual machine, it does halt, then the
>>> simulator was WRONG.
>>
>> The only reason that H_Hat() ever halts is that Halts() stops simulating
>> it. If Halts() never stops simulating H_Hat() then H_Hat() never stops.
>
> But the top level H_Hat DOES halt, even if Halts doesn't 'abort' that
> copy (because it isn't allowed to since it is outside Halts). Thus, it
> does Halt.
>>
>> The ONLY reason why H_Hat() halts is that Halts() stops simulating it:
>>
>> int main()
>> {
>> H_Hat(H_Hat, H_Hat);
>
> I Presume you mean H_Hat(H_Hat)
>
>> }
>>
>> If Halts() did not stop simulating the above H_Hat() then it would never
>> hal
>
> The above H_Hat is NOT being simulated (or it shouldn't be if you system
> is really a UTM). It calls Halts(H_Hat, H_Hat). We know that given a
>
> main()
> {
> Halts(H_Hat, H_Hat);
> }
>
> will finish and return non-halting, thus if Halts meets the requirements
> of a Computation, it MUST return non-Halting to the above H_Hat, and
> then the above H_Hat will halt. Thus, if your hidden Halts outside main
> decides that this top level call in non-Halting, it must be wrong.
http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf
If the Linz H is based on simulating its input then the Linz H^ will
copy its input then simulate this input which will
copy its input then simulate this input which will
copy its input then simulate this input ...
until the Linz H has seen enough of this infinitely repeating pattern to
stop simulating H^.
As soon as the Linz H stops simulating H^ it stops running.
--
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-11 18:19 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <0CKcI.62392$FV2.4093@fx47.iad> |
| In reply to | #30787 |
On 4/11/21 6:10 PM, olcott wrote:
> On 4/11/2021 4:35 PM, Richard Damon wrote:
>> The above H_Hat is NOT being simulated (or it shouldn't be if you system
>> is really a UTM). It calls Halts(H_Hat, H_Hat). We know that given a
>>
>> main()
>> {
>> Halts(H_Hat, H_Hat);
>> }
>>
>> will finish and return non-halting, thus if Halts meets the requirements
>> of a Computation, it MUST return non-Halting to the above H_Hat, and
>> then the above H_Hat will halt. Thus, if your hidden Halts outside main
>> decides that this top level call in non-Halting, it must be wrong.
>
> http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf
>
> If the Linz H is based on simulating its input then the Linz H^ will
> copy its input then simulate this input which will
> copy its input then simulate this input which will
> copy its input then simulate this input ...
>
> until the Linz H has seen enough of this infinitely repeating pattern to
> stop simulating H^.
>
> As soon as the Linz H stops simulating H^ it stops running.
>
>
Which means that the Simulator will stop the SIMULATED H^, and return
the answer to the outer H^, which will halt, showing the answer wrong.
You keep getting all the levels of execution mixed up.
H can NOT affect the execution of the machine outside itself (its
caller) without failing at being a decider and not answering.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 17:45 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <HqKdnQzCQfly5u79nZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #30788 |
On 4/11/2021 5:19 PM, Richard Damon wrote:
> On 4/11/21 6:10 PM, olcott wrote:
>> On 4/11/2021 4:35 PM, Richard Damon wrote:
>
>>> The above H_Hat is NOT being simulated (or it shouldn't be if you system
>>> is really a UTM). It calls Halts(H_Hat, H_Hat). We know that given a
>>>
>>> main()
>>> {
>>> Halts(H_Hat, H_Hat);
>>> }
>>>
>>> will finish and return non-halting, thus if Halts meets the requirements
>>> of a Computation, it MUST return non-Halting to the above H_Hat, and
>>> then the above H_Hat will halt. Thus, if your hidden Halts outside main
>>> decides that this top level call in non-Halting, it must be wrong.
>>
>> http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf
>>
>> If the Linz H is based on simulating its input then the Linz H^ will
>> copy its input then simulate this input which will
>> copy its input then simulate this input which will
>> copy its input then simulate this input ...
>>
>> until the Linz H has seen enough of this infinitely repeating pattern to
>> stop simulating H^.
>>
>> As soon as the Linz H stops simulating H^ it stops running.
>>
>>
>
> Which means that the Simulator will stop the SIMULATED H^, and return
> the answer to the outer H^, which will halt, showing the answer wrong.
You continue to show profound software engineering stupidity.
There is never any case where a function called in infinite recursion
ever returns any result to its caller.
If the infinite recursion is terminated then the caller is terminated
and there is no caller to return a value to.
When a UTM X simulates UTM Y that infinitely simulates itself when UTM Y
is terminated by UTM X then UTM X cannot return any value to UTM Y.
>
> You keep getting all the levels of execution mixed up.
>
> H can NOT affect the execution of the machine outside itself (its
> caller) without failing at being a decider and not answering.
>
H is simulating H^
which copies its input (itself) and then simulates this copy
which copies its input (itself) and then simulates this copy
which copies its input (itself) and then simulates this copy...
--
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-11 22:40 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <IqOcI.6739$fw7.1953@fx21.iad> |
| In reply to | #30789 |
On 4/11/21 6:45 PM, olcott wrote: > On 4/11/2021 5:19 PM, Richard Damon wrote: >> >> Which means that the Simulator will stop the SIMULATED H^, and return >> the answer to the outer H^, which will halt, showing the answer wrong. > > You continue to show profound software engineering stupidity. > > There is never any case where a function called in infinite recursion > ever returns any result to its caller. But, a function called in infinite recursion will never return PERIOD. If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite, then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of Halts(H_Hat,H_Hat) should not return EVER. Since it does, the recursion CAN'T be infinite, and thus Halts can return its answer to H_Hat. > > If the infinite recursion is terminated then the caller is terminated > and there is no caller to return a value to. NO. If it terminates the caller, it must terminate ALL callers, and fail to be a decider. It needs to terminate its simulation, and return it answer to its caller. You have just basically defined that Halts is NOT a Computation and thus can NOT be a Turing Machine Equivalent, and thus NOT a possible Candidate for H. > > When a UTM X simulates UTM Y that infinitely simulates itself when UTM Y > is terminated by UTM X then UTM X cannot return any value to UTM Y. But there is no UTM X that is a halt decider around H^ when run as a distint Turing Machine. If you have a such a machine, you haven't formed H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine built with a Halt decider outside the machine. Hint, No where. The Halt Decider is INSIDE H^. Thus, when UTM X aborts the machine it is deciding, it can return its answer to the H^ that called it. You may want to say that H^ is running inside a UTM, that is ok, but it must be a REAL UTM, not some fake UTM that has Halt Deciding functionality. There is NO basis for that in the setup of the proofs. > >> >> You keep getting all the levels of execution mixed up. >> >> H can NOT affect the execution of the machine outside itself (its >> caller) without failing at being a decider and not answering. >> > > H is simulating H^ > which copies its input (itself) and then simulates this copy > which copies its input (itself) and then simulates this copy > which copies its input (itself) and then simulates this copy... No, H^ make a copy of its input and then uses H to decide, which simulates H^ which makes a copy of its input .... H^ is on the outside in the case we are discussing, when we are asking what does H^ actually do when run. I don't care what happened to the simulated version of H^, that was just an internal detail that H used to decide, what I do care about is what H^ when actually runs does, and that is where your system falls on its face as shows that it is all a sham and not a real Turing equivalent, and things are really Computations.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 10:32 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <eZGdnUeJsKRr-un9nZ2dnUU7-KXNnZ2d@giganews.com> |
| In reply to | #30796 |
On 4/11/2021 9:40 PM, Richard Damon wrote:
> On 4/11/21 6:45 PM, olcott wrote:
>> On 4/11/2021 5:19 PM, Richard Damon wrote:
>
>>>
>>> Which means that the Simulator will stop the SIMULATED H^, and return
>>> the answer to the outer H^, which will halt, showing the answer wrong.
>>
>> You continue to show profound software engineering stupidity.
>>
>> There is never any case where a function called in infinite recursion
>> ever returns any result to its caller.
>
> But, a function called in infinite recursion will never return PERIOD.
> If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite,
> then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of
> Halts(H_Hat,H_Hat) should not return EVER.
>
> Since it does, the recursion CAN'T be infinite, and thus Halts can
> return its answer to H_Hat.
>
>>
>> If the infinite recursion is terminated then the caller is terminated
>> and there is no caller to return a value to.
>
> NO. If it terminates the caller, it must terminate ALL callers, and fail
> to be a decider. It needs to terminate its simulation, and return it
> answer to its caller.
>
> You have just basically defined that Halts is NOT a Computation and thus
> can NOT be a Turing Machine Equivalent, and thus NOT a possible
> Candidate for H.
>
>>
>> When a UTM X simulates UTM Y that infinitely simulates itself when UTM Y
>> is terminated by UTM X then UTM X cannot return any value to UTM Y.
>
> But there is no UTM X that is a halt decider around H^ when run as a
> distint Turing Machine. If you have a such a machine, you haven't formed
> H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine
> built with a Halt decider outside the machine.
>
> Hint, No where. The Halt Decider is INSIDE H^.
>
> Thus, when UTM X aborts the machine it is deciding, it can return its
> answer to the H^ that called it.
>
> You may want to say that H^ is running inside a UTM, that is ok, but it
> must be a REAL UTM, not some fake UTM that has Halt Deciding
> functionality. There is NO basis for that in the setup of the proofs.
>
>>
>>>
>>> You keep getting all the levels of execution mixed up.
>>>
>>> H can NOT affect the execution of the machine outside itself (its
>>> caller) without failing at being a decider and not answering.
>>>
>>
>> H is simulating H^
>> which copies its input (itself) and then simulates this copy
>> which copies its input (itself) and then simulates this copy
>> which copies its input (itself) and then simulates this copy...
>
>
> No, H^ make a copy of its input and then uses H to decide, which
> simulates H^ which makes a copy of its input ....
>
I am using the Linz definition in the above where H^ has its own
embedded halt decider. I explained this all on page (5) of my updated
paper:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
> H^ is on the outside in the case we are discussing, when we are asking
> what does H^ actually do when run.
>
> I don't care what happened to the simulated version of H^, that was just
> an internal detail that H used to decide, what I do care about is what
> H^ when actually runs does, and that is where your system falls on its
> face as shows that it is all a sham and not a real Turing equivalent,
> and things are really Computations.
>
int main()
{
H_Hat(H_Hat);
}
Only terminates because Halts() terminates its otherwise infinite
recursion.
--
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-12 11:57 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <66_cI.2$v3H9.1@fx01.iad> |
| In reply to | #30802 |
On 4/12/21 11:32 AM, olcott wrote:
> On 4/11/2021 9:40 PM, Richard Damon wrote:
>> On 4/11/21 6:45 PM, olcott wrote:
>>> On 4/11/2021 5:19 PM, Richard Damon wrote:
>>
>>>>
>>>> Which means that the Simulator will stop the SIMULATED H^, and return
>>>> the answer to the outer H^, which will halt, showing the answer wrong.
>>>
>>> You continue to show profound software engineering stupidity.
>>>
>>> There is never any case where a function called in infinite recursion
>>> ever returns any result to its caller.
>>
>> But, a function called in infinite recursion will never return PERIOD.
>> If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite,
>> then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of
>> Halts(H_Hat,H_Hat) should not return EVER.
>>
>> Since it does, the recursion CAN'T be infinite, and thus Halts can
>> return its answer to H_Hat.
>>
>>>
>>> If the infinite recursion is terminated then the caller is terminated
>>> and there is no caller to return a value to.
>>
>> NO. If it terminates the caller, it must terminate ALL callers, and fail
>> to be a decider. It needs to terminate its simulation, and return it
>> answer to its caller.
>>
>> You have just basically defined that Halts is NOT a Computation and thus
>> can NOT be a Turing Machine Equivalent, and thus NOT a possible
>> Candidate for H.
>>
>>>
>>> When a UTM X simulates UTM Y that infinitely simulates itself when UTM Y
>>> is terminated by UTM X then UTM X cannot return any value to UTM Y.
>>
>> But there is no UTM X that is a halt decider around H^ when run as a
>> distint Turing Machine. If you have a such a machine, you haven't formed
>> H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine
>> built with a Halt decider outside the machine.
>>
>> Hint, No where. The Halt Decider is INSIDE H^.
>>
>> Thus, when UTM X aborts the machine it is deciding, it can return its
>> answer to the H^ that called it.
>>
>> You may want to say that H^ is running inside a UTM, that is ok, but it
>> must be a REAL UTM, not some fake UTM that has Halt Deciding
>> functionality. There is NO basis for that in the setup of the proofs.
>>
>>>
>>>>
>>>> You keep getting all the levels of execution mixed up.
>>>>
>>>> H can NOT affect the execution of the machine outside itself (its
>>>> caller) without failing at being a decider and not answering.
>>>>
>>>
>>> H is simulating H^
>>> which copies its input (itself) and then simulates this copy
>>> which copies its input (itself) and then simulates this copy
>>> which copies its input (itself) and then simulates this copy...
>>
>>
>> No, H^ make a copy of its input and then uses H to decide, which
>> simulates H^ which makes a copy of its input ....
>>
>
> I am using the Linz definition in the above where H^ has its own
> embedded halt decider. I explained this all on page (5) of my updated
> paper:
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
Yes, there is a Halt Decider WITHIN H^, that either returns an answer to
H^ or proves it failed to be a proper halting decider. You get to chose
which way your H failed. It either returns the wrong value, or fails to
decide (or fails to be a Turing Machine)
>
>> H^ is on the outside in the case we are discussing, when we are asking
>> what does H^ actually do when run.
>>
>> I don't care what happened to the simulated version of H^, that was just
>> an internal detail that H used to decide, what I do care about is what
>> H^ when actually runs does, and that is where your system falls on its
>> face as shows that it is all a sham and not a real Turing equivalent,
>> and things are really Computations.
>>
>
> int main()
> {
> H_Hat(H_Hat);
> }
>
> Only terminates because Halts() terminates its otherwise infinite
> recursion.
>
>
WHAT HALTS CAN DO THAT. THERE IS NO HALTS (OR SHOULDN'T) BE, IN CHARGE
OF THAT EXECUTION.
H^, when run as a Turing Machine, is NOT under any halt decider that can
terminate it.
YOU SYSTEM IS BROKEN if you say there is one.
As I have pointed out before, your logic system has gone inconsistent.
In fact, as I think about it, your basic goal is too.
Linz has provided a PROOF, that no H can answer for the H^ built on it.
If you claim you have proven that there is an H that can correctly
answer fot H^, then we have the classical definition of an inconsistent
system, A system that con prove both a statement and its converse.
Note, the technique of showing a counter example to a claim is a way to
disprove a CONJECTURE. When done to a PROOF, it doesn't 'disprove' the
proof, but shows thta one or the other of the two proofs must be wrong
or the system of logic in inconsistent.
Your whole logic doesn't actually point out an error in Linz, there is
no statement of Linz that you are actually pointing out is an incorrect
statement, so you don't actually remove the validity of Linz, at best
you can point out that the logic system is inconsistent.
The fact that you 'add' assumptions and differing definition to the
system, actual make it much more likely that the system inconsistency
arise from your additions. It is also well established that you
fundamental assumption that Truth is Provable DOES lead to
inconsistencies when applied to this field of logic, so it pretty much
puts the blame for the problems on your additions.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 11:31 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <FNydnbM-44NK6On9nZ2dnUU7-bPNnZ2d@giganews.com> |
| In reply to | #30804 |
On 4/12/2021 10:57 AM, Richard Damon wrote:
> On 4/12/21 11:32 AM, olcott wrote:
>> On 4/11/2021 9:40 PM, Richard Damon wrote:
>>> On 4/11/21 6:45 PM, olcott wrote:
>>>> On 4/11/2021 5:19 PM, Richard Damon wrote:
>>>
>>>>>
>>>>> Which means that the Simulator will stop the SIMULATED H^, and return
>>>>> the answer to the outer H^, which will halt, showing the answer wrong.
>>>>
>>>> You continue to show profound software engineering stupidity.
>>>>
>>>> There is never any case where a function called in infinite recursion
>>>> ever returns any result to its caller.
>>>
>>> But, a function called in infinite recursion will never return PERIOD.
>>> If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite,
>>> then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of
>>> Halts(H_Hat,H_Hat) should not return EVER.
>>>
>>> Since it does, the recursion CAN'T be infinite, and thus Halts can
>>> return its answer to H_Hat.
>>>
>>>>
>>>> If the infinite recursion is terminated then the caller is terminated
>>>> and there is no caller to return a value to.
>>>
>>> NO. If it terminates the caller, it must terminate ALL callers, and fail
>>> to be a decider. It needs to terminate its simulation, and return it
>>> answer to its caller.
>>>
>>> You have just basically defined that Halts is NOT a Computation and thus
>>> can NOT be a Turing Machine Equivalent, and thus NOT a possible
>>> Candidate for H.
>>>
>>>>
>>>> When a UTM X simulates UTM Y that infinitely simulates itself when UTM Y
>>>> is terminated by UTM X then UTM X cannot return any value to UTM Y.
>>>
>>> But there is no UTM X that is a halt decider around H^ when run as a
>>> distint Turing Machine. If you have a such a machine, you haven't formed
>>> H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine
>>> built with a Halt decider outside the machine.
>>>
>>> Hint, No where. The Halt Decider is INSIDE H^.
>>>
>>> Thus, when UTM X aborts the machine it is deciding, it can return its
>>> answer to the H^ that called it.
>>>
>>> You may want to say that H^ is running inside a UTM, that is ok, but it
>>> must be a REAL UTM, not some fake UTM that has Halt Deciding
>>> functionality. There is NO basis for that in the setup of the proofs.
>>>
>>>>
>>>>>
>>>>> You keep getting all the levels of execution mixed up.
>>>>>
>>>>> H can NOT affect the execution of the machine outside itself (its
>>>>> caller) without failing at being a decider and not answering.
>>>>>
>>>>
>>>> H is simulating H^
>>>> which copies its input (itself) and then simulates this copy
>>>> which copies its input (itself) and then simulates this copy
>>>> which copies its input (itself) and then simulates this copy...
>>>
>>>
>>> No, H^ make a copy of its input and then uses H to decide, which
>>> simulates H^ which makes a copy of its input ....
>>>
>>
>> I am using the Linz definition in the above where H^ has its own
>> embedded halt decider. I explained this all on page (5) of my updated
>> paper:
>>
>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>
>
> Yes, there is a Halt Decider WITHIN H^, that either returns an answer to
> H^ or proves it failed to be a proper halting decider.
That an otherwise correct halt decider can be broken by encoding it to
get the wrong answer is trivial, that is one of the reasons why I don't
embed the halt decider in H^. The key halting problem undecidability
proof is based on an input that cannot be correctly decided.
> You get to chose
> which way your H failed. It either returns the wrong value, or fails to
> decide (or fails to be a Turing Machine)
Halts() certainly does correctly decide that it must stop simulating
H_Hat() otherwise H_Hat() would be infinitely recursive.
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>
>>> H^ is on the outside in the case we are discussing, when we are asking
>>> what does H^ actually do when run.
>>>
>>> I don't care what happened to the simulated version of H^, that was just
>>> an internal detail that H used to decide, what I do care about is what
>>> H^ when actually runs does, and that is where your system falls on its
>>> face as shows that it is all a sham and not a real Turing equivalent,
>>> and things are really Computations.
>>>
>>
>> int main()
>> {
>> H_Hat(H_Hat);
>> }
>>
>> Only terminates because Halts() terminates its otherwise infinite
>> recursion.
>>
>>
>
> WHAT HALTS CAN DO THAT. THERE IS NO HALTS (OR SHOULDN'T) BE, IN CHARGE
> OF THAT EXECUTION.
>
Did you forget the definition of H_Hat() that I posted hundreds and
hundreds of times?
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
THE ONLY REASON WHY H_HAT IS NOT INFINITELY RECURSIVE IS THAT HALTS
TERMINATES THIS OTHERWISE INFINITE RECURSION.
> H^, when run as a Turing Machine, is NOT under any halt decider that can
> terminate it.
>
> YOU SYSTEM IS BROKEN if you say there is one.
>
> As I have pointed out before, your logic system has gone inconsistent.
>
> In fact, as I think about it, your basic goal is too.
>
> Linz has provided a PROOF, that no H can answer for the H^ built on it.
That no H can return a correct Boolean value to a function that is
calling it in infinite recursion is impossible for the simple software
engineering reason that no function called in infinite recursion ever
returns any value to its caller.
We get around this by simply terminating the caller and returning a
value to the outermost invocation of the otherwise infinitely recursive
invocation of Halts().
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-12 13:04 -0400 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <%4%cI.4$2A5.0@fx45.iad> |
| In reply to | #30806 |
On 4/12/21 12:31 PM, olcott wrote:
> On 4/12/2021 10:57 AM, Richard Damon wrote:
>> On 4/12/21 11:32 AM, olcott wrote:
>>> On 4/11/2021 9:40 PM, Richard Damon wrote:
>>>> On 4/11/21 6:45 PM, olcott wrote:
>>>>> On 4/11/2021 5:19 PM, Richard Damon wrote:
>>>>
>>>>>>
>>>>>> Which means that the Simulator will stop the SIMULATED H^, and return
>>>>>> the answer to the outer H^, which will halt, showing the answer
>>>>>> wrong.
>>>>>
>>>>> You continue to show profound software engineering stupidity.
>>>>>
>>>>> There is never any case where a function called in infinite recursion
>>>>> ever returns any result to its caller.
>>>>
>>>> But, a function called in infinite recursion will never return PERIOD.
>>>> If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite,
>>>> then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of
>>>> Halts(H_Hat,H_Hat) should not return EVER.
>>>>
>>>> Since it does, the recursion CAN'T be infinite, and thus Halts can
>>>> return its answer to H_Hat.
>>>>
>>>>>
>>>>> If the infinite recursion is terminated then the caller is terminated
>>>>> and there is no caller to return a value to.
>>>>
>>>> NO. If it terminates the caller, it must terminate ALL callers, and
>>>> fail
>>>> to be a decider. It needs to terminate its simulation, and return it
>>>> answer to its caller.
>>>>
>>>> You have just basically defined that Halts is NOT a Computation and
>>>> thus
>>>> can NOT be a Turing Machine Equivalent, and thus NOT a possible
>>>> Candidate for H.
>>>>
>>>>>
>>>>> When a UTM X simulates UTM Y that infinitely simulates itself when
>>>>> UTM Y
>>>>> is terminated by UTM X then UTM X cannot return any value to UTM Y.
>>>>
>>>> But there is no UTM X that is a halt decider around H^ when run as a
>>>> distint Turing Machine. If you have a such a machine, you haven't
>>>> formed
>>>> H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine
>>>> built with a Halt decider outside the machine.
>>>>
>>>> Hint, No where. The Halt Decider is INSIDE H^.
>>>>
>>>> Thus, when UTM X aborts the machine it is deciding, it can return its
>>>> answer to the H^ that called it.
>>>>
>>>> You may want to say that H^ is running inside a UTM, that is ok, but it
>>>> must be a REAL UTM, not some fake UTM that has Halt Deciding
>>>> functionality. There is NO basis for that in the setup of the proofs.
>>>>
>>>>>
>>>>>>
>>>>>> You keep getting all the levels of execution mixed up.
>>>>>>
>>>>>> H can NOT affect the execution of the machine outside itself (its
>>>>>> caller) without failing at being a decider and not answering.
>>>>>>
>>>>>
>>>>> H is simulating H^
>>>>> which copies its input (itself) and then simulates this copy
>>>>> which copies its input (itself) and then simulates this copy
>>>>> which copies its input (itself) and then simulates this copy...
>>>>
>>>>
>>>> No, H^ make a copy of its input and then uses H to decide, which
>>>> simulates H^ which makes a copy of its input ....
>>>>
>>>
>>> I am using the Linz definition in the above where H^ has its own
>>> embedded halt decider. I explained this all on page (5) of my updated
>>> paper:
>>>
>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>
>>>
>>
>> Yes, there is a Halt Decider WITHIN H^, that either returns an answer to
>> H^ or proves it failed to be a proper halting decider.
>
> That an otherwise correct halt decider can be broken by encoding it to
> get the wrong answer is trivial, that is one of the reasons why I don't
> embed the halt decider in H^. The key halting problem undecidability
> proof is based on an input that cannot be correctly decided.
>
>> You get to chose
>> which way your H failed. It either returns the wrong value, or fails to
>> decide (or fails to be a Turing Machine)
>
> Halts() certainly does correctly decide that it must stop simulating
> H_Hat() otherwise H_Hat() would be infinitely recursive.
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
>
>>>
>>>> H^ is on the outside in the case we are discussing, when we are asking
>>>> what does H^ actually do when run.
>>>>
>>>> I don't care what happened to the simulated version of H^, that was
>>>> just
>>>> an internal detail that H used to decide, what I do care about is what
>>>> H^ when actually runs does, and that is where your system falls on its
>>>> face as shows that it is all a sham and not a real Turing equivalent,
>>>> and things are really Computations.
>>>>
>>>
>>> int main()
>>> {
>>> H_Hat(H_Hat);
>>> }
>>>
>>> Only terminates because Halts() terminates its otherwise infinite
>>> recursion.
>>>
>>>
>>
>> WHAT HALTS CAN DO THAT. THERE IS NO HALTS (OR SHOULDN'T) BE, IN CHARGE
>> OF THAT EXECUTION.
>>
>
> Did you forget the definition of H_Hat() that I posted hundreds and
> hundreds of times?
>
> void H_Hat(u32 P)
> {
> u32 Input_Would_Halt = Halts(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
> THE ONLY REASON WHY H_HAT IS NOT INFINITELY RECURSIVE IS THAT HALTS
> TERMINATES THIS OTHERWISE INFINITE RECURSION.
But this H_Hat DOES halt when the call it makes to Halts does return
that it decided (incorrectly) that H_Hat would not halt.
Halts has two choice, it is between a rock and a hard place.
It can tell H_Hat that is won't halt, and then it will, or
It can decide not to tell H_Hat, and then it fails to be a decider.
There is no rule that says that Halts has to be able to answer the
question correctly. THAT is you failing, you refuse to accept that Halts
is allowed to be wrong, that just says it isn't qualified to wear the
badge that says it is a perfectly correct universal halting decider. It
needs to EARN that badge, and Linz has shown that NO Halt Decider can
earn that badge.
>
>> H^, when run as a Turing Machine, is NOT under any halt decider that can
>> terminate it.
>>
>> YOU SYSTEM IS BROKEN if you say there is one.
>>
>> As I have pointed out before, your logic system has gone inconsistent.
>>
>> In fact, as I think about it, your basic goal is too.
>>
>> Linz has provided a PROOF, that no H can answer for the H^ built on it.
>
> That no H can return a correct Boolean value to a function that is
> calling it in infinite recursion is impossible for the simple software
> engineering reason that no function called in infinite recursion ever
> returns any value to its caller.
>
> We get around this by simply terminating the caller and returning a
> value to the outermost invocation of the otherwise infinitely recursive
> invocation of Halts().
>
>
You have that rule WRONG. IF H is infinitely recursive, it can not
return the answer EVER. If it is not, it needs to return the same answer
every time or it shows itself to NOT be a proper Computation.
A Turing Machine can NOT 'terminate its caller' and still qualify as a
decider. That is a figment of your own imagination.
Actually, the fact that it can tell who is calling it shows that it is
not an independent Turing Machine, so is disqualified to be a Halting
Decider.
A Halting Decider has as its input ONLY the representation of the
machine it is to decide on and the representation of the input to that
machine. Being a Turing Machine, it will ALWAYS answer the question the
same EVERY time that it is asked.
Let me give you a simple challenge. Create a REAL Turing Machine (you
know, a state-input => state-tape op, machine that is some sort of
decider that can give a different answer when it is run by itself than
when run as part of a large machine that provides the exact same tape
input as when it was run by itself, sort of like the Linz H^
transformation. (Not needing to decise what H^ will do, just built by a
similar process where H^ sets up the same problem that we otherwise just
ran on H)
Make it give a different answer to that H^ or abort H^ but still answer
properly when not run by H^.
Try it. Show us that this is even possible. Show us you understand what
a Turiing Machine actually is. It doesn't need to be a complicated
decider, maybe just answer False when run alone, but aborts H^ without
answering.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 21:46 -0500 |
| Subject | Re: What is a computation? (over Richard's head) |
| Message-ID | <L9Cdnc3xru6Nm-j9nZ2dnUU7-YHNnZ2d@giganews.com> |
| In reply to | #30808 |
On 4/12/2021 12:04 PM, Richard Damon wrote:
> On 4/12/21 12:31 PM, olcott wrote:
>> On 4/12/2021 10:57 AM, Richard Damon wrote:
>>> On 4/12/21 11:32 AM, olcott wrote:
>>>> On 4/11/2021 9:40 PM, Richard Damon wrote:
>>>>> On 4/11/21 6:45 PM, olcott wrote:
>>>>>> On 4/11/2021 5:19 PM, Richard Damon wrote:
>>>>>
>>>>>>>
>>>>>>> Which means that the Simulator will stop the SIMULATED H^, and return
>>>>>>> the answer to the outer H^, which will halt, showing the answer
>>>>>>> wrong.
>>>>>>
>>>>>> You continue to show profound software engineering stupidity.
>>>>>>
>>>>>> There is never any case where a function called in infinite recursion
>>>>>> ever returns any result to its caller.
>>>>>
>>>>> But, a function called in infinite recursion will never return PERIOD.
>>>>> If the recursion H_Hat -> Halts -> H_Hat -> Halts -> H_Hat is infinite,
>>>>> then so is Halts -> H_Hat -> Halts -> H_Hat and thus the call of
>>>>> Halts(H_Hat,H_Hat) should not return EVER.
>>>>>
>>>>> Since it does, the recursion CAN'T be infinite, and thus Halts can
>>>>> return its answer to H_Hat.
>>>>>
>>>>>>
>>>>>> If the infinite recursion is terminated then the caller is terminated
>>>>>> and there is no caller to return a value to.
>>>>>
>>>>> NO. If it terminates the caller, it must terminate ALL callers, and
>>>>> fail
>>>>> to be a decider. It needs to terminate its simulation, and return it
>>>>> answer to its caller.
>>>>>
>>>>> You have just basically defined that Halts is NOT a Computation and
>>>>> thus
>>>>> can NOT be a Turing Machine Equivalent, and thus NOT a possible
>>>>> Candidate for H.
>>>>>
>>>>>>
>>>>>> When a UTM X simulates UTM Y that infinitely simulates itself when
>>>>>> UTM Y
>>>>>> is terminated by UTM X then UTM X cannot return any value to UTM Y.
>>>>>
>>>>> But there is no UTM X that is a halt decider around H^ when run as a
>>>>> distint Turing Machine. If you have a such a machine, you haven't
>>>>> formed
>>>>> H^ correctly. WHERE in Linz or any of the proof, is the Turing Machine
>>>>> built with a Halt decider outside the machine.
>>>>>
>>>>> Hint, No where. The Halt Decider is INSIDE H^.
>>>>>
>>>>> Thus, when UTM X aborts the machine it is deciding, it can return its
>>>>> answer to the H^ that called it.
>>>>>
>>>>> You may want to say that H^ is running inside a UTM, that is ok, but it
>>>>> must be a REAL UTM, not some fake UTM that has Halt Deciding
>>>>> functionality. There is NO basis for that in the setup of the proofs.
>>>>>
>>>>>>
>>>>>>>
>>>>>>> You keep getting all the levels of execution mixed up.
>>>>>>>
>>>>>>> H can NOT affect the execution of the machine outside itself (its
>>>>>>> caller) without failing at being a decider and not answering.
>>>>>>>
>>>>>>
>>>>>> H is simulating H^
>>>>>> which copies its input (itself) and then simulates this copy
>>>>>> which copies its input (itself) and then simulates this copy
>>>>>> which copies its input (itself) and then simulates this copy...
>>>>>
>>>>>
>>>>> No, H^ make a copy of its input and then uses H to decide, which
>>>>> simulates H^ which makes a copy of its input ....
>>>>>
>>>>
>>>> I am using the Linz definition in the above where H^ has its own
>>>> embedded halt decider. I explained this all on page (5) of my updated
>>>> paper:
>>>>
>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>
>>>>
>>>
>>> Yes, there is a Halt Decider WITHIN H^, that either returns an answer to
>>> H^ or proves it failed to be a proper halting decider.
>>
>> That an otherwise correct halt decider can be broken by encoding it to
>> get the wrong answer is trivial, that is one of the reasons why I don't
>> embed the halt decider in H^. The key halting problem undecidability
>> proof is based on an input that cannot be correctly decided.
>>
>>> You get to chose
>>> which way your H failed. It either returns the wrong value, or fails to
>>> decide (or fails to be a Turing Machine)
>>
>> Halts() certainly does correctly decide that it must stop simulating
>> H_Hat() otherwise H_Hat() would be infinitely recursive.
>>
>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>
>>
>>
>>>>
>>>>> H^ is on the outside in the case we are discussing, when we are asking
>>>>> what does H^ actually do when run.
>>>>>
>>>>> I don't care what happened to the simulated version of H^, that was
>>>>> just
>>>>> an internal detail that H used to decide, what I do care about is what
>>>>> H^ when actually runs does, and that is where your system falls on its
>>>>> face as shows that it is all a sham and not a real Turing equivalent,
>>>>> and things are really Computations.
>>>>>
>>>>
>>>> int main()
>>>> {
>>>> H_Hat(H_Hat);
>>>> }
>>>>
>>>> Only terminates because Halts() terminates its otherwise infinite
>>>> recursion.
>>>>
>>>>
>>>
>>> WHAT HALTS CAN DO THAT. THERE IS NO HALTS (OR SHOULDN'T) BE, IN CHARGE
>>> OF THAT EXECUTION.
>>>
>>
>> Did you forget the definition of H_Hat() that I posted hundreds and
>> hundreds of times?
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Would_Halt = Halts(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>> THE ONLY REASON WHY H_HAT IS NOT INFINITELY RECURSIVE IS THAT HALTS
>> TERMINATES THIS OTHERWISE INFINITE RECURSION.
>
> But this H_Hat DOES halt when the call it makes to Halts does return
> that it decided (incorrectly) that H_Hat would not halt.
>
> Halts has two choice, it is between a rock and a hard place.
>
> It can tell H_Hat that is won't halt, and then it will, or
> It can decide not to tell H_Hat, and then it fails to be a decider.
>
> There is no rule that says that Halts has to be able to answer the
> question correctly. THAT is you failing, you refuse to accept that Halts
> is allowed to be wrong, that just says it isn't qualified to wear the
> badge that says it is a perfectly correct universal halting decider. It
> needs to EARN that badge, and Linz has shown that NO Halt Decider can
> earn that badge.
>
>>
>>> H^, when run as a Turing Machine, is NOT under any halt decider that can
>>> terminate it.
>>>
>>> YOU SYSTEM IS BROKEN if you say there is one.
>>>
>>> As I have pointed out before, your logic system has gone inconsistent.
>>>
>>> In fact, as I think about it, your basic goal is too.
>>>
>>> Linz has provided a PROOF, that no H can answer for the H^ built on it.
>>
>> That no H can return a correct Boolean value to a function that is
>> calling it in infinite recursion is impossible for the simple software
>> engineering reason that no function called in infinite recursion ever
>> returns any value to its caller.
>>
>> We get around this by simply terminating the caller and returning a
>> value to the outermost invocation of the otherwise infinitely recursive
>> invocation of Halts().
>>
>>
>
> You have that rule WRONG. IF H is infinitely recursive,
You can't even pay attention to the words that I am saying.
H is not frigging infinitely recursive H_Hat is calling H in infinite
recursion. It is the error of H_Hat, it is not the error of H.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 2 of 50 — ← Prev page 1 [2] 3 4 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web