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 12 of 36 — ← Prev page 1 … 10 11 [12] 13 14 … 36 Next page →
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-27 14:09 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <56abb78f-a3da-4dd1-ab18-f90c5235917fn@googlegroups.com> |
| In reply to | #30129 |
On Saturday, 27 March 2021 at 21:04:00 UTC, André G. Isaak wrote: > On 2021-03-27 14:54, olcott wrote: > > On 3/27/2021 3:51 PM, André G. Isaak wrote: > >> On 2021-03-27 14:44, olcott wrote: > >>> On 3/27/2021 3:25 PM, André G. Isaak wrote: > >>>> On 2021-03-27 13:33, olcott wrote: > >>>> > >>>>> Halts can detect its own infinite recursion thus it can detect > >>>>> another UTM/Halt decider calling itself in the same way that it can > >>>>> detect itself calling itself. > >>>> > >>>> What does 'its own infinite recursion' refer to here? > >>> > >>> A master UTM simulates a UTM / halt decider named Halts. > >> > >> The description of the TM on the tape doesn't include a name. Even if > >> it did, being named 'halts' doesn't magically entail that it performs > >> the same computation as your 'master UTM' - just that it shares a name. > >> > >>> When the master UTM simulates Halts(Halts, Halts) Halts decides that > >>> Halts would be infinitely recursive unless Halts stopped simulating > >>> Halts. > >> > >> > >> The TM on the tape has its own state transition tables which are > >> distinct from those in Halts. > >> > >> So where is the recursion that it detects? > >> > >> André > >> > > > > When Halts simulates itself it can see what it is doing and stop it. > How? It sees the description of a TM. That TM might be a description of > itself. It might be a description of a separate TM such as H_Hat which > was based on its own state-transition tables but modified. It might be > something else entirely. How does it decide whether this TM needs to be > stopped? How does it determine whether that input is 'itself'? > This can actually be done within the rules. H and H_Hat take descriptions of H_Hat. The obvious way to describe H_Hat is to write out its state transition table using one of the conventional notations.But you could say "the symbol "H" means include the equivalent of H here", H can then look for the symbol "H" and determine that the input machine contains a copy of itself. That's allowed.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 16:19 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <XoSdnV9NMIXRPML9nZ2dnUU7-f2dnZ2d@giganews.com> |
| In reply to | #30130 |
On 3/27/2021 4:09 PM, Malcolm McLean wrote: > On Saturday, 27 March 2021 at 21:04:00 UTC, André G. Isaak wrote: >> On 2021-03-27 14:54, olcott wrote: >>> On 3/27/2021 3:51 PM, André G. Isaak wrote: >>>> On 2021-03-27 14:44, olcott wrote: >>>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>>> On 2021-03-27 13:33, olcott wrote: >>>>>> >>>>>>> Halts can detect its own infinite recursion thus it can detect >>>>>>> another UTM/Halt decider calling itself in the same way that it can >>>>>>> detect itself calling itself. >>>>>> >>>>>> What does 'its own infinite recursion' refer to here? >>>>> >>>>> A master UTM simulates a UTM / halt decider named Halts. >>>> >>>> The description of the TM on the tape doesn't include a name. Even if >>>> it did, being named 'halts' doesn't magically entail that it performs >>>> the same computation as your 'master UTM' - just that it shares a name. >>>> >>>>> When the master UTM simulates Halts(Halts, Halts) Halts decides that >>>>> Halts would be infinitely recursive unless Halts stopped simulating >>>>> Halts. >>>> >>>> >>>> The TM on the tape has its own state transition tables which are >>>> distinct from those in Halts. >>>> >>>> So where is the recursion that it detects? >>>> >>>> André >>>> >>> >>> When Halts simulates itself it can see what it is doing and stop it. >> How? It sees the description of a TM. That TM might be a description of >> itself. It might be a description of a separate TM such as H_Hat which >> was based on its own state-transition tables but modified. It might be >> something else entirely. How does it decide whether this TM needs to be >> stopped? How does it determine whether that input is 'itself'? >> > This can actually be done within the rules. H and H_Hat take descriptions of > H_Hat. The obvious way to describe H_Hat is to write out its state transition > table using one of the conventional notations.But you could say "the symbol "H" > means include the equivalent of H here", H can then look for the symbol "H" > and determine that the input machine contains a copy of itself. That's allowed. > It simply knows its own machine address. Some versions of the halt decider use this information and other versions don't need it. -- 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-27 15:34 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <s3o8co$frh$2@dont-email.me> |
| In reply to | #30132 |
On 2021-03-27 15:19, olcott wrote: > On 3/27/2021 4:09 PM, Malcolm McLean wrote: >> On Saturday, 27 March 2021 at 21:04:00 UTC, André G. Isaak wrote: >>> On 2021-03-27 14:54, olcott wrote: >>>> On 3/27/2021 3:51 PM, André G. Isaak wrote: >>>>> On 2021-03-27 14:44, olcott wrote: >>>>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>>>> On 2021-03-27 13:33, olcott wrote: >>>>>>> >>>>>>>> Halts can detect its own infinite recursion thus it can detect >>>>>>>> another UTM/Halt decider calling itself in the same way that it can >>>>>>>> detect itself calling itself. >>>>>>> >>>>>>> What does 'its own infinite recursion' refer to here? >>>>>> >>>>>> A master UTM simulates a UTM / halt decider named Halts. >>>>> >>>>> The description of the TM on the tape doesn't include a name. Even if >>>>> it did, being named 'halts' doesn't magically entail that it performs >>>>> the same computation as your 'master UTM' - just that it shares a >>>>> name. >>>>> >>>>>> When the master UTM simulates Halts(Halts, Halts) Halts decides that >>>>>> Halts would be infinitely recursive unless Halts stopped simulating >>>>>> Halts. >>>>> >>>>> >>>>> The TM on the tape has its own state transition tables which are >>>>> distinct from those in Halts. >>>>> >>>>> So where is the recursion that it detects? >>>>> >>>>> André >>>>> >>>> >>>> When Halts simulates itself it can see what it is doing and stop it. >>> How? It sees the description of a TM. That TM might be a description of >>> itself. It might be a description of a separate TM such as H_Hat which >>> was based on its own state-transition tables but modified. It might be >>> something else entirely. How does it decide whether this TM needs to be >>> stopped? How does it determine whether that input is 'itself'? >>> >> This can actually be done within the rules. H and H_Hat take >> descriptions of >> H_Hat. The obvious way to describe H_Hat is to write out its state >> transition >> table using one of the conventional notations.But you could say "the >> symbol "H" >> means include the equivalent of H here", H can then look for the >> symbol "H" >> and determine that the input machine contains a copy of itself. >> That's allowed. >> > > It simply knows its own machine address. Some versions of the halt > decider use this information and other versions don't need it. There *are* no machine addresses when talking about Turing Machines. When talking about x86 programs, If H_Hat contains an inlined copy of the halt decider (as is done in the actual proof), this won't have the same machine address. If you claim to have somehow created a 'counterexample' to the Linz proof, it needs to be able to deal with an H_Hat created in the manner done in the Linz proof. That means H_Hat does not call any routine which is at the same machine address as Halts(). André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-27 18:22 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <beO7I.14893$Ho7.13444@fx11.iad> |
| In reply to | #30132 |
On 3/27/21 5:19 PM, olcott wrote: > It simply knows its own machine address. Some versions of the halt > decider use this information and other versions don't need it. > Turing Machines don't have 'address' in the sense of machines like you are used to. States may have a 'name' in the description, but the Turing Machine won't have access to that, and when we copy the description of H for its own machine into the H^ machine, we may relabel them, and in fact, if we include a machine multiple times because it is called multiple times, we must. For example, if we simply number the base states in H to be s0 ... sn + sHalt, snoHalt Then we might build H^ to begin in its own s0, that eventually gets to a state H.s0 (which represents s0 in H) and eventually that will end up in the states H.sHalt or H.snoHalt, and we add the loop to the state H.sHalt H^ has NO requirement to use this exact labeling (since the labeling doesn't actually mean anything), as long as every state has some unique lable. Thus there is NO way for Halts to easily identify itself.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 16:26 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <L4CdnbOsxp1jP8L9nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #30129 |
On 3/27/2021 4:03 PM, André G. Isaak wrote: > On 2021-03-27 14:54, olcott wrote: >> On 3/27/2021 3:51 PM, André G. Isaak wrote: >>> On 2021-03-27 14:44, olcott wrote: >>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>> On 2021-03-27 13:33, olcott wrote: >>>>> >>>>>> Halts can detect its own infinite recursion thus it can detect >>>>>> another UTM/Halt decider calling itself in the same way that it >>>>>> can detect itself calling itself. >>>>> >>>>> What does 'its own infinite recursion' refer to here? >>>> >>>> A master UTM simulates a UTM / halt decider named Halts. >>> >>> The description of the TM on the tape doesn't include a name. Even if >>> it did, being named 'halts' doesn't magically entail that it performs >>> the same computation as your 'master UTM' - just that it shares a name. >>> >>>> When the master UTM simulates Halts(Halts, Halts) Halts decides that >>>> Halts would be infinitely recursive unless Halts stopped simulating >>>> Halts. >>> >>> >>> The TM on the tape has its own state transition tables which are >>> distinct from those in Halts. >>> >>> So where is the recursion that it detects? >>> >>> André >>> >> >> When Halts simulates itself it can see what it is doing and stop it. > > How? It sees the description of a TM. That TM might be a description of > itself. It might be a description of a separate TM such as H_Hat which > was based on its own state-transition tables but modified. It might be > something else entirely. How does it decide whether this TM needs to be > stopped? How does it determine whether that input is 'itself'? > > In your C program, you use address of the routine being called, but > there is no equivalent of an address in Turing Machines. Sure there is. Let's see if you can figure out what it is. > And even in C, > that solution depends on the fact that H_Hat is calling Halts rather > than using its own inlined copy of Halts, a solution not available when > dealing with actual TMs. > > André > When the halt deciding code is inlined this does not change the result because of the software engineering principle that a function call to code is functionally equivalent to the same code inlined. 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 | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-27 16:15 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <s3oaqh$32a$1@dont-email.me> |
| In reply to | #30133 |
On 2021-03-27 15:26, olcott wrote: > On 3/27/2021 4:03 PM, André G. Isaak wrote: >> On 2021-03-27 14:54, olcott wrote: >>> On 3/27/2021 3:51 PM, André G. Isaak wrote: >>>> On 2021-03-27 14:44, olcott wrote: >>>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>>> On 2021-03-27 13:33, olcott wrote: >>>>>> >>>>>>> Halts can detect its own infinite recursion thus it can detect >>>>>>> another UTM/Halt decider calling itself in the same way that it >>>>>>> can detect itself calling itself. >>>>>> >>>>>> What does 'its own infinite recursion' refer to here? >>>>> >>>>> A master UTM simulates a UTM / halt decider named Halts. >>>> >>>> The description of the TM on the tape doesn't include a name. Even >>>> if it did, being named 'halts' doesn't magically entail that it >>>> performs the same computation as your 'master UTM' - just that it >>>> shares a name. >>>> >>>>> When the master UTM simulates Halts(Halts, Halts) Halts decides >>>>> that Halts would be infinitely recursive unless Halts stopped >>>>> simulating Halts. >>>> >>>> >>>> The TM on the tape has its own state transition tables which are >>>> distinct from those in Halts. >>>> >>>> So where is the recursion that it detects? >>>> >>>> André >>>> >>> >>> When Halts simulates itself it can see what it is doing and stop it. >> >> How? It sees the description of a TM. That TM might be a description >> of itself. It might be a description of a separate TM such as H_Hat >> which was based on its own state-transition tables but modified. It >> might be something else entirely. How does it decide whether this TM >> needs to be stopped? How does it determine whether that input is >> 'itself'? >> >> In your C program, you use address of the routine being called, but >> there is no equivalent of an address in Turing Machines. > > Sure there is. Let's see if you can figure out what it is. Why don't you enlighten us? >> And even in C, that solution depends on the fact that H_Hat is calling >> Halts rather than using its own inlined copy of Halts, a solution not >> available when dealing with actual TMs. >> >> André >> > > When the halt deciding code is inlined this does not change the result > because of the software engineering principle that a function call to > code is functionally equivalent to the same code inlined. A call to a pure function will return the same result given the same input whether inlined or not. But Halts() takes a function *pointer* as its input. It is *not* being given the same input when it is called with itself as input versus an inlined copy of itself. Different machine addresses, therefore different function pointers, therefore different results are possible. And since your Halts relies on comparing the address of this function to its own address, you will get different results. There is no recursion when calling a copy, so your recursion detection will fail. André > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-27 18:40 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <5vO7I.61605$bR1.34518@fx26.iad> |
| In reply to | #30123 |
On 3/27/21 4:54 PM, olcott wrote: >> > > When Halts simulates itself it can see what it is doing and stop it. > > - I will challenge you to try and write a real Turing Machine that can detect when the input represents itself suitable for some define UTM. Bet you can't do it. Note, This Machine only input it the program to check, it doesn't get a encoder version as an input, it would need to figure that out itself. Remember that nodes can have arbitrary 'names'.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 19:06 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <x5WdnTNyQswTVcL9nZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #30147 |
On 3/27/2021 5:40 PM, Richard Damon wrote: > On 3/27/21 4:54 PM, olcott wrote: >>> >> >> When Halts simulates itself it can see what it is doing and stop it. >> >> - > > I will challenge you to try and write a real Turing Machine that can > detect when the input represents itself suitable for some define UTM. > > Bet you can't do it. This is too tedious without relative memory addressing. A TM with direct memory addressing only need implement the following x86 instructions to map to the subset of the C programming language that I use. MOV PUSH POP ADD SUB AND OR XOR NOT SHL SHR CALL RET JMP CMP-JCC > Note, This Machine only input it the program to check, it doesn't get a > encoder version as an input, it would need to figure that out itself. > Remember that nodes can have arbitrary 'names'. > -- 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-27 20:22 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <A%P7I.258672$2B1.136725@fx45.iad> |
| In reply to | #30157 |
On 3/27/21 8:06 PM, olcott wrote: > On 3/27/2021 5:40 PM, Richard Damon wrote: >> On 3/27/21 4:54 PM, olcott wrote: >>>> >>> >>> When Halts simulates itself it can see what it is doing and stop it. >>> >>> - >> >> I will challenge you to try and write a real Turing Machine that can >> detect when the input represents itself suitable for some define UTM. >> >> Bet you can't do it. > > This is too tedious without relative memory addressing. Nothing is too tedious for a Turing Machine, that is their middle name! > > A TM with direct memory addressing only need implement > the following x86 instructions to map to the subset of > the C programming language that I use. > > MOV PUSH POP > ADD SUB AND OR XOR NOT SHL SHR > CALL RET JMP CMP-JCC >
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-27 14:01 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <59b95b11-6b32-496d-b84e-3fff4633008an@googlegroups.com> |
| In reply to | #30119 |
On Saturday, 27 March 2021 at 20:44:56 UTC, olcott wrote: > On 3/27/2021 3:25 PM, André G. Isaak wrote: > > On 2021-03-27 13:33, olcott wrote: > > > >> Halts can detect its own infinite recursion thus it can detect another > >> UTM/Halt decider calling itself in the same way that it can detect > >> itself calling itself. > > > > What does 'its own infinite recursion' refer to here? > A master UTM simulates a UTM / halt decider named Halts. > That implies that you have two machines, a strict UTM, and a UTM which has been modified to have halt decider logic in it. The strict UTM is fed a description of the "UTM / halt decider". If that's the case, we can eliminate the "master UTM" from the analysis. Of course you have to some way of constructing and running your Turing machines, and since the only practical way to do this is with software, the native code that provides the environment for the Turing machine to run in is in a sense a UTM, because we can regard the physical computer with the stored machine code program as a Turing machine. But that's just a practical implementation detail. However as soon as you say that the "master UTM" does something other than simulate the Turing machines, then the descriptions of Turing machines are no longer descriptions of Turing machines (as interpreted by their runtime environment). They're descriptions of slightly different things, exactly how different depends on how the "master UTM" differs from a strict UTM. > > When the master UTM simulates Halts(Halts, Halts) Halts decides that > Halts would be infinitely recursive unless Halts stopped simulating Halts. > You mean halts(H_Hat, H_Hat)? If we construct Halts and feed it Halts, Halts concatenated on the tape, it will maybe emulate Halts with Halts on the tape, then emulate Halts with nothing on the tape, but then at that point everything will stop. Assuming that Halts works as you say, of course, I'm not claiming to know exactly what you have done.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 16:16 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <XoSdnVxNMIUkPcL9nZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #30127 |
On 3/27/2021 4:01 PM, Malcolm McLean wrote: > On Saturday, 27 March 2021 at 20:44:56 UTC, olcott wrote: >> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>> On 2021-03-27 13:33, olcott wrote: >>> >>>> Halts can detect its own infinite recursion thus it can detect another >>>> UTM/Halt decider calling itself in the same way that it can detect >>>> itself calling itself. >>> >>> What does 'its own infinite recursion' refer to here? >> A master UTM simulates a UTM / halt decider named Halts. >> > That implies that you have two machines, a strict UTM, and a UTM which > has been modified to have halt decider logic in it. The strict UTM is > fed a description of the "UTM / halt decider". If that's the case, we > can eliminate the "master UTM" from the analysis. Not really because most UTM's cannot simulate themselves. If we have a master UTM that simulates a UTM / halt decider then this simulated UTM halt decider can literally decide halting on itself. > Of course you have to > some way of constructing and running your Turing machines, and since > the only practical way to do this is with software, the native code that > provides the environment for the Turing machine to run in is in a sense > a UTM, because we can regard the physical computer with the stored machine > code program as a Turing machine. But that's just a practical implementation > detail. Almost not quite as already elborated. > However as soon as you say that the "master UTM" does something other > than simulate the Turing machines, then the descriptions of Turing machines > are no longer descriptions of Turing machines (as interpreted by their > runtime environment). They're descriptions of slightly different things, > exactly how different depends on how the "master UTM" differs from a > strict UTM. For discussion purposes we can consider the master UTM just a UTM. For practical implementation purposes I can't really emulate an x86 emulator inside of an x86 emulator. >> >> When the master UTM simulates Halts(Halts, Halts) Halts decides that >> Halts would be infinitely recursive unless Halts stopped simulating Halts. >> > You mean halts(H_Hat, H_Hat)? No I do not. Halts already (for all practical purposes) has an x86 emulator embedded within itself. In the case the master UTM is the halt decider because the halt decider is embedded in x86 emulator code. User code calls a stub function that it intercepted to invokes the x86utm code. > If we construct Halts and feed it Halts, Halts > concatenated on the tape, it will maybe emulate Halts with Halts on the tape, > then emulate Halts with nothing on the tape, but then at that point everything > will stop. Assuming that Halts works as you say, of course, I'm not claiming > to know exactly what you have done. > I will have to untangle this parameter passing stuff. In any case the master UTM / x86 emulator / halt decider would decide not halting on itself on the basis of infinite recursion, thus never reaching any infinite loops appended to its end. -- 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-27 15:31 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <s3o87t$frh$1@dont-email.me> |
| In reply to | #30131 |
On 2021-03-27 15:16, olcott wrote: > Not really because most UTM's cannot simulate themselves. If we have a Where do you get this from? Every UTM (real ones, not whatever it is you are calling UTMs) can take a description of itself as input. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-27 14:37 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <b3cd1662-c32a-4727-b01e-03034f8048d8n@googlegroups.com> |
| In reply to | #30131 |
On Saturday, 27 March 2021 at 21:16:49 UTC, olcott wrote: > On 3/27/2021 4:01 PM, Malcolm McLean wrote: > > On Saturday, 27 March 2021 at 20:44:56 UTC, olcott wrote: > >> On 3/27/2021 3:25 PM, André G. Isaak wrote: > >>> On 2021-03-27 13:33, olcott wrote: > >>> > >>>> Halts can detect its own infinite recursion thus it can detect another > >>>> UTM/Halt decider calling itself in the same way that it can detect > >>>> itself calling itself. > >>> > >>> What does 'its own infinite recursion' refer to here? > >> A master UTM simulates a UTM / halt decider named Halts. > >> > > That implies that you have two machines, a strict UTM, and a UTM which > > has been modified to have halt decider logic in it. The strict UTM is > > fed a description of the "UTM / halt decider". If that's the case, we > > can eliminate the "master UTM" from the analysis. > Not really because most UTM's cannot simulate themselves. > Every strict UTM can simulate itself. Just make a description of the UTM in the notation you have chosen, and put it on the tape. Then concatenate the tape with the descrtption of another machine using the same notation. Then concatenate some input. So the input might be a string of four ones, the first machine might be "append a one to a string of ones", and the result will be that the UTM emulates the second UTM which emulates the appender, and a one is appended to the string of ones. A physical computer which has a software program installed which provides an environment for emulating Turing machines maybe cannot emulate itself, because it's doing things that a Turing machine cannot do, such as providing a graphical display. Or because of the way it manages memory (the "tape" isn't really infinite).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 16:51 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <e-ydnTszV5N3NcL9nZ2dnUU7-fXNnZ2d@giganews.com> |
| In reply to | #30137 |
On 3/27/2021 4:37 PM, Malcolm McLean wrote: > On Saturday, 27 March 2021 at 21:16:49 UTC, olcott wrote: >> On 3/27/2021 4:01 PM, Malcolm McLean wrote: >>> On Saturday, 27 March 2021 at 20:44:56 UTC, olcott wrote: >>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>> On 2021-03-27 13:33, olcott wrote: >>>>> >>>>>> Halts can detect its own infinite recursion thus it can detect another >>>>>> UTM/Halt decider calling itself in the same way that it can detect >>>>>> itself calling itself. >>>>> >>>>> What does 'its own infinite recursion' refer to here? >>>> A master UTM simulates a UTM / halt decider named Halts. >>>> >>> That implies that you have two machines, a strict UTM, and a UTM which >>> has been modified to have halt decider logic in it. The strict UTM is >>> fed a description of the "UTM / halt decider". If that's the case, we >>> can eliminate the "master UTM" from the analysis. >> Not really because most UTM's cannot simulate themselves. >> > Every strict UTM can simulate itself. A UTM cannot literally simulate itself, it can however simulate a descriprtion of itself. When a simulated UTM description simulates itself this is the TM equivalent of the recursion that I refer to. > Just make a description of the UTM in > the notation you have chosen, and put it on the tape. Then concatenate > the tape with the descrtption of another machine using the same notation. > Then concatenate some input. So the input might be a string of four ones, the > first machine might be "append a one to a string of ones", and the result will > be that the UTM emulates the second UTM which emulates the appender, > and a one is appended to the string of ones. > > A physical computer which has a software program installed which provides > an environment for emulating Turing machines maybe cannot emulate itself, > because it's doing things that a Turing machine cannot do, such as providing > a graphical display. Or because of the way it manages memory (the "tape" > isn't really infinite). > -- 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-27 16:19 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <s3ob1a$4a3$1@dont-email.me> |
| In reply to | #30138 |
On 2021-03-27 15:51, olcott wrote: > On 3/27/2021 4:37 PM, Malcolm McLean wrote: >> On Saturday, 27 March 2021 at 21:16:49 UTC, olcott wrote: >>> On 3/27/2021 4:01 PM, Malcolm McLean wrote: >>>> On Saturday, 27 March 2021 at 20:44:56 UTC, olcott wrote: >>>>> On 3/27/2021 3:25 PM, André G. Isaak wrote: >>>>>> On 2021-03-27 13:33, olcott wrote: >>>>>> >>>>>>> Halts can detect its own infinite recursion thus it can detect >>>>>>> another >>>>>>> UTM/Halt decider calling itself in the same way that it can detect >>>>>>> itself calling itself. >>>>>> >>>>>> What does 'its own infinite recursion' refer to here? >>>>> A master UTM simulates a UTM / halt decider named Halts. >>>>> >>>> That implies that you have two machines, a strict UTM, and a UTM which >>>> has been modified to have halt decider logic in it. The strict UTM is >>>> fed a description of the "UTM / halt decider". If that's the case, we >>>> can eliminate the "master UTM" from the analysis. >>> Not really because most UTM's cannot simulate themselves. >>> >> Every strict UTM can simulate itself. > > A UTM cannot literally simulate itself, it can however simulate a > descriprtion of itself. > > When a simulated UTM description simulates itself this is the TM > equivalent of the recursion that I refer to. So once again, I ask. How does it determine that the description it is being fed is a copy of itself? André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-27 15:30 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <daa5d842-722a-41d6-818b-07f00b33a0c7n@googlegroups.com> |
| In reply to | #30141 |
On Saturday, 27 March 2021 at 22:19:25 UTC, André G. Isaak wrote: > On 2021-03-27 15:51, olcott wrote: > > > When a simulated UTM description simulates itself this is the TM > > equivalent of the recursion that I refer to. > > So once again, I ask. How does it determine that the description it is > being fed is a copy of itself? >. I've explained that this is possible. Declare a special symbol which means "include a copy of H here" and make it part of the notation we use to describe H_Hat. H then looks for that special symbol. This is allowed, there's no restriction on the notation we use for H_Hat, and there's no restriction on what H can do with that notation.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-27 16:42 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <s3occ9$d54$1@dont-email.me> |
| In reply to | #30145 |
On 2021-03-27 16:30, Malcolm McLean wrote: > On Saturday, 27 March 2021 at 22:19:25 UTC, André G. Isaak wrote: >> On 2021-03-27 15:51, olcott wrote: >> >>> When a simulated UTM description simulates itself this is the TM >>> equivalent of the recursion that I refer to. >> >> So once again, I ask. How does it determine that the description it is >> being fed is a copy of itself? >> . > I've explained that this is possible. Declare a special symbol which means > "include a copy of H here" and make it part of the notation we use to > describe H_Hat. H then looks for that special symbol. This is allowed, > there's no restriction on the notation we use for H_Hat, and there's > no restriction on what H can do with that notation. Let's assume that this is possible. How do you propose to force the person feeding H the description of H_Hat to use this symbol rather than simply spelling out all of the state transitions? H needs to be able to identify a description of itself without relying on any sort of notation which flags 'hey! here's a copy of yourself' in the input. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-27 16:04 -0700 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <1951e20f-b39f-4c73-9513-d5bb5dfcf71cn@googlegroups.com> |
| In reply to | #30148 |
On Saturday, 27 March 2021 at 22:42:19 UTC, André G. Isaak wrote: > On 2021-03-27 16:30, Malcolm McLean wrote: > > On Saturday, 27 March 2021 at 22:19:25 UTC, André G. Isaak wrote: > >> On 2021-03-27 15:51, olcott wrote: > >> > >>> When a simulated UTM description simulates itself this is the TM > >>> equivalent of the recursion that I refer to. > >> > >> So once again, I ask. How does it determine that the description it is > >> being fed is a copy of itself? > >> . > > I've explained that this is possible. Declare a special symbol which means > > "include a copy of H here" and make it part of the notation we use to > > describe H_Hat. H then looks for that special symbol. This is allowed, > > there's no restriction on the notation we use for H_Hat, and there's > > no restriction on what H can do with that notation. > Let's assume that this is possible. > > How do you propose to force the person feeding H the description of > H_Hat to use this symbol rather than simply spelling out all of the > state transitions? > > H needs to be able to identify a description of itself without relying > on any sort of notation which flags 'hey! here's a copy of yourself' in > the input. > No it doesn't. H can demand any notation for H_Hat. There's no restriction. If your counter-example relies on a certain notation for H_Hat, it's still a valid counter-example. Of course you can extend the argument to say that we can use another notation for an equivalent to H_Hat, and H won't determine that correctly. But that would be cheating by Linz, the proof has been adapted. Using an eccentric notation for H_Hat doesn't allow you to create an H / H_Hat pair in the correct relationship. But it does maybe make it easier to create a pair that look superficially as if they have the impossible relationship.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-27 18:17 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <OZudnXV2v_BhIcL9nZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #30151 |
On 3/27/2021 6:04 PM, Malcolm McLean wrote: > On Saturday, 27 March 2021 at 22:42:19 UTC, André G. Isaak wrote: >> On 2021-03-27 16:30, Malcolm McLean wrote: >>> On Saturday, 27 March 2021 at 22:19:25 UTC, André G. Isaak wrote: >>>> On 2021-03-27 15:51, olcott wrote: >>>> >>>>> When a simulated UTM description simulates itself this is the TM >>>>> equivalent of the recursion that I refer to. >>>> >>>> So once again, I ask. How does it determine that the description it is >>>> being fed is a copy of itself? >>>> . >>> I've explained that this is possible. Declare a special symbol which means >>> "include a copy of H here" and make it part of the notation we use to >>> describe H_Hat. H then looks for that special symbol. This is allowed, >>> there's no restriction on the notation we use for H_Hat, and there's >>> no restriction on what H can do with that notation. >> Let's assume that this is possible. >> >> How do you propose to force the person feeding H the description of >> H_Hat to use this symbol rather than simply spelling out all of the >> state transitions? >> >> H needs to be able to identify a description of itself without relying >> on any sort of notation which flags 'hey! here's a copy of yourself' in >> the input. >> > No it doesn't. H can demand any notation for H_Hat. There's no restriction. > If your counter-example relies on a certain notation for H_Hat, it's still a valid > counter-example. > > Of course you can extend the argument to say that we can use another > notation for an equivalent to H_Hat, and H won't determine that correctly. > But that would be cheating by Linz, the proof has been adapted. > > Using an eccentric notation for H_Hat doesn't allow you to create an H / > H_Hat pair in the correct relationship. But it does maybe make it easier to > create a pair that look superficially as if they have the impossible relationship. > Simply detect the infinite recursion of the computational equivalent of the conventional proofs. Actual UTM descriptions simulating themselves would demonstrate this same detectable behavior when they repeat the same sequence of state transitions having no escape route. http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-27 20:04 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (learned-by-rote) |
| Message-ID | <qKP7I.214644$398.180798@fx46.iad> |
| In reply to | #30152 |
On 3/27/21 7:17 PM, olcott wrote: > > Simply detect the infinite recursion of the computational equivalent of > the conventional proofs. Actual UTM descriptions simulating themselves > would demonstrate this same detectable behavior when they repeat the > same sequence of state transitions having no escape route. > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > As has been said, detecting that the program given represents H isn't easily done. Remember, you give H a representation of the machine to run and that machines input. H does NOT have its own representation to compare with, so detecting that it is running itself is not easily done.
[toc] | [prev] | [next] | [standalone]
Page 12 of 36 — ← Prev page 1 … 10 11 [12] 13 14 … 36 Next page →
Back to top | Article view | comp.theory
csiph-web