Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #27719 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-01-02 12:12 -0600 |
| Last post | 2021-01-05 21:55 +0000 |
| Articles | 20 on this page of 320 — 12 participants |
Back to article view | Back to comp.theory
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 12:12 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 13:54 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 13:12 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 14:36 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 13:42 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 15:16 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-02 20:04 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-02 19:14 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-02 23:06 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 18:38 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-03 00:25 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-02 20:33 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 01:12 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-03 20:58 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 02:19 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-03 22:59 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-03 20:23 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-04 23:57 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Andy Walker <anw@cuboid.co.uk> - 2021-01-04 11:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-04 07:10 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Andy Walker <anw@cuboid.co.uk> - 2021-01-04 14:52 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-04 13:58 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-04 20:49 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-04 20:39 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-04 21:46 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 10:01 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 12:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 19:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 13:37 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 15:42 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 16:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 23:52 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-05 23:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 07:55 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 13:17 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 21:48 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 16:38 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 05:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 11:57 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:05 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) André G. Isaak <agisaak@gm.invalid> - 2021-01-07 12:25 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:41 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:45 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 18:45 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 18:11 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 01:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 21:14 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:49 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-08 13:38 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 19:59 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 17:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 00:59 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:47 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 18:00 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Richard Damon <Richard@Damon-Family.org> - 2021-01-08 16:13 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) olcott <NoOne@NoWhere.com> - 2021-01-07 10:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 11:38 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 21:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) olcott <NoOne@NoWhere.com> - 2021-01-07 16:31 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 00:49 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 01:00 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 21:09 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-07 03:20 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 22:14 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-07 08:48 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-08 02:23 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 17:58 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) André G. Isaak <agisaak@gm.invalid> - 2021-01-08 14:34 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 15:59 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 02:22 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 20:35 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 03:31 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 21:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 04:39 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 23:08 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Jeff Barnett <jbb@notatt.com> - 2021-01-08 22:36 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 05:39 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 23:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 07:05 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 17:30 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 11:58 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 18:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 12:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 20:07 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 15:25 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-01-09 21:46 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 22:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 17:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-09 18:41 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 14:04 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-10 16:27 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 22:46 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 15:11 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Jeff Barnett <jbb@notatt.com> - 2021-01-10 18:01 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-10 20:17 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-11 03:08 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 18:53 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 13:35 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:01 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 14:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:19 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 13:54 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:17 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 14:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-11 18:25 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Pathological Self-Reference) olcott <NoOne@NoWhere.com> - 2021-01-11 19:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-11 18:10 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 17:46 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 00:36 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 20:41 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Richard Damon <Richard@Damon-Family.org> - 2021-01-11 19:49 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 20:46 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) Richard Damon <Richard@Damon-Family.org> - 2021-01-11 22:32 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 09:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:10 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 10:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:38 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 12:43 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](decider defined) olcott <NoOne@NoWhere.com> - 2021-01-12 19:14 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](decider defined) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 20:51 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 08:45 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 12:32 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](actual behavior) olcott <NoOne@NoWhere.com> - 2021-01-12 19:44 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](actual behavior) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:01 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 11:03 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 13:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-12 12:24 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](laser focused) olcott <NoOne@NoWhere.com> - 2021-01-12 18:32 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:27 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 12:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 19:51 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 14:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 20:17 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-11 22:23 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Jeff Barnett <jbb@notatt.com> - 2021-01-10 22:31 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 22:20 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:51 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 23:22 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 01:03 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 10:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 11:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Richard Damon <Richard@Damon-Family.org> - 2021-01-12 13:01 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 12:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 02:30 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-09 03:46 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-09 08:12 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 10:33 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 13:57 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 13:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 16:46 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 16:31 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-09 18:35 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-01-09 17:22 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 19:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 02:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 23:12 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 09:48 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 08:40 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-10 05:53 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:34 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 15:09 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 17:43 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 19:01 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 13:00 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 09:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:23 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 10:31 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 11:53 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:32 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 12:59 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 20:07 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 14:49 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 21:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 16:47 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-12 14:50 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 23:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 00:31 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 01:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:05 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:21 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 15:16 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:30 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 21:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 22:35 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 14:47 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 13:57 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 20:37 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 15:16 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 00:05 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 19:05 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 02:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 04:03 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-13 22:34 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 07:26 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:08 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 10:21 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:32 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 11:00 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 10:48 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 00:58 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:09 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:06 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 16:54 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 11:22 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 19:25 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 12:58 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:28 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 13:55 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 19:57 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 01:34 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:45 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:01 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:31 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 01:51 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:22 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 03:09 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 21:28 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 03:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-12 22:27 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) André G. Isaak <agisaak@gm.invalid> - 2021-01-12 22:53 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 00:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-13 02:35 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 11:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 07:49 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-13 05:21 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 20:59 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 15:27 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 21:38 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 16:22 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Andy Walker <anw@cuboid.co.uk> - 2021-01-14 15:14 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 09:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) Andy Walker <anw@cuboid.co.uk> - 2021-01-14 17:06 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:25 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 19:40 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 14:51 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 09:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 19:55 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:58 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 01:20 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 19:55 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 15:35 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:05 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-13 23:59 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 18:57 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 02:23 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:21 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-14 03:42 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-13 22:15 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 08:37 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 09:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 10:47 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 10:41 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 12:55 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 12:16 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 13:47 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-16 15:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 19:48 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-17 05:00 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 01:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-15 01:51 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-15 02:45 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-14 22:25 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 14:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-16 13:24 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 16:04 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:15 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-17 04:46 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-16 15:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Richard Damon <Richard@Damon-Family.org> - 2021-01-16 20:05 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-17 03:14 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-13 21:46 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-09 17:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-10 03:27 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-10 08:11 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 14:57 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:35 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-10 02:22 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Richard Damon <Richard@Damon-Family.org> - 2021-01-06 07:53 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-01-06 09:05 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 13:04 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Richard Damon <Richard@Damon-Family.org> - 2021-01-05 21:31 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 04:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 12:42 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 13:59 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] André G. Isaak <agisaak@gm.invalid> - 2021-01-05 14:03 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 15:33 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:46 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 16:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:43 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:17 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) olcott <NoOne@NoWhere.com> - 2021-01-05 16:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Richard Damon <Richard@Damon-Family.org> - 2021-01-05 17:54 -0500
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) Jeff Barnett <jbb@notatt.com> - 2021-01-05 18:37 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-10 19:02 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Vir Campestris <vir.campestris@invalid.invalid> - 2021-01-05 21:55 +0000
Page 13 of 16 — ← Prev page 1 … 11 12 [13] 14 15 16 Next page →
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-01-13 02:35 -0800 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <accfbabe-3e25-468c-bba9-eea98f98d9c4n@googlegroups.com> |
| In reply to | #27972 |
On Wednesday, 13 January 2021 at 06:39:18 UTC, olcott wrote: > On 1/12/2021 11:53 PM, André G. Isaak wrote: > > Except that all of that code is also part of H_Hat, the program under > > test. Halts() isn't expected to examine its own code. It is, however, > > required to examine *all* of the code of its input program, including > > any code which might be identical to code found in Halts(). > > The advantage to a halt decider that simulates its input is only code > that is reached in the execution trace is examined. Because the call to > Halts() from H_Hat() is either infinitely recursive or aborted in both > of these two possible cases it never returns any value to H_Hat() thus > H_Hat() is unable to take either one of the two paths based on a return > value from Halts() > Halts() doesn't return a value to H_Hat. However if it returns a value to main, it obviously has some input somewhere which modifies its behaviour depending on where it was called from. So Halts is not a Turing machine embedded in H_Hat. I've shown how easy it is to write an H which fulfils the requirements of deciding H_Hat correctly, if we relax the requirement that H be a Turing machine entirely embedded in H_Hat.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-13 11:10 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210113025715.448@kylheku.com> |
| In reply to | #27972 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > The advantage to a halt decider that simulates its input is only code > that is reached in the execution trace is examined. Because the call to > Halts() from H_Hat() is either infinitely recursive or aborted in both > of these two possible cases it never returns any value to H_Hat() thus > H_Hat() is unable to take either one of the two paths based on a return > value from Halts(). Sheer nonsense. If H_Hat(H_Hat) is directly called from main, Halts will return 0 to it, and it will promptly terminate. Only the H_Hat calls in the simulation have no chance to terminate because the simulation is stopped short before the Halts simulations return 0 to them. On 2021-01-10, olcott <NoOne@NoWhere.com> wrote: > On 1/9/2021 8:10 PM, Kaz Kylheku wrote: >> The inner Halts is looking for the same terminating condition, but since >> it is nested, it has no chance to get that far. The outer-most, oldest >> simulation terminates everything first. >> >> Botom line, 0 is the wrong answer: H_Hat(H_Hat) halts. > > It is only the wrong answer if we are asking the question: > Does the input halt on its input? -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-13 07:49 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <h%BLH.4522$Meu7.383@fx17.iad> |
| In reply to | #27972 |
On 1/13/21 1:39 AM, olcott wrote: > On 1/12/2021 11:53 PM, André G. Isaak wrote: >> >> You keep forgetting that in the Linz proof, H_Hat is created by making >> a *copy* of Halts(). > > I do not keep forgetting that. The Sipser proof doesn't do it that way > so I kept the common: "do the opposite of whatever the halt decider > decides" basis of Sipser, Linz and Kozen and discarded some of the > aspects where they diverge. > > My proof has the simplest possible instance of the key > "do the opposite of whatever the halt decider decides" > basis of all of the conventional proofs. > Maybe this shows part of the problem, that you don't really understand Turing Machines. While I would not consider myself an expert on this, but when I read Linz and Sipser proofs, I see essentially the same machine being described by the two of them (just a slight difference in how they express their outputs). Linz uses a very formal mathematical notation, and Sipser is more verbal, but the machine described is still the sames. I will ask you, can you write, as a REAL Turing Machine (not just a computational equivalent) a D with H as a subroutine that doesn't actually contain a copy of H. Maybe you should also read that article where it talks about a program taking its representation as its input, as you don't seem to understand that as well.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-01-13 05:21 -0800 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <e9fdf5db-7055-4607-83f7-3d9bd2f95ca1n@googlegroups.com> |
| In reply to | #27975 |
On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote: > > Maybe you should also read that article where it talks about a program > taking its representation as its input, as you don't seem to understand > that as well. > That's certainly an issue with the DebugTrace. Halts takes P and I. P is a Turing machine description in some notation, and I is any sort of input on a tape with some alphabet. However PO uses machine code as the Turing machine description, and also for I. So P becomes a function pointer that can be called. It's not clear exactly what is being done, but Halts isn't allowed to do this. It is allowed to simulate P, but then it has no way of knowing that P contains a call to Halts. In fact, in Linz's H_Hat, there is no call H, but there is a copy made of the embedded H as part of the copying of H_Hat's input. If H emulates P, as is reasonable, you will get another copy of H_Hat made, and then maybe an infinite accumulation of them, but each copy will be concatenated on the tape, physically distinct. So detecting infinite recursion by looking for calls to the same address won't work.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 14:53 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <0vydnZ1FWeIywGLCnZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #27976 |
On 1/13/2021 7:21 AM, Malcolm McLean wrote: > On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote: >> >> Maybe you should also read that article where it talks about a program >> taking its representation as its input, as you don't seem to understand >> that as well. >> > That's certainly an issue with the DebugTrace. > The program <is> its x86 configuration. I have never show the actual interface to DebugTrace() because it actually requires many more details that would only be confusing when the goal is explaining the gist of what it does. > Halts takes P and I. P is a Turing machine description in some notation, > and I is any sort of input on a tape with some alphabet. > > However PO uses machine code as the Turing machine description, and > also for I. So P becomes a function pointer that can be called. I wanted to make it as much as possible as one UTM simulating the Turing Machine description of another UTM so P is not a function pointer, it is a raw machine address that is manually converted into a virtual machine pointer. > It's not > clear exactly what is being done, but Halts isn't allowed to do this. It is > allowed to simulate P, but then it has no way of knowing that P contains > a call to Halts. In fact, in Linz's H_Hat, there is no call H, but there is a > copy made of the embedded H as part of the copying of H_Hat's > input. If H emulates P, as is reasonable, you will get another copy of > H_Hat made, and then maybe an infinite accumulation of them, Yes I wrote about this back in 2017 and earlier in 2016. Infinitely Recursive input on HP Proofs https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/dhNDYvhFAAAJ > but > each copy will be concatenated on the tape, physically distinct. So > detecting infinite recursion by looking for calls to the same address won't > work. > By proving that the simplest possible example of the: "Do the opposite of whatever the halt decider decides" basis of all the conventional HP undecidability proofs is decidable all of these proof are refuted. -- 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-01-13 20:59 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210113125603.614@kylheku.com> |
| In reply to | #27986 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > On 1/13/2021 7:21 AM, Malcolm McLean wrote: >> On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote: >>> >>> Maybe you should also read that article where it talks about a program >>> taking its representation as its input, as you don't seem to understand >>> that as well. >>> >> That's certainly an issue with the DebugTrace. >> > > The program <is> its x86 configuration. > I have never show the actual interface to DebugTrace() because it > actually requires many more details that would only be confusing when > the goal is explaining the gist of what it does. You're not very good at explaining your stuff. If your goal really is explaining, you are failing miserably. You should write a coherent, detailed paper, with diagrams which are as accurate as possible, accurate code and pseudo code, and carefully written descriptions of everything. Nobody can reconstruct what you're doing from the voluminous Usenet postings. For instance, I think understand the bulk of it, but I could not point a third person to a single source of reference material. Were you never required to document anything in your entire career?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 15:27 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) |
| Message-ID | <EK-dneJgNt8l-GLCnZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #27987 |
On 1/13/2021 2:59 PM, Kaz Kylheku wrote:
> On 2021-01-13, olcott <NoOne@NoWhere.com> wrote:
>> On 1/13/2021 7:21 AM, Malcolm McLean wrote:
>>> On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote:
>>>>
>>>> Maybe you should also read that article where it talks about a program
>>>> taking its representation as its input, as you don't seem to understand
>>>> that as well.
>>>>
>>> That's certainly an issue with the DebugTrace.
>>>
>>
>> The program <is> its x86 configuration.
>> I have never show the actual interface to DebugTrace() because it
>> actually requires many more details that would only be confusing when
>> the goal is explaining the gist of what it does.
>
> You're not very good at explaining your stuff.
>
There is a very good chance that is true.
> If your goal really is explaining, you are failing miserably.
>
I am doing the best that I can. My code explains itself.
> You should write a coherent, detailed paper, with diagrams which are as
> accurate as possible, accurate code and pseudo code, and carefully
> written descriptions of everything.
>
I first must make sure that people can understand the gist of what I am
saying.
> Nobody can reconstruct what you're doing from the voluminous Usenet
> postings.
>
I have encoded Halts() such that it correctly decides not halting for
H_Hat().
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt =", Input_Would_Halt);
}
> For instance, I think understand the bulk of it, but I could not point a
> third person to a single source of reference material.
>
> Were you never required to document anything in your entire career?
>
The code totally explains itself one you understand that this is true:
Infinite Recursion detection AXIOM (self-evident truth)
(a) Within an execution trace
(b) The same function is called
(c) From the same machine address
(d) With the same data // Richard Damon credit
(e) A second time
(f) Without any control flow instructions inbetween
Actually you don't even need to look at the code as soon as you
understand that the above is true and examine the execution trace of
H_Hat() you can immediately comprehend that Halts() can easily correctly
decide not halting on H_Hat().
--
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-01-13 21:38 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) |
| Message-ID | <20210113132751.479@kylheku.com> |
| In reply to | #27989 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > On 1/13/2021 2:59 PM, Kaz Kylheku wrote: >> On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: >>> On 1/13/2021 7:21 AM, Malcolm McLean wrote: >>>> On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote: >>>>> >>>>> Maybe you should also read that article where it talks about a program >>>>> taking its representation as its input, as you don't seem to understand >>>>> that as well. >>>>> >>>> That's certainly an issue with the DebugTrace. >>>> >>> >>> The program <is> its x86 configuration. >>> I have never show the actual interface to DebugTrace() because it >>> actually requires many more details that would only be confusing when >>> the goal is explaining the gist of what it does. >> >> You're not very good at explaining your stuff. >> > There is a very good chance that is true. > >> If your goal really is explaining, you are failing miserably. >> > I am doing the best that I can. My code explains itself. That is possible, but you've revealed very, very little of it. Those revelations are scattered throughout numerous postings in obscure newsgroups in an obscure Usenet. Currently code that explains itself is something that 1. Someone can clone from a remote git repository hosted somewhere. Or at least a tarball. 2. Has build instructions that can be successfully followed to get the software buitl. 3. Test cases or instructions: this is how you run it. >> You should write a coherent, detailed paper, with diagrams which are as >> accurate as possible, accurate code and pseudo code, and carefully >> written descriptions of everything. >> > > I first must make sure that people can understand the gist of what I am > saying. See, there is the problem. You are confusing understanding and agreement. No matter how much understanding people show of your nested simulation constraption, you believe that they are not getting the gist of it if they don't agree that you have refuted a proof. That is an irrational standard just for the purpose of obtaining a check that people are grokking the idea, so that you can then gather it into a better piece of documentation. "People must totally agree with my ideas and results in an ad-hoc, piecewise presentation on Usenet, before I will document them properly in a coherent paper, accompanied by downloadable, buildable code." Oops! Imagine if Linus Torvalds had said, in 1990, "I'm going to post execution traces of my new operating system kernel in Usenet, along with some snippets of code here and there. Once everyone agrees that this is the next generation Unix-like kernel on which they can deploy their server infrastructure, I will post the source code and documentation. Until then, I will endlessly argue with naysayers, and poke at the code here and there." would we have Linux today? >> Nobody can reconstruct what you're doing from the voluminous Usenet >> postings. >> > > I have encoded Halts() such that it correctly decides not halting for > H_Hat(). > > void H_Hat(u32 P) But this is just another fragment lost in a Usenet posting nobody will dig up again a week from now. >> For instance, I think understand the bulk of it, but I could not point a >> third person to a single source of reference material. >> >> Were you never required to document anything in your entire career? >> > > The code totally explains itself one you understand that this is true: See? "Understand that this is true", not "understand how the contraption works". -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 16:22 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) |
| Message-ID | <sOWdne9KD7om72LCnZ2dnUU7-RnNnZ2d@giganews.com> |
| In reply to | #27990 |
On 1/13/2021 3:38 PM, Kaz Kylheku wrote: > On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: >> On 1/13/2021 2:59 PM, Kaz Kylheku wrote: >>> On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: >>>> On 1/13/2021 7:21 AM, Malcolm McLean wrote: >>>>> On Wednesday, 13 January 2021 at 12:49:21 UTC, Richard Damon wrote: >>>>>> >>>>>> Maybe you should also read that article where it talks about a program >>>>>> taking its representation as its input, as you don't seem to understand >>>>>> that as well. >>>>>> >>>>> That's certainly an issue with the DebugTrace. >>>>> >>>> >>>> The program <is> its x86 configuration. >>>> I have never show the actual interface to DebugTrace() because it >>>> actually requires many more details that would only be confusing when >>>> the goal is explaining the gist of what it does. >>> >>> You're not very good at explaining your stuff. >>> >> There is a very good chance that is true. >> >>> If your goal really is explaining, you are failing miserably. >>> >> I am doing the best that I can. My code explains itself. > > That is possible, but you've revealed very, very little of it. > > Those revelations are scattered throughout numerous postings in > obscure newsgroups in an obscure Usenet. > > Currently code that explains itself is something that > > 1. Someone can clone from a remote git repository hosted somewhere. > Or at least a tarball. > > 2. Has build instructions that can be successfully followed to > get the software buitl. > > 3. Test cases or instructions: this is how you run it. > Yes I am working towards that. I have all three modes fully operational. >>> You should write a coherent, detailed paper, with diagrams which are as >>> accurate as possible, accurate code and pseudo code, and carefully >>> written descriptions of everything. >>> >> >> I first must make sure that people can understand the gist of what I am >> saying. > > See, there is the problem. You are confusing understanding and > agreement. If you understand that 2 + 3 = 5 is necessarily true then you necessarily agree that it is true because that is the way that logical necessity works. It is the exact same thing with my proof. > No matter how much understanding people show of your nested simulation > constraption, you believe that they are not getting the gist of it > if they don't agree that you have refuted a proof. > With logical necessity one either agrees or one fails to understand. > That is an irrational standard just for the purpose of obtaining > a check that people are grokking the idea, so that you can then > gather it into a better piece of documentation. > The first priority is to get the code as clean as possible. The next priority is to document the code the way that you suggested. The next priority is to write an academic paper based on the code. The next priority is to get the academic paper and the code reviewed by computer scientists in the field. The final priority is to strive to get the paper based on the code published. > "People must totally agree with my ideas and results in an ad-hoc, > piecewise presentation on Usenet, before I will document them properly > in a coherent paper, accompanied by downloadable, buildable code." > If you would very carefully examine this execution trace: Output_Debug_Trace() [0001112e] size(124) capacity(65536) [0000087e](01) 55 push ebp [0000087f](02) 8bec mov ebp,esp [00000881](01) 51 push ecx [00000882](05) 684e080000 push 0000084e [00000887](05) 684e080000 push 0000084e [0000088c](05) e8ddfdffff call 0000066e ;CALL Halts(H_Hat, H_Hat) [0000084e](01) 55 push ebp [0000084f](02) 8bec mov ebp,esp [00000851](01) 51 push ecx [00000852](03) 8b4508 mov eax,[ebp+08] [00000855](01) 50 push eax [00000856](03) 8b4d08 mov ecx,[ebp+08] [00000859](01) 51 push ecx [0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat, H_Hat) [0000084e](01) 55 push ebp [0000084f](02) 8bec mov ebp,esp [00000851](01) 51 push ecx [00000852](03) 8b4508 mov eax,[ebp+08] [00000855](01) 50 push eax [00000856](03) 8b4d08 mov ecx,[ebp+08] [00000859](01) 51 push ecx [0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat, H_Hat) With this axiom: Infinite Recursion detection AXIOM (self-evident truth) (a) Within an execution trace (b) The same function is called (c) From the same machine address (d) With the same data // Richard Damon credit (e) A second time (f) Without any control flow instructions inbetween paying as much attention as if I was a famous computer scientist that is probably correct then it would be totally obvious that I am correct. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-01-14 15:14 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <rtpn4c$1ijd$1@gioia.aioe.org> |
| In reply to | #27986 |
On 13/01/2021 20:53, olcott wrote:
> By proving that the simplest possible example of the:
> "Do the opposite of whatever the halt decider decides"
> basis of all the conventional HP undecidability proofs
> is decidable all of these proof are refuted.
??? No-one doubts that the "Do the opposite ..." instance
is decidable. The point is that it is decided incorrectly by the
[purported] halt decider under test*. That is enough to show the
undecidability of the HP. What other [claimed] halt deciders or
simulators or ... do, whether to this instance or any other, is
irrelevant.
_____
* If it isn't, then either your "H" is not a halt decider or else
"H_hat" is incorrectly/illegally constructed from "H".
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Nevin
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 09:23 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) |
| Message-ID | <VI2dnYlNi4Ri_J39nZ2dnUU7-fnNnZ2d@giganews.com> |
| In reply to | #28010 |
On 1/14/2021 9:14 AM, Andy Walker wrote: > On 13/01/2021 20:53, olcott wrote: >> By proving that the simplest possible example of the: >> "Do the opposite of whatever the halt decider decides" >> basis of all the conventional HP undecidability proofs >> is decidable all of these proof are refuted. > > ??? No-one doubts that the "Do the opposite ..." instance > is decidable. The point is that it is decided incorrectly by the > [purported] halt decider under test*. That is enough to show the > undecidability of the HP. What other [claimed] halt deciders or > simulators or ... do, whether to this instance or any other, is > irrelevant. > The mistake that you continue to make over and over and over is that you keep presuming that the question is: Does the input halt on its input? I have corrected people on this many times and every time they short circuit to the same mistake. When we ask the question: Would the input program on its input be infinitely recursive if this infinite recursion was not stopped? the code that stops the otherwise infinite recursion is not part of the code that is under test because this code is never reached (thus not in the execution trace) until after the decision on the program under test has already been made. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-01-14 17:06 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) |
| Message-ID | <rtptn7$13mr$1@gioia.aioe.org> |
| In reply to | #28013 |
On 14/01/2021 15:23, olcott wrote:
>>> By proving that the simplest possible example of the:
>>> "Do the opposite of whatever the halt decider decides"
>>> basis of all the conventional HP undecidability proofs
>>> is decidable all of these proof are refuted.
>> ??? No-one doubts that the "Do the opposite ..." instance
>> is decidable. The point is that it is decided incorrectly by the
>> [purported] halt decider under test*. That is enough to show the
>> undecidability of the HP. What other [claimed] halt deciders or
>> simulators or ... do, whether to this instance or any other, is
>> irrelevant.
> The mistake that you continue to make over and over and over is that
> you keep presuming that the question is: Does the input halt on its
> input?
Any other question is either equivalent to that one or is
not of any relevance whatsoever to the HP. [By "equivalent", I
include related problems such as the blank tape HP and the uniform
HP that are solved by reduction to or from the standard HP.] Feel
free to pursue other questions, but please don't pretend that they
have anything to do with standard proofs in standard texts.
> I have corrected people on this many times and every time they short
> circuit to the same mistake.
> When we ask the question: Would the input program on its input be
> infinitely recursive if this infinite recursion was not stopped?
That is either the same question re-stated [in which case
the mistake is not mine], or is a different question of no great
interest to anyone involved in theoretical CompSci. Unless, that
is, you can find some point of interest; you haven't thus far.
"Recursion", let alone "infinite recursion" is your own
invention in relation to the HP. If you /choose/ to write a
recursive [purported] halt decider, that is your decision, but
please don't pretend that is a necessary feature either of
programs that don't halt or of ways of analysing them. If a
purported halt decider /in fact/ is "infinitely recursive",
then that already shows that it is incorrect.
Meanwhile, you may come to realise that the "difficult"
cases for halt deciders are not those that are or would be
"infinitely recursive", but those that halt after a very long
time, so that neither a simulation nor an analysis can resolve
the issue. Hence the relevance of Busy Beaver -- if the BB
function was computable, we would know how long a simulation
had to run before it was known not to complete.
> the code that stops the otherwise infinite recursion is not part of
> the code that is under test because this code is never reached (thus
> not in the execution trace) until after the decision on the program
> under test has already been made.
(a) Determining whether code is ever reached, and if so
when, is one of the many problems equivalent to the HP. (b) Any
code that is part of "H", reached or not, is, by the standard
construction, also part of "H_hat", and therefore of both the
decider and the program under test.
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Nevin
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 11:25 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) |
| Message-ID | <_qednbBqgr7z4539nZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #28020 |
On 1/14/2021 11:06 AM, Andy Walker wrote: > On 14/01/2021 15:23, olcott wrote: >>>> By proving that the simplest possible example of the: >>>> "Do the opposite of whatever the halt decider decides" >>>> basis of all the conventional HP undecidability proofs >>>> is decidable all of these proof are refuted. >>> ??? No-one doubts that the "Do the opposite ..." instance >>> is decidable. The point is that it is decided incorrectly by the >>> [purported] halt decider under test*. That is enough to show the >>> undecidability of the HP. What other [claimed] halt deciders or >>> simulators or ... do, whether to this instance or any other, is >>> irrelevant. >> The mistake that you continue to make over and over and over is that >> you keep presuming that the question is: Does the input halt on its >> input? > > Any other question is either equivalent to that one or is > not of any relevance whatsoever to the HP. On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > ... the question "Does the simulation of the > input have to be stopped to prevent its otherwise infinite > execution" is, itself, the classical halting problem. Although the above question divides inputs into halting and not halting when the original question: Does the input halt on its input? is applied to a halt decider based on the above question it conflates halting inputs with not-halting inputs and calls them both halting. -- 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-01-14 17:10 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) |
| Message-ID | <20210114085532.434@kylheku.com> |
| In reply to | #28013 |
["Followup-To:" header set to comp.theory.] On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: > On 1/14/2021 9:14 AM, Andy Walker wrote: >> On 13/01/2021 20:53, olcott wrote: >>> By proving that the simplest possible example of the: >>> "Do the opposite of whatever the halt decider decides" >>> basis of all the conventional HP undecidability proofs >>> is decidable all of these proof are refuted. >> >> ??? No-one doubts that the "Do the opposite ..." instance >> is decidable. The point is that it is decided incorrectly by the >> [purported] halt decider under test*. That is enough to show the >> undecidability of the HP. What other [claimed] halt deciders or >> simulators or ... do, whether to this instance or any other, is >> irrelevant. >> > > The mistake that you continue to make over and over and over is that you > keep presuming that the question is: Does the input halt on its input? > > I have corrected people on this many times and every time they short > circuit to the same mistake. I do not accept any other question. I understand the other question and I understand why you're insisting on it. Taken by itself, it is a poor definition of the halting problem. More importantly to your work, it doesn't match the halting problem. > When we ask the question: Would the input program on its input be > infinitely recursive if this infinite recursion was not stopped? Nobody who knows a thing or two about mathematic or logic will accept this kind of moronic sentence. You will not convince anyone who is not crazy or stupid, like yourself. The proposed question is exactly like asking "would the number 3 still be odd if we simulated it in binary, and masked out its bottom bit?" You know that Usenet tolerates has crazy and stupid people, which is why you are presenting your ideas here. This environment both allows you to persist (you would be banned in any modern Internet forum) and gives you a fighting chance at finding a few other crazy/stupid people who will nod their heads to your ideas, and accept your crazy redefined questions and the whole thing. When we ask this question, we must akcnowledge that we are doing one of three things: 1) Using very sloppy, informal language to try to say exactly the same thing as the question in the real halting problem. 2) Playing word semantic games that perpetrate equivocation, because we have in mind a particular simulation apparatus in which functions hange their behavior based on a hidden "mode" input, so that a function's recursion is *acually* stopped, yet we continue to insist that it's the same function due to having the same machine code and same inputs (other than that mode input). 3) Naively saying something completely stupid, like "would the number 3 still be odd if we simulated it in binary and cleared the LSB." -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 11:26 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) |
| Message-ID | <_qednbNqgr4w4539nZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #28021 |
On 1/14/2021 11:10 AM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >> On 1/14/2021 9:14 AM, Andy Walker wrote: >>> On 13/01/2021 20:53, olcott wrote: >>>> By proving that the simplest possible example of the: >>>> "Do the opposite of whatever the halt decider decides" >>>> basis of all the conventional HP undecidability proofs >>>> is decidable all of these proof are refuted. >>> >>> ??? No-one doubts that the "Do the opposite ..." instance >>> is decidable. The point is that it is decided incorrectly by the >>> [purported] halt decider under test*. That is enough to show the >>> undecidability of the HP. What other [claimed] halt deciders or >>> simulators or ... do, whether to this instance or any other, is >>> irrelevant. >>> >> >> The mistake that you continue to make over and over and over is that you >> keep presuming that the question is: Does the input halt on its input? >> >> I have corrected people on this many times and every time they short >> circuit to the same mistake. > > I do not accept any other question. On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > ... the question "Does the simulation of the > input have to be stopped to prevent its otherwise infinite > execution" is, itself, the classical halting problem. Although the above question divides inputs into halting and not halting when the original question: Does the input halt on its input? is applied to a halt decider based on the above question it conflates halting inputs with not-halting inputs and calls them both halting. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 14:26 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <nYydnRFuTJv8ymLCnZ2dnUU7-X_NnZ2d@giganews.com> |
| In reply to | #27975 |
On 1/13/2021 6:49 AM, Richard Damon wrote: > On 1/13/21 1:39 AM, olcott wrote: >> On 1/12/2021 11:53 PM, André G. Isaak wrote: > >>> >>> You keep forgetting that in the Linz proof, H_Hat is created by making >>> a *copy* of Halts(). >> >> I do not keep forgetting that. The Sipser proof doesn't do it that way >> so I kept the common: "do the opposite of whatever the halt decider >> decides" basis of Sipser, Linz and Kozen and discarded some of the >> aspects where they diverge. >> >> My proof has the simplest possible instance of the key >> "do the opposite of whatever the halt decider decides" >> basis of all of the conventional proofs. >> > > Maybe this shows part of the problem, that you don't really understand > Turing Machines. > > While I would not consider myself an expert on this, but when I read > Linz and Sipser proofs, I see essentially the same machine being > described by the two of them (just a slight difference in how they > express their outputs). Linz uses a very formal mathematical notation, > and Sipser is more verbal, but the machine described is still the sames. > > I will ask you, can you write, as a REAL Turing Machine (not just a > computational equivalent) a D with H as a subroutine that doesn't > actually contain a copy of H. > The execution trace of the x86 code where only the halt decider and the user code is emulated and all the other operating system function are implemented directly in the emulator takes 297 pages. Because Turing Machines do not have direct memory access when a TM needs to reference a tape location that is 64K away from the current tape location this required 64K moves from one configuration to another. This would entail that the complete execution trace of Halts() correctly deciding H_Hat() would be billions of pages long. Which do you think would be easier to understand: (a) Billions of pages of TM configuration changes (b) 300 pages of x86 code > Maybe you should also read that article where it talks about a program > taking its representation as its input, as you don't seem to understand > that as well. > The program <is> is x86 representation. -- 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-01-13 19:40 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <1qMLH.21576$MW1.17035@fx20.iad> |
| In reply to | #27984 |
On 1/13/21 3:26 PM, olcott wrote: > On 1/13/2021 6:49 AM, Richard Damon wrote: >> On 1/13/21 1:39 AM, olcott wrote: >>> On 1/12/2021 11:53 PM, André G. Isaak wrote: >> >>>> >>>> You keep forgetting that in the Linz proof, H_Hat is created by making >>>> a *copy* of Halts(). >>> >>> I do not keep forgetting that. The Sipser proof doesn't do it that way >>> so I kept the common: "do the opposite of whatever the halt decider >>> decides" basis of Sipser, Linz and Kozen and discarded some of the >>> aspects where they diverge. >>> >>> My proof has the simplest possible instance of the key >>> "do the opposite of whatever the halt decider decides" >>> basis of all of the conventional proofs. >>> >> >> Maybe this shows part of the problem, that you don't really understand >> Turing Machines. >> >> While I would not consider myself an expert on this, but when I read >> Linz and Sipser proofs, I see essentially the same machine being >> described by the two of them (just a slight difference in how they >> express their outputs). Linz uses a very formal mathematical notation, >> and Sipser is more verbal, but the machine described is still the sames. >> >> I will ask you, can you write, as a REAL Turing Machine (not just a >> computational equivalent) a D with H as a subroutine that doesn't >> actually contain a copy of H. >> > > The execution trace of the x86 code where only the halt decider and the > user code is emulated and all the other operating system function are > implemented directly in the emulator takes 297 pages. > > Because Turing Machines do not have direct memory access when a TM needs > to reference a tape location that is 64K away from the current tape > location this required 64K moves from one configuration to another. > This would entail that the complete execution trace of Halts() correctly > deciding H_Hat() would be billions of pages long. > > Which do you think would be easier to understand: > (a) Billions of pages of TM configuration changes > (b) 300 pages of x86 code > >> Maybe you should also read that article where it talks about a program >> taking its representation as its input, as you don't seem to understand >> that as well. >> > > The program <is> is x86 representation. > WRONG. x86 code is NOT a Turing Representation, but is a Turing EQUIVELENT of some Turing Machine. I suspect that you have no understanding of the actual question I made, and I suspect that you may not actually know how to write Turing Machine Code. I was making the point that Turing Machines do NOT have subroutines in the same sense of x86 code, and ESPECIALLY that there is absolutely no such thing as 'system code' that a Turing Machine can use that isn't part of the machine itself. This fact totally invalidates your claim that you can ignore the trace of part of the operation of the machine inside the simulated call to the simulated Halts routine. THAT is fully part of the simulated program.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-13 14:51 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87a6tcritl.fsf@bsb.me.uk> |
| In reply to | #27972 |
olcott <NoOne@NoWhere.com> writes: > On 1/12/2021 11:53 PM, André G. Isaak wrote: <cut> >> You keep forgetting that in the Linz proof, H_Hat is created by >> making a *copy* of Halts(). > > I do not keep forgetting that. The Sipser proof doesn't do it that way Yes it does (it happens on the line marked 1. is the page you keep citing). You are fundamentally hampered by the fact that you don't know how to read mathematics. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 09:39 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Dc-dndepK7esiWLCnZ2dnUU7-KfNnZ2d@giganews.com> |
| In reply to | #27978 |
On 1/13/2021 8:51 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 1/12/2021 11:53 PM, André G. Isaak wrote: > <cut> >>> You keep forgetting that in the Linz proof, H_Hat is created by >>> making a *copy* of Halts(). >> >> I do not keep forgetting that. The Sipser proof doesn't do it that way > > Yes it does (it happens on the line marked 1. is the page you keep > citing). You are fundamentally hampered by the fact that you don't know > how to read mathematics. > Because H is a subroutine of D we can know that the state transtions of H have not been merged directly into D 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. The following is a description of D. (Sipser 1997) http://www.liarparadox.org/sipser_165.pdf Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: PWS Publishing Company (165-167) -- 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-01-13 19:55 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <nEMLH.27945$Er.26273@fx44.iad> |
| In reply to | #27981 |
On 1/13/21 10:39 AM, olcott wrote: > On 1/13/2021 8:51 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 1/12/2021 11:53 PM, André G. Isaak wrote: >> <cut> >>>> You keep forgetting that in the Linz proof, H_Hat is created by >>>> making a *copy* of Halts(). >>> >>> I do not keep forgetting that. The Sipser proof doesn't do it that way >> >> Yes it does (it happens on the line marked 1. is the page you keep >> citing). You are fundamentally hampered by the fact that you don't know >> how to read mathematics. >> > > Because H is a subroutine of D we can know that the state transtions of > H have not been merged directly into D > > 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. The following is a description of D. (Sipser 1997) > > http://www.liarparadox.org/sipser_165.pdf > > Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: > PWS Publishing Company (165-167) > > If you understood what this means, you would realize that this is basically EXACTLY what Linz did. H being a 'subroutine' means that we having functionally changed any of the non-terminal states n H, but we WILL have potentially changed the terminal state (as that is how we get the answer from the decider into D). This is EXACTLY what Linz did to H to get H^. Note, that this IS effectively a copy, unless you are thinking that in building D somehow H has vanished from existence. After all, code is just conceptual, so copying is trivial. He also just assume the duplication of the input tape, as D takes as input M, and then calls H to determine what M will do given M as an input, and since these are two seperate pieces of input to H, there is an implied duplication. Maybe you don't understand how to use subroutines in Turing Machines.
[toc] | [prev] | [next] | [standalone]
Page 13 of 16 — ← Prev page 1 … 11 12 [13] 14 15 16 Next page →
Back to top | Article view | comp.theory
csiph-web