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 12 of 16 — ← Prev page 1 … 10 11 [12] 13 14 … 16 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-14 19:25 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <20210114105604.565@kylheku.com> |
| In reply to | #28028 |
["Followup-To:" header set to comp.theory.] On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: > On 1/14/2021 11:33 AM, Kaz Kylheku wrote: >> ["Followup-To:" header set to comp.theory.] >> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >>> On 1/14/2021 10:54 AM, Kaz Kylheku wrote: >>>> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >>>>> On 1/14/2021 6:26 AM, Richard Damon wrote: >>>>>> Except that (f) is not shown to be satisfied as some of the trace has >>>>>> been omitted (the code starting at 0000066E and ending up at 0000084E. >>>>>> >>>>>> (f) does NOT say only 'user' code, and is FALSE if modified to say that. >>>>>> >>>>>> Your AXIOM is also not true in the general case, it presumes that >>>>>> machine has no interrupts or traps that are able to affect the execution >>>>>> of the program, and you 'global' decider system seems to have a trap >>>>>> mechanism to let Halts know that it has detected 'infinite recursion', >>>>>> that or Halts needs to have a direct conditional in it. >>>>>> >>>>>> Since your proof is based on a false statement, it is unsound. >>>>>> >>>>> >>>>> 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? >>>> >>>> Not at all! >>>> >>>> Even with this compromised logic of tracing only selected instructions >>>> from the simulation, your H_Hat(H_Hat) halts, and yet Halts(H_Hat, >>>> H_Hat) returns 0. >>> >>> >>> As I have already said fifty times now >> >> Repetition does not help in logic. >> >> P ^ P ^ ... ^ P is equiavlent to P. >> >> >>> when we put the halt decider in >>> disabled mode >> >> ... we are changing an input, which means we have a different decider, >> and since H_Hat is based on the decider, we have a different H_Hat. >> >> Please bugger off, until your code properly has this input in the >> parameter list, so that Halts is a three-place function, and H_Hat >> a two-place function. >> > > So it is utterly beyond your imagination that there could be three > different instances of a halt decider? No, it isn't; I'm asking you above to make the instances clear via parameters. The article "a" in "a halt decider" refers to exactly one function. The "instance" of a function isn't a function, it is a function application. A function denotes many possible computations, which are parametrized using free variables known as the parameters. We instantiate a computation by applying an argument to every one of the parameters. If we apply fewer arguments than there are parameters, that is called a "partial application". The result of a partial application is a function of the remaining arguments. Partial application generates different functions for different values of the applied arguments. does not directly support run-time partial application, but you have effectively done that manually by factoring the mode parameter into a #define: you are then patially applying that parameter when building the program. Depending on which value you apply, you get one of three different Halst and H_Hat functions. These are then fully instantiated via parameters: (H_Hat) and (H_Hat, H_Hat). > I swap between them using #define statements. So you effectively have a three-parameter function. Two of the parameters appear as formal parameters in the parameter list. The third one is a #define flag. This function has a vast number of instances, not only three. Every different triplet that we choose <P, I, mode> creates a different instance. We are focused on three particular instances: Halts(H_Hat, H_Hat, mode_0) // does H_Hat(H_Hat, mode_0) halt? Halts(H_Hat, H_Hat, mode_1) // does H_Hat(H_Hat, mode_1) halt? Halts(H_Hat, H_Hat, mode_2) // does H_Hat(H_Hat, mode_1) halt? Each one answers the question about a different, corresponding instance of H_hat. See? For each mode m, each decider instance Halts(H_Hat, H_Hat, m) is concerned with a different H_Hat(H_Hat, m) instance. Each instance of Halts either fails to terminate, or else yields the wrong answer about its corresponding H_Hat instance. Because the mode parameter is compile-time, the other instances of H_Hat not being analyzed cannot even *exist* in the same program!
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-14 12:58 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <3D%LH.19910$_b3.18155@fx41.iad> |
| In reply to | #28022 |
On 1/14/21 12:22 PM, olcott wrote: > On 1/14/2021 10:54 AM, Kaz Kylheku wrote: >> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >>> >>> 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? >> >> Not at all! >> >> Even with this compromised logic of tracing only selected instructions >> from the simulation, your H_Hat(H_Hat) halts, and yet Halts(H_Hat, >> H_Hat) returns 0. > > > As I have already said fifty times now when we put the halt decider in > disabled mode where it only reports true when an input program has > already halted on its own then every instance of the invocation of > H_Hat(H_Hat) executes infinitely. > > We have to determine that it executes infinitely analytically because it > is impossible to wait until an eternity of time has completed. > > Except that is the wrong test as it has now changed the program on the tape being evaluated, which isn't allowed. The test of necessity is to change the copy of Halts in the actual machine only, and not the copies on the tape, so we can evalutate the exact same computation to see what happens. THAT is the true test of the term 'needed to be aborted'
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 12:28 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <feSdnQMSptzGEJ39nZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #28027 |
On 1/14/2021 11:58 AM, Richard Damon wrote: > On 1/14/21 12:22 PM, olcott wrote: >> On 1/14/2021 10:54 AM, Kaz Kylheku wrote: >>> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: > >>>> >>>> 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? >>> >>> Not at all! >>> >>> Even with this compromised logic of tracing only selected instructions >>> from the simulation, your H_Hat(H_Hat) halts, and yet Halts(H_Hat, >>> H_Hat) returns 0. >> >> >> As I have already said fifty times now when we put the halt decider in >> disabled mode where it only reports true when an input program has >> already halted on its own then every instance of the invocation of >> H_Hat(H_Hat) executes infinitely. >> >> We have to determine that it executes infinitely analytically because it >> is impossible to wait until an eternity of time has completed. >> >> > > Except that is the wrong test as it has now changed the program on the > tape being evaluated, which isn't allowed. > The test has not changed. The test is the same. The test will report: [the input must be aborted] whether or not the input is aborted. If the input is not aborted and the input is infinitely recursive this proves to anyone that understands these things that the report of "otherwise" infinite recursion was necessarily correct. If the input is not aborted then the input will be infinitely recursive: ~X then Y The input is <not> aborted and it <is> infinitely recursive. The above utterly proves ~X then Y is true. -- 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-14 13:55 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <es0MH.2427$Jh1.881@fx46.iad> |
| In reply to | #28030 |
On 1/14/21 1:28 PM, olcott wrote: > On 1/14/2021 11:58 AM, Richard Damon wrote: >> On 1/14/21 12:22 PM, olcott wrote: >>> On 1/14/2021 10:54 AM, Kaz Kylheku wrote: >>>> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >> >>>>> >>>>> 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? >>>> >>>> Not at all! >>>> >>>> Even with this compromised logic of tracing only selected instructions >>>> from the simulation, your H_Hat(H_Hat) halts, and yet Halts(H_Hat, >>>> H_Hat) returns 0. >>> >>> >>> As I have already said fifty times now when we put the halt decider in >>> disabled mode where it only reports true when an input program has >>> already halted on its own then every instance of the invocation of >>> H_Hat(H_Hat) executes infinitely. >>> >>> We have to determine that it executes infinitely analytically because it >>> is impossible to wait until an eternity of time has completed. >>> >>> >> >> Except that is the wrong test as it has now changed the program on the >> tape being evaluated, which isn't allowed. >> > > The test has not changed. The test is the same. The test will report: > [the input must be aborted] whether or not the input is aborted. > > If the input is not aborted and the input is infinitely recursive this > proves to anyone that understands these things that the report of > "otherwise" infinite recursion was necessarily correct. > > If the input is not aborted then the input will be infinitely recursive: > ~X then Y The input is <not> aborted and it <is> infinitely recursive. > > The above utterly proves ~X then Y is true. > Nope, you change the computation on the tape by changing the behavior of Halts that was represented on the tape. The version of Halts on the tape must still actually terminate the simulation it does. IF you do this, then your top level Halts() will 'say' that it needs to abort, then shortly after that the second level Halts WILL abort its simulation, and return, that H_Hat will halt, and the top level call to Halts will return, showing that it was WRONG when it said it needed to abort the simulation. Your insistence of a single copy of the code, might make this actually impossible for you to do, which ALSO shows your model is broken, and thus failed.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-16 15:00 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <SfKdnfhQnPNnzp79nZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #28032 |
On 1/14/2021 12:55 PM, Richard Damon wrote: > On 1/14/21 1:28 PM, olcott wrote: >> On 1/14/2021 11:58 AM, Richard Damon wrote: >>> On 1/14/21 12:22 PM, olcott wrote: >>>> On 1/14/2021 10:54 AM, Kaz Kylheku wrote: >>>>> On 2021-01-14, olcott <NoOne@NoWhere.com> wrote: >>> >>>>>> >>>>>> 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? >>>>> >>>>> Not at all! >>>>> >>>>> Even with this compromised logic of tracing only selected instructions >>>>> from the simulation, your H_Hat(H_Hat) halts, and yet Halts(H_Hat, >>>>> H_Hat) returns 0. >>>> >>>> >>>> As I have already said fifty times now when we put the halt decider in >>>> disabled mode where it only reports true when an input program has >>>> already halted on its own then every instance of the invocation of >>>> H_Hat(H_Hat) executes infinitely. >>>> >>>> We have to determine that it executes infinitely analytically because it >>>> is impossible to wait until an eternity of time has completed. >>>> >>>> >>> >>> Except that is the wrong test as it has now changed the program on the >>> tape being evaluated, which isn't allowed. >>> >> >> The test has not changed. The test is the same. The test will report: >> [the input must be aborted] whether or not the input is aborted. >> >> If the input is not aborted and the input is infinitely recursive this >> proves to anyone that understands these things that the report of >> "otherwise" infinite recursion was necessarily correct. >> >> If the input is not aborted then the input will be infinitely recursive: >> ~X then Y The input is <not> aborted and it <is> infinitely recursive. >> >> The above utterly proves ~X then Y is true. >> > > Nope, you change the computation on the tape by changing the behavior of > Halts that was represented on the tape. The version of Halts on the tape > must still actually terminate the simulation it does. > That is such a stupid thing to say. When code is erased from the tape somehow this code is still executed even though is does not exist? -- 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-16 19:57 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <QXLMH.7152$wx.1841@fx02.iad> |
| In reply to | #28043 |
On 1/16/21 4:00 PM, olcott wrote: > On 1/14/2021 12:55 PM, Richard Damon wrote: >> On 1/14/21 1:28 PM, olcott wrote: >>> The test has not changed. The test is the same. The test will report: >>> [the input must be aborted] whether or not the input is aborted. >>> >>> If the input is not aborted and the input is infinitely recursive this >>> proves to anyone that understands these things that the report of >>> "otherwise" infinite recursion was necessarily correct. >>> >>> If the input is not aborted then the input will be infinitely recursive: >>> ~X then Y The input is <not> aborted and it <is> infinitely recursive. >>> >>> The above utterly proves ~X then Y is true. >>> >> >> Nope, you change the computation on the tape by changing the behavior of >> Halts that was represented on the tape. The version of Halts on the tape >> must still actually terminate the simulation it does. >> > > That is such a stupid thing to say. When code is erased from the tape > somehow this code is still executed even though is does not exist? > > In the Linz proof, there is a machine and input provided on the tape. That Machine and input include a copy of Halts that has your full 'working' halt decider. Change the tape, and you change the question being asked. To say you can do that would be the same as saying it would be ok to ask Halt to decide one H_Hat, and then check it by running a different H_Hat, maybe one that just flat out halts immediately. That is EXACTLY the same thing you are trying to pull. Also, I don't care what Halts does to its input tape, it can erase it for all I care, that just make its job harder. Note that Halts CAN'T change the code to the H_Hat that calls it, as Turing Machines do NOT support 'self modifing code'.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-15 01:34 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <87pn279e5e.fsf@bsb.me.uk> |
| In reply to | #28006 |
olcott <NoOne@NoWhere.com> writes:
> On 1/13/2021 10:03 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>> The same halt decider can have different behavior on the same input:
>>>>>>>>> Turing Machine description when halt deciding mode {enabled, disabled}
>>>>>>>>> is an additional input.
>>>>>>>>>
>>>>>>>>
>>>>>>>> But the H in the halting problem doesn't have this extra input, so for
>>>>>>>> Linz and such it can't really be there, for that purpose you need to
>>>>>>>> wrap your decider with that extra input with a wrapper that always sets
>>>>>>>> it the same way.
>>>>>>>>
>>>>>>>
>>>>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>>>>> thing you] want operator we are free to [do any damn thing we want].
>>>>>
>>>>> In Linz terms it specifies an arbitrary set of moves from one
>>>>> configuration to another, thus the specified algorithm is simply [do
>>>>> any damn thing you want] (as long as you end up at YES or NO).
>>>>
>>>> Still wrong.
>>
>>> Any configuration is completely determined by the current state of the
>>> control unit, the contents of the tape, and the position of the
>>> read-write head (Linz 1990:236)
>>>
>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>> moves (Linz 1990:237)
>>>
>>> Therefore H begins at a start state (q0) and ends up at one of two
>>> final states (qy) or (qn) and can [do any damn thing inbetween] as
>>> long as it ends up deciding halting on its input.
>>
>> It can not, however, do this:
>>
>> | The same halt decider can have different behavior on the same input:
>> | Turing Machine description when halt deciding mode {enabled, disabled}
>> | is an additional input.
>
> The Linz H would simply be Halts() in global mode.
Then you don't need any of the others. The others are there for you to
pull of your huckster trick.
> 297 more pages of execution trace is not going to make this easier to
> understand.
Indeed, it's perfectly clear already. Halts has "modes" so you can
pretend that H_Hat fits the template just because it uses the name. We
can all see a thousand ways to pull off this trick. Yours does not
appear to be any more interesting than the way I'd do it.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-16 15:45 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <9rmdnQ9m2Yj3w579nZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #28036 |
On 1/14/2021 7:34 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 1/13/2021 10:03 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>> The same halt decider can have different behavior on the same input:
>>>>>>>>>> Turing Machine description when halt deciding mode {enabled, disabled}
>>>>>>>>>> is an additional input.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> But the H in the halting problem doesn't have this extra input, so for
>>>>>>>>> Linz and such it can't really be there, for that purpose you need to
>>>>>>>>> wrap your decider with that extra input with a wrapper that always sets
>>>>>>>>> it the same way.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>>>>>> thing you] want operator we are free to [do any damn thing we want].
>>>>>>
>>>>>> In Linz terms it specifies an arbitrary set of moves from one
>>>>>> configuration to another, thus the specified algorithm is simply [do
>>>>>> any damn thing you want] (as long as you end up at YES or NO).
>>>>>
>>>>> Still wrong.
>>>
>>>> Any configuration is completely determined by the current state of the
>>>> control unit, the contents of the tape, and the position of the
>>>> read-write head (Linz 1990:236)
>>>>
>>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>>> moves (Linz 1990:237)
>>>>
>>>> Therefore H begins at a start state (q0) and ends up at one of two
>>>> final states (qy) or (qn) and can [do any damn thing inbetween] as
>>>> long as it ends up deciding halting on its input.
>>>
>>> It can not, however, do this:
>>>
>>> | The same halt decider can have different behavior on the same input:
>>> | Turing Machine description when halt deciding mode {enabled, disabled}
>>> | is an additional input.
>>
>> The Linz H would simply be Halts() in global mode.
>
> Then you don't need any of the others. The others are there for you to
> pull of your huckster trick.
OK then.
Halts() simply returns its result to the command line and then halts.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
Halts((u32)H_Hat, (u32)H_Hat);
}
_H_Hat()
[00000879](01) 55 push ebp
[0000087a](02) 8bec mov ebp,esp
[0000087c](01) 51 push ecx
[0000087d](03) 8b4508 mov eax,[ebp+08]
[00000880](01) 50 push eax
[00000881](03) 8b4d08 mov ecx,[ebp+08]
[00000884](01) 51 push ecx
[00000885](05) e8fffdffff call 00000689
[0000088a](03) 83c408 add esp,+08
[0000088d](03) 8945fc mov [ebp-04],eax
[00000890](04) 837dfc00 cmp dword [ebp-04],+00
[00000894](02) 7402 jz 00000898
[00000896](02) ebfe jmp 00000896
[00000898](02) 8be5 mov esp,ebp
[0000089a](01) 5d pop ebp
[0000089b](01) c3 ret
_main()
[000008a9](01) 55 push ebp
[000008aa](02) 8bec mov ebp,esp
[000008ac](05) 6879080000 push 00000879
[000008b1](05) 6879080000 push 00000879
[000008b6](05) e8cefdffff call 00000689 ; Call Halts(H_Hat,H_Hat)
[000008bb](03) 83c408 add esp,+08
[000008be](02) 33c0 xor eax,eax
[000008c0](01) 5d pop ebp
[000008c1](01) c3 ret
Output_Debug_Trace() Trace_List.size(20)
---[000008a9](01) 55 push ebp
---[000008aa](02) 8bec mov ebp,esp
---[000008ac](05) 6879080000 push 00000879
---[000008b1](05) 6879080000 push 00000879
---[000008b6](05) e8cefdffff call 00000689 ; Call
Halts(H_Hat,H_Hat)
---[00000879](01) 55 push ebp
---[0000087a](02) 8bec mov ebp,esp
---[0000087c](01) 51 push ecx
---[0000087d](03) 8b4508 mov eax,[ebp+08]
---[00000880](01) 50 push eax
---[00000881](03) 8b4d08 mov ecx,[ebp+08]
---[00000884](01) 51 push ecx
---[00000885](05) e8fffdffff call 00000689 ; Call
Halts(H_Hat,H_Hat)
---[00000879](01) 55 push ebp
---[0000087a](02) 8bec mov ebp,esp
---[0000087c](01) 51 push ecx
---[0000087d](03) 8b4508 mov eax,[ebp+08]
---[00000880](01) 50 push eax
---[00000881](03) 8b4d08 mov ecx,[ebp+08]
---[00000884](01) 51 push ecx
---[00000885](05) e8fffdffff call 00000689 --CALL [00000689]
The PRIOR Instruction Specifies Infinite Recursion: Simulation Stopped:
The fact that the above execution trace matches the [Infinite Recursion
detection criteria] combined with the fact that this criteria can be
verified as [self-evidently true] (verified as totally true entirely
based on its meaning_ proves that Halts() does correctly decide H_Hat().
Infinite Recursion detection criteria (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
--
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-16 20:01 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <k%LMH.11766$ac1.1982@fx48.iad> |
| In reply to | #28048 |
On 1/16/21 4:45 PM, olcott wrote: > > OK then. > Halts() simply returns its result to the command line and then halts. At that point that H_Hat would be built as a shell script checking that value. Hope you have defined some way to parse shell scripts in your simulator. Anything less says you haven't built H_Hat right, or have some other flaw in your model equivalence. Basic Fact, H is defined to be a Turing Machine. There are a LOT of basic properties of Turing Machines, like if the return an answer, a machine can be built to use that answer. I think the your problem is you don't really understand how Turing Machines work.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-17 03:31 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <87im7w8cio.fsf@bsb.me.uk> |
| In reply to | #28048 |
olcott <NoOne@NoWhere.com> writes:
> On 1/14/2021 7:34 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 1/13/2021 10:03 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>>>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>>>>>>
>>>>>>>>>>> The same halt decider can have different behavior on the same input:
>>>>>>>>>>> Turing Machine description when halt deciding mode {enabled, disabled}
>>>>>>>>>>> is an additional input.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> But the H in the halting problem doesn't have this extra input, so for
>>>>>>>>>> Linz and such it can't really be there, for that purpose you need to
>>>>>>>>>> wrap your decider with that extra input with a wrapper that always sets
>>>>>>>>>> it the same way.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>>>>>>> thing you] want operator we are free to [do any damn thing we want].
>>>>>>>
>>>>>>> In Linz terms it specifies an arbitrary set of moves from one
>>>>>>> configuration to another, thus the specified algorithm is simply [do
>>>>>>> any damn thing you want] (as long as you end up at YES or NO).
>>>>>>
>>>>>> Still wrong.
>>>>
>>>>> Any configuration is completely determined by the current state of the
>>>>> control unit, the contents of the tape, and the position of the
>>>>> read-write head (Linz 1990:236)
>>>>>
>>>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>>>> moves (Linz 1990:237)
>>>>>
>>>>> Therefore H begins at a start state (q0) and ends up at one of two
>>>>> final states (qy) or (qn) and can [do any damn thing inbetween] as
>>>>> long as it ends up deciding halting on its input.
>>>>
>>>> It can not, however, do this:
>>>>
>>>> | The same halt decider can have different behavior on the same input:
>>>> | Turing Machine description when halt deciding mode {enabled, disabled}
>>>> | is an additional input.
>>>
>>> The Linz H would simply be Halts() in global mode.
>>
>> Then you don't need any of the others. The others are there for you to
>> pull of your huckster trick.
>
> OK then.
Glad you agree. But you mist publish this modeless Halts or your words
are just more empty boasting.
> Halts() simply returns its result to the command line and then halts.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> int main()
> {
> Halts((u32)H_Hat, (u32)H_Hat);
> }
You don't need to keep posting the traces. The two modes for Halts can
be made clear in the code. Publishing Halts will make it amply clear,
but you've described what you are doing, even though you are still
hiding the code.
<cut>
> Infinite Recursion detection criteria (self-evident truth)
The criteria for implementing the cheat don't really matter. Halts
implements two algorithms. One to give the right behaviour to H_Hat and
one to give the right result. This is trivial to do and you should post
the cheating Halts code right away.
All the other errors are secondary to the fact that the H/H^
relationship is broken. H_Hat does not wrap the Halts computation that
gives the answer. It wraps the Halts computation that gives the
behaviour.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 18:43 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <v7OdnbR5Loe832PCnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #27938 |
On 1/12/2021 3:28 PM, Kaz Kylheku wrote: > On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> The pronoun "its" in (a) refers to two different Turing Machines, one >>> which terminates (let's call it A) and one which exhibits infinite >>> execution (B). These are necessarily different machines, because no TM >>> both terminates and fails to terminate. >>> >>> What (a) says is 'The simulation of A has to be stopped to prevent >>> the infinite execution of B'. >>> >>> Because A is stopped, it cannot be B, which has infinite execution. >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. > > "would have" means the same thing as "does not"! > > "would have" means it "would have to be" a different TM. A TM can be configured to stop the simulation of its input when its input would be otherwise infinitely recursive OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR OR A TM can be configured to NOT stop the simulation of its input when its input would be otherwise infinitely recursive, thus allowing it to be infinitely recursive. When you evaluate the first half of a single sentence you do not evaluate the sentence correctly. -- 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 01:51 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210112173936.571@kylheku.com> |
| In reply to | #27947 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > On 1/12/2021 3:28 PM, Kaz Kylheku wrote: >> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>>> The pronoun "its" in (a) refers to two different Turing Machines, one >>>> which terminates (let's call it A) and one which exhibits infinite >>>> execution (B). These are necessarily different machines, because no TM >>>> both terminates and fails to terminate. >>>> >>>> What (a) says is 'The simulation of A has to be stopped to prevent >>>> the infinite execution of B'. >>>> >>>> Because A is stopped, it cannot be B, which has infinite execution. >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >> >> "would have" means the same thing as "does not"! >> >> "would have" means it "would have to be" a different TM. > > A TM can be configured to stop the simulation of its input when its > input would be otherwise infinitely recursive You keep using the language of a complete amateur who barely finished high school. A TM cannot be "configured". A TM is a fixed mathematical object, like an integer. To say that a TM can be "configured" is like saying that the integer 42 can be "configured". If you have some configuration process the result of which is a TM, then quit probably the input is not a TM. It is some TM-template or TM-fragment or osmething. That is combined with the configuration to make a TM. An example of this is a UTM. A UTM is part of a TM: the programmable machine part. A UTM is combined with a configuration, the tape. UTM + tape => TM. > A TM can be configured to NOT stop the simulation of its input when its > input would be otherwise infinitely recursive, thus allowing it to be > infinitely recursive. What "it"? If TF is a TM fragment, and C is its configuration, then we can combine them using make_TM(TF, C = false) to make TM0, which might be nonterminating TM. Or make_TM(TF, C = true) to make TM1 which might be terminating terminating. TM0 and TM1 are different, and both are not only different from TM, but a different kind of thing. We cannot use the pronoun "it" to say that we took TM and turned "it" into a non-terminating or terminating machine. The pronoun "it" cannot simultaneously refer to TM, TM0 and TM1. > When you evaluate the first half of a single sentence you do not > evaluate the sentence correctly. Your sentences have no correct evaluation; they are equivocating nonsense. You seem to lack the background to express ideas formally and precisely. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 20:22 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <B4CdnXE6CuPBxGPCnZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #27938 |
On 1/12/2021 3:28 PM, Kaz Kylheku wrote: > On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> The pronoun "its" in (a) refers to two different Turing Machines, one >>> which terminates (let's call it A) and one which exhibits infinite >>> execution (B). These are necessarily different machines, because no TM >>> both terminates and fails to terminate. >>> >>> What (a) says is 'The simulation of A has to be stopped to prevent >>> the infinite execution of B'. >>> >>> Because A is stopped, it cannot be B, which has infinite execution. >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. > > "would have" means the same thing as "does not"! > In my above sentence "would have" does not freaking have the same damn meaning as "does not"! "would have" has a meaning contingent upon the conditional in the second half of the freaking sentence. -- 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 03:09 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210112185441.788@kylheku.com> |
| In reply to | #27958 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > On 1/12/2021 3:28 PM, Kaz Kylheku wrote: >> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>>> The pronoun "its" in (a) refers to two different Turing Machines, one >>>> which terminates (let's call it A) and one which exhibits infinite >>>> execution (B). These are necessarily different machines, because no TM >>>> both terminates and fails to terminate. >>>> >>>> What (a) says is 'The simulation of A has to be stopped to prevent >>>> the infinite execution of B'. >>>> >>>> Because A is stopped, it cannot be B, which has infinite execution. >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >> >> "would have" means the same thing as "does not"! >> > In my above sentence > "would have" does not freaking have the same damn meaning as "does not"! More precisely, "would have" means "does not have". > "would have" has a meaning contingent upon the conditional in the second > half of the freaking sentence. The *sane, logically correct interpretation* of stopping a simulation is that the halting is left inconclusive; the halting status is not affected. If we are using simulation method as a decider, and we have to cut the simulation short, we have no right to conclude yes (terminates) or no (does not). We have take then third option; we have failed to decide. When a decider fails to terminate it also takes this option: it fails to decide. If a decider stops a simualtion short, crashes or fails to terminate, it has failed to decide. If we already know that some TM does not halt, and we stop its simulation forcibly, that doesn't change anything; it's still a non-halting TM. We had no reason to run the simulation in the first place, if we already know that it doesn't halt. In your wild and wacky simulation world, you're making the stopping of a simulation part of he semantics; stopping the simulation, or not, creates a different decider which potentially returns a different value. Since that decider is embedded into the H_Hat function, this generates a different H_Hat function, and the halting status of that function is affected. All of that is not how a reasonable person reads the innocent-looking sentences like "does the simulation of he input have to be stopped to prevent its infinite execution". Your words have to be interpreted carefully with regard to this simulation world. When we map the sentences to what is going on in your simulation world, and what you claim about the results, we find fallacies of inference, such as equivocation. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-12 21:28 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <lVsLH.1123$i72.602@fx16.iad> |
| In reply to | #27937 |
On 1/12/21 3:49 PM, olcott wrote: > > Any input meeting this criteria is input that would have infinite > execution if its simulation was not stopped. > > 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 > > The way to prove that this is true is to perform an execution trace on > H_Hat() with the halt decider in disabled mode. There will also be a > full trace mode that shows the execution trace of all of operating > system code too. > > When you can look at the 100% complete execution trace and see that > there are no instructions in this trace that could possibly cause it to > stop, then it can be understood to be infinite. > > It is much much easier to come to a complete understanding of the above > Infinite Recursion detection AXIOM than it is to verify that thousands > of pages of x86 code specify infinite execution. None-the-less this > empirical proof will be available. > > Even the full execution trace of Halts() correctly deciding H_Hat() is > 297 pages long. This was greatly reduced to 297 pages by moving most > operating system functions into emulator code. > > The local halt decider is entirely in emulated code so every single step > of its execution can be seen. The global halt decider works best as an > x86utm operating system function so that it can easily watch everything. > Except that you never do provide a 100% trace of the execution because you omit some code that you classify as 'system' code. Turing Machines have no 'System' Code, and for your axiom to be true, (f) must include ALL code, AND the machine must not provide an interrupt or trap capability the the program has access to. I am sure that Halts fails to pass that test.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 20:50 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <ed2dnRQPFttmwmPCnZ2dnUU7-UXNnZ2d@giganews.com> |
| In reply to | #27959 |
On 1/12/2021 8:28 PM, Richard Damon wrote: > On 1/12/21 3:49 PM, olcott wrote: >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. >> >> 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 >> >> The way to prove that this is true is to perform an execution trace on >> H_Hat() with the halt decider in disabled mode. There will also be a >> full trace mode that shows the execution trace of all of operating >> system code too. >> >> When you can look at the 100% complete execution trace and see that >> there are no instructions in this trace that could possibly cause it to >> stop, then it can be understood to be infinite. >> >> It is much much easier to come to a complete understanding of the above >> Infinite Recursion detection AXIOM than it is to verify that thousands >> of pages of x86 code specify infinite execution. None-the-less this >> empirical proof will be available. >> >> Even the full execution trace of Halts() correctly deciding H_Hat() is >> 297 pages long. This was greatly reduced to 297 pages by moving most >> operating system functions into emulator code. >> >> The local halt decider is entirely in emulated code so every single step >> of its execution can be seen. The global halt decider works best as an >> x86utm operating system function so that it can easily watch everything. >> > Except that you never do provide a 100% trace of the execution because > you omit some code that you classify as 'system' code. I will have a mode where you can see all the system code. In that case less than one page of output becomes 297 pages. > Turing Machines have no 'System' Code, and for your axiom to be true, > (f) must include ALL code, AND the machine must not provide an interrupt > or trap capability the the program has access to. I am sure that Halts > fails to pass that test. > When a freaking halt decider is examining the simulation of a program under test it does not have to examine its own code (it already knows what it does) or the code of the simulator. Both of these are out-of-scope. In TM lingo this is a halt deciding UTM. -- 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 03:15 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210112190936.967@kylheku.com> |
| In reply to | #27961 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: > On 1/12/2021 8:28 PM, Richard Damon wrote: >> Except that you never do provide a 100% trace of the execution because >> you omit some code that you classify as 'system' code. > > I will have a mode where you can see all the system code. In that case > less than one page of output becomes 297 pages. But all of that has to actually be plugged into your "axiom". If you do so, you will no find an uninterrupted chain of calls to Halts with no conditionals. > >> Turing Machines have no 'System' Code, and for your axiom to be true, >> (f) must include ALL code, AND the machine must not provide an interrupt >> or trap capability the the program has access to. I am sure that Halts >> fails to pass that test. >> > > When a freaking halt decider is examining the simulation of a program > under test it does not have to examine its own code (it already knows > what it does) or the code of the simulator. Both of these are out-of-scope. What if someone makes a H_Hat which incorporates a *copy* of Halts, at a different address? Let me guess, you are using scome cheating short-cuts to determine what is system code, based on looking at addresses, aren't you? If the instruction pointer is between here and there, it must be system code, right? > In TM lingo this is a halt deciding UTM. That is idiot lingo. In normal CS lingo, a UTM cannot decide anything. A UTM is combined with a tape to make a TM, and that can decide something. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-12 22:27 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <1NtLH.4399$gs1.2014@fx26.iad> |
| In reply to | #27961 |
On 1/12/21 9:50 PM, olcott wrote: > On 1/12/2021 8:28 PM, Richard Damon wrote: >> On 1/12/21 3:49 PM, olcott wrote: >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >>> >>> 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 >>> >>> The way to prove that this is true is to perform an execution trace on >>> H_Hat() with the halt decider in disabled mode. There will also be a >>> full trace mode that shows the execution trace of all of operating >>> system code too. >>> >>> When you can look at the 100% complete execution trace and see that >>> there are no instructions in this trace that could possibly cause it to >>> stop, then it can be understood to be infinite. >>> >>> It is much much easier to come to a complete understanding of the above >>> Infinite Recursion detection AXIOM than it is to verify that thousands >>> of pages of x86 code specify infinite execution. None-the-less this >>> empirical proof will be available. >>> >>> Even the full execution trace of Halts() correctly deciding H_Hat() is >>> 297 pages long. This was greatly reduced to 297 pages by moving most >>> operating system functions into emulator code. >>> >>> The local halt decider is entirely in emulated code so every single step >>> of its execution can be seen. The global halt decider works best as an >>> x86utm operating system function so that it can easily watch everything. >>> >> Except that you never do provide a 100% trace of the execution because >> you omit some code that you classify as 'system' code. > > I will have a mode where you can see all the system code. In that case > less than one page of output becomes 297 pages. > >> Turing Machines have no 'System' Code, and for your axiom to be true, >> (f) must include ALL code, AND the machine must not provide an interrupt >> or trap capability the the program has access to. I am sure that Halts >> fails to pass that test. >> > > When a freaking halt decider is examining the simulation of a program > under test it does not have to examine its own code (it already knows > what it does) or the code of the simulator. Both of these are out-of-scope. > > In TM lingo this is a halt deciding UTM. > It needs to examine the simulation of ALL of the machine under test. Note that the machine under test is a totally independent machine, and NONE of the code in the machine under test is actually the halt decider that is making the decison, but might be a COPY of that code. This is where you went very wrong by not copying the input like Linz says to. You confuse the Halt Decider Halts that is inside the H_Hat which is running with the other copy of something that might look just like it in the machne under test that looks just like the H_Hat that is running. They ARE distinct (if maybe identical) machines. Sort of like my twin brother Harry, who may look exactly like me, but we are different people. It doesn't matter if Halts is a UTM, they are STILL distinct machines, even if the code for them looks the same, because the program/machine part is the part that is acting like a Turing Machine, and the input part is what is being analyised by that machine. As has been mentioned, your 'trick' of reusing the code actually turns out to break the Turing equivalency of the system to the Linz machine, so your whole proof is basically worthless for talking about those Halt Deciding proofs.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-01-12 22:53 -0700 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <rtm1ta$a6d$1@dont-email.me> |
| In reply to | #27961 |
On 2021-01-12 19:50, olcott wrote: > On 1/12/2021 8:28 PM, Richard Damon wrote: >> On 1/12/21 3:49 PM, olcott wrote: >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >>> >>> 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 >>> >>> The way to prove that this is true is to perform an execution trace on >>> H_Hat() with the halt decider in disabled mode. There will also be a >>> full trace mode that shows the execution trace of all of operating >>> system code too. >>> >>> When you can look at the 100% complete execution trace and see that >>> there are no instructions in this trace that could possibly cause it to >>> stop, then it can be understood to be infinite. >>> >>> It is much much easier to come to a complete understanding of the above >>> Infinite Recursion detection AXIOM than it is to verify that thousands >>> of pages of x86 code specify infinite execution. None-the-less this >>> empirical proof will be available. >>> >>> Even the full execution trace of Halts() correctly deciding H_Hat() is >>> 297 pages long. This was greatly reduced to 297 pages by moving most >>> operating system functions into emulator code. >>> >>> The local halt decider is entirely in emulated code so every single step >>> of its execution can be seen. The global halt decider works best as an >>> x86utm operating system function so that it can easily watch everything. >>> >> Except that you never do provide a 100% trace of the execution because >> you omit some code that you classify as 'system' code. > > I will have a mode where you can see all the system code. In that case > less than one page of output becomes 297 pages. > >> Turing Machines have no 'System' Code, and for your axiom to be true, >> (f) must include ALL code, AND the machine must not provide an interrupt >> or trap capability the the program has access to. I am sure that Halts >> fails to pass that test. >> > > When a freaking halt decider is examining the simulation of a program > under test it does not have to examine its own code (it already knows > what it does) or the code of the simulator. Both of these are out-of-scope. 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(). You keep forgetting that in the Linz proof, H_Hat is created by making a *copy* of Halts(). That includes all of the code used in the computation performed by Halts() including any code which you have called "system" code (there is no distinction between 'user' and 'system' code when discussing computation). If your code ignores this, then you aren't actually working with the correct H_Hat. Linz's proof shows that for any putative halt decider H, it is possible to derive a new program H_Hat which cannot be correctly decided by H. There may be any number of other programs which can correctly decide H_Hat; just not H. If you want to 'refute' Linz, you need to work with the H_Hat that actually corresponds to your H. That means copying all of that stuff which you call 'system calls' or 'global mode' code into H_Hat. Showing how to solve halting for some other H_Hat (i.e. one not derived from your Halts() in the exact manner described by Linz) is trivial and is not germane to the problem at hand. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 00:39 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <IOudnUANZP0TCGPCnZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #27971 |
On 1/12/2021 11:53 PM, André G. Isaak wrote: > On 2021-01-12 19:50, olcott wrote: >> On 1/12/2021 8:28 PM, Richard Damon wrote: >>> On 1/12/21 3:49 PM, olcott wrote: >>>> >>>> Any input meeting this criteria is input that would have infinite >>>> execution if its simulation was not stopped. >>>> >>>> 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 >>>> >>>> The way to prove that this is true is to perform an execution trace on >>>> H_Hat() with the halt decider in disabled mode. There will also be a >>>> full trace mode that shows the execution trace of all of operating >>>> system code too. >>>> >>>> When you can look at the 100% complete execution trace and see that >>>> there are no instructions in this trace that could possibly cause it to >>>> stop, then it can be understood to be infinite. >>>> >>>> It is much much easier to come to a complete understanding of the above >>>> Infinite Recursion detection AXIOM than it is to verify that thousands >>>> of pages of x86 code specify infinite execution. None-the-less this >>>> empirical proof will be available. >>>> >>>> Even the full execution trace of Halts() correctly deciding H_Hat() is >>>> 297 pages long. This was greatly reduced to 297 pages by moving most >>>> operating system functions into emulator code. >>>> >>>> The local halt decider is entirely in emulated code so every single >>>> step >>>> of its execution can be seen. The global halt decider works best as an >>>> x86utm operating system function so that it can easily watch >>>> everything. >>>> >>> Except that you never do provide a 100% trace of the execution because >>> you omit some code that you classify as 'system' code. >> >> I will have a mode where you can see all the system code. In that case >> less than one page of output becomes 297 pages. >> >>> Turing Machines have no 'System' Code, and for your axiom to be true, >>> (f) must include ALL code, AND the machine must not provide an interrupt >>> or trap capability the the program has access to. I am sure that Halts >>> fails to pass that test. >>> >> >> When a freaking halt decider is examining the simulation of a program >> under test it does not have to examine its own code (it already knows >> what it does) or the code of the simulator. Both of these are >> out-of-scope. > > > 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(). > > 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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 12 of 16 — ← Prev page 1 … 10 11 [12] 13 14 … 16 Next page →
Back to top | Article view | comp.theory
csiph-web