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 1 of 16 [1] 2 3 … 16 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-02 12:12 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] |
| Message-ID | <0sKdnRc7UKEYKm3CnZ2dnUU7-dXNnZ2d@giganews.com> |
On 9/5/2004 11:21 AM, Peter Olcott wrote:
> The Liar Paradox can be shown to be nothing more than
> a incorrectly formed statement because of its pathological
> self-reference. The Halting Problem can only exist because
> of this same sort of pathological self-reference.
>
> The primary benefit of solving the Halting Problem was to
> detect programs that failed to halt, thus were incorrect.
> Pathological self-reference can also be viewed as a form
> of error. If the Halting Problem is redefined (which does not
> refute anyone), then this redefined problem can be easily
> solved.
>
> Now we have three possible correct results:
> (a) Halts
> (b) Does Not Halt
> (c) Pathological Self Reference to Halt
>
> Compared to my prior claims, this one seem trivial and
> obvious. Possibly this claim adds a slight nuance to the
> problem that has not been widely discussed before.
> If we construe pathological self-reference as another
> error condition, then this does remove the impossibility
> of creating a useful tool.
I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
mall Omaha NE.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
It turns out that inputs having pathological self-reference can be
decided to be non-halting. The invocation of a halt decider that is
based on simulating the execution of its input can be decided to be
infinitely recursive in the above case.
Within the x86 based execution trace of the above user code:
H_Hat() calls the same function from the same machine address with the
same inputs a second time with no other control flow instructions
inbetween.
The above program meets the criteria of a program with infinite
execution: Any program that would not halt unless its simulation was
stopped is a program with the property of infinite execution.
--
Copyright 2004 and 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-02 13:54 -0500 |
| Message-ID | <fj3IH.10237$EY7.3772@fx13.iad> |
| In reply to | #27719 |
On 1/2/21 1:12 PM, olcott wrote:
> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>> The Liar Paradox can be shown to be nothing more than
>> a incorrectly formed statement because of its pathological
>> self-reference. The Halting Problem can only exist because
>> of this same sort of pathological self-reference.
>>
>> The primary benefit of solving the Halting Problem was to
>> detect programs that failed to halt, thus were incorrect.
>> Pathological self-reference can also be viewed as a form
>> of error. If the Halting Problem is redefined (which does not
>> refute anyone), then this redefined problem can be easily
>> solved.
>>
>> Now we have three possible correct results:
>> (a) Halts
>> (b) Does Not Halt
>> (c) Pathological Self Reference to Halt
>>
>> Compared to my prior claims, this one seem trivial and
>> obvious. Possibly this claim adds a slight nuance to the
>> problem that has not been widely discussed before.
>> If we construe pathological self-reference as another
>> error condition, then this does remove the impossibility
>> of creating a useful tool.
>
> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
> mall Omaha NE.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> It turns out that inputs having pathological self-reference can be
> decided to be non-halting. The invocation of a halt decider that is
> based on simulating the execution of its input can be decided to be
> infinitely recursive in the above case.
>
> Within the x86 based execution trace of the above user code:
> H_Hat() calls the same function from the same machine address with the
> same inputs a second time with no other control flow instructions
> inbetween.
>
> The above program meets the criteria of a program with infinite
> execution: Any program that would not halt unless its simulation was
> stopped is a program with the property of infinite execution.
>
>
But, if Halts does say it is non-halting it halts. So your logic is flawed.
The definition of infinite execution is that it continues to execute
forever.
The fact that a Halt Decider based on simulation has to stop the
execution to meet its requirement to answer is NOT proof of infinite
execution of the program that called that Halt Decider. In fact a call
to a Halt decider can be shown by definition (a semantic tautology) to
be non-halting as long as the decider succeeds at being a decider. Thus
by inspection, H_Hat can be seen to be halting as long as Halts is a
decider that decides it is non-halting.
The actual fact of the matter is that Halts, as you have defined it, is
unable to properly decide on self-referential machines, which puts the
flaw in the halt decider. At each cycle in the recursion, there IS a
conditional controlled by Halts, so there is NOT an unconditional
recursion that forces infinite execution.
If you want to come up with a different statement of the halting
problem, on that uses a criteria other than does the actual machine come
to an eventual halt, feel free, just realize that different question
means different problem.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-02 13:12 -0600 |
| Message-ID | <y-Cdnb8ZSM4JWG3CnZ2dnUU7-bPNnZ2d@giganews.com> |
| In reply to | #27720 |
On 1/2/2021 12:54 PM, Richard Damon wrote:
> On 1/2/21 1:12 PM, olcott wrote:
>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>> The Liar Paradox can be shown to be nothing more than
>>> a incorrectly formed statement because of its pathological
>>> self-reference. The Halting Problem can only exist because
>>> of this same sort of pathological self-reference.
>>>
>>> The primary benefit of solving the Halting Problem was to
>>> detect programs that failed to halt, thus were incorrect.
>>> Pathological self-reference can also be viewed as a form
>>> of error. If the Halting Problem is redefined (which does not
>>> refute anyone), then this redefined problem can be easily
>>> solved.
>>>
>>> Now we have three possible correct results:
>>> (a) Halts
>>> (b) Does Not Halt
>>> (c) Pathological Self Reference to Halt
>>>
>>> Compared to my prior claims, this one seem trivial and
>>> obvious. Possibly this claim adds a slight nuance to the
>>> problem that has not been widely discussed before.
>>> If we construe pathological self-reference as another
>>> error condition, then this does remove the impossibility
>>> of creating a useful tool.
>>
>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>> mall Omaha NE.
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> It turns out that inputs having pathological self-reference can be
>> decided to be non-halting. The invocation of a halt decider that is
>> based on simulating the execution of its input can be decided to be
>> infinitely recursive in the above case.
>>
>> Within the x86 based execution trace of the above user code:
>> H_Hat() calls the same function from the same machine address with the
>> same inputs a second time with no other control flow instructions
>> inbetween.
>>
>> The above program meets the criteria of a program with infinite
>> execution: Any program that would not halt unless its simulation was
>> stopped is a program with the property of infinite execution.
>>
>>
>
> But, if Halts does say it is non-halting it halts. So your logic is flawed.
You are very very persistently as stupid as a jackass.
You are very very persistently as stupid as a jackass.
You are very very persistently as stupid as a jackass.
The original halting problem used the cheap trick of pathological self
reference modeling the halting criteria after the liar paradox.
This fooled people into believing that it is impossible to define a
universal halt decider for 80 years.
No one ever bothered to use categorically exhaustive reasoning to see if
halting deciding criteria could be defined that did not have the cheap
trick of pathological self-reference.
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.
You can continue to act like a complete jackass and simply ignore what I
said, or you can carefully examine it looking for a flaw and find that
there are none.
You can continue to act like a complete jackass and simply ignore what I
said, or you can carefully examine it looking for a flaw and find that
there are none.
You can continue to act like a complete jackass and simply ignore what I
said, or you can carefully examine it looking for a flaw and find that
there are none.
--
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-02 14:36 -0500 |
| Message-ID | <wX3IH.682$ck2.30@fx26.iad> |
| In reply to | #27722 |
On 1/2/21 2:12 PM, olcott wrote:
> On 1/2/2021 12:54 PM, Richard Damon wrote:
>> On 1/2/21 1:12 PM, olcott wrote:
>>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>>> The Liar Paradox can be shown to be nothing more than
>>>> a incorrectly formed statement because of its pathological
>>>> self-reference. The Halting Problem can only exist because
>>>> of this same sort of pathological self-reference.
>>>>
>>>> The primary benefit of solving the Halting Problem was to
>>>> detect programs that failed to halt, thus were incorrect.
>>>> Pathological self-reference can also be viewed as a form
>>>> of error. If the Halting Problem is redefined (which does not
>>>> refute anyone), then this redefined problem can be easily
>>>> solved.
>>>>
>>>> Now we have three possible correct results:
>>>> (a) Halts
>>>> (b) Does Not Halt
>>>> (c) Pathological Self Reference to Halt
>>>>
>>>> Compared to my prior claims, this one seem trivial and
>>>> obvious. Possibly this claim adds a slight nuance to the
>>>> problem that has not been widely discussed before.
>>>> If we construe pathological self-reference as another
>>>> error condition, then this does remove the impossibility
>>>> of creating a useful tool.
>>>
>>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>>> mall Omaha NE.
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> It turns out that inputs having pathological self-reference can be
>>> decided to be non-halting. The invocation of a halt decider that is
>>> based on simulating the execution of its input can be decided to be
>>> infinitely recursive in the above case.
>>>
>>> Within the x86 based execution trace of the above user code:
>>> H_Hat() calls the same function from the same machine address with the
>>> same inputs a second time with no other control flow instructions
>>> inbetween.
>>>
>>> The above program meets the criteria of a program with infinite
>>> execution: Any program that would not halt unless its simulation was
>>> stopped is a program with the property of infinite execution.
>>>
>>>
>>
>> But, if Halts does say it is non-halting it halts. So your logic is
>> flawed.
>
> You are very very persistently as stupid as a jackass.
> You are very very persistently as stupid as a jackass.
> You are very very persistently as stupid as a jackass.
>
> The original halting problem used the cheap trick of pathological self
> reference modeling the halting criteria after the liar paradox.
The Halting Problem is what the Halting problem is. Turing Machines do
allow for this sort of self reference. To call it pathological is a
misstatement. There is no 'pathology' to self reference, in fact it is
part of what allows us to get into the higher reaches of mathematics.
>
> This fooled people into believing that it is impossible to define a
> universal halt decider for 80 years.
But it IS impossible to make a Universal Halting Decider that can decide
the Halting State for ALL Turing Machines. This is in part because
Turing Machines can be built in reference to Turing Machines.
>
> No one ever bothered to use categorically exhaustive reasoning to see if
> halting deciding criteria could be defined that did not have the cheap
> trick of pathological self-reference.
Neither have you. You may have come up with a not so well defined
definition you want to try, but I have yet to see you present a true
FORMAL definition of what you mean. You also seem to have done no ground
work to see if this definition has any actual use.
>
> 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.
>
> You can continue to act like a complete jackass and simply ignore what I
> said, or you can carefully examine it looking for a flaw and find that
> there are none.
>
> You can continue to act like a complete jackass and simply ignore what I
> said, or you can carefully examine it looking for a flaw and find that
> there are none.
>
> You can continue to act like a complete jackass and simply ignore what I
> said, or you can carefully examine it looking for a flaw and find that
> there are none.
>
>
An you can continue to act like one too, and ignore the plain fact that
if your Halts actually does what it is required by its definition, it is
wrong.
You yourself say that one should not go by their own intuition, but by
what can be actually proved.
What greater proof is there than actually running the machine H_Hat, see
the answer that Halts produces (or that it fails to meet requirements by
not producing a results) and then seeing that result be wrong.
You need to understand that theories are based on established
definitions, you can not just make up new meanings for things (at least
not if you want to work in the frameworks).
Yes, if you want, you are free to strive out on new grounds. Try your
new definition for 'halting', and see what you can do with it. First
note that just proving some theories don't apply doesn't mean a lot, as
of course they don't since they use other definitions.
Unless you can actually prove that you CAN create a Accurate Universal
Need to abort Detector (or at least establish broad categories of
machines you can accurate decide on), it won't mean a lot.
But, if you want to try to disprove currently well established theories,
your going to need to keep to the accepted definitions.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-02 13:42 -0600 |
| Message-ID | <Q8OdndZXZ-E5UW3CnZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #27725 |
On 1/2/2021 1:36 PM, Richard Damon wrote:
> On 1/2/21 2:12 PM, olcott wrote:
>> On 1/2/2021 12:54 PM, Richard Damon wrote:
>>> On 1/2/21 1:12 PM, olcott wrote:
>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>>>> The Liar Paradox can be shown to be nothing more than
>>>>> a incorrectly formed statement because of its pathological
>>>>> self-reference. The Halting Problem can only exist because
>>>>> of this same sort of pathological self-reference.
>>>>>
>>>>> The primary benefit of solving the Halting Problem was to
>>>>> detect programs that failed to halt, thus were incorrect.
>>>>> Pathological self-reference can also be viewed as a form
>>>>> of error. If the Halting Problem is redefined (which does not
>>>>> refute anyone), then this redefined problem can be easily
>>>>> solved.
>>>>>
>>>>> Now we have three possible correct results:
>>>>> (a) Halts
>>>>> (b) Does Not Halt
>>>>> (c) Pathological Self Reference to Halt
>>>>>
>>>>> Compared to my prior claims, this one seem trivial and
>>>>> obvious. Possibly this claim adds a slight nuance to the
>>>>> problem that has not been widely discussed before.
>>>>> If we construe pathological self-reference as another
>>>>> error condition, then this does remove the impossibility
>>>>> of creating a useful tool.
>>>>
>>>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>>>> mall Omaha NE.
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> It turns out that inputs having pathological self-reference can be
>>>> decided to be non-halting. The invocation of a halt decider that is
>>>> based on simulating the execution of its input can be decided to be
>>>> infinitely recursive in the above case.
>>>>
>>>> Within the x86 based execution trace of the above user code:
>>>> H_Hat() calls the same function from the same machine address with the
>>>> same inputs a second time with no other control flow instructions
>>>> inbetween.
>>>>
>>>> The above program meets the criteria of a program with infinite
>>>> execution: Any program that would not halt unless its simulation was
>>>> stopped is a program with the property of infinite execution.
>>>>
>>>>
>>>
>>> But, if Halts does say it is non-halting it halts. So your logic is
>>> flawed.
>>
>> You are very very persistently as stupid as a jackass.
>> You are very very persistently as stupid as a jackass.
>> You are very very persistently as stupid as a jackass.
>>
>> The original halting problem used the cheap trick of pathological self
>> reference modeling the halting criteria after the liar paradox.
>
> The Halting Problem is what the Halting problem is. Turing Machines do
> allow for this sort of self reference. To call it pathological is a
> misstatement. There is no 'pathology' to self reference, in fact it is
> part of what allows us to get into the higher reaches of mathematics.
-You are very very persistently as stupid as a jackass.
-You are very very persistently as stupid as a jackass.
-You are very very persistently as stupid as a jackass.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
else
HALT
}
Which of {true, false} is the correct value that Halts() could return to
H_Hat() (you freaking moron) ?
Which of {true, false} is the correct value that Halts() could return to
H_Hat() (you freaking moron) ?
Which of {true, false} is the correct value that Halts() could return to
H_Hat() (you freaking moron) ?
--
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-02 15:16 -0500 |
| Message-ID | <Mw4IH.104999$mg2.50622@fx04.iad> |
| In reply to | #27726 |
On 1/2/21 2:42 PM, olcott wrote:
> On 1/2/2021 1:36 PM, Richard Damon wrote:
>> On 1/2/21 2:12 PM, olcott wrote:
>>> On 1/2/2021 12:54 PM, Richard Damon wrote:
>>>> On 1/2/21 1:12 PM, olcott wrote:
>>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>>>>> The Liar Paradox can be shown to be nothing more than
>>>>>> a incorrectly formed statement because of its pathological
>>>>>> self-reference. The Halting Problem can only exist because
>>>>>> of this same sort of pathological self-reference.
>>>>>>
>>>>>> The primary benefit of solving the Halting Problem was to
>>>>>> detect programs that failed to halt, thus were incorrect.
>>>>>> Pathological self-reference can also be viewed as a form
>>>>>> of error. If the Halting Problem is redefined (which does not
>>>>>> refute anyone), then this redefined problem can be easily
>>>>>> solved.
>>>>>>
>>>>>> Now we have three possible correct results:
>>>>>> (a) Halts
>>>>>> (b) Does Not Halt
>>>>>> (c) Pathological Self Reference to Halt
>>>>>>
>>>>>> Compared to my prior claims, this one seem trivial and
>>>>>> obvious. Possibly this claim adds a slight nuance to the
>>>>>> problem that has not been widely discussed before.
>>>>>> If we construe pathological self-reference as another
>>>>>> error condition, then this does remove the impossibility
>>>>>> of creating a useful tool.
>>>>>
>>>>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>>>>> mall Omaha NE.
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> return;
>>>>> }
>>>>>
>>>>> It turns out that inputs having pathological self-reference can be
>>>>> decided to be non-halting. The invocation of a halt decider that is
>>>>> based on simulating the execution of its input can be decided to be
>>>>> infinitely recursive in the above case.
>>>>>
>>>>> Within the x86 based execution trace of the above user code:
>>>>> H_Hat() calls the same function from the same machine address with the
>>>>> same inputs a second time with no other control flow instructions
>>>>> inbetween.
>>>>>
>>>>> The above program meets the criteria of a program with infinite
>>>>> execution: Any program that would not halt unless its simulation was
>>>>> stopped is a program with the property of infinite execution.
>>>>>
>>>>>
>>>>
>>>> But, if Halts does say it is non-halting it halts. So your logic is
>>>> flawed.
>>>
>>> You are very very persistently as stupid as a jackass.
>>> You are very very persistently as stupid as a jackass.
>>> You are very very persistently as stupid as a jackass.
>>>
>>> The original halting problem used the cheap trick of pathological self
>>> reference modeling the halting criteria after the liar paradox.
>>
>> The Halting Problem is what the Halting problem is. Turing Machines do
>> allow for this sort of self reference. To call it pathological is a
>> misstatement. There is no 'pathology' to self reference, in fact it is
>> part of what allows us to get into the higher reaches of mathematics.
>
> -You are very very persistently as stupid as a jackass.
> -You are very very persistently as stupid as a jackass.
> -You are very very persistently as stupid as a jackass.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> else
> HALT
> }
>
> Which of {true, false} is the correct value that Halts() could return to
> H_Hat() (you freaking moron) ?
>
> Which of {true, false} is the correct value that Halts() could return to
> H_Hat() (you freaking moron) ?
>
> Which of {true, false} is the correct value that Halts() could return to
> H_Hat() (you freaking moron) ?
>
Ask not what answer Halts could return to be correct, ask what answer is
correct for your Halts.
The fact that what ever answer Halts give will be wrong is NOT proof
that the Halting value of H_Hat is indeterminate. H_Hat is built based
on a proposed H (or Halts).
The fact that you can not come up with a right answer for Halts to give
IS the proof that a Halts that gives the right answer can not exist.
Show me a cat that is all black and all white. You can't, because such a
thing can not exist.
In the same way, a Halts that give the right answer to H_Hat can not exist,
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-02 20:04 +0000 |
| Message-ID | <20210102114153.27@kylheku.com> |
| In reply to | #27722 |
On 2021-01-02, olcott <NoOne@NoWhere.com> wrote: > The original halting problem used the cheap trick of pathological self > reference modeling the halting criteria after the liar paradox. So you admit that your method doesn't speak to the original halting problem. Nobody in academia will take you seriously if you insist on working with a vandalized formulation which borrows the language and terminology of the original halting problem, but robs it of its core logical proposition. Hatcheting the halting problem down to an irrelevant strawman and then attacking that strawman successfully is not a noteworthy achievement. Anyone can change the definition of a hard problem in order to mess with the validity of its theorems. If we redefine how exponentiation works, we can change the meaning of Fermat's Last Theorem so that a fifth grader can solve it, right? As long as you do that, you will remain a Usenet crank. If you don't do that, you will also remain a Usenet crank, because the original halting problem is unassailable. Therefore, rationally speaking, you should strive to be remembered as a Usenet crank who at least attacked the right problem.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-02 19:14 +0000 |
| Message-ID | <20210102102944.723@kylheku.com> |
| In reply to | #27719 |
On 2021-01-02, olcott <NoOne@NoWhere.com> wrote:
>> If we construe pathological self-reference as another
>> error condition, then this does remove the impossibility
>> of creating a useful tool.
>
> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
> mall Omaha NE.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> It turns out that inputs having pathological self-reference can be
> decided to be non-halting.
>
> The invocation of a halt decider that is
> based on simulating the execution of its input can be decided to be
> infinitely recursive in the above case.
Whenever you are challenged to use a program in which:
1. The return value of every call to Halts is logged using Output; and
2. H_Hat(H_Hat) is directly called from main, followed by an Output
which confirms that it returns (if it returns).
you break down and resort to attacking the proof's definition of the
halting problem as being incorrect.
By resorting to redefining the conditions of the proof, you're admitting
that you are not able to defeat the original proof.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-02 23:06 +0000 |
| Message-ID | <875z4f546o.fsf@bsb.me.uk> |
| In reply to | #27719 |
olcott <NoOne@NoWhere.com> writes: > On 9/5/2004 11:21 AM, Peter Olcott wrote: >> The Liar Paradox can be shown to be nothing more than >> a incorrectly formed statement because of its pathological >> self-reference. The Halting Problem can only exist because >> of this same sort of pathological self-reference. >> >> The primary benefit of solving the Halting Problem was to >> detect programs that failed to halt, thus were incorrect. >> Pathological self-reference can also be viewed as a form >> of error. If the Halting Problem is redefined (which does not >> refute anyone), then this redefined problem can be easily >> solved. >> >> Now we have three possible correct results: >> (a) Halts >> (b) Does Not Halt >> (c) Pathological Self Reference to Halt Every instance of the halting problem has a correct yes/no answer: a TM, run with some particular tape, either halts or it does not halt. Any instances you choose to put in (c) are also in (a) or (b). >> Compared to my prior claims, this one seem trivial and >> obvious. Possibly this claim adds a slight nuance to the >> problem that has not been widely discussed before. >> If we construe pathological self-reference as another >> error condition, then this does remove the impossibility >> of creating a useful tool. > > I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads > mall Omaha NE. And then you went online and claimed to have a pair of "actual Turing machines", "fully encoded" that are "exactly and precisely as in Linz" but "with H actually deciding [the] input pair (Ĥ, Ĥ)". These TMs have never been posted, and two years later you have nothing. You could, if it were true, simply post those TMs and confound your critics? Why don't you? (I'll answer this question if you want me to.) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-02 18:38 -0500 |
| Message-ID | <7u7IH.93387$EA2.28906@fx01.iad> |
| In reply to | #27730 |
On 1/2/21 6:06 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>> The Liar Paradox can be shown to be nothing more than >>> a incorrectly formed statement because of its pathological >>> self-reference. The Halting Problem can only exist because >>> of this same sort of pathological self-reference. >>> >>> The primary benefit of solving the Halting Problem was to >>> detect programs that failed to halt, thus were incorrect. >>> Pathological self-reference can also be viewed as a form >>> of error. If the Halting Problem is redefined (which does not >>> refute anyone), then this redefined problem can be easily >>> solved. >>> >>> Now we have three possible correct results: >>> (a) Halts >>> (b) Does Not Halt >>> (c) Pathological Self Reference to Halt > > Every instance of the halting problem has a correct yes/no answer: a TM, > run with some particular tape, either halts or it does not halt. Any > instances you choose to put in (c) are also in (a) or (b). Except (c) can be the 'right' answer for a machine built refering to you, where neither (a) or (b) would be correct, as H_Hat then contradicts. You actually don't need to respond (c) for ALL self-referential machines, as some machines may not act contradictory so you can decide it. This IS an alternate version of the Halting Problem, so doesn't directly contradict the non-existence of a Universal Halting Decider, but allow the decider to admit it can't answer a particular machine. I suspect that changing the definition of the Halting Problem to this version likely doesn't have a lot of effect on classical theory, as (c) is really an admission not being able to decide. You might want to expand (c) to include other cases where the Halt Decider can't find a proper answer. With THAT extension, we can surly come up with a Universal Halting Maybe Decider, as a degenerate solution would be just to answer (c) to all inputs (admitedly not very useful). Or even somewhat better simulate for a while, answer Halts(a) if it did stop, answer Non-Halting(b) if it matchs a set of simple infinite loop creterian, or Unknown(c) otherwise. If we can limit and categorize the cases where we need to answer Unknown(c) then maybe it could be useful for theories. It can't be worse than having a decider that might be wrong or that doesn't exist. Shame that Peter hasn't done any work on this path that he mentioned apparently so long ago. > >>> Compared to my prior claims, this one seem trivial and >>> obvious. Possibly this claim adds a slight nuance to the >>> problem that has not been widely discussed before. >>> If we construe pathological self-reference as another >>> error condition, then this does remove the impossibility >>> of creating a useful tool. >> >> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads >> mall Omaha NE. > > And then you went online and claimed to have a pair of "actual Turing > machines", "fully encoded" that are "exactly and precisely as in Linz" > but "with H actually deciding [the] input pair (Ĥ, Ĥ)". > > These TMs have never been posted, and two years later you have nothing. > You could, if it were true, simply post those TMs and confound your > critics? Why don't you? (I'll answer this question if you want me to.) >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-03 00:25 +0000 |
| Message-ID | <87tury50jd.fsf@bsb.me.uk> |
| In reply to | #27731 |
Richard Damon <Richard@Damon-Family.org> writes: > On 1/2/21 6:06 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>> The Liar Paradox can be shown to be nothing more than >>>> a incorrectly formed statement because of its pathological >>>> self-reference. The Halting Problem can only exist because >>>> of this same sort of pathological self-reference. >>>> >>>> The primary benefit of solving the Halting Problem was to >>>> detect programs that failed to halt, thus were incorrect. >>>> Pathological self-reference can also be viewed as a form >>>> of error. If the Halting Problem is redefined (which does not >>>> refute anyone), then this redefined problem can be easily >>>> solved. >>>> >>>> Now we have three possible correct results: >>>> (a) Halts >>>> (b) Does Not Halt >>>> (c) Pathological Self Reference to Halt >> >> Every instance of the halting problem has a correct yes/no answer: a TM, >> run with some particular tape, either halts or it does not halt. Any >> instances you choose to put in (c) are also in (a) or (b). > > Except (c) can be the 'right' answer for a machine built refering to > you, where neither (a) or (b) would be correct, as H_Hat then > contradicts. I don't get this. He can decree that in this new not-the-halting-problem (NTHP), some instances have (c) as the correct answer, but that does not stop one of (a) or (b) also being correct for them, at least by any reasonable meaning of "correct". Pick just one case of a halting computation for which some TM solving PO's NTHP answers 'c', and some other TM also solving his NTHP could answer 'a' instead and even PO would have hard time claiming that this new TM does not solve his NTHP. Are you really suggesting that we can allow PO to redefine halting to the extent that answering "halts" for a "halting" computation must not be considered correct, just because it belongs in some other category as well? I could just about accept it if he had a sound definition of (c) and then decreed that the answers must be (c), not (c) and halts, not (c) and does not halt. > You actually don't need to respond (c) for ALL self-referential > machines, as some machines may not act contradictory so you can decide it. > > This IS an alternate version of the Halting Problem, so doesn't directly > contradict the non-existence of a Universal Halting Decider, but allow > the decider to admit it can't answer a particular machine. > > I suspect that changing the definition of the Halting Problem to this > version likely doesn't have a lot of effect on classical theory, as (c) > is really an admission not being able to decide. You might want to > expand (c) to include other cases where the Halt Decider can't find a > proper answer. This has been gone over several times with PO in the last two decades. It's much better to think of category (c) as the decider answering "I won't say either (a) or (b)". There is no meaningful definition of "pathological self-reference" that is any better than "I can't prove it halts and I can't prove it doesn't". At one time, PO thought that "pathological self-reference" could be a syntactic property (and therefore inputs that had that property would be a decidable set), but that's obviously not the case. For every machine that "looks like" H_Hat there are an infinity of others that "behave like" H_Hat but don't look like it, so Rice's theorem kicks in. > With THAT extension, we can surly come up with a Universal Halting Maybe > Decider, as a degenerate solution would be just to answer (c) to all > inputs (admitedly not very useful). Or even somewhat better simulate for > a while, answer Halts(a) if it did stop, answer Non-Halting(b) if it > matchs a set of simple infinite loop creterian, or Unknown(c) > otherwise. Yes. For every such solution to PO's NTHP, there is a 'better' one that answers 'a' or 'b' for at least one more input. > If we can limit and categorize the cases where we need to answer > Unknown(c) then maybe it could be useful for theories. It can't be worse > than having a decider that might be wrong or that doesn't exist. Other people have been doing this for practical cases, but I can't see how it can help with any theories. > Shame that Peter hasn't done any work on this path that he mentioned > apparently so long ago. The pathological self-reference line is very old -- at least 16 years I think. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-02 20:33 -0500 |
| Message-ID | <x99IH.81287$192.70990@fx47.iad> |
| In reply to | #27733 |
On 1/2/21 7:25 PM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>> The Liar Paradox can be shown to be nothing more than >>>>> a incorrectly formed statement because of its pathological >>>>> self-reference. The Halting Problem can only exist because >>>>> of this same sort of pathological self-reference. >>>>> >>>>> The primary benefit of solving the Halting Problem was to >>>>> detect programs that failed to halt, thus were incorrect. >>>>> Pathological self-reference can also be viewed as a form >>>>> of error. If the Halting Problem is redefined (which does not >>>>> refute anyone), then this redefined problem can be easily >>>>> solved. >>>>> >>>>> Now we have three possible correct results: >>>>> (a) Halts >>>>> (b) Does Not Halt >>>>> (c) Pathological Self Reference to Halt >>> >>> Every instance of the halting problem has a correct yes/no answer: a TM, >>> run with some particular tape, either halts or it does not halt. Any >>> instances you choose to put in (c) are also in (a) or (b). >> >> Except (c) can be the 'right' answer for a machine built refering to >> you, where neither (a) or (b) would be correct, as H_Hat then >> contradicts. > > I don't get this. He can decree that in this new > not-the-halting-problem (NTHP), some instances have (c) as the correct > answer, but that does not stop one of (a) or (b) also being correct for > them, at least by any reasonable meaning of "correct". Pick just one > case of a halting computation for which some TM solving PO's NTHP > answers 'c', and some other TM also solving his NTHP could answer 'a' > instead and even PO would have hard time claiming that this new TM does > not solve his NTHP. > > Are you really suggesting that we can allow PO to redefine halting to > the extent that answering "halts" for a "halting" computation must not > be considered correct, just because it belongs in some other category as > well? > > I could just about accept it if he had a sound definition of (c) and > then decreed that the answers must be (c), not (c) and halts, not (c) > and does not halt. For the most restricted case, where (c) ment that the machine was contrary, then for a given machine, the answer could only be one of (a), (b), or (c). The answer (c) would ONLY be valid if the machine was self-referential and changed its behavior based on the value the decider returned and was acting contradictory. (I suppose you could also build a machine the reverse of H^ that either (a) or (b) would be correct). For any other machine, whose answer does NOT influence the decider in this manner, the only correct answers would be (a) or (b). For this case the definition of the responce (c) is that the machine will do the opposite of what I predict if I answer (a) or (b). > >> You actually don't need to respond (c) for ALL self-referential >> machines, as some machines may not act contradictory so you can decide it. >> >> This IS an alternate version of the Halting Problem, so doesn't directly >> contradict the non-existence of a Universal Halting Decider, but allow >> the decider to admit it can't answer a particular machine. >> >> I suspect that changing the definition of the Halting Problem to this >> version likely doesn't have a lot of effect on classical theory, as (c) >> is really an admission not being able to decide. You might want to >> expand (c) to include other cases where the Halt Decider can't find a >> proper answer. > > This has been gone over several times with PO in the last two decades. > It's much better to think of category (c) as the decider answering "I > won't say either (a) or (b)". There is no meaningful definition of > "pathological self-reference" that is any better than "I can't prove it > halts and I can't prove it doesn't". > > At one time, PO thought that "pathological self-reference" could be a > syntactic property (and therefore inputs that had that property would be > a decidable set), but that's obviously not the case. For every machine > that "looks like" H_Hat there are an infinity of others that "behave > like" H_Hat but don't look like it, so Rice's theorem kicks in. Yes, one trick would be that the Halt Decider would need some way to detect that recursion has happened, I don't think you need to detect an 'act likes' machine, as if you come across one of those, you aren't in an 'infinite' recursion as that other similar machine. In the x86 code it is simple, detecting the same address. It would definitly take some work to show that a Turing Machine could recognize itself on the tape, I will admit that I am not positive. The fact that the x86 can do it gives some hope, but I would need to study it closer to make sure that Halts as a pure function would be able to do this, and that is isn't just because he broke the box that it is able to do this. One thought is maybe if you start with a modified UTM that first check the program and the input to see if they were the same, and that affected the starting state of the program, and built your halting decider off that. Not sure it would actually get somewhere, just an idea to throw out for investigation. > >> With THAT extension, we can surly come up with a Universal Halting Maybe >> Decider, as a degenerate solution would be just to answer (c) to all >> inputs (admitedly not very useful). Or even somewhat better simulate for >> a while, answer Halts(a) if it did stop, answer Non-Halting(b) if it >> matchs a set of simple infinite loop creterian, or Unknown(c) >> otherwise. > > Yes. For every such solution to PO's NTHP, there is a 'better' one that > answers 'a' or 'b' for at least one more input. > >> If we can limit and categorize the cases where we need to answer >> Unknown(c) then maybe it could be useful for theories. It can't be worse >> than having a decider that might be wrong or that doesn't exist. > > Other people have been doing this for practical cases, but I can't see > how it can help with any theories. I'm not sure either, but it can't be worse than having no halt detector or a halt detector that can be wrong. > >> Shame that Peter hasn't done any work on this path that he mentioned >> apparently so long ago. > > The pathological self-reference line is very old -- at least 16 years I > think. > His quote was dated 2004, so 16 years ago. Long time to be absorbed in something without making significant progress.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-04 01:12 +0000 |
| Message-ID | <87a6tp4i99.fsf@bsb.me.uk> |
| In reply to | #27734 |
Richard Damon <Richard@Damon-Family.org> writes: > On 1/2/21 7:25 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>>> The Liar Paradox can be shown to be nothing more than >>>>>> a incorrectly formed statement because of its pathological >>>>>> self-reference. The Halting Problem can only exist because >>>>>> of this same sort of pathological self-reference. >>>>>> >>>>>> The primary benefit of solving the Halting Problem was to >>>>>> detect programs that failed to halt, thus were incorrect. >>>>>> Pathological self-reference can also be viewed as a form >>>>>> of error. If the Halting Problem is redefined (which does not >>>>>> refute anyone), then this redefined problem can be easily >>>>>> solved. >>>>>> >>>>>> Now we have three possible correct results: >>>>>> (a) Halts >>>>>> (b) Does Not Halt >>>>>> (c) Pathological Self Reference to Halt >>>> >>>> Every instance of the halting problem has a correct yes/no answer: a TM, >>>> run with some particular tape, either halts or it does not halt. Any >>>> instances you choose to put in (c) are also in (a) or (b). >>> >>> Except (c) can be the 'right' answer for a machine built refering to >>> you, where neither (a) or (b) would be correct, as H_Hat then >>> contradicts. >> >> I don't get this. He can decree that in this new >> not-the-halting-problem (NTHP), some instances have (c) as the correct >> answer, but that does not stop one of (a) or (b) also being correct for >> them, at least by any reasonable meaning of "correct". Pick just one >> case of a halting computation for which some TM solving PO's NTHP >> answers 'c', and some other TM also solving his NTHP could answer 'a' >> instead and even PO would have hard time claiming that this new TM does >> not solve his NTHP. >> >> Are you really suggesting that we can allow PO to redefine halting to >> the extent that answering "halts" for a "halting" computation must not >> be considered correct, just because it belongs in some other category as >> well? >> >> I could just about accept it if he had a sound definition of (c) and >> then decreed that the answers must be (c), not (c) and halts, not (c) >> and does not halt. > > For the most restricted case, where (c) ment that the machine was > contrary, then for a given machine, the answer could only be one of (a), > (b), or (c). The answer (c) would ONLY be valid if the machine was > self-referential and changed its behavior based on the value the decider > returned and was acting contradictory. (I suppose you could also build a > machine the reverse of H^ that either (a) or (b) would be correct). > > For any other machine, whose answer does NOT influence the decider in > this manner, the only correct answers would be (a) or (b). > > For this case the definition of the responce (c) is that the machine > will do the opposite of what I predict if I answer (a) or (b). I'm sorry, but I don't see what you are getting at here. I find the anthropomorphism confusing, and the whole idea of a TM that "changes it's behaviour" is alien to me. I'm not sure how to move forward. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-03 20:58 -0500 |
| Message-ID | <qDuIH.35607$rX1.13030@fx06.iad> |
| In reply to | #27737 |
On 1/3/21 8:12 PM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/2/21 7:25 PM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>> >>>> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>>>> The Liar Paradox can be shown to be nothing more than >>>>>>> a incorrectly formed statement because of its pathological >>>>>>> self-reference. The Halting Problem can only exist because >>>>>>> of this same sort of pathological self-reference. >>>>>>> >>>>>>> The primary benefit of solving the Halting Problem was to >>>>>>> detect programs that failed to halt, thus were incorrect. >>>>>>> Pathological self-reference can also be viewed as a form >>>>>>> of error. If the Halting Problem is redefined (which does not >>>>>>> refute anyone), then this redefined problem can be easily >>>>>>> solved. >>>>>>> >>>>>>> Now we have three possible correct results: >>>>>>> (a) Halts >>>>>>> (b) Does Not Halt >>>>>>> (c) Pathological Self Reference to Halt >>>>> >>>>> Every instance of the halting problem has a correct yes/no answer: a TM, >>>>> run with some particular tape, either halts or it does not halt. Any >>>>> instances you choose to put in (c) are also in (a) or (b). >>>> >>>> Except (c) can be the 'right' answer for a machine built refering to >>>> you, where neither (a) or (b) would be correct, as H_Hat then >>>> contradicts. >>> >>> I don't get this. He can decree that in this new >>> not-the-halting-problem (NTHP), some instances have (c) as the correct >>> answer, but that does not stop one of (a) or (b) also being correct for >>> them, at least by any reasonable meaning of "correct". Pick just one >>> case of a halting computation for which some TM solving PO's NTHP >>> answers 'c', and some other TM also solving his NTHP could answer 'a' >>> instead and even PO would have hard time claiming that this new TM does >>> not solve his NTHP. >>> >>> Are you really suggesting that we can allow PO to redefine halting to >>> the extent that answering "halts" for a "halting" computation must not >>> be considered correct, just because it belongs in some other category as >>> well? >>> >>> I could just about accept it if he had a sound definition of (c) and >>> then decreed that the answers must be (c), not (c) and halts, not (c) >>> and does not halt. >> >> For the most restricted case, where (c) ment that the machine was >> contrary, then for a given machine, the answer could only be one of (a), >> (b), or (c). The answer (c) would ONLY be valid if the machine was >> self-referential and changed its behavior based on the value the decider >> returned and was acting contradictory. (I suppose you could also build a >> machine the reverse of H^ that either (a) or (b) would be correct). >> >> For any other machine, whose answer does NOT influence the decider in >> this manner, the only correct answers would be (a) or (b). >> >> For this case the definition of the responce (c) is that the machine >> will do the opposite of what I predict if I answer (a) or (b). > > I'm sorry, but I don't see what you are getting at here. I find the > anthropomorphism confusing, and the whole idea of a TM that "changes it's > behaviour" is alien to me. I'm not sure how to move forward. > Assuming you can solve the issue of detecting the recursive invocation, which admittedly Peter has cheated to detect by reusing code space, then when Halts detects its identical recursive invocation, rather that doing than just simulating that recursive invocation, it 'forks' and first just assume that that embedded simulation returns halting. If the machine then does halt, your can return halting, if not, it tries again from that point and tries to return non-halting, and if it can detect non-halting behavior, it can return non-halting. If it can see that if it returns halting it will get non-halting behavior, and if it returns non-halting it gets halting behavior, then it can return instead the contradictory behavior return value. This does require that the Halt detector actually can detect that the machine is using a copy of itself, which may not be a solvable problem. It might be possible if Halts begins by comparing the program to run and the input to see if they match, and if so how compare that program to itself to see if it is based on it. (since an x86 program can detect that an input matches its own code, then it seems that a Turing Machine should be able to do the same).
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-04 02:19 +0000 |
| Message-ID | <874kjx4f6r.fsf@bsb.me.uk> |
| In reply to | #27738 |
Richard Damon <Richard@Damon-Family.org> writes: > On 1/3/21 8:12 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/2/21 7:25 PM, Ben Bacarisse wrote: >>>> Richard Damon <Richard@Damon-Family.org> writes: >>>> >>>>> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>>>>> The Liar Paradox can be shown to be nothing more than >>>>>>>> a incorrectly formed statement because of its pathological >>>>>>>> self-reference. The Halting Problem can only exist because >>>>>>>> of this same sort of pathological self-reference. >>>>>>>> >>>>>>>> The primary benefit of solving the Halting Problem was to >>>>>>>> detect programs that failed to halt, thus were incorrect. >>>>>>>> Pathological self-reference can also be viewed as a form >>>>>>>> of error. If the Halting Problem is redefined (which does not >>>>>>>> refute anyone), then this redefined problem can be easily >>>>>>>> solved. >>>>>>>> >>>>>>>> Now we have three possible correct results: >>>>>>>> (a) Halts >>>>>>>> (b) Does Not Halt >>>>>>>> (c) Pathological Self Reference to Halt >>>>>> >>>>>> Every instance of the halting problem has a correct yes/no answer: a TM, >>>>>> run with some particular tape, either halts or it does not halt. Any >>>>>> instances you choose to put in (c) are also in (a) or (b). >>>>> >>>>> Except (c) can be the 'right' answer for a machine built refering to >>>>> you, where neither (a) or (b) would be correct, as H_Hat then >>>>> contradicts. >>>> >>>> I don't get this. He can decree that in this new >>>> not-the-halting-problem (NTHP), some instances have (c) as the correct >>>> answer, but that does not stop one of (a) or (b) also being correct for >>>> them, at least by any reasonable meaning of "correct". Pick just one >>>> case of a halting computation for which some TM solving PO's NTHP >>>> answers 'c', and some other TM also solving his NTHP could answer 'a' >>>> instead and even PO would have hard time claiming that this new TM does >>>> not solve his NTHP. >>>> >>>> Are you really suggesting that we can allow PO to redefine halting to >>>> the extent that answering "halts" for a "halting" computation must not >>>> be considered correct, just because it belongs in some other category as >>>> well? >>>> >>>> I could just about accept it if he had a sound definition of (c) and >>>> then decreed that the answers must be (c), not (c) and halts, not (c) >>>> and does not halt. >>> >>> For the most restricted case, where (c) ment that the machine was >>> contrary, then for a given machine, the answer could only be one of (a), >>> (b), or (c). The answer (c) would ONLY be valid if the machine was >>> self-referential and changed its behavior based on the value the decider >>> returned and was acting contradictory. (I suppose you could also build a >>> machine the reverse of H^ that either (a) or (b) would be correct). >>> >>> For any other machine, whose answer does NOT influence the decider in >>> this manner, the only correct answers would be (a) or (b). >>> >>> For this case the definition of the responce (c) is that the machine >>> will do the opposite of what I predict if I answer (a) or (b). >> >> I'm sorry, but I don't see what you are getting at here. I find the >> anthropomorphism confusing, and the whole idea of a TM that "changes it's >> behaviour" is alien to me. I'm not sure how to move forward. >> > > Assuming you can solve the issue of detecting the recursive invocation, > which admittedly Peter has cheated to detect by reusing code space, then > when Halts detects its identical recursive invocation, rather that doing > than just simulating that recursive invocation, it 'forks' and first > just assume that that embedded simulation returns halting. If the > machine then does halt, your can return halting, if not, it tries again > from that point and tries to return non-halting, and if it can detect > non-halting behavior, it can return non-halting. I'd suggest you don't assume so much about the "how". You can go straight to: > If it can see that if it returns halting it will get non-halting > behavior, and if it returns non-halting it gets halting behavior, then > it can return instead the contradictory behavior return value. Yes, I get this. It comes up as a "solution" every time you teach this stuff. > This does require that the Halt detector actually can detect that the > machine is using a copy of itself, which may not be a solvable > problem. You can detect syntactic patterns, but not semantic ones. I.e. a TM can't detect all code that behaves like it does. I still don't see where this gets you. You just end up with some form of partial decider depending on exactly how you partially solve the problem of "recognising yourself". Some choices will even force you to give incorrect (a) or (b) answers. And a "solution" that uses (c) as the answer sufficiently often that no false (a) or (b) answers are given will have to include all sorts of things that are not "pathological self reference" in any sense at all. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-03 22:59 -0500 |
| Message-ID | <UowIH.35582$ay6.3115@fx03.iad> |
| In reply to | #27739 |
On 1/3/21 9:19 PM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 1/3/21 8:12 PM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>> >>>> On 1/2/21 7:25 PM, Ben Bacarisse wrote: >>>>> Richard Damon <Richard@Damon-Family.org> writes: >>>>> >>>>>> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>>>>>> The Liar Paradox can be shown to be nothing more than >>>>>>>>> a incorrectly formed statement because of its pathological >>>>>>>>> self-reference. The Halting Problem can only exist because >>>>>>>>> of this same sort of pathological self-reference. >>>>>>>>> >>>>>>>>> The primary benefit of solving the Halting Problem was to >>>>>>>>> detect programs that failed to halt, thus were incorrect. >>>>>>>>> Pathological self-reference can also be viewed as a form >>>>>>>>> of error. If the Halting Problem is redefined (which does not >>>>>>>>> refute anyone), then this redefined problem can be easily >>>>>>>>> solved. >>>>>>>>> >>>>>>>>> Now we have three possible correct results: >>>>>>>>> (a) Halts >>>>>>>>> (b) Does Not Halt >>>>>>>>> (c) Pathological Self Reference to Halt >>>>>>> >>>>>>> Every instance of the halting problem has a correct yes/no answer: a TM, >>>>>>> run with some particular tape, either halts or it does not halt. Any >>>>>>> instances you choose to put in (c) are also in (a) or (b). >>>>>> >>>>>> Except (c) can be the 'right' answer for a machine built refering to >>>>>> you, where neither (a) or (b) would be correct, as H_Hat then >>>>>> contradicts. >>>>> >>>>> I don't get this. He can decree that in this new >>>>> not-the-halting-problem (NTHP), some instances have (c) as the correct >>>>> answer, but that does not stop one of (a) or (b) also being correct for >>>>> them, at least by any reasonable meaning of "correct". Pick just one >>>>> case of a halting computation for which some TM solving PO's NTHP >>>>> answers 'c', and some other TM also solving his NTHP could answer 'a' >>>>> instead and even PO would have hard time claiming that this new TM does >>>>> not solve his NTHP. >>>>> >>>>> Are you really suggesting that we can allow PO to redefine halting to >>>>> the extent that answering "halts" for a "halting" computation must not >>>>> be considered correct, just because it belongs in some other category as >>>>> well? >>>>> >>>>> I could just about accept it if he had a sound definition of (c) and >>>>> then decreed that the answers must be (c), not (c) and halts, not (c) >>>>> and does not halt. >>>> >>>> For the most restricted case, where (c) ment that the machine was >>>> contrary, then for a given machine, the answer could only be one of (a), >>>> (b), or (c). The answer (c) would ONLY be valid if the machine was >>>> self-referential and changed its behavior based on the value the decider >>>> returned and was acting contradictory. (I suppose you could also build a >>>> machine the reverse of H^ that either (a) or (b) would be correct). >>>> >>>> For any other machine, whose answer does NOT influence the decider in >>>> this manner, the only correct answers would be (a) or (b). >>>> >>>> For this case the definition of the responce (c) is that the machine >>>> will do the opposite of what I predict if I answer (a) or (b). >>> >>> I'm sorry, but I don't see what you are getting at here. I find the >>> anthropomorphism confusing, and the whole idea of a TM that "changes it's >>> behaviour" is alien to me. I'm not sure how to move forward. >>> >> >> Assuming you can solve the issue of detecting the recursive invocation, >> which admittedly Peter has cheated to detect by reusing code space, then >> when Halts detects its identical recursive invocation, rather that doing >> than just simulating that recursive invocation, it 'forks' and first >> just assume that that embedded simulation returns halting. If the >> machine then does halt, your can return halting, if not, it tries again >> from that point and tries to return non-halting, and if it can detect >> non-halting behavior, it can return non-halting. > > I'd suggest you don't assume so much about the "how". You can go > straight to: > >> If it can see that if it returns halting it will get non-halting >> behavior, and if it returns non-halting it gets halting behavior, then >> it can return instead the contradictory behavior return value. > > Yes, I get this. It comes up as a "solution" every time you teach this > stuff. > >> This does require that the Halt detector actually can detect that the >> machine is using a copy of itself, which may not be a solvable >> problem. > > You can detect syntactic patterns, but not semantic ones. I.e. a TM > can't detect all code that behaves like it does. > > I still don't see where this gets you. You just end up with some form > of partial decider depending on exactly how you partially solve the > problem of "recognising yourself". Some choices will even force you to > give incorrect (a) or (b) answers. And a "solution" that uses (c) as > the answer sufficiently often that no false (a) or (b) answers are given > will have to include all sorts of things that are not "pathological self > reference" in any sense at all. > But the key is that the recursive trap of the Linz like machine isn't a machine that acts like you, but the machine that IS a copy of you. I suppose that the question come what if you build H^ on the actual Halt Decider but make a second version H^' that is a computationally equivalent but scrambled in a way that it isn't recognized and compare the results of H^(H^') to H(H^, H^') The keys are to first see such a decider is actually good for anything. You also would need to see if you can find some minimal bounds around what cases the machine would need to respond to with (c), and I am pretty sure to actually make such a decider, there will need to be more cases in the 'I can't answer' (c) category than just the self contradictory case.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-01-03 20:23 -0800 |
| Message-ID | <rsu58r$uek$1@gioia.aioe.org> |
| In reply to | #27740 |
On 1/3/2021 7:59 PM, Richard Damon wrote: > On 1/3/21 9:19 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: [...] > But the key is that the recursive trap of the Linz like machine isn't a > machine that acts like you, but the machine that IS a copy of you. [...] A perfect copy, or imitation... Beware of the doppelganger. Reminds me of the Thing: https://youtu.be/_C9JbK7slrk?list=PL8gMOFboKYbjAi-oirI_twlL2ohafs7-g
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-04 23:57 +0000 |
| Message-ID | <87a6to2r39.fsf@bsb.me.uk> |
| In reply to | #27740 |
Richard Damon <Richard@Damon-Family.org> writes: > On 1/3/21 9:19 PM, Ben Bacarisse wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/3/21 8:12 PM, Ben Bacarisse wrote: >>>> Richard Damon <Richard@Damon-Family.org> writes: >>>> >>>>> On 1/2/21 7:25 PM, Ben Bacarisse wrote: >>>>>> Richard Damon <Richard@Damon-Family.org> writes: >>>>>> >>>>>>> On 1/2/21 6:06 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote: >>>>>>>>>> The Liar Paradox can be shown to be nothing more than >>>>>>>>>> a incorrectly formed statement because of its pathological >>>>>>>>>> self-reference. The Halting Problem can only exist because >>>>>>>>>> of this same sort of pathological self-reference. >>>>>>>>>> >>>>>>>>>> The primary benefit of solving the Halting Problem was to >>>>>>>>>> detect programs that failed to halt, thus were incorrect. >>>>>>>>>> Pathological self-reference can also be viewed as a form >>>>>>>>>> of error. If the Halting Problem is redefined (which does not >>>>>>>>>> refute anyone), then this redefined problem can be easily >>>>>>>>>> solved. >>>>>>>>>> >>>>>>>>>> Now we have three possible correct results: >>>>>>>>>> (a) Halts >>>>>>>>>> (b) Does Not Halt >>>>>>>>>> (c) Pathological Self Reference to Halt >>>>>>>> >>>>>>>> Every instance of the halting problem has a correct yes/no answer: a TM, >>>>>>>> run with some particular tape, either halts or it does not halt. Any >>>>>>>> instances you choose to put in (c) are also in (a) or (b). >>>>>>> >>>>>>> Except (c) can be the 'right' answer for a machine built refering to >>>>>>> you, where neither (a) or (b) would be correct, as H_Hat then >>>>>>> contradicts. >>>>>> >>>>>> I don't get this. He can decree that in this new >>>>>> not-the-halting-problem (NTHP), some instances have (c) as the correct >>>>>> answer, but that does not stop one of (a) or (b) also being correct for >>>>>> them, at least by any reasonable meaning of "correct". Pick just one >>>>>> case of a halting computation for which some TM solving PO's NTHP >>>>>> answers 'c', and some other TM also solving his NTHP could answer 'a' >>>>>> instead and even PO would have hard time claiming that this new TM does >>>>>> not solve his NTHP. >>>>>> >>>>>> Are you really suggesting that we can allow PO to redefine halting to >>>>>> the extent that answering "halts" for a "halting" computation must not >>>>>> be considered correct, just because it belongs in some other category as >>>>>> well? >>>>>> >>>>>> I could just about accept it if he had a sound definition of (c) and >>>>>> then decreed that the answers must be (c), not (c) and halts, not (c) >>>>>> and does not halt. >>>>> >>>>> For the most restricted case, where (c) ment that the machine was >>>>> contrary, then for a given machine, the answer could only be one of (a), >>>>> (b), or (c). The answer (c) would ONLY be valid if the machine was >>>>> self-referential and changed its behavior based on the value the decider >>>>> returned and was acting contradictory. (I suppose you could also build a >>>>> machine the reverse of H^ that either (a) or (b) would be correct). >>>>> >>>>> For any other machine, whose answer does NOT influence the decider in >>>>> this manner, the only correct answers would be (a) or (b). >>>>> >>>>> For this case the definition of the responce (c) is that the machine >>>>> will do the opposite of what I predict if I answer (a) or (b). >>>> >>>> I'm sorry, but I don't see what you are getting at here. I find the >>>> anthropomorphism confusing, and the whole idea of a TM that "changes it's >>>> behaviour" is alien to me. I'm not sure how to move forward. >>>> >>> >>> Assuming you can solve the issue of detecting the recursive invocation, >>> which admittedly Peter has cheated to detect by reusing code space, then >>> when Halts detects its identical recursive invocation, rather that doing >>> than just simulating that recursive invocation, it 'forks' and first >>> just assume that that embedded simulation returns halting. If the >>> machine then does halt, your can return halting, if not, it tries again >>> from that point and tries to return non-halting, and if it can detect >>> non-halting behavior, it can return non-halting. >> >> I'd suggest you don't assume so much about the "how". You can go >> straight to: >> >>> If it can see that if it returns halting it will get non-halting >>> behavior, and if it returns non-halting it gets halting behavior, then >>> it can return instead the contradictory behavior return value. >> >> Yes, I get this. It comes up as a "solution" every time you teach this >> stuff. >> >>> This does require that the Halt detector actually can detect that the >>> machine is using a copy of itself, which may not be a solvable >>> problem. >> >> You can detect syntactic patterns, but not semantic ones. I.e. a TM >> can't detect all code that behaves like it does. >> >> I still don't see where this gets you. You just end up with some form >> of partial decider depending on exactly how you partially solve the >> problem of "recognising yourself". Some choices will even force you to >> give incorrect (a) or (b) answers. And a "solution" that uses (c) as >> the answer sufficiently often that no false (a) or (b) answers are given >> will have to include all sorts of things that are not "pathological self >> reference" in any sense at all. > > But the key is that the recursive trap of the Linz like machine isn't a > machine that acts like you, but the machine that IS a copy of you. > > I suppose that the question come what if you build H^ on the actual Halt > Decider but make a second version H^' that is a computationally > equivalent but scrambled in a way that it isn't recognized and compare > the results of H^(H^') to H(H^, H^') > > The keys are to first see such a decider is actually good for anything. > You also would need to see if you can find some minimal bounds around > what cases the machine would need to respond to with (c), and I am > pretty sure to actually make such a decider, there will need to be more > cases in the 'I can't answer' (c) category than just the self > contradictory case. We agree on that. In fact I'd put it more strongly: there's no interesting set of inputs in category (c). No matter how PO dresses up the name of it, it is always just those inputs that the TM can't determine to be halting or non-halting and as such are just an expression of the limitations of whatever technique the TM uses to determine (a) and (b). -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-01-04 11:24 +0000 |
| Message-ID | <rsutt2$q5o$1@gioia.aioe.org> |
| In reply to | #27738 |
On 04/01/2021 01:58, Richard Damon wrote:
> Assuming you can solve the issue of detecting the recursive invocation,
You can't. Not in general. Almost all such issues are easily
seen to be equivalent to the Halting Problem, essentially by a device
that PO would perhaps call "pathological", viz that you tweak an
arbitrary program to have the issue if and only if it halts; a TM
that could detect whether that program had the issue would solve the
HP for the corresponding original program, =><=.
Separately, TMs don't have recursion, or even subroutines;
those are artifacts of higher-level languages, though, of course,
they are equivalent to things that TM can do.
[...]
> This does require that the Halt detector actually can detect that the
> machine is using a copy of itself, which may not be a solvable problem.
> It might be possible if Halts begins by comparing the program to run and
> the input to see if they match, and if so how compare that program to
> itself to see if it is based on it. (since an x86 program can detect
> that an input matches its own code, then it seems that a Turing Machine
> should be able to do the same).
You can obviously detect if a given program [source file] is
one of a given set of files. But the general equivalence problem is
"easily" seen to be another version of the HP, so unsolvable.
As Ben says, students come up with these "How about if ..."
ways around the HP every time you teach this stuff. Most of them
quite quickly learn how to find the refutations themselves; but
every so often, you get one who thinks he [it's always a "he"!] can
beat the system. I've even known a couple who found employment on
that basis -- they had always nearly cracked it, there was just one
more case, .... It's a bit like the Mandelbrot set -- almost all of
the picture is perfectly straightforward, but there's always a small
residue of points that are either "in" or "out" and you can't tell
which, so you increase the resolution, go deeper in, and almost all
of them now resolve, but there's a small residue ....
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Spindler
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-04 07:10 -0500 |
| Message-ID | <5BDIH.38533$EY1.21037@fx42.iad> |
| In reply to | #27742 |
On 1/4/21 6:24 AM, Andy Walker wrote: > On 04/01/2021 01:58, Richard Damon wrote: >> Assuming you can solve the issue of detecting the recursive invocation, > > You can't. Not in general. Almost all such issues are easily > seen to be equivalent to the Halting Problem, essentially by a device > that PO would perhaps call "pathological", viz that you tweak an > arbitrary program to have the issue if and only if it halts; a TM > that could detect whether that program had the issue would solve the > HP for the corresponding original program, =><=. > > Separately, TMs don't have recursion, or even subroutines; > those are artifacts of higher-level languages, though, of course, > they are equivalent to things that TM can do. > > [...] >> This does require that the Halt detector actually can detect that the >> machine is using a copy of itself, which may not be a solvable problem. >> It might be possible if Halts begins by comparing the program to run and >> the input to see if they match, and if so how compare that program to >> itself to see if it is based on it. (since an x86 program can detect >> that an input matches its own code, then it seems that a Turing Machine >> should be able to do the same). > > You can obviously detect if a given program [source file] is > one of a given set of files. But the general equivalence problem is > "easily" seen to be another version of the HP, so unsolvable. > > As Ben says, students come up with these "How about if ..." > ways around the HP every time you teach this stuff. Most of them > quite quickly learn how to find the refutations themselves; but > every so often, you get one who thinks he [it's always a "he"!] can > beat the system. I've even known a couple who found employment on > that basis -- they had always nearly cracked it, there was just one > more case, .... It's a bit like the Mandelbrot set -- almost all of > the picture is perfectly straightforward, but there's always a small > residue of points that are either "in" or "out" and you can't tell > which, so you increase the resolution, go deeper in, and almost all > of them now resolve, but there's a small residue .... > So if detecting the recursion can't be done, then part of PO's trick is the passing of pointer to functions as an address rather than actually passing an input 'tape'. This allows him to trivially solve the recursion detection. This says that the REAL problem with his proof is that his 'UTM' doesn't fully support the operation of 'make a copy of the input', and thus is shown to not be a Turing Complete environment.
[toc] | [prev] | [next] | [standalone]
Page 1 of 16 [1] 2 3 … 16 Next page →
Back to top | Article view | comp.theory
csiph-web