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 31 of 36 — ← Prev page 1 … 29 30 [31] 32 33 … 36 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-28 21:59 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <yrCdnSTeGfPm3_z9nZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #30232 |
On 3/28/2021 4:42 PM, Richard Damon wrote: > On 3/28/21 5:17 PM, Malcolm McLean wrote: >> On Sunday, 28 March 2021 at 22:12:26 UTC+1, Alan Mackenzie wrote: >>> olcott <No...@nowhere.com> wrote: >>> >>>> Hence TM's are not limited to computing pure functions. There can be >>>> all kinds of static local data, mutating global data and side effects. >>>> Operating system do all these things. >>> Yes, and all these things can be modelled by turing machines having the >>> global data, etc., modelled as parameters. In a sense, anything a >>> computer can do can be modelled by a turing machine. >>> >> The main difference is that the tape can be modified from outside as the >> Turing machine is running, in a typical real computer program. >> > > No, the Turing Model does NOT allow a change in the system once started, > not an fit in the normal course of the theory. > > Yes, you could postulate such actions, and even do that with an actual > program running a Turing Model, but doing so put your outside what > Turing Theory describes. > > You could even pause the machine and change the state machine, doesn't > mean theory will help you decide what is going to happen. > This provides the basis for all kinds of extensions to Turing's basic model. -- 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-28 23:24 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <YLb8I.14186$x17.1905@fx09.iad> |
| In reply to | #30258 |
On 3/28/21 10:59 PM, olcott wrote: > On 3/28/2021 4:42 PM, Richard Damon wrote: >> On 3/28/21 5:17 PM, Malcolm McLean wrote: >>> On Sunday, 28 March 2021 at 22:12:26 UTC+1, Alan Mackenzie wrote: >>>> olcott <No...@nowhere.com> wrote: >>>> >>>>> Hence TM's are not limited to computing pure functions. There can be >>>>> all kinds of static local data, mutating global data and side effects. >>>>> Operating system do all these things. >>>> Yes, and all these things can be modelled by turing machines having the >>>> global data, etc., modelled as parameters. In a sense, anything a >>>> computer can do can be modelled by a turing machine. >>>> >>> The main difference is that the tape can be modified from outside as the >>> Turing machine is running, in a typical real computer program. >>> >> >> No, the Turing Model does NOT allow a change in the system once started, >> not an fit in the normal course of the theory. >> >> Yes, you could postulate such actions, and even do that with an actual >> program running a Turing Model, but doing so put your outside what >> Turing Theory describes. >> >> You could even pause the machine and change the state machine, doesn't >> mean theory will help you decide what is going to happen. >> > > This provides the basis for all kinds of extensions to Turing's basic > model. > For someone who doesn't understand that basics of Turings Model, proposing extensions is the last thing you want to be doing. First, anything you do in that extended model doesn't neccesarily apply to the 'basic' model, and the whole purpose of the Turing Model is to have a very limited and well behaved computation model to make proofs about. That would totally ruin that feature.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-28 23:09 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <vI6dnWiyz-uMzvz9nZ2dnUU7-aHNnZ2d@giganews.com> |
| In reply to | #30264 |
On 3/28/2021 10:24 PM, Richard Damon wrote: > On 3/28/21 10:59 PM, olcott wrote: >> On 3/28/2021 4:42 PM, Richard Damon wrote: >>> On 3/28/21 5:17 PM, Malcolm McLean wrote: >>>> On Sunday, 28 March 2021 at 22:12:26 UTC+1, Alan Mackenzie wrote: >>>>> olcott <No...@nowhere.com> wrote: >>>>> >>>>>> Hence TM's are not limited to computing pure functions. There can be >>>>>> all kinds of static local data, mutating global data and side effects. >>>>>> Operating system do all these things. >>>>> Yes, and all these things can be modelled by turing machines having the >>>>> global data, etc., modelled as parameters. In a sense, anything a >>>>> computer can do can be modelled by a turing machine. >>>>> >>>> The main difference is that the tape can be modified from outside as the >>>> Turing machine is running, in a typical real computer program. >>>> >>> >>> No, the Turing Model does NOT allow a change in the system once started, >>> not an fit in the normal course of the theory. >>> >>> Yes, you could postulate such actions, and even do that with an actual >>> program running a Turing Model, but doing so put your outside what >>> Turing Theory describes. >>> >>> You could even pause the machine and change the state machine, doesn't >>> mean theory will help you decide what is going to happen. >>> >> >> This provides the basis for all kinds of extensions to Turing's basic >> model. >> > > For someone who doesn't understand that basics of Turings Model, > proposing extensions is the last thing you want to be doing. > > First, anything you do in that extended model doesn't neccesarily apply > to the 'basic' model, and the whole purpose of the Turing Model is to > have a very limited and well behaved computation model to make proofs > about. That would totally ruin that feature. > One of the key extensions to the typical notion of Turing machine that is mandatory for me to present my case is that a UTM can simulate the Turing machine description of another UTM such that this TMD of a UTM simulates its own description to more than one level of recursive depth. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-29 10:48 -0600 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <s3t0di$79f$1@dont-email.me> |
| In reply to | #30268 |
On 2021-03-28 22:09, olcott wrote: > On 3/28/2021 10:24 PM, Richard Damon wrote: >> On 3/28/21 10:59 PM, olcott wrote: >>> On 3/28/2021 4:42 PM, Richard Damon wrote: >>>> On 3/28/21 5:17 PM, Malcolm McLean wrote: >>>>> On Sunday, 28 March 2021 at 22:12:26 UTC+1, Alan Mackenzie wrote: >>>>>> olcott <No...@nowhere.com> wrote: >>>>>> >>>>>>> Hence TM's are not limited to computing pure functions. There can be >>>>>>> all kinds of static local data, mutating global data and side >>>>>>> effects. >>>>>>> Operating system do all these things. >>>>>> Yes, and all these things can be modelled by turing machines >>>>>> having the >>>>>> global data, etc., modelled as parameters. In a sense, anything a >>>>>> computer can do can be modelled by a turing machine. >>>>>> >>>>> The main difference is that the tape can be modified from outside >>>>> as the >>>>> Turing machine is running, in a typical real computer program. >>>>> >>>> >>>> No, the Turing Model does NOT allow a change in the system once >>>> started, >>>> not an fit in the normal course of the theory. >>>> >>>> Yes, you could postulate such actions, and even do that with an actual >>>> program running a Turing Model, but doing so put your outside what >>>> Turing Theory describes. >>>> >>>> You could even pause the machine and change the state machine, doesn't >>>> mean theory will help you decide what is going to happen. >>>> >>> >>> This provides the basis for all kinds of extensions to Turing's basic >>> model. >>> >> >> For someone who doesn't understand that basics of Turings Model, >> proposing extensions is the last thing you want to be doing. >> >> First, anything you do in that extended model doesn't neccesarily apply >> to the 'basic' model, and the whole purpose of the Turing Model is to >> have a very limited and well behaved computation model to make proofs >> about. That would totally ruin that feature. >> > > One of the key extensions to the typical notion of Turing machine that > is mandatory for me to present my case is that a UTM can simulate the > Turing machine description of another UTM such that this TMD of a UTM > simulates its own description to more than one level of recursive depth. So in other words, you can't actually do what you claim to do using Turing Machines. It only works for your 'extended Turing Machines'. But the proofs you claim to be addressing are about actual Turing Machines, not about your 'Extended Turing Machines". That's like me offering a proof that you *can* trisect an angle using only a compass and straightedge by extending the definition of 'compass and straightedge' to include other equipment (mechanical trisectors, protractors, etc.). André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-29 22:30 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <_2w8I.126195$qC1.17116@fx37.iad> |
| In reply to | #30268 |
On 3/29/21 12:09 AM, olcott wrote: > On 3/28/2021 10:24 PM, Richard Damon wrote: >> >> For someone who doesn't understand that basics of Turings Model, >> proposing extensions is the last thing you want to be doing. >> >> First, anything you do in that extended model doesn't neccesarily apply >> to the 'basic' model, and the whole purpose of the Turing Model is to >> have a very limited and well behaved computation model to make proofs >> about. That would totally ruin that feature. >> > > One of the key extensions to the typical notion of Turing machine that > is mandatory for me to present my case is that a UTM can simulate the > Turing machine description of another UTM such that this TMD of a UTM > simulates its own description to more than one level of recursive depth. > Right, you need to create some 'UTM' that isn't really a UTM in order to make your halt decider that isn't really a Halt Decider. Your problem is you don't understand what any of these things actually are and seem to be just running on a jargon file attempting to sound smart.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-29 21:36 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <hqidnTrQ-oVUE__9nZ2dnUU7-eudnZ2d@giganews.com> |
| In reply to | #30320 |
On 3/29/2021 9:30 PM, Richard Damon wrote: > On 3/29/21 12:09 AM, olcott wrote: >> On 3/28/2021 10:24 PM, Richard Damon wrote: >>> >>> For someone who doesn't understand that basics of Turings Model, >>> proposing extensions is the last thing you want to be doing. >>> >>> First, anything you do in that extended model doesn't neccesarily apply >>> to the 'basic' model, and the whole purpose of the Turing Model is to >>> have a very limited and well behaved computation model to make proofs >>> about. That would totally ruin that feature. >>> >> >> One of the key extensions to the typical notion of Turing machine that >> is mandatory for me to present my case is that a UTM can simulate the >> Turing machine description of another UTM such that this TMD of a UTM >> simulates its own description to more than one level of recursive depth. >> > > Right, you need to create some 'UTM' that isn't really a UTM in order to > make your halt decider that isn't really a Halt Decider. > > Your problem is you don't understand what any of these things actually > are and seem to be just running on a jargon file attempting to sound smart. > 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. -- 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 03:39 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <20210329202056.955@kylheku.com> |
| In reply to | #30324 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote:
> On 3/29/2021 9:30 PM, Richard Damon wrote:
>> On 3/29/21 12:09 AM, olcott wrote:
>>> On 3/28/2021 10:24 PM, Richard Damon wrote:
>>>>
>>>> For someone who doesn't understand that basics of Turings Model,
>>>> proposing extensions is the last thing you want to be doing.
>>>>
>>>> First, anything you do in that extended model doesn't neccesarily apply
>>>> to the 'basic' model, and the whole purpose of the Turing Model is to
>>>> have a very limited and well behaved computation model to make proofs
>>>> about. That would totally ruin that feature.
>>>>
>>>
>>> One of the key extensions to the typical notion of Turing machine that
>>> is mandatory for me to present my case is that a UTM can simulate the
>>> Turing machine description of another UTM such that this TMD of a UTM
>>> simulates its own description to more than one level of recursive depth.
>>>
>>
>> Right, you need to create some 'UTM' that isn't really a UTM in order to
>> make your halt decider that isn't really a Halt Decider.
>>
>> Your problem is you don't understand what any of these things actually
>> are and seem to be just running on a jargon file attempting to sound smart.
>>
>
> 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^.
The way you have achieved it is trivially true; not true in a way that
you can dispute any proof.
It is trivially true because in your program, H_Hat calls a different
decider from the one called in main.
Every time Halts is called in your code, even by the same line of code,
it is a different function, because the global information it depends on
has changed.
If we can use different deciders, we correctly decide this case; it
"off the diagonal", in Cantor terms.
In the following illustration, two different deciders are used,
Halts_One, and Halts_Two.
H_Hat(P)
{
if (Halts_One(P, P))
for(;;) { }
}
main()
{
Input_Halts = Halts_Two(H_Hat, H_Hat);
// ..
}
It could easily be arranged that if H_Hat(H_Hat) is called,
Halts_One returns 1 to H_Hat, which goes into a loop. And Halts_Two
could return 0 to correctly indicate the fact that H_Hat(H_Hat)
doesn't halt.
This is precisely the case in your program. Except you have done it
in an elaborately goofy way, somewhat equivalent to this:
#define Halts_One(P, I) Halts(P, I, GetCurrentTrace())
#define Halts_Two(P, I) Halts(P, I, GetCurrentTrace())
You have only "one" Halts function, but it becomes different function
each time it is called due to accessing global state based on which its
behavior changes, as if it had a hidden third argument that is
always changing.
When Halts is called from H_Hat, the previosly stored execution trace
informs it that it's called by the same function that it is being asked
to decide. When it's called from main, there is no such trace.
That is all wrongheaded and incorrect; you must have one Halts which
runs in a blank slate, with access to nothing but its arguments.
Otherwise your appartus is not equivalent to the proof.
You will not get anywhere with this buffoonery with CS academia.
This Usenet newsgroup is it; this is the hill you're going to die on.
...
"So Sally and I did not know what to do;
we had to shake hands with Halts_One and Halts_Two"
-- "Ol' Cott in the Hat"
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-29 22:51 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <uc-dnTZHvsKqPf_9nZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #30329 |
On 3/29/2021 10:39 PM, Kaz Kylheku wrote: > On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> On 3/29/2021 9:30 PM, Richard Damon wrote: >>> On 3/29/21 12:09 AM, olcott wrote: >>>> On 3/28/2021 10:24 PM, Richard Damon wrote: >>>>> >>>>> For someone who doesn't understand that basics of Turings Model, >>>>> proposing extensions is the last thing you want to be doing. >>>>> >>>>> First, anything you do in that extended model doesn't neccesarily apply >>>>> to the 'basic' model, and the whole purpose of the Turing Model is to >>>>> have a very limited and well behaved computation model to make proofs >>>>> about. That would totally ruin that feature. >>>>> >>>> >>>> One of the key extensions to the typical notion of Turing machine that >>>> is mandatory for me to present my case is that a UTM can simulate the >>>> Turing machine description of another UTM such that this TMD of a UTM >>>> simulates its own description to more than one level of recursive depth. >>>> >>> >>> Right, you need to create some 'UTM' that isn't really a UTM in order to >>> make your halt decider that isn't really a Halt Decider. >>> >>> Your problem is you don't understand what any of these things actually >>> are and seem to be just running on a jargon file attempting to sound smart. >>> >> >> 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^. > > The way you have achieved it is trivially true; not true in a way that > you can dispute any proof. On 3/29/2021 8:54 PM, olcott wrote: > On 3/29/2021 8:43 PM, Ben Bacarisse wrote:>> >> ... if H is only "based on" simulating its input. H^(H^) is not a >> halting computation > > Hence humans can correctly decide halting on H^(H^) even though it seems > to have a liar paradox like structure this liar paradox like structure > is totally moot to any (at least partial) halt decider that bases its > halting decision on simulating its input. > > That I have shown that the liar paradox like structure of the halting > problem counter-examples has always been totally moot by itself is a > huge breakthrough. > Without changing the definition of H^ in the tiniest little bit I have shown that it specifies infinite recursion: http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-30 05:28 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <20210329211550.916@kylheku.com> |
| In reply to | #30330 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > Without changing the definition of H^ in the tiniest little bit I have > shown that it specifies infinite recursion: That is untrue. What H^ specifies depends on the nature of H, because the bulk of H^ is the sub-function H. Infinite recursion obviously occurs for if we choose H which is just a trivial dispatcher that invokes P(I). It's obvious by simple substitution of terms that since: H^(H^) calls H(H^, H^) and H(P, I) = P(I) it must be that: H^(H^) calls H^(^H) If H is chosen in some other ways, then that doesn't hold. The author of H^ doesn't constrain how H is to be defined, other than that it's a two-argument pure function returning a Boolean, whose P argument is a function similar to H^, and so forth. -- 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 09:20 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) |
| Message-ID | <oLydnQPuAMc8rv79nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #30334 |
On 3/30/2021 12:28 AM, Kaz Kylheku wrote:
> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote:
>> Without changing the definition of H^ in the tiniest little bit I have
>> shown that it specifies infinite recursion:
>
> That is untrue.
>
> What H^ specifies depends on the nature of H, because the bulk of H^ is
> the sub-function H.
http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf
Whenever H is a simulator then H^ <is> infinitely recursive never
reaching the appended loop states whether or not the simulator always
returns a value of true or false.
This by itself proves that the famous:
"do the opposite of whatever the halt decider decides"
Now we construct a new Turing machine D with H as a
subroutine. This new TM calls H to determine what M
does when the input to M is its own description <M>.
Once D has determined this information, it does the
opposite.
That is, it rejects if M accepts and accepts
if M does not accept. (Sipser 1997:165)
Never has had any effect on halting problem undecidability
because no halt decider would ever return any value to H^.
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
>
> Infinite recursion obviously occurs for if we choose H which is just a
> trivial dispatcher that invokes P(I).
>
> It's obvious by simple substitution of terms that since:
>
> H^(H^) calls H(H^, H^)
>
> and
>
> H(P, I) = P(I)
>
> it must be that:
>
> H^(H^) calls H^(^H)
>
> If H is chosen in some other ways, then that doesn't hold.
>
> The author of H^ doesn't constrain how H is to be defined, other
> than that it's a two-argument pure function returning a Boolean,
> whose P argument is a function similar to H^, and so forth.
>
--
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 15:03 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) |
| Message-ID | <20210330075406.357@kylheku.com> |
| In reply to | #30344 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > On 3/30/2021 12:28 AM, Kaz Kylheku wrote: >> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >>> Without changing the definition of H^ in the tiniest little bit I have >>> shown that it specifies infinite recursion: >> >> That is untrue. >> >> What H^ specifies depends on the nature of H, because the bulk of H^ is >> the sub-function H. > > http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf > > Whenever H is a simulator then H^ <is> infinitely recursive never > reaching the appended loop states whether or not the simulator always > returns a value of true or false. H is not required to be a simulator. If H simply executes its input, we know that it fails to decide due to runaway recursion: the input calls the decider, which executes its input, which calls the decider. This is freshman-level obvious. The first materials I ever read about the halting problem spelled this out, for the dummies. > Never has had any effect on halting problem undecidability Not returning is completely, utterly relevant to undecidability. The undecidability of halting means that a decision function can only decide at most a subset of the possible cases, not all of them. Outside of the subset which it decides, it misbehaves in one of several ways: it either returns the wrong answer, or fails to halt, or else something else, like failing due to a division by zero or similar problem. Runaway recursion falls under "fails to halt"; it's a failed case. > because no halt decider would ever return any value to H^. Except in your program, where a "pure function" sometimes returns a value and sometimes doesn't, for the same pair of visible 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 10:08 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) |
| Message-ID | <bN-dnYc9lNhpo_79nZ2dnUU7-LednZ2d@giganews.com> |
| In reply to | #30349 |
On 3/30/2021 10:03 AM, Kaz Kylheku wrote: > On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> On 3/30/2021 12:28 AM, Kaz Kylheku wrote: >>> On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >>>> Without changing the definition of H^ in the tiniest little bit I have >>>> shown that it specifies infinite recursion: >>> >>> That is untrue. >>> >>> What H^ specifies depends on the nature of H, because the bulk of H^ is >>> the sub-function H. >> >> http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf >> >> Whenever H is a simulator then H^ <is> infinitely recursive never >> reaching the appended loop states whether or not the simulator always >> returns a value of true or false. > > H is not required to be a simulator. > > If H simply executes its input, we know that it fails to decide due to > runaway recursion: the input calls the decider, which executes its > input, which calls the decider. > > This is freshman-level obvious. > > The first materials I ever read about the halting problem spelled this > out, for the dummies. > >> Never has had any effect on halting problem undecidability > > Not returning is completely, utterly relevant to undecidability. (1) It proves infinite recursion thus H^(H^) is decided as not halting. (2) It proves that the infinite loop states appended to the end never made any difference. -- 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 15:33 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (HP undecidability) |
| Message-ID | <20210330083224.562@kylheku.com> |
| In reply to | #30350 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: >> Not returning is completely, utterly relevant to undecidability. > > (1) It proves infinite recursion thus H^(H^) is decided as not halting. It doesn't, because the proof involves returning 0 for exactly the same inputs that are supposedly infinitely recursive. How that works is that you have different deciders. H_Hat infinitely recurses with one decider, and the one which returns 0 for that case is a different decider. They are the same machine-language procedure at the same address, but the hidden global state makes them different.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-30 08:13 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <CBE8I.43324$RS3.29228@fx18.iad> |
| In reply to | #30330 |
On 3/29/21 11:51 PM, olcott wrote: > Without changing the definition of H^ in the tiniest little bit I have > shown that it specifies infinite recursion: > > http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf > Except that the 'machine' it wraps in your code isn't a Computation and thus isn't the equivalent of a Turing Machine, and you are running it in a system that isn't Turing Complete. Changing the definitions at the base of the system invalidates the ability to apply the results to the original question.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 09:47 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <9ZadnYwf29qUp_79nZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #30338 |
On 3/30/2021 7:13 AM, Richard Damon wrote: > On 3/29/21 11:51 PM, olcott wrote: > >> Without changing the definition of H^ in the tiniest little bit I have >> shown that it specifies infinite recursion: >> >> http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf >> > > Except that the 'machine' it wraps in your code isn't a Computation and > thus isn't the equivalent of a Turing Machine, and you are running it in > a system that isn't Turing Complete. > When we 100% forget everything that I ever said then the fact that a halt decider implemented as a simulator that returns either true or false when it completels proves that the H^ infinite loop states are never reached because every halting problem counter-example specifies infinite recursion. The H^(H^) of the Linz proof exactly as it is specifies infinite recursion when it is simulated exactly as it is. > Changing the definitions at the base of the system invalidates the > ability to apply the results to the original question. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-30 16:32 +0100 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <87sg4codwp.fsf@bsb.me.uk> |
| In reply to | #30348 |
olcott <NoOne@NoWhere.com> writes: > When we 100% forget everything that I ever said then the fact that a > halt decider implemented as a simulator that returns either true or > false when it completels proves that the H^ infinite loop states are > never reached because every halting problem counter-example specifies > infinite recursion. No one is forgetting that. You have been very clear. > The H^(H^) of the Linz proof exactly as it is specifies infinite > recursion when it is simulated exactly as it is. But this is a junk sentence. The H^ of Linz's proof does not exist. It is a hypothetical TM constructed from a non-existent TM. And TM's don't "recurse". What you mean is that UTM^(UTM^) is a non-halting computation -- i.e. applying the "hat" construction to a "simulator" (specifically a UTM) makes a non-halting computation. Calling the UTM 'H' just so you can pretend this has something to do with your argument is silly, though you need to do that is you are trying to bury the trick you are pulling (so that would be dishonest rather than just silly). When translated back into the world of TMs, you have two: one is a proper simulator, UTM, and the other, Halts, stops some computations mid-simulation. You've rolled these into one in the C sketches, but they are different TMs. Halts(UTM^, UTM^) correctly reports that UTM^(UTM^) is not a finite computation, but Halts^(Halts^) is a different, finite, computation. Anyway, you've made it clear again that UTM^(UTM^) and Halts^(Halts^) are different computations. And I see you've also posted Halts again (in a variation) that also makes the ruse clear. Well done. I don't think you are trying to hide what you are now doing. I think the obfuscation is accidental. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-30 10:46 -0500 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <39CdnZWAkOck2v79nZ2dnUU7-Vdj4p2d@giganews.com> |
| In reply to | #30354 |
On 3/30/2021 10:32 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> When we 100% forget everything that I ever said then the fact that a >> halt decider implemented as a simulator that returns either true or >> false when it completels proves that the H^ infinite loop states are >> never reached because every halting problem counter-example specifies >> infinite recursion. > > No one is forgetting that. You have been very clear. > >> The H^(H^) of the Linz proof exactly as it is specifies infinite >> recursion when it is simulated exactly as it is. > > But this is a junk sentence. The H^ of Linz's proof does not exist. The point is that it is categorically impossible for any H to ever return any value to H^. No one ever noticed that before. -- 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 15:56 +0000 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <20210330084759.763@kylheku.com> |
| In reply to | #30357 |
On 2021-03-30, olcott <NoOne@NoWhere.com> wrote: > On 3/30/2021 10:32 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> When we 100% forget everything that I ever said then the fact that a >>> halt decider implemented as a simulator that returns either true or >>> false when it completels proves that the H^ infinite loop states are >>> never reached because every halting problem counter-example specifies >>> infinite recursion. >> >> No one is forgetting that. You have been very clear. >> >>> The H^(H^) of the Linz proof exactly as it is specifies infinite >>> recursion when it is simulated exactly as it is. >> >> But this is a junk sentence. The H^ of Linz's proof does not exist. > > The point is that it is categorically impossible for any H to ever > return any value to H^. That is false; your remark of specific types of H; those which execute the input in some way. > No one ever noticed that before. If a halting decision function simply executes its input to see whether it will halt, then the H^ program will cause runaway recursion: this is completely obvious. You have no proof of your cringe-inducing claim of having observed this first. It's very hard to prove a negatively quantified statement; it can requires an exhaustive search. You've not done that research. The first textbook I read about the halting problem mentioned this; that if the decider simply calls the function, then it succumbs to cases when the function itself fails to halt, and that precisely such a thing happens in the attack function, which becomes infinitely recursive. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-30 12:37 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <qtI8I.26523$MJ5.20923@fx12.iad> |
| In reply to | #30357 |
On 3/30/21 11:46 AM, olcott wrote: > On 3/30/2021 10:32 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> When we 100% forget everything that I ever said then the fact that a >>> halt decider implemented as a simulator that returns either true or >>> false when it completels proves that the H^ infinite loop states are >>> never reached because every halting problem counter-example specifies >>> infinite recursion. >> >> No one is forgetting that. You have been very clear. >> >>> The H^(H^) of the Linz proof exactly as it is specifies infinite >>> recursion when it is simulated exactly as it is. >> >> But this is a junk sentence. The H^ of Linz's proof does not exist. > > The point is that it is categorically impossible for any H to ever > return any value to H^. No one ever noticed that before. > A H that doesn't return an answer for some input is by definition a failed decider. It doesn't matter that no answer is right, that just proves that there can be no such decider.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-30 12:36 -0400 |
| Subject | Re: A UTM halt decider <is> a pure function of its inputs (Misinterpretation?) |
| Message-ID | <2sI8I.26522$MJ5.12348@fx12.iad> |
| In reply to | #30348 |
On 3/30/21 10:47 AM, olcott wrote: > On 3/30/2021 7:13 AM, Richard Damon wrote: >> On 3/29/21 11:51 PM, olcott wrote: >> >>> Without changing the definition of H^ in the tiniest little bit I have >>> shown that it specifies infinite recursion: >>> >>> http://www.liarparadox.org/Peter_Linz_HP(Pages_318-319).pdf >>> >> >> Except that the 'machine' it wraps in your code isn't a Computation and >> thus isn't the equivalent of a Turing Machine, and you are running it in >> a system that isn't Turing Complete. >> > > When we 100% forget everything that I ever said then the fact that a > halt decider implemented as a simulator that returns either true or > false when it completels proves that the H^ infinite loop states are > never reached because every halting problem counter-example specifies > infinite recursion. > > The H^(H^) of the Linz proof exactly as it is specifies infinite > recursion when it is simulated exactly as it is. > If H^(H^) is infinitely recursive in the sequence H^(H^) -> H(H^, H^) -> H^(H^) -> H(H^,H^) -> ... and nothing will break the sequence, then by the rule of Computations H(H, H^) -> H^(H^) -> H(H^, H^) -> ... Must also be. That means that H(H^, H^) can NOT give an answer to the question, and thus H is not a decider. If H(H^, H^) does give an answer, then it must give that same answer in the first case, and thus the infinite recursion that was though to be wasn't actually there. You proof is broken. Note, if your system can actually PROVE that H^(H^) is an infinite recursion, then by combining that with this above proof that it is halting (assuming you still claim that H(H^, H^) gives an answer) is proof that your logic system has gone inconsistant, as we have met the definition of inconstancy by prove a statement and it converse. Unless you can show a ACTUAL fallacy in my argument (what have I taken as a fact that isn't or used an erroneous logical argument), you have just shown that either YOUR arguement is in error or you have created an inconsistent system with one of your assumptions. Personally, I see the error in your argument by ignoring the conditional inside halts when analyzing your trace.
[toc] | [prev] | [next] | [standalone]
Page 31 of 36 — ← Prev page 1 … 29 30 [31] 32 33 … 36 Next page →
Back to top | Article view | comp.theory
csiph-web