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 14 of 16 — ← Prev page 1 … 12 13 [14] 15 16 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 20:53 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <ed2dnRcPFts5_WPCnZ2dnUU7-UWdnZ2d@giganews.com> |
| In reply to | #27959 |
On 1/12/2021 8:28 PM, Richard Damon wrote: > On 1/12/21 3:49 PM, olcott wrote: >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. >> >> Infinite Recursion detection AXIOM (self-evident truth) >> (a) Within an execution trace >> (b) The same function is called >> (c) From the same machine address >> (d) With the same data // Richard Damon credit >> (e) A second time >> (f) Without any control flow instructions inbetween >> >> The way to prove that this is true is to perform an execution trace on >> H_Hat() with the halt decider in disabled mode. There will also be a >> full trace mode that shows the execution trace of all of operating >> system code too. >> >> When you can look at the 100% complete execution trace and see that >> there are no instructions in this trace that could possibly cause it to >> stop, then it can be understood to be infinite. >> >> It is much much easier to come to a complete understanding of the above >> Infinite Recursion detection AXIOM than it is to verify that thousands >> of pages of x86 code specify infinite execution. None-the-less this >> empirical proof will be available. >> >> Even the full execution trace of Halts() correctly deciding H_Hat() is >> 297 pages long. This was greatly reduced to 297 pages by moving most >> operating system functions into emulator code. >> >> The local halt decider is entirely in emulated code so every single step >> of its execution can be seen. The global halt decider works best as an >> x86utm operating system function so that it can easily watch everything. >> > Except that you never do provide a 100% trace of the execution because > you omit some code that you classify as 'system' code. > The full execution trace becomes 297 pages of output. > Turing Machines have no 'System' Code, and for your axiom to be true, > (f) must include ALL code, AND the machine must not provide an interrupt > or trap capability the the program has access to. I am sure that Halts > fails to pass that test. > When a freaking halt decider is examining the simulation of a program under test it does not have to examine its own code (it already knows what it does) or the code of the simulator. Both of these are out-of-scope. In TM lingo this is a halt deciding UTM. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 20:58 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <PpWdnYkUG5x5_GPCnZ2dnUU7-IsAAAAA@giganews.com> |
| In reply to | #27959 |
On 1/12/2021 8:28 PM, Richard Damon wrote: > On 1/12/21 3:49 PM, olcott wrote: >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. >> >> Infinite Recursion detection AXIOM (self-evident truth) >> (a) Within an execution trace >> (b) The same function is called >> (c) From the same machine address >> (d) With the same data // Richard Damon credit >> (e) A second time >> (f) Without any control flow instructions inbetween >> >> The way to prove that this is true is to perform an execution trace on >> H_Hat() with the halt decider in disabled mode. There will also be a >> full trace mode that shows the execution trace of all of operating >> system code too. >> >> When you can look at the 100% complete execution trace and see that >> there are no instructions in this trace that could possibly cause it to >> stop, then it can be understood to be infinite. >> >> It is much much easier to come to a complete understanding of the above >> Infinite Recursion detection AXIOM than it is to verify that thousands >> of pages of x86 code specify infinite execution. None-the-less this >> empirical proof will be available. >> >> Even the full execution trace of Halts() correctly deciding H_Hat() is >> 297 pages long. This was greatly reduced to 297 pages by moving most >> operating system functions into emulator code. >> >> The local halt decider is entirely in emulated code so every single step >> of its execution can be seen. The global halt decider works best as an >> x86utm operating system function so that it can easily watch everything. >> > Except that you never do provide a 100% trace of the execution because > you omit some code that you classify as 'system' code. > The full execution trace becomes 297 pages of output. > Turing Machines have no 'System' Code, and for your axiom to be true, > (f) must include ALL code, AND the machine must not provide an interrupt > or trap capability the the program has access to. I am sure that Halts > fails to pass that test. > When a freaking halt decider is examining the simulation of a program under test it does not have to examine its own code (it already knows what it does) or the code of the simulator. Both of these are out-of-scope. In TM lingo this is a halt deciding UTM. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-13 01:20 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87a6tdskdf.fsf@bsb.me.uk> |
| In reply to | #27909 |
olcott <NoOne@NoWhere.com> writes: > On 1/10/2021 9:09 AM, Ben Bacarisse wrote: <cut> >> Yes, except that the question "Does the simulation of the input have to >> be stopped to prevent its otherwise infinite execution" is, itself, the >> classical halting problem. > > This is one of the very rare times that you have ever agreed with me > on a material fact. Not a very useful agreement unless you also agree that you can't have code that can make this determination in the general case. Sometimes you imply that you do, and sometimes you imply that you don't. We'll never have a definitive claim because flip-flopping (and never posting code that would settle the matter), is how you keep the chat going. It is, however, a matter of fact that you can't have an algorithm that can determine if the simulation of a TM (or TM-equivalent) computation is infinite. Do you agree with me on that one as well? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 19:55 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Sb6dnVbseZ6HzmPCnZ2dnUU7-cnNnZ2d@giganews.com> |
| In reply to | #27949 |
On 1/12/2021 7:20 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > <cut> >>> Yes, except that the question "Does the simulation of the input have to >>> be stopped to prevent its otherwise infinite execution" is, itself, the >>> classical halting problem. >> >> This is one of the very rare times that you have ever agreed with me >> on a material fact. > > Not a very useful agreement unless you also agree that you can't have > code that can make this determination in the general case. If we hypothetically assume that the conventional halting problem undecidability proofs have been refuted that would seem to make the halting problem an open question again. > Sometimes > you imply that you do, and sometimes you imply that you don't. We'll > never have a definitive claim because flip-flopping (and never posting > code that would settle the matter), is how you keep the chat going. > I do not have any definitive claim on any open question. > It is, however, a matter of fact that you can't have an algorithm that > can determine if the simulation of a TM (or TM-equivalent) computation > is infinite. Do you agree with me on that one as well? > My laser focus is only on the one single aspect of the conventional halting problem undecidability proofs correctly deciding the simplest possible case of the "do the opposite of whatever the halt decider decides" common basis of all these proofs. I am NOT willing to accept: OK you refuted these proofs but that does not count for anything at all until you totally solve the actual halting problem itself. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-13 15:35 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87v9c0q274.fsf@bsb.me.uk> |
| In reply to | #27954 |
olcott <NoOne@NoWhere.com> writes: > On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >> <cut> >>>> Yes, except that the question "Does the simulation of the input have to >>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>> classical halting problem. >>> >>> This is one of the very rare times that you have ever agreed with me >>> on a material fact. >> >> Not a very useful agreement unless you also agree that you can't have >> code that can make this determination in the general case. > > If we hypothetically assume that the conventional halting problem > undecidability proofs have been refuted that would seem to make the > halting problem an open question again. No. Invalidating a proof does not invalidate the theorem. How could you not get this after all this time? >> Sometimes >> you imply that you do, and sometimes you imply that you don't. We'll >> never have a definitive claim because flip-flopping (and never posting >> code that would settle the matter), is how you keep the chat going. > > I do not have any definitive claim on any open question. There is no open question here. But I agree you have no definitive claim. You love to equivocate and flip-flop between claims. The way you walked back the claim from two years ago that you had "actual Turing machines" what an textbook example of the art. >> It is, however, a matter of fact that you can't have an algorithm that >> can determine if the simulation of a TM (or TM-equivalent) computation >> is infinite. Do you agree with me on that one as well? > > My laser focus is only on the one single aspect of the conventional > halting problem undecidability proofs How many more years do you think it will be before you either admit you were wrong or have something other than thousands of garbled posts in a backwater of the internet? You really should find a more productive hobby. > I am NOT willing to accept: > OK you refuted these proofs but that does not count for anything at > all until you totally solve the actual halting problem itself. That's a shame because the other proofs will still stand. Your laser focus on a historical argument means you have not even read Linz's proof, though I imagine you would struggle to understand it because it is about recursive languages. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 14:05 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <-8ednZ937OwOz2LCnZ2dnUU7-bnNnZ2d@giganews.com> |
| In reply to | #27980 |
On 1/13/2021 9:35 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>> <cut> >>>>> Yes, except that the question "Does the simulation of the input have to >>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>> classical halting problem. >>>> >>>> This is one of the very rare times that you have ever agreed with me >>>> on a material fact. >>> >>> Not a very useful agreement unless you also agree that you can't have >>> code that can make this determination in the general case. >> >> If we hypothetically assume that the conventional halting problem >> undecidability proofs have been refuted that would seem to make the >> halting problem an open question again. > > No. Invalidating a proof does not invalidate the theorem. How could > you not get this after all this time? Theorem X is proven on the basis of Y. Y is proven to be bogus. Thus the proof of Theorem X loses its basis. >>> Sometimes >>> you imply that you do, and sometimes you imply that you don't. We'll >>> never have a definitive claim because flip-flopping (and never posting >>> code that would settle the matter), is how you keep the chat going. >> >> I do not have any definitive claim on any open question. > > There is no open question here. But I agree you have no definitive > claim. You love to equivocate and flip-flop between claims. The way > you walked back the claim from two years ago that you had "actual Turing > machines" what an textbook example of the art. > Turing machines or Turing equivalent machines, no consequential difference. I had never heard of Turing machine equivalece in 2018, yet understood the concept. >>> It is, however, a matter of fact that you can't have an algorithm that >>> can determine if the simulation of a TM (or TM-equivalent) computation >>> is infinite. Do you agree with me on that one as well? >> >> My laser focus is only on the one single aspect of the conventional >> halting problem undecidability proofs > > How many more years do you think it will be before you either admit you > were wrong or have something other than thousands of garbled posts in a > backwater of the internet? You really should find a more productive > hobby. The adaptations to an x86 emulator transforming it into the x86utm operating system currently comprise 50 pages of c++ ource code. >> I am NOT willing to accept: >> OK you refuted these proofs but that does not count for anything at >> all until you totally solve the actual halting problem itself. > > That's a shame because the other proofs will still stand. Your laser > focus on a historical argument means you have not even read Linz's > proof, though I imagine you would struggle to understand it because it > is about recursive languages. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-13 23:59 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87k0sgpew2.fsf@bsb.me.uk> |
| In reply to | #27983 |
olcott <NoOne@NoWhere.com> writes: > On 1/13/2021 9:35 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>> <cut> >>>>>> Yes, except that the question "Does the simulation of the input have to >>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>>> classical halting problem. >>>>> >>>>> This is one of the very rare times that you have ever agreed with me >>>>> on a material fact. >>>> >>>> Not a very useful agreement unless you also agree that you can't have >>>> code that can make this determination in the general case. >>> >>> If we hypothetically assume that the conventional halting problem >>> undecidability proofs have been refuted that would seem to make the >>> halting problem an open question again. >> >> No. Invalidating a proof does not invalidate the theorem. How could >> you not get this after all this time? > > Theorem X is proven on the basis of Y. > Y is proven to be bogus. > Thus the proof of Theorem X loses its basis. Not in dispute. If you don't understand what I'm saying, you could ask me rather than just say things that are not at issue. >>>> Sometimes >>>> you imply that you do, and sometimes you imply that you don't. We'll >>>> never have a definitive claim because flip-flopping (and never posting >>>> code that would settle the matter), is how you keep the chat going. >>> >>> I do not have any definitive claim on any open question. >> >> There is no open question here. But I agree you have no definitive >> claim. You love to equivocate and flip-flop between claims. The way >> you walked back the claim from two years ago that you had "actual Turing >> machines" what an textbook example of the art. > > Turing machines or Turing equivalent machines, no consequential > difference. I had never heard of Turing machine equivalece in 2018, > yet understood the concept. I dare you: post what you had in Dec 2018. Then we can see what you meant when you said you had a pair of actual Turing machines, fully encoded, exactly and precisely as in Linz. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 18:57 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <MvOdneB0KdKICmLCnZ2dnUU7-N_NnZ2d@giganews.com> |
| In reply to | #27992 |
On 1/13/2021 5:59 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 1/13/2021 9:35 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>>> <cut> >>>>>>> Yes, except that the question "Does the simulation of the input have to >>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>>>> classical halting problem. >>>>>> >>>>>> This is one of the very rare times that you have ever agreed with me >>>>>> on a material fact. >>>>> >>>>> Not a very useful agreement unless you also agree that you can't have >>>>> code that can make this determination in the general case. >>>> >>>> If we hypothetically assume that the conventional halting problem >>>> undecidability proofs have been refuted that would seem to make the >>>> halting problem an open question again. >>> >>> No. Invalidating a proof does not invalidate the theorem. How could >>> you not get this after all this time? >> >> Theorem X is proven on the basis of Y. >> Y is proven to be bogus. >> Thus the proof of Theorem X loses its basis. > > Not in dispute. If you don't understand what I'm saying, you could ask > me rather than just say things that are not at issue. As long as we are on the same page wit the above then I don't understand what you could mean. What do you mean? >>>>> Sometimes >>>>> you imply that you do, and sometimes you imply that you don't. We'll >>>>> never have a definitive claim because flip-flopping (and never posting >>>>> code that would settle the matter), is how you keep the chat going. >>>> >>>> I do not have any definitive claim on any open question. >>> >>> There is no open question here. But I agree you have no definitive >>> claim. You love to equivocate and flip-flop between claims. The way >>> you walked back the claim from two years ago that you had "actual Turing >>> machines" what an textbook example of the art. >> >> Turing machines or Turing equivalent machines, no consequential >> difference. I had never heard of Turing machine equivalece in 2018, >> yet understood the concept. > > I dare you: post what you had in Dec 2018. Then we can see what you > meant when you said you had a pair of actual Turing machines, fully > encoded, exactly and precisely as in Linz. > As I have said many many times I had the complete algorithm showing the details of how H() correctly decides not halting for H_Hat() on the basis of the infinite recursion of H_Hat() written in almost complete C. If I said that I wrote a paper on how to cure a kind of cancer and I actually only scribbled short hand notes on how to cure this cancer and the cure worked, then my original statement is sufficiently accurate. The fact that the cure worked would carry enormous weight on the assessment of the accuracy of the original statement. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-14 02:23 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <8735z4cl3t.fsf@bsb.me.uk> |
| In reply to | #27996 |
olcott <NoOne@NoWhere.com> writes: > On 1/13/2021 5:59 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>>>> <cut> >>>>>>>> Yes, except that the question "Does the simulation of the input have to >>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>>>>> classical halting problem. >>>>>>> >>>>>>> This is one of the very rare times that you have ever agreed with me >>>>>>> on a material fact. >>>>>> >>>>>> Not a very useful agreement unless you also agree that you can't have >>>>>> code that can make this determination in the general case. >>>>> >>>>> If we hypothetically assume that the conventional halting problem >>>>> undecidability proofs have been refuted that would seem to make the >>>>> halting problem an open question again. >>>> >>>> No. Invalidating a proof does not invalidate the theorem. How could >>>> you not get this after all this time? >>> >>> Theorem X is proven on the basis of Y. >>> Y is proven to be bogus. >>> Thus the proof of Theorem X loses its basis. >> >> Not in dispute. If you don't understand what I'm saying, you could ask >> me rather than just say things that are not at issue. > > As long as we are on the same page wit the above then I don't > understand what you could mean. What do you mean? If a theorem has a dozen published proofs, it does not matter if six of them are found to be bogus. The halting theorem has been proved in many different ways. You have never bothered to look at any of them. Heck, you have not even read Linz's "proper" proof. >>>>>> Sometimes >>>>>> you imply that you do, and sometimes you imply that you don't. We'll >>>>>> never have a definitive claim because flip-flopping (and never posting >>>>>> code that would settle the matter), is how you keep the chat going. >>>>> >>>>> I do not have any definitive claim on any open question. >>>> >>>> There is no open question here. But I agree you have no definitive >>>> claim. You love to equivocate and flip-flop between claims. The way >>>> you walked back the claim from two years ago that you had "actual Turing >>>> machines" what an textbook example of the art. >>> >>> Turing machines or Turing equivalent machines, no consequential >>> difference. I had never heard of Turing machine equivalece in 2018, >>> yet understood the concept. >> >> I dare you: post what you had in Dec 2018. Then we can see what you >> meant when you said you had a pair of actual Turing machines, fully >> encoded, exactly and precisely as in Linz. > > As I have said many many times I had the complete algorithm showing > the details of how H() correctly decides not halting for H_Hat() on > the basis of the infinite recursion of H_Hat() written in almost > complete C. I thought so. You won't post it no matter how many times I ask. But that's fine -- your repeated refusal to post it makes the point as clearly as posting it would. > If I said that I wrote a paper on how to cure a kind of cancer and I > actually only scribbled short hand notes on how to cure this cancer > and the cure worked, then my original statement is sufficiently > accurate. If, however, you had said you had an actual medicine, fully synthesised, exactly and precisely as required by hospitals, then that would be a lie, just as much as saying you had an actual pair of Turing machines, fully encoded, exactly and precisely as in Linz was a lie. > The fact that the cure worked would carry enormous weight on > the assessment of the accuracy of the original statement. No. You might be forgiven for lying, but that's not the same thing at all. And if you spent years backtracking on the claim, all the time refusing to post the formula for the marvellous cure while continuing to boast about it, you would be considered a huckster. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 21:21 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <-rWdndzZVY5VJWLCnZ2dnUU7-UfNnZ2d@giganews.com> |
| In reply to | #27998 |
On 1/13/2021 8:23 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 1/13/2021 5:59 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>>>>> <cut> >>>>>>>>> Yes, except that the question "Does the simulation of the input have to >>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>>>>>> classical halting problem. >>>>>>>> >>>>>>>> This is one of the very rare times that you have ever agreed with me >>>>>>>> on a material fact. >>>>>>> >>>>>>> Not a very useful agreement unless you also agree that you can't have >>>>>>> code that can make this determination in the general case. >>>>>> >>>>>> If we hypothetically assume that the conventional halting problem >>>>>> undecidability proofs have been refuted that would seem to make the >>>>>> halting problem an open question again. >>>>> >>>>> No. Invalidating a proof does not invalidate the theorem. How could >>>>> you not get this after all this time? >>>> >>>> Theorem X is proven on the basis of Y. >>>> Y is proven to be bogus. >>>> Thus the proof of Theorem X loses its basis. >>> >>> Not in dispute. If you don't understand what I'm saying, you could ask >>> me rather than just say things that are not at issue. >> >> As long as we are on the same page wit the above then I don't >> understand what you could mean. What do you mean? > > If a theorem has a dozen published proofs, it does not matter if six of > them are found to be bogus. The halting theorem has been proved in many > different ways. You have never bothered to look at any of them. Heck, > you have not even read Linz's "proper" proof. You already acknowledged that all the proofs have the same essential basis, thus refuting this basis would refute the Theorem. >>>>>>> Sometimes >>>>>>> you imply that you do, and sometimes you imply that you don't. We'll >>>>>>> never have a definitive claim because flip-flopping (and never posting >>>>>>> code that would settle the matter), is how you keep the chat going. >>>>>> >>>>>> I do not have any definitive claim on any open question. >>>>> >>>>> There is no open question here. But I agree you have no definitive >>>>> claim. You love to equivocate and flip-flop between claims. The way >>>>> you walked back the claim from two years ago that you had "actual Turing >>>>> machines" what an textbook example of the art. >>>> >>>> Turing machines or Turing equivalent machines, no consequential >>>> difference. I had never heard of Turing machine equivalece in 2018, >>>> yet understood the concept. >>> >>> I dare you: post what you had in Dec 2018. Then we can see what you >>> meant when you said you had a pair of actual Turing machines, fully >>> encoded, exactly and precisely as in Linz. >> >> As I have said many many times I had the complete algorithm showing >> the details of how H() correctly decides not halting for H_Hat() on >> the basis of the infinite recursion of H_Hat() written in almost >> complete C. > > I thought so. You won't post it no matter how many times I ask. But > that's fine -- your repeated refusal to post it makes the point as > clearly as posting it would. > It was hand written on a piece of paper. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-01-14 03:42 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <87o8hsb2w6.fsf@bsb.me.uk> |
| In reply to | #28001 |
olcott <NoOne@NoWhere.com> writes: > On 1/13/2021 8:23 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>>>>>> <cut> >>>>>>>>>> Yes, except that the question "Does the simulation of the input have to >>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the >>>>>>>>>> classical halting problem. >>>>>>>>> >>>>>>>>> This is one of the very rare times that you have ever agreed with me >>>>>>>>> on a material fact. >>>>>>>> >>>>>>>> Not a very useful agreement unless you also agree that you can't have >>>>>>>> code that can make this determination in the general case. >>>>>>> >>>>>>> If we hypothetically assume that the conventional halting problem >>>>>>> undecidability proofs have been refuted that would seem to make the >>>>>>> halting problem an open question again. >>>>>> >>>>>> No. Invalidating a proof does not invalidate the theorem. How could >>>>>> you not get this after all this time? >>>>> >>>>> Theorem X is proven on the basis of Y. >>>>> Y is proven to be bogus. >>>>> Thus the proof of Theorem X loses its basis. >>>> >>>> Not in dispute. If you don't understand what I'm saying, you could ask >>>> me rather than just say things that are not at issue. >>> >>> As long as we are on the same page wit the above then I don't >>> understand what you could mean. What do you mean? >> >> If a theorem has a dozen published proofs, it does not matter if six of >> them are found to be bogus. The halting theorem has been proved in many >> different ways. You have never bothered to look at any of them. Heck, >> you have not even read Linz's "proper" proof. > > You already acknowledged that all the proofs have the same essential > basis, thus refuting this basis would refute the Theorem. In fact I have stated the contrary. You still haven't read Linz's actual proof (rather than the one he sketches for historical reasons), have you? Have you looked at Rado's proof of the busy beaver theorem? What about Chaitin? Martin? Please also note that anything you do with your pile of x86 code will not apply to the standard proofs unless you can show that the H/H_Hat relationship has been maintained and you have admitted that you are not doing that with the latest ruse. >>>>>>>> Sometimes >>>>>>>> you imply that you do, and sometimes you imply that you don't. We'll >>>>>>>> never have a definitive claim because flip-flopping (and never posting >>>>>>>> code that would settle the matter), is how you keep the chat going. >>>>>>> >>>>>>> I do not have any definitive claim on any open question. >>>>>> >>>>>> There is no open question here. But I agree you have no definitive >>>>>> claim. You love to equivocate and flip-flop between claims. The way >>>>>> you walked back the claim from two years ago that you had "actual Turing >>>>>> machines" what an textbook example of the art. >>>>> >>>>> Turing machines or Turing equivalent machines, no consequential >>>>> difference. I had never heard of Turing machine equivalece in 2018, >>>>> yet understood the concept. >>>> >>>> I dare you: post what you had in Dec 2018. Then we can see what you >>>> meant when you said you had a pair of actual Turing machines, fully >>>> encoded, exactly and precisely as in Linz. >>> >>> As I have said many many times I had the complete algorithm showing >>> the details of how H() correctly decides not halting for H_Hat() on >>> the basis of the infinite recursion of H_Hat() written in almost >>> complete C. >> >> I thought so. You won't post it no matter how many times I ask. But >> that's fine -- your repeated refusal to post it makes the point as >> clearly as posting it would. >> > It was hand written on a piece of paper. And still you don't post it! (A JPG will do.) I really want to know what you considered to be two actual Turing machines, fully encoded, exactly and precisely as in Linz two years ago. Anyway, keep refusing. As I say, that's almost as good at making my point as posting it would be. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 22:15 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <1dOdnVYAmYjKWGLCnZ2dnUU7-YPNnZ2d@giganews.com> |
| In reply to | #28003 |
On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>> <cut>
>>>>>>>>>>> Yes, except that the question "Does the simulation of the input have to
>>>>>>>>>>> be stopped to prevent its otherwise infinite execution" is, itself, the
>>>>>>>>>>> classical halting problem.
>>>>>>>>>>
>>>>>>>>>> This is one of the very rare times that you have ever agreed with me
>>>>>>>>>> on a material fact.
>>>>>>>>>
>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>
>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>> halting problem an open question again.
>>>>>>>
>>>>>>> No. Invalidating a proof does not invalidate the theorem. How could
>>>>>>> you not get this after all this time?
>>>>>>
>>>>>> Theorem X is proven on the basis of Y.
>>>>>> Y is proven to be bogus.
>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>
>>>>> Not in dispute. If you don't understand what I'm saying, you could ask
>>>>> me rather than just say things that are not at issue.
>>>>
>>>> As long as we are on the same page wit the above then I don't
>>>> understand what you could mean. What do you mean?
>>>
>>> If a theorem has a dozen published proofs, it does not matter if six of
>>> them are found to be bogus. The halting theorem has been proved in many
>>> different ways. You have never bothered to look at any of them. Heck,
>>> you have not even read Linz's "proper" proof.
>>
>> You already acknowledged that all the proofs have the same essential
>> basis, thus refuting this basis would refute the Theorem.
>
> In fact I have stated the contrary. You still haven't read Linz's actual
> proof (rather than the one he sketches for historical reasons), have
> you? Have you looked at Rado's proof of the busy beaver theorem? What
> about Chaitin? Martin?
https://catonmat.net/busy-beaver
The busy beaver is not analogous to:
(a) The Liar Paradox
(b) Gödel's 1931 Incompleteness Theorem
(c) The Tarski Undefinability Theorem
Thus busy beaver is not relevant to my research on the mathematical
foundation of truth. Refuting the conventional:
"Do the opposite of whatever the halt decider decides"
Once D has determined this information, it does the opposite.
(Sipser 1997:165)
can be leveraged to apply to {a,b,c} above.
> Please also note that anything you do with your pile of x86 code will
> not apply to the standard proofs unless you can show that the H/H_Hat
> relationship has been maintained and you have admitted that you are not
> doing that with the latest ruse.
The only thing that this function does not implement from Linz is
copying its input and Sipser does it my way:
Now we construct a new Turing machine D with H as a subroutine.
(Sipser 1997:165)
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
Thus the above function has the key common elements of Linz and Sipser.
http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-14 08:37 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <oOXLH.7983$sl1.5642@fx45.iad> |
| In reply to | #28005 |
On 1/13/21 11:15 PM, olcott wrote:
> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>
>> Please also note that anything you do with your pile of x86 code will
>> not apply to the standard proofs unless you can show that the H/H_Hat
>> relationship has been maintained and you have admitted that you are not
>> doing that with the latest ruse.
>
> The only thing that this function does not implement from Linz is
> copying its input and Sipser does it my way:
FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
is the ONLY way to pass an input to a Turing Machine) the request to
decide on P given input P, which requires that P be on the input tape
twice, thus it needs to do the duplication. Sipser is just not explicit
about doing that, but it IS still fundamentally required to implement it.
>
> Now we construct a new Turing machine D with H as a subroutine.
> (Sipser 1997:165)
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> Thus the above function has the key common elements of Linz and Sipser.
>
> http://www.liarparadox.org/sipser_165.pdf
> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
> PWS Publishing Company (165-167)
>
Note, that by reusing the representation in the manner you have, you
have broken your Computational Equivalenc between your code and the
Turing Machines described in the proofs, because you have provided your
x86 code with information that the Turing Machines did not have, namely
that the input IS a copy of the machine that is running.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 09:18 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <iYSdnb3CvstB_Z39nZ2dnUU7-YGdnZ2d@giganews.com> |
| In reply to | #28008 |
On 1/14/2021 7:37 AM, Richard Damon wrote:
> On 1/13/21 11:15 PM, olcott wrote:
>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>
>>> Please also note that anything you do with your pile of x86 code will
>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>> relationship has been maintained and you have admitted that you are not
>>> doing that with the latest ruse.
>>
>> The only thing that this function does not implement from Linz is
>> copying its input and Sipser does it my way:
>
> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
> is the ONLY way to pass an input to a Turing Machine) the request to
> decide on P given input P, which requires that P be on the input tape
> twice, thus it needs to do the duplication. Sipser is just not explicit
> about doing that, but it IS still fundamentally required to implement it.
>>
>> Now we construct a new Turing machine D with H as a subroutine.
>> (Sipser 1997:165)
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> Thus the above function has the key common elements of Linz and Sipser.
>>
>> http://www.liarparadox.org/sipser_165.pdf
>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>> PWS Publishing Company (165-167)
>>
>
> Note, that by reusing the representation in the manner you have, you
> have broken your Computational Equivalenc between your code and the
> Turing Machines described in the proofs, because you have provided your
> x86 code with information that the Turing Machines did not have, namely
> that the input IS a copy of the machine that is running.
>
I could easily provide a copy and end up with the same results. The
problem is that Linz specifies infinitely recursive copies. This process
can be decided as not halting too, but the proof is more difficult to
understand. By passing the machine address (or tape location) instead of
making a copy we get the same
"Do the opposite of whatever the halt decider decides"
Once D has determined this information, it does the opposite.
(Sipser 1997:165)
basis used in all the proofs specified in the simplest possible way.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-14 10:47 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <DIZLH.2422$Jh1.1940@fx46.iad> |
| In reply to | #28011 |
On 1/14/21 10:18 AM, olcott wrote:
> On 1/14/2021 7:37 AM, Richard Damon wrote:
>> On 1/13/21 11:15 PM, olcott wrote:
>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>
>>>> Please also note that anything you do with your pile of x86 code will
>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>> relationship has been maintained and you have admitted that you are not
>>>> doing that with the latest ruse.
>>>
>>> The only thing that this function does not implement from Linz is
>>> copying its input and Sipser does it my way:
>>
>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>> is the ONLY way to pass an input to a Turing Machine) the request to
>> decide on P given input P, which requires that P be on the input tape
>> twice, thus it needs to do the duplication. Sipser is just not explicit
>> about doing that, but it IS still fundamentally required to implement it.
>>>
>>> Now we construct a new Turing machine D with H as a subroutine.
>>> (Sipser 1997:165)
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> Thus the above function has the key common elements of Linz and Sipser.
>>>
>>> http://www.liarparadox.org/sipser_165.pdf
>>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>>> PWS Publishing Company (165-167)
>>>
>>
>> Note, that by reusing the representation in the manner you have, you
>> have broken your Computational Equivalenc between your code and the
>> Turing Machines described in the proofs, because you have provided your
>> x86 code with information that the Turing Machines did not have, namely
>> that the input IS a copy of the machine that is running.
>>
>
> I could easily provide a copy and end up with the same results. The
> problem is that Linz specifies infinitely recursive copies. This process
> can be decided as not halting too, but the proof is more difficult to
> understand. By passing the machine address (or tape location) instead of
> making a copy we get the same
>
> "Do the opposite of whatever the halt decider decides"
> Once D has determined this information, it does the opposite.
> (Sipser 1997:165)
> basis used in all the proofs specified in the simplest possible way.
>
Linz does NOT specify infinitely recursive copies, as Linz does NOT
actually specify recursion at all. Linz (and SIPSER) only have
self-reference. It is only YOUR decision to try to solve by simulation
that gets you into something like recursion.
Also, the recursion CAN'T be infinite (if Halts meets its requirements)
as Halts is required to be a finite computation, and no finite
computation can have infinite recursion. Thus Halts needs to have a
strategy for solving this 'issue' if it wishes to be able to claim to
decide on such machines (and if it doesn't it can't claim to be Universal).
Also, as has been pointed out, this reuse has 'leaked' information into
Halts that it should not be able to have, namely that the mere fact that
the addresses match means the code matched. IF you REALLY created a
totally new program environment and loaded the program fresh into that,
matching addresses would not be enough to decide that the program was
the same. Particularly when one machine is just H, and the other is H^.
Note, you can't just pass a 'tape location', as the proof is stated as
passing an input, i.e. a tape. Those don't map into same concepts. Tape
location 5 of H is not the same as tape location 5 of H_Hat.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 10:41 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <psydnbSpWMi36Z39nZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #28015 |
On 1/14/2021 9:47 AM, Richard Damon wrote:
> On 1/14/21 10:18 AM, olcott wrote:
>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>> On 1/13/21 11:15 PM, olcott wrote:
>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>
>>>>> Please also note that anything you do with your pile of x86 code will
>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>> relationship has been maintained and you have admitted that you are not
>>>>> doing that with the latest ruse.
>>>>
>>>> The only thing that this function does not implement from Linz is
>>>> copying its input and Sipser does it my way:
>>>
>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>> decide on P given input P, which requires that P be on the input tape
>>> twice, thus it needs to do the duplication. Sipser is just not explicit
>>> about doing that, but it IS still fundamentally required to implement it.
>>>>
>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>> (Sipser 1997:165)
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> Thus the above function has the key common elements of Linz and Sipser.
>>>>
>>>> http://www.liarparadox.org/sipser_165.pdf
>>>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>>>> PWS Publishing Company (165-167)
>>>>
>>>
>>> Note, that by reusing the representation in the manner you have, you
>>> have broken your Computational Equivalenc between your code and the
>>> Turing Machines described in the proofs, because you have provided your
>>> x86 code with information that the Turing Machines did not have, namely
>>> that the input IS a copy of the machine that is running.
>>>
>>
>> I could easily provide a copy and end up with the same results. The
>> problem is that Linz specifies infinitely recursive copies. This process
>> can be decided as not halting too, but the proof is more difficult to
>> understand. By passing the machine address (or tape location) instead of
>> making a copy we get the same
>>
>> "Do the opposite of whatever the halt decider decides"
>> Once D has determined this information, it does the opposite.
>> (Sipser 1997:165)
>> basis used in all the proofs specified in the simplest possible way.
>>
>
> Linz does NOT specify infinitely recursive copies, as Linz does NOT
> actually specify recursion at all. Linz (and SIPSER) only have
> self-reference. It is only YOUR decision to try to solve by simulation
> that gets you into something like recursion.
Any configuration is completely determined by the current state of the
control unit, the contents of the tape, and the position of the
read-write head (Linz 1990:236)
The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
moves (Linz 1990:237)
Therefore H begins at a start state (q0) and ends up at one of two final
states (qy) or (qn) and can do [any damn thing inbetween] as long as it
ends up deciding halting on its input.
When the [any damn thing inbetween] H(q0) and H((qy)) or H((qn)) is H
simulating its input then the definition of Linz H logically entails
copying its input in infinite recursion.
Infinitely Recursive input on HP Proofs
https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/dhNDYvhFAAAJ
We are free to choose [any damn thing inbetween] H(q0) and H((qy)) or
H((qn)) as long as it correctly decides the resulting Ĥ(Ĥ).
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-14 12:55 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <qA%LH.19909$_b3.2408@fx41.iad> |
| In reply to | #28017 |
On 1/14/21 11:41 AM, olcott wrote:
> On 1/14/2021 9:47 AM, Richard Damon wrote:
>> On 1/14/21 10:18 AM, olcott wrote:
>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>
>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>> relationship has been maintained and you have admitted that you
>>>>>> are not
>>>>>> doing that with the latest ruse.
>>>>>
>>>>> The only thing that this function does not implement from Linz is
>>>>> copying its input and Sipser does it my way:
>>>>
>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>> decide on P given input P, which requires that P be on the input tape
>>>> twice, thus it needs to do the duplication. Sipser is just not explicit
>>>> about doing that, but it IS still fundamentally required to
>>>> implement it.
>>>>>
>>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>>> (Sipser 1997:165)
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> return;
>>>>> }
>>>>>
>>>>> Thus the above function has the key common elements of Linz and
>>>>> Sipser.
>>>>>
>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>> Boston:
>>>>> PWS Publishing Company (165-167)
>>>>>
>>>>
>>>> Note, that by reusing the representation in the manner you have, you
>>>> have broken your Computational Equivalenc between your code and the
>>>> Turing Machines described in the proofs, because you have provided your
>>>> x86 code with information that the Turing Machines did not have, namely
>>>> that the input IS a copy of the machine that is running.
>>>>
>>>
>>> I could easily provide a copy and end up with the same results. The
>>> problem is that Linz specifies infinitely recursive copies. This process
>>> can be decided as not halting too, but the proof is more difficult to
>>> understand. By passing the machine address (or tape location) instead of
>>> making a copy we get the same
>>>
>>> "Do the opposite of whatever the halt decider decides"
>>> Once D has determined this information, it does the opposite.
>>> (Sipser 1997:165)
>>> basis used in all the proofs specified in the simplest possible way.
>>>
>>
>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>> actually specify recursion at all. Linz (and SIPSER) only have
>> self-reference. It is only YOUR decision to try to solve by simulation
>> that gets you into something like recursion.
>
> Any configuration is completely determined by the current state of the
> control unit, the contents of the tape, and the position of the
> read-write head (Linz 1990:236)
>
> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
> moves (Linz 1990:237)
>
> Therefore H begins at a start state (q0) and ends up at one of two final
> states (qy) or (qn) and can do [any damn thing inbetween] as long as it
> ends up deciding halting on its input.
It can do anything that the machine is able to do. It can not get input
that isn't there, just as it can't give you a million dollars (Since
that isn't a power of Turing Machines), it also can't spit in the wind,
pull the mask of the ole Lone Range, or mess around with Jim.
>
> When the [any damn thing inbetween] H(q0) and H((qy)) or H((qn)) is H
> simulating its input then the definition of Linz H logically entails
> copying its input in infinite recursion.
It can NOT do infinite work in finite time. If H CHOOSES to simulate,
then yes, it hits a recursion, but ALL the problems that entails are ITS
choice, and the need to find ways to mitigate are ITS responsibility.
>
> Infinitely Recursive input on HP Proofs
> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/dhNDYvhFAAAJ
>
> We are free to choose [any damn thing inbetween] H(q0) and H((qy)) or
> H((qn)) as long as it correctly decides the resulting Ĥ(Ĥ).
>
It can do anything POSSIBLE.
Tell you want, I will define that section of my H to provide the proof
that your arguement is proved false. I guess that now by your arguement
you are now proven wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 12:16 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <NNWdnVoF7ZILF539nZ2dnUU7-YnNnZ2d@giganews.com> |
| In reply to | #28026 |
On 1/14/2021 11:55 AM, Richard Damon wrote:
> On 1/14/21 11:41 AM, olcott wrote:
>> On 1/14/2021 9:47 AM, Richard Damon wrote:
>>> On 1/14/21 10:18 AM, olcott wrote:
>>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>
>>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>>> relationship has been maintained and you have admitted that you
>>>>>>> are not
>>>>>>> doing that with the latest ruse.
>>>>>>
>>>>>> The only thing that this function does not implement from Linz is
>>>>>> copying its input and Sipser does it my way:
>>>>>
>>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>>> decide on P given input P, which requires that P be on the input tape
>>>>> twice, thus it needs to do the duplication. Sipser is just not explicit
>>>>> about doing that, but it IS still fundamentally required to
>>>>> implement it.
>>>>>>
>>>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>>>> (Sipser 1997:165)
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> return;
>>>>>> }
>>>>>>
>>>>>> Thus the above function has the key common elements of Linz and
>>>>>> Sipser.
>>>>>>
>>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>>> Boston:
>>>>>> PWS Publishing Company (165-167)
>>>>>>
>>>>>
>>>>> Note, that by reusing the representation in the manner you have, you
>>>>> have broken your Computational Equivalenc between your code and the
>>>>> Turing Machines described in the proofs, because you have provided your
>>>>> x86 code with information that the Turing Machines did not have, namely
>>>>> that the input IS a copy of the machine that is running.
>>>>>
>>>>
>>>> I could easily provide a copy and end up with the same results. The
>>>> problem is that Linz specifies infinitely recursive copies. This process
>>>> can be decided as not halting too, but the proof is more difficult to
>>>> understand. By passing the machine address (or tape location) instead of
>>>> making a copy we get the same
>>>>
>>>> "Do the opposite of whatever the halt decider decides"
>>>> Once D has determined this information, it does the opposite.
>>>> (Sipser 1997:165)
>>>> basis used in all the proofs specified in the simplest possible way.
>>>>
>>>
>>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>>> actually specify recursion at all. Linz (and SIPSER) only have
>>> self-reference. It is only YOUR decision to try to solve by simulation
>>> that gets you into something like recursion.
>>
>> Any configuration is completely determined by the current state of the
>> control unit, the contents of the tape, and the position of the
>> read-write head (Linz 1990:236)
>>
>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>> moves (Linz 1990:237)
>>
>> Therefore H begins at a start state (q0) and ends up at one of two final
>> states (qy) or (qn) and can do [any damn thing inbetween] as long as it
>> ends up deciding halting on its input.
>
> It can do anything that the machine is able to do.
As long as it moves from (q0) to the ((qy)) or ((qn)) that corresponds
to the halting status of its input it <is> a correct halt decider for
this input no matter what it does inbetween.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt =", Input_Would_Halt);
}
This means that Halts() <is> a correct halt decider for the above input
as long as it returns the correct value to main() even if this is the
only place that it returns a value.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-01-14 13:47 -0500 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <Lk0MH.18326$Yt4.12948@fx38.iad> |
| In reply to | #28029 |
On 1/14/21 1:16 PM, olcott wrote:
> On 1/14/2021 11:55 AM, Richard Damon wrote:
>> On 1/14/21 11:41 AM, olcott wrote:
>>> On 1/14/2021 9:47 AM, Richard Damon wrote:
>>>> On 1/14/21 10:18 AM, olcott wrote:
>>>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>>
>>>>>>>> Please also note that anything you do with your pile of x86 code
>>>>>>>> will
>>>>>>>> not apply to the standard proofs unless you can show that the
>>>>>>>> H/H_Hat
>>>>>>>> relationship has been maintained and you have admitted that you
>>>>>>>> are not
>>>>>>>> doing that with the latest ruse.
>>>>>>>
>>>>>>> The only thing that this function does not implement from Linz is
>>>>>>> copying its input and Sipser does it my way:
>>>>>>
>>>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as
>>>>>> that
>>>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>>>> decide on P given input P, which requires that P be on the input tape
>>>>>> twice, thus it needs to do the duplication. Sipser is just not
>>>>>> explicit
>>>>>> about doing that, but it IS still fundamentally required to
>>>>>> implement it.
>>>>>>>
>>>>>>> Now we construct a new Turing machine D with H as a
>>>>>>> subroutine.
>>>>>>> (Sipser 1997:165)
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> return;
>>>>>>> }
>>>>>>>
>>>>>>> Thus the above function has the key common elements of Linz and
>>>>>>> Sipser.
>>>>>>>
>>>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>>>> Boston:
>>>>>>> PWS Publishing Company (165-167)
>>>>>>>
>>>>>>
>>>>>> Note, that by reusing the representation in the manner you have, you
>>>>>> have broken your Computational Equivalenc between your code and the
>>>>>> Turing Machines described in the proofs, because you have provided
>>>>>> your
>>>>>> x86 code with information that the Turing Machines did not have,
>>>>>> namely
>>>>>> that the input IS a copy of the machine that is running.
>>>>>>
>>>>>
>>>>> I could easily provide a copy and end up with the same results. The
>>>>> problem is that Linz specifies infinitely recursive copies. This
>>>>> process
>>>>> can be decided as not halting too, but the proof is more difficult to
>>>>> understand. By passing the machine address (or tape location)
>>>>> instead of
>>>>> making a copy we get the same
>>>>>
>>>>> "Do the opposite of whatever the halt decider decides"
>>>>> Once D has determined this information, it does the opposite.
>>>>> (Sipser 1997:165)
>>>>> basis used in all the proofs specified in the simplest possible way.
>>>>>
>>>>
>>>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>>>> actually specify recursion at all. Linz (and SIPSER) only have
>>>> self-reference. It is only YOUR decision to try to solve by simulation
>>>> that gets you into something like recursion.
>>>
>>> Any configuration is completely determined by the current state of the
>>> control unit, the contents of the tape, and the position of the
>>> read-write head (Linz 1990:236)
>>>
>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>> moves (Linz 1990:237)
>>>
>>> Therefore H begins at a start state (q0) and ends up at one of two final
>>> states (qy) or (qn) and can do [any damn thing inbetween] as long as it
>>> ends up deciding halting on its input.
>>
>> It can do anything that the machine is able to do.
>
>
> As long as it moves from (q0) to the ((qy)) or ((qn)) that corresponds
> to the halting status of its input it <is> a correct halt decider for
> this input no matter what it does inbetween.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt =", Input_Would_Halt);
> }
>
>
> This means that Halts() <is> a correct halt decider for the above input
> as long as it returns the correct value to main() even if this is the
> only place that it returns a value.
>
WRONG.
IF we also run with a
int main()
{
H_Hat( (u32)H_Hat);
}
it must ALSO return that same value to the top level call in H_Hat, or
it PROVES that Halts is NOT the equivalent of the Turing Machine H.
Halts MUST be a 'pure' function, which means it will ALWAYS return the
same value to all calls with the same input.
The ONLY inputs to H is the representation of the machine, and the
representation of the input tape.
Failure to do this is proof that your system is broken.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-16 15:03 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) |
| Message-ID | <jIadndbq240pyZ79nZ2dnUU7-X3NnZ2d@giganews.com> |
| In reply to | #28031 |
On 1/14/2021 12:47 PM, Richard Damon wrote:
> On 1/14/21 1:16 PM, olcott wrote:
>> On 1/14/2021 11:55 AM, Richard Damon wrote:
>>> On 1/14/21 11:41 AM, olcott wrote:
>>>> On 1/14/2021 9:47 AM, Richard Damon wrote:
>>>>> On 1/14/21 10:18 AM, olcott wrote:
>>>>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>>>
>>>>>>>>> Please also note that anything you do with your pile of x86 code
>>>>>>>>> will
>>>>>>>>> not apply to the standard proofs unless you can show that the
>>>>>>>>> H/H_Hat
>>>>>>>>> relationship has been maintained and you have admitted that you
>>>>>>>>> are not
>>>>>>>>> doing that with the latest ruse.
>>>>>>>>
>>>>>>>> The only thing that this function does not implement from Linz is
>>>>>>>> copying its input and Sipser does it my way:
>>>>>>>
>>>>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as
>>>>>>> that
>>>>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>>>>> decide on P given input P, which requires that P be on the input tape
>>>>>>> twice, thus it needs to do the duplication. Sipser is just not
>>>>>>> explicit
>>>>>>> about doing that, but it IS still fundamentally required to
>>>>>>> implement it.
>>>>>>>>
>>>>>>>> Now we construct a new Turing machine D with H as a
>>>>>>>> subroutine.
>>>>>>>> (Sipser 1997:165)
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>> if (Input_Halts)
>>>>>>>> HERE: goto HERE;
>>>>>>>> return;
>>>>>>>> }
>>>>>>>>
>>>>>>>> Thus the above function has the key common elements of Linz and
>>>>>>>> Sipser.
>>>>>>>>
>>>>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>>>>> Boston:
>>>>>>>> PWS Publishing Company (165-167)
>>>>>>>>
>>>>>>>
>>>>>>> Note, that by reusing the representation in the manner you have, you
>>>>>>> have broken your Computational Equivalenc between your code and the
>>>>>>> Turing Machines described in the proofs, because you have provided
>>>>>>> your
>>>>>>> x86 code with information that the Turing Machines did not have,
>>>>>>> namely
>>>>>>> that the input IS a copy of the machine that is running.
>>>>>>>
>>>>>>
>>>>>> I could easily provide a copy and end up with the same results. The
>>>>>> problem is that Linz specifies infinitely recursive copies. This
>>>>>> process
>>>>>> can be decided as not halting too, but the proof is more difficult to
>>>>>> understand. By passing the machine address (or tape location)
>>>>>> instead of
>>>>>> making a copy we get the same
>>>>>>
>>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>> Once D has determined this information, it does the opposite.
>>>>>> (Sipser 1997:165)
>>>>>> basis used in all the proofs specified in the simplest possible way.
>>>>>>
>>>>>
>>>>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>>>>> actually specify recursion at all. Linz (and SIPSER) only have
>>>>> self-reference. It is only YOUR decision to try to solve by simulation
>>>>> that gets you into something like recursion.
>>>>
>>>> Any configuration is completely determined by the current state of the
>>>> control unit, the contents of the tape, and the position of the
>>>> read-write head (Linz 1990:236)
>>>>
>>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>>> moves (Linz 1990:237)
>>>>
>>>> Therefore H begins at a start state (q0) and ends up at one of two final
>>>> states (qy) or (qn) and can do [any damn thing inbetween] as long as it
>>>> ends up deciding halting on its input.
>>>
>>> It can do anything that the machine is able to do.
>>
>>
>> As long as it moves from (q0) to the ((qy)) or ((qn)) that corresponds
>> to the halting status of its input it <is> a correct halt decider for
>> this input no matter what it does inbetween.
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt =", Input_Would_Halt);
>> }
>>
>>
>> This means that Halts() <is> a correct halt decider for the above input
>> as long as it returns the correct value to main() even if this is the
>> only place that it returns a value.
>>
>
> WRONG.
>
> IF we also run with a
>
> int main()
> {
> H_Hat( (u32)H_Hat);
> }
>
> it must ALSO return that same value to the top level call in H_Hat, or
> it PROVES that Halts is NOT the equivalent of the Turing Machine H.
Try and cite any textbook source that proves that a decider must return
a value more than once. You are talking out of your ass.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 14 of 16 — ← Prev page 1 … 12 13 [14] 15 16 Next page →
Back to top | Article view | comp.theory
csiph-web