Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #30001 > unrolled thread
| Started by | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| First post | 2021-03-25 22:56 -0400 |
| Last post | 2021-03-26 19:47 -0400 |
| Articles | 20 on this page of 573 — 15 participants |
Back to article view | Back to comp.theory
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: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:56 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-25 22:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:41 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-25 22:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 07:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 10:07 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 19:37 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:47 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-26 18:59 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 20:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-26 19:35 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 20:49 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 22:03 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-26 21:23 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 22:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 07:01 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 09:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 10:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 08:56 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 10:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 11:32 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 09:42 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 10:45 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 12:09 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 11:22 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 14:33 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 10:12 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 11:20 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 10:42 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 12:04 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 11:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 12:35 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 11:02 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 13:12 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 14:36 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 12:58 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 14:01 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 15:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 14:29 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 15:54 -0400
Re: A UTM halt decider <is> a pure function of its inputs (slight change to TM definition) olcott <NoOne@NoWhere.com> - 2021-03-27 15:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 14:34 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 15:47 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 16:54 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:35 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 17:45 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 19:59 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 20:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 18:54 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:59 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 19:26 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 21:41 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 21:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 22:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 22:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 23:31 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-28 09:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 13:15 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-28 13:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 00:12 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Jeff Barnett <jbb@notatt.com> - 2021-03-28 01:13 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 01:43 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Jeff Barnett <jbb@notatt.com> - 2021-03-28 11:26 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-28 00:24 +0000
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:41 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 21:49 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-28 02:42 +0000
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-27 19:48 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 21:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 23:15 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 22:31 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-28 04:38 +0000
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 07:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (pure function) olcott <NoOne@NoWhere.com> - 2021-03-28 08:50 -0500
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-28 16:58 +0000
Re: A UTM halt decider <is> a pure function of its inputs (pure function) olcott <NoOne@NoWhere.com> - 2021-03-28 12:47 -0500
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 14:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs (pure function) olcott <NoOne@NoWhere.com> - 2021-03-28 13:35 -0500
Re: A UTM halt decider <is> a pure function of its inputs (pure function) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 13:41 -0600
Re: A UTM halt decider <is> a pure function of its inputs (pure function) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-28 13:42 -0700
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:11 -0400
Re: A UTM halt decider <is> a pure function of its inputs (pure function) olcott <NoOne@NoWhere.com> - 2021-03-28 16:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Jeff Barnett <jbb@notatt.com> - 2021-03-28 17:20 -0600
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 18:28 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Jeff Barnett <jbb@notatt.com> - 2021-03-28 18:23 -0600
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 19:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Jeff Barnett <jbb@notatt.com> - 2021-03-28 20:51 -0600
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 22:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Jeff Barnett <jbb@notatt.com> - 2021-03-28 21:18 -0600
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 16:43 -0400
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 13:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (pure function) olcott <NoOne@NoWhere.com> - 2021-03-28 13:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (pure function) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 16:55 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-28 04:33 +0000
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 14:57 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 13:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 14:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 15:59 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 13:08 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 15:11 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 16:50 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:12 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 14:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 15:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 14:51 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 15:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 15:03 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 14:09 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 15:34 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:22 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 16:15 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:40 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 20:22 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 14:01 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 15:31 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 14:37 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 16:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 16:19 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 15:30 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 16:42 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 16:04 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 18:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 20:04 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 19:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 20:30 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 18:59 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 20:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 19:27 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 21:55 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 21:48 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 23:23 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 23:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 07:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-28 10:31 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 10:33 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 13:23 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-28 13:23 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 14:08 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 13:26 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 14:50 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-28 20:05 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 15:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:05 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 16:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:37 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 16:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 20:50 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 19:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 21:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 20:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 22:55 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 22:07 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 23:33 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 23:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-29 22:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 21:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 07:58 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-30 05:46 -0700
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <polcott2@gmail.com> - 2021-03-30 08:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:32 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 12:37 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 14:15 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 13:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 19:13 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 14:22 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 19:29 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:11 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 15:58 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 16:31 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 16:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 17:14 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 09:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 11:33 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 11:01 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 13:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-30 21:37 +0100
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 19:09 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 14:20 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 19:28 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 21:15 +0000
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) olcott <NoOne@NoWhere.com> - 2021-03-31 09:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 10:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) olcott <NoOne@NoWhere.com> - 2021-03-31 10:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 11:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 15:23 +0000
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) olcott <NoOne@NoWhere.com> - 2021-03-31 10:50 -0500
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 12:05 -0400
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) olcott <NoOne@NoWhere.com> - 2021-03-31 11:11 -0500
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 12:41 -0400
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 17:40 +0000
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) olcott <NoOne@NoWhere.com> - 2021-03-31 12:55 -0500
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-01 00:52 +0000
Re: A UTM halt decider <is> a pure function of its inputs(complete halt deciding system) R Kym Horsell <kym@kymhorsell.com> - 2021-04-01 01:30 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 16:00 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:07 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 16:34 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 15:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 17:16 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 09:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 10:53 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 10:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 11:59 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 11:04 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 12:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (stupid mistake) olcott <NoOne@NoWhere.com> - 2021-03-30 09:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (stupid mistake) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-29 11:32 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Andy Walker <anw@cuboid.co.uk> - 2021-03-28 23:16 +0100
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 17:38 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Andy Walker <anw@cuboid.co.uk> - 2021-03-29 00:34 +0100
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 19:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 21:13 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-28 20:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 23:10 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-28 22:27 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 23:45 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-28 23:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Richard Damon <Richard@Damon-Family.org> - 2021-03-29 22:30 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 21:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 10:45 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 11:53 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 11:43 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 15:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 14:10 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 15:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 15:36 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 17:42 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-29 22:56 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 18:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 00:21 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 19:45 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 18:41 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 20:22 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 19:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 20:48 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 20:06 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-29 21:12 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Richard Damon <Richard@Damon-Family.org> - 2021-03-29 22:34 -0400
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) olcott <NoOne@NoWhere.com> - 2021-03-29 21:41 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 08:04 -0400
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) olcott <NoOne@NoWhere.com> - 2021-03-30 09:39 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:21 +0000
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) olcott <NoOne@NoWhere.com> - 2021-03-30 10:42 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:59 +0000
Re: A UTM halt decider <is> a pure function of its inputs (the power of C) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 21:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-29 22:38 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 22:11 -0600
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-29 23:24 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 22:57 -0600
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 08:09 -0400
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-30 09:43 -0500
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:29 +0000
Re: A UTM halt decider <is> a pure function of its inputs (the power of C)(halt decider code) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-30 14:53 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) olcott <NoOne@NoWhere.com> - 2021-03-30 09:04 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Computability!) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:25 -0400
Re: A UTM halt decider <is> a pure function of its inputs (computability) Andy Walker <anw@cuboid.co.uk> - 2021-03-29 18:59 +0100
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-29 15:28 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Andy Walker <anw@cuboid.co.uk> - 2021-03-31 00:02 +0100
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 18:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 00:34 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 19:40 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 04:35 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 23:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 06:44 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 08:31 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 11:10 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 10:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 15:25 +0000
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 10:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 12:02 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-31 11:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 12:49 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 21:45 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 20:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 22:12 -0400
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) olcott <NoOne@NoWhere.com> - 2021-03-30 21:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 23:33 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-30 22:49 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 06:04 +0000
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-31 03:27 -0700
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 08:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 06:34 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 08:28 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 11:24 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 10:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 13:01 -0400
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 17:36 +0000
Re: A UTM halt decider <is> a pure function of its inputs (jackass) olcott <NoOne@NoWhere.com> - 2021-03-31 13:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 14:36 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 13:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 16:07 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 15:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 16:56 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 16:14 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 17:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 16:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 17:56 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 17:04 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 20:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 19:46 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 22:09 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 21:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-03-31 22:52 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 22:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 07:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 11:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 12:43 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 11:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-01 17:23 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 12:43 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-02 15:02 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-02 10:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 11:37 -0400
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus) olcott <NoOne@NoWhere.com> - 2021-04-02 11:25 -0500
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 15:11 -0400
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^2) olcott <NoOne@NoWhere.com> - 2021-04-02 14:24 -0500
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^2) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 16:01 -0400
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^3) olcott <NoOne@NoWhere.com> - 2021-04-02 15:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^3) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 18:13 -0400
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^3) olcott <NoOne@NoWhere.com> - 2021-04-02 17:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^3) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 18:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-02 16:37 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-02 12:03 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-02 13:48 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 15:25 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-02 14:47 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 17:30 -0400
Re: A UTM halt decider <is> a pure function of its inputs (ignoramus^3) olcott <NoOne@NoWhere.com> - 2021-04-02 16:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-02 19:27 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-02 14:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-03 02:50 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 02:39 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 19:24 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 20:55 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 16:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 15:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 15:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 19:27 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 15:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 12:39 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-05 11:59 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-05 12:15 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 13:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 18:49 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 13:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-05 20:09 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 19:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-05 20:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-06 01:35 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-06 12:35 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 09:24 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 10:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 09:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 11:13 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 10:27 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 11:42 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 10:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-06 17:42 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-06 13:32 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 16:02 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 15:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 16:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-07 00:34 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 18:48 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-06 18:06 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 19:20 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-06 18:38 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 20:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) André G. Isaak <agisaak@gm.invalid> - 2021-04-06 19:46 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 22:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-07 13:16 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Alan Mackenzie <acm@muc.de> - 2021-04-07 12:40 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-07 13:25 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-07 10:26 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-07 16:04 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-07 11:22 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-07 22:05 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 09:25 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 10:30 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 09:41 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-06 15:17 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 10:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 11:48 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 11:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 12:15 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 11:29 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 12:48 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 12:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 13:23 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 12:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 14:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 15:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 16:54 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 17:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 11:18 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 10:37 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-06 17:34 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 12:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-06 18:02 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 13:12 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-06 14:32 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Peter <peterxpercival@hotmail.com> - 2021-04-06 20:50 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-07 18:52 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-04-06 17:26 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-06 19:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-05 18:48 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) olcott <NoOne@NoWhere.com> - 2021-04-05 13:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-05 20:32 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) Richard Damon <Richard@Damon-Family.org> - 2021-04-05 20:11 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 13:47 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 14:16 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 16:00 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 15:07 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 17:06 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 16:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 15:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 17:16 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 16:39 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 18:00 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 17:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 18:35 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) André G. Isaak <agisaak@gm.invalid> - 2021-04-01 16:38 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 17:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 18:38 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 18:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 19:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 18:55 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) André G. Isaak <agisaak@gm.invalid> - 2021-04-01 18:29 -0600
Re: A UTM halt decider <is> a pure function of its inputs (TM relative addressing) olcott <NoOne@NoWhere.com> - 2021-04-01 20:03 -0500
Re: A UTM halt decider <is> a pure function of its inputs (TM relative addressing) André G. Isaak <agisaak@gm.invalid> - 2021-04-01 19:23 -0600
Re: A UTM halt decider <is> a pure function of its inputs (TM relative addressing) olcott <NoOne@NoWhere.com> - 2021-04-01 20:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (TM relative addressing) André G. Isaak <agisaak@gm.invalid> - 2021-04-01 19:54 -0600
Re: A UTM halt decider <is> a pure function of its inputs (TM relative addressing) olcott <NoOne@NoWhere.com> - 2021-04-01 21:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-01 22:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 21:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 07:54 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <polcott2@gmail.com> - 2021-04-02 09:29 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 11:04 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-02 10:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 11:47 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-02 11:37 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 15:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-02 15:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) André G. Isaak <agisaak@gm.invalid> - 2021-04-02 14:22 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) olcott <NoOne@NoWhere.com> - 2021-04-02 15:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 17:43 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) olcott <NoOne@NoWhere.com> - 2021-04-02 17:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 18:47 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) André G. Isaak <agisaak@gm.invalid> - 2021-04-02 16:47 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) olcott <NoOne@NoWhere.com> - 2021-04-02 18:12 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 19:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) André G. Isaak <agisaak@gm.invalid> - 2021-04-02 20:39 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Andy Walker <anw@cuboid.co.uk> - 2021-04-03 11:31 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-03 08:49 -0700
Re: A UTM halt decider <is> a pure function of its inputs (Original H and H^) Andy Walker <anw@cuboid.co.uk> - 2021-04-03 21:00 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 17:38 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-02 17:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Richard Damon <Richard@Damon-Family.org> - 2021-04-02 19:08 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) Bonita Montero <Bonita.Montero@gmail.com> - 2021-04-02 01:46 +0200
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-04-01 18:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (jackass) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-01 00:58 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Pure function of COFF file) olcott <NoOne@NoWhere.com> - 2021-03-31 20:23 -0500
Re: A UTM halt decider <is> a pure function of its inputs (epiphany) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-31 04:40 +0000
Re: A UTM halt decider <is> a pure function of its inputs (computability) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-29 11:11 +0100
Re: A UTM halt decider <is> a pure function of its inputs (computability) Andy Walker <anw@cuboid.co.uk> - 2021-03-29 19:02 +0100
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-29 15:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 20:59 -0400
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 20:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 21:15 -0400
Re: A UTM halt decider <is> a pure function of its inputs (computability) olcott <NoOne@NoWhere.com> - 2021-03-28 20:38 -0500
Re: A UTM halt decider <is> a pure function of its inputs (computability) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 23:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-28 14:11 -0700
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 16:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-28 21:12 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-28 14:17 -0700
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 16:32 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:42 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 21:59 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 23:24 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 23:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) André G. Isaak <agisaak@gm.invalid> - 2021-03-29 10:48 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-29 22:30 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 21:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 03:39 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 22:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 05:28 +0000
Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) olcott <NoOne@NoWhere.com> - 2021-03-30 09:20 -0500
Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:03 +0000
Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) olcott <NoOne@NoWhere.com> - 2021-03-30 10:08 -0500
Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:33 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 08:13 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-30 09:47 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-30 16:32 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-30 10:46 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-30 15:56 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:37 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-30 12:36 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-29 06:53 -0700
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 08:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-29 14:30 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 09:47 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-29 20:15 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 15:46 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-29 22:53 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 18:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-29 22:14 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-28 18:12 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-29 12:59 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 08:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-29 14:33 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 09:49 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-29 15:11 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 11:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-29 16:50 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 12:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Alan Mackenzie <acm@muc.de> - 2021-03-29 17:40 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-29 21:25 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) olcott <NoOne@NoWhere.com> - 2021-03-29 15:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-30 02:43 +0100
Re: A UTM halt decider <is> a pure function of its inputs (liar paradox like structure is moot) olcott <NoOne@NoWhere.com> - 2021-03-29 20:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Andy Walker <anw@cuboid.co.uk> - 2021-03-28 23:05 +0100
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 17:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) André G. Isaak <agisaak@gm.invalid> - 2021-03-28 19:18 -0600
Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) Richard Damon <Richard@Damon-Family.org> - 2021-03-28 21:24 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-28 03:41 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 17:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:43 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 16:21 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 18:26 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 12:10 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote)(TM function call) olcott <NoOne@NoWhere.com> - 2021-03-27 13:22 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote)(TM function call) André G. Isaak <agisaak@gm.invalid> - 2021-03-27 12:48 -0600
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 13:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 13:02 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 09:12 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-27 02:00 +0000
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 21:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 22:52 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 09:27 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 10:51 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 22:01 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-27 09:21 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 11:01 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-26 05:32 -0700
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 09:42 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 11:03 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-26 17:02 +0000
Re: A UTM halt decider <is> a pure function of its inputs (undefinable) olcott <NoOne@NoWhere.com> - 2021-03-26 13:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undefinable) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 19:44 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undefinable) olcott <NoOne@NoWhere.com> - 2021-03-26 19:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undefinable) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:33 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-25 23:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 07:29 -0400
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) olcott <NoOne@NoWhere.com> - 2021-03-26 10:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 19:47 -0400
Page 19 of 29 — ← Prev page 1 … 17 18 [19] 20 21 … 29 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-05 13:58 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <GM-dnbntHaV4wPb9nZ2dnUU7-XWdnZ2d@giganews.com> |
| In reply to | #30643 |
On 4/5/2021 1:49 PM, Kaz Kylheku wrote: > On 2021-04-05, olcott <NoOne@NoWhere.com> wrote: >> On 4/5/2021 12:59 PM, André G. Isaak wrote: >>> By adding a third parameter you are no longer dealing with the same >>> computation as the Halting Problem. You're proving H_Hat with >>> information which it is not allowed to have in the Linz proof. >>> >>> André >>> >> >> So then what the proof shows that that an otherwise correct halt decider >> can be sufficiently hobbled so that it can no longer correctly decide >> halting. > > The important thing is that the proof shows what it says it shows. > Yes the proof shows one way that a halt decider will not work, and exceeds its bounds by claiming that this proves that no halt decider exists. -- 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-05 20:09 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <1FNaI.53993$fe7.38787@fx14.iad> |
| In reply to | #30645 |
On 4/5/21 2:58 PM, olcott wrote: > On 4/5/2021 1:49 PM, Kaz Kylheku wrote: >> On 2021-04-05, olcott <NoOne@NoWhere.com> wrote: >>> On 4/5/2021 12:59 PM, André G. Isaak wrote: >>>> By adding a third parameter you are no longer dealing with the same >>>> computation as the Halting Problem. You're proving H_Hat with >>>> information which it is not allowed to have in the Linz proof. >>>> >>>> André >>>> >>> >>> So then what the proof shows that that an otherwise correct halt decider >>> can be sufficiently hobbled so that it can no longer correctly decide >>> halting. >> >> The important thing is that the proof shows what it says it shows. >> > > Yes the proof shows one way that a halt decider will not work, and > exceeds its bounds by claiming that this proves that no halt decider > exists. > What limits did the proof put on a halt decider, other than it meet the definition of a Halt Decider? The proof will work for ANY Halt Decider that is actually a Computation (and if it isn't, then it couldn't be the Turing Machine H).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-05 19:17 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <ycmdnVbF-50RNfb9nZ2dnUU7-fudnZ2d@giganews.com> |
| In reply to | #30649 |
On 4/5/2021 7:09 PM, Richard Damon wrote: > On 4/5/21 2:58 PM, olcott wrote: >> On 4/5/2021 1:49 PM, Kaz Kylheku wrote: >>> On 2021-04-05, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/5/2021 12:59 PM, André G. Isaak wrote: >>>>> By adding a third parameter you are no longer dealing with the same >>>>> computation as the Halting Problem. You're proving H_Hat with >>>>> information which it is not allowed to have in the Linz proof. >>>>> >>>>> André >>>>> >>>> >>>> So then what the proof shows that that an otherwise correct halt decider >>>> can be sufficiently hobbled so that it can no longer correctly decide >>>> halting. >>> >>> The important thing is that the proof shows what it says it shows. >>> >> >> Yes the proof shows one way that a halt decider will not work, and >> exceeds its bounds by claiming that this proves that no halt decider >> exists. >> > > What limits did the proof put on a halt decider, other than it meet the > definition of a Halt Decider? > Kaz says that it must only have two params, if it has three params it is no good. > The proof will work for ANY Halt Decider that is actually a Computation > (and if it isn't, then it couldn't be the Turing Machine H). > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-05 20:29 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <%XNaI.177459$To.163669@fx44.iad> |
| In reply to | #30651 |
On 4/5/21 8:17 PM, olcott wrote: > On 4/5/2021 7:09 PM, Richard Damon wrote: >> On 4/5/21 2:58 PM, olcott wrote: >>> On 4/5/2021 1:49 PM, Kaz Kylheku wrote: >>>> On 2021-04-05, olcott <NoOne@NoWhere.com> wrote: >>>>> On 4/5/2021 12:59 PM, André G. Isaak wrote: >>>>>> By adding a third parameter you are no longer dealing with the same >>>>>> computation as the Halting Problem. You're proving H_Hat with >>>>>> information which it is not allowed to have in the Linz proof. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> So then what the proof shows that that an otherwise correct halt >>>>> decider >>>>> can be sufficiently hobbled so that it can no longer correctly decide >>>>> halting. >>>> >>>> The important thing is that the proof shows what it says it shows. >>>> >>> >>> Yes the proof shows one way that a halt decider will not work, and >>> exceeds its bounds by claiming that this proves that no halt decider >>> exists. >>> >> >> What limits did the proof put on a halt decider, other than it meet the >> definition of a Halt Decider? >> > > Kaz says that it must only have two params, if it has three params it is > no good. > Because by definition, the Halt Decider only gets, because it is all that it needs, the description of the Machine to decide on and the description of the Input it will receive. Since that is all that the answer will depend on, that is all that the decider can get. Now, if you want to pass your decider a work buffer, just make the function that is the computation just have the two required parameter, and just declare a local buffer on the stack and then call the function that needs the buffer. Also, if you had built your 'UTM' correctly, the the decider would be able to use that tape as its store.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-04-06 01:35 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <4536a2a5-ed61-4f43-b288-37df5d921114n@googlegroups.com> |
| In reply to | #30651 |
On Tuesday, 6 April 2021 at 01:17:23 UTC+1, olcott wrote: > On 4/5/2021 7:09 PM, Richard Damon wrote: > > On 4/5/21 2:58 PM, olcott wrote: > >> On 4/5/2021 1:49 PM, Kaz Kylheku wrote: > >>> On 2021-04-05, olcott <No...@NoWhere.com> wrote: > >>>> On 4/5/2021 12:59 PM, André G. Isaak wrote: > >>>>> By adding a third parameter you are no longer dealing with the same > >>>>> computation as the Halting Problem. You're proving H_Hat with > >>>>> information which it is not allowed to have in the Linz proof. > >>>>> > >>>>> André > >>>>> > >>>> > >>>> So then what the proof shows that that an otherwise correct halt decider > >>>> can be sufficiently hobbled so that it can no longer correctly decide > >>>> halting. > >>> > >>> The important thing is that the proof shows what it says it shows. > >>> > >> > >> Yes the proof shows one way that a halt decider will not work, and > >> exceeds its bounds by claiming that this proves that no halt decider > >> exists. > >> > > > > What limits did the proof put on a halt decider, other than it meet the > > definition of a Halt Decider? > > > Kaz says that it must only have two params, if it has three params it is > no good. > It's trivially easy to meet LInz's challenge of writing an H and H_Hat pair if we allow H to take a third parameter which varies depending on whether it is called from H_Hat or from main(). Note that if H and H_Hat are Turing machines, we'd have to talk about concatenating some additional information to the tape - that's the only input a Turing machine can see.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-06 12:35 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <87ft038x3k.fsf@bsb.me.uk> |
| In reply to | #30655 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > It's trivially easy to meet LInz's challenge of writing an H and H_Hat pair > if we allow H to take a third parameter which varies depending on whether > it is called from H_Hat or from main(). The only possible "challenge" I can see in Linz, is that H should correctly decide halting, and that can't be met no matter how many "parameters" you pass. (I'm using scare quotes because, as you note rather late, TMs don't have any such things.) If you want to propose a challenge, make it yours. Don't drag Linz into it! > Note that if H and H_Hat are Turing > machines, we'd have to talk about concatenating some additional information > to the tape - that's the only input a Turing machine can see. All this talk of pure functions, extra parameters, global and nested simulations are all distractions from the actual mistake. With Turing machines, correctly acting on encoded computations, the H to H^ construction can't be "got round". The correct challenge is to insist that PO provide H (or Halts as he calls it) and then to step away. We can the provide the input it gets wrong. As long as PO can provide both (and especially without showing H), the argument will degenerate into the detail of the mess he's made trying to link H and H^. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 09:24 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <spGdncWeooSW8vH9nZ2dnUU7-X_NnZ2d@giganews.com> |
| In reply to | #30656 |
On 4/6/2021 6:35 AM, Ben Bacarisse wrote: > Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > >> It's trivially easy to meet LInz's challenge of writing an H and H_Hat pair >> if we allow H to take a third parameter which varies depending on whether >> it is called from H_Hat or from main(). > > The only possible "challenge" I can see in Linz, is that H should > correctly decide halting, and that can't be met no matter how many > "parameters" you pass. (I'm using scare quotes because, as you note > rather late, TMs don't have any such things.) > > If you want to propose a challenge, make it yours. Don't drag Linz into > it! > >> Note that if H and H_Hat are Turing >> machines, we'd have to talk about concatenating some additional information >> to the tape - that's the only input a Turing machine can see. > > All this talk of pure functions, extra parameters, global and nested > simulations are all distractions from the actual mistake. With Turing > machines, correctly acting on encoded computations, the H to H^ > construction can't be "got round". > > The correct challenge is to insist that PO provide H (or Halts as he > calls it) and then to step away. We can the provide the input it gets > wrong. As long as PO can provide both (and especially without showing > H), the argument will degenerate into the detail of the mess he's made > trying to link H and H^. > I can easily show that H correctly decides H^ if H is allowed to have static local memory and H^ does not copy itself. http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf -- 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-06 10:28 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <re_aI.73647$YW.57782@fx39.iad> |
| In reply to | #30657 |
On 4/6/21 10:24 AM, olcott wrote: > I can easily show that H correctly decides H^ if H is allowed to have > static local memory and H^ does not copy itself. > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > > But with the static local memory, H is no longer a computation, as it is back-channeling between invocations and not always giving the same answer to the same official problem statement.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 09:36 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <NfadnfsisPdK7PH9nZ2dnUU7-KvNnZ2d@giganews.com> |
| In reply to | #30659 |
On 4/6/2021 9:28 AM, Richard Damon wrote: > On 4/6/21 10:24 AM, olcott wrote: > >> I can easily show that H correctly decides H^ if H is allowed to have >> static local memory and H^ does not copy itself. >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >> >> > > But with the static local memory, H is no longer a computation, as it is > back-channeling between invocations and not always giving the same > answer to the same official problem statement. > I disagree. You have never sufficiently documented this. When Halts() has its own static local memory it is acting just like a TM that can write to anywhere on its tape. Although it does base its halting decision on it input finite string the additional data is simply an intermediate internal state and not additional input. -- 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-06 11:13 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <sU_aI.29135$S46.3348@fx29.iad> |
| In reply to | #30661 |
On 4/6/21 10:36 AM, olcott wrote: > On 4/6/2021 9:28 AM, Richard Damon wrote: >> On 4/6/21 10:24 AM, olcott wrote: >> >>> I can easily show that H correctly decides H^ if H is allowed to have >>> static local memory and H^ does not copy itself. >>> >>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>> >>> >>> >> >> But with the static local memory, H is no longer a computation, as it is >> back-channeling between invocations and not always giving the same >> answer to the same official problem statement. >> > > I disagree. You have never sufficiently documented this. When Halts() > has its own static local memory it is acting just like a TM that can > write to anywhere on its tape. Although it does base its halting > decision on it input finite string the additional data is simply an > intermediate internal state and not additional input. > If Halts bases it decision on ANYTHING other than its formal inputs to THAT invocation of it, it is not a Computation. PERIOD. That is definition. Yes, it can use local memory just fine. Static memory, whose purpose is to transfer information from one invocation of the function to another, says that those invocations do not base there answer purely on their own inputs, and thus are not Computations. Yes, a TM can write on its own tape, and that is like a local variable. It can't read or write on the tape of the UTM running it (that would make the UTM not a UTM) or if it is acting like a UTM to the tape of a machiine it is simulating.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 10:27 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <m6KdnT_gpMhO4PH9nZ2dnUU7-VGdnZ2d@giganews.com> |
| In reply to | #30663 |
On 4/6/2021 10:13 AM, Richard Damon wrote: > On 4/6/21 10:36 AM, olcott wrote: >> On 4/6/2021 9:28 AM, Richard Damon wrote: >>> On 4/6/21 10:24 AM, olcott wrote: >>> >>>> I can easily show that H correctly decides H^ if H is allowed to have >>>> static local memory and H^ does not copy itself. >>>> >>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>> >>>> >>>> >>> >>> But with the static local memory, H is no longer a computation, as it is >>> back-channeling between invocations and not always giving the same >>> answer to the same official problem statement. >>> >> >> I disagree. You have never sufficiently documented this. When Halts() >> has its own static local memory it is acting just like a TM that can >> write to anywhere on its tape. Although it does base its halting >> decision on it input finite string the additional data is simply an >> intermediate internal state and not additional input. >> > > If Halts bases it decision on ANYTHING other than its formal inputs to > THAT invocation of it, it is not a Computation. PERIOD. That is definition. I disagree that means that a computation cannot have internal states and all comutations have internal states. > > Yes, it can use local memory just fine. > > Static memory, whose purpose is to transfer information from one > invocation of the function to another, says that those invocations do > not base there answer purely on their own inputs, and thus are not > Computations. > > Yes, a TM can write on its own tape, and that is like a local variable. > It can't read or write on the tape of the UTM running it (that would > make the UTM not a UTM) or if it is acting like a UTM to the tape of a > machiine it is simulating. > > -- 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-06 11:42 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <vj%aI.50110$bL3.28296@fx10.iad> |
| In reply to | #30666 |
On 4/6/21 11:27 AM, olcott wrote: > On 4/6/2021 10:13 AM, Richard Damon wrote: >> >> If Halts bases it decision on ANYTHING other than its formal inputs to >> THAT invocation of it, it is not a Computation. PERIOD. That is >> definition. > > I disagree that means that a computation cannot have internal states and > all comutations have internal states. I NEVER said it can't have internal states. If the internal state is derived from the formal inputs, then everything is derived from the formal inputs. What it can't do is reach outside the inputs to that Computation to get information that wasn't provided to it. In C, this is LOCAL variables, not STATIC variables. In some cases statics or globals may be able to pass, if they don't actually provide information leakage. But that takes very careful study to make sure that is true. > >> >> Yes, it can use local memory just fine. >> >> Static memory, whose purpose is to transfer information from one >> invocation of the function to another, says that those invocations do >> not base there answer purely on their own inputs, and thus are not >> Computations. >> >> Yes, a TM can write on its own tape, and that is like a local variable. >> It can't read or write on the tape of the UTM running it (that would >> make the UTM not a UTM) or if it is acting like a UTM to the tape of a >> machiine it is simulating. >> >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 10:51 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <M8ednYtYEpriHvH9nZ2dnUU7-e_NnZ2d@giganews.com> |
| In reply to | #30669 |
On 4/6/2021 10:42 AM, Richard Damon wrote: > On 4/6/21 11:27 AM, olcott wrote: >> On 4/6/2021 10:13 AM, Richard Damon wrote: >>> >>> If Halts bases it decision on ANYTHING other than its formal inputs to >>> THAT invocation of it, it is not a Computation. PERIOD. That is >>> definition. >> >> I disagree that means that a computation cannot have internal states and >> all comutations have internal states. > > I NEVER said it can't have internal states. If the internal state is > derived from the formal inputs, then everything is derived from the > formal inputs. > > What it can't do is reach outside the inputs to that Computation to get > information that wasn't provided to it. > > In C, this is LOCAL variables, not STATIC variables. > > In some cases statics or globals may be able to pass, if they don't > actually provide information leakage. But that takes very careful study > to make sure that is true. > The first invocation of Halts keeps track of all of the details of every UTM that it simulates including when it simulates itself recursively. Its only actual input is a machine description. >> >>> >>> Yes, it can use local memory just fine. >>> >>> Static memory, whose purpose is to transfer information from one >>> invocation of the function to another, says that those invocations do >>> not base there answer purely on their own inputs, and thus are not >>> Computations. >>> >>> Yes, a TM can write on its own tape, and that is like a local variable. >>> It can't read or write on the tape of the UTM running it (that would >>> make the UTM not a UTM) or if it is acting like a UTM to the tape of a >>> machiine it is simulating. >>> >>> >> >> > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-06 17:42 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <20210406103503.330@kylheku.com> |
| In reply to | #30671 |
On 2021-04-06, olcott <NoOne@NoWhere.com> wrote: > The first invocation of Halts keeps track of all of the details of every > UTM that it simulates including when it simulates itself recursively. > Its only actual input is a machine description. Since the second invocation of Halts depends on the current state, it is not a pure function call of its arguments. It's a function of its arguments, plus the current snapshot of a churning toilet bowl of global state. Knowing this, no researcher trying to demonstrate the flaw in your system would write a test case which calls this entry point. They will attack the only thing in your system which resembles a decider function: the to-level invocation of the simulation. Everything you've tried to demonstrate with Halts and H_Hat and all that is a complete red herring. H_Hat is not a valid test case of the halt decider, because it makes a call to Halts. That call is not the initial call, and therefore dependent on the churning vortex of global state. The COFF object file is the test case. You must step away from the system and let the independent researcher produce every aspect of the test case.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-06 13:32 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <s4id0a$prp$1@dont-email.me> |
| In reply to | #30657 |
On 2021-04-06 08:24, olcott wrote: > On 4/6/2021 6:35 AM, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >> >>> It's trivially easy to meet LInz's challenge of writing an H and >>> H_Hat pair >>> if we allow H to take a third parameter which varies depending on >>> whether >>> it is called from H_Hat or from main(). >> >> The only possible "challenge" I can see in Linz, is that H should >> correctly decide halting, and that can't be met no matter how many >> "parameters" you pass. (I'm using scare quotes because, as you note >> rather late, TMs don't have any such things.) >> >> If you want to propose a challenge, make it yours. Don't drag Linz into >> it! >> >>> Note that if H and H_Hat are Turing >>> machines, we'd have to talk about concatenating some additional >>> information >>> to the tape - that's the only input a Turing machine can see. >> >> All this talk of pure functions, extra parameters, global and nested >> simulations are all distractions from the actual mistake. With Turing >> machines, correctly acting on encoded computations, the H to H^ >> construction can't be "got round". >> >> The correct challenge is to insist that PO provide H (or Halts as he >> calls it) and then to step away. We can the provide the input it gets >> wrong. As long as PO can provide both (and especially without showing >> H), the argument will degenerate into the detail of the mess he's made >> trying to link H and H^. >> > > I can easily show that H correctly decides H^ if H is allowed to have > static local memory and H^ does not copy itself. IOW, I can easily show this provided H-Hat isn't required to actually be H_Hat. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-06 16:02 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <r73bI.286788$jk4.45563@fx48.iad> |
| In reply to | #30657 |
On 4/6/21 10:24 AM, olcott wrote: > > I can easily show that H correctly decides H^ if H is allowed to have > static local memory and H^ does not copy itself. > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > Except that you don't show this, except by not having H be a computation, and thus not the equivalent of a Turing Machine so it can't be the equivalent of the Machine H. You also don't let H_Hat actually run in the test case but just abort it. This just says that your Halt Decider agrees with itself. This is all smoke and mirrors with a non-computation (which is what the static memory got you). This also means that H^ can't be right, since to build H^ you need a proper H that is a Turing Machine, so needs to be a computation.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 15:36 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <le-dneA8guO3W_H9nZ2dnUU7-dPNnZ2d@giganews.com> |
| In reply to | #30688 |
On 4/6/2021 3:02 PM, Richard Damon wrote: > On 4/6/21 10:24 AM, olcott wrote: >> >> I can easily show that H correctly decides H^ if H is allowed to have >> static local memory and H^ does not copy itself. >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >> > > Except that you don't show this, except by not having H be a > computation, and thus not the equivalent of a Turing Machine so it can't > be the equivalent of the Machine H. > I disagree that H is not a computation. In any case I know how to set it up so that it does not need static memory and it does not need an extra parameter. > You also don't let H_Hat actually run in the test case but just abort it. > Any halt decider that bases its halting decision on simulating its input must necessarily stop simulating its input as soon as it detects that its input would not otherwise halt. If this is disallowed then we can make an analogous "dog walking problem" and say that it is impossible to walk you dog across the street without your dog ending up on the other side of the street. > This just says that your Halt Decider agrees with itself. > > This is all smoke and mirrors with a non-computation (which is what the > static memory got you). This also means that H^ can't be right, since to > build H^ you need a proper H that is a Turing Machine, so needs to be a > computation. > -- 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-06 16:46 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <jM3bI.50752$SE7.28939@fx22.iad> |
| In reply to | #30692 |
On 4/6/21 4:36 PM, olcott wrote: > On 4/6/2021 3:02 PM, Richard Damon wrote: >> On 4/6/21 10:24 AM, olcott wrote: >>> >>> I can easily show that H correctly decides H^ if H is allowed to have >>> static local memory and H^ does not copy itself. >>> >>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>> >>> >> >> Except that you don't show this, except by not having H be a >> computation, and thus not the equivalent of a Turing Machine so it can't >> be the equivalent of the Machine H. >> > > I disagree that H is not a computation. In any case I know how to set it > up so that it does not need static memory and it does not need an extra > parameter. Halts, when asked directly about if H_Hat(H_Hat) is halting, directly returns the answer that it is not. When we run H_Hat(H_Hat) and it asks Halts about H_Hat(H_Hat) it does not answer. but the system aborts it. Thus, Halts is not consistant or the global halt decider is wrong.\ PERIOD. > >> You also don't let H_Hat actually run in the test case but just abort it. >> > > Any halt decider that bases its halting decision on simulating its input > must necessarily stop simulating its input as soon as it detects that > its input would not otherwise halt. Yes, it can stop simulating its input, and return the answer to its caller, even if that caller is the same code as it was simulating. THAT is part of the definition of a decider. If the global decider decides that there is infinite recursion inside the call to halts that is inside the call the H_Hat, that means that either Halts is not going to return (this time) or it is wrong. > > If this is disallowed then we can make an analogous "dog walking > problem" and say that it is impossible to walk you dog across the street > without your dog ending up on the other side of the street. Yes, it IS impossible to walk you dog to the other side of the street without you dog ending up on the other side of the street. The halting problem doesn't have that sort of contradiction in its definition, maybe you are adding something like that in your warped definitions. The halting problem provide ZERO restrictions for the computations you do inside your halting decider, you can abort what ever simulations you want. You just need to give the answer to your caller, whoever it is. Same answer for the same question every time. And let your caller run undisturbed. The test is NOT run inside a halt decider, but as an independent machine.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-07 00:34 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <87wntf6l8v.fsf@bsb.me.uk> |
| In reply to | #30657 |
olcott <NoOne@NoWhere.com> writes: > On 4/6/2021 6:35 AM, Ben Bacarisse wrote: >> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >> >>> It's trivially easy to meet LInz's challenge of writing an H and H_Hat pair >>> if we allow H to take a third parameter which varies depending on whether >>> it is called from H_Hat or from main(). >> >> The only possible "challenge" I can see in Linz, is that H should >> correctly decide halting, and that can't be met no matter how many >> "parameters" you pass. (I'm using scare quotes because, as you note >> rather late, TMs don't have any such things.) >> >> If you want to propose a challenge, make it yours. Don't drag Linz into >> it! >> >>> Note that if H and H_Hat are Turing >>> machines, we'd have to talk about concatenating some additional information >>> to the tape - that's the only input a Turing machine can see. >> >> All this talk of pure functions, extra parameters, global and nested >> simulations are all distractions from the actual mistake. With Turing >> machines, correctly acting on encoded computations, the H to H^ >> construction can't be "got round". >> >> The correct challenge is to insist that PO provide H (or Halts as he >> calls it) and then to step away. We can the provide the input it gets >> wrong. As long as PO can provide both (and especially without showing >> H), the argument will degenerate into the detail of the mess he's made >> trying to link H and H^. > > I can easily show that H correctly decides H^ if H is allowed to have > static local memory and H^ does not copy itself. I wonder why you think anyone cares about that. Two and a quarter years ago, you made a clear and simple claim -- to have something everyone else knew was impossible: two fully encoded, actual Turing machines, exactly and precisely as in Linz, but where H gives the right answer for H^([H^]). You didn't, of course. You were mistaken, but then you decided to lie to cover up the mistake. Now, all these months later, all you are claiming is to have something everyone knows is possible. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 18:48 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <PeOdnRLewvqtbvH9nZ2dnUU7-LGdnZ2d@giganews.com> |
| In reply to | #30696 |
On 4/6/2021 6:34 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/6/2021 6:35 AM, Ben Bacarisse wrote: >>> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: >>> >>>> It's trivially easy to meet LInz's challenge of writing an H and H_Hat pair >>>> if we allow H to take a third parameter which varies depending on whether >>>> it is called from H_Hat or from main(). >>> >>> The only possible "challenge" I can see in Linz, is that H should >>> correctly decide halting, and that can't be met no matter how many >>> "parameters" you pass. (I'm using scare quotes because, as you note >>> rather late, TMs don't have any such things.) >>> >>> If you want to propose a challenge, make it yours. Don't drag Linz into >>> it! >>> >>>> Note that if H and H_Hat are Turing >>>> machines, we'd have to talk about concatenating some additional information >>>> to the tape - that's the only input a Turing machine can see. >>> >>> All this talk of pure functions, extra parameters, global and nested >>> simulations are all distractions from the actual mistake. With Turing >>> machines, correctly acting on encoded computations, the H to H^ >>> construction can't be "got round". >>> >>> The correct challenge is to insist that PO provide H (or Halts as he >>> calls it) and then to step away. We can the provide the input it gets >>> wrong. As long as PO can provide both (and especially without showing >>> H), the argument will degenerate into the detail of the mess he's made >>> trying to link H and H^. >> >> I can easily show that H correctly decides H^ if H is allowed to have >> static local memory and H^ does not copy itself. > > I wonder why you think anyone cares about that. Two and a quarter years > ago, you made a clear and simple claim -- to have something everyone > else knew was impossible: two fully encoded, actual Turing machines, > exactly and precisely as in Linz, but where H gives the right answer for > H^([H^]). You didn't, of course. You were mistaken, but then you > decided to lie to cover up the mistake. Now, all these months later, > all you are claiming is to have something everyone knows is possible. > I can do it without static local memory. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 19 of 29 — ← Prev page 1 … 17 18 [19] 20 21 … 29 Next page →
Back to top | Article view | comp.theory
csiph-web