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 15 of 36 — ← Prev page 1 … 13 14 [15] 16 17 … 36 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 19:13 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <20210330121007.638@kylheku.com> |
| In reply to | #30369 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > Halts does correctly decide that H^ would not halt on its input unless > Halts stopped simulating H^, this makes Halts a halt decider for H^. Yes it does; but the problem is that in your program, Halts is a different function each time it is called. The Halts_X called from main makes a decision about H_Hat(H_Hat), which calls a different Halts_Y. That situation poses no problem. When H_Hat behaves in a way that is contrary to the answer given by one decider, another decider can correctly decide that. Your decider function depends on global data, which effectively makes it into a different decider every time it is called. The whole application may have repeatable beahvior as a Turing machine, but the application is not what you are offering as the function which corresponds to H in the proof. To offer the application as a decider, you need to make it accept two arguments (on the command line, perhaps). Then a H_Hat-like program will be written which can be passed to that application.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 14:22 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <BuCdnX2w86Hx5_79nZ2dnUU7-RWdnZ2d@giganews.com> |
| In reply to | #30371 |
On 3/30/2021 2:13 PM, Kaz Kylheku wrote: > On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> Halts does correctly decide that H^ would not halt on its input unless >> Halts stopped simulating H^, this makes Halts a halt decider for H^. > > Yes it does; but the problem is that in your program, Halts is a > different function each time it is called. Halts is only actually called once, the simulated calls to Halts are not actual calls to Halts and are thus simply aspects of a single computation. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 19:29 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <20210330122854.384@kylheku.com> |
| In reply to | #30373 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > On 3/30/2021 2:13 PM, Kaz Kylheku wrote: >> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >>> Halts does correctly decide that H^ would not halt on its input unless >>> Halts stopped simulating H^, this makes Halts a halt decider for H^. >> >> Yes it does; but the problem is that in your program, Halts is a >> different function each time it is called. > Halts is only actually called once, the simulated calls to Halts are not > actual calls to Halts and are thus simply aspects of a single computation. "Aspects of a single computation" is just a weasly way to say "not pure functions of their arguments". -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 15:11 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <1sSdnWEPnqhEGP79nZ2dnUU7-YudnZ2d@giganews.com> |
| In reply to | #30375 |
On 3/30/2021 2:29 PM, Kaz Kylheku wrote: > On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> On 3/30/2021 2:13 PM, Kaz Kylheku wrote: >>> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >>>> Halts does correctly decide that H^ would not halt on its input unless >>>> Halts stopped simulating H^, this makes Halts a halt decider for H^. >>> >>> Yes it does; but the problem is that in your program, Halts is a >>> different function each time it is called. >> Halts is only actually called once, the simulated calls to Halts are not >> actual calls to Halts and are thus simply aspects of a single computation. > > "Aspects of a single computation" is just a weasly way to say "not pure > functions of their arguments". > Halts invoked from main() is the only actual invocation of Halts. The input to Halts invoked from main is the machine address of the finite string of H^. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-30 15:58 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <%pL8I.15869$x17.6931@fx09.iad> |
| In reply to | #30369 |
On 3/30/21 2:34 PM, olcott wrote: > On 3/30/2021 1:15 PM, Richard Damon wrote: >> On 3/30/21 1:37 PM, olcott wrote: >>> On 3/30/2021 10:32 AM, Kaz Kylheku wrote: >>>> On 2021-03-30, olcott <polcott2@gmail.com> wrote: >>>>> On 3/30/2021 7:46 AM, Malcolm McLean wrote: >>>>>> On Tuesday, 30 March 2021 at 12:58:53 UTC+1, Richard Damon wrote: >>>>>>> >>>>>>> You seem to have this strange idea that Halts is allowed to >>>>>>> change its >>>>>>> behavior based on who calls it, which means that it is not a >>>>>>> Computation >>>>>>> and thus it can't be a candidate for a Halt Decider. >>>>>>> >>>>>> Obviously you have to do that if H_Hat is to be prevented from >>>>>> inverting >>>>>> the behaviour detected by Halts. The question is how effectively you >>>>>> can >>>>>> disguise it. >>>>>> >>>>> >>>>> Is is really that difficult to comprehend the that a computation >>>>> that is >>>>> simulated under a supervisor is not the same computation that is not >>>>> simulated under a supervisor? >>>> >>>> Rather, it is difficult for you to comprehend that the proof you're >>>> trying to dislodge forbids that. A computation specified as the >>>> application of a function to a pair of arguments must be >>>> unconditionally >>>> the same thing for the same values of those arguments. >>> >>> a moment when you suddenly feel that you understand, or suddenly become >>> conscious of, something that is very important to you >>> https://dictionary.cambridge.org/us/dictionary/english/epiphany >>> >>> The halt decider application has a simulator that keeps track of every >>> instruction that it simulates in its global memory that <is> the same as >>> a TM global tape. >>> >>> This instruction is appended to this global memory in the same way that >>> a TM could append data to the first free location on its global tape. >>> >>> Every time that it simulates any instruction it examines the execution >>> trace of every instruction that it has ever simulated that is in its >>> global memory that is the same as a TM global tape. >>> >>> When it finds a repeating pattern in its global memory that is the same >>> as a TMs global tape it stops its simulation and decides not halting. >>> >>> The input to the computation is a finite string machine description the >>> output is a Boolean value. >>> >>> The halt decider / simulator is only actually invoked once. >>> The halt decider / simulator is only actually invoked once. >>> The halt decider / simulator is only actually invoked once. >>> The halt decider / simulator is only actually invoked once. >>> The halt decider / simulator is only actually invoked once. >>> >>> All of the subsequent invocations are not actual invocations they are >>> simulations of invocations, therefore all of the execution trace data of >>> every simulated invocation of the UTM / halt decider is a part of the >>> computation of the actual single invocation of the UTM / halt decider. >>> >>> >> >> And once you realize that when H_Hat is run as the top level program, it >> is OUTSIDE your halt deciding logic (at least if you built it to the >> specification of Linz et al) the you will realizd that that H_Hat MUST >> get the sam answer as your Halts(H_Hat, H_Hat) inside you machine got. >> >> And when it does get that, it will Halt, showing that Halts was wrong. >> > > You can't seem to get this through your thick skull: > > Halts does correctly decide that H^ would not halt on its input unless > Halts stopped simulating H^, this makes Halts a halt decider for H^. > > If you disagree with this you might as well disagree that black cats are > black. In either case you are going up against verifiable facts. IF you want to insist on that, can you say what is wrong with the analysis that I have presented several times? Here it is the argument, what step is wrong? You are making the claim that Halts is the compuational equivalent to the Halting Decider H in the Linz proof. This means that Halts is a proper Computation, and that means that every time it is given the same inputs, it will return the same answer. And that these inputs are exactly the description of the program to run, and a description of the input to give it. You are making the claim that H_Hat is related to Halts in the same way that H^ in Linz is related to H. This means that H_Hat is also a proper computation. You claim that when we run the computation Halts(H_Hat, H_Hat) it will return the answer 'non-halting' when run as the top level computation. THEREFORE, when we run H_Hat as the top level machine, and it must run exactly per its specifications, it will make a call the Halt with the same arguments, so Halts(H_Hat, H_Hat) MUST return non-halting to it. By the stated design in Linz, when H returns non-halting, the machine H^ will halt and so will H_Hat. This shows that H_Hat(H_Hat) is a halting computation, and thus Halts was wrong with its answer of Halts(H_Hat, H_Hat). All of this is by the basic definition of the Halting Problem and the basic definitions of Computation Theory that you HAVE to accept as your basis if you want your argument to be applicable to saying something about Linz. > >> The apparent issue is that you have no way to provide an input that >> represent a H_Hat that is outside the x86utm OS, so you run into >> problems. > > There are many way to define a halt decider that doesn't correctly > decide halting. When we want to define a halt decider that does > correctly decide halting our options are much more limited. > > The only way to make sure that halting is decided consistently is that > nothing is allowed to be executed outside the scope of the halt decider. WRONG!! Halting is decided constantly by using the proper definition, and the ONLY definition for that is what the Turing Machines would actually do when run as Turing Machines, (and not under the influence of any external influence, because if they are under external influnce they are no longer the computations they are supposed to be. If the only way you can think of Turing Machines is in some other contexts, then maybe we need to send the logic police out to arrest you for operating logic under the influence of stupidity. > >> You can say it is ok to provide the input showing it as inside x86utm, >> and can process that, but we still need to compare the results to >> running H_hat outside, and that shows that Halts was wrong. >> > > The closest thing that can be done in this regard that is not flat out > cheating is swapping out the halt decider for a simulator that returns > true whenever its simulation halts on its own. > Which then fail to solve the problem when given a computation that doesn't halt. You act like it is some world destroying situation that there exists some computations that we can't tell if they would ever complete or just go on forever. Not everything in life is knowable, some things ARE just unknown and even unknowable. If you mind can't handle that, stick to finite systems with just first order logic, then you will be fine, and all those unknows are just outside tehe domains of what you can talk about. If you do that, the Halting problem goes away, as you limit yourself to just the simpler elements of Math, and can't get into things like Computation Theory.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 15:05 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <1sSdnWQPnqjpGf79nZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #30376 |
On 3/30/2021 2:58 PM, Richard Damon wrote: > On 3/30/21 2:34 PM, olcott wrote: >> On 3/30/2021 1:15 PM, Richard Damon wrote: >>> On 3/30/21 1:37 PM, olcott wrote: >>>> On 3/30/2021 10:32 AM, Kaz Kylheku wrote: >>>>> On 2021-03-30, olcott <polcott2@gmail.com> wrote: >>>>>> On 3/30/2021 7:46 AM, Malcolm McLean wrote: >>>>>>> On Tuesday, 30 March 2021 at 12:58:53 UTC+1, Richard Damon wrote: >>>>>>>> >>>>>>>> You seem to have this strange idea that Halts is allowed to >>>>>>>> change its >>>>>>>> behavior based on who calls it, which means that it is not a >>>>>>>> Computation >>>>>>>> and thus it can't be a candidate for a Halt Decider. >>>>>>>> >>>>>>> Obviously you have to do that if H_Hat is to be prevented from >>>>>>> inverting >>>>>>> the behaviour detected by Halts. The question is how effectively you >>>>>>> can >>>>>>> disguise it. >>>>>>> >>>>>> >>>>>> Is is really that difficult to comprehend the that a computation >>>>>> that is >>>>>> simulated under a supervisor is not the same computation that is not >>>>>> simulated under a supervisor? >>>>> >>>>> Rather, it is difficult for you to comprehend that the proof you're >>>>> trying to dislodge forbids that. A computation specified as the >>>>> application of a function to a pair of arguments must be >>>>> unconditionally >>>>> the same thing for the same values of those arguments. >>>> >>>> a moment when you suddenly feel that you understand, or suddenly become >>>> conscious of, something that is very important to you >>>> https://dictionary.cambridge.org/us/dictionary/english/epiphany >>>> >>>> The halt decider application has a simulator that keeps track of every >>>> instruction that it simulates in its global memory that <is> the same as >>>> a TM global tape. >>>> >>>> This instruction is appended to this global memory in the same way that >>>> a TM could append data to the first free location on its global tape. >>>> >>>> Every time that it simulates any instruction it examines the execution >>>> trace of every instruction that it has ever simulated that is in its >>>> global memory that is the same as a TM global tape. >>>> >>>> When it finds a repeating pattern in its global memory that is the same >>>> as a TMs global tape it stops its simulation and decides not halting. >>>> >>>> The input to the computation is a finite string machine description the >>>> output is a Boolean value. >>>> >>>> The halt decider / simulator is only actually invoked once. >>>> The halt decider / simulator is only actually invoked once. >>>> The halt decider / simulator is only actually invoked once. >>>> The halt decider / simulator is only actually invoked once. >>>> The halt decider / simulator is only actually invoked once. >>>> >>>> All of the subsequent invocations are not actual invocations they are >>>> simulations of invocations, therefore all of the execution trace data of >>>> every simulated invocation of the UTM / halt decider is a part of the >>>> computation of the actual single invocation of the UTM / halt decider. >>>> >>>> >>> >>> And once you realize that when H_Hat is run as the top level program, it >>> is OUTSIDE your halt deciding logic (at least if you built it to the >>> specification of Linz et al) the you will realizd that that H_Hat MUST >>> get the sam answer as your Halts(H_Hat, H_Hat) inside you machine got. >>> >>> And when it does get that, it will Halt, showing that Halts was wrong. >>> >> >> You can't seem to get this through your thick skull: >> >> Halts does correctly decide that H^ would not halt on its input unless >> Halts stopped simulating H^, this makes Halts a halt decider for H^. >> >> If you disagree with this you might as well disagree that black cats are >> black. In either case you are going up against verifiable facts. > > > IF you want to insist on that, can you say what is wrong with the > analysis that I have presented several times? > > Here it is the argument, what step is wrong? > > You are making the claim that Halts is the compuational equivalent to > the Halting Decider H in the Linz proof. That the actual verbatim Linz H^ specifies infinite recursion for any halt decider that is based on simulating its input is self-evident. -- 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-30 16:31 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <sUL8I.256298$398.235920@fx46.iad> |
| In reply to | #30378 |
On 3/30/21 4:05 PM, olcott wrote: > On 3/30/2021 2:58 PM, Richard Damon wrote: >> >> IF you want to insist on that, can you say what is wrong with the >> analysis that I have presented several times? >> >> Here it is the argument, what step is wrong? >> >> You are making the claim that Halts is the compuational equivalent to >> the Halting Decider H in the Linz proof. > That the actual verbatim Linz H^ specifies infinite recursion for any > halt decider that is based on simulating its input is self-evident. > If this is the best argument you can make that my proof that H_Hat is a halting computation if flawed, I think you have lost. Turing Machines can NOT be recursive in the normal sense, as they don't have a 'call stack' to make calls with. A Turing Machine can implement computations that might be specified recursively, but will tend to transform them into iterative versions of that computation. Assuming H is a finite Turing Machine, so will H^ as it doesn't add that much to H, the biggest piece of code it the part you like to remove, the duplication of its input, so we don't have an issue with the machine becoming infinitely large. The machibe H^ isn't even self referential in its design. It is only that we feed the machine the representation of itself that cause any form of self-reference, but then, Halts claims to handle any machine, that that is a machine. Special Note, there is NOTHING in the description of H^ or H in the Linz proof that requires (or prohibits) H from using simulation in its method of solution, but like any method chosen, if it want to succeed with that method, it needs to think about all the possible input conditions and how to handle them. It seems, the issue here is that your Halts doesn't know how to handle any machine that uses copies of the halt decider within itself in certain ways, maybe you can look at that weakness and find a way to do better in that case.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 16:05 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <CpGdnc3MlJ_mD_79nZ2dnUU7-R3NnZ2d@giganews.com> |
| In reply to | #30382 |
On 3/30/2021 3:31 PM, Richard Damon wrote: > On 3/30/21 4:05 PM, olcott wrote: >> On 3/30/2021 2:58 PM, Richard Damon wrote: > >>> >>> IF you want to insist on that, can you say what is wrong with the >>> analysis that I have presented several times? >>> >>> Here it is the argument, what step is wrong? >>> >>> You are making the claim that Halts is the compuational equivalent to >>> the Halting Decider H in the Linz proof. >> That the actual verbatim Linz H^ specifies infinite recursion for any >> halt decider that is based on simulating its input is self-evident. >> > > > If this is the best argument you can make that my proof that H_Hat is a > halting computation if flawed, I think you have lost. > > Turing Machines can NOT be recursive in the normal sense, as they don't > have a 'call stack' to make calls with. A Turing Machine can implement > computations that might be specified recursively, but will tend to > transform them into iterative versions of that computation. > When the halt decider is based on a UTM then H^ copies itself then simulates H^ which copies H^ which simulates H^... -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-30 17:14 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <gxM8I.48326$yR1.9117@fx08.iad> |
| In reply to | #30387 |
On 3/30/21 5:05 PM, olcott wrote: > On 3/30/2021 3:31 PM, Richard Damon wrote: >> On 3/30/21 4:05 PM, olcott wrote: >>> On 3/30/2021 2:58 PM, Richard Damon wrote: >> >>>> >>>> IF you want to insist on that, can you say what is wrong with the >>>> analysis that I have presented several times? >>>> >>>> Here it is the argument, what step is wrong? >>>> >>>> You are making the claim that Halts is the compuational equivalent to >>>> the Halting Decider H in the Linz proof. >>> That the actual verbatim Linz H^ specifies infinite recursion for any >>> halt decider that is based on simulating its input is self-evident. >>> >> >> >> If this is the best argument you can make that my proof that H_Hat is a >> halting computation if flawed, I think you have lost. >> >> Turing Machines can NOT be recursive in the normal sense, as they don't >> have a 'call stack' to make calls with. A Turing Machine can implement >> computations that might be specified recursively, but will tend to >> transform them into iterative versions of that computation. >> > > When the halt decider is based on a UTM then H^ copies itself then > simulates H^ which copies H^ which simulates H^... > Which, as I've said is a problem the Halt Decider needs to figure out how to handle as it created the problem itself by how it decide to solve the problem. It isn't the Halting problems issue that you have chosen a method that gives problems for this and haven't even attempted to handle the condition. Thus it is Halts problem that it got that answer wrong. Previously, I have given you hints of techniques that handle more of the cases, at least those that aren't contrary, (provided you can properly detect the recursion). It could even give the slightly less incorrect answer to the halting problem for H^ of giving a third answer that the Machine was being contrary.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-31 09:32 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <JoednbpWk990Gvn9nZ2dnUU7-VfNnZ2d@giganews.com> |
| In reply to | #30388 |
On 3/30/2021 4:14 PM, Richard Damon wrote: > On 3/30/21 5:05 PM, olcott wrote: >> On 3/30/2021 3:31 PM, Richard Damon wrote: >>> On 3/30/21 4:05 PM, olcott wrote: >>>> On 3/30/2021 2:58 PM, Richard Damon wrote: >>> >>>>> >>>>> IF you want to insist on that, can you say what is wrong with the >>>>> analysis that I have presented several times? >>>>> >>>>> Here it is the argument, what step is wrong? >>>>> >>>>> You are making the claim that Halts is the compuational equivalent to >>>>> the Halting Decider H in the Linz proof. >>>> That the actual verbatim Linz H^ specifies infinite recursion for any >>>> halt decider that is based on simulating its input is self-evident. >>>> >>> >>> >>> If this is the best argument you can make that my proof that H_Hat is a >>> halting computation if flawed, I think you have lost. >>> >>> Turing Machines can NOT be recursive in the normal sense, as they don't >>> have a 'call stack' to make calls with. A Turing Machine can implement >>> computations that might be specified recursively, but will tend to >>> transform them into iterative versions of that computation. >>> >> >> When the halt decider is based on a UTM then H^ copies itself then >> simulates H^ which copies H^ which simulates H^... >> > > Which, as I've said is a problem the Halt Decider needs to figure out > how to handle as it created the problem itself by how it decide to solve > the problem. > That H^ specifies infinite recursion for any halt decider based on simulating it input is a verified fact. Any interpretation to the contrary is necessarily incorrect. > It isn't the Halting problems issue that you have chosen a method that > gives problems for this and haven't even attempted to handle the > condition. Thus it is Halts problem that it got that answer wrong. > It is this infinite recursion basis that make H^ decidable. If it retained its liar paradox structure such that both true and false are the wrong answer and the entire solution set then it would remain unsolvable. http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > Previously, I have given you hints of techniques that handle more of the > cases, at least those that aren't contrary, (provided you can properly > detect the recursion). It could even give the slightly less incorrect > answer to the halting problem for H^ of giving a third answer that the > Machine was being contrary. > -- 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-31 11:33 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <vD09I.393131$2B1.234603@fx45.iad> |
| In reply to | #30415 |
On 3/31/21 10:32 AM, olcott wrote: > On 3/30/2021 4:14 PM, Richard Damon wrote: >> On 3/30/21 5:05 PM, olcott wrote: >>> On 3/30/2021 3:31 PM, Richard Damon wrote: >>>> On 3/30/21 4:05 PM, olcott wrote: >>>>> On 3/30/2021 2:58 PM, Richard Damon wrote: >>>> >>>>>> >>>>>> IF you want to insist on that, can you say what is wrong with the >>>>>> analysis that I have presented several times? >>>>>> >>>>>> Here it is the argument, what step is wrong? >>>>>> >>>>>> You are making the claim that Halts is the compuational equivalent to >>>>>> the Halting Decider H in the Linz proof. >>>>> That the actual verbatim Linz H^ specifies infinite recursion for any >>>>> halt decider that is based on simulating its input is self-evident. >>>>> >>>> >>>> >>>> If this is the best argument you can make that my proof that H_Hat is a >>>> halting computation if flawed, I think you have lost. >>>> >>>> Turing Machines can NOT be recursive in the normal sense, as they don't >>>> have a 'call stack' to make calls with. A Turing Machine can implement >>>> computations that might be specified recursively, but will tend to >>>> transform them into iterative versions of that computation. >>>> >>> >>> When the halt decider is based on a UTM then H^ copies itself then >>> simulates H^ which copies H^ which simulates H^... >>> >> >> Which, as I've said is a problem the Halt Decider needs to figure out >> how to handle as it created the problem itself by how it decide to solve >> the problem. >> > > That H^ specifies infinite recursion for any halt decider based on > simulating it input is a verified fact. Any interpretation to the > contrary is necessarily incorrect. H^ can only be an infinite recursion for a broken halt decider because infinite recursion requires infinite execution time, but halt deciders MUST answer in finite time. Yes, it presents a POTENTIAL infinite recursion that the halt decider needs to have some way to handle to meet its requirements. > >> It isn't the Halting problems issue that you have chosen a method that >> gives problems for this and haven't even attempted to handle the >> condition. Thus it is Halts problem that it got that answer wrong. >> > > It is this infinite recursion basis that make H^ decidable. > If it retained its liar paradox structure such that both true and false > are the wrong answer and the entire solution set then it would remain > unsolvable. > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf WRONG. Once we have a defined computation for H, and assuming that H meets the requirement for being a decider (and so answers in finite time) then we can easily build a decider that answers this particular question correctly, we can define our halt decider H' the just returns the answer ! H(H^, H^) and it will be correct. So we DON'T have a liars paradox, there IS a right answer, once we have define an ACTUAL computation H. The issue is that H itself can never return that answer, and we only get into the 'Liars Paradox' if we start with an assumption that H can actually always answer the question correctly. H really does need to be define as an actual computation and not just some rule that it will always be right. THAT is the Liars Paradox. This actually become the proof that you are trying to disprove that says that there actually can not exist a Turing Machine that can decide the Halting status of ALL Turing Machines and ALL inputs. > > >> Previously, I have given you hints of techniques that handle more of the >> cases, at least those that aren't contrary, (provided you can properly >> detect the recursion). It could even give the slightly less incorrect >> answer to the halting problem for H^ of giving a third answer that the >> Machine was being contrary. >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-31 11:01 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <ZvydnS1X8sVsAfn9nZ2dnUU7-c2dnZ2d@giganews.com> |
| In reply to | #30425 |
On 3/31/2021 10:33 AM, Richard Damon wrote: > On 3/31/21 10:32 AM, olcott wrote: >> On 3/30/2021 4:14 PM, Richard Damon wrote: >>> On 3/30/21 5:05 PM, olcott wrote: >>>> On 3/30/2021 3:31 PM, Richard Damon wrote: >>>>> On 3/30/21 4:05 PM, olcott wrote: >>>>>> On 3/30/2021 2:58 PM, Richard Damon wrote: >>>>> >>>>>>> >>>>>>> IF you want to insist on that, can you say what is wrong with the >>>>>>> analysis that I have presented several times? >>>>>>> >>>>>>> Here it is the argument, what step is wrong? >>>>>>> >>>>>>> You are making the claim that Halts is the compuational equivalent to >>>>>>> the Halting Decider H in the Linz proof. >>>>>> That the actual verbatim Linz H^ specifies infinite recursion for any >>>>>> halt decider that is based on simulating its input is self-evident. >>>>>> >>>>> >>>>> >>>>> If this is the best argument you can make that my proof that H_Hat is a >>>>> halting computation if flawed, I think you have lost. >>>>> >>>>> Turing Machines can NOT be recursive in the normal sense, as they don't >>>>> have a 'call stack' to make calls with. A Turing Machine can implement >>>>> computations that might be specified recursively, but will tend to >>>>> transform them into iterative versions of that computation. >>>>> >>>> >>>> When the halt decider is based on a UTM then H^ copies itself then >>>> simulates H^ which copies H^ which simulates H^... >>>> >>> >>> Which, as I've said is a problem the Halt Decider needs to figure out >>> how to handle as it created the problem itself by how it decide to solve >>> the problem. >>> >> >> That H^ specifies infinite recursion for any halt decider based on >> simulating it input is a verified fact. Any interpretation to the >> contrary is necessarily incorrect. > > H^ can only be an infinite recursion for a broken halt decider because > infinite recursion requires infinite execution time, but halt deciders > MUST answer in finite time. Yes, it presents a POTENTIAL infinite > recursion that the halt decider needs to have some way to handle to meet > its requirements. > >> >>> It isn't the Halting problems issue that you have chosen a method that >>> gives problems for this and haven't even attempted to handle the >>> condition. Thus it is Halts problem that it got that answer wrong. >>> >> >> It is this infinite recursion basis that make H^ decidable. >> If it retained its liar paradox structure such that both true and false >> are the wrong answer and the entire solution set then it would remain >> unsolvable. >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > > WRONG. Once we have a defined computation for H, and assuming that H > meets the requirement for being a decider (and so answers in finite > time) then we can easily build a decider that answers this particular > question correctly, we can define our halt decider H' the just returns > the answer ! H(H^, H^) and it will be correct. So we DON'T have a liars > paradox, there IS a right answer, once we have define an ACTUAL > computation H. > > The issue is that H itself can never return that answer, and we only get > into the 'Liars Paradox' if we start with an assumption that H can return a value to a caller that has invoked it in infinite recursion. > actually always answer the question correctly. H really does need to be > define as an actual computation and not just some rule that it will > always be right. THAT is the Liars Paradox. > > This actually become the proof that you are trying to disprove that says > that there actually can not exist a Turing Machine that can decide the > Halting status of ALL Turing Machines and ALL inputs. >> >> >>> Previously, I have given you hints of techniques that handle more of the >>> cases, at least those that aren't contrary, (provided you can properly >>> detect the recursion). It could even give the slightly less incorrect >>> answer to the halting problem for H^ of giving a third answer that the >>> Machine was being contrary. >>> >> >> > -- 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-31 13:17 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <8929I.393163$2B1.357306@fx45.iad> |
| In reply to | #30431 |
On 3/31/21 12:01 PM, olcott wrote: > On 3/31/2021 10:33 AM, Richard Damon wrote: >> WRONG. Once we have a defined computation for H, and assuming that H >> meets the requirement for being a decider (and so answers in finite >> time) then we can easily build a decider that answers this particular >> question correctly, we can define our halt decider H' the just returns >> the answer ! H(H^, H^) and it will be correct. So we DON'T have a liars >> paradox, there IS a right answer, once we have define an ACTUAL >> computation H. >> >> The issue is that H itself can never return that answer, and we only get >> into the 'Liars Paradox' if we start with an assumption that H can > > return a value to a caller that has invoked it in infinite recursion. > Typical Olcott. Misquote and not reply to the question. As I said, if H is a computation, if it had infinite recursion in this case, it also had it in the other call, and thus it fails to be a decider. You can decide which way you fail at your proof. Either H is not a computation and fails that requirement, or it is an infinite computation for this input and fails that requirement. or This decision here was wrong, or Maybe you whole system is just in the toilet.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-30 21:37 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <87mtuknzs2.fsf@bsb.me.uk> |
| In reply to | #30378 |
olcott <NoOne@NoWhere.com> writes: > That the actual verbatim Linz H^ specifies infinite recursion for any > halt decider that is based on simulating its input is self-evident. Linz's H^ is a Turing machine. TMs have no functions and no function calls. There can be no recursion, infinite or otherwise, specified for any of Linz's TMs. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 15:52 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <tdGdnWpOPMfuEv79nZ2dnUU7-fvNnZ2d@giganews.com> |
| In reply to | #30384 |
On 3/30/2021 3:37 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> That the actual verbatim Linz H^ specifies infinite recursion for any >> halt decider that is based on simulating its input is self-evident. > > Linz's H^ is a Turing machine. TMs have no functions and no function > calls. There can be no recursion, infinite or otherwise, specified for > any of Linz's TMs. Yes and it is totally above and beyond the imagination of some people that the simulated description of a UTM could simulate recursion by simulating its own machine description. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 19:09 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <20210330104420.775@kylheku.com> |
| In reply to | #30367 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote:
> On 3/30/2021 10:32 AM, Kaz Kylheku wrote:
>> On 2021-03-30, olcott <polcott2@gmail.com> wrote:
>>> On 3/30/2021 7:46 AM, Malcolm McLean wrote:
>>>> On Tuesday, 30 March 2021 at 12:58:53 UTC+1, Richard Damon wrote:
>>>>>
>>>>> You seem to have this strange idea that Halts is allowed to change its
>>>>> behavior based on who calls it, which means that it is not a Computation
>>>>> and thus it can't be a candidate for a Halt Decider.
>>>>>
>>>> Obviously you have to do that if H_Hat is to be prevented from inverting
>>>> the behaviour detected by Halts. The question is how effectively you can
>>>> disguise it.
>>>>
>>>
>>> Is is really that difficult to comprehend the that a computation that is
>>> simulated under a supervisor is not the same computation that is not
>>> simulated under a supervisor?
>>
>> Rather, it is difficult for you to comprehend that the proof you're
>> trying to dislodge forbids that. A computation specified as the
>> application of a function to a pair of arguments must be unconditionally
>> the same thing for the same values of those arguments.
>
> a moment when you suddenly feel that you understand, or suddenly become
> conscious of, something that is very important to you
> https://dictionary.cambridge.org/us/dictionary/english/epiphany
Epiphanies are only feelings; they can be triggered by a belief
that turns out to be horribly wrong.
People sometimes have epiphanies because they momentarily forget some
important requirement or assumption.
After the feeling of epiphany, it's back to "oh yeah, no, oops".
> The halt decider application has a simulator that keeps track of every
> instruction that it simulates in its global memory that <is> the same as
> a TM global tape.
> This instruction is appended to this global memory in the same way that
> a TM could append data to the first free location on its global tape.
Yeah yeah yeah, same old repeated clap-trap. The entire program is a TM.
Yes, so is my reference C program. Every time you run ./halts or
./halts -h or ./halts -l, the result is reproducible. So what?
The enclosing application is not a decider, because it is not a
function of two inputs.
If you want the application to be classified as a decider, you need
a main function like this:
int main(int argc, char **argv)
{
if (argc != 3) {
printf("two arguments required: program and input\n");
return EXIT_FAILURE;
}
// ...
}
You need to *load* the program specified by argv[1], and the
input arg[2] and analyze those.
> When it finds a repeating pattern in its global memory that is the same
> as a TMs global tape it stops its simulation and decides not halting.
The proof you're trying to attack is about pure functions.
To attack *that proof*, you must show that its conclusion is false while
upholding its premises.
You must do that even if you feel that the halting problem should not be
about pure functions.
(The problem with your feeling is that the application of recursive
functions to arguments is equivalent to Turing machines. A valid proof
about pure functions makes an irrefutable statement about Turing
computation.)
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 14:20 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <BuCdnUKw86Fi5P79nZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #30370 |
On 3/30/2021 2:09 PM, Kaz Kylheku wrote:
> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote:
>> On 3/30/2021 10:32 AM, Kaz Kylheku wrote:
>>> On 2021-03-30, olcott <polcott2@gmail.com> wrote:
>>>> On 3/30/2021 7:46 AM, Malcolm McLean wrote:
>>>>> On Tuesday, 30 March 2021 at 12:58:53 UTC+1, Richard Damon wrote:
>>>>>>
>>>>>> You seem to have this strange idea that Halts is allowed to change its
>>>>>> behavior based on who calls it, which means that it is not a Computation
>>>>>> and thus it can't be a candidate for a Halt Decider.
>>>>>>
>>>>> Obviously you have to do that if H_Hat is to be prevented from inverting
>>>>> the behaviour detected by Halts. The question is how effectively you can
>>>>> disguise it.
>>>>>
>>>>
>>>> Is is really that difficult to comprehend the that a computation that is
>>>> simulated under a supervisor is not the same computation that is not
>>>> simulated under a supervisor?
>>>
>>> Rather, it is difficult for you to comprehend that the proof you're
>>> trying to dislodge forbids that. A computation specified as the
>>> application of a function to a pair of arguments must be unconditionally
>>> the same thing for the same values of those arguments.
>>
>> a moment when you suddenly feel that you understand, or suddenly become
>> conscious of, something that is very important to you
>> https://dictionary.cambridge.org/us/dictionary/english/epiphany
>
> Epiphanies are only feelings; they can be triggered by a belief
> that turns out to be horribly wrong.
>
> People sometimes have epiphanies because they momentarily forget some
> important requirement or assumption.
>
> After the feeling of epiphany, it's back to "oh yeah, no, oops".
>
>> The halt decider application has a simulator that keeps track of every
>> instruction that it simulates in its global memory that <is> the same as
>> a TM global tape.
>> This instruction is appended to this global memory in the same way that
>> a TM could append data to the first free location on its global tape.
>
> Yeah yeah yeah, same old repeated clap-trap. The entire program is a TM.
>
> Yes, so is my reference C program. Every time you run ./halts or
> ./halts -h or ./halts -l, the result is reproducible. So what?
>
> The enclosing application is not a decider, because it is not a
> function of two inputs.
>
> If you want the application to be classified as a decider, you need
> a main function like this:
>
> int main(int argc, char **argv)
> {
> if (argc != 3) {
> printf("two arguments required: program and input\n");
> return EXIT_FAILURE;
> }
>
> // ...
> }
>
> You need to *load* the program specified by argv[1], and the
> input arg[2] and analyze those.
>
>> When it finds a repeating pattern in its global memory that is the same
>> as a TMs global tape it stops its simulation and decides not halting.
>
> The proof you're trying to attack is about pure functions.
>
> To attack *that proof*, you must show that its conclusion is false while
> upholding its premises.
>
> You must do that even if you feel that the halting problem should not be
> about pure functions.
>
> (The problem with your feeling is that the application of recursive
> functions to arguments is equivalent to Turing machines. A valid proof
> about pure functions makes an irrefutable statement about Turing
> computation.)
>
If my UTM / halt decider is a single computation from input finite
string do Boolean value then it can track of all of the details of the
simulations inbetween. Halts is only actually called once, the simulated
calls to Halts are not actual calls to Halts.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 19:28 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <20210330122334.929@kylheku.com> |
| In reply to | #30372 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > If my UTM / halt decider is a single computation from input finite > string do Boolean value then it can track of all of the details of the > simulations inbetween. Halts is only actually called once, the simulated > calls to Halts are not actual calls to Halts. "If", sure. But it isn't. Your program doesn't take any input. If you're saying that the entire program corresponds to Halts(P, I), then it means you're still not meeting the requiremens of the proof; you do not have P and I arguments. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 15:09 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <1sSdnWYPnqgRGP79nZ2dnUU7-YudnZ2d@giganews.com> |
| In reply to | #30374 |
On 3/30/2021 2:28 PM, Kaz Kylheku wrote: > On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> If my UTM / halt decider is a single computation from input finite >> string do Boolean value then it can track of all of the details of the >> simulations inbetween. Halts is only actually called once, the simulated >> calls to Halts are not actual calls to Halts. > > "If", sure. But it isn't. Your program doesn't take any input. > If you're saying that the entire program corresponds to Halts(P, I), > then it means you're still not meeting the requiremens of the proof; > you do not have P and I arguments. > Halts invoked from main() is the only actual invocation of Halts. The input to Halts invoked from main is the machine address of the finite string of H^. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 21:15 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (epiphany) |
| Message-ID | <20210330140853.940@kylheku.com> |
| In reply to | #30380 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > On 3/30/2021 2:28 PM, Kaz Kylheku wrote: >> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >>> If my UTM / halt decider is a single computation from input finite >>> string do Boolean value then it can track of all of the details of the >>> simulations inbetween. Halts is only actually called once, the simulated >>> calls to Halts are not actual calls to Halts. >> >> "If", sure. But it isn't. Your program doesn't take any input. >> If you're saying that the entire program corresponds to Halts(P, I), >> then it means you're still not meeting the requiremens of the proof; >> you do not have P and I arguments. >> > > Halts invoked from main() is the only actual invocation of Halts. That is false; if you edit main() to call H_Hat, then H_Hat has an actual invocation of Halts. That no longer returns 0. It is actually invoked, and actually hits recursion and actually aborts. > input to Halts invoked from main is the machine address of the finite > string of H^. So you are then saying that it is in fact Halts which corresponds to the halting function in the proof, and not the application as a whole. Since it isn't a pure function of two parameters, that isn't a valid model of the proof. Halts runs inside a simulator which is already gathering execution traces when main is entered. Halts peeks at those traces. It may be that each call to Halts is a Turing Machine computation; but its model corresponds to a three-argument function: arguments P, I and the execution trace gathered so far by the "OS". That third argument is always different. It is unsurprising that Halts(H_Hat, H_Hat, X) can correctly decide H_Hat(H_Hat) which calls Hals(H_Hat, H_Hat, Y), X /= Y. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
Page 15 of 36 — ← Prev page 1 … 13 14 [15] 16 17 … 36 Next page →
Back to top | Article view | comp.theory
csiph-web