Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #29419 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-03-16 11:30 -0500 |
| Last post | 2021-03-18 12:58 -0500 |
| Articles | 20 on this page of 713 — 15 participants |
Back to article view | Back to comp.theory
A UTM halt decider <is> a pure function of its inputs olcott <NoOne@NoWhere.com> - 2021-03-16 11:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs olcott <NoOne@NoWhere.com> - 2021-03-18 07:38 -0500
Re: A UTM halt decider <is> a pure function of its inputs Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:20 -0400
Re: A UTM halt decider <is> a pure function of its inputs olcott <NoOne@NoWhere.com> - 2021-03-18 22:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs Richard Damon <Richard@Damon-Family.org> - 2021-03-19 10:52 -0400
Re: A UTM halt decider <is> a pure function of its inputs (kittens) olcott <NoOne@NoWhere.com> - 2021-03-19 09:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (kittens) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:27 -0400
Re: A UTM halt decider <is> a pure function of its inputs (kittens) olcott <NoOne@NoWhere.com> - 2021-03-19 10:42 -0500
Re: A UTM halt decider <is> a pure function of its inputs (kittens) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:50 -0400
Re: A UTM halt decider <is> a pure function of its inputs (kittens are purring) olcott <NoOne@NoWhere.com> - 2021-03-19 10:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (kittens are purring) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 12:16 -0400
Re: A UTM halt decider <is> a pure function of its inputs (kittens are purring) olcott <NoOne@NoWhere.com> - 2021-03-19 11:37 -0500
Re: A UTM halt decider <is> a pure function of its inputs (kittens are purring) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 11:32 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-19 12:50 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 12:35 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-19 13:52 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-19 14:11 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 13:51 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-19 15:14 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 14:24 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-19 15:31 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 14:43 -0600
Re: A UTM halt decider <is> a pure function of its inputs (clueless) olcott <NoOne@NoWhere.com> - 2021-03-19 15:46 -0500
Re: A UTM halt decider <is> a pure function of its inputs (clueless) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 15:29 -0600
Re: A UTM halt decider <is> a pure function of its inputs (clueless) olcott <NoOne@NoWhere.com> - 2021-03-19 16:43 -0500
Re: A UTM halt decider <is> a pure function of its inputs (clueless) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 18:02 -0600
Re: A UTM halt decider <is> a pure function of its inputs (clueless) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:28 -0400
Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) olcott <NoOne@NoWhere.com> - 2021-03-19 17:57 -0500
Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 20:49 -0400
Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) olcott <NoOne@NoWhere.com> - 2021-03-19 19:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 01:11 +0000
Re: A UTM halt decider <is> a pure function of its inputs (Kaz is not clueless) olcott <NoOne@NoWhere.com> - 2021-03-19 20:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Kaz is not clueless) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:50 -0400
Re: A UTM halt decider <is> a pure function of its inputs (Kaz is not clueless) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 01:59 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-19 21:18 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:27 +0000
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-19 21:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 23:12 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-19 22:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) Richard Damon <Richard@Damon-Family.org> - 2021-03-20 06:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 20:24 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) olcott <NoOne@NoWhere.com> - 2021-03-19 22:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 20:43 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 20:44 -0700
Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:45 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 16:16 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-21 20:45 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-21 21:06 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-22 12:50 -0700
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-22 14:59 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-22 23:03 -0400
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-22 16:40 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 23:49 +0000
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) olcott <NoOne@NoWhere.com> - 2021-03-22 19:30 -0500
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 02:41 +0000
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) olcott <NoOne@NoWhere.com> - 2021-03-22 21:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 03:30 +0000
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) olcott <NoOne@NoWhere.com> - 2021-03-23 09:33 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-23 22:36 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 22:02 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-23 23:09 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 22:15 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-23 23:26 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 08:50 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-24 08:05 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 10:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-24 10:05 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 11:08 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-24 09:48 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 12:05 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-24 10:28 -0700
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 12:34 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-24 10:52 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 12:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 17:20 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-24 17:22 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 19:08 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 19:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-24 18:39 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 19:46 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) André G. Isaak <agisaak@gm.invalid> - 2021-03-24 18:59 -0600
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) olcott <NoOne@NoWhere.com> - 2021-03-24 20:10 -0500
Re: A UTM halt decider <is> a pure function of its inputs (Turing Equivalence) olcott <NoOne@NoWhere.com> - 2021-03-24 20:18 -0500
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-26 14:01 +0100
Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-31 08:19 +0200
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-24 08:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-24 08:42 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-24 22:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-24 21:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 08:26 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 09:28 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-25 15:47 +0000
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 10:56 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 10:23 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 11:51 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 11:09 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 12:31 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 12:15 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 14:35 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 14:49 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 16:49 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 16:54 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 18:00 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 18:25 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 19:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:18 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 21:27 -0500
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
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 20:15 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) André G. Isaak <agisaak@gm.invalid> - 2021-03-25 20:33 -0600
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 21:40 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:06 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 21:17 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:04 -0400
Re: A UTM halt decider <is> a pure function of its inputs (crux basis of rebuttal) olcott <NoOne@NoWhere.com> - 2021-03-25 17:44 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 21:56 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-25 16:47 +0000
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 11:54 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-25 17:02 +0000
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 12:07 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-25 18:13 +0000
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 12:03 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 12:18 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:37 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 21:48 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:21 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 22:24 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:53 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-25 22:58 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 07:34 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) olcott <NoOne@NoWhere.com> - 2021-03-26 10:13 -0500
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 19:51 -0400
Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 21:43 -0400
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) olcott <NoOne@NoWhere.com> - 2021-03-22 18:11 -0500
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 17:48 -0600
Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) olcott <NoOne@NoWhere.com> - 2021-03-22 19:19 -0500
Re: A UTM halt decider <is> a pure function of its inputs (kittens are purring) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 13:46 -0400
Re: A UTM halt decider <is> a pure function of its inputs Richard Damon <Richard@Damon-Family.org> - 2021-03-18 07:17 -0400
Re: A UTM halt decider <is> a pure function of its inputs olcott <NoOne@NoWhere.com> - 2021-03-18 10:14 -0500
Re: A UTM halt decider <is> a pure function of its inputs Andy Walker <anw@cuboid.co.uk> - 2021-03-18 17:02 +0000
Re: A UTM halt decider <is> a pure function of its inputs olcott <NoOne@NoWhere.com> - 2021-03-18 12:58 -0500
Page 3 of 36 — ← Prev page 1 2 [3] 4 5 … 36 Next page →
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-19 20:24 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) |
| Message-ID | <s33pt0$8mj$1@gioia.aioe.org> |
| In reply to | #29755 |
On 3/19/2021 7:36 PM, olcott wrote:
> On 3/19/2021 9:27 PM, Kaz Kylheku wrote:
>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/19/2021 8:59 PM, Kaz Kylheku wrote:
>>>> The functions here compute a result depending on a historic execution
>>>> trace, which is constantly changing. That needs to be pinned down and
>>>> made explicit with an extra argument:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P, GCT()); // "get current trace"
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat, GCT());
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>> This is more accurate.
>>
>> You mean the following?
>>
>>> It is the same way that I have been describing it all along since months
>>> ago. I am not quite done writing it yet.
>>>
>>>
>>> u32 Halt_Decider(u32 P, u32 I)
>>> {
>>> u32* local_execution_trace_list;
>>> local_execution_trace_list = Allocate(0x1000);
>>> u32 Halt_Status = EXECUTING;
>>> u32 EIP = Simulate_First(P, I); // Simulate first instruction
>>> while (Halt_Status == EXECUTING)
>>> {
>>> PushBack(local_execution_trace_list, EIP);
>>> Halt_Status = Test_Halting(local_execution_trace_list);
>>> EIP = Simulate_Next(); // Simulate subsequent instruction
>>> }
>>> return Halt_Status;
>>> }
>>
>> This looks suspiciously like the "local decider" mode which you claim
>> to have abandoned.
>
> I can't show an execution trace in global decider mode because all the
> code is in the operating system. The global decider implements this same
> code.
Show the code for your system under a license?
>
>>
>> Recently you've been claiming that Halts is just an interface to the
>> global decider (which is gathering execution traces even before main()
>> is called).
>>
>
> The purpose of the above code is to get you to understand that the UTM
> really is a pure function of its inputs and the halt decider really is a
> pure function of execution traces.
>
> I am also making a version of H_Hat() with an embedded halt decider.
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-19 22:34 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) |
| Message-ID | <e8SdnTR1xuPL8Mj9nZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #29763 |
On 3/19/2021 10:24 PM, Chris M. Thomasson wrote:
> On 3/19/2021 7:36 PM, olcott wrote:
>> On 3/19/2021 9:27 PM, Kaz Kylheku wrote:
>>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/19/2021 8:59 PM, Kaz Kylheku wrote:
>>>>> The functions here compute a result depending on a historic execution
>>>>> trace, which is constantly changing. That needs to be pinned down and
>>>>> made explicit with an extra argument:
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Would_Halt = Halts(P, P, GCT()); // "get current
>>>>> trace"
>>>>> if (Input_Would_Halt)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat, GCT());
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>> This is more accurate.
>>>
>>> You mean the following?
>>>
>>>> It is the same way that I have been describing it all along since
>>>> months
>>>> ago. I am not quite done writing it yet.
>>>>
>>>>
>>>> u32 Halt_Decider(u32 P, u32 I)
>>>> {
>>>> u32* local_execution_trace_list;
>>>> local_execution_trace_list = Allocate(0x1000);
>>>> u32 Halt_Status = EXECUTING;
>>>> u32 EIP = Simulate_First(P, I); // Simulate first instruction
>>>> while (Halt_Status == EXECUTING)
>>>> {
>>>> PushBack(local_execution_trace_list, EIP);
>>>> Halt_Status = Test_Halting(local_execution_trace_list);
>>>> EIP = Simulate_Next(); // Simulate subsequent instruction
>>>> }
>>>> return Halt_Status;
>>>> }
>>>
>>> This looks suspiciously like the "local decider" mode which you claim
>>> to have abandoned.
>>
>> I can't show an execution trace in global decider mode because all the
>> code is in the operating system. The global decider implements this
>> same code.
>
> Show the code for your system under a license?
It is not ready for prime time review.
Publishing all the code may reduce the chances that an academic journal
will be interested.
The above is the essence of he current greatly simplfied halt decider.
The actual functioning code is now almost identical to the pseudo code
that I published months ago.
When I say over and over and over that the halt decider's UTM is a pure
function of its finite string machine description input and the decider
portion of this halt decider is a pure function of execution traces
derived by the halt decider's UTM there is no wiggle room of ambiguity.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-19 20:43 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) |
| Message-ID | <s33r1h$k2c$1@gioia.aioe.org> |
| In reply to | #29766 |
On 3/19/2021 8:34 PM, olcott wrote:
> On 3/19/2021 10:24 PM, Chris M. Thomasson wrote:
>> On 3/19/2021 7:36 PM, olcott wrote:
>>> On 3/19/2021 9:27 PM, Kaz Kylheku wrote:
>>>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/19/2021 8:59 PM, Kaz Kylheku wrote:
>>>>>> The functions here compute a result depending on a historic execution
>>>>>> trace, which is constantly changing. That needs to be pinned down and
>>>>>> made explicit with an extra argument:
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts(P, P, GCT()); // "get current
>>>>>> trace"
>>>>>> if (Input_Would_Halt)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat, GCT());
>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>> }
>>>>>>
>>>>> This is more accurate.
>>>>
>>>> You mean the following?
>>>>
>>>>> It is the same way that I have been describing it all along since
>>>>> months
>>>>> ago. I am not quite done writing it yet.
>>>>>
>>>>>
>>>>> u32 Halt_Decider(u32 P, u32 I)
>>>>> {
>>>>> u32* local_execution_trace_list;
>>>>> local_execution_trace_list = Allocate(0x1000);
>>>>> u32 Halt_Status = EXECUTING;
>>>>> u32 EIP = Simulate_First(P, I); // Simulate first instruction
>>>>> while (Halt_Status == EXECUTING)
>>>>> {
>>>>> PushBack(local_execution_trace_list, EIP);
>>>>> Halt_Status = Test_Halting(local_execution_trace_list);
>>>>> EIP = Simulate_Next(); // Simulate subsequent instruction
>>>>> }
>>>>> return Halt_Status;
>>>>> }
>>>>
>>>> This looks suspiciously like the "local decider" mode which you claim
>>>> to have abandoned.
>>>
>>> I can't show an execution trace in global decider mode because all
>>> the code is in the operating system. The global decider implements
>>> this same code.
>>
>> Show the code for your system under a license?
>
> It is not ready for prime time review.
> Publishing all the code may reduce the chances that an academic journal
> will be interested.
>
> The above is the essence of he current greatly simplfied halt decider.
> The actual functioning code is now almost identical to the pseudo code
> that I published months ago.
>
> When I say over and over and over that the halt decider's UTM is a pure
> function of its finite string machine description input and the decider
> portion of this halt decider is a pure function of execution traces
> derived by the halt decider's UTM there is no wiggle room of ambiguity.
>
>
>
Your code can be a proof of concept for your ideas.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-19 20:44 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt decider code) |
| Message-ID | <s33r2s$k2c$2@gioia.aioe.org> |
| In reply to | #29767 |
On 3/19/2021 8:43 PM, Chris M. Thomasson wrote:
> On 3/19/2021 8:34 PM, olcott wrote:
>> On 3/19/2021 10:24 PM, Chris M. Thomasson wrote:
>>> On 3/19/2021 7:36 PM, olcott wrote:
>>>> On 3/19/2021 9:27 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 3/19/2021 8:59 PM, Kaz Kylheku wrote:
>>>>>>> The functions here compute a result depending on a historic
>>>>>>> execution
>>>>>>> trace, which is constantly changing. That needs to be pinned down
>>>>>>> and
>>>>>>> made explicit with an extra argument:
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts(P, P, GCT()); // "get current
>>>>>>> trace"
>>>>>>> if (Input_Would_Halt)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat, GCT());
>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>> }
>>>>>>>
>>>>>> This is more accurate.
>>>>>
>>>>> You mean the following?
>>>>>
>>>>>> It is the same way that I have been describing it all along since
>>>>>> months
>>>>>> ago. I am not quite done writing it yet.
>>>>>>
>>>>>>
>>>>>> u32 Halt_Decider(u32 P, u32 I)
>>>>>> {
>>>>>> u32* local_execution_trace_list;
>>>>>> local_execution_trace_list = Allocate(0x1000);
>>>>>> u32 Halt_Status = EXECUTING;
>>>>>> u32 EIP = Simulate_First(P, I); // Simulate first instruction
>>>>>> while (Halt_Status == EXECUTING)
>>>>>> {
>>>>>> PushBack(local_execution_trace_list, EIP);
>>>>>> Halt_Status = Test_Halting(local_execution_trace_list);
>>>>>> EIP = Simulate_Next(); // Simulate subsequent instruction
>>>>>> }
>>>>>> return Halt_Status;
>>>>>> }
>>>>>
>>>>> This looks suspiciously like the "local decider" mode which you claim
>>>>> to have abandoned.
>>>>
>>>> I can't show an execution trace in global decider mode because all
>>>> the code is in the operating system. The global decider implements
>>>> this same code.
>>>
>>> Show the code for your system under a license?
>>
>> It is not ready for prime time review.
>> Publishing all the code may reduce the chances that an academic
>> journal will be interested.
>>
>> The above is the essence of he current greatly simplfied halt decider.
>> The actual functioning code is now almost identical to the pseudo code
>> that I published months ago.
>>
>> When I say over and over and over that the halt decider's UTM is a
>> pure function of its finite string machine description input and the
>> decider portion of this halt decider is a pure function of execution
>> traces derived by the halt decider's UTM there is no wiggle room of
>> ambiguity.
>>
>>
>>
>
> Your code can be a proof of concept for your ideas.
Strive to get it ready for prime time review.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-19 21:45 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (clueless is proven) |
| Message-ID | <3tc5I.16929$t66.1588@fx38.iad> |
| In reply to | #29722 |
On 3/19/21 8:58 PM, olcott wrote: > On 3/19/2021 7:49 PM, Richard Damon wrote: >> On 3/19/21 6:57 PM, olcott wrote: >>> On 3/19/2021 5:28 PM, Richard Damon wrote: >>>> On 3/19/21 4:46 PM, olcott wrote: >>>>> >>>>> There would be no extraneous details whatever if H_Hat had >>>>> thousands of >>>>> pages of x86 emulation code? >>>> >>>> You don't get it do you. ALL that code is extraneous and worthless. >>>> Your >>>> traces mean NOTHING. Everything your program has generated can be done >>>> with just a bit of mental logic and thought. >>>> >>>> What you really need to do is either show the impossible that Halts can >>>> return the right answer to H_Hat, or actually get your argument that it >>>> doesn't need to. >>>> >>> >>> That is such a stupid strategy when the goal is to show all of the >>> detailed steps required to correctly decide not halting for the >>> conventional halting problem undecidability proof counter-examples. >>> >>> You might as well have said that the best way to "win" the Super Bowl is >>> to jump up and down yelling: "We want ice cream!" >> >> In order to refute a proof, you have to actually SHOW it is wrong. > Not true. As long as it is shown that the conclusion of the proof is > false no other details are required to refute the proof. > > You do not know these things very well. > Yes, one way to SHOW a proof is wrong is show that it got to a falso conclusion. Thus to show that Linz was wrong, you could show that you can come up with a H that gives the right answer for H^. You don't need to show how H got its answer, since the proof doesn't limit it, you just need to show the answer you got and how it is correct. There are only 4 possible results that H can do, which is one reason the proof is fairly simple (and two aren't even really listed as they are ust ways that H can violate its basic requirements to be a decider). Thus you either need to show one of the answer is actually correct, or you need to show some how that there is some other possible behavior that you could do that isn't on the list of: answer halting, answer non-halting, halt with no answer, or never answer; or you need to some how show that a 'wrong' answer could actually be right, or some other such action. Since the proof you are fighting doesn't talk about many requirements on how the halt decider works (intentionally, if it did it couldn't say it applies to all halt deciders), only that they need to be a Turing Machine, and thus a computation, that takes as its inputs the representation of the program and its input, the method you use doesn't really matter unless it actually getst the right answer. Note, showing that in your logic system the question isn't a proper question does NOT make your point. The question IS valid by the logic that the theory is working in, and all that that sort of proof does is say you are working in a logic system that can't handle this problem.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-19 16:16 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <vE75I.1091$dX.334@fx36.iad> |
| In reply to | #29666 |
On 3/19/21 3:11 PM, olcott wrote: > On 3/19/2021 1:35 PM, André G. Isaak wrote: >>> >> It is *both* the embedding and the final additional state transitions >> appended to that embedded copy. >> > > > Bullshit on that on the basis that it is a known fact of software > engineering that embedded functionality is computationally equivalent to > the invocation of a function call providing this same functionality. > > So it looks like you are making the same sort of software engineering > error that others made when they insisted that a function that was > invoked in infinite recursion must return a result to its caller because > their misunderstanding of math says so. > Please note that 'Software Engineering' is a totally different discipline that 'Computational Theory' that Turing Machines are part of. You have shown ZERO understanding of the nature of Computational Theory, and only know enough buzz-words to be considered dangerous.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-21 20:45 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <X8mdnZ-1EvE8a8r9nZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #29664 |
On 3/19/2021 1:35 PM, André G. Isaak wrote:
> On 2021-03-19 11:50, olcott wrote:
>> On 3/19/2021 12:32 PM, André G. Isaak wrote:
>>> On 2021-03-19 10:37, olcott wrote:
>>>> On 3/19/2021 11:16 AM, Richard Damon wrote:
>>>>> On 3/19/21 11:54 AM, olcott wrote:
>>>>>> On 3/19/2021 10:50 AM, Richard Damon wrote:
>>>>>
>>>>>>> If you are building a Halt decider based on the design of a UTM,
>>>>>>> then
>>>>>>> you are going to MODIFY that UTM to add the halt deciding logic
>>>>>>> to it.
>>>>>>> You know only have the Turing Machine H in operation.
>>>>>>>
>>>>>>> In any given computation, when done with Turing Machines, you
>>>>>>> only have
>>>>>>> exactly ONE Turing Machine in operation, not two working together.
>>>>>>>
>>>>>>
>>>>>> Conceptually it is far easier to understand as a pair of pure
>>>>>> functions
>>>>>> hooked together. The UTM derives its execution trace as a pure
>>>>>> function
>>>>>> of its inputs. The halt decider derives a transition to one of two
>>>>>> final
>>>>>> states as a pure function of this execution trace.
>>>>>
>>>>> But that isn't Turing Theory. Note, this combination IS a Turing
>>>>> Machine
>>>>> when seen in total, and it is THAT combined machine that H^ needs
>>>>> to wrap.
>>>>>
>>>>
>>>> Linz has H embedded in H_Hat, not wrapped by H_Hat and Sipser has:
>>>> Now we construct a new Turing machine D with H as a
>>>> subroutine. This new TM calls H to determine what M
>>>> does when the input to M is its own description ⟨M⟩.
>>>>
>>>> It is not the embedding that makes halting undecidable. It is that
>>>> the input does the opposite of whatever the halt decider says that
>>>> it will do that makes halting undecidable.
>>>
>>> Both Linz and Sipser do this in the exact same way. This has been
>>> pointed out to you numerous times.
>>
>> Yes and it is pointed on entirely on the basis of a false assumption
>> that contradict what Sipser actually says.
>
> What exactly is it that Sipser says that you think I am contradicting?
> There is no false assumption here. The problem is that you know
> virtually nothing about Turing Machines, but suffer from an extremely
> bad case of Dunning-Kruger syndrome.
>
> When talking about C or Pascal, a 'subroutine' may be some external
> routine which is called by pushing arguments and a return address onto
> the stack.
>
> When talking about Turing Machines, 'subroutine' simply means some
> subset of the state transitions which define the machine. There is no
> calling mechanism where Turing Machines are concerned, nor any access to
> anything external to the machine itself. Sipser doesn't need to spell
> this out because he assumes people reading him actually know what a
> Turing Machine is. You do not.
>
>>> The problem is that you keep getting hung-up on the word
>>> 'subroutine', which in the Sipser proof means 'embedded copy' just as
>>> in the Linz proof. You cannot use C-based definitions when talking
>>> about Turing Machines. Turing Machines are self-contained
>>> computations. They don't have the ability to call on instructions
>>> contained in an operating system or another Turing Machine.
>>
>> It is not the embedding that makes halting undecidable.
>> It is defining an input that does the opposite of whatever the halt
>> decider that that is will do that is the undecidability basis.
>
> And exactly how is H_Hat supposed to 'know' what H would decide so it
> can show the opposite behaviour without actually performing the
> computation performed by H?
A return value of 0 or 1 on line 03
01 void H_Hat(u32 P)
02 {
03 u32 Input_Would_Halt = Halts(P, P);
04 if (Input_Would_Halt)
05 HERE: goto HERE;
06 }
07 int main()
08 {
09 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
10 Output("Input_Would_Halt = ", Input_Would_Halt);
11 }
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-21 21:06 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <mKadnW59WP0PZsr9nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #29664 |
On 3/19/2021 1:35 PM, André G. Isaak wrote:
> On 2021-03-19 11:50, olcott wrote:
>> On 3/19/2021 12:32 PM, André G. Isaak wrote:
>>> On 2021-03-19 10:37, olcott wrote:
>>>> On 3/19/2021 11:16 AM, Richard Damon wrote:
>>>>> On 3/19/21 11:54 AM, olcott wrote:
>>>>>> On 3/19/2021 10:50 AM, Richard Damon wrote:
>>>>>
>>>>>>> If you are building a Halt decider based on the design of a UTM,
>>>>>>> then
>>>>>>> you are going to MODIFY that UTM to add the halt deciding logic
>>>>>>> to it.
>>>>>>> You know only have the Turing Machine H in operation.
>>>>>>>
>>>>>>> In any given computation, when done with Turing Machines, you
>>>>>>> only have
>>>>>>> exactly ONE Turing Machine in operation, not two working together.
>>>>>>>
>>>>>>
>>>>>> Conceptually it is far easier to understand as a pair of pure
>>>>>> functions
>>>>>> hooked together. The UTM derives its execution trace as a pure
>>>>>> function
>>>>>> of its inputs. The halt decider derives a transition to one of two
>>>>>> final
>>>>>> states as a pure function of this execution trace.
>>>>>
>>>>> But that isn't Turing Theory. Note, this combination IS a Turing
>>>>> Machine
>>>>> when seen in total, and it is THAT combined machine that H^ needs
>>>>> to wrap.
>>>>>
>>>>
>>>> Linz has H embedded in H_Hat, not wrapped by H_Hat and Sipser has:
>>>> Now we construct a new Turing machine D with H as a
>>>> subroutine. This new TM calls H to determine what M
>>>> does when the input to M is its own description ⟨M⟩.
>>>>
>>>> It is not the embedding that makes halting undecidable. It is that
>>>> the input does the opposite of whatever the halt decider says that
>>>> it will do that makes halting undecidable.
>>>
>>> Both Linz and Sipser do this in the exact same way. This has been
>>> pointed out to you numerous times.
>>
>> Yes and it is pointed on entirely on the basis of a false assumption
>> that contradict what Sipser actually says.
>
> What exactly is it that Sipser says that you think I am contradicting?
> There is no false assumption here. The problem is that you know
> virtually nothing about Turing Machines, but suffer from an extremely
> bad case of Dunning-Kruger syndrome.
>
> When talking about C or Pascal, a 'subroutine' may be some external
> routine which is called by pushing arguments and a return address onto
> the stack.
>
> When talking about Turing Machines, 'subroutine' simply means some
> subset of the state transitions which define the machine. There is no
> calling mechanism where Turing Machines are concerned, nor any access to
> anything external to the machine itself. Sipser doesn't need to spell
> this out because he assumes people reading him actually know what a
> Turing Machine is. You do not.
>
>>> The problem is that you keep getting hung-up on the word
>>> 'subroutine', which in the Sipser proof means 'embedded copy' just as
>>> in the Linz proof. You cannot use C-based definitions when talking
>>> about Turing Machines. Turing Machines are self-contained
>>> computations. They don't have the ability to call on instructions
>>> contained in an operating system or another Turing Machine.
>>
>> It is not the embedding that makes halting undecidable.
>> It is defining an input that does the opposite of whatever the halt
>> decider that that is will do that is the undecidability basis.
>
> And exactly how is H_Hat supposed to 'know' what H would decide so it
> can show the opposite behaviour without actually performing the
> computation performed by H? The *entire* computation performed by H.
> That requires that it include a complete copy of that computation as
> part of itself since it does not have the ability to call H.
OK so your whole basis in anchored in the notion that a Turing
equivalent machine cannot possibly derive a protocol for a simulated
computation to invoke any functionality of its simulator.
Since I have accomplished this using a very simple subset of the x86
language if this simple subset is RASP equivalent then you are proven
wrong. I really only use sequence / selection / iteration / function
calls and memory access.
The UTM / x86 emulator derives a set of execution traces as a pure
function of its input finite strings.
The halt decider is a pure function of these individual finite string
execution traces.
// This is halting decidable as infinite recursion
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Here is the whole paper explaining the details:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-22 12:50 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <e0a43ade-c8db-4590-b70f-174769ebd86cn@googlegroups.com> |
| In reply to | #29840 |
On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: > > OK so your whole basis in anchored in the notion that a Turing > equivalent machine cannot possibly derive a protocol for a simulated > computation to invoke any functionality of its simulator. > Exactly. Linz's proof refers to halt deciders which are Turing machines. If you relax this requirement, there are often ways of meeting the challenge of producing an H / H_Hat pair which behave consistently. But that should have been accepted long ago. The question is whether, by relaxing the requirement that H and (by extension) H_Hat be a Turing machine, you've changed the question in any interesting way, or if you've just passed a global flag to H allowing it to flip its answer based on its call context. If fundamentally you've just passed the global flag , but disguised it cleverly, then that would also be interesting in its own right, but as a trick rather than as a contribution to computer theory.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 14:59 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <_tSdnX85z-6rasX9nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #29864 |
On 3/22/2021 2:50 PM, Malcolm McLean wrote: > On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >> >> OK so your whole basis in anchored in the notion that a Turing >> equivalent machine cannot possibly derive a protocol for a simulated >> computation to invoke any functionality of its simulator. >> > Exactly. Linz's proof refers to halt deciders which are Turing machines. > If you relax this requirement, there are often ways of meeting the challenge > of producing an H / H_Hat pair which behave consistently. So in other words you are utterly disavowing the concept of Turing equivalent computations. > But that should have been accepted long ago. The question is whether, > by relaxing the requirement that H and (by extension) H_Hat be a Turing > machine, you've changed the question in any interesting way, or As long as Halts() is a pure function of its inputs and my x86 code is Turing equivalent then this refutes the conventional HP undecidability proofs: http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > if you've just passed a global flag to H allowing it to flip its answer based > on its call context. If fundamentally you've just passed the global > flag , but disguised it cleverly, then that would also be interesting in its own > right, but as a trick rather than as a contribution to computer theory. > -- 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-03-22 23:03 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (undecidability basis) |
| Message-ID | <1Uc6I.24085$RP6.19341@fx40.iad> |
| In reply to | #29867 |
On 3/22/21 3:59 PM, olcott wrote: > > So in other words you are utterly disavowing the concept of Turing > equivalent computations. Maybe you don't understand that Turing Equivalent means perform the same EXACT computation. Given the same input, you get the same output. Note, that In Linz, H IS a Turing Machine, as is H^ which is built by modifying it. This means that H is a complete independent computation, not using anything outside of it. It isn't some program using special features of some advance simulator. If you want to build you code based on this, thats ok, but now, all the code for that simulator is part of the commutation of H (and thus part of that Turing Machine). This means that H^ is OUTSIDE that simulator, and that simulator has no control over H^. (Yes, these is a representation of H^ that H is given, that it can do what ever it wants with, but that is totally independent of the actual Turing Machine H^)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 16:40 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) |
| Message-ID | <bI-dnfNG6-VCk8T9nZ2dnUU7-X3NnZ2d@giganews.com> |
| In reply to | #29864 |
On 3/22/2021 2:50 PM, Malcolm McLean wrote: > On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >> >> OK so your whole basis in anchored in the notion that a Turing >> equivalent machine cannot possibly derive a protocol for a simulated >> computation to invoke any functionality of its simulator. >> > Exactly. Linz's proof refers to halt deciders which are Turing machines. > If you relax this requirement, there are often ways of meeting the challenge > of producing an H / H_Hat pair which behave consistently. > > But that should have been accepted long ago. The question is whether, > by relaxing the requirement that H and (by extension) H_Hat be a Turing > machine, you've changed the question in any interesting way, or > if you've just passed a global flag to H allowing it to flip its answer based > on its call context. If fundamentally you've just passed the global > flag , but disguised it cleverly, then that would also be interesting in its own > right, but as a trick rather than as a contribution to computer theory. > A global UTM / x86 emulator derives an execution trace incrementally one simulated instruction at a time that is a pure function of its inputs. No machine descriptions are simulated outside of the scope of this global UTM / x86 emulator. After the simulation of each instruction UTM / x86 emulator invokes a halt decider that derives a return value to the simulator EXECUTING / HALTED / WILL_NOT_HALT as a pure function of its input execution trace. The global UTM / x86 emulator continues simulating its input while this return value from the halt decider is EXECUTING. http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-22 23:49 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) |
| Message-ID | <20210322164547.803@kylheku.com> |
| In reply to | #29870 |
On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: > On 3/22/2021 2:50 PM, Malcolm McLean wrote: >> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >>> >>> OK so your whole basis in anchored in the notion that a Turing >>> equivalent machine cannot possibly derive a protocol for a simulated >>> computation to invoke any functionality of its simulator. >>> >> Exactly. Linz's proof refers to halt deciders which are Turing machines. >> If you relax this requirement, there are often ways of meeting the challenge >> of producing an H / H_Hat pair which behave consistently. >> >> But that should have been accepted long ago. The question is whether, >> by relaxing the requirement that H and (by extension) H_Hat be a Turing >> machine, you've changed the question in any interesting way, or >> if you've just passed a global flag to H allowing it to flip its answer based >> on its call context. If fundamentally you've just passed the global >> flag , but disguised it cleverly, then that would also be interesting in its own >> right, but as a trick rather than as a contribution to computer theory. >> > > A global UTM / x86 emulator derives an execution trace incrementally one > simulated instruction at a time that is a pure function of its inputs. Sure; unfortunately, your program depends on an API into that simulator whose behavior depends on different snapshots of that instruction trace as it evolves over time. That API isn't a pure function of its inputs. In the proof, the entity which corresponds to your API call *is* a pure function, and that is critical. Without that, the conditions of the proof are not met. -- 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-03-22 19:30 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) |
| Message-ID | <n_ydncp6_qxfq8T9nZ2dnUU7-XvNnZ2d@giganews.com> |
| In reply to | #29877 |
On 3/22/2021 6:49 PM, Kaz Kylheku wrote: > On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >> On 3/22/2021 2:50 PM, Malcolm McLean wrote: >>> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >>>> >>>> OK so your whole basis in anchored in the notion that a Turing >>>> equivalent machine cannot possibly derive a protocol for a simulated >>>> computation to invoke any functionality of its simulator. >>>> >>> Exactly. Linz's proof refers to halt deciders which are Turing machines. >>> If you relax this requirement, there are often ways of meeting the challenge >>> of producing an H / H_Hat pair which behave consistently. >>> >>> But that should have been accepted long ago. The question is whether, >>> by relaxing the requirement that H and (by extension) H_Hat be a Turing >>> machine, you've changed the question in any interesting way, or >>> if you've just passed a global flag to H allowing it to flip its answer based >>> on its call context. If fundamentally you've just passed the global >>> flag , but disguised it cleverly, then that would also be interesting in its own >>> right, but as a trick rather than as a contribution to computer theory. >>> >> >> A global UTM / x86 emulator derives an execution trace incrementally one >> simulated instruction at a time that is a pure function of its inputs. > > Sure; unfortunately, your program depends on an API into that simulator > whose behavior depends on different snapshots of that instruction trace > as it evolves over time. That API isn't a pure function of its inputs. > The UTM / x86 simulator derives snapshot execution traces that are a pure function of its inputs finite strings. The halt decider is a pure function of each snap shot. That a simulated machine description can invoke the functionality of its simulator as a Turing equivalent computation can be known on the basis that this is implemented using a tiny subset of the x86 language that is equivalent to a RASP machine for every computation not requiring more memory that is available. > In the proof, the entity which corresponds to your API call *is* a pure > function, and that is critical. > > Without that, the conditions of the proof are not met. > The simulated machine description merely provides the UTM / x86 emulator with a pair of machine addresses corresponding to finite string machine descriptions. -- 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-03-23 02:41 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) |
| Message-ID | <20210322192748.339@kylheku.com> |
| In reply to | #29880 |
On 2021-03-23, olcott <NoOne@NoWhere.com> wrote: > On 3/22/2021 6:49 PM, Kaz Kylheku wrote: >> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>> On 3/22/2021 2:50 PM, Malcolm McLean wrote: >>>> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >>>>> >>>>> OK so your whole basis in anchored in the notion that a Turing >>>>> equivalent machine cannot possibly derive a protocol for a simulated >>>>> computation to invoke any functionality of its simulator. >>>>> >>>> Exactly. Linz's proof refers to halt deciders which are Turing machines. >>>> If you relax this requirement, there are often ways of meeting the challenge >>>> of producing an H / H_Hat pair which behave consistently. >>>> >>>> But that should have been accepted long ago. The question is whether, >>>> by relaxing the requirement that H and (by extension) H_Hat be a Turing >>>> machine, you've changed the question in any interesting way, or >>>> if you've just passed a global flag to H allowing it to flip its answer based >>>> on its call context. If fundamentally you've just passed the global >>>> flag , but disguised it cleverly, then that would also be interesting in its own >>>> right, but as a trick rather than as a contribution to computer theory. >>>> >>> >>> A global UTM / x86 emulator derives an execution trace incrementally one >>> simulated instruction at a time that is a pure function of its inputs. >> >> Sure; unfortunately, your program depends on an API into that simulator >> whose behavior depends on different snapshots of that instruction trace >> as it evolves over time. That API isn't a pure function of its inputs. >> > > The UTM / x86 simulator derives snapshot execution traces that are a > pure function of its inputs finite strings. I already agreed with this; why repeat yourself. > The halt decider is a pure function of each snap shot. Unfortunately, that snapshot doesn't appear in is argument list. In the "conventional proofs", halts is a two-argument function which takes another function and an input. Your halts looks the same way. But the execution trace is accessed as a piece of global, mutating state. A function accessing global mutating state is the "poster child" of impurity; the antithesis of a pure function. The snapshot could be turned into an argument of the halting decider, so that the function /per se/ is pure. But then (1) it doesn't conform to the two argument template and (2) it becomes obvious that it's being given a different value for the third argument all the time. Every time the global state changes, which happens each time a new instruction is traced, Halts morphs into a different two-argument function. Therefore, your program is able to do things which are impossible in the proof, like that calls to Halts(H_Hat, H_Hat) in different situations behave differently. The pure, two-argument Halts function in the proof may not do that, which shows that your Halts function isn't implementing a pure function of its two 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-03-22 21:54 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) |
| Message-ID | <GIudnWuFYs8ZxcT9nZ2dnUU78Y3NnZ2d@giganews.com> |
| In reply to | #29887 |
On 3/22/2021 9:41 PM, Kaz Kylheku wrote: > On 2021-03-23, olcott <NoOne@NoWhere.com> wrote: >> On 3/22/2021 6:49 PM, Kaz Kylheku wrote: >>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>> On 3/22/2021 2:50 PM, Malcolm McLean wrote: >>>>> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote: >>>>>> >>>>>> OK so your whole basis in anchored in the notion that a Turing >>>>>> equivalent machine cannot possibly derive a protocol for a simulated >>>>>> computation to invoke any functionality of its simulator. >>>>>> >>>>> Exactly. Linz's proof refers to halt deciders which are Turing machines. >>>>> If you relax this requirement, there are often ways of meeting the challenge >>>>> of producing an H / H_Hat pair which behave consistently. >>>>> >>>>> But that should have been accepted long ago. The question is whether, >>>>> by relaxing the requirement that H and (by extension) H_Hat be a Turing >>>>> machine, you've changed the question in any interesting way, or >>>>> if you've just passed a global flag to H allowing it to flip its answer based >>>>> on its call context. If fundamentally you've just passed the global >>>>> flag , but disguised it cleverly, then that would also be interesting in its own >>>>> right, but as a trick rather than as a contribution to computer theory. >>>>> >>>> >>>> A global UTM / x86 emulator derives an execution trace incrementally one >>>> simulated instruction at a time that is a pure function of its inputs. >>> >>> Sure; unfortunately, your program depends on an API into that simulator >>> whose behavior depends on different snapshots of that instruction trace >>> as it evolves over time. That API isn't a pure function of its inputs. >>> >> >> The UTM / x86 simulator derives snapshot execution traces that are a >> pure function of its inputs finite strings. > > I already agreed with this; why repeat yourself. > >> The halt decider is a pure function of each snap shot. > > Unfortunately, that snapshot doesn't appear in is argument list. > > In the "conventional proofs", halts is a two-argument function > which takes another function and an input. > > Your halts looks the same way. But the execution trace is accessed > as a piece of global, mutating state. A function accessing global > mutating state is the "poster child" of impurity; the antithesis of a > pure function. > > The snapshot could be turned into an argument of the halting decider, > so that the function /per se/ is pure. > > But then (1) it doesn't conform to the two argument template and (2) > it becomes obvious that it's being given a different value for > the third argument all the time. > > Every time the global state changes, which happens each time a new > instruction is traced, Halts morphs into a different two-argument > function. I have correctly explained exactly how the UTM/halt decider is a pure function of its inputs too many times. The fact that the halt decider component can be called many times with a differing internal state of the UTM component seems to be too difficult for you to comprehend. > Therefore, your program is able to do things which are impossible > in the proof, like that calls to Halts(H_Hat, H_Hat) in different > situations behave differently. Halts() is called once with a pair of finite strings only its own internal state changes. It is really not that hard. -- 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-03-23 03:30 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) |
| Message-ID | <20210322201751.988@kylheku.com> |
| In reply to | #29888 |
On 2021-03-23, olcott <NoOne@NoWhere.com> wrote:
> On 3/22/2021 9:41 PM, Kaz Kylheku wrote:
>> Every time the global state changes, which happens each time a new
>> instruction is traced, Halts morphs into a different two-argument
>> function.
>
> I have correctly explained exactly how the UTM/halt decider is a pure
> function of its inputs too many times.
>
> The fact that the halt decider component can be called many times with a
> differing internal state of the UTM component seems to be too difficult
> for you to comprehend.
Rather, the fact that this makes in an impure function, since
that internal state isn't passed in as an argument, seems too difficult
for you to understand.
>> Therefore, your program is able to do things which are impossible
>> in the proof, like that calls to Halts(H_Hat, H_Hat) in different
>> situations behave differently.
>
> Halts() is called once with a pair of finite strings only its own
But it's only true that Halts is called once in one execution of
any one of your test programs.
You have demonstrated yourself that Halts has different behaviors for
ostensibly the same arguments when it is called in two different
situations in two different test programs (those programs using the same
definition of H_Hat an Halts).
You cannot restrict Halts to being called once. Anyone examining your
work can try this legitimate test case:
int main()
{
u32 Input_Halts = Halts((u32) H_Hat, (u32) H_Hat);
Output("Input_Halts = ", Input_Halts);
H_Hat((u32) H_Hat);
return 0;
}
If Input_Halts = 0 is displayed, then H_Hat must terminate,
since it also calls Halts((u32) H_Hat, (u32) H_Hat), and
so also must get a 0.
That's what it means for Halts to be a pure function,
which is required by the proof.
You and I know that it isn't; the two calls to Halts will access a
differently version of global state stored in the host VM,
so that the Halts called from H_Hat will recurse indefinitely,
and trigger the abort.
That confirms Halts not to be a pure function.
--
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-03-23 09:33 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (last objection addressed) |
| Message-ID | <W8adnenu6MelYcT9nZ2dnUU7-KfNnZ2d@giganews.com> |
| In reply to | #29890 |
On 3/22/2021 10:30 PM, Kaz Kylheku wrote:
> On 2021-03-23, olcott <NoOne@NoWhere.com> wrote:
>> On 3/22/2021 9:41 PM, Kaz Kylheku wrote:
>>> Every time the global state changes, which happens each time a new
>>> instruction is traced, Halts morphs into a different two-argument
>>> function.
>>
>> I have correctly explained exactly how the UTM/halt decider is a pure
>> function of its inputs too many times.
>>
>> The fact that the halt decider component can be called many times with a
>> differing internal state of the UTM component seems to be too difficult
>> for you to comprehend.
>
> Rather, the fact that this makes in an impure function, since
> that internal state isn't passed in as an argument, seems too difficult
> for you to understand.
>
Every time that Halts() is called this invocation of Halts is a pure
function of its inputs. Every time that Halts() is called it derives an
execution trace of these inputs one instruction at a time. This
execution trace is a part of its own internal state.
After it derives the execution trace of each instruction its halt
decider examines this execution trace and decides HALTED / EXECUTING /
WILL_NOT_HALT. This is all part of its own internal state thus
consistent with the notion of a pure function of its inputs.
>>> Therefore, your program is able to do things which are impossible
>>> in the proof, like that calls to Halts(H_Hat, H_Hat) in different
>>> situations behave differently.
>>
>> Halts() is called once with a pair of finite strings only its own
>
> But it's only true that Halts is called once in one execution of
> any one of your test programs.
>
> You have demonstrated yourself that Halts has different behaviors for
> ostensibly the same arguments when it is called in two different
> situations in two different test programs (those programs using the same
> definition of H_Hat an Halts).
>
> You cannot restrict Halts to being called once. Anyone examining your
> work can try this legitimate test case:
>
> int main()
> {
> u32 Input_Halts = Halts((u32) H_Hat, (u32) H_Hat);
> Output("Input_Halts = ", Input_Halts);
> H_Hat((u32) H_Hat);
> return 0;
> }
>
Let's look at this simpler example first.
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
Why does Halts() called by main() have different behavior than Halts()
call by H_Hat() even though they have the same inputs?
Although it is true that two computations that are a pure function of
their inputs will derive the same results, they will not have the same
internal state at different points in their execution.
Because Halts() called by main() was executed before Halts() called by
H_Hat() Halts() called by main() reaches its halting decision point
sooner than Halts() called by H_Hat().
Because Halts() called by main() decided that its H_Hat() input would
not halt Halts() called by main() terminates the execution of H_Hat()
thus terminating Halts() called by H_Hat().
Halts() called by main() and Halts() call by H_Hat() would have to have
the same behavior on the same input unless H_Hat has been aborted by
Halts() called by main().
Because the subset of the x86 language that I use is RASP equivalent and
RASP is Turing equivalent the above is Turing computable.
> If Input_Halts = 0 is displayed, then H_Hat must terminate,
> since it also calls Halts((u32) H_Hat, (u32) H_Hat), and
> so also must get a 0.
>
> That's what it means for Halts to be a pure function,
> which is required by the proof.
>
> You and I know that it isn't; the two calls to Halts will access a
> differently version of global state stored in the host VM,
> so that the Halts called from H_Hat will recurse indefinitely,
> and trigger the abort.
>
> That confirms Halts not to be a pure function.
The global UTM / halt decider has the global state as its own internal
state that is a pure function of its input finite string machine
descriptions.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-23 22:36 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) |
| Message-ID | <JJmdndKJGbxJLsf9nZ2dnUU7-SnNnZ2d@giganews.com> |
| In reply to | #29877 |
On 3/22/2021 6:49 PM, Kaz Kylheku wrote:
> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote:
>> On 3/22/2021 2:50 PM, Malcolm McLean wrote:
>>> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote:
>>>>
>>>> OK so your whole basis in anchored in the notion that a Turing
>>>> equivalent machine cannot possibly derive a protocol for a simulated
>>>> computation to invoke any functionality of its simulator.
>>>>
>>> Exactly. Linz's proof refers to halt deciders which are Turing machines.
>>> If you relax this requirement, there are often ways of meeting the challenge
>>> of producing an H / H_Hat pair which behave consistently.
>>>
>>> But that should have been accepted long ago. The question is whether,
>>> by relaxing the requirement that H and (by extension) H_Hat be a Turing
>>> machine, you've changed the question in any interesting way, or
>>> if you've just passed a global flag to H allowing it to flip its answer based
>>> on its call context. If fundamentally you've just passed the global
>>> flag , but disguised it cleverly, then that would also be interesting in its own
>>> right, but as a trick rather than as a contribution to computer theory.
>>>
>>
>> A global UTM / x86 emulator derives an execution trace incrementally one
>> simulated instruction at a time that is a pure function of its inputs.
>
> Sure; unfortunately, your program depends on an API into that simulator
> whose behavior depends on different snapshots of that instruction trace
> as it evolves over time. That API isn't a pure function of its inputs.
>
> In the proof, the entity which corresponds to your API call *is* a pure
> function, and that is critical.
>
> Without that, the conditions of the proof are not met.
>
Since the (global UTM / x86 emulator) / global halt decider is a pure
function of its inputs then the inability to derive an undecidable input
within this infrastructure is by itself a refutation of the conventional
halting problem undecidability proofs.
01 void H_Hat(u32 P)
02 {
03 u32 Input_Would_Halt = Halts(P, P);
04 if (Input_Would_Halt)
05 HERE: goto HERE;
06 }
07 int main()
08 {
09 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
10 Output("Input_Would_Halt = ", Input_Would_Halt);
11 }
If you find some reason to say that the above does not count, then even
if it does not count, then the conventional halting problem
counter-example cannot even be expressed which still prevents it from
showing undecidability in this system.
--
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-03-23 22:02 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (halt deciding) |
| Message-ID | <s3edki$hcj$1@dont-email.me> |
| In reply to | #29925 |
On 2021-03-23 21:36, olcott wrote:
> On 3/22/2021 6:49 PM, Kaz Kylheku wrote:
>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/22/2021 2:50 PM, Malcolm McLean wrote:
>>>> On Monday, 22 March 2021 at 02:06:18 UTC, olcott wrote:
>>>>>
>>>>> OK so your whole basis in anchored in the notion that a Turing
>>>>> equivalent machine cannot possibly derive a protocol for a simulated
>>>>> computation to invoke any functionality of its simulator.
>>>>>
>>>> Exactly. Linz's proof refers to halt deciders which are Turing
>>>> machines.
>>>> If you relax this requirement, there are often ways of meeting the
>>>> challenge
>>>> of producing an H / H_Hat pair which behave consistently.
>>>>
>>>> But that should have been accepted long ago. The question is whether,
>>>> by relaxing the requirement that H and (by extension) H_Hat be a Turing
>>>> machine, you've changed the question in any interesting way, or
>>>> if you've just passed a global flag to H allowing it to flip its
>>>> answer based
>>>> on its call context. If fundamentally you've just passed the global
>>>> flag , but disguised it cleverly, then that would also be
>>>> interesting in its own
>>>> right, but as a trick rather than as a contribution to computer theory.
>>>>
>>>
>>> A global UTM / x86 emulator derives an execution trace incrementally one
>>> simulated instruction at a time that is a pure function of its inputs.
>>
>> Sure; unfortunately, your program depends on an API into that simulator
>> whose behavior depends on different snapshots of that instruction trace
>> as it evolves over time. That API isn't a pure function of its inputs.
>>
>> In the proof, the entity which corresponds to your API call *is* a pure
>> function, and that is critical.
>>
>> Without that, the conditions of the proof are not met.
>>
>
> Since the (global UTM / x86 emulator) / global halt decider is a pure
> function of its inputs then the inability to derive an undecidable input
You keep asserting that it is a pure function, but since you have never
provided the complete function, why should we take your word for this
(especially given that all evidence points to the contrary).
But, just to make sure you really understand what a pure function is,
here are a few things which your function *cannot* do if it is a pure
function.
- It cannot have any side effects.
- It cannot access *any* global or persistent (static) variables.
(n.b. this would include accessing variables which are outside of its
scope by crawling down the stack. The only data on the stack which
it can access are the parameters which were passed to it. It would
also include the contents of any registers which might vary between
calls).
- It cannot call any functions which don't meet the above two criteria.
That includes any functions which you claim are part of your
"operating system".
André
> within this infrastructure is by itself a refutation of the conventional
> halting problem undecidability proofs.
>
> 01 void H_Hat(u32 P)
> 02 {
> 03 u32 Input_Would_Halt = Halts(P, P);
> 04 if (Input_Would_Halt)
> 05 HERE: goto HERE;
> 06 }
>
> 07 int main()
> 08 {
> 09 u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> 10 Output("Input_Would_Halt = ", Input_Would_Halt);
> 11 }
>
> If you find some reason to say that the above does not count, then even
> if it does not count, then the conventional halting problem
> counter-example cannot even be expressed which still prevents it from
> showing undecidability in this system.
>
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
Page 3 of 36 — ← Prev page 1 2 [3] 4 5 … 36 Next page →
Back to top | Article view | comp.theory
csiph-web