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 20 of 29 — ← Prev page 1 … 18 19 [20] 21 22 … 29 Next page →
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-06 18:06 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <s4it1h$8va$1@dont-email.me> |
| In reply to | #30697 |
On 2021-04-06 17:48, olcott wrote: > 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. But you can't do it by actually deriving H_Hat from your Halt decider in the way that the Linz proof demands. Unless you can do this, you aren't demonstrating anything. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 19:20 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <1b6dnQSZHMohZ_H9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #30698 |
On 4/6/2021 7:06 PM, André G. Isaak wrote: > On 2021-04-06 17:48, olcott wrote: >> 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. > > But you can't do it by actually deriving H_Hat from your Halt decider in > the way that the Linz proof demands. Unless you can do this, you aren't > demonstrating anything. > > > André > I think that I can do it so that it is a computation and is the same form as the Linz proof, except for the infinitely recursive copying of H^. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-06 18:38 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <s4iuuk$ion$1@dont-email.me> |
| In reply to | #30699 |
On 2021-04-06 18:20, olcott wrote: > On 4/6/2021 7:06 PM, André G. Isaak wrote: >> On 2021-04-06 17:48, olcott wrote: >>> I can do it without static local memory. >> >> But you can't do it by actually deriving H_Hat from your Halt decider >> in the way that the Linz proof demands. Unless you can do this, you >> aren't demonstrating anything. >> >> >> André >> > > I think that I can do it so that it is a computation and is the same > form as the Linz proof, except for the infinitely recursive copying of H^. There is no infinitely recursive copying in Linz's H_Hat. The infinite recursion is caused by your H, not by Linz's method for deriving H_Hat. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 20:06 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <h_udnUGdWcI6mPD9nZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #30701 |
On 4/6/2021 7:38 PM, André G. Isaak wrote: > On 2021-04-06 18:20, olcott wrote: >> On 4/6/2021 7:06 PM, André G. Isaak wrote: >>> On 2021-04-06 17:48, olcott wrote: > >>>> I can do it without static local memory. >>> >>> But you can't do it by actually deriving H_Hat from your Halt decider >>> in the way that the Linz proof demands. Unless you can do this, you >>> aren't demonstrating anything. >>> >>> >>> André >>> >> >> I think that I can do it so that it is a computation and is the same >> form as the Linz proof, except for the infinitely recursive copying of >> H^. > > There is no infinitely recursive copying in Linz's H_Hat. The infinite > recursion is caused by your H, not by Linz's method for deriving H_Hat. > > André > Yes of course if you don't ever bother to think anything through then the logical consequence does not yet exist in your mind, which is not the same thing as this logical consequence not existing, you are merely not aware of it. Of all of the halt deciding systems that can possibly exist doing a simple debug trace of the input is the most straight forward and direct. For every halt decider that does a debug trace of its input the Linz H^ specifies infinitely recursive inputs thus is definitely not halting. Definitely not halting is the correct decision thus proving that the Linz H^ is decidable. Once the correct decision is definitely known calling it undecidable is freaking nuts. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-06 19:46 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <s4j2u3$uj1$1@dont-email.me> |
| In reply to | #30703 |
On 2021-04-06 19:06, olcott wrote: > On 4/6/2021 7:38 PM, André G. Isaak wrote: >> On 2021-04-06 18:20, olcott wrote: >>> On 4/6/2021 7:06 PM, André G. Isaak wrote: >>>> On 2021-04-06 17:48, olcott wrote: >> >>>>> I can do it without static local memory. >>>> >>>> But you can't do it by actually deriving H_Hat from your Halt >>>> decider in the way that the Linz proof demands. Unless you can do >>>> this, you aren't demonstrating anything. >>>> >>>> >>>> André >>>> >>> >>> I think that I can do it so that it is a computation and is the same >>> form as the Linz proof, except for the infinitely recursive copying >>> of H^. >> >> There is no infinitely recursive copying in Linz's H_Hat. The infinite >> recursion is caused by your H, not by Linz's method for deriving H_Hat. >> >> André >> > > Yes of course if you don't ever bother to think anything through then > the logical consequence does not yet exist in your mind, which is not > the same thing as this logical consequence not existing, you are merely > not aware of it. > > Of all of the halt deciding systems that can possibly exist doing a > simple debug trace of the input is the most straight forward and direct. That's an assertion which you keep making, but you've never backed it up. The fact that you've adopted a particular approach doesn't make that approach the most straightforward or direct. > For every halt decider that does a debug trace of its input the Linz H^ > specifies infinitely recursive inputs thus is definitely not halting. And this illustrates a fundamental flaw with 'deciders' which are based on a debug trace. > Definitely not halting is the correct decision thus proving that the > Linz H^ is decidable. > > Once the correct decision is definitely known calling it undecidable is > freaking nuts. No one has ever claimed that Linz's H_hat is undecidable. Linz certainly doesn't claim that. Linz's proof shows that for any purported halt decider, one can construct a TM which that specific halt decider cannot correctly decide. That's not the same thing as being undecidable. 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 22:17 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <kD8bI.261396$RS3.29122@fx18.iad> |
| In reply to | #30703 |
On 4/6/21 9:06 PM, olcott wrote: > On 4/6/2021 7:38 PM, André G. Isaak wrote: >> On 2021-04-06 18:20, olcott wrote: >>> On 4/6/2021 7:06 PM, André G. Isaak wrote: >>>> On 2021-04-06 17:48, olcott wrote: >> >>>>> I can do it without static local memory. >>>> >>>> But you can't do it by actually deriving H_Hat from your Halt >>>> decider in the way that the Linz proof demands. Unless you can do >>>> this, you aren't demonstrating anything. >>>> >>>> >>>> André >>>> >>> >>> I think that I can do it so that it is a computation and is the same >>> form as the Linz proof, except for the infinitely recursive copying >>> of H^. >> >> There is no infinitely recursive copying in Linz's H_Hat. The infinite >> recursion is caused by your H, not by Linz's method for deriving H_Hat. >> >> André >> > > Yes of course if you don't ever bother to think anything through then > the logical consequence does not yet exist in your mind, which is not > the same thing as this logical consequence not existing, you are merely > not aware of it. > > Of all of the halt deciding systems that can possibly exist doing a > simple debug trace of the input is the most straight forward and direct. > > For every halt decider that does a debug trace of its input the Linz H^ > specifies infinitely recursive inputs thus is definitely not halting. > > Definitely not halting is the correct decision thus proving that the > Linz H^ is decidable. > > Once the correct decision is definitely known calling it undecidable is > freaking nuts. > > First, you are the one that won't think about alternative method, but seem to insist that the ONLY way to solve the haltinp problem is by simple simulation. Yes, if you do decide to start with a method based on simulation, this recursion from self referencing is an issue that needs to be tackled, but it is an issue that the choosers of this method need to handle, not the problem statement. Note, the fact that you keep missing is that IF H^(H^) IS actually infinitely recursive through H(H^,H^), then H(H^,H^) is also infinitely recursive through H^(H^) and thus H must be non-halting, and thus not a decider. The fact that H knows how to break the loop and make itself not infinitely recursive ALSO lets H^ not be infinitely recursive. This means your proof of the non-haltig incorrect. You can only even attempt to make that argument by trying to redefine the halting criteria from does it actually halt to it wouldn't halt if not aborted, which isn't the right criteria. One other key thing that you seem to overlook, is that H^ itself is absolutely NOT recursive or even self referential. H^ takes an 'arbitrary' input, a representation for a program, and that program can be any of a VAST number of Turing Machines. It is NOT fixed to be the representation of itself. This is perhaps one weakness of your current machine design, that the input to x86utm is just a COFF file that needs to somehow be a representation of the combination of the machine to run and its input. Do you provide access to disk I/O routines to allow simulated Turing Machines to build a modified COFF file to be made for input into x86utm? Is it even possible for a Turing Machine under x86utm to ask x86utm to simulate a COFF File and return its result? If not, then x86utm ISN'T really a Turing Machine itself, so isn't really a UTM, and your architecture starts to fall apart as a Turing Machine simulation system.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-07 13:16 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <8735w270i7.fsf@bsb.me.uk> |
| In reply to | #30703 |
olcott <NoOne@NoWhere.com> writes: > On 4/6/2021 7:38 PM, André G. Isaak wrote: >> On 2021-04-06 18:20, olcott wrote: >>> On 4/6/2021 7:06 PM, André G. Isaak wrote: >>>> On 2021-04-06 17:48, olcott wrote: >> >>>>> I can do it without static local memory. >>>> >>>> But you can't do it by actually deriving H_Hat from your Halt >>>> decider in the way that the Linz proof demands. Unless you can do >>>> this, you aren't demonstrating anything. >>>> >>> >>> I think that I can do it so that it is a computation and is the same >>> form as the Linz proof, except for the infinitely recursive copying >>> of H^. >> >> There is no infinitely recursive copying in Linz's H_Hat. The >> infinite recursion is caused by your H, not by Linz's method for >> deriving H_Hat. > > Yes of course if you don't ever bother to think anything through then > the logical consequence does not yet exist in your mind, which is not > the same thing as this logical consequence not existing, you are > merely not aware of it. André is (not surprisingly) correct -- there is no infinite recusion implied by Linz's H^. You can (and will) pretend that this is because he's not thought it though, but that just makes you feel better. It is not a comment on the facts of the matter. You are still wrong about this, all these years later. There are lots of problems in showing that you wrong, not least the fact that you don't pay attention and you have zero respect anyone who understands this subject properly, but I still think you could, at a pinch, learn what the "hat" construction involves. You'd have to be prepared to be a student, though. > Of all of the halt deciding systems that can possibly exist doing a > simple debug trace of the input is the most straight forward and > direct. And the most obviously wrong. Of course all approaches are wrong in the sense that it is an impossible task, but your > For every halt decider that does a debug trace of its input the Linz > H^ specifies infinitely recursive inputs thus is definitely not > halting. Linz assumes a decider. The "hat" construction adds no recursion to /any/ decider. A simulator is not a decider. A simulator that stops some simulations gets at least one case wrong. If you ever post your code, we'll show you the computation it gets wrong. > Definitely not halting is the correct decision thus proving that the > Linz H^ is decidable. You still don't know how to speak about this topic. What you have written there is literal gibberish. H^ is a TM and hating is about computations, not machines. And, as you've been told countless times already, every single computation -- every instance of the halting problem -- is decidable. What you have failed to show (because it's impossible) is an H that gets the right answer for a correctly constructed H^. Your current plan is not to post and code for H (or Halts as you call it) so that the confounding example can't be given. > Once the correct decision is definitely known calling it undecidable > is freaking nuts. Which no one has ever said. The problem with your ruse is that when you make the mistake of showing "Halts", you have to come clean about the fact that it reports "does not halt" about a computation that halts. The computation that does not halt, uses a different "Halts". You've done this now in lots of different ways, the most blatant being to have a line actually commented out! No matter how you dress it up, you can't get round the logic of the fact that every TM gets at least one halting-problem instance wrong. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2021-04-07 12:40 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <s4k98l$l18$1@news.muc.de> |
| In reply to | #30706 |
Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: [ .... ] > You still don't know how to speak about this topic. What you have > written there is literal gibberish. H^ is a TM and hating is about > computations, not machines. No, hating is about human relationships. _Halting_ is about computations. :-) [ .... ]. > -- > Ben. -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-07 13:25 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <G4qdnaRic9W9ZPD9nZ2dnUU7-fudnZ2d@giganews.com> |
| In reply to | #30708 |
On 4/7/2021 7:40 AM, Alan Mackenzie wrote: > Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > > [ .... ] > >> You still don't know how to speak about this topic. What you have >> written there is literal gibberish. H^ is a TM and hating is about >> computations, not machines. > > No, hating is about human relationships. _Halting_ is about > computations. :-) > Freudian slip. > [ .... ]. > >> -- >> Ben. > -- 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-07 10:26 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <OijbI.105791$Pb1.84520@fx04.iad> |
| In reply to | #30706 |
On 4/7/21 8:16 AM, Ben Bacarisse wrote:
> André is (not surprisingly) correct -- there is no infinite recusion
> implied by Linz's H^. You can (and will) pretend that this is because
> he's not thought it though, but that just makes you feel better. It is
> not a comment on the facts of the matter. You are still wrong about
> this, all these years later.
Actually, in one sense due to fundamental limitation in his x86utm
program, the only way to express H^(H^) might be with something that has
some signs of recursion.
First, his x86utm Turing Machine Description format is somewhat
defective in that it can't express a Turing Machine by itself, only as a
combine Turing Machine / Input description. This means that simulated
machines can't really write to their real tape to build up data like a
real Turing Machine.
Also, since Halts appears to NOT be just a function of its formal
parameters, but also does get information from outside from the x86utm
'OS', it really isn't the right thing to wrap H^ about, but since x86utm
IS defined to also be a halt decider, then it seems we should be able to
define our H^(H^) file based on something like:
void H_Hat(u32 P) {
bool halted = x86utm("H_Hat.obj");
while(halted) continue;
}
where x86utm is a copy of his code (so it is properly embedded in the
TM) set to take the file name as a parameter instead of via command
line, and returning the halting status decision.
My guess is this won't work because x86utm likely does things he doesn't
allow simulated Turing Machines to do, and thus shows itself not to
really be a UTM, because it either isn't U or it isn't a TM.
The other right thing ablut this way is we have now broken the forced
recursion and taken it back to be just the natural self-reference.
>
> There are lots of problems in showing that you wrong, not least the fact
> that you don't pay attention and you have zero respect anyone who
> understands this subject properly, but I still think you could, at a
> pinch, learn what the "hat" construction involves. You'd have to be
> prepared to be a student, though.
>
>> Of all of the halt deciding systems that can possibly exist doing a
>> simple debug trace of the input is the most straight forward and
>> direct.
>
> And the most obviously wrong. Of course all approaches are wrong in the
> sense that it is an impossible task, but your
>
>> For every halt decider that does a debug trace of its input the Linz
>> H^ specifies infinitely recursive inputs thus is definitely not
>> halting.
>
> Linz assumes a decider. The "hat" construction adds no recursion to
> /any/ decider. A simulator is not a decider. A simulator that stops
> some simulations gets at least one case wrong. If you ever post your
> code, we'll show you the computation it gets wrong.
>
>> Definitely not halting is the correct decision thus proving that the
>> Linz H^ is decidable.
>
> You still don't know how to speak about this topic. What you have
> written there is literal gibberish. H^ is a TM and hating is about
> computations, not machines. And, as you've been told countless times
> already, every single computation -- every instance of the halting
> problem -- is decidable.
>
> What you have failed to show (because it's impossible) is an H that gets
> the right answer for a correctly constructed H^. Your current plan is
> not to post and code for H (or Halts as you call it) so that the
> confounding example can't be given.
>
>> Once the correct decision is definitely known calling it undecidable
>> is freaking nuts.
>
> Which no one has ever said. The problem with your ruse is that when you
> make the mistake of showing "Halts", you have to come clean about the
> fact that it reports "does not halt" about a computation that halts.
> The computation that does not halt, uses a different "Halts". You've
> done this now in lots of different ways, the most blatant being to have
> a line actually commented out! No matter how you dress it up, you can't
> get round the logic of the fact that every TM gets at least one
> halting-problem instance wrong.
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-07 16:04 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <87wnte5e5i.fsf@bsb.me.uk> |
| In reply to | #30709 |
Richard Damon <Richard@Damon-Family.org> writes: > On 4/7/21 8:16 AM, Ben Bacarisse wrote: > >> André is (not surprisingly) correct -- there is no infinite recusion >> implied by Linz's H^. You can (and will) pretend that this is because >> he's not thought it though, but that just makes you feel better. It is >> not a comment on the facts of the matter. You are still wrong about >> this, all these years later. > > Actually, in one sense due to fundamental limitation in his x86utm > program, the only way to express H^(H^) might be with something that has > some signs of recursion. Your "actually" suggest that you might disagree, but then you seem to be talking about something else. André was talking about "Linz's H^" and I was agreeing with him. > First, his x86utm Turing Machine Description format... I strive not to give any legitimacy to PO's abuse of terms. He is not working with TMs and there is no UTM anywhere in the pile of garbage he's been using to distract from the fact that he has not TMs. He once said he did, but he's been backtracking on the for years now. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-07 11:22 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <N6kbI.167382$QT3.112908@fx33.iad> |
| In reply to | #30710 |
On 4/7/21 11:04 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 4/7/21 8:16 AM, Ben Bacarisse wrote: >> >>> André is (not surprisingly) correct -- there is no infinite recusion >>> implied by Linz's H^. You can (and will) pretend that this is because >>> he's not thought it though, but that just makes you feel better. It is >>> not a comment on the facts of the matter. You are still wrong about >>> this, all these years later. >> >> Actually, in one sense due to fundamental limitation in his x86utm >> program, the only way to express H^(H^) might be with something that has >> some signs of recursion. > > Your "actually" suggest that you might disagree, but then you seem to be > talking about something else. André was talking about "Linz's H^" and I > was agreeing with him. My comment is about once you translate Linz into the format forced by PO's system, there can be a recursion implied, because you can't just describe H^, but only the combination of H^(P), and with P=H^, and the resistance (and difficulty) of making the described copy, you do get into a recursive structure. If we did compile the code as position independent, then we could (with the appropriate API documentation) do the proper copy of the code of H^. The issue is he refuses to allow Halts to be part of that machine that gets copied, as it seems part of the 'OS' (which Turing Machines don't have), and Halts is really the part that should be copies, but I think doing it for H_Hat would be enough to break is code. This gets us into the need to make a FULL copy of the full x86utm or just using something like exec to do the call to the 'proper' halt decider.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-07 22:05 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <87a6q96c0c.fsf@bsb.me.uk> |
| In reply to | #30711 |
Richard Damon <Richard@Damon-Family.org> writes: > On 4/7/21 11:04 AM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 4/7/21 8:16 AM, Ben Bacarisse wrote: >>> >>>> André is (not surprisingly) correct -- there is no infinite recusion >>>> implied by Linz's H^. You can (and will) pretend that this is because >>>> he's not thought it though, but that just makes you feel better. It is >>>> not a comment on the facts of the matter. You are still wrong about >>>> this, all these years later. >>> >>> Actually, in one sense due to fundamental limitation in his x86utm >>> program, the only way to express H^(H^) might be with something that has >>> some signs of recursion. >> >> Your "actually" suggest that you might disagree, but then you seem to be >> talking about something else. André was talking about "Linz's H^" and I >> was agreeing with him. > > My comment is about once you translate Linz into the format forced by > PO's system, there can be a recursion implied, because you can't just > describe H^, but only the combination of H^(P), and with P=H^, and the > resistance (and difficulty) of making the described copy, you do get > into a recursive structure. Yes. I just was not sure why you were telling me that. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 09:25 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <spGdncSeooTL8vH9nZ2dnUU7-X9QAAAA@giganews.com> |
| In reply to | #30655 |
On 4/6/2021 3:35 AM, Malcolm McLean wrote: > 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. > I am going to proceed as if the prohibition of static local memory is incorrect. -- 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:30 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <sg_aI.73715$YW.58676@fx39.iad> |
| In reply to | #30658 |
On 4/6/21 10:25 AM, olcott wrote: > I am going to proceed as if the prohibition of static local memory is > incorrect. > If H depends on the value it gets from another source than the formal arguemnts, it is not a computation and can't be a Turing Machine, so you WHOLE proof goes down the drain, as you can't make the statement that you function is the Turing Equivalent of some H.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 09:41 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <Z8ydnQQ7cKhu7_H9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #30660 |
On 4/6/2021 9:30 AM, Richard Damon wrote: > On 4/6/21 10:25 AM, olcott wrote: > >> I am going to proceed as if the prohibition of static local memory is >> incorrect. >> > > If H depends on the value it gets from another source than the formal > arguemnts, it is not a computation and can't be a Turing Machine, so you > WHOLE proof goes down the drain, as you can't make the statement that > you function is the Turing Equivalent of some H. > I disagree a TM can have intermediate internal states based on its input. The static local data is merely the TM's global tape used for storing intermediate internal states. When Halts simulates itself to several levels of recursive depth it simply instructs these simulations to write some of their their data to its own master tape. -- 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 15:17 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <20210406081336.44@kylheku.com> |
| In reply to | #30662 |
On 2021-04-06, olcott <NoOne@NoWhere.com> wrote: > On 4/6/2021 9:30 AM, Richard Damon wrote: >> On 4/6/21 10:25 AM, olcott wrote: >> >>> I am going to proceed as if the prohibition of static local memory is >>> incorrect. >>> >> >> If H depends on the value it gets from another source than the formal >> arguemnts, it is not a computation and can't be a Turing Machine, so you >> WHOLE proof goes down the drain, as you can't make the statement that >> you function is the Turing Equivalent of some H. >> > > I disagree a TM can have intermediate internal states based on its > input. The static local data is merely the TM's global tape used for > storing intermediate internal states. When Halts simulates itself to > several levels of recursive depth it simply instructs these simulations > to write some of their their data to its own master tape. That state mustbe initialized to the same state each time the TM is invoked. A TM is *defined* by a specific string of initial content of a tape. It depends only on that. A C function that retains mutable static data between invocations isn't modeling a single TM. It's a different TM every time it is called. If the previous state of a procedure is accessible to a new invocation of a procedure, that procedure isn't a function of its arguments. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 10:34 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <dc-dnbE00trk4vH9nZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #30664 |
On 4/6/2021 10:17 AM, Kaz Kylheku wrote: > On 2021-04-06, olcott <NoOne@NoWhere.com> wrote: >> On 4/6/2021 9:30 AM, Richard Damon wrote: >>> On 4/6/21 10:25 AM, olcott wrote: >>> >>>> I am going to proceed as if the prohibition of static local memory is >>>> incorrect. >>>> >>> >>> If H depends on the value it gets from another source than the formal >>> arguemnts, it is not a computation and can't be a Turing Machine, so you >>> WHOLE proof goes down the drain, as you can't make the statement that >>> you function is the Turing Equivalent of some H. >>> >> >> I disagree a TM can have intermediate internal states based on its >> input. The static local data is merely the TM's global tape used for >> storing intermediate internal states. When Halts simulates itself to >> several levels of recursive depth it simply instructs these simulations >> to write some of their their data to its own master tape. > > That state mustbe initialized to the same state each time the TM is invoked. > > A TM is *defined* by a specific string of initial content of a tape. > It depends only on that. A UTM can keep track of all of the details of its simulations of other UTMs including the details of its simulation of itself on its own master tape. The finite string machine description of the machine that it is simulating is its input. All of the details of the steps in simulating this machine are its own internal state and not input. > > A C function that retains mutable static data between invocations isn't > modeling a single TM. It's a different TM every time it is called. > > If the previous state of a procedure is accessible to a new invocation > of a procedure, that procedure isn't a function of its arguments. > A Master UTM can store every step of -- 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:48 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <ep%aI.30202$GCH7.8094@fx17.iad> |
| In reply to | #30667 |
On 4/6/21 11:34 AM, olcott wrote: > On 4/6/2021 10:17 AM, Kaz Kylheku wrote: >> On 2021-04-06, olcott <NoOne@NoWhere.com> wrote: >>> On 4/6/2021 9:30 AM, Richard Damon wrote: >>>> On 4/6/21 10:25 AM, olcott wrote: >>>> >>>>> I am going to proceed as if the prohibition of static local memory is >>>>> incorrect. >>>>> >>>> >>>> If H depends on the value it gets from another source than the formal >>>> arguemnts, it is not a computation and can't be a Turing Machine, so >>>> you >>>> WHOLE proof goes down the drain, as you can't make the statement that >>>> you function is the Turing Equivalent of some H. >>>> >>> >>> I disagree a TM can have intermediate internal states based on its >>> input. The static local data is merely the TM's global tape used for >>> storing intermediate internal states. When Halts simulates itself to >>> several levels of recursive depth it simply instructs these simulations >>> to write some of their their data to its own master tape. >> >> That state mustbe initialized to the same state each time the TM is >> invoked. >> >> A TM is *defined* by a specific string of initial content of a tape. >> It depends only on that. > > A UTM can keep track of all of the details of its simulations of other > UTMs including the details of its simulation of itself on its own master > tape. The finite string machine description of the machine that it is > simulating is its input. All of the details of the steps in simulating > this machine are its own internal state and not input. > >> >> A C function that retains mutable static data between invocations isn't >> modeling a single TM. It's a different TM every time it is called. >> >> If the previous state of a procedure is accessible to a new invocation >> of a procedure, that procedure isn't a function of its arguments. >> > > A Master UTM can store every step of > Yes, the outer machines can peek into the inner machines and GET information, the inner machines can not get from the outer machines, or even know they exist. Now, if the outer machine is ACTUALLY simulating that inner machine, then it already HAS all the information that it needs, and doesn't need any help from the inner machine. The other thing that you mess up, is that because you make the inner machine use the same memory for code as the outer machine, you actually have limited what programs you can run, and thus you setup isn't even potentially valid for a requirement of 'all inputs' and this is a bit of a problem too. That is why H_Hat really needs to use something like exec to run the halt decider (besides the fact that currently Halts is NOT a computation based only on its formal inputs)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-06 11:00 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding principle) |
| Message-ID | <0I6dnYCGgf8EGPH9nZ2dnUU7-IfNnZ2d@giganews.com> |
| In reply to | #30670 |
On 4/6/2021 10:48 AM, Richard Damon wrote: > On 4/6/21 11:34 AM, olcott wrote: >> On 4/6/2021 10:17 AM, Kaz Kylheku wrote: >>> On 2021-04-06, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/6/2021 9:30 AM, Richard Damon wrote: >>>>> On 4/6/21 10:25 AM, olcott wrote: >>>>> >>>>>> I am going to proceed as if the prohibition of static local memory is >>>>>> incorrect. >>>>>> >>>>> >>>>> If H depends on the value it gets from another source than the formal >>>>> arguemnts, it is not a computation and can't be a Turing Machine, so >>>>> you >>>>> WHOLE proof goes down the drain, as you can't make the statement that >>>>> you function is the Turing Equivalent of some H. >>>>> >>>> >>>> I disagree a TM can have intermediate internal states based on its >>>> input. The static local data is merely the TM's global tape used for >>>> storing intermediate internal states. When Halts simulates itself to >>>> several levels of recursive depth it simply instructs these simulations >>>> to write some of their their data to its own master tape. >>> >>> That state mustbe initialized to the same state each time the TM is >>> invoked. >>> >>> A TM is *defined* by a specific string of initial content of a tape. >>> It depends only on that. >> >> A UTM can keep track of all of the details of its simulations of other >> UTMs including the details of its simulation of itself on its own master >> tape. The finite string machine description of the machine that it is >> simulating is its input. All of the details of the steps in simulating >> this machine are its own internal state and not input. >> >>> >>> A C function that retains mutable static data between invocations isn't >>> modeling a single TM. It's a different TM every time it is called. >>> >>> If the previous state of a procedure is accessible to a new invocation >>> of a procedure, that procedure isn't a function of its arguments. >>> >> >> A Master UTM can store every step of >> > > Yes, the outer machines can peek into the inner machines and GET > information, the inner machines can not get from the outer machines, or > even know they exist. > > Now, if the outer machine is ACTUALLY simulating that inner machine, > then it already HAS all the information that it needs, and doesn't need > any help from the inner machine. > > The other thing that you mess up, is that because you make the inner > machine use the same memory for code as the outer machine, you actually > have limited what programs you can run, and thus you setup isn't even > potentially valid for a requirement of 'all inputs' and this is a bit of > a problem too. That is why H_Hat really needs to use something like exec > to run the halt decider (besides the fact that currently Halts is NOT a > computation based only on its formal inputs) > Halts <is> a function of its formal inputs. Its formal inputs are the machine description of H^. Every time that Halts simulates a machine description it does this in a separate process context with its own memory, stack and registers. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 20 of 29 — ← Prev page 1 … 18 19 [20] 21 22 … 29 Next page →
Back to top | Article view | comp.theory
csiph-web