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 43 of 50 — ← Prev page 1 … 41 42 [43] 44 45 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 19:31 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <faydnYUYuJGmxhr9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #32234 |
On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>> every time it decides to stop simulating its input this input would
>>>>>> never otherwise halt then:
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>
>>>>> Putting aside the poetic touches (like giving Halting only an encoded TM
>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>> you are simply hypothesising a halt decider.
>>>>>
>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>> implementation is that it gets at least an infinite number of cases
>>>>> wrong.
>>>>>
>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>
>>>> void H_Hat(u32 P) ...
>>>
>>> Whoa! It was you that would not move on until your delightful
>>>
>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>
>>> was understood. I asked about it in order to try to work it out. Did
>>> you see the questions? If you did not understand them, why did you not
>>> ask me for clarification. Would you like me to say again what's
>>> mysterious about it? Would you prefer to move with me simply guessing
>>> what you mean?
>>>
>>> PO: "I only want an honest dialogue."
>>>
>>
>> ∀x ∈ Turing_Machine_Descriptions
>> ∀y ∈ Finite_Strings
>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>
> So, not only won't you answer questions about the last version of this
> silly formula, you will just cut my comments because you say you won't
> move on until the nonsense is understood. But now, not only will you
> "move on", you will throw in another version with no apparent desire fir
> it to be understood either.
>
> So let me tell what your formula is. It's spin. All is does is give
> the property of non halting a new name. You hope the new new name and
> the association with "simulation" will help you full a fast one later
> on.
>
> The new version includes a statement that was never in doubt: that
> non-halting computations have non-halting simulations, and vice versa.
Dishonest dodge.
void Infinite_Loop()
{
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
}
You keep trying try dodge the point that there are halting simulations
of non halting computations.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-26 20:54 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <4hJhI.533215$%W6.309187@fx44.iad> |
| In reply to | #32236 |
On 4/26/21 8:31 PM, olcott wrote:
> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>> never otherwise halt then:
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>
>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>> encoded TM
>>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped
>>>>>> is)
>>>>>> you are simply hypothesising a halt decider.
>>>>>>
>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>> result, and you have a halt decider. You don't (I know you don't
>>>>>> claim
>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>> wrong.
>>>>>>
>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>> about.
>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>
>>>>> void H_Hat(u32 P) ...
>>>>
>>>> Whoa! It was you that would not move on until your delightful
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> was understood. I asked about it in order to try to work it out. Did
>>>> you see the questions? If you did not understand them, why did you not
>>>> ask me for clarification. Would you like me to say again what's
>>>> mysterious about it? Would you prefer to move with me simply guessing
>>>> what you mean?
>>>>
>>>> PO: "I only want an honest dialogue."
>>>>
>>>
>>> ∀x ∈ Turing_Machine_Descriptions
>>> ∀y ∈ Finite_Strings
>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>
>> So, not only won't you answer questions about the last version of this
>> silly formula, you will just cut my comments because you say you won't
>> move on until the nonsense is understood. But now, not only will you
>> "move on", you will throw in another version with no apparent desire fir
>> it to be understood either.
>>
>> So let me tell what your formula is. It's spin. All is does is give
>> the property of non halting a new name. You hope the new new name and
>> the association with "simulation" will help you full a fast one later
>> on.
>>
>> The new version includes a statement that was never in doubt: that
>> non-halting computations have non-halting simulations, and vice versa.
> Dishonest dodge.
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
> }
>
> You keep trying try dodge the point that there are halting simulations
> of non halting computations.
>
>
Yes, there are cases where the Halt decider has a finite computation
because it stop simulating a non-halting computation.
That doesn't mean that all computations that it has stop simulating were
non-halting.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-27 02:18 +0100 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <87bla0frte.fsf@bsb.me.uk> |
| In reply to | #32236 |
olcott <NoOne@NoWhere.com> writes:
> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>> never otherwise halt then:
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>
>>>>>> Putting aside the poetic touches (like giving Halting only an encoded TM
>>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>>> you are simply hypothesising a halt decider.
>>>>>>
>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>> wrong.
>>>>>>
>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>
>>>>> void H_Hat(u32 P) ...
>>>>
>>>> Whoa! It was you that would not move on until your delightful
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>
>>>> was understood. I asked about it in order to try to work it out. Did
>>>> you see the questions? If you did not understand them, why did you not
>>>> ask me for clarification. Would you like me to say again what's
>>>> mysterious about it? Would you prefer to move with me simply guessing
>>>> what you mean?
>>>>
>>>> PO: "I only want an honest dialogue."
>>>>
>>>
>>> ∀x ∈ Turing_Machine_Descriptions
>>> ∀y ∈ Finite_Strings
>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>
>> So, not only won't you answer questions about the last version of this
>> silly formula, you will just cut my comments because you say you won't
>> move on until the nonsense is understood. But now, not only will you
>> "move on", you will throw in another version with no apparent desire fir
>> it to be understood either.
>>
>> So let me tell what your formula is. It's spin. All is does is give
>> the property of non halting a new name. You hope the new new name and
>> the association with "simulation" will help you full a fast one later
>> on.
>>
>> The new version includes a statement that was never in doubt: that
>> non-halting computations have non-halting simulations, and vice
>> versa.
>
> Dishonest dodge.
Projection. You have avoided addressing everything I said. You are
still avoiding any clarification of your math poem despite saying that
that was essential before moving on.
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
Still using silly variable names.
> }
And still not posting the code. Here's the best we have to work with:
bool Halts(u32 P, u32 I)
{
bool Halted = false;
bool Aborted = false;
while (!Halted && !Aborted)
{
Halted = DebugStep(P, I);
Aborted = Needs_To_Be_Aborted();
}
return !Aborted;
}
As best as I can tell, unless you have really messed up, Halts will
return the right answer to main. If you'd actually read the text you
cut without comment, you'd know that.
> You keep trying try dodge the point that there are halting simulations
> of non halting computations.
Ha! You didn't read the detailed analysis that I wrote, did you? Or if
you did, you didn't understand it. It explicitly talked about partial
simulations of non-halting computations.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 21:02 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <Q6qdnQHg5O807Rr9nZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #32241 |
On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such that
>>>>>>>> every time it decides to stop simulating its input this input would
>>>>>>>> never otherwise halt then:
>>>>>>>>
>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>>>
>>>>>>> Putting aside the poetic touches (like giving Halting only an encoded TM
>>>>>>> and leaving the reader to guess what kind of thing Must_be_Stopped is)
>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>
>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>> captures what you call axioms) as a negative halt decider. Flip the
>>>>>>> result, and you have a halt decider. You don't (I know you don't claim
>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>> wrong.
>>>>>>>
>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong about.
>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>
>>>>>> void H_Hat(u32 P) ...
>>>>>
>>>>> Whoa! It was you that would not move on until your delightful
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
>>>>>
>>>>> was understood. I asked about it in order to try to work it out. Did
>>>>> you see the questions? If you did not understand them, why did you not
>>>>> ask me for clarification. Would you like me to say again what's
>>>>> mysterious about it? Would you prefer to move with me simply guessing
>>>>> what you mean?
>>>>>
>>>>> PO: "I only want an honest dialogue."
>>>>>
>>>>
>>>> ∀x ∈ Turing_Machine_Descriptions
>>>> ∀y ∈ Finite_Strings
>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>
>>> So, not only won't you answer questions about the last version of this
>>> silly formula, you will just cut my comments because you say you won't
>>> move on until the nonsense is understood. But now, not only will you
>>> "move on", you will throw in another version with no apparent desire fir
>>> it to be understood either.
>>>
>>> So let me tell what your formula is. It's spin. All is does is give
>>> the property of non halting a new name. You hope the new new name and
>>> the association with "simulation" will help you full a fast one later
>>> on.
>>>
>>> The new version includes a statement that was never in doubt: that
>>> non-halting computations have non-halting simulations, and vice
>>> versa.
>>
>> Dishonest dodge.
>
> Projection. You have avoided addressing everything I said. You are
> still avoiding any clarification of your math poem despite saying that
> that was essential before moving on.
>
>> void Infinite_Loop()
>> {
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
>
> Still using silly variable names.
>
>> }
>
> And still not posting the code. Here's the best we have to work with:
>
> bool Halts(u32 P, u32 I)
> {
> bool Halted = false;
> bool Aborted = false;
> while (!Halted && !Aborted)
> {
> Halted = DebugStep(P, I);
> Aborted = Needs_To_Be_Aborted();
> }
> return !Aborted;
> }
>
> As best as I can tell, unless you have really messed up, Halts will
> return the right answer to main. If you'd actually read the text you
> cut without comment, you'd know that.
>
>> You keep trying try dodge the point that there are halting simulations
>> of non halting computations.
>
> Ha! You didn't read the detailed analysis that I wrote, did you? Or if
> you did, you didn't understand it. It explicitly talked about partial
> simulations of non-halting computations.
>
Every computation that only halts because its simulation was stopped is
a non halting computation.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
}
void H_Hat2(u32 P)
{
u32 Input_Would_Halt = Simulate(P, P);
}
int main() {
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
}
Halts never returns to H_Hat for the same reason that Simulate never
returns to H_Hat2.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-26 22:13 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <arKhI.16020$zx1.1123@fx20.iad> |
| In reply to | #32244 |
On 4/26/21 10:02 PM, olcott wrote:
> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>>> that
>>>>>>>>> every time it decides to stop simulating its input this input
>>>>>>>>> would
>>>>>>>>> never otherwise halt then:
>>>>>>>>>
>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>> ¬Halting(x))
>>>>>>>>
>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>> encoded TM
>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>> Must_be_Stopped is)
>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>
>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>> captures what you call axioms) as a negative halt decider. Flip
>>>>>>>> the
>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>> don't claim
>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>>> wrong.
>>>>>>>>
>>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>>> about.
>>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>>
>>>>>>> void H_Hat(u32 P) ...
>>>>>>
>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>> ¬Halting(x))
>>>>>>
>>>>>> was understood. I asked about it in order to try to work it out.
>>>>>> Did
>>>>>> you see the questions? If you did not understand them, why did
>>>>>> you not
>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>> guessing
>>>>>> what you mean?
>>>>>>
>>>>>> PO: "I only want an honest dialogue."
>>>>>>
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>> ∀y ∈ Finite_Strings
>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>
>>>> So, not only won't you answer questions about the last version of this
>>>> silly formula, you will just cut my comments because you say you won't
>>>> move on until the nonsense is understood. But now, not only will you
>>>> "move on", you will throw in another version with no apparent desire
>>>> fir
>>>> it to be understood either.
>>>>
>>>> So let me tell what your formula is. It's spin. All is does is give
>>>> the property of non halting a new name. You hope the new new name and
>>>> the association with "simulation" will help you full a fast one later
>>>> on.
>>>>
>>>> The new version includes a statement that was never in doubt: that
>>>> non-halting computations have non-halting simulations, and vice
>>>> versa.
>>>
>>> Dishonest dodge.
>>
>> Projection. You have avoided addressing everything I said. You are
>> still avoiding any clarification of your math poem despite saying that
>> that was essential before moving on.
>>
>>> void Infinite_Loop()
>>> {
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
>>
>> Still using silly variable names.
>>
>>> }
>>
>> And still not posting the code. Here's the best we have to work with:
>>
>> bool Halts(u32 P, u32 I)
>> {
>> bool Halted = false;
>> bool Aborted = false;
>> while (!Halted && !Aborted)
>> {
>> Halted = DebugStep(P, I);
>> Aborted = Needs_To_Be_Aborted();
>> }
>> return !Aborted;
>> }
>>
>> As best as I can tell, unless you have really messed up, Halts will
>> return the right answer to main. If you'd actually read the text you
>> cut without comment, you'd know that.
>>
>>> You keep trying try dodge the point that there are halting simulations
>>> of non halting computations.
>>
>> Ha! You didn't read the detailed analysis that I wrote, did you? Or if
>> you did, you didn't understand it. It explicitly talked about partial
>> simulations of non-halting computations.
>>
>
> Every computation that only halts because its simulation was stopped is
> a non halting computation.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> }
>
> void H_Hat2(u32 P)
> {
> u32 Input_Would_Halt = Simulate(P, P);
> }
>
> int main() {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> }
>
> Halts never returns to H_Hat for the same reason that Simulate never
> returns to H_Hat2.
>
But:
1) Halts is stipulated to meet the requirements of a Halt Decider for
Computation Theory, as used in the proof of Linz and Sipser.
2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
asked direction
3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
halt when the Halt decider it is built on decides H_Hat’s input is
non-Halting on itself.
4) 1 Means that Halts is a Computation, and will always return the same
answer (or never return an answer) for a given input.
5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
H_Hat)
6) by 4 and 2, this means that Halts will return the decision on
non-halting to H_Hat
7) By 3, this means that H_Hat will Halt.
If Halts does not return to H_Hat when H_Hat is the top level machine,
then Halts is NOT a computation, and thus can NOT be a Decider, and thus
NOT a Halt Decider.
Either that or it NEVER return when asked about Halts(H_Hat, H_Hat) and
thus not a decider for H_Hat(H_Hat)
8)
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 20:56 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s67ugn$oub$1@dont-email.me> |
| In reply to | #32244 |
On 2021-04-26 20:02, olcott wrote:
> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms such
>>>>>>>>> that
>>>>>>>>> every time it decides to stop simulating its input this input
>>>>>>>>> would
>>>>>>>>> never otherwise halt then:
>>>>>>>>>
>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>> ¬Halting(x))
>>>>>>>>
>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>> encoded TM
>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>> Must_be_Stopped is)
>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>
>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>> captures what you call axioms) as a negative halt decider. Flip
>>>>>>>> the
>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>> don't claim
>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>> implementation is that it gets at least an infinite number of cases
>>>>>>>> wrong.
>>>>>>>>
>>>>>>>> Whilst you don't claim to have halt decider, you need be come clean
>>>>>>>> about exactly which cases you permit Must_be_Stopped to be wrong
>>>>>>>> about.
>>>>>>>> It might just be the one case you do care about. (Spoiler: it is!)
>>>>>>>
>>>>>>> void H_Hat(u32 P) ...
>>>>>>
>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>> ¬Halting(x))
>>>>>>
>>>>>> was understood. I asked about it in order to try to work it out.
>>>>>> Did
>>>>>> you see the questions? If you did not understand them, why did
>>>>>> you not
>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>> guessing
>>>>>> what you mean?
>>>>>>
>>>>>> PO: "I only want an honest dialogue."
>>>>>>
>>>>>
>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>> ∀y ∈ Finite_Strings
>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>
>>>> So, not only won't you answer questions about the last version of this
>>>> silly formula, you will just cut my comments because you say you won't
>>>> move on until the nonsense is understood. But now, not only will you
>>>> "move on", you will throw in another version with no apparent desire
>>>> fir
>>>> it to be understood either.
>>>>
>>>> So let me tell what your formula is. It's spin. All is does is give
>>>> the property of non halting a new name. You hope the new new name and
>>>> the association with "simulation" will help you full a fast one later
>>>> on.
>>>>
>>>> The new version includes a statement that was never in doubt: that
>>>> non-halting computations have non-halting simulations, and vice
>>>> versa.
>>>
>>> Dishonest dodge.
>>
>> Projection. You have avoided addressing everything I said. You are
>> still avoiding any clarification of your math poem despite saying that
>> that was essential before moving on.
>>
>>> void Infinite_Loop()
>>> {
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
>>
>> Still using silly variable names.
>>
>>> }
>>
>> And still not posting the code. Here's the best we have to work with:
>>
>> bool Halts(u32 P, u32 I)
>> {
>> bool Halted = false;
>> bool Aborted = false;
>> while (!Halted && !Aborted)
>> {
>> Halted = DebugStep(P, I);
>> Aborted = Needs_To_Be_Aborted();
>> }
>> return !Aborted;
>> }
>>
>> As best as I can tell, unless you have really messed up, Halts will
>> return the right answer to main. If you'd actually read the text you
>> cut without comment, you'd know that.
>>> You keep trying try dodge the point that there are halting simulations
>>> of non halting computations.
>>
>> Ha! You didn't read the detailed analysis that I wrote, did you? Or if
>> you did, you didn't understand it. It explicitly talked about partial
>> simulations of non-halting computations.
>>
>
> Every computation that only halts because its simulation was stopped is
> a non halting computation.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> }
>
> void H_Hat2(u32 P)
> {
> u32 Input_Would_Halt = Simulate(P, P);
> }
>
> int main() {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> }
>
> Halts never returns to H_Hat for the same reason that Simulate never
> returns to H_Hat2.
And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 22:06 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <I9ednTrpkqTn4hr9nZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #32247 |
On 4/26/2021 9:56 PM, André G. Isaak wrote:
> On 2021-04-26 20:02, olcott wrote:
>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms
>>>>>>>>>> such that
>>>>>>>>>> every time it decides to stop simulating its input this input
>>>>>>>>>> would
>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>
>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>> ¬Halting(x))
>>>>>>>>>
>>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>>> encoded TM
>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>> Must_be_Stopped is)
>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>
>>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>> Flip the
>>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>>> don't claim
>>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>>> implementation is that it gets at least an infinite number of
>>>>>>>>> cases
>>>>>>>>> wrong.
>>>>>>>>>
>>>>>>>>> Whilst you don't claim to have halt decider, you need be come
>>>>>>>>> clean
>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>> wrong about.
>>>>>>>>> It might just be the one case you do care about. (Spoiler: it
>>>>>>>>> is!)
>>>>>>>>
>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>
>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>> ¬Halting(x))
>>>>>>>
>>>>>>> was understood. I asked about it in order to try to work it out.
>>>>>>> Did
>>>>>>> you see the questions? If you did not understand them, why did
>>>>>>> you not
>>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>>> guessing
>>>>>>> what you mean?
>>>>>>>
>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>
>>>>>>
>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>> ∀y ∈ Finite_Strings
>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>
>>>>> So, not only won't you answer questions about the last version of this
>>>>> silly formula, you will just cut my comments because you say you won't
>>>>> move on until the nonsense is understood. But now, not only will you
>>>>> "move on", you will throw in another version with no apparent
>>>>> desire fir
>>>>> it to be understood either.
>>>>>
>>>>> So let me tell what your formula is. It's spin. All is does is give
>>>>> the property of non halting a new name. You hope the new new name and
>>>>> the association with "simulation" will help you full a fast one later
>>>>> on.
>>>>>
>>>>> The new version includes a statement that was never in doubt: that
>>>>> non-halting computations have non-halting simulations, and vice
>>>>> versa.
>>>>
>>>> Dishonest dodge.
>>>
>>> Projection. You have avoided addressing everything I said. You are
>>> still avoiding any clarification of your math poem despite saying that
>>> that was essential before moving on.
>>>
>>>> void Infinite_Loop()
>>>> {
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>> (u32)Infinite_Loop);
>>>
>>> Still using silly variable names.
>>>
>>>> }
>>>
>>> And still not posting the code. Here's the best we have to work with:
>>>
>>> bool Halts(u32 P, u32 I)
>>> {
>>> bool Halted = false;
>>> bool Aborted = false;
>>> while (!Halted && !Aborted)
>>> {
>>> Halted = DebugStep(P, I);
>>> Aborted = Needs_To_Be_Aborted();
>>> }
>>> return !Aborted;
>>> }
>>>
>>> As best as I can tell, unless you have really messed up, Halts will
>>> return the right answer to main. If you'd actually read the text you
>>> cut without comment, you'd know that.
>>>> You keep trying try dodge the point that there are halting simulations
>>>> of non halting computations.
>>>
>>> Ha! You didn't read the detailed analysis that I wrote, did you? Or if
>>> you did, you didn't understand it. It explicitly talked about partial
>>> simulations of non-halting computations.
>>>
>>
>> Every computation that only halts because its simulation was stopped
>> is a non halting computation.
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> }
>>
>> void H_Hat2(u32 P)
>> {
>> u32 Input_Would_Halt = Simulate(P, P);
>> }
>>
>> int main() {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>> }
>>
>> Halts never returns to H_Hat for the same reason that Simulate never
>> returns to H_Hat2.
>
>
> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>
> André
>
The same thing that happens when you run H_Hat(H_Hat) with many
thousands of extra instructions. H_Hat(H_Hat) only halts because Halts
aborts its otherwise infinite recursion.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 22:14 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s6832u$d73$1@dont-email.me> |
| In reply to | #32248 |
On 2021-04-26 21:06, olcott wrote:
> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>> On 2021-04-26 20:02, olcott wrote:
>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms
>>>>>>>>>>> such that
>>>>>>>>>>> every time it decides to stop simulating its input this input
>>>>>>>>>>> would
>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>
>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>
>>>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>>>> encoded TM
>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>
>>>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm that
>>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>>> Flip the
>>>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>>>> don't claim
>>>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>>>> implementation is that it gets at least an infinite number of
>>>>>>>>>> cases
>>>>>>>>>> wrong.
>>>>>>>>>>
>>>>>>>>>> Whilst you don't claim to have halt decider, you need be come
>>>>>>>>>> clean
>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>>> wrong about.
>>>>>>>>>> It might just be the one case you do care about. (Spoiler: it
>>>>>>>>>> is!)
>>>>>>>>>
>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>
>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>
>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>> ¬Halting(x))
>>>>>>>>
>>>>>>>> was understood. I asked about it in order to try to work it
>>>>>>>> out. Did
>>>>>>>> you see the questions? If you did not understand them, why did
>>>>>>>> you not
>>>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>>>> guessing
>>>>>>>> what you mean?
>>>>>>>>
>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>
>>>>>>>
>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>> ∀y ∈ Finite_Strings
>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>
>>>>>> So, not only won't you answer questions about the last version of
>>>>>> this
>>>>>> silly formula, you will just cut my comments because you say you
>>>>>> won't
>>>>>> move on until the nonsense is understood. But now, not only will you
>>>>>> "move on", you will throw in another version with no apparent
>>>>>> desire fir
>>>>>> it to be understood either.
>>>>>>
>>>>>> So let me tell what your formula is. It's spin. All is does is give
>>>>>> the property of non halting a new name. You hope the new new name
>>>>>> and
>>>>>> the association with "simulation" will help you full a fast one later
>>>>>> on.
>>>>>>
>>>>>> The new version includes a statement that was never in doubt: that
>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>> versa.
>>>>>
>>>>> Dishonest dodge.
>>>>
>>>> Projection. You have avoided addressing everything I said. You are
>>>> still avoiding any clarification of your math poem despite saying that
>>>> that was essential before moving on.
>>>>
>>>>> void Infinite_Loop()
>>>>> {
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>> (u32)Infinite_Loop);
>>>>
>>>> Still using silly variable names.
>>>>
>>>>> }
>>>>
>>>> And still not posting the code. Here's the best we have to work with:
>>>>
>>>> bool Halts(u32 P, u32 I)
>>>> {
>>>> bool Halted = false;
>>>> bool Aborted = false;
>>>> while (!Halted && !Aborted)
>>>> {
>>>> Halted = DebugStep(P, I);
>>>> Aborted = Needs_To_Be_Aborted();
>>>> }
>>>> return !Aborted;
>>>> }
>>>>
>>>> As best as I can tell, unless you have really messed up, Halts will
>>>> return the right answer to main. If you'd actually read the text you
>>>> cut without comment, you'd know that.
>>>>> You keep trying try dodge the point that there are halting simulations
>>>>> of non halting computations.
>>>>
>>>> Ha! You didn't read the detailed analysis that I wrote, did you?
>>>> Or if
>>>> you did, you didn't understand it. It explicitly talked about partial
>>>> simulations of non-halting computations.
>>>>
>>>
>>> Every computation that only halts because its simulation was stopped
>>> is a non halting computation.
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> }
>>>
>>> void H_Hat2(u32 P)
>>> {
>>> u32 Input_Would_Halt = Simulate(P, P);
>>> }
>>>
>>> int main() {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>> }
>>>
>>> Halts never returns to H_Hat for the same reason that Simulate never
>>> returns to H_Hat2.
>>
>>
>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>
>> André
>>
>
> The same thing that happens when you run H_Hat(H_Hat) with many
> thousands of extra instructions. H_Hat(H_Hat) only halts because Halts
> aborts its otherwise infinite recursion.
But the point is it *does* halt. The halting problem asks whether a
particular TM run on a particular input eventually halts or whether it
continues to run forever. It doesn't ask *why* something halts.
And here you're running it inside Simulate(), not inside Halts(), so it
isn't your halt detector which is causing it to abort. Yes, H_Hat
includes code which is based on your halt decider, but that code isn't
your halt decider; its an integral part of H_Hat, so any aborting of a
loop is part of H_Hats normal operation, not some intervention to force
a nonhalting machine to terminate.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 23:16 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <pdidnUJkjKKHDRr9nZ2dnUU7-UudnZ2d@giganews.com> |
| In reply to | #32249 |
On 4/26/2021 11:14 PM, André G. Isaak wrote:
> On 2021-04-26 21:06, olcott wrote:
>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>> On 2021-04-26 20:02, olcott wrote:
>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms
>>>>>>>>>>>> such that
>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>> input would
>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>
>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>
>>>>>>>>>>> Putting aside the poetic touches (like giving Halting only an
>>>>>>>>>>> encoded TM
>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>
>>>>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm
>>>>>>>>>>> that
>>>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>>>> Flip the
>>>>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>>>>> don't claim
>>>>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>>>>> implementation is that it gets at least an infinite number of
>>>>>>>>>>> cases
>>>>>>>>>>> wrong.
>>>>>>>>>>>
>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be come
>>>>>>>>>>> clean
>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>>>> wrong about.
>>>>>>>>>>> It might just be the one case you do care about. (Spoiler:
>>>>>>>>>>> it is!)
>>>>>>>>>>
>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>
>>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>>
>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>> ¬Halting(x))
>>>>>>>>>
>>>>>>>>> was understood. I asked about it in order to try to work it
>>>>>>>>> out. Did
>>>>>>>>> you see the questions? If you did not understand them, why did
>>>>>>>>> you not
>>>>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>>>>> guessing
>>>>>>>>> what you mean?
>>>>>>>>>
>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>
>>>>>>>>
>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>
>>>>>>> So, not only won't you answer questions about the last version of
>>>>>>> this
>>>>>>> silly formula, you will just cut my comments because you say you
>>>>>>> won't
>>>>>>> move on until the nonsense is understood. But now, not only will
>>>>>>> you
>>>>>>> "move on", you will throw in another version with no apparent
>>>>>>> desire fir
>>>>>>> it to be understood either.
>>>>>>>
>>>>>>> So let me tell what your formula is. It's spin. All is does is
>>>>>>> give
>>>>>>> the property of non halting a new name. You hope the new new
>>>>>>> name and
>>>>>>> the association with "simulation" will help you full a fast one
>>>>>>> later
>>>>>>> on.
>>>>>>>
>>>>>>> The new version includes a statement that was never in doubt: that
>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>> versa.
>>>>>>
>>>>>> Dishonest dodge.
>>>>>
>>>>> Projection. You have avoided addressing everything I said. You are
>>>>> still avoiding any clarification of your math poem despite saying that
>>>>> that was essential before moving on.
>>>>>
>>>>>> void Infinite_Loop()
>>>>>> {
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>> (u32)Infinite_Loop);
>>>>>
>>>>> Still using silly variable names.
>>>>>
>>>>>> }
>>>>>
>>>>> And still not posting the code. Here's the best we have to work with:
>>>>>
>>>>> bool Halts(u32 P, u32 I)
>>>>> {
>>>>> bool Halted = false;
>>>>> bool Aborted = false;
>>>>> while (!Halted && !Aborted)
>>>>> {
>>>>> Halted = DebugStep(P, I);
>>>>> Aborted = Needs_To_Be_Aborted();
>>>>> }
>>>>> return !Aborted;
>>>>> }
>>>>>
>>>>> As best as I can tell, unless you have really messed up, Halts will
>>>>> return the right answer to main. If you'd actually read the text you
>>>>> cut without comment, you'd know that.
>>>>>> You keep trying try dodge the point that there are halting
>>>>>> simulations
>>>>>> of non halting computations.
>>>>>
>>>>> Ha! You didn't read the detailed analysis that I wrote, did you?
>>>>> Or if
>>>>> you did, you didn't understand it. It explicitly talked about partial
>>>>> simulations of non-halting computations.
>>>>>
>>>>
>>>> Every computation that only halts because its simulation was stopped
>>>> is a non halting computation.
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> }
>>>>
>>>> void H_Hat2(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>> }
>>>>
>>>> int main() {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>> }
>>>>
>>>> Halts never returns to H_Hat for the same reason that Simulate never
>>>> returns to H_Hat2.
>>>
>>>
>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>
>>> André
>>>
>>
>> The same thing that happens when you run H_Hat(H_Hat) with many
>> thousands of extra instructions. H_Hat(H_Hat) only halts because Halts
>> aborts its otherwise infinite recursion.
>
> But the point is it *does* halt.
No that it not the point otherwise infinite loops would be decided to
halt on the basis that they were forced to halt.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 22:32 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s6844h$uov$1@dont-email.me> |
| In reply to | #32251 |
On 2021-04-26 22:16, olcott wrote:
> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>> On 2021-04-26 21:06, olcott wrote:
>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>> On 2021-04-26 20:02, olcott wrote:
>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms
>>>>>>>>>>>>> such that
>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>> input would
>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>
>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>
>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting only
>>>>>>>>>>>> an encoded TM
>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>
>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some algorithm
>>>>>>>>>>>> that
>>>>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>>>>> Flip the
>>>>>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>>>>>> don't claim
>>>>>>>>>>>> to have one). The best you can hope for from a Must_be_Stopped
>>>>>>>>>>>> implementation is that it gets at least an infinite number
>>>>>>>>>>>> of cases
>>>>>>>>>>>> wrong.
>>>>>>>>>>>>
>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>> come clean
>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>>>>> wrong about.
>>>>>>>>>>>> It might just be the one case you do care about. (Spoiler:
>>>>>>>>>>>> it is!)
>>>>>>>>>>>
>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>
>>>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>>>
>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>
>>>>>>>>>> was understood. I asked about it in order to try to work it
>>>>>>>>>> out. Did
>>>>>>>>>> you see the questions? If you did not understand them, why
>>>>>>>>>> did you not
>>>>>>>>>> ask me for clarification. Would you like me to say again what's
>>>>>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>>>>>> guessing
>>>>>>>>>> what you mean?
>>>>>>>>>>
>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>
>>>>>>>> So, not only won't you answer questions about the last version
>>>>>>>> of this
>>>>>>>> silly formula, you will just cut my comments because you say you
>>>>>>>> won't
>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>> will you
>>>>>>>> "move on", you will throw in another version with no apparent
>>>>>>>> desire fir
>>>>>>>> it to be understood either.
>>>>>>>>
>>>>>>>> So let me tell what your formula is. It's spin. All is does is
>>>>>>>> give
>>>>>>>> the property of non halting a new name. You hope the new new
>>>>>>>> name and
>>>>>>>> the association with "simulation" will help you full a fast one
>>>>>>>> later
>>>>>>>> on.
>>>>>>>>
>>>>>>>> The new version includes a statement that was never in doubt: that
>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>> versa.
>>>>>>>
>>>>>>> Dishonest dodge.
>>>>>>
>>>>>> Projection. You have avoided addressing everything I said. You are
>>>>>> still avoiding any clarification of your math poem despite saying
>>>>>> that
>>>>>> that was essential before moving on.
>>>>>>
>>>>>>> void Infinite_Loop()
>>>>>>> {
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>> (u32)Infinite_Loop);
>>>>>>
>>>>>> Still using silly variable names.
>>>>>>
>>>>>>> }
>>>>>>
>>>>>> And still not posting the code. Here's the best we have to work
>>>>>> with:
>>>>>>
>>>>>> bool Halts(u32 P, u32 I)
>>>>>> {
>>>>>> bool Halted = false;
>>>>>> bool Aborted = false;
>>>>>> while (!Halted && !Aborted)
>>>>>> {
>>>>>> Halted = DebugStep(P, I);
>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>> }
>>>>>> return !Aborted;
>>>>>> }
>>>>>>
>>>>>> As best as I can tell, unless you have really messed up, Halts will
>>>>>> return the right answer to main. If you'd actually read the text you
>>>>>> cut without comment, you'd know that.
>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>> simulations
>>>>>>> of non halting computations.
>>>>>>
>>>>>> Ha! You didn't read the detailed analysis that I wrote, did you?
>>>>>> Or if
>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>> partial
>>>>>> simulations of non-halting computations.
>>>>>>
>>>>>
>>>>> Every computation that only halts because its simulation was
>>>>> stopped is a non halting computation.
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> }
>>>>>
>>>>> void H_Hat2(u32 P)
>>>>> {
>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>> }
>>>>>
>>>>> int main() {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>> }
>>>>>
>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>> never returns to H_Hat2.
>>>>
>>>>
>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>
>>>> André
>>>>
>>>
>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>> Halts aborts its otherwise infinite recursion.
>>
>> But the point is it *does* halt.
>
> No that it not the point otherwise infinite loops would be decided to
> halt on the basis that they were forced to halt.
You seem to be claiming that when your 'halt decider' disagrees with
what actually happens, your 'decider' is right and reality is wrong.
That's not a legitimate approach.
When you run Simulate(H_Hat, H_Hat), simulate doesn't abort H_Hat(H_Hat)
because it can't. And yet, H_Hat(H_Hat) still halts. That's because
H_Hat(H_Hat) does *not* actually contain an infinite loop because its
own code includes a provision for getting ending that loop.
That's why H_Hat(H_Hat) behaves differently from H_Hat2(H_Hat2). The
latter really does contain an infinite loop precisely because it does
not contain any instructions which allow it to end that loop. That means
the one halts and the other does not.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 23:44 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <baWdnRLvvKDjCxr9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #32252 |
On 4/26/2021 11:32 PM, André G. Isaak wrote:
> On 2021-04-26 22:16, olcott wrote:
>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>> On 2021-04-26 21:06, olcott wrote:
>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of axioms
>>>>>>>>>>>>>> such that
>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>
>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting only
>>>>>>>>>>>>> an encoded TM
>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>
>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>>>>>> Flip the
>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know you
>>>>>>>>>>>>> don't claim
>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>> implementation is that it gets at least an infinite number
>>>>>>>>>>>>> of cases
>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>> come clean
>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>>>>>> wrong about.
>>>>>>>>>>>>> It might just be the one case you do care about. (Spoiler:
>>>>>>>>>>>>> it is!)
>>>>>>>>>>>>
>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>
>>>>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>>>>
>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>
>>>>>>>>>>> was understood. I asked about it in order to try to work it
>>>>>>>>>>> out. Did
>>>>>>>>>>> you see the questions? If you did not understand them, why
>>>>>>>>>>> did you not
>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>> what's
>>>>>>>>>>> mysterious about it? Would you prefer to move with me simply
>>>>>>>>>>> guessing
>>>>>>>>>>> what you mean?
>>>>>>>>>>>
>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>
>>>>>>>>> So, not only won't you answer questions about the last version
>>>>>>>>> of this
>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>> you won't
>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>> will you
>>>>>>>>> "move on", you will throw in another version with no apparent
>>>>>>>>> desire fir
>>>>>>>>> it to be understood either.
>>>>>>>>>
>>>>>>>>> So let me tell what your formula is. It's spin. All is does
>>>>>>>>> is give
>>>>>>>>> the property of non halting a new name. You hope the new new
>>>>>>>>> name and
>>>>>>>>> the association with "simulation" will help you full a fast one
>>>>>>>>> later
>>>>>>>>> on.
>>>>>>>>>
>>>>>>>>> The new version includes a statement that was never in doubt: that
>>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>>> versa.
>>>>>>>>
>>>>>>>> Dishonest dodge.
>>>>>>>
>>>>>>> Projection. You have avoided addressing everything I said. You are
>>>>>>> still avoiding any clarification of your math poem despite saying
>>>>>>> that
>>>>>>> that was essential before moving on.
>>>>>>>
>>>>>>>> void Infinite_Loop()
>>>>>>>> {
>>>>>>>> HERE: goto HERE;
>>>>>>>> }
>>>>>>>>
>>>>>>>> int main()
>>>>>>>> {
>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>> (u32)Infinite_Loop);
>>>>>>>
>>>>>>> Still using silly variable names.
>>>>>>>
>>>>>>>> }
>>>>>>>
>>>>>>> And still not posting the code. Here's the best we have to work
>>>>>>> with:
>>>>>>>
>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>> {
>>>>>>> bool Halted = false;
>>>>>>> bool Aborted = false;
>>>>>>> while (!Halted && !Aborted)
>>>>>>> {
>>>>>>> Halted = DebugStep(P, I);
>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>> }
>>>>>>> return !Aborted;
>>>>>>> }
>>>>>>>
>>>>>>> As best as I can tell, unless you have really messed up, Halts will
>>>>>>> return the right answer to main. If you'd actually read the text
>>>>>>> you
>>>>>>> cut without comment, you'd know that.
>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>> simulations
>>>>>>>> of non halting computations.
>>>>>>>
>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did you?
>>>>>>> Or if
>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>> partial
>>>>>>> simulations of non-halting computations.
>>>>>>>
>>>>>>
>>>>>> Every computation that only halts because its simulation was
>>>>>> stopped is a non halting computation.
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> }
>>>>>>
>>>>>> void H_Hat2(u32 P)
>>>>>> {
>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>> }
>>>>>>
>>>>>> int main() {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>> }
>>>>>>
>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>> never returns to H_Hat2.
>>>>>
>>>>>
>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>>
>>>>> André
>>>>>
>>>>
>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>> Halts aborts its otherwise infinite recursion.
>>>
>>> But the point is it *does* halt.
>>
>> No that it not the point otherwise infinite loops would be decided to
>> halt on the basis that they were forced to halt.
>
> You seem to be claiming that when your 'halt decider' disagrees with
> what actually happens, your 'decider' is right and reality is wrong.
> That's not a legitimate approach.
>
> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort H_Hat(H_Hat)
> because it can't. And yet, H_Hat(H_Hat) still halts. That's because
> H_Hat(H_Hat) does *not* actually contain an infinite loop because its
> own code includes a provision for getting ending that loop.
>
Why lie?
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
> That's why H_Hat(H_Hat) behaves differently from H_Hat2(H_Hat2). The
> latter really does contain an infinite loop precisely because it does
> not contain any instructions which allow it to end that loop. That means
> the one halts and the other does not.
>
> André
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-26 22:48 -0600 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <s6853e$aie$1@dont-email.me> |
| In reply to | #32253 |
On 2021-04-26 22:44, olcott wrote:
> On 4/26/2021 11:32 PM, André G. Isaak wrote:
>> On 2021-04-26 22:16, olcott wrote:
>>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>>> On 2021-04-26 21:06, olcott wrote:
>>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of
>>>>>>>>>>>>>>> axioms such that
>>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting only
>>>>>>>>>>>>>> an encoded TM
>>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>>> captures what you call axioms) as a negative halt decider.
>>>>>>>>>>>>>> Flip the
>>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know
>>>>>>>>>>>>>> you don't claim
>>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>>> implementation is that it gets at least an infinite number
>>>>>>>>>>>>>> of cases
>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>>> come clean
>>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to be
>>>>>>>>>>>>>> wrong about.
>>>>>>>>>>>>>> It might just be the one case you do care about.
>>>>>>>>>>>>>> (Spoiler: it is!)
>>>>>>>>>>>>>
>>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>>
>>>>>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>>>>>
>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>
>>>>>>>>>>>> was understood. I asked about it in order to try to work it
>>>>>>>>>>>> out. Did
>>>>>>>>>>>> you see the questions? If you did not understand them, why
>>>>>>>>>>>> did you not
>>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>>> what's
>>>>>>>>>>>> mysterious about it? Would you prefer to move with me
>>>>>>>>>>>> simply guessing
>>>>>>>>>>>> what you mean?
>>>>>>>>>>>>
>>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>>
>>>>>>>>>> So, not only won't you answer questions about the last version
>>>>>>>>>> of this
>>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>>> you won't
>>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>>> will you
>>>>>>>>>> "move on", you will throw in another version with no apparent
>>>>>>>>>> desire fir
>>>>>>>>>> it to be understood either.
>>>>>>>>>>
>>>>>>>>>> So let me tell what your formula is. It's spin. All is does
>>>>>>>>>> is give
>>>>>>>>>> the property of non halting a new name. You hope the new new
>>>>>>>>>> name and
>>>>>>>>>> the association with "simulation" will help you full a fast
>>>>>>>>>> one later
>>>>>>>>>> on.
>>>>>>>>>>
>>>>>>>>>> The new version includes a statement that was never in doubt:
>>>>>>>>>> that
>>>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>>>> versa.
>>>>>>>>>
>>>>>>>>> Dishonest dodge.
>>>>>>>>
>>>>>>>> Projection. You have avoided addressing everything I said. You
>>>>>>>> are
>>>>>>>> still avoiding any clarification of your math poem despite
>>>>>>>> saying that
>>>>>>>> that was essential before moving on.
>>>>>>>>
>>>>>>>>> void Infinite_Loop()
>>>>>>>>> {
>>>>>>>>> HERE: goto HERE;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> int main()
>>>>>>>>> {
>>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>>> (u32)Infinite_Loop);
>>>>>>>>
>>>>>>>> Still using silly variable names.
>>>>>>>>
>>>>>>>>> }
>>>>>>>>
>>>>>>>> And still not posting the code. Here's the best we have to work
>>>>>>>> with:
>>>>>>>>
>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>> {
>>>>>>>> bool Halted = false;
>>>>>>>> bool Aborted = false;
>>>>>>>> while (!Halted && !Aborted)
>>>>>>>> {
>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>> }
>>>>>>>> return !Aborted;
>>>>>>>> }
>>>>>>>>
>>>>>>>> As best as I can tell, unless you have really messed up, Halts will
>>>>>>>> return the right answer to main. If you'd actually read the
>>>>>>>> text you
>>>>>>>> cut without comment, you'd know that.
>>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>>> simulations
>>>>>>>>> of non halting computations.
>>>>>>>>
>>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did
>>>>>>>> you? Or if
>>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>>> partial
>>>>>>>> simulations of non-halting computations.
>>>>>>>>
>>>>>>>
>>>>>>> Every computation that only halts because its simulation was
>>>>>>> stopped is a non halting computation.
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> }
>>>>>>>
>>>>>>> void H_Hat2(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>>> }
>>>>>>>
>>>>>>> int main() {
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>> }
>>>>>>>
>>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>>> never returns to H_Hat2.
>>>>>>
>>>>>>
>>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>>> Halts aborts its otherwise infinite recursion.
>>>>
>>>> But the point is it *does* halt.
>>>
>>> No that it not the point otherwise infinite loops would be decided to
>>> halt on the basis that they were forced to halt.
>>
>> You seem to be claiming that when your 'halt decider' disagrees with
>> what actually happens, your 'decider' is right and reality is wrong.
>> That's not a legitimate approach.
>>
>> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort
>> H_Hat(H_Hat) because it can't. And yet, H_Hat(H_Hat) still halts.
>> That's because H_Hat(H_Hat) does *not* actually contain an infinite
>> loop because its own code includes a provision for getting ending that
>> loop.
>>
>
> Why lie?
I didn't.
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
Your point?
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-26 23:55 -0500 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <Teudndbu59GVBBr9nZ2dnUU7-V2dnZ2d@giganews.com> |
| In reply to | #32254 |
On 4/26/2021 11:48 PM, André G. Isaak wrote:
> On 2021-04-26 22:44, olcott wrote:
>> On 4/26/2021 11:32 PM, André G. Isaak wrote:
>>> On 2021-04-26 22:16, olcott wrote:
>>>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>>>> On 2021-04-26 21:06, olcott wrote:
>>>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of
>>>>>>>>>>>>>>>> axioms such that
>>>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting
>>>>>>>>>>>>>>> only an encoded TM
>>>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>>>> captures what you call axioms) as a negative halt
>>>>>>>>>>>>>>> decider. Flip the
>>>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know
>>>>>>>>>>>>>>> you don't claim
>>>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>>>> implementation is that it gets at least an infinite
>>>>>>>>>>>>>>> number of cases
>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>>>> come clean
>>>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to
>>>>>>>>>>>>>>> be wrong about.
>>>>>>>>>>>>>>> It might just be the one case you do care about.
>>>>>>>>>>>>>>> (Spoiler: it is!)
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>>>
>>>>>>>>>>>>> Whoa! It was you that would not move on until your delightful
>>>>>>>>>>>>>
>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>
>>>>>>>>>>>>> was understood. I asked about it in order to try to work
>>>>>>>>>>>>> it out. Did
>>>>>>>>>>>>> you see the questions? If you did not understand them, why
>>>>>>>>>>>>> did you not
>>>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>>>> what's
>>>>>>>>>>>>> mysterious about it? Would you prefer to move with me
>>>>>>>>>>>>> simply guessing
>>>>>>>>>>>>> what you mean?
>>>>>>>>>>>>>
>>>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>>>
>>>>>>>>>>> So, not only won't you answer questions about the last
>>>>>>>>>>> version of this
>>>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>>>> you won't
>>>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>>>> will you
>>>>>>>>>>> "move on", you will throw in another version with no apparent
>>>>>>>>>>> desire fir
>>>>>>>>>>> it to be understood either.
>>>>>>>>>>>
>>>>>>>>>>> So let me tell what your formula is. It's spin. All is does
>>>>>>>>>>> is give
>>>>>>>>>>> the property of non halting a new name. You hope the new new
>>>>>>>>>>> name and
>>>>>>>>>>> the association with "simulation" will help you full a fast
>>>>>>>>>>> one later
>>>>>>>>>>> on.
>>>>>>>>>>>
>>>>>>>>>>> The new version includes a statement that was never in doubt:
>>>>>>>>>>> that
>>>>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>>>>> versa.
>>>>>>>>>>
>>>>>>>>>> Dishonest dodge.
>>>>>>>>>
>>>>>>>>> Projection. You have avoided addressing everything I said.
>>>>>>>>> You are
>>>>>>>>> still avoiding any clarification of your math poem despite
>>>>>>>>> saying that
>>>>>>>>> that was essential before moving on.
>>>>>>>>>
>>>>>>>>>> void Infinite_Loop()
>>>>>>>>>> {
>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> int main()
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>>>> (u32)Infinite_Loop);
>>>>>>>>>
>>>>>>>>> Still using silly variable names.
>>>>>>>>>
>>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> And still not posting the code. Here's the best we have to
>>>>>>>>> work with:
>>>>>>>>>
>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>> {
>>>>>>>>> bool Halted = false;
>>>>>>>>> bool Aborted = false;
>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>> {
>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>> }
>>>>>>>>> return !Aborted;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> As best as I can tell, unless you have really messed up, Halts
>>>>>>>>> will
>>>>>>>>> return the right answer to main. If you'd actually read the
>>>>>>>>> text you
>>>>>>>>> cut without comment, you'd know that.
>>>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>>>> simulations
>>>>>>>>>> of non halting computations.
>>>>>>>>>
>>>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did
>>>>>>>>> you? Or if
>>>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>>>> partial
>>>>>>>>> simulations of non-halting computations.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Every computation that only halts because its simulation was
>>>>>>>> stopped is a non halting computation.
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>> }
>>>>>>>>
>>>>>>>> void H_Hat2(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>>>> }
>>>>>>>>
>>>>>>>> int main() {
>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>> }
>>>>>>>>
>>>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>>>> never returns to H_Hat2.
>>>>>>>
>>>>>>>
>>>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>>>> Halts aborts its otherwise infinite recursion.
>>>>>
>>>>> But the point is it *does* halt.
>>>>
>>>> No that it not the point otherwise infinite loops would be decided
>>>> to halt on the basis that they were forced to halt.
>>>
>>> You seem to be claiming that when your 'halt decider' disagrees with
>>> what actually happens, your 'decider' is right and reality is wrong.
>>> That's not a legitimate approach.
>>>
>>> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort
>>> H_Hat(H_Hat) because it can't. And yet, H_Hat(H_Hat) still halts.
>>> That's because H_Hat(H_Hat) does *not* actually contain an infinite
>>> loop because its own code includes a provision for getting ending
>>> that loop.
>>>
>>
>> Why lie?
>
> I didn't.
>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>
> Your point?
>
> André
>
You know that Halts() forces H_Hat infinite recursion to be aborted I
have proved it too many times.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
H_Hat((u32)H_Hat);
}
_H_Hat()
[00000b98](01) 55 push ebp
[00000b99](02) 8bec mov ebp,esp
[00000b9b](01) 51 push ecx
[00000b9c](03) 8b4508 mov eax,[ebp+08]
[00000b9f](01) 50 push eax
[00000ba0](03) 8b4d08 mov ecx,[ebp+08]
[00000ba3](01) 51 push ecx
[00000ba4](05) e88ffdffff call 00000938
[00000ba9](03) 83c408 add esp,+08
[00000bac](03) 8945fc mov [ebp-04],eax
[00000baf](04) 837dfc00 cmp dword [ebp-04],+00
[00000bb3](02) 7402 jz 00000bb7
[00000bb5](02) ebfe jmp 00000bb5
[00000bb7](02) 8be5 mov esp,ebp
[00000bb9](01) 5d pop ebp
[00000bba](01) c3 ret
Size in bytes:(0035) [00000bba]
_main()
[00000bc8](01) 55 push ebp
[00000bc9](02) 8bec mov ebp,esp
[00000bcb](05) 68980b0000 push 00000b98
[00000bd0](05) e8c3ffffff call 00000b98
[00000bd5](03) 83c404 add esp,+04
[00000bd8](02) 33c0 xor eax,eax
[00000bda](01) 5d pop ebp
[00000bdb](01) c3 ret
Size in bytes:(0020) [00000bdb]
===============================
...[00000bc8][001015d4][00000000](01) 55 push ebp
...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
...[00000bcb][001015d0][00000b98](05) 68980b0000 push 00000b98
...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call 00000b98
...[00000b98][001015c8][001015d4](01) 55 push ebp
...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
...[00000b9b][001015c4][00000000](01) 51 push ecx
...[00000b9c][001015c4][00000000](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][001015c0][00000b98](01) 50 push eax
...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][001015bc][00000b98](01) 51 push ecx
...[00000ba4][001015b8][00000ba9](05) e88ffdffff call 00000938
Begin Local Halt Decider Simulation at Machine Address:b98
...[00000b98][00211674][00211678](01) 55 push ebp
...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
...[00000b9b][00211670][00201644](01) 51 push ecx
...[00000b9c][00211670][00201644](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][0021166c][00000b98](01) 50 push eax
...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][00211668][00000b98](01) 51 push ecx
...[00000ba4][00211664][00000ba9](05) e88ffdffff call 00000938
...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
...[00000b9b][0025c098][0024c06c](01) 51 push ecx
...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
eax,[ebp+08]
...[00000b9f][0025c094][00000b98](01) 50 push eax
...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
ecx,[ebp+08]
...[00000ba3][0025c090][00000b98](01) 51 push ecx
...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call 00000938
Local Halt Decider: Infinite Recursion Detected Simulation Stopped
...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
...[00000bac][001015c4][00000000](03) 8945fc mov
[ebp-04],eax
...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
[ebp-04],+00
...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
...[00000bba][001015d0][00000b98](01) c3 ret
...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
...[00000bda][001015d8][00100000](01) 5d pop ebp
...[00000bdb][001015dc][00000098](01) c3 ret
Number_of_User_Instructions(39)
Number of Instructions Executed(26567)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-27 07:14 -0400 |
| Subject | Re: What is a computation? (legitimate difficulty) |
| Message-ID | <PmShI.29705$b27.28280@fx03.iad> |
| In reply to | #32255 |
On 4/27/21 12:55 AM, olcott wrote:
> On 4/26/2021 11:48 PM, André G. Isaak wrote:
>> On 2021-04-26 22:44, olcott wrote:
>>> On 4/26/2021 11:32 PM, André G. Isaak wrote:
>>>> On 2021-04-26 22:16, olcott wrote:
>>>>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>>>>> On 2021-04-26 21:06, olcott wrote:
>>>>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of
>>>>>>>>>>>>>>>>> axioms such that
>>>>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting
>>>>>>>>>>>>>>>> only an encoded TM
>>>>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>>>>> captures what you call axioms) as a negative halt
>>>>>>>>>>>>>>>> decider. Flip the
>>>>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know
>>>>>>>>>>>>>>>> you don't claim
>>>>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>>>>> implementation is that it gets at least an infinite
>>>>>>>>>>>>>>>> number of cases
>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>>>>> come clean
>>>>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to
>>>>>>>>>>>>>>>> be wrong about.
>>>>>>>>>>>>>>>> It might just be the one case you do care about.
>>>>>>>>>>>>>>>> (Spoiler: it is!)
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Whoa! It was you that would not move on until your
>>>>>>>>>>>>>> delightful
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x)
>>>>>>>>>>>>>> ≡ ¬Halting(x))
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> was understood. I asked about it in order to try to work
>>>>>>>>>>>>>> it out. Did
>>>>>>>>>>>>>> you see the questions? If you did not understand them,
>>>>>>>>>>>>>> why did you not
>>>>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>>>>> what's
>>>>>>>>>>>>>> mysterious about it? Would you prefer to move with me
>>>>>>>>>>>>>> simply guessing
>>>>>>>>>>>>>> what you mean?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>>>>
>>>>>>>>>>>> So, not only won't you answer questions about the last
>>>>>>>>>>>> version of this
>>>>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>>>>> you won't
>>>>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>>>>> will you
>>>>>>>>>>>> "move on", you will throw in another version with no
>>>>>>>>>>>> apparent desire fir
>>>>>>>>>>>> it to be understood either.
>>>>>>>>>>>>
>>>>>>>>>>>> So let me tell what your formula is. It's spin. All is
>>>>>>>>>>>> does is give
>>>>>>>>>>>> the property of non halting a new name. You hope the new
>>>>>>>>>>>> new name and
>>>>>>>>>>>> the association with "simulation" will help you full a fast
>>>>>>>>>>>> one later
>>>>>>>>>>>> on.
>>>>>>>>>>>>
>>>>>>>>>>>> The new version includes a statement that was never in
>>>>>>>>>>>> doubt: that
>>>>>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>>>>>> versa.
>>>>>>>>>>>
>>>>>>>>>>> Dishonest dodge.
>>>>>>>>>>
>>>>>>>>>> Projection. You have avoided addressing everything I said.
>>>>>>>>>> You are
>>>>>>>>>> still avoiding any clarification of your math poem despite
>>>>>>>>>> saying that
>>>>>>>>>> that was essential before moving on.
>>>>>>>>>>
>>>>>>>>>>> void Infinite_Loop()
>>>>>>>>>>> {
>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> int main()
>>>>>>>>>>> {
>>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>>>>> (u32)Infinite_Loop);
>>>>>>>>>>
>>>>>>>>>> Still using silly variable names.
>>>>>>>>>>
>>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> And still not posting the code. Here's the best we have to
>>>>>>>>>> work with:
>>>>>>>>>>
>>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>>> {
>>>>>>>>>> bool Halted = false;
>>>>>>>>>> bool Aborted = false;
>>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>>> {
>>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>>> }
>>>>>>>>>> return !Aborted;
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> As best as I can tell, unless you have really messed up, Halts
>>>>>>>>>> will
>>>>>>>>>> return the right answer to main. If you'd actually read the
>>>>>>>>>> text you
>>>>>>>>>> cut without comment, you'd know that.
>>>>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>>>>> simulations
>>>>>>>>>>> of non halting computations.
>>>>>>>>>>
>>>>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did
>>>>>>>>>> you? Or if
>>>>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>>>>> partial
>>>>>>>>>> simulations of non-halting computations.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Every computation that only halts because its simulation was
>>>>>>>>> stopped is a non halting computation.
>>>>>>>>>
>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>> {
>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> void H_Hat2(u32 P)
>>>>>>>>> {
>>>>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> int main() {
>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>>>>> never returns to H_Hat2.
>>>>>>>>
>>>>>>>>
>>>>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>>>>> Halts aborts its otherwise infinite recursion.
>>>>>>
>>>>>> But the point is it *does* halt.
>>>>>
>>>>> No that it not the point otherwise infinite loops would be decided
>>>>> to halt on the basis that they were forced to halt.
>>>>
>>>> You seem to be claiming that when your 'halt decider' disagrees with
>>>> what actually happens, your 'decider' is right and reality is wrong.
>>>> That's not a legitimate approach.
>>>>
>>>> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort
>>>> H_Hat(H_Hat) because it can't. And yet, H_Hat(H_Hat) still halts.
>>>> That's because H_Hat(H_Hat) does *not* actually contain an infinite
>>>> loop because its own code includes a provision for getting ending
>>>> that loop.
>>>>
>>>
>>> Why lie?
>>
>> I didn't.
>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>
>> Your point?
>>
>> André
>>
>
> You know that Halts() forces H_Hat infinite recursion to be aborted I
> have proved it too many times.
>
H_Hat terminates its own possible infinite recursion due to the action
of the code in ITS copy of Halts which IS part of its machine.
THIS makes it a halting Computation.
You use defective definitions.
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
> [00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
> 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
> 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
> 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
> 00000938
IMPROPER TRACE RIGHT HERE!!!!!!!!
Code that is part of the process of H_Hat is NOT shown.
The execution of the code in the machine H_Hat of its copy of Halt.
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
> 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
Bad Decision. Ignores the operation of Halts within H_Hat.
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov
> [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
> [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
>
>
1) Halts is stipulated to meet the requirements of a Halt Decider for
Computation Theory, as used in the proof of Linz and Sipser.
2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
asked direction
3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
halt when the Halt decider it is built on decides H_Hat’s input is
non-Halting on itself.
4) 1 Means that Halts is a Computation, and will always return the same
answer (or never return an answer) for a given input.
5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
H_Hat)
6) by 4 and 2, this means that Halts will return the decision on
non-halting to H_Hat
7) By 3, this means that H_Hat will Halt.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-27 09:13 -0500 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <obqdnYSb1N9uhhX9nZ2dnUU7-efNnZ2d@giganews.com> |
| In reply to | #32262 |
On 4/27/2021 6:14 AM, Richard Damon wrote:
> On 4/27/21 12:55 AM, olcott wrote:
>> On 4/26/2021 11:48 PM, André G. Isaak wrote:
>>> On 2021-04-26 22:44, olcott wrote:
>>>> On 4/26/2021 11:32 PM, André G. Isaak wrote:
>>>>> On 2021-04-26 22:16, olcott wrote:
>>>>>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>>>>>> On 2021-04-26 21:06, olcott wrote:
>>>>>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of
>>>>>>>>>>>>>>>>>> axioms such that
>>>>>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting
>>>>>>>>>>>>>>>>> only an encoded TM
>>>>>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>>>>>> captures what you call axioms) as a negative halt
>>>>>>>>>>>>>>>>> decider. Flip the
>>>>>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know
>>>>>>>>>>>>>>>>> you don't claim
>>>>>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>>>>>> implementation is that it gets at least an infinite
>>>>>>>>>>>>>>>>> number of cases
>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>>>>>> come clean
>>>>>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to
>>>>>>>>>>>>>>>>> be wrong about.
>>>>>>>>>>>>>>>>> It might just be the one case you do care about.
>>>>>>>>>>>>>>>>> (Spoiler: it is!)
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Whoa! It was you that would not move on until your
>>>>>>>>>>>>>>> delightful
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x)
>>>>>>>>>>>>>>> ≡ ¬Halting(x))
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> was understood. I asked about it in order to try to work
>>>>>>>>>>>>>>> it out. Did
>>>>>>>>>>>>>>> you see the questions? If you did not understand them,
>>>>>>>>>>>>>>> why did you not
>>>>>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>>>>>> what's
>>>>>>>>>>>>>>> mysterious about it? Would you prefer to move with me
>>>>>>>>>>>>>>> simply guessing
>>>>>>>>>>>>>>> what you mean?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>>>>>
>>>>>>>>>>>>> So, not only won't you answer questions about the last
>>>>>>>>>>>>> version of this
>>>>>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>>>>>> you won't
>>>>>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>>>>>> will you
>>>>>>>>>>>>> "move on", you will throw in another version with no
>>>>>>>>>>>>> apparent desire fir
>>>>>>>>>>>>> it to be understood either.
>>>>>>>>>>>>>
>>>>>>>>>>>>> So let me tell what your formula is. It's spin. All is
>>>>>>>>>>>>> does is give
>>>>>>>>>>>>> the property of non halting a new name. You hope the new
>>>>>>>>>>>>> new name and
>>>>>>>>>>>>> the association with "simulation" will help you full a fast
>>>>>>>>>>>>> one later
>>>>>>>>>>>>> on.
>>>>>>>>>>>>>
>>>>>>>>>>>>> The new version includes a statement that was never in
>>>>>>>>>>>>> doubt: that
>>>>>>>>>>>>> non-halting computations have non-halting simulations, and vice
>>>>>>>>>>>>> versa.
>>>>>>>>>>>>
>>>>>>>>>>>> Dishonest dodge.
>>>>>>>>>>>
>>>>>>>>>>> Projection. You have avoided addressing everything I said.
>>>>>>>>>>> You are
>>>>>>>>>>> still avoiding any clarification of your math poem despite
>>>>>>>>>>> saying that
>>>>>>>>>>> that was essential before moving on.
>>>>>>>>>>>
>>>>>>>>>>>> void Infinite_Loop()
>>>>>>>>>>>> {
>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> int main()
>>>>>>>>>>>> {
>>>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>>>>>> (u32)Infinite_Loop);
>>>>>>>>>>>
>>>>>>>>>>> Still using silly variable names.
>>>>>>>>>>>
>>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> And still not posting the code. Here's the best we have to
>>>>>>>>>>> work with:
>>>>>>>>>>>
>>>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>>>> {
>>>>>>>>>>> bool Halted = false;
>>>>>>>>>>> bool Aborted = false;
>>>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>>>> {
>>>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>>>> }
>>>>>>>>>>> return !Aborted;
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> As best as I can tell, unless you have really messed up, Halts
>>>>>>>>>>> will
>>>>>>>>>>> return the right answer to main. If you'd actually read the
>>>>>>>>>>> text you
>>>>>>>>>>> cut without comment, you'd know that.
>>>>>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>>>>>> simulations
>>>>>>>>>>>> of non halting computations.
>>>>>>>>>>>
>>>>>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did
>>>>>>>>>>> you? Or if
>>>>>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>>>>>> partial
>>>>>>>>>>> simulations of non-halting computations.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Every computation that only halts because its simulation was
>>>>>>>>>> stopped is a non halting computation.
>>>>>>>>>>
>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> void H_Hat2(u32 P)
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> int main() {
>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>>>>>> never returns to H_Hat2.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not H_Hat2]
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>>>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>>>>>> Halts aborts its otherwise infinite recursion.
>>>>>>>
>>>>>>> But the point is it *does* halt.
>>>>>>
>>>>>> No that it not the point otherwise infinite loops would be decided
>>>>>> to halt on the basis that they were forced to halt.
>>>>>
>>>>> You seem to be claiming that when your 'halt decider' disagrees with
>>>>> what actually happens, your 'decider' is right and reality is wrong.
>>>>> That's not a legitimate approach.
>>>>>
>>>>> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort
>>>>> H_Hat(H_Hat) because it can't. And yet, H_Hat(H_Hat) still halts.
>>>>> That's because H_Hat(H_Hat) does *not* actually contain an infinite
>>>>> loop because its own code includes a provision for getting ending
>>>>> that loop.
>>>>>
>>>>
>>>> Why lie?
>>>
>>> I didn't.
>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>
>>> Your point?
>>>
>>> André
>>>
>>
>> You know that Halts() forces H_Hat infinite recursion to be aborted I
>> have proved it too many times.
>>
>
> H_Hat terminates its own possible infinite recursion due to the action
> of the code in ITS copy of Halts which IS part of its machine.
>
> THIS makes it a halting Computation.
>
> You use defective definitions.
>
>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>>
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> }
>>
>>
>> _H_Hat()
>> [00000b98](01) 55 push ebp
>> [00000b99](02) 8bec mov ebp,esp
>> [00000b9b](01) 51 push ecx
>> [00000b9c](03) 8b4508 mov eax,[ebp+08]
>> [00000b9f](01) 50 push eax
>> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
>> [00000ba3](01) 51 push ecx
>> [00000ba4](05) e88ffdffff call 00000938
>> [00000ba9](03) 83c408 add esp,+08
>> [00000bac](03) 8945fc mov [ebp-04],eax
>> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
>> [00000bb3](02) 7402 jz 00000bb7
>> [00000bb5](02) ebfe jmp 00000bb5
>> [00000bb7](02) 8be5 mov esp,ebp
>> [00000bb9](01) 5d pop ebp
>> [00000bba](01) c3 ret
>> Size in bytes:(0035) [00000bba]
>>
>> _main()
>> [00000bc8](01) 55 push ebp
>> [00000bc9](02) 8bec mov ebp,esp
>> [00000bcb](05) 68980b0000 push 00000b98
>> [00000bd0](05) e8c3ffffff call 00000b98
>> [00000bd5](03) 83c404 add esp,+04
>> [00000bd8](02) 33c0 xor eax,eax
>> [00000bda](01) 5d pop ebp
>> [00000bdb](01) c3 ret
>> Size in bytes:(0020) [00000bdb]
>>
>> ===============================
>> ...[00000bc8][001015d4][00000000](01) 55 push ebp
>> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
>> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
>> 00000b98
>> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
>> 00000b98
>> ...[00000b98][001015c8][001015d4](01) 55 push ebp
>> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
>> ...[00000b9b][001015c4][00000000](01) 51 push ecx
>> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][001015c0][00000b98](01) 50 push eax
>> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
>> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
>> 00000938
>> Begin Local Halt Decider Simulation at Machine Address:b98
>> ...[00000b98][00211674][00211678](01) 55 push ebp
>> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
>> ...[00000b9b][00211670][00201644](01) 51 push ecx
>> ...[00000b9c][00211670][00201644](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][0021166c][00000b98](01) 50 push eax
>> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][00211668][00000b98](01) 51 push ecx
>> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
>> 00000938
>
> IMPROPER TRACE RIGHT HERE!!!!!!!!
>
> Code that is part of the process of H_Hat is NOT shown.
> The execution of the code in the machine H_Hat of its copy of Halt.
>
>> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
>> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
>> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
>> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][0025c094][00000b98](01) 50 push eax
>> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
>> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
>> 00000938
>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>
> Bad Decision. Ignores the operation of Halts within H_Hat.
>
The code that is not shown does not cause the infinite recursion it
merely stops it when it is detected.
It is known to be a good decision on the basis that the only reason
H_Hat() stops is this correct decision to stop simulating H_Hat.
Because H_Hat calls Halts in infinite recursion the second
line of H_Hat() @ machine address 0xba9 is never reached.
You don't seem to have the basic software engineering skill to
understand that functions called in infinite recursion never return any
value to their caller so here a a concrete example:
// This function never reaches its second line @ machine address 0xc55
// This function never reaches its second line @ machine address 0xc55
// This function never reaches its second line @ machine address 0xc55
int Infinite_Recursion(u32 N)
{
u32 M = Infinite_Recursion(N);
return M;
}
int main()
{
Infinite_Recursion(3);
}
_Infinite_Recursion()
[00000c48](01) 55 push ebp
[00000c49](02) 8bec mov ebp,esp
[00000c4b](01) 51 push ecx
[00000c4c](03) 8b4508 mov eax,[ebp+08]
[00000c4f](01) 50 push eax
[00000c50](05) e8f3ffffff call 00000c48
// The next line is never reached
// The next line is never reached
// The next line is never reached
[00000c55](03) 83c404 add esp,+04
[00000c58](03) 8945fc mov [ebp-04],eax
[00000c5b](03) 8b45fc mov eax,[ebp-04]
[00000c5e](02) 8be5 mov esp,ebp
[00000c60](01) 5d pop ebp
[00000c61](01) c3 ret
Size in bytes:(0026) [00000c61]
_main()
[00000c68](01) 55 push ebp
[00000c69](02) 8bec mov ebp,esp
[00000c6b](02) 6a03 push +03
[00000c6d](05) e8d6ffffff call 00000c48
[00000c72](03) 83c404 add esp,+04
[00000c75](02) 33c0 xor eax,eax
[00000c77](01) 5d pop ebp
[00000c78](01) c3 ret
Size in bytes:(0017) [00000c78]
===============================
...[00000c68][00101700][00000000](01) 55 push ebp
...[00000c69][00101700][00000000](02) 8bec mov ebp,esp
...[00000c6b][001016fc][00000003](02) 6a03 push +03
...[00000c6d][001016f8][00000c72](05) e8d6ffffff call 00000c48
...[00000c48][001016f4][00101700](01) 55 push ebp
...[00000c49][001016f4][00101700](02) 8bec mov ebp,esp
...[00000c4b][001016f0][00000000](01) 51 push ecx
...[00000c4c][001016f0][00000000](03) 8b4508 mov
eax,[ebp+08]
...[00000c4f][001016ec][00000003](01) 50 push eax
...[00000c50][001016e8][00000c55](05) e8f3ffffff call 00000c48
...[00000c48][001016e4][001016f4](01) 55 push ebp
...[00000c49][001016e4][001016f4](02) 8bec mov ebp,esp
...[00000c4b][001016e0][00000000](01) 51 push ecx
...[00000c4c][001016e0][00000000](03) 8b4508 mov
eax,[ebp+08]
...[00000c4f][001016dc][00000003](01) 50 push eax
...[00000c50][001016d8][00000c55](05) e8f3ffffff call 00000c48
...[00000c48][001016d4][001016e4](01) 55 push ebp
...[00000c49][001016d4][001016e4](02) 8bec mov ebp,esp
...[00000c4b][001016d0][00000000](01) 51 push ecx
...[00000c4c][001016d0][00000000](03) 8b4508 mov
eax,[ebp+08]
...[00000c4f][001016cc][00000003](01) 50 push eax
...[00000c50][001016c8][00000c55](05) e8f3ffffff call 00000c48
>> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
>> ...[00000bac][001015c4][00000000](03) 8945fc mov
>> [ebp-04],eax
>> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
>> [ebp-04],+00
>> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
>> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
>> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
>> ...[00000bba][001015d0][00000b98](01) c3 ret
>> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
>> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
>> ...[00000bda][001015d8][00100000](01) 5d pop ebp
>> ...[00000bdb][001015dc][00000098](01) c3 ret
>> Number_of_User_Instructions(39)
>> Number of Instructions Executed(26567)
>>
>>
>
>
> 1) Halts is stipulated to meet the requirements of a Halt Decider for
> Computation Theory, as used in the proof of Linz and Sipser.
>
> 2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
> asked direction
>
> 3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
> halt when the Halt decider it is built on decides H_Hat’s input is
> non-Halting on itself.
>
> 4) 1 Means that Halts is a Computation, and will always return the same
> answer (or never return an answer) for a given input.
>
> 5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
> H_Hat)
>
> 6) by 4 and 2, this means that Halts will return the decision on
> non-halting to H_Hat
>
> 7) By 3, this means that H_Hat will Halt.
>
--
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-27 10:53 -0400 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <mzVhI.43511$sd3.25729@fx02.iad> |
| In reply to | #32264 |
On 4/27/21 10:13 AM, olcott wrote:
> On 4/27/2021 6:14 AM, Richard Damon wrote:
>> On 4/27/21 12:55 AM, olcott wrote:
>>> On 4/26/2021 11:48 PM, André G. Isaak wrote:
>>>> On 2021-04-26 22:44, olcott wrote:
>>>>> On 4/26/2021 11:32 PM, André G. Isaak wrote:
>>>>>> On 2021-04-26 22:16, olcott wrote:
>>>>>>> On 4/26/2021 11:14 PM, André G. Isaak wrote:
>>>>>>>> On 2021-04-26 21:06, olcott wrote:
>>>>>>>>> On 4/26/2021 9:56 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-04-26 20:02, olcott wrote:
>>>>>>>>>>> On 4/26/2021 8:18 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 4/26/2021 7:21 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 4/26/2021 8:15 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 4/25/2021 3:56 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> If we hypothesize that Halts() has a correct set of
>>>>>>>>>>>>>>>>>>> axioms such that
>>>>>>>>>>>>>>>>>>> every time it decides to stop simulating its input this
>>>>>>>>>>>>>>>>>>> input would
>>>>>>>>>>>>>>>>>>> never otherwise halt then:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡
>>>>>>>>>>>>>>>>>>> ¬Halting(x))
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Putting aside the poetic touches (like giving Halting
>>>>>>>>>>>>>>>>>> only an encoded TM
>>>>>>>>>>>>>>>>>> and leaving the reader to guess what kind of thing
>>>>>>>>>>>>>>>>>> Must_be_Stopped is)
>>>>>>>>>>>>>>>>>> you are simply hypothesising a halt decider.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The above defines Must_be_Stopped (presumably some
>>>>>>>>>>>>>>>>>> algorithm that
>>>>>>>>>>>>>>>>>> captures what you call axioms) as a negative halt
>>>>>>>>>>>>>>>>>> decider. Flip the
>>>>>>>>>>>>>>>>>> result, and you have a halt decider. You don't (I know
>>>>>>>>>>>>>>>>>> you don't claim
>>>>>>>>>>>>>>>>>> to have one). The best you can hope for from a
>>>>>>>>>>>>>>>>>> Must_be_Stopped
>>>>>>>>>>>>>>>>>> implementation is that it gets at least an infinite
>>>>>>>>>>>>>>>>>> number of cases
>>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Whilst you don't claim to have halt decider, you need be
>>>>>>>>>>>>>>>>>> come clean
>>>>>>>>>>>>>>>>>> about exactly which cases you permit Must_be_Stopped to
>>>>>>>>>>>>>>>>>> be wrong about.
>>>>>>>>>>>>>>>>>> It might just be the one case you do care about.
>>>>>>>>>>>>>>>>>> (Spoiler: it is!)
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> void H_Hat(u32 P) ...
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Whoa! It was you that would not move on until your
>>>>>>>>>>>>>>>> delightful
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x)
>>>>>>>>>>>>>>>> ≡ ¬Halting(x))
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> was understood. I asked about it in order to try to work
>>>>>>>>>>>>>>>> it out. Did
>>>>>>>>>>>>>>>> you see the questions? If you did not understand them,
>>>>>>>>>>>>>>>> why did you not
>>>>>>>>>>>>>>>> ask me for clarification. Would you like me to say again
>>>>>>>>>>>>>>>> what's
>>>>>>>>>>>>>>>> mysterious about it? Would you prefer to move with me
>>>>>>>>>>>>>>>> simply guessing
>>>>>>>>>>>>>>>> what you mean?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> PO: "I only want an honest dialogue."
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> ∀x ∈ Turing_Machine_Descriptions
>>>>>>>>>>>>>>> ∀y ∈ Finite_Strings
>>>>>>>>>>>>>>> (UTM(x, y) = ∞) ≡ Must_Be_Stopped(x,y) ≡ ¬Halting(x,y))
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> So, not only won't you answer questions about the last
>>>>>>>>>>>>>> version of this
>>>>>>>>>>>>>> silly formula, you will just cut my comments because you say
>>>>>>>>>>>>>> you won't
>>>>>>>>>>>>>> move on until the nonsense is understood. But now, not only
>>>>>>>>>>>>>> will you
>>>>>>>>>>>>>> "move on", you will throw in another version with no
>>>>>>>>>>>>>> apparent desire fir
>>>>>>>>>>>>>> it to be understood either.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> So let me tell what your formula is. It's spin. All is
>>>>>>>>>>>>>> does is give
>>>>>>>>>>>>>> the property of non halting a new name. You hope the new
>>>>>>>>>>>>>> new name and
>>>>>>>>>>>>>> the association with "simulation" will help you full a fast
>>>>>>>>>>>>>> one later
>>>>>>>>>>>>>> on.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The new version includes a statement that was never in
>>>>>>>>>>>>>> doubt: that
>>>>>>>>>>>>>> non-halting computations have non-halting simulations, and
>>>>>>>>>>>>>> vice
>>>>>>>>>>>>>> versa.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Dishonest dodge.
>>>>>>>>>>>>
>>>>>>>>>>>> Projection. You have avoided addressing everything I said.
>>>>>>>>>>>> You are
>>>>>>>>>>>> still avoiding any clarification of your math poem despite
>>>>>>>>>>>> saying that
>>>>>>>>>>>> that was essential before moving on.
>>>>>>>>>>>>
>>>>>>>>>>>>> void Infinite_Loop()
>>>>>>>>>>>>> {
>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>> }
>>>>>>>>>>>>>
>>>>>>>>>>>>> int main()
>>>>>>>>>>>>> {
>>>>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop,
>>>>>>>>>>>>> (u32)Infinite_Loop);
>>>>>>>>>>>>
>>>>>>>>>>>> Still using silly variable names.
>>>>>>>>>>>>
>>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> And still not posting the code. Here's the best we have to
>>>>>>>>>>>> work with:
>>>>>>>>>>>>
>>>>>>>>>>>> bool Halts(u32 P, u32 I)
>>>>>>>>>>>> {
>>>>>>>>>>>> bool Halted = false;
>>>>>>>>>>>> bool Aborted = false;
>>>>>>>>>>>> while (!Halted && !Aborted)
>>>>>>>>>>>> {
>>>>>>>>>>>> Halted = DebugStep(P, I);
>>>>>>>>>>>> Aborted = Needs_To_Be_Aborted();
>>>>>>>>>>>> }
>>>>>>>>>>>> return !Aborted;
>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> As best as I can tell, unless you have really messed up, Halts
>>>>>>>>>>>> will
>>>>>>>>>>>> return the right answer to main. If you'd actually read the
>>>>>>>>>>>> text you
>>>>>>>>>>>> cut without comment, you'd know that.
>>>>>>>>>>>>> You keep trying try dodge the point that there are halting
>>>>>>>>>>>>> simulations
>>>>>>>>>>>>> of non halting computations.
>>>>>>>>>>>>
>>>>>>>>>>>> Ha! You didn't read the detailed analysis that I wrote, did
>>>>>>>>>>>> you? Or if
>>>>>>>>>>>> you did, you didn't understand it. It explicitly talked about
>>>>>>>>>>>> partial
>>>>>>>>>>>> simulations of non-halting computations.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Every computation that only halts because its simulation was
>>>>>>>>>>> stopped is a non halting computation.
>>>>>>>>>>>
>>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>>> {
>>>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> void H_Hat2(u32 P)
>>>>>>>>>>> {
>>>>>>>>>>> u32 Input_Would_Halt = Simulate(P, P);
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> int main() {
>>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> Halts never returns to H_Hat for the same reason that Simulate
>>>>>>>>>>> never returns to H_Hat2.
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> And what happens when you run Simulate(H_Hat, H_Hat)? [not
>>>>>>>>>> H_Hat2]
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> The same thing that happens when you run H_Hat(H_Hat) with many
>>>>>>>>> thousands of extra instructions. H_Hat(H_Hat) only halts because
>>>>>>>>> Halts aborts its otherwise infinite recursion.
>>>>>>>>
>>>>>>>> But the point is it *does* halt.
>>>>>>>
>>>>>>> No that it not the point otherwise infinite loops would be decided
>>>>>>> to halt on the basis that they were forced to halt.
>>>>>>
>>>>>> You seem to be claiming that when your 'halt decider' disagrees with
>>>>>> what actually happens, your 'decider' is right and reality is wrong.
>>>>>> That's not a legitimate approach.
>>>>>>
>>>>>> When you run Simulate(H_Hat, H_Hat), simulate doesn't abort
>>>>>> H_Hat(H_Hat) because it can't. And yet, H_Hat(H_Hat) still halts.
>>>>>> That's because H_Hat(H_Hat) does *not* actually contain an infinite
>>>>>> loop because its own code includes a provision for getting ending
>>>>>> that loop.
>>>>>>
>>>>>
>>>>> Why lie?
>>>>
>>>> I didn't.
>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>
>>>> Your point?
>>>>
>>>> André
>>>>
>>>
>>> You know that Halts() forces H_Hat infinite recursion to be aborted I
>>> have proved it too many times.
>>>
>>
>> H_Hat terminates its own possible infinite recursion due to the action
>> of the code in ITS copy of Halts which IS part of its machine.
>>
>> THIS makes it a halting Computation.
>>
>> You use defective definitions.
>>
>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>>
>>> int main()
>>> {
>>> H_Hat((u32)H_Hat);
>>> }
>>>
>>>
>>> _H_Hat()
>>> [00000b98](01) 55 push ebp
>>> [00000b99](02) 8bec mov ebp,esp
>>> [00000b9b](01) 51 push ecx
>>> [00000b9c](03) 8b4508 mov eax,[ebp+08]
>>> [00000b9f](01) 50 push eax
>>> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
>>> [00000ba3](01) 51 push ecx
>>> [00000ba4](05) e88ffdffff call 00000938
>>> [00000ba9](03) 83c408 add esp,+08 [00000bac](03)
>>> 8945fc mov [ebp-04],eax
>>> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
>>> [00000bb3](02) 7402 jz 00000bb7
>>> [00000bb5](02) ebfe jmp 00000bb5
>>> [00000bb7](02) 8be5 mov esp,ebp
>>> [00000bb9](01) 5d pop ebp
>>> [00000bba](01) c3 ret
>>> Size in bytes:(0035) [00000bba]
>>>
>>> _main()
>>> [00000bc8](01) 55 push ebp
>>> [00000bc9](02) 8bec mov ebp,esp
>>> [00000bcb](05) 68980b0000 push 00000b98
>>> [00000bd0](05) e8c3ffffff call 00000b98
>>> [00000bd5](03) 83c404 add esp,+04
>>> [00000bd8](02) 33c0 xor eax,eax
>>> [00000bda](01) 5d pop ebp
>>> [00000bdb](01) c3 ret
>>> Size in bytes:(0020) [00000bdb]
>>>
>>> ===============================
>>> ...[00000bc8][001015d4][00000000](01) 55 push ebp
>>> ...[00000bc9][001015d4][00000000](02) 8bec mov
>>> ebp,esp
>>> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
>>> 00000b98
>>> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
>>> 00000b98
>>> ...[00000b98][001015c8][001015d4](01) 55 push ebp
>>> ...[00000b99][001015c8][001015d4](02) 8bec mov
>>> ebp,esp
>>> ...[00000b9b][001015c4][00000000](01) 51 push ecx
>>> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000b9f][001015c0][00000b98](01) 50 push eax
>>> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
>>> ecx,[ebp+08]
>>> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
>>> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
>>> 00000938
>>> Begin Local Halt Decider Simulation at Machine Address:b98
>>> ...[00000b98][00211674][00211678](01) 55 push ebp
>>> ...[00000b99][00211674][00211678](02) 8bec mov
>>> ebp,esp
>>> ...[00000b9b][00211670][00201644](01) 51 push ecx
>>> ...[00000b9c][00211670][00201644](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000b9f][0021166c][00000b98](01) 50 push eax
>>> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
>>> ecx,[ebp+08]
>>> ...[00000ba3][00211668][00000b98](01) 51 push ecx
>>> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
>>> 00000938
>>
>> IMPROPER TRACE RIGHT HERE!!!!!!!!
>>
>> Code that is part of the process of H_Hat is NOT shown.
>> The execution of the code in the machine H_Hat of its copy of Halt.
>>
>>> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
>>> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov
>>> ebp,esp
>>> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
>>> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000b9f][0025c094][00000b98](01) 50 push eax
>>> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
>>> ecx,[ebp+08]
>>> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
>>> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
>>> 00000938
>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>
>> Bad Decision. Ignores the operation of Halts within H_Hat.
>>
>
> The code that is not shown does not cause the infinite recursion it
> merely stops it when it is detected.
Right, and that code is PART of the computation H_Hat.
This is your FUNDAMENTAL problem, you refuse to see that ALL code
executed under the Machine Description of H_Hat, WHICH INCLUDES A COPY O
F HALTS, is part of that computation.
Therefore, when the Halts embedded within H_Hat decides to terminate is
simulation of a copy of H_Hat, that decision makes H_Hat finite.
By your logic, this is an infinite loop:
for( i = 0; i < 10; i++) continue;
The for loop will run forever unless it stopped itself.
H_Hat would run forever if the Halts that was part of itself didn't stop
the recursion.
But that Halts IS part of H_Hat, and thus does provide finite execution.
You keep on wanting to make that Halts some how not part of H_Hat. It is.
ALL of the code within the H_Hat 'process' is part of it (including any
'system' code that is run on its behave). The simulate SHOULD trace that
code, as it is part of the process. It is YOUR error that you don't.
This is why you so want to try to redefine Turing Machines to some how
be able to call code that they do not have, so you can claim that this
code for Halts isn't part of it. But you can't. Yes, the code doesn't
have to be embedded in the State Transition Table if it is provided on
the tape as an input, but H_Hat ISN'T given a copy of Halts as part of
its input, that would blow apart you trick of changing Halts to make the
proof, and it would need to be a REAL copy of the representation, so
that wouldn't change when you did that trick.
I would say that you don't understand this whole theory enough to make
good arguments in it. You have even sort of admitted that, showing
surprise at what some of the definitions are, and have been frantically
trying to come up with a Rhetorical argument to try to redefine these
terms to something you can argue away.
You problem is that I don't think you are really interested in the
Halting Problem per-se, but it is a thorn in your side because is crops
up in some many arguments that give problems to your idea that all Real
Truth is Provable (and you won't take the limitations that other
philosophers who work with that stance have accepted in what can be
discussed under that rule).
If you REALLY want to try to do something about that, you really DO need
to spend some time to really understand the theory it is based on, and
the rules of that system.
I also don't think you really understand the nature of logical
philosophy, you CLAIM to want everything to be proven by analytic
arguments, but your don't then present real analytical arguments, but
work only with Rhetorical Arguments. You make a statement, that you take
as 'obviously' true (and maybe it is with the right interpretation of
the words) and then torture the meaning of the words to try and make a
one step arguement that this means your conclusion must of course be true.
THAT DOES NOT WORK AS AN ANALYITCAL ARGUMENT.
>
> It is known to be a good decision on the basis that the only reason
> H_Hat() stops is this correct decision to stop simulating H_Hat.
>
> Because H_Hat calls Halts in infinite recursion the second
> line of H_Hat() @ machine address 0xba9 is never reached.
No. Halts never saw that line of code in its simulation due to its
failure to decide correctly. But H_Hat DID get there as the top level
machine:
Quoting your trace:
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov
> [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
> [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
See, H_Hat DID get to 0xba9 after halts made its decision and return
non-halting, and H_Hat stopped.
SHOWING that H_Hat was a finite computation.
That local decoder was PART of H_Hat, it did NOT abort the top level
H_Hat that called it, and its decision to Halt is part of the
computation of H_Hat.
>
> You don't seem to have the basic software engineering skill to
> understand that functions called in infinite recursion never return any
> value to their caller so here a a concrete example:
>
> // This function never reaches its second line @ machine address 0xc55
> // This function never reaches its second line @ machine address 0xc55
> // This function never reaches its second line @ machine address 0xc55
>
> int Infinite_Recursion(u32 N)
> {
> u32 M = Infinite_Recursion(N);
> return M;
> }
>
> int main()
> {
> Infinite_Recursion(3);
> }
>
> _Infinite_Recursion()
> [00000c48](01) 55 push ebp
> [00000c49](02) 8bec mov ebp,esp
> [00000c4b](01) 51 push ecx
> [00000c4c](03) 8b4508 mov eax,[ebp+08]
> [00000c4f](01) 50 push eax
> [00000c50](05) e8f3ffffff call 00000c48
>
> // The next line is never reached
> // The next line is never reached
> // The next line is never reached
>
> [00000c55](03) 83c404 add esp,+04
> [00000c58](03) 8945fc mov [ebp-04],eax
> [00000c5b](03) 8b45fc mov eax,[ebp-04]
> [00000c5e](02) 8be5 mov esp,ebp
> [00000c60](01) 5d pop ebp
> [00000c61](01) c3 ret
> Size in bytes:(0026) [00000c61]
>
> _main()
> [00000c68](01) 55 push ebp
> [00000c69](02) 8bec mov ebp,esp
> [00000c6b](02) 6a03 push +03
> [00000c6d](05) e8d6ffffff call 00000c48
> [00000c72](03) 83c404 add esp,+04
> [00000c75](02) 33c0 xor eax,eax
> [00000c77](01) 5d pop ebp
> [00000c78](01) c3 ret
> Size in bytes:(0017) [00000c78]
>
> ===============================
> ...[00000c68][00101700][00000000](01) 55 push ebp
> ...[00000c69][00101700][00000000](02) 8bec mov ebp,esp
> ...[00000c6b][001016fc][00000003](02) 6a03 push +03
> ...[00000c6d][001016f8][00000c72](05) e8d6ffffff call
> 00000c48
> ...[00000c48][001016f4][00101700](01) 55 push ebp
> ...[00000c49][001016f4][00101700](02) 8bec mov ebp,esp
> ...[00000c4b][001016f0][00000000](01) 51 push ecx
> ...[00000c4c][001016f0][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000c4f][001016ec][00000003](01) 50 push eax
> ...[00000c50][001016e8][00000c55](05) e8f3ffffff call
> 00000c48
> ...[00000c48][001016e4][001016f4](01) 55 push ebp
> ...[00000c49][001016e4][001016f4](02) 8bec mov ebp,esp
> ...[00000c4b][001016e0][00000000](01) 51 push ecx
> ...[00000c4c][001016e0][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000c4f][001016dc][00000003](01) 50 push eax
> ...[00000c50][001016d8][00000c55](05) e8f3ffffff call
> 00000c48
> ...[00000c48][001016d4][001016e4](01) 55 push ebp
> ...[00000c49][001016d4][001016e4](02) 8bec mov ebp,esp
> ...[00000c4b][001016d0][00000000](01) 51 push ecx
> ...[00000c4c][001016d0][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000c4f][001016cc][00000003](01) 50 push eax
> ...[00000c50][001016c8][00000c55](05) e8f3ffffff call
> 00000c48
>
>
>
>>> ...[00000ba9][001015c4][00000000](03) 83c408 add
SEE H_Hat got its answer from ITS copy of Halts
>>> esp,+08
>>> ...[00000bac][001015c4][00000000](03) 8945fc mov
>>> [ebp-04],eax
>>> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
>>> [ebp-04],+00
>>> ...[00000bb3][001015c4][00000000](02) 7402 jz
>>> 00000bb7
>>> ...[00000bb7][001015c8][001015d4](02) 8be5 mov
>>> esp,ebp
>>> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
>>> ...[00000bba][001015d0][00000b98](01) c3 ret
>>> ...[00000bd5][001015d4][00000000](03) 83c404 add
>>> esp,+04
>>> ...[00000bd8][001015d4][00000000](02) 33c0 xor
>>> eax,eax
>>> ...[00000bda][001015d8][00100000](01) 5d pop ebp
>>> ...[00000bdb][001015dc][00000098](01) c3 ret
and H_Hat halted.
Thus is Finite.
>>> Number_of_User_Instructions(39)
>>> Number of Instructions Executed(26567)
>>>
>>>
>>
>>
>> 1) Halts is stipulated to meet the requirements of a Halt Decider for
>> Computation Theory, as used in the proof of Linz and Sipser.
>>
>> 2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
>> asked direction
>>
>> 3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
>> halt when the Halt decider it is built on decides H_Hat’s input is
>> non-Halting on itself.
>>
>> 4) 1 Means that Halts is a Computation, and will always return the same
>> answer (or never return an answer) for a given input.
>>
>> 5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
>> H_Hat)
>>
>> 6) by 4 and 2, this means that Halts will return the decision on
>> non-halting to H_Hat
>>
>> 7) By 3, this means that H_Hat will Halt.
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-27 09:59 -0500 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <7PSdnT6u3I9UuxX9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #32266 |
On 4/27/2021 9:53 AM, Richard Damon wrote:
> On 4/27/21 10:13 AM, olcott wrote:
>> You don't seem to have the basic software engineering skill to
>> understand that functions called in infinite recursion never return any
>> value to their caller so here a a concrete example:
>>
>> // This function never reaches its second line @ machine address 0xc55
>> // This function never reaches its second line @ machine address 0xc55
>> // This function never reaches its second line @ machine address 0xc55
>>
>> int Infinite_Recursion(u32 N)
>> {
>> u32 M = Infinite_Recursion(N);
>> return M;
>> }
>>
>> int main()
>> {
>> Infinite_Recursion(3);
>> }
>>
>> _Infinite_Recursion()
>> [00000c48](01) 55 push ebp
>> [00000c49](02) 8bec mov ebp,esp
>> [00000c4b](01) 51 push ecx
>> [00000c4c](03) 8b4508 mov eax,[ebp+08]
>> [00000c4f](01) 50 push eax
>> [00000c50](05) e8f3ffffff call 00000c48
>>
>> // The next line is never reached
>> // The next line is never reached
>> // The next line is never reached
>>
>> [00000c55](03) 83c404 add esp,+04
>> [00000c58](03) 8945fc mov [ebp-04],eax
>> [00000c5b](03) 8b45fc mov eax,[ebp-04]
>> [00000c5e](02) 8be5 mov esp,ebp
>> [00000c60](01) 5d pop ebp
>> [00000c61](01) c3 ret
>> Size in bytes:(0026) [00000c61]
>>
>> _main()
>> [00000c68](01) 55 push ebp
>> [00000c69](02) 8bec mov ebp,esp
>> [00000c6b](02) 6a03 push +03
>> [00000c6d](05) e8d6ffffff call 00000c48
>> [00000c72](03) 83c404 add esp,+04
>> [00000c75](02) 33c0 xor eax,eax
>> [00000c77](01) 5d pop ebp
>> [00000c78](01) c3 ret
>> Size in bytes:(0017) [00000c78]
>>
>> ===============================
>> ...[00000c68][00101700][00000000](01) 55 push ebp
>> ...[00000c69][00101700][00000000](02) 8bec mov ebp,esp
>> ...[00000c6b][001016fc][00000003](02) 6a03 push +03
>> ...[00000c6d][001016f8][00000c72](05) e8d6ffffff call
>> 00000c48
>> ...[00000c48][001016f4][00101700](01) 55 push ebp
>> ...[00000c49][001016f4][00101700](02) 8bec mov ebp,esp
>> ...[00000c4b][001016f0][00000000](01) 51 push ecx
>> ...[00000c4c][001016f0][00000000](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000c4f][001016ec][00000003](01) 50 push eax
>> ...[00000c50][001016e8][00000c55](05) e8f3ffffff call
>> 00000c48
>> ...[00000c48][001016e4][001016f4](01) 55 push ebp
>> ...[00000c49][001016e4][001016f4](02) 8bec mov ebp,esp
>> ...[00000c4b][001016e0][00000000](01) 51 push ecx
>> ...[00000c4c][001016e0][00000000](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000c4f][001016dc][00000003](01) 50 push eax
>> ...[00000c50][001016d8][00000c55](05) e8f3ffffff call
>> 00000c48
>> ...[00000c48][001016d4][001016e4](01) 55 push ebp
>> ...[00000c49][001016d4][001016e4](02) 8bec mov ebp,esp
>> ...[00000c4b][001016d0][00000000](01) 51 push ecx
>> ...[00000c4c][001016d0][00000000](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000c4f][001016cc][00000003](01) 50 push eax
>> ...[00000c50][001016c8][00000c55](05) e8f3ffffff call
>> 00000c48
>>
>>
>>
>>>> ...[00000ba9][001015c4][00000000](03) 83c408 add
>
> SEE H_Hat got its answer from ITS copy of Halts
There is no H_Hat in the above code.
--
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-27 11:25 -0400 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <I1WhI.132540$ST2.73450@fx47.iad> |
| In reply to | #32267 |
On 4/27/21 10:59 AM, olcott wrote:
> On 4/27/2021 9:53 AM, Richard Damon wrote:
>> On 4/27/21 10:13 AM, olcott wrote:
>
>>> You don't seem to have the basic software engineering skill to
>>> understand that functions called in infinite recursion never return any
>>> value to their caller so here a a concrete example:
>>>
>>> // This function never reaches its second line @ machine address 0xc55
>>> // This function never reaches its second line @ machine address 0xc55
>>> // This function never reaches its second line @ machine address 0xc55
>>>
>>> int Infinite_Recursion(u32 N)
>>> {
>>> u32 M = Infinite_Recursion(N);
>>> return M;
>>> }
>>>
>>> int main()
>>> {
>>> Infinite_Recursion(3);
>>> }
>>>
>>> _Infinite_Recursion()
>>> [00000c48](01) 55 push ebp
>>> [00000c49](02) 8bec mov ebp,esp
>>> [00000c4b](01) 51 push ecx
>>> [00000c4c](03) 8b4508 mov eax,[ebp+08]
>>> [00000c4f](01) 50 push eax
>>> [00000c50](05) e8f3ffffff call 00000c48
>>>
>>> // The next line is never reached
>>> // The next line is never reached
>>> // The next line is never reached
>>>
>>> [00000c55](03) 83c404 add esp,+04
>>> [00000c58](03) 8945fc mov [ebp-04],eax
>>> [00000c5b](03) 8b45fc mov eax,[ebp-04]
>>> [00000c5e](02) 8be5 mov esp,ebp
>>> [00000c60](01) 5d pop ebp
>>> [00000c61](01) c3 ret
>>> Size in bytes:(0026) [00000c61]
>>>
>>> _main()
>>> [00000c68](01) 55 push ebp
>>> [00000c69](02) 8bec mov ebp,esp
>>> [00000c6b](02) 6a03 push +03
>>> [00000c6d](05) e8d6ffffff call 00000c48
>>> [00000c72](03) 83c404 add esp,+04
>>> [00000c75](02) 33c0 xor eax,eax
>>> [00000c77](01) 5d pop ebp
>>> [00000c78](01) c3 ret
>>> Size in bytes:(0017) [00000c78]
>>>
>>> ===============================
>>> ...[00000c68][00101700][00000000](01) 55 push ebp
>>> ...[00000c69][00101700][00000000](02) 8bec mov
>>> ebp,esp
>>> ...[00000c6b][001016fc][00000003](02) 6a03 push +03
>>> ...[00000c6d][001016f8][00000c72](05) e8d6ffffff call
>>> 00000c48
>>> ...[00000c48][001016f4][00101700](01) 55 push ebp
>>> ...[00000c49][001016f4][00101700](02) 8bec mov
>>> ebp,esp
>>> ...[00000c4b][001016f0][00000000](01) 51 push ecx
>>> ...[00000c4c][001016f0][00000000](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000c4f][001016ec][00000003](01) 50 push eax
>>> ...[00000c50][001016e8][00000c55](05) e8f3ffffff call
>>> 00000c48
>>> ...[00000c48][001016e4][001016f4](01) 55 push ebp
>>> ...[00000c49][001016e4][001016f4](02) 8bec mov
>>> ebp,esp
>>> ...[00000c4b][001016e0][00000000](01) 51 push ecx
>>> ...[00000c4c][001016e0][00000000](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000c4f][001016dc][00000003](01) 50 push eax
>>> ...[00000c50][001016d8][00000c55](05) e8f3ffffff call
>>> 00000c48
>>> ...[00000c48][001016d4][001016e4](01) 55 push ebp
>>> ...[00000c49][001016d4][001016e4](02) 8bec mov
>>> ebp,esp
>>> ...[00000c4b][001016d0][00000000](01) 51 push ecx
>>> ...[00000c4c][001016d0][00000000](03) 8b4508 mov
>>> eax,[ebp+08]
>>> ...[00000c4f][001016cc][00000003](01) 50 push eax
>>> ...[00000c50][001016c8][00000c55](05) e8f3ffffff call
>>> 00000c48
>>>
>>>
>>>
>>>>> ...[00000ba9][001015c4][00000000](03) 83c408 add
>>
>> SEE H_Hat got its answer from ITS copy of Halts
>
>
> There is no H_Hat in the above code.
>
>
THERE WAS. You are now guilty of deceit. You have edited the posts,
fortunately, the whole history of the thread will be archived on Usenet.
YOU ARE A PATHOLOGICAL LIAR,
This is such a bad edit job that it is clearly being deceitful.
Please follow back the following reference chain and see the messages it
was in response to:
References: <0e298c6f-071f-45d2-b744-f8a47e67a546n@googlegroups.com>
<VPydnXquFtD9Thn9nZ2dnUU7-I_NnZ2d@giganews.com>
<j55hI.21860$qy1.17667@fx26.iad>
<0b49ec90-1928-4bc1-bcf6-5465ece13bben@googlegroups.com>
<jsKdnaql6cwTHxj9nZ2dnUU7-Q3NnZ2d@giganews.com>
<87v98ahymg.fsf@bsb.me.uk>
<TK6dnTSVDfOSpBv9nZ2dnUU7-Q_NnZ2d@giganews.com>
<87r1ixgpa0.fsf@bsb.me.uk>
<op6dnUjPv-EDVBv9nZ2dnUU7-fGdnZ2d@giganews.com>
<87sg3cfufz.fsf@bsb.me.uk>
<faydnYUYuJGmxhr9nZ2dnUU7-dfNnZ2d@giganews.com>
<87bla0frte.fsf@bsb.me.uk>
<Q6qdnQHg5O807Rr9nZ2dnUU7-YvNnZ2d@giganews.com>
<s67ugn$oub$1@dont-email.me>
<I9ednTrpkqTn4hr9nZ2dnUU7-TPNnZ2d@giganews.com>
<s6832u$d73$1@dont-email.me>
<pdidnUJkjKKHDRr9nZ2dnUU7-UudnZ2d@giganews.com>
<s6844h$uov$1@dont-email.me>
<baWdnRLvvKDjCxr9nZ2dnUU7-fHNnZ2d@giganews.com>
<s6853e$aie$1@dont-email.me>
<Teudndbu59GVBBr9nZ2dnUU7-V2dnZ2d@giganews.com>
<PmShI.29705$b27.28280@fx03.iad>
<obqdnYSb1N9uhhX9nZ2dnUU7-efNnZ2d@giganews.com>
<mzVhI.43511$sd3.25729@fx02.iad>
In particular compare the message you are quoting to the message that
this is in reply to:
<mzVhI.43511$sd3.25729@fx02.iad>
No wonder you call your site the Liarparodox, you are inately a Liar.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-27 17:38 -0500 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <CdedncysdcWlDxX9nZ2dnUU7-RnNnZ2d@giganews.com> |
| In reply to | #32269 |
On 4/27/2021 10:25 AM, Richard Damon wrote:
> On 4/27/21 10:59 AM, olcott wrote:
>> On 4/27/2021 9:53 AM, Richard Damon wrote:
>>> On 4/27/21 10:13 AM, olcott wrote:
>>
>>>> You don't seem to have the basic software engineering skill to
>>>> understand that functions called in infinite recursion never return any
>>>> value to their caller so here a a concrete example:
>>>>
>>>> // This function never reaches its second line @ machine address 0xc55
>>>> // This function never reaches its second line @ machine address 0xc55
>>>> // This function never reaches its second line @ machine address 0xc55
>>>>
>>>> int Infinite_Recursion(u32 N)
>>>> {
>>>> u32 M = Infinite_Recursion(N);
>>>> return M;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> Infinite_Recursion(3);
>>>> }
>>>>
>>>> _Infinite_Recursion()
>>>> [00000c48](01) 55 push ebp
>>>> [00000c49](02) 8bec mov ebp,esp
>>>> [00000c4b](01) 51 push ecx
>>>> [00000c4c](03) 8b4508 mov eax,[ebp+08]
>>>> [00000c4f](01) 50 push eax
>>>> [00000c50](05) e8f3ffffff call 00000c48
>>>>
>>>> // The next line is never reached
>>>> // The next line is never reached
>>>> // The next line is never reached
>>>>
>>>> [00000c55](03) 83c404 add esp,+04
>>>> [00000c58](03) 8945fc mov [ebp-04],eax
>>>> [00000c5b](03) 8b45fc mov eax,[ebp-04]
>>>> [00000c5e](02) 8be5 mov esp,ebp
>>>> [00000c60](01) 5d pop ebp
>>>> [00000c61](01) c3 ret
>>>> Size in bytes:(0026) [00000c61]
>>>>
>>>> _main()
>>>> [00000c68](01) 55 push ebp
>>>> [00000c69](02) 8bec mov ebp,esp
>>>> [00000c6b](02) 6a03 push +03
>>>> [00000c6d](05) e8d6ffffff call 00000c48
>>>> [00000c72](03) 83c404 add esp,+04
>>>> [00000c75](02) 33c0 xor eax,eax
>>>> [00000c77](01) 5d pop ebp
>>>> [00000c78](01) c3 ret
>>>> Size in bytes:(0017) [00000c78]
>>>>
>>>> ===============================
>>>> ...[00000c68][00101700][00000000](01) 55 push ebp
>>>> ...[00000c69][00101700][00000000](02) 8bec mov
>>>> ebp,esp
>>>> ...[00000c6b][001016fc][00000003](02) 6a03 push +03
>>>> ...[00000c6d][001016f8][00000c72](05) e8d6ffffff call
>>>> 00000c48
>>>> ...[00000c48][001016f4][00101700](01) 55 push ebp
>>>> ...[00000c49][001016f4][00101700](02) 8bec mov
>>>> ebp,esp
>>>> ...[00000c4b][001016f0][00000000](01) 51 push ecx
>>>> ...[00000c4c][001016f0][00000000](03) 8b4508 mov
>>>> eax,[ebp+08]
>>>> ...[00000c4f][001016ec][00000003](01) 50 push eax
>>>> ...[00000c50][001016e8][00000c55](05) e8f3ffffff call
>>>> 00000c48
>>>> ...[00000c48][001016e4][001016f4](01) 55 push ebp
>>>> ...[00000c49][001016e4][001016f4](02) 8bec mov
>>>> ebp,esp
>>>> ...[00000c4b][001016e0][00000000](01) 51 push ecx
>>>> ...[00000c4c][001016e0][00000000](03) 8b4508 mov
>>>> eax,[ebp+08]
>>>> ...[00000c4f][001016dc][00000003](01) 50 push eax
>>>> ...[00000c50][001016d8][00000c55](05) e8f3ffffff call
>>>> 00000c48
>>>> ...[00000c48][001016d4][001016e4](01) 55 push ebp
>>>> ...[00000c49][001016d4][001016e4](02) 8bec mov
>>>> ebp,esp
>>>> ...[00000c4b][001016d0][00000000](01) 51 push ecx
>>>> ...[00000c4c][001016d0][00000000](03) 8b4508 mov
>>>> eax,[ebp+08]
>>>> ...[00000c4f][001016cc][00000003](01) 50 push eax
>>>> ...[00000c50][001016c8][00000c55](05) e8f3ffffff call
>>>> 00000c48
>>>>
>>>>
>>>>
>>>>>> ...[00000ba9][001015c4][00000000](03) 83c408 add
>>>
>>> SEE H_Hat got its answer from ITS copy of Halts
>>
>>
>> There is no H_Hat in the above code.
>>
>>
>
> THERE WAS. You are now guilty of deceit.
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
The above trace ONLY refers to the execution of Infinite_Recursion(3);
--
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-27 19:12 -0400 |
| Subject | Re: What is a computation? (lack of software engineering skill) |
| Message-ID | <NT0iI.36603$1%.32329@fx37.iad> |
| In reply to | #32277 |
On 4/27/21 6:38 PM, 'Liar' olcott wrote:
> On 4/27/2021 10:25 AM, Richard Damon wrote:
>> On 4/27/21 10:59 AM, olcott wrote:
>>> On 4/27/2021 9:53 AM, Richard Damon wrote:
>>>> On 4/27/21 10:13 AM, olcott wrote:
>>>
>>>>> You don't seem to have the basic software engineering skill to
>>>>> understand that functions called in infinite recursion never return
>>>>> any
>>>>> value to their caller so here a a concrete example:
>>>>>
>>>>> // This function never reaches its second line @ machine address 0xc55
>>>>> // This function never reaches its second line @ machine address 0xc55
>>>>> // This function never reaches its second line @ machine address 0xc55
>>>>>
>>>>> int Infinite_Recursion(u32 N)
>>>>> {
>>>>> u32 M = Infinite_Recursion(N);
>>>>> return M;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> Infinite_Recursion(3);
>>>>> }
>>>>>
>>>>> _Infinite_Recursion()
>>>>> [00000c48](01) 55 push ebp
>>>>> [00000c49](02) 8bec mov ebp,esp
>>>>> [00000c4b](01) 51 push ecx
>>>>> [00000c4c](03) 8b4508 mov eax,[ebp+08]
>>>>> [00000c4f](01) 50 push eax
>>>>> [00000c50](05) e8f3ffffff call 00000c48
>>>>>
>>>>> // The next line is never reached
>>>>> // The next line is never reached
>>>>> // The next line is never reached
>>>>>
>>>>> [00000c55](03) 83c404 add esp,+04
>>>>> [00000c58](03) 8945fc mov [ebp-04],eax
>>>>> [00000c5b](03) 8b45fc mov eax,[ebp-04]
>>>>> [00000c5e](02) 8be5 mov esp,ebp
>>>>> [00000c60](01) 5d pop ebp
>>>>> [00000c61](01) c3 ret
>>>>> Size in bytes:(0026) [00000c61]
>>>>>
>>>>> _main()
>>>>> [00000c68](01) 55 push ebp
>>>>> [00000c69](02) 8bec mov ebp,esp
>>>>> [00000c6b](02) 6a03 push +03
>>>>> [00000c6d](05) e8d6ffffff call 00000c48
>>>>> [00000c72](03) 83c404 add esp,+04
>>>>> [00000c75](02) 33c0 xor eax,eax
>>>>> [00000c77](01) 5d pop ebp
>>>>> [00000c78](01) c3 ret
>>>>> Size in bytes:(0017) [00000c78]
>>>>>
>>>>> ===============================
>>>>> ...[00000c68][00101700][00000000](01) 55 push
>>>>> ebp
>>>>> ...[00000c69][00101700][00000000](02) 8bec mov
>>>>> ebp,esp
>>>>> ...[00000c6b][001016fc][00000003](02) 6a03 push
>>>>> +03
>>>>> ...[00000c6d][001016f8][00000c72](05) e8d6ffffff call
>>>>> 00000c48
>>>>> ...[00000c48][001016f4][00101700](01) 55 push
>>>>> ebp
>>>>> ...[00000c49][001016f4][00101700](02) 8bec mov
>>>>> ebp,esp
>>>>> ...[00000c4b][001016f0][00000000](01) 51 push
>>>>> ecx
>>>>> ...[00000c4c][001016f0][00000000](03) 8b4508 mov
>>>>> eax,[ebp+08]
>>>>> ...[00000c4f][001016ec][00000003](01) 50 push
>>>>> eax
>>>>> ...[00000c50][001016e8][00000c55](05) e8f3ffffff call
>>>>> 00000c48
>>>>> ...[00000c48][001016e4][001016f4](01) 55 push
>>>>> ebp
>>>>> ...[00000c49][001016e4][001016f4](02) 8bec mov
>>>>> ebp,esp
>>>>> ...[00000c4b][001016e0][00000000](01) 51 push
>>>>> ecx
>>>>> ...[00000c4c][001016e0][00000000](03) 8b4508 mov
>>>>> eax,[ebp+08]
>>>>> ...[00000c4f][001016dc][00000003](01) 50 push
>>>>> eax
>>>>> ...[00000c50][001016d8][00000c55](05) e8f3ffffff call
>>>>> 00000c48
>>>>> ...[00000c48][001016d4][001016e4](01) 55 push
>>>>> ebp
>>>>> ...[00000c49][001016d4][001016e4](02) 8bec mov
>>>>> ebp,esp
>>>>> ...[00000c4b][001016d0][00000000](01) 51 push
>>>>> ecx
>>>>> ...[00000c4c][001016d0][00000000](03) 8b4508 mov
>>>>> eax,[ebp+08]
>>>>> ...[00000c4f][001016cc][00000003](01) 50 push
>>>>> eax
>>>>> ...[00000c50][001016c8][00000c55](05) e8f3ffffff call
>>>>> 00000c48
>>>>>
>>>>>
>>>>>
>>>>>>> ...[00000ba9][001015c4][00000000](03) 83c408 add
>>>>
>>>> SEE H_Hat got its answer from ITS copy of Halts
>>>
>>>
>>> There is no H_Hat in the above code.
>>>
>>>
>>
>> THERE WAS. You are now guilty of deceit.
>
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
> The above trace ONLY refers to the execution of Infinite_Recursion(3);
>
>
But here is the trace that WAS in the message I replied to. Note, it
DOES have H_Hat:
On 4/27/21 12:55 AM, 'Liar' olcott wrote:
>
> You know that Halts() forces H_Hat infinite recursion to be aborted I
> have proved it too many times.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
> [00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
> 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
> 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
> 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
> 00000938
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
> 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov
> [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
> [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
>
>
[toc] | [prev] | [next] | [standalone]
Page 43 of 50 — ← Prev page 1 … 41 42 [43] 44 45 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web