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 9 of 16 — ← Prev page 1 … 7 8 [9] 10 11 … 16 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-09 16:46 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <5vpKH.12436$EY7.5570@fx13.iad> |
| In reply to | #27840 |
On 1/9/21 2:18 PM, olcott wrote: > On 1/9/2021 12:57 PM, Richard Damon wrote: >> On 1/9/21 10:36 AM, olcott wrote: >>> On 1/9/2021 5:46 AM, Malcolm McLean wrote: >>>> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: >>>>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: >>>>> >>>>>> You have explained, clearly, the ways in which the two algorithms >>>>>> differ: one is a simulation that does not return a value, the other >>>>>> is a >>>>>> partial simulation that does. I can't see why you want to deny this >>>>>> now. It the core of the ruse you are trying to pull. >>>>> >>>>> How can you say something as stupid as this knowing that I have >>>>> repeatedly told you many times that there is only one single >>>>> instance of >>>>> the machine code? >>>>> >>>> A halt decider has to be a function of the input machine and the input >>>> machine's tape. If it is a function of the input machine, the input >>>> machine's tape, and something else, even a simple flag, then it's >>>> easy to meet Linz's challenge. If you disguise the "something else" >>>> then >>>> it might be a clever cheat, but it's just a cheat. >>> >>> There cannot possibly be such thing as an actual cheat. >>> If the Halt decider correctly decides that the input meets the >>> specification of this infinite recursion axiom then it has correctly >>> decided what would otherwise be infinite recursion: >>> >>> We can see that the halt decider did correctly decide that the prior >>> invocation was infinitely recursive on the basis of: >>> (a) The same function is called >>> (b) From the same machine address >>> (c) With the same data // Richard Damon credit >>> (c) A second time >>> (d) Without any control flow instructions inbetween >> >> >> By which rules, Halts is infinitely recursive and thus non-halting and >> thus fails to meet the requirements of a decider. >> > > Did you notice that I gave you credit for the (c) part of that? Yes. > > This aspect was the only valid critique of any material imperfection of > any aspect of my whole Halts() / H() correctly deciding H_Hat() > presentation. Every other critique of the correctness of my work was > entirely based on a lack of correct understanding. > Nope, that was just a simple example that was quick to provide. You 'proof' fails the simple test of observing what happens after Halts returns (or observing that Halts fails to returns and thus fails). > The halt decider simply simulates the program under test (PUT) until it > detects that this PUT meets the infinite recursion detection axiom > criteria. I note that you are now calling this rule an Axiom. An Axiom is usually a generally accepted truth. Do you have ANY source (other than yourself) of someone else proposing this 'Axiom' as you are using it. The other definition is something self-evidently true to all, as far as I see, only YOU seem to think this is self evident in the way you are using it. I will note, the key deficiency between YOUR use and what is generally accepted is that you are excluding 'system' code in the loop. THAT is what you need to establish as something commonly accepted. > > When we keep a strict wall of separation between the halt decider and > its program under test then the halt decider only examines the execution > trace of the program under test as the whole basis of its halting decision. > > When the infinite recursion detection axiom criteria is met then this > meets the non-halting criteria: > > On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >> A computation that would not halt if its simulation were not >> halted is indeed a non-halting computation. > > On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: >> Every computation that would not halt if its simulation >> were not halted is by logical necessity a non-halting computation. > > Then the halt decider can stop simulating its input and report not halting. > >> The real probelm is that (d) isn't satisfied as there IS a control flow >> instruction between, hidden in Halts. >> >> Your hiding that part of the trace is the cheat. >> > > It is merely the strict wall of separation between the halt decider and > its program under test. The halt decider only examines the behavior of > the program under test until it determines that this behavior meets the > criteria of one of the two non-halting AXIOMS. > BUT that is incorrect. There should be a wall of seperation between Halts and the program that it simulates, but there can NOT be a wall of seperation between Halts and its caller. In fact, when Halts simulates the program under input, the trace it sees should include ALL of the code that that input program generates, NOTHING in there is really 'system' code, but it is ALL program under test.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-09 16:31 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Vp6dnRLRdrUgs2fCnZ2dnUU7-efNnZ2d@giganews.com> |
| In reply to | #27843 |
On 1/9/2021 3:46 PM, Richard Damon wrote: > On 1/9/21 2:18 PM, olcott wrote: >> On 1/9/2021 12:57 PM, Richard Damon wrote: >>> On 1/9/21 10:36 AM, olcott wrote: >>>> On 1/9/2021 5:46 AM, Malcolm McLean wrote: >>>>> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: >>>>>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: >>>>>> >>>>>>> You have explained, clearly, the ways in which the two algorithms >>>>>>> differ: one is a simulation that does not return a value, the other >>>>>>> is a >>>>>>> partial simulation that does. I can't see why you want to deny this >>>>>>> now. It the core of the ruse you are trying to pull. >>>>>> >>>>>> How can you say something as stupid as this knowing that I have >>>>>> repeatedly told you many times that there is only one single >>>>>> instance of >>>>>> the machine code? >>>>>> >>>>> A halt decider has to be a function of the input machine and the input >>>>> machine's tape. If it is a function of the input machine, the input >>>>> machine's tape, and something else, even a simple flag, then it's >>>>> easy to meet Linz's challenge. If you disguise the "something else" >>>>> then >>>>> it might be a clever cheat, but it's just a cheat. >>>> >>>> There cannot possibly be such thing as an actual cheat. >>>> If the Halt decider correctly decides that the input meets the >>>> specification of this infinite recursion axiom then it has correctly >>>> decided what would otherwise be infinite recursion: >>>> >>>> We can see that the halt decider did correctly decide that the prior >>>> invocation was infinitely recursive on the basis of: >>>> (a) The same function is called >>>> (b) From the same machine address >>>> (c) With the same data // Richard Damon credit >>>> (c) A second time >>>> (d) Without any control flow instructions inbetween >>> >>> >>> By which rules, Halts is infinitely recursive and thus non-halting and >>> thus fails to meet the requirements of a decider. >>> >> >> Did you notice that I gave you credit for the (c) part of that? > > Yes. >> >> This aspect was the only valid critique of any material imperfection of >> any aspect of my whole Halts() / H() correctly deciding H_Hat() >> presentation. Every other critique of the correctness of my work was >> entirely based on a lack of correct understanding. >> > > Nope, that was just a simple example that was quick to provide. > > You 'proof' fails the simple test of observing what happens after Halts > returns (or observing that Halts fails to returns and thus fails). > If you make sure to ignore every detail of the execution trace then based on this ignorance it may seemed that I have not proved my point. If you try to find an actual mistake and fail because there are no mistakes then (then and only then) you might understand. >> The halt decider simply simulates the program under test (PUT) until it >> detects that this PUT meets the infinite recursion detection axiom >> criteria. > > I note that you are now calling this rule an Axiom. An Axiom is usually > a generally accepted truth. Do you have ANY source (other than yourself) https://www.merriam-webster.com/dictionary/axiom 2: an established rule or principle or a self-evident truth Infinite Recursion detection AXIOM (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 I refer to this updated version as an axiom on the basis that it is impossibly false thus a [self-evident truth] as required by the definition of axiom. In epistemology (theory of knowledge), a self-evident proposition is a proposition that is known to be true by understanding its meaning without proof... https://en.wikipedia.org/wiki/Self-evidence That the same function called with the same data must derive the same result is an axiom of computer science. > of someone else proposing this 'Axiom' as you are using it. The other > definition is something self-evidently true to all, as far as I see, > only YOU seem to think this is self evident in the way you are using it. > It can be verified as true entirely on the basis of its meaning. > I will note, the key deficiency between YOUR use and what is generally > accepted is that you are excluding 'system' code in the loop. THAT is > what you need to establish as something commonly accepted. I have no idea what this could possibly mean. >> >> When we keep a strict wall of separation between the halt decider and >> its program under test then the halt decider only examines the execution >> trace of the program under test as the whole basis of its halting decision. >> >> When the infinite recursion detection axiom criteria is met then this >> meets the non-halting criteria: >> >> On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >>> A computation that would not halt if its simulation were not >>> halted is indeed a non-halting computation. >> >> On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: >>> Every computation that would not halt if its simulation >>> were not halted is by logical necessity a non-halting computation. >> >> Then the halt decider can stop simulating its input and report not halting. >> >>> The real probelm is that (d) isn't satisfied as there IS a control flow >>> instruction between, hidden in Halts. >>> >>> Your hiding that part of the trace is the cheat. >>> >> >> It is merely the strict wall of separation between the halt decider and >> its program under test. The halt decider only examines the behavior of >> the program under test until it determines that this behavior meets the >> criteria of one of the two non-halting AXIOMS. >> > > BUT that is incorrect. There should be a wall of seperation between > Halts and the program that it simulates, but there can NOT be a wall of > seperation between Halts and its caller. > There is ALWAYS a wall of separation between Halts() and the program that it simulates under every possible condition ALL THE TIME including when H_Hat() invokes Halts(). We are not freaking answering the question does H_Hat() halt on its freaking input? We are answering the question: Does the simulator of H_Hat() have to stop simulating H_Hat() to prevent the infinite execution of H_Hat() ? Halts() makes sure to screen out ALL of its own code (and all the operating system code) when it is doing halt deciding. It is utterly forbidden to examine its own code when it makes its halting decision. If Halts() was allowed to examine its own code this would taint the halting decision and not maintain the required wall of separation. > In fact, when Halts simulates the program under input, the trace it sees > should include ALL of the code that that input program generates, > NOTHING in there is really 'system' code, but it is ALL program under test. > -- 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-09 18:35 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <p5rKH.11495$qi2.1509@fx20.iad> |
| In reply to | #27848 |
On 1/9/21 5:31 PM, olcott wrote: > On 1/9/2021 3:46 PM, Richard Damon wrote: >> On 1/9/21 2:18 PM, olcott wrote: >>> On 1/9/2021 12:57 PM, Richard Damon wrote: >>>> On 1/9/21 10:36 AM, olcott wrote: >>>>> On 1/9/2021 5:46 AM, Malcolm McLean wrote: >>>>>> On Saturday, 9 January 2021 at 02:35:52 UTC, olcott wrote: >>>>>>> On 1/8/2021 8:22 PM, Ben Bacarisse wrote: >>>>>>> >>>>>>>> You have explained, clearly, the ways in which the two algorithms >>>>>>>> differ: one is a simulation that does not return a value, the other >>>>>>>> is a >>>>>>>> partial simulation that does. I can't see why you want to deny this >>>>>>>> now. It the core of the ruse you are trying to pull. >>>>>>> >>>>>>> How can you say something as stupid as this knowing that I have >>>>>>> repeatedly told you many times that there is only one single >>>>>>> instance of >>>>>>> the machine code? >>>>>>> >>>>>> A halt decider has to be a function of the input machine and the >>>>>> input >>>>>> machine's tape. If it is a function of the input machine, the input >>>>>> machine's tape, and something else, even a simple flag, then it's >>>>>> easy to meet Linz's challenge. If you disguise the "something else" >>>>>> then >>>>>> it might be a clever cheat, but it's just a cheat. >>>>> >>>>> There cannot possibly be such thing as an actual cheat. >>>>> If the Halt decider correctly decides that the input meets the >>>>> specification of this infinite recursion axiom then it has correctly >>>>> decided what would otherwise be infinite recursion: >>>>> >>>>> We can see that the halt decider did correctly decide that the prior >>>>> invocation was infinitely recursive on the basis of: >>>>> (a) The same function is called >>>>> (b) From the same machine address >>>>> (c) With the same data // Richard Damon credit >>>>> (c) A second time >>>>> (d) Without any control flow instructions inbetween >>>> >>>> >>>> By which rules, Halts is infinitely recursive and thus non-halting and >>>> thus fails to meet the requirements of a decider. >>>> >>> >>> Did you notice that I gave you credit for the (c) part of that? >> >> Yes. >>> >>> This aspect was the only valid critique of any material imperfection of >>> any aspect of my whole Halts() / H() correctly deciding H_Hat() >>> presentation. Every other critique of the correctness of my work was >>> entirely based on a lack of correct understanding. >>> >> >> Nope, that was just a simple example that was quick to provide. >> >> You 'proof' fails the simple test of observing what happens after Halts >> returns (or observing that Halts fails to returns and thus fails). >> > > If you make sure to ignore every detail of the execution trace then > based on this ignorance it may seemed that I have not proved my point. Which shows that Halts also has non-halting exection when called by H_Hat and thus has failed at its role of being a decider, OR that the global halt decider (using the same set of rules) has falsed made that decision, thus showing a flaw in uoir premise. > > If you try to find an actual mistake and fail because there are no > mistakes then (then and only then) you might understand. You are starting from a false 'axiom', thus your logic is unsound. You get an answer that shows your > >>> The halt decider simply simulates the program under test (PUT) until it >>> detects that this PUT meets the infinite recursion detection axiom >>> criteria. >> >> I note that you are now calling this rule an Axiom. An Axiom is usually >> a generally accepted truth. Do you have ANY source (other than yourself) > > https://www.merriam-webster.com/dictionary/axiom > 2: an established rule or principle or a self-evident truth > > Infinite Recursion detection AXIOM > (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 > > I refer to this updated version as an axiom on the basis that it is > impossibly false thus a [self-evident truth] as required by the > definition of axiom. Checking that definition: Established: Nope, Not as you use it. (Can you cite a source) Self-Evident: Nope, As I said before, only seems to be to you. Both of these seem to fail when you include your implied altreration that only code outside of Halts is to be considered. (Your Logical Flaw) > > In epistemology (theory of knowledge), a self-evident proposition is a > proposition that is known to be true by understanding its meaning > without proof... https://en.wikipedia.org/wiki/Self-evidence Yep, your Axiom fails this test when you include the fact that the conditional inside Halts for some unknown reason does not count. > > That the same function called with the same data must derive the same > result is an axiom of computer science. Yes, Halts, when called with the same input MUST return the same results, thus when H_Hat calls it, it MSUT return 0 and then Halt, thus showing that Halts was wrong. > >> of someone else proposing this 'Axiom' as you are using it. The other >> definition is something self-evidently true to all, as far as I see, >> only YOU seem to think this is self evident in the way you are using it. >> > > It can be verified as true entirely on the basis of its meaning. NOPE, not when you incude your implied modification that you don't count the conditional inside Halts. > >> I will note, the key deficiency between YOUR use and what is generally >> accepted is that you are excluding 'system' code in the loop. THAT is >> what you need to establish as something commonly accepted. > > I have no idea what this could possibly mean. Your published equivalent to Halts includes conditional execution code to allow it to return to its caller when the potentially infinite recursion occurs. This breaks your assumptions. > >>> >>> When we keep a strict wall of separation between the halt decider and >>> its program under test then the halt decider only examines the execution >>> trace of the program under test as the whole basis of its halting >>> decision. >>> >>> When the infinite recursion detection axiom criteria is met then this >>> meets the non-halting criteria: >>> >>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >>>> A computation that would not halt if its simulation were not >>>> halted is indeed a non-halting computation. >>> >>> On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote: >>>> Every computation that would not halt if its simulation >>>> were not halted is by logical necessity a non-halting computation. >>> >>> Then the halt decider can stop simulating its input and report not >>> halting. >>> >>>> The real probelm is that (d) isn't satisfied as there IS a control flow >>>> instruction between, hidden in Halts. >>>> >>>> Your hiding that part of the trace is the cheat. >>>> >>> >>> It is merely the strict wall of separation between the halt decider and >>> its program under test. The halt decider only examines the behavior of >>> the program under test until it determines that this behavior meets the >>> criteria of one of the two non-halting AXIOMS. >>> >> >> BUT that is incorrect. There should be a wall of seperation between >> Halts and the program that it simulates, but there can NOT be a wall of >> seperation between Halts and its caller. >> > > There is ALWAYS a wall of separation between Halts() and the program > that it simulates under every possible condition ALL THE TIME including > when H_Hat() invokes Halts(). The program that calls Halts and the Program Halts simulates are distincgs progras. If Halts acts differently when called by H_Hat then by main(), thus it must NOT be a true function, and thus it is NOT the model of a Turing Machine. CLAIMED PROOF VOIDED > > We are not freaking answering the question does H_Hat() halt on its > freaking input? The ONLY question to the classical Halting Problem is would the program and input given to the Halting Decide Halt or run forever if actually run. PERIOD. > > We are answering the question: Does the simulator of H_Hat() have to > stop simulating H_Hat() to prevent the infinite execution of H_Hat() ? IF that is the question you are asking, which is different than the classical halting problem, your need to remove ALL references to your implication to classical Halting Problem Theory, because your pr0of has NOTHING to do with it. > > Halts() makes sure to screen out ALL of its own code (and all the > operating system code) when it is doing halt deciding. It is utterly > forbidden to examine its own code when it makes its halting decision. Why? > > If Halts() was allowed to examine its own code this would taint the > halting decision and not maintain the required wall of separation. Nope, It needs to actually examine ALL of the program under input. Which also brings up the interesting question that was brought up elsewhere. In the ACTUAL Halting Problem, the Turing Machine H actually exists in several distinct parts in the proof, as SEPERATE entities. It exists once as either the piece of H_Hat run as the top machine, or as the top machine which is given the input. There IS a second copy, in the representation of H_Hat that is provided on the tape. Your combining these two actually breaks the Equivalence model for the Turing Machines in Linz's proof (and others). By having the various copies of H_Hat and Halts share actual code, you have broken your equivalency to the Needed Turing Machines. You really do NEED to have that duplication step in H_Hat making a REAL copy of the representation
[toc] | [prev] | [next] | [standalone]
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-01-09 17:22 -0800 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <43ca17ed-49ce-4d96-9cef-b7806c787129n@googlegroups.com> |
| In reply to | #27848 |
On Saturday, January 9, 2021 at 2:31:32 PM UTC-8, olcott wrote: > > > If you make sure to ignore every detail of the execution trace then > based on this ignorance it may seemed that I have not proved my point. > > If you try to find an actual mistake and fail because there are no > mistakes then (then and only then) you might understand. Reading an execution trace proves nothing. What is the point you imagine it will prove. No one will find any mistakes in the trace. It is simply a presentation of alleged facts.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-09 19:36 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <HN-dnVwEBeizx2fCnZ2dnUU7-YPNnZ2d@giganews.com> |
| In reply to | #27855 |
On 1/9/2021 7:22 PM, dklei...@gmail.com wrote:
> On Saturday, January 9, 2021 at 2:31:32 PM UTC-8, olcott wrote:
>>>
>> If you make sure to ignore every detail of the execution trace then
>> based on this ignorance it may seemed that I have not proved my point.
>>
>> If you try to find an actual mistake and fail because there are no
>> mistakes then (then and only then) you might understand.
>
> Reading an execution trace proves nothing. What is the point you imagine
> it will prove. No one will find any mistakes in the trace. It is simply a
> presentation of alleged facts.
>
If you understand the mapping between the C language and the x86
language and you understand this:
Infinite Recursion detection AXIOM
(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
then the x86 execution trace of this
void H_Hat(u32 P)
{
Output("H_Hat(P)", P);
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt =", Input_Would_Halt);
}
proves this:
By showing how the simplest form of how the:
"Do the opposite of whatever the halt decider decides"
basis of all the conventional halting problem undecidability
proofs is correctly decided as non-halting I have refuted
the basis of all of these proofs.
Now we construct a new Turing machine D with H
as a subroutine. This new TM calls H to determine
what M does when the input to M is its own description
<M>. Once D has determined this information,
it does the opposite. That is, it rejects if M accepts and
accepts if M does not accept. (Sipser 1997)
http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-10 02:10 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210109180210.993@kylheku.com> |
| In reply to | #27856 |
["Followup-To:" header set to comp.theory.]
On 2021-01-10, olcott <NoOne@NoWhere.com> wrote:
> On 1/9/2021 7:22 PM, dklei...@gmail.com wrote:
>> On Saturday, January 9, 2021 at 2:31:32 PM UTC-8, olcott wrote:
>>>>
>>> If you make sure to ignore every detail of the execution trace then
>>> based on this ignorance it may seemed that I have not proved my point.
>>>
>>> If you try to find an actual mistake and fail because there are no
>>> mistakes then (then and only then) you might understand.
>>
>> Reading an execution trace proves nothing. What is the point you imagine
>> it will prove. No one will find any mistakes in the trace. It is simply a
>> presentation of alleged facts.
>>
>
> If you understand the mapping between the C language and the x86
> language and you understand this:
>
> Infinite Recursion detection AXIOM
> (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
>
> then the x86 execution trace of this
>
> void H_Hat(u32 P)
> {
> Output("H_Hat(P)", P);
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
The fact is, that this obtains a value of 0 and halts.
You know it, which is why you refuse to post a test case which does
include that call.
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
This call to Halts simulates H_Hat(H_Hat). That simulated H_Hat
is also progressing toward halting, because it calls Halts(P, P)
which is working toward the same zero. Only, this is never reached
because this is one simulation level deeper.
The inner Halts is looking for the same terminating condition, but since
it is nested, it has no chance to get that far. The outer-most, oldest
simulation terminates everything first.
Botom line, 0 is the wrong answer: H_Hat(H_Hat) halts. A top-level call
will clearly halt. The simulated H_Hat(H_Hat) doesn't have a chance to
halt, only because the simulator aborts the simulation and wrongly
proclaims that H_Hat(H_Hat) doesn't halt.
--
TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-09 23:12 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Y5GdnRKKWYVfEWfCnZ2dnUU7-VfNnZ2d@giganews.com> |
| In reply to | #27857 |
On 1/9/2021 8:10 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2021-01-10, olcott <NoOne@NoWhere.com> wrote:
>> On 1/9/2021 7:22 PM, dklei...@gmail.com wrote:
>>> On Saturday, January 9, 2021 at 2:31:32 PM UTC-8, olcott wrote:
>>>>>
>>>> If you make sure to ignore every detail of the execution trace then
>>>> based on this ignorance it may seemed that I have not proved my point.
>>>>
>>>> If you try to find an actual mistake and fail because there are no
>>>> mistakes then (then and only then) you might understand.
>>>
>>> Reading an execution trace proves nothing. What is the point you imagine
>>> it will prove. No one will find any mistakes in the trace. It is simply a
>>> presentation of alleged facts.
>>>
>>
>> If you understand the mapping between the C language and the x86
>> language and you understand this:
>>
>> Infinite Recursion detection AXIOM
>> (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
>>
>> then the x86 execution trace of this
>>
>> void H_Hat(u32 P)
>> {
>> Output("H_Hat(P)", P);
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>
> The fact is, that this obtains a value of 0 and halts.
>
> You know it, which is why you refuse to post a test case which does
> include that call.
>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>
> This call to Halts simulates H_Hat(H_Hat). That simulated H_Hat
> is also progressing toward halting, because it calls Halts(P, P)
> which is working toward the same zero. Only, this is never reached
> because this is one simulation level deeper.
>
It is infinitely one simulation level deeper that is why aborting its
execution before it returns a value to H_Hat() is required.
> The inner Halts is looking for the same terminating condition, but since
> it is nested, it has no chance to get that far. The outer-most, oldest
> simulation terminates everything first.
>
> Botom line, 0 is the wrong answer: H_Hat(H_Hat) halts.
It is only the wrong answer if we are asking the question:
Does the input halt on its input?
If we are asking the question:
Does the simulation of the input have to be stopped to prevent its
otherwise infinite execution?
Then it is the right answer.
I may quit talking to you you seem too damned disrespectful.
You are totally ignoring my explanations.
> A top-level call
> will clearly halt. The simulated H_Hat(H_Hat) doesn't have a chance to
> halt, only because the simulator aborts the simulation and wrongly
> proclaims that H_Hat(H_Hat) doesn't halt.
>
>
--
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-10 09:48 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210109233423.863@kylheku.com> |
| In reply to | #27860 |
On 2021-01-10, olcott <NoOne@NoWhere.com> wrote:
> On 1/9/2021 8:10 PM, Kaz Kylheku wrote:
>> On 2021-01-10, olcott <NoOne@NoWhere.com> wrote:
>>> On 1/9/2021 7:22 PM, dklei...@gmail.com wrote:
>>>> On Saturday, January 9, 2021 at 2:31:32 PM UTC-8, olcott wrote:
>>>>>>
>>>>> If you make sure to ignore every detail of the execution trace then
>>>>> based on this ignorance it may seemed that I have not proved my point.
>>>>>
>>>>> If you try to find an actual mistake and fail because there are no
>>>>> mistakes then (then and only then) you might understand.
>>>>
>>>> Reading an execution trace proves nothing. What is the point you imagine
>>>> it will prove. No one will find any mistakes in the trace. It is simply a
>>>> presentation of alleged facts.
>>>>
>>>
>>> If you understand the mapping between the C language and the x86
>>> language and you understand this:
>>>
>>> Infinite Recursion detection AXIOM
>>> (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
>>>
>>> then the x86 execution trace of this
>>>
>>> void H_Hat(u32 P)
>>> {
>>> Output("H_Hat(P)", P);
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>
>> The fact is, that this obtains a value of 0 and halts.
>>
>> You know it, which is why you refuse to post a test case which does
>> include that call.
>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>
>> This call to Halts simulates H_Hat(H_Hat). That simulated H_Hat
>> is also progressing toward halting, because it calls Halts(P, P)
>> which is working toward the same zero. Only, this is never reached
>> because this is one simulation level deeper.
>>
>
> It is infinitely one simulation level deeper that is why aborting its
> execution before it returns a value to H_Hat() is required.
I believe what you have is this:
top: Halts() -> Loop(DebugStep())
|
v
sim0: H_Hat(H_Hat) -> Halts() -> Loop(DebugStep())
|
v
sim1: H_Hat(H_Hat) -> Halts() ...
Each Loop(DebugStep()) is the same, and will allow the simulation to
proceed to several levels below it. Therefore the topmost loop
dominates; it determines the actual depth. But the loops are otherwise
the same; each one has the logic to potentially detect the terminating
condition and cause Halts to return a 0 to H_Hat.
This diagram also exposes some problem in your work.
You keep claiming that infinite recursion is detected when the same
address is being called over and over without any branch instructions
in between, or something of that sort.
BUT! You don't have an actual direct recursion. The recursion proceeds
through a nesting of simulation levels. At each descent into a new
simulation level, there is a call to Halts(P, P) which runs a loop
around the DebugStep function, thereby "calling" P(P) indirectly.
That loop's compiled code has got have some test and
branch instructions in it! So does DebugStep.
Something is amiss ... how can it be that a recursion occurs
consisting of nothing but a linear instruction stream interrupted
by calls back to the same address, when in fact it has to pass
through a complicated loop?
>
>> The inner Halts is looking for the same terminating condition, but since
>> it is nested, it has no chance to get that far. The outer-most, oldest
>> simulation terminates everything first.
>>
>> Botom line, 0 is the wrong answer: H_Hat(H_Hat) halts.
>
> It is only the wrong answer if we are asking the question:
> Does the input halt on its input?
I mean, we must not be asking any other question, if we are discussing
the halting problem.
> If we are asking the question:
> Does the simulation of the input have to be stopped to prevent its
> otherwise infinite execution?
> Then it is the right answer.
On the surface, that means exactly the same thing. If a machine does not
terminate, then if it is simulated, the only way to prevent infinite
execution is to forcibly stop the simulator. If a machine terminates,
then there is no infinite execution to prevent; if we just wait for it
to terminate, the simulation will stop.
You've not said anything different in the second question; you've just
added the assumption that a halt decider uses simulation techniques.
(The halting problem proofs don't dictate any specific techniques;
their result holds regardless of what technique is used to produce
a candidate decider).
But, you have a subtext which makes it a different question.
When you say "simulation has to be stopped", what it means is that
the definition of Halts changes from one whose DebugStep loop simulates
P(I) until termination, to one which recognizes some situations and
returns early with a 0.
When you say "otherwise infinite execution", that refers
to the original H_Hat calling the original Halts which simulates
until termination.
Because no Turing Machine has any "otherwise infinite" or otherwise
anything; it is what it is. If we have a TM that doesn't have infinite
execution, then anything that has "oherwise infinite" execution is
necessarily a differnt TM.
I don't understand how you can be satisfied with such a bamboozled
framework of thinking, whereby you pretend that two different TMs are
the same thing.
> I may quit talking to you you seem too damned disrespectful.
You've already admitted that your program is not dealing with the
original, real halting question, so what else is there to say?
> You are totally ignoring my explanations.
All that matters to me is that H_Hat(H_Hat) halts, but your Halts(H_Hat,
H_Hat) must necessarily return 0. That shows that there is a
counterexample against your decider (the proof is working).
What you're calling explanations is just implorations to have the
incorrect result be accepted as correct, by means of begging people
to accept a strawman version of the halting problem.
Your strawman version of he halting problem is based on intellectual
errors, like regarding two (or more) different TMs/functions as being
one and the same. You cannot derive any truth from intellectual errors.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-10 08:40 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <XsDKH.48545$li2.7647@fx22.iad> |
| In reply to | #27860 |
On 1/10/21 12:12 AM, olcott wrote: > > > It is only the wrong answer if we are asking the question: > Does the input halt on its input? > > If we are asking the question: > Does the simulation of the input have to be stopped to prevent its > otherwise infinite execution? > > Then it is the right answer. > At which point you need to admit that you aren't working on the classical Hating Problem, which asks the first question, but some other question, and thus your answer isn't applicable to proofs like Linz which ARE based on the first question. Your insistance otherwise is basically saying that the you have made some amazing discovery about how dogs bark by studing the meow of the cat. Unless you can PROVE that the results happen to be applicable, it isn't.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-01-10 05:53 -0800 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <397fb52f-8e44-45d5-b9bd-2189f1444354n@googlegroups.com> |
| In reply to | #27864 |
On Sunday, 10 January 2021 at 13:40:10 UTC, Richard Damon wrote: > On 1/10/21 12:12 AM, olcott wrote: > > > > > > It is only the wrong answer if we are asking the question: > > Does the input halt on its input? > > > > If we are asking the question: > > Does the simulation of the input have to be stopped to prevent its > > otherwise infinite execution? > > > > Then it is the right answer. > > > At which point you need to admit that you aren't working on the > classical Hating Problem, which asks the first question, but some other > question, and thus your answer isn't applicable to proofs like Linz > which ARE based on the first question. > > Your insistance otherwise is basically saying that the you have made > some amazing discovery about how dogs bark by studing the meow of the > cat. Unless you can PROVE that the results happen to be applicable, it > isn't. > There are two obvious cheats. The first is to say that H is not a function of P and I, but P, I and a flag which is set when called from H_Hat, clear when called elsewhere. The second is to say that H aborts rather than returning a value, so H_Hat never gets the chance to invert its behaviour. Stated as baldly as this, anyone would reject them as clearly violating the conditions, and therefore of no interest. However if you disguise them, it might not be so clear that this is the core of what you are doing. Changing the question is the second cheat. To give credit where it is due, it's not entirely obvious that this is what is happening.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-11 12:34 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <s7ednfJDcMW6B2HCnZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #27865 |
On 1/10/2021 7:53 AM, Malcolm McLean wrote: > On Sunday, 10 January 2021 at 13:40:10 UTC, Richard Damon wrote: >> On 1/10/21 12:12 AM, olcott wrote: >>> >>> >>> It is only the wrong answer if we are asking the question: >>> Does the input halt on its input? >>> >>> If we are asking the question: >>> Does the simulation of the input have to be stopped to prevent its >>> otherwise infinite execution? >>> >>> Then it is the right answer. >>> >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but some other >> question, and thus your answer isn't applicable to proofs like Linz >> which ARE based on the first question. >> >> Your insistance otherwise is basically saying that the you have made >> some amazing discovery about how dogs bark by studing the meow of the >> cat. Unless you can PROVE that the results happen to be applicable, it >> isn't. >> > There are two obvious cheats. > > The first is to say that H is not a function of P and I, but P, I and a flag which > is set when called from H_Hat, clear when called elsewhere. > The second is to say that H aborts rather than returning a value, so H_Hat > never gets the chance to invert its behaviour. This moronically stupid statement presumes that there are cases where a function called in infinite recursion must still return a value to its caller. Maybe there are also cases where a baby kitten actually is a type of office building? When a simulator simulates an input program on its input and this simulation would be infinite unless it was stopped then this simulator becomes a correct halt decider for this input when it decides to stop this simulation and report non-halting. > Stated as baldly as this, anyone would reject them as clearly violating the > conditions, and therefore of no interest. However if you disguise them, it might > not be so clear that this is the core of what you are doing. Changing the question > is the second cheat. To give credit where it is due, it's not entirely obvious that > this is what is happening. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-10 15:09 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87bldwvnen.fsf@bsb.me.uk> |
| In reply to | #27864 |
Richard Damon <Richard@Damon-Family.org> writes: > On 1/10/21 12:12 AM, olcott wrote: >> >> >> It is only the wrong answer if we are asking the question: >> Does the input halt on its input? >> >> If we are asking the question: >> Does the simulation of the input have to be stopped to prevent its >> otherwise infinite execution? >> >> Then it is the right answer. >> > > At which point you need to admit that you aren't working on the > classical Hating Problem, which asks the first question, but some other > question, and thus your answer isn't applicable to proofs like Linz > which ARE based on the first question. Yes, except that the question "Does the simulation of the input have to be stopped to prevent its otherwise infinite execution" is, itself, the classical halting problem. PO is so at sea with all this that he does not know that he has re-defined the halting problem so as to require a solution to the halting problem. I think he /partly/ gets this, because pointing this out causes him to flip to saying that he only needs to spot one case because he's not writing a halt decider, only trying to show an H that does the impossible by getting the confounding case right. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-10 17:43 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210110085833.562@kylheku.com> |
| In reply to | #27867 |
On 2021-01-10, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/10/21 12:12 AM, olcott wrote: >>> >>> >>> It is only the wrong answer if we are asking the question: >>> Does the input halt on its input? >>> >>> If we are asking the question: >>> Does the simulation of the input have to be stopped to prevent its >>> otherwise infinite execution? >>> >>> Then it is the right answer. >>> >> >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but some other >> question, and thus your answer isn't applicable to proofs like Linz >> which ARE based on the first question. > > Yes, except that the question "Does the simulation of the input have to > be stopped to prevent its otherwise infinite execution" is, itself, the > classical halting problem. Right; so it appears, if we treat the language very informally. The question has an interpretation which is identical to the regular halting question. But when we look at it closely, something is wrong: a TM does not actually have any "otherwise infinite" execution. What Olcott is saying in the question is that some TM that would otherwise have infinite execution has to have its simulation stopped and there become terminating. The pronoun "its" in the sentence is equivocating between different TMs. Olcott is on a program of eliminating "pathological self reference", and to that aim, he has come up with the idea that you can change the instruction set of a UTM to change the behavior of a TM tape. He knows you get two different TMs that way, and that is what eliminates the self-reference. Yet, he believes there is some sense in which they are the same TM due to the same tape contents. That confusion allows for verbal equivocation: sentences and terms that look like they are about the original halting problem can be used to write about what he is doing such that it looks like halting is being decided. All you have to do is use the same symbol to refer to two different machines (same tape, simulated in different modes). X1 decides X0. Since they are the same machine code with the same inputs, let's just sweep that under the rug and say X decides X. Perhaps he believes that the error he has introduced of treating different machines as if they were one is minor compared to eliminating the grave error of "pathological self-reference". There are situations in software in which if you replace a huge bug with a minor bug, that's legitimate improvement and all users should still switch to that new version. :) -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-11 12:43 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <JqadneR7yvjfAWHCnZ2dnUU7-aPNnZ2d@giganews.com> |
| In reply to | #27868 |
On 1/10/2021 11:43 AM, Kaz Kylheku wrote: > On 2021-01-10, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/10/21 12:12 AM, olcott wrote: >>>> >>>> >>>> It is only the wrong answer if we are asking the question: >>>> Does the input halt on its input? >>>> >>>> If we are asking the question: >>>> Does the simulation of the input have to be stopped to prevent its >>>> otherwise infinite execution? >>>> >>>> Then it is the right answer. >>>> >>> >>> At which point you need to admit that you aren't working on the >>> classical Hating Problem, which asks the first question, but some other >>> question, and thus your answer isn't applicable to proofs like Linz >>> which ARE based on the first question. >> >> Yes, except that the question "Does the simulation of the input have to >> be stopped to prevent its otherwise infinite execution" is, itself, the >> classical halting problem. > > Right; so it appears, if we treat the language very informally. > The question has an interpretation which is identical to the regular > halting question. > > But when we look at it closely, something is wrong: a TM does not > actually have any "otherwise infinite" execution. Unless the simulator decides to stop simulating H_Hat() (or any other program) when it matches this criteria H_Hat() (or any other progam) executes forever. Infinite Recursion detection AXIOM (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 This can be understood to be necessarily true and thus impossibly false. -- 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-11 19:01 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210111105354.355@kylheku.com> |
| In reply to | #27883 |
On 2021-01-11, olcott <NoOne@NoWhere.com> wrote: > Unless the simulator decides to stop simulating H_Hat() (or any other > program) when it matches this criteria H_Hat() (or any other progam) > executes forever. > > Infinite Recursion detection AXIOM > (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 There are control flow instructions in the loop that Halts wraps around DebugStep. The loop calls DebugStep and then looks at some conditions that determine whether the loop should break out. Those conditions must necessarily translate to control flow instructions. Halts never calls H_Hat directly; it indirectly calls it by initializing a simulator and calling DebugStep in a loop. The execution of that loop is interleaved with the stepping of H_Hat, therefore. Whenever DebugStep is called, an instruction of H_Hat proceeds. Then it returns, and insructions of the Halt function's loop are executing. (These may themselves be stepped by a higher level DebugStep). Anyway, the overall instruction stream has a mixture of control flow coming from the loop, and therefore there must be control flow instructions. Therefore, something is off about that recursion detection "axiom". (Not that it matters, since all that matters ultimately that somehow the contraption *does* manage to prevent infinite recursion, and in so doing creates a H_Hat(H_Hat) variant that terminates, while the answer from the decider, when it is interrogated about that variant, is the incorrect value 0.) -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-10 13:00 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <IgHKH.9339$dL.4680@fx17.iad> |
| In reply to | #27867 |
On 1/10/21 10:09 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/10/21 12:12 AM, olcott wrote: >>> >>> >>> It is only the wrong answer if we are asking the question: >>> Does the input halt on its input? >>> >>> If we are asking the question: >>> Does the simulation of the input have to be stopped to prevent its >>> otherwise infinite execution? >>> >>> Then it is the right answer. >>> >> >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but some other >> question, and thus your answer isn't applicable to proofs like Linz >> which ARE based on the first question. > > Yes, except that the question "Does the simulation of the input have to > be stopped to prevent its otherwise infinite execution" is, itself, the > classical halting problem. PO is so at sea with all this that he does > not know that he has re-defined the halting problem so as to require a > solution to the halting problem. > > I think he /partly/ gets this, because pointing this out causes him to > flip to saying that he only needs to spot one case because he's not > writing a halt decider, only trying to show an H that does the > impossible by getting the confounding case right. > In one sense, he is right that to achieve what he claims he wants to achive (and that he claims he has) that of just breaking the proofs like Linz, all he needs to do is come up with a properly formed H that correctly predicts the results of the H^ built from it. If he could do this, he would do what he wants, but the proof is solid there and he can't. Ultimately, what he is trying to do is build a house of cards where thngs are just slightly off definition so that he can so using convoluted logic that his answer MUST be right, even if other things show it can't be. I think the core issue is Peter can't handle some core concepts that come out of the mathematics that violate his world view. Fundamentally, he can't handle things like the incompleteness principle, as his view of 'Truth' is that if you can't prove it, it isn't true, so an unproveable Truth is a contradiction in terms, missing what this sort of change does to ALL of mathematics and logic. I also suspect that his background isn't strong enough to handle the dive into the mathematics that could investigate that fundamental change in logic.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 09:53 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <NuOdncd1Ws9_WGDCnZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #27867 |
On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/10/21 12:12 AM, olcott wrote: >>> >>> >>> It is only the wrong answer if we are asking the question: >>> Does the input halt on its input? >>> >>> If we are asking the question: >>> Does the simulation of the input have to be stopped to prevent its >>> otherwise infinite execution? >>> >>> Then it is the right answer. >>> >> >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but some other >> question, and thus your answer isn't applicable to proofs like Linz >> which ARE based on the first question. > > Yes, except that the question "Does the simulation of the input have to > be stopped to prevent its otherwise infinite execution" is, itself, the > classical halting problem. This is one of the very rare times that you have ever agreed with me on a material fact. The original halting problem undecidability proof question: Does the input halt on its input? conflates together non-halting inputs with halting inputs and answers yes when: (a) The simulation of the input has to be stopped to prevent its otherwise infinite execution. and also answers yes when: (b) The simulation of the input terminates without having to be stopped. -- 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-12 11:23 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <l2kLH.417$Ht5.338@fx36.iad> |
| In reply to | #27909 |
On 1/12/21 10:53 AM, olcott wrote: > On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/10/21 12:12 AM, olcott wrote: >>>> >>>> >>>> It is only the wrong answer if we are asking the question: >>>> Does the input halt on its input? >>>> >>>> If we are asking the question: >>>> Does the simulation of the input have to be stopped to prevent its >>>> otherwise infinite execution? >>>> >>>> Then it is the right answer. >>>> >>> >>> At which point you need to admit that you aren't working on the >>> classical Hating Problem, which asks the first question, but some other >>> question, and thus your answer isn't applicable to proofs like Linz >>> which ARE based on the first question. >> >> Yes, except that the question "Does the simulation of the input have to >> be stopped to prevent its otherwise infinite execution" is, itself, the >> classical halting problem. > > This is one of the very rare times that you have ever agreed with me on > a material fact. > > The original halting problem undecidability proof question: > Does the input halt on its input? > > conflates together non-halting inputs with halting inputs > > and answers yes when: > (a) The simulation of the input has to be stopped to prevent its > otherwise infinite execution. > > and also answers yes when: > (b) The simulation of the input terminates without having to be stopped. > You are very good at twisting words and definition and stating things awkwardly. The Halting problem question is: Would the Machine which the input represents halt for the input provided. The 'input' isn't a machine itself, it is a representation. It is on the tape, it is not a Turing Machine. Tapes don't halt or not halt on their own, only Turing Machine. Confuse the to and you get gibberish. Yes, you can simulate the input tape, with the representation of its input tape, to help you decide, but what you need to decide on is what that ACTUAL Turing Machine would have done with the ACTUAL input tape. The Halting Problem divides Machine/Input Tape combination neatly into two groups: Those Machine/Inputs that will Halt in finite time Those Machine/Inputs that will not Halt in finite time The problem statement doesn't care a bit about things like the simulator thinking it needs to abort the simulation of the machine because it can't figure out how to handle this machine representation that it was given. It only cases about if that machine, when ACTUALLY run, would halt in finite time or not. And ALL machines will do exactly one of these or the other. Perfect division. YOUR Criteria actually can lead to ambiguity, because depending on how 'smart' the decider is, and what things it attempts to do to handle the self-referential case, can mean that a given Machine/Input combination miight be classified differently by different deciders, and some attempted decider might just fail to classify some machines.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 10:31 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Lr-dnRi0FcVuU2DCnZ2dnUU7-YHNnZ2d@giganews.com> |
| In reply to | #27912 |
On 1/12/2021 10:23 AM, Richard Damon wrote: > On 1/12/21 10:53 AM, olcott wrote: >> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>> >>>> On 1/10/21 12:12 AM, olcott wrote: >>>>> >>>>> >>>>> It is only the wrong answer if we are asking the question: >>>>> Does the input halt on its input? >>>>> >>>>> If we are asking the question: >>>>> Does the simulation of the input have to be stopped to prevent its >>>>> otherwise infinite execution? >>>>> >>>>> Then it is the right answer. >>>>> >>>> >>>> At which point you need to admit that you aren't working on the >>>> classical Hating Problem, which asks the first question, but some other >>>> question, and thus your answer isn't applicable to proofs like Linz >>>> which ARE based on the first question. >>> >>> Yes, except that the question "Does the simulation of the input have to >>> be stopped to prevent its otherwise infinite execution" is, itself, the >>> classical halting problem. >> >> This is one of the very rare times that you have ever agreed with me on >> a material fact. >> >> The original halting problem undecidability proof question: >> Does the input halt on its input? >> >> conflates together non-halting inputs with halting inputs >> >> and answers yes when: >> (a) The simulation of the input has to be stopped to prevent its >> otherwise infinite execution. >> >> and also answers yes when: >> (b) The simulation of the input terminates without having to be stopped. >> > > You are very good at twisting words and definition and stating things > awkwardly. > > The Halting problem question is: Would the Machine which the input > represents halt for the input provided. > I have proved that you are wrong on this many times. You keep conflating the halting problem undecidability proofs with the halting problem itself. Ben agrees with me that you are wrong about this On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but >> some other question, and thus your answer isn't applicable to >> proofs like Linz which ARE based on the first question. > > Yes, except that the question "Does the simulation of the > input have to be stopped to prevent its otherwise infinite > execution" is, itself, the classical halting problem. -- 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-12 11:53 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <3ukLH.15025$5j4.9689@fx21.iad> |
| In reply to | #27914 |
On 1/12/21 11:31 AM, olcott wrote: > On 1/12/2021 10:23 AM, Richard Damon wrote: >> On 1/12/21 10:53 AM, olcott wrote: >>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>> Richard Damon <Richard@Damon-Family.org> writes: >>>> >>>>> On 1/10/21 12:12 AM, olcott wrote: >>>>>> >>>>>> >>>>>> It is only the wrong answer if we are asking the question: >>>>>> Does the input halt on its input? >>>>>> >>>>>> If we are asking the question: >>>>>> Does the simulation of the input have to be stopped to prevent its >>>>>> otherwise infinite execution? >>>>>> >>>>>> Then it is the right answer. >>>>>> >>>>> >>>>> At which point you need to admit that you aren't working on the >>>>> classical Hating Problem, which asks the first question, but some >>>>> other >>>>> question, and thus your answer isn't applicable to proofs like Linz >>>>> which ARE based on the first question. >>>> >>>> Yes, except that the question "Does the simulation of the input have to >>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>> classical halting problem. >>> >>> This is one of the very rare times that you have ever agreed with me on >>> a material fact. >>> >>> The original halting problem undecidability proof question: >>> Does the input halt on its input? >>> >>> conflates together non-halting inputs with halting inputs >>> >>> and answers yes when: >>> (a) The simulation of the input has to be stopped to prevent its >>> otherwise infinite execution. >>> >>> and also answers yes when: >>> (b) The simulation of the input terminates without having to be stopped. >>> >> >> You are very good at twisting words and definition and stating things >> awkwardly. >> >> The Halting problem question is: Would the Machine which the input >> represents halt for the input provided. >> > > I have proved that you are wrong on this many times. > > You keep conflating the halting problem undecidability proofs with the > halting problem itself. May statement of what the halting problem IS has NEVER made a mention of the proof of non-existence of such a decider. The ultimate definition or test of a halting decider is the behavior of the actual machine represented by the input. Any other definition that is not FULLY equivalent is improper. > > Ben agrees with me that you are wrong about this > > On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >>> At which point you need to admit that you aren't working on the >>> classical Hating Problem, which asks the first question, but >>> some other question, and thus your answer isn't applicable to >>> proofs like Linz which ARE based on the first question. >> >> Yes, except that the question "Does the simulation of the >> input have to be stopped to prevent its otherwise infinite >> execution" is, itself, the classical halting problem. > > I don't think you understand the point Ben was making here, his comment was that to MAKE the decision to stop the simulation and KNOW that you HAD to, you need to be able to solve the Halting Problem. Many times when you describe how Halts works, you just mention using a function that tells you if you 'need to abort', and it is THAT function that truly needs to be solving the halting problem (and is thus impossible to actually write to 100% accuracy) In one sense, the statement can be true, because if truly the ONLY reason the simuation would have not been infinite was that you stopped it, then (assuming your simulation is correct) the execution would have been non-halting, but still, the ultimate test is to run that simulation to see if it would halt. The issue is that you have put forward some axioms about 'proving' infinite execution, but when we actually look at some machines that it makes claim are infinite execution, we find that either the machines, when actually run do come to a halt, or that the decider for some reason has failed at being a proper Halting Decider and not returned the answer. This shows you axioms are faulty.
[toc] | [prev] | [next] | [standalone]
Page 9 of 16 — ← Prev page 1 … 7 8 [9] 10 11 … 16 Next page →
Back to top | Article view | comp.theory
csiph-web