Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #32563 > unrolled thread
| Started by | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| First post | 2021-05-02 14:15 +0100 |
| Last post | 2021-05-06 15:57 -0400 |
| Articles |
20 on this page of 1000+
— 15 participants
Thread has 1237 articles; only the first 1000 are indexed. |
Back to article view | Back to comp.theory | Browse in flat view
Thread has 1237 articles; showing the first 1000 in depth-first order. Use the flat group view to see the rest.
Solution To The Halting Problem Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-02 14:15 +0100
Re: Solution To The Halting Problem Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 14:03 +0000
Re: Solution To The Halting Problem Richard Harnden <richard.nospam@gmail.com> - 2021-05-02 15:15 +0100
Re: Solution To The Halting Problem [ Accurate review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 10:21 -0500
Re: Solution To The Halting Problem [ Accurate review? ] Richard Harnden <richard.nospam@gmail.com> - 2021-05-02 17:11 +0100
Re: Solution To The Halting Problem [ Accurate review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 11:18 -0500
Re: Solution To The Halting Problem [ Accurate review? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 13:53 -0400
Re: Solution To The Halting Problem [ Accurate review? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 16:38 +0000
Re: Solution To The Halting Problem [ Accurate review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 12:10 -0500
Re: Solution To The Halting Problem [ Accurate review? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 17:39 +0000
Re: Solution To The Halting Problem [ Accurate review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 12:50 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 12:55 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-02 19:14 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 13:18 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 14:40 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 14:30 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 15:58 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 22:49 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 06:42 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 08:52 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 10:29 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 09:45 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 15:05 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 10:11 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 11:15 -0400
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] olcott <NoOne@NoWhere.com> - 2021-05-03 10:24 -0500
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 11:59 -0400
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] olcott <NoOne@NoWhere.com> - 2021-05-03 11:17 -0500
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 12:36 -0400
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 17:39 +0000
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] olcott <NoOne@NoWhere.com> - 2021-05-04 09:38 -0500
Re: Solution To The Halting Problem [ Dishonest Dodge Defined ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 16:45 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 17:29 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 09:36 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:28 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:38 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 12:08 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 17:49 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 12:25 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-05 02:47 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 17:01 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 13:07 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 19:17 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 20:36 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 15:26 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 11:14 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-03 22:33 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 19:57 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 17:29 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 02:12 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 21:31 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 02:45 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 22:54 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 04:12 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 23:39 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 14:27 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 09:36 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 14:42 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 09:49 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 14:57 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 10:06 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-03 17:21 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 09:20 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 10:37 -0400
Re: Solution To The Halting Problem [ Chomsky hierarchy ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:24 -0500
Re: Solution To The Halting Problem [ Chomsky hierarchy ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:55 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Andy Walker <anw@cuboid.co.uk> - 2021-05-04 15:37 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 16:42 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 12:13 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 19:05 +0000
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-03 16:46 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 11:01 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 12:15 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-03 11:22 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 12:38 -0400
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 00:27 +0100
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 09:59 -0500
Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 17:06 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 13:45 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 19:24 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 19:41 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 20:54 -0400
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 00:55 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 20:06 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 02:48 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 21:51 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 02:59 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 22:31 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 07:43 -0400
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 15:24 +0000
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-05 11:31 -0500
Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 17:00 +0000
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 12:43 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 18:05 +0000
Re: Solution To The Halting Problem [ H based on UTM ](errors?) olcott <NoOne@NoWhere.com> - 2021-05-05 13:20 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 14:08 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 13:25 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 14:59 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 14:20 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 15:44 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 16:19 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 17:42 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 17:19 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 19:47 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 19:03 -0500
Re: Solution To The Halting Problem [ H based on UTM ] Richard Damon <Richard@Damon-Family.org> - 2021-05-05 20:41 -0400
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 20:35 -0500
Re: Solution To The Halting Problem [ H based on UTM ] André G. Isaak <agisaak@gm.invalid> - 2021-05-05 20:08 -0600
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 21:15 -0500
Re: Solution To The Halting Problem [ H based on UTM ] André G. Isaak <agisaak@gm.invalid> - 2021-05-05 20:48 -0600
Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 21:59 -0500
Re: Solution To The Halting Problem [ H based on UTM ] André G. Isaak <agisaak@gm.invalid> - 2021-05-05 21:45 -0600
Re: Solution To The Halting Problem [ H based on UTM ](Pattern Matching) olcott <NoOne@NoWhere.com> - 2021-05-05 23:03 -0500
Re: Solution To The Halting Problem [ H based on UTM ](Pattern Matching) André G. Isaak <agisaak@gm.invalid> - 2021-05-06 09:52 -0600
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 11:03 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) André G. Isaak <agisaak@gm.invalid> - 2021-05-06 10:39 -0600
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 12:08 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) André G. Isaak <agisaak@gm.invalid> - 2021-05-06 11:46 -0600
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 13:24 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) André G. Isaak <agisaak@gm.invalid> - 2021-05-06 12:55 -0600
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 14:03 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 14:04 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 14:17 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 15:19 -0400
New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-06 21:31 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-06 16:40 -0500
Re: New test program Richard Damon <Richard@Damon-Family.org> - 2021-05-06 17:52 -0400
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-06 23:53 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-06 19:04 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 00:40 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-06 19:44 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 16:08 +0000
Re: New test program Richard Damon <Richard@Damon-Family.org> - 2021-05-06 21:15 -0400
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 09:35 -0500
Re: New test program Richard Damon <Richard@Damon-Family.org> - 2021-05-07 11:25 -0400
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 10:47 -0500
Re: New test program Richard Damon <Richard@Damon-Family.org> - 2021-05-07 12:06 -0400
Re: New test program (errors corrected) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 19:35 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 14:16 -0500
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 14:18 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 19:48 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 15:04 -0500
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 15:07 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 20:22 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 15:27 -0500
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 11:25 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 17:42 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 12:45 -0500
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 12:00 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 18:01 +0000
Re: New test program olcott <NoOne@NoWhere.com> - 2021-05-07 13:07 -0500
Re: New test program Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 19:07 +0000
Re: New test program (succeeds) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 18:38 +0000
Re: New test program (errors corrected) olcott <NoOne@NoWhere.com> - 2021-05-07 14:14 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 20:37 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 16:13 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 22:09 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 17:46 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 19:11 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-07 23:40 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 18:48 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 00:14 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 19:38 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 20:50 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 19:54 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:07 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:14 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:24 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:32 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:39 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:48 -0400
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 03:00 +0100
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 23:42 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:35 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 09:40 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:30 -0400
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:16 +0100
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 02:05 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 22:45 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 06:05 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 22:06 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-09 01:10 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 19:32 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-09 01:44 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 20:00 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 21:15 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 20:20 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 22:03 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-09 13:07 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-09 19:22 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-09 13:38 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 14:39 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 07:22 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-09 23:31 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-09 18:36 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 02:21 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:32 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 22:54 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 16:15 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 10:26 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 16:53 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 12:07 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-10 18:43 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 13:18 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-10 19:28 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 13:44 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 19:07 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( qualified technical reviewer ) olcott <NoOne@NoWhere.com> - 2021-05-10 14:19 -0500
Re: New test program (Succeeds V2)[ PO is intellectually dishonest ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-10 20:22 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 14:36 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-10 22:06 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 16:34 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-11 00:04 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 18:20 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 17:10 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 18:42 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 19:45 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 21:13 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:39 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 20:39 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 21:56 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 21:06 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 22:36 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 21:53 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 23:20 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-10 22:33 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-11 21:57 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 19:46 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 21:02 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 20:10 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 21:40 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-11 23:14 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 21:01 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 22:27 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 22:45 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 00:01 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 11:03 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 09:18 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-12 07:53 -0700
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 10:04 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 15:04 +0000
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 10:48 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 16:45 +0000
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 11:50 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 22:54 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 17:55 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 00:01 +0100
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 18:11 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 18:15 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:11 -0400
Re: New test program (Succeeds V2)[ software engineering competence ] olcott <NoOne@NoWhere.com> - 2021-05-12 22:20 -0500
Re: New test program (Succeeds V2)[ software engineering competence ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:41 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 00:50 +0100
Re: New test program (Succeeds V2)[ will not blink ] olcott <NoOne@NoWhere.com> - 2021-05-12 18:59 -0500
Re: New test program (Succeeds V2)[ will not blink ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 01:26 +0100
Re: New test program (Succeeds V2)[ will not blink ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:15 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 11:52 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 13:11 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 15:21 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 16:54 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-12 17:21 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 17:25 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 18:36 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 18:22 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 19:37 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 19:50 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 19:42 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 21:01 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 21:05 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 00:39 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 20:04 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 02:02 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 21:12 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 02:41 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 22:11 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 03:41 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 22:58 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 04:11 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-12 23:37 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-13 07:19 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 08:54 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 14:57 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 10:11 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 15:47 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 10:55 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 11:08 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 16:18 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 11:46 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 17:19 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 13:08 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 18:19 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 13:53 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] André G. Isaak <agisaak@gm.invalid> - 2021-05-13 13:53 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 15:05 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 20:48 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 15:59 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] André G. Isaak <agisaak@gm.invalid> - 2021-05-13 19:52 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 20:17 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 15:55 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-13 21:00 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-14 16:20 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-14 11:49 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-14 20:40 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-14 16:19 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 17:31 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-14 21:47 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-14 22:00 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 08:32 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 08:24 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 09:50 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 10:28 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 12:05 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 17:31 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 12:37 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 14:30 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 19:35 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 15:10 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 21:00 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 21:27 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 07:55 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 18:07 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 22:50 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-16 17:09 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-17 01:52 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-16 20:25 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:49 -0400
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-17 22:28 -0500
Re: New test program (Succeeds V2)[ fail to understand ] Richard Damon <Richard@Damon-Family.org> - 2021-05-18 07:16 -0400
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-18 09:05 -0500
Re: New test program (Succeeds V2)[ fail to understand ] Richard Damon <Richard@Damon-Family.org> - 2021-05-18 22:03 -0400
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-18 21:24 -0500
Re: New test program (Succeeds V2)[ fail to understand ] Richard Damon <Richard@Damon-Family.org> - 2021-05-19 06:58 -0400
Re: New test program (Succeeds V2)[ fail to understand ] Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:13 -0400
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-19 09:21 -0500
Re: New test program (Succeeds V2)[ fail to understand ] Richard Damon <Richard@Damon-Family.org> - 2021-05-19 11:25 -0400
Re: New test program (Succeeds V2)[ fail to understand ](4) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:16 -0400
Re: New test program (Succeeds V2)[ fail to understand ](4) olcott <NoOne@NoWhere.com> - 2021-05-19 09:41 -0500
Re: New test program (Succeeds V2)[ fail to understand ](4) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 11:03 -0400
Re: New test program (Succeeds V2)[ fail to understand ](4) olcott <NoOne@NoWhere.com> - 2021-05-19 09:03 -0500
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-19 08:36 -0500
Re: New test program (Succeeds V2)[ fail to understand ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-19 13:57 +0000
Re: New test program (Succeeds V2)[ fail to understand ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 14:13 +0100
Re: New test program (Succeeds V2)[ fail to understand ] olcott <NoOne@NoWhere.com> - 2021-05-18 08:57 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:56 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-17 20:19 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 18:05 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-15 15:54 -0700
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-15 18:15 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 19:36 -0400
Re: New test program (Succeeds V2)[ mutual agreement? ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-15 16:42 -0700
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-15 19:02 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 20:40 -0400
Re: New test program (Succeeds V2)[ mutual agreement? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 02:30 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 19:31 +0000
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 21:28 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 08:59 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 10:23 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-15 10:26 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 12:16 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 00:12 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-14 21:56 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-15 08:41 -0400
Re: New test program (Succeeds V2)[ single-minded focus ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 17:12 +0100
Re: New test program (Succeeds V2)[ single-minded focus ] André G. Isaak <agisaak@gm.invalid> - 2021-05-13 11:51 -0600
Re: New test program (Succeeds V2)[ single-minded focus ] olcott <NoOne@NoWhere.com> - 2021-05-13 13:13 -0500
Re: New test program (Succeeds V2)[ single-minded focus ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:21 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 07:46 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 15:45 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 19:44 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 18:52 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 01:20 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 19:33 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 18:42 -0600
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 19:54 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] André G. Isaak <agisaak@gm.invalid> - 2021-05-12 19:30 -0600
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 20:40 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:28 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 22:26 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-13 17:20 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 00:55 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-14 07:46 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 09:28 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 16:51 +0100
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 11:12 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 12:28 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] André G. Isaak <agisaak@gm.invalid> - 2021-05-14 11:18 -0600
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 12:30 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] André G. Isaak <agisaak@gm.invalid> - 2021-05-14 11:53 -0600
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 14:51 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 14:10 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 15:36 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 13:26 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] André G. Isaak <agisaak@gm.invalid> - 2021-05-14 15:03 -0600
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 16:20 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] André G. Isaak <agisaak@gm.invalid> - 2021-05-14 15:27 -0600
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 13:53 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 15:43 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-14 13:36 -0700
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 16:17 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 17:29 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 14:47 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 22:28 +0100
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 17:49 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 19:50 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 02:08 +0100
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 21:53 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 17:11 +0100
Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-15 12:32 -0500
Re: New test program (Succeeds V2)[ entirely different computation ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 21:33 +0100
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-15 18:13 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 00:42 +0100
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-15 19:15 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-16 02:34 -0700
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 09:00 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 17:41 +0100
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:17 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 18:22 +0000
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:37 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 18:53 +0000
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 14:11 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:51 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 15:59 -0400
Re: New test program (Succeeds V2)[ mutual agreement? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 22:26 +0100
Re: New test program (Succeeds V2)[ mutual agreement? ] olcott <NoOne@NoWhere.com> - 2021-05-16 16:40 -0500
Re: New test program (Succeeds V2)[ mutual agreement? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-17 01:46 +0100
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-16 20:04 -0500
Re: New test program (Succeeds V2)[ fess up ! ] André G. Isaak <agisaak@gm.invalid> - 2021-05-16 19:17 -0600
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-16 20:31 -0500
Re: New test program (Succeeds V2)[ fess up ! ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 21:57 -0400
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-16 21:30 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 23:25 -0400
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-16 23:04 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Richard Damon <Richard@Damon-Family.org> - 2021-05-17 07:32 -0400
Re: New test program (Succeeds V2)[ ultimate measure ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 07:53 +0000
Re: New test program (Succeeds V2)[ ultimate measure ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 17:29 +0000
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-17 12:35 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-17 10:00 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 15:18 +0000
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-17 10:32 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Richard Damon <Richard@Damon-Family.org> - 2021-05-17 20:44 -0400
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-16 22:13 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 23:33 -0400
Re: New test program (Succeeds V2)[ ultimate measure ] olcott <NoOne@NoWhere.com> - 2021-05-16 23:23 -0500
Re: New test program (Succeeds V2)[ ultimate measure ] Richard Damon <Richard@Damon-Family.org> - 2021-05-17 07:37 -0400
Re: New test program (Succeeds V2)[ fess up ! ] André G. Isaak <agisaak@gm.invalid> - 2021-05-16 21:16 -0600
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-17 12:17 -0500
Re: New test program (Succeeds V2)[ fess up ! ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 17:28 +0000
Re: New test program (Succeeds V2)[ fess up ! ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 14:51 -0600
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-17 16:40 -0500
Re: New test program (Succeeds V2)[ fess up ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-17 20:58 +0100
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-17 15:09 -0500
Re: New test program (Succeeds V2)[ fess up ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:56 +0100
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-17 20:18 -0500
Re: New test program (Succeeds V2)[ fess up ! ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 11:54 -0600
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 13:15 -0500
Re: New test program (Succeeds V2)[ self-reference ] Mr Flibble <flibble@reddwarf.jmc> - 2021-05-17 18:19 +0000
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 13:30 -0500
Re: New test program (Succeeds V2)[ self-reference ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 18:38 +0000
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 14:23 -0500
Re: New test program (Succeeds V2)[ self-reference ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 14:06 -0600
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 16:33 -0500
Re: New test program (Succeeds V2)[ self-reference ] Mr Flibble <flibble@reddwarf.jmc> - 2021-05-18 16:24 +0000
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-18 12:11 -0500
Re: New test program (Succeeds V2)[ self-reference ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 17:50 +0000
Re: New test program (Succeeds V2)[ self-reference ] R Kym Horsell <kym@kymhorsell.com> - 2021-05-18 21:36 +0000
Re: New test program (Succeeds V2)[ self-reference ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 16:08 -0600
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 17:50 -0500
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-18 13:37 -0500
Re: New test program (Succeeds V2)[ self-reference ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 19:19 +0000
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-18 15:01 -0500
Re: New test program (Succeeds V2)[ self-reference ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 21:43 +0000
Re: New test program (Succeeds V2)[ no sense talking about anything else ] olcott <NoOne@NoWhere.com> - 2021-05-18 17:02 -0500
Re: New test program (Succeeds V2)[ no sense talking about anything else ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 22:43 +0000
Re: New test program (Succeeds V2)[ no sense talking about anything else ] olcott <NoOne@NoWhere.com> - 2021-05-18 18:05 -0500
Re: New test program (Succeeds V2)[ no sense talking about anything else ] Richard Damon <Richard@Damon-Family.org> - 2021-05-18 19:23 -0400
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far) olcott <NoOne@NoWhere.com> - 2021-05-18 18:31 -0500
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far) Richard Damon <Richard@Damon-Family.org> - 2021-05-18 22:07 -0400
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-18 21:31 -0500
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-19 04:01 -0700
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 07:01 -0400
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:18 -0400
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-19 09:45 -0500
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 11:20 -0400
Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-19 08:47 -0500
Re: New test program (Succeeds V2)[ self-reference ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 18:59 -0600
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 20:17 -0500
Re: New test program (Succeeds V2)[ self-reference ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 22:13 -0600
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-17 23:33 -0500
Re: New test program (Succeeds V2)[ self-reference ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 23:33 -0600
Re: New test program (Succeeds V2)[ self-reference ] Richard Damon <Richard@Damon-Family.org> - 2021-05-18 07:22 -0400
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-18 08:53 -0500
Re: New test program (Succeeds V2)[ self-reference ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 13:37 +0100
Re: New test program (Succeeds V2)[ self-reference ] olcott <NoOne@NoWhere.com> - 2021-05-18 09:01 -0500
Re: New test program (Succeeds V2)[ self-reference ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 17:58 +0000
Re: New test program (Succeeds V2)[ fess up ! ] olcott <NoOne@NoWhere.com> - 2021-05-17 09:58 -0500
Re: New test program (Succeeds V2)[ fess up ! ] André G. Isaak <agisaak@gm.invalid> - 2021-05-17 09:27 -0600
Re: New test program (Succeeds V2)[ fess up ! ] Richard Damon <Richard@Damon-Family.org> - 2021-05-17 07:42 -0400
Re: New test program (Succeeds V2)[ fess up ! ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:56 +0100
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 16:13 -0500
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 21:39 +0000
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 16:53 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 22:28 +0000
Re: New test program (Succeeds V2)[ key basis ](first repeat) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-17 23:07 +0000
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 18:47 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 00:41 +0000
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 20:09 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 13:24 +0100
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-18 08:58 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 13:03 +0100
Halting theorem refutation (pause until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-20 10:08 -0500
Re: Halting theorem refutation (pause until mutual agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 00:46 +0100
Re: New test program (Succeeds V2)[ key basis ](first repeat) André G. Isaak <agisaak@gm.invalid> - 2021-05-17 18:46 -0600
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 20:14 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 13:31 +0100
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-18 08:59 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 18:43 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 00:34 +0000
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 19:50 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:13 -0400
Re: New test program (Succeeds V2)[ key basis ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:10 -0400
Re: New test program (Succeeds V2)[ key basis ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 18:05 -0500
Re: New test program (Succeeds V2)[ key basis ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:07 -0400
Re: New test program (Succeeds V2)[ key basis ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:05 -0400
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) André G. Isaak <agisaak@gm.invalid> - 2021-05-17 16:21 -0600
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) olcott <NoOne@NoWhere.com> - 2021-05-17 18:00 -0500
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:16 -0400
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-18 16:54 -0700
Re: New test program (Succeeds V2)[ fess up ! ](first repeat) Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:04 -0400
Re: New test program (Succeeds V2)[ entirely different computation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 21:12 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-14 02:50 -0700
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-14 07:52 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 08:15 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 15:50 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-14 11:40 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 17:10 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] Jeff Barnett <jbb@notatt.com> - 2021-05-14 10:53 -0600
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:26 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 10:51 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-13 08:19 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 22:49 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-13 17:40 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-14 00:55 +0100
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-13 07:17 -0400
Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-13 08:26 -0500
Re: New test program (Succeeds V2)[ counter-example in C ? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-13 19:18 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:35 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 08:18 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 08:53 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 10:07 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 20:25 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 13:09 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 14:36 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 13:56 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 15:15 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-11 13:32 -0700
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 16:27 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 17:37 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 17:36 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 19:13 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] André G. Isaak <agisaak@gm.invalid> - 2021-05-11 19:01 -0600
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-11 07:02 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-11 08:26 -0500
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:05 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:43 -0400
Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:31 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 19:42 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 04:37 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 10:44 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-11 08:51 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:06 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truisms have no correct rebuttal ) olcott <NoOne@NoWhere.com> - 2021-05-11 09:28 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truisms have no correct rebuttal ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:13 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truisms have no correct rebuttal ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 15:12 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 10:17 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 19:41 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:21 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:17 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 17:10 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 20:10 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 15:09 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-12 10:54 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 16:48 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) olcott <NoOne@NoWhere.com> - 2021-05-12 12:12 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-05-12 10:28 -0700
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) olcott <NoOne@NoWhere.com> - 2021-05-12 12:40 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 18:40 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) olcott <NoOne@NoWhere.com> - 2021-05-12 14:12 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 18:37 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) olcott <NoOne@NoWhere.com> - 2021-05-12 14:06 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( counter-example input ) Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:36 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-12 23:33 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 11:17 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 00:28 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 18:49 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 00:12 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 19:30 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 00:55 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 11:38 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-12 09:19 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 00:16 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 14:44 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-11 10:00 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 15:07 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 10:15 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 15:42 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 20:08 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 11:01 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 16:29 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 22:30 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( reply to Richard ) olcott <NoOne@NoWhere.com> - 2021-05-11 21:47 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( reply to Richard ) Richard Damon <Richard@Damon-Family.org> - 2021-05-11 23:12 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 12:00 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 17:14 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 12:22 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 17:35 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 12:42 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 18:07 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 13:54 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 19:56 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 15:09 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 20:53 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 16:14 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 21:48 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 17:19 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-11 22:39 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 17:47 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 00:45 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 19:40 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 11:48 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-12 09:28 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-13 00:16 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Jeff Barnett <jbb@notatt.com> - 2021-05-18 13:40 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 15:43 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 21:35 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 16:50 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-18 22:37 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Andy Walker <anw@cuboid.co.uk> - 2021-05-20 13:39 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) André G. Isaak <agisaak@gm.invalid> - 2021-05-18 16:50 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 18:09 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-18 19:30 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 18:34 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-18 22:18 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-18 21:33 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 07:41 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:20 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-19 08:49 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 13:58 -0600
Halting theorem refutation (repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 15:10 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) André G. Isaak <agisaak@gm.invalid> - 2021-05-18 17:41 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 19:05 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) André G. Isaak <agisaak@gm.invalid> - 2021-05-18 18:40 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 20:19 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) André G. Isaak <agisaak@gm.invalid> - 2021-05-18 19:35 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 20:52 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Richard Damon <Richard@Damon-Family.org> - 2021-05-18 22:22 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-18 21:35 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 07:43 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) olcott <NoOne@NoWhere.com> - 2021-05-19 08:58 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria )(counter-example required) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:37 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion ) olcott <NoOne@NoWhere.com> - 2021-05-19 12:29 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion ) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 13:47 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 14:53 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 16:16 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 17:28 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 17:04 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 18:12 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 17:50 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 18:54 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 17:57 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 19:04 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 18:19 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 19:31 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 18:35 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 19:48 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 18:56 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 20:08 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 19:57 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 21:21 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 21:31 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 20:42 -0600
Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 22:15 -0500
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 22:40 -0600
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-20 00:07 -0500
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-20 07:14 -0400
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )( disingenuous(2) ) olcott <NoOne@NoWhere.com> - 2021-05-20 11:15 -0500
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) André G. Isaak <agisaak@gm.invalid> - 2021-05-20 12:19 -0600
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )( halt deciding criteria ) olcott <NoOne@NoWhere.com> - 2021-05-20 13:41 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Jeff Barnett <jbb@notatt.com> - 2021-05-19 22:56 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-20 00:10 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Andy Walker <anw@cuboid.co.uk> - 2021-05-20 13:00 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 13:28 +0100
Halting theorem refutation( three irrefutable truisms lead to one conclusion )( disingenuous ) olcott <NoOne@NoWhere.com> - 2021-05-20 10:41 -0500
Re: Halting theorem refutation( three irrefutable truisms lead to one conclusion )( disingenuous ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 00:41 +0100
Re: Halting theorem refutation( three irrefutable truisms lead to one conclusion )( disingenuous ) olcott <NoOne@NoWhere.com> - 2021-05-20 19:02 -0500
Re: Halting theorem refutation( three irrefutable truisms lead to one conclusion )( disingenuous ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 23:48 +0100
Re: Re: Eliminating the pathological self-reference error of the halting theorem (V7) olcott <NoOne@NoWhere.com> - 2021-05-21 18:14 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7.5) olcott <NoOne@NoWhere.com> - 2021-05-22 21:01 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7.5) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-24 01:24 +0100
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-27 01:38 -0700
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable olcott <NoOne@NoWhere.com> - 2021-05-27 08:04 -0500
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-27 06:40 -0700
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable olcott <NoOne@NoWhere.com> - 2021-05-27 08:50 -0500
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-27 07:17 -0700
Re: Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); (gets the correct answer) olcott <NoOne@NoWhere.com> - 2021-05-27 09:30 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7.5) olcott <NoOne@NoWhere.com> - 2021-05-23 20:26 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-05-24 21:40 -0700
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-25 08:44 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-25 17:14 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V11)(Proxy inputs) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-26 18:08 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V11)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 12:21 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V11)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-25 12:27 -0500
Re: Question for Ben (or anyone else who knows) about Post Systems Jeff Barnett <jbb@notatt.com> - 2021-05-24 23:36 -0600
Re: Question for Ben (or anyone else who knows) about Post Systems Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-25 12:06 +0100
Re: Question for Ben (or anyone else who knows) about Post Systems Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-25 12:18 +0100
Re: Question for Ben (or anyone else who knows) about Post Systems Jeff Barnett <jbb@notatt.com> - 2021-05-25 11:37 -0600
Re: Question for Ben (or anyone else who knows) about Post Systems Andy Walker <anw@cuboid.co.uk> - 2021-05-25 12:44 +0100
Re: Question for Ben (or anyone else who knows) about Post Systems Jeff Barnett <jbb@notatt.com> - 2021-05-25 11:44 -0600
Re: Question for Ben (or anyone else who knows) about Post Systems Andy Walker <anw@cuboid.co.uk> - 2021-05-25 20:46 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-27 16:20 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-28 01:45 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-27 20:25 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-29 23:24 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-29 17:38 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-27 10:47 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-26 02:58 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-25 21:40 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-27 01:00 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 19:50 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Richard Damon <Richard@Damon-Family.org> - 2021-05-26 21:15 -0400
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Richard Damon <Richard@Damon-Family.org> - 2021-05-26 20:33 -0400
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-26 02:00 -0700
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-26 11:59 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-26 06:32 -0700
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-26 16:31 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-26 11:17 -0700
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-26 23:41 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 19:18 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) Richard Damon <Richard@Damon-Family.org> - 2021-05-26 20:36 -0400
Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable olcott <NoOne@NoWhere.com> - 2021-05-27 01:42 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 13:38 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 15:47 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7.5) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-25 00:37 +0100
Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-24 21:01 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-23 00:21 +0100
Re: Halting theorem refutation( three irrefutable truisms lead to one conclusion )( mutual agreement? ) olcott <NoOne@NoWhere.com> - 2021-05-22 09:49 -0500
Re: Halting theorem refutation ( halt deciding principle ) olcott <NoOne@NoWhere.com> - 2021-05-20 17:08 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-21 00:10 +0100
Re: Re: Halting theorem refutation (V3) olcott <NoOne@NoWhere.com> - 2021-05-20 18:40 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Jeff Barnett <jbb@notatt.com> - 2021-05-21 00:11 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-21 07:58 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 13:16 +0000
Halting theorem refutation [ Please look at version 5 ] olcott <NoOne@NoWhere.com> - 2021-05-21 08:48 -0500
Re: Halting theorem refutation [ Please look at version 5 ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 14:19 +0000
Re: Halting theorem refutation [ Please look at version 5 ] olcott <NoOne@NoWhere.com> - 2021-05-21 09:43 -0500
Re: Halting theorem refutation [ Please look at version 5 ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 16:13 +0000
Re: Halting theorem refutation [ Please look at version 5 ] olcott <NoOne@NoWhere.com> - 2021-05-21 11:36 -0500
Re: Halting theorem refutation [ Please look at version 5 ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 17:19 +0000
Re: Halting theorem refutation [ Please look at version 5 ] olcott <NoOne@NoWhere.com> - 2021-05-21 12:24 -0500
Re: Halting theorem refutation [ Please look at version 5 ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 17:45 +0000
Re: Halting theorem refutation [ Please look at version 5 ] olcott <NoOne@NoWhere.com> - 2021-05-21 13:07 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-05-21 09:17 -0700
Refutation of the halting theorem on the basis of its pathological self-reference error olcott <NoOne@NoWhere.com> - 2021-05-21 11:41 -0500
Re: Refutation of the halting theorem on the basis of its pathological self-reference error Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 17:27 +0000
Re: Refutation of the halting theorem on the basis of its pathological self-reference error (v6) olcott <NoOne@NoWhere.com> - 2021-05-21 12:40 -0500
Re: Refutation of the halting theorem on the basis of its pathological self-reference error (V7) olcott <NoOne@NoWhere.com> - 2021-05-21 18:10 -0500
Re: Refutation of the halting theorem on the basis of its pathological self-reference error (V7) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-22 00:51 +0000
Re: Refutation of the halting theorem on the basis of its pathological self-reference error (V7) olcott <NoOne@NoWhere.com> - 2021-05-21 20:09 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 16:44 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Jeff Barnett <jbb@notatt.com> - 2021-05-21 13:36 -0600
Re: Eliminating the pathological self-reference error of the halting theorem (V7)(Jeff does not understand) olcott <NoOne@NoWhere.com> - 2021-05-21 14:53 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-21 17:20 +0100
Re: Re: Eliminating the pathological self-reference error of the halting theorem (V6) olcott <NoOne@NoWhere.com> - 2021-05-21 11:44 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Jeff Barnett <jbb@notatt.com> - 2021-05-21 13:43 -0600
Re: Eliminating the pathological self-reference error of the halting theorem (V7)(Jeff does not understand) olcott <NoOne@NoWhere.com> - 2021-05-21 14:54 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V8)(Mike does not understand) olcott <NoOne@NoWhere.com> - 2021-05-22 15:12 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-21 02:24 -0700
Re: Eliminating the pathological self-reference error of the halting theorem (V7) olcott <NoOne@NoWhere.com> - 2021-05-21 22:07 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-22 05:20 +0000
Re: Eliminating the pathological self-reference error of the halting theorem (V7) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-22 14:56 +0000
Re: Eliminating the pathological self-reference error of the halting theorem (V7) olcott <NoOne@NoWhere.com> - 2021-05-22 10:30 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-23 14:59 +0000
Re: Eliminating the pathological self-reference error of the halting theorem (V9) olcott <NoOne@NoWhere.com> - 2021-05-23 13:52 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (diagonal lemma) olcott <NoOne@NoWhere.com> - 2021-05-25 17:02 -0500
Diagonalization in the halting theorem is very easy olcott <NoOne@NoWhere.com> - 2021-05-25 19:44 -0500
Diagonalization proof has been addressed (proxy input) olcott <NoOne@NoWhere.com> - 2021-05-27 22:43 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7)(Kaz) olcott <NoOne@NoWhere.com> - 2021-06-12 16:30 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7)(Kaz) Richard Damon <Richard@Damon-Family.org> - 2021-06-12 18:06 -0400
Re: Eliminating the pathological self-reference error of the halting theorem (V7)( Bingo! ) olcott <NoOne@NoWhere.com> - 2021-05-28 20:59 -0500
Re: Eliminating the pathological self-reference error of the halting theorem (V7)( Bingo! ) Jeff Barnett <jbb@notatt.com> - 2021-05-28 22:41 -0600
Re: Eliminating the pathological self-reference error of the halting theorem (V7) olcott <NoOne@NoWhere.com> - 2021-05-22 08:47 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 03:43 +0100
Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) olcott <NoOne@NoWhere.com> - 2021-05-19 22:38 -0500
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) Richard Damon <Richard@Damon-Family.org> - 2021-05-20 07:28 -0400
Re: Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 13:13 +0100
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous ) olcott <NoOne@NoWhere.com> - 2021-05-20 10:32 -0500
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-20 16:54 +0000
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous^2 ) olcott <NoOne@NoWhere.com> - 2021-05-20 12:45 -0500
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous^2 ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-20 23:52 +0000
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous^2 ) olcott <NoOne@NoWhere.com> - 2021-05-20 19:07 -0500
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous^2 ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 01:29 +0000
Re: Refuting the halting theorem( key halt deciding principle )( intentionally dishonest? ) olcott <NoOne@NoWhere.com> - 2021-05-20 20:43 -0500
Re: Refuting the halting theorem( key halt deciding principle )( intentionally dishonest? ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-21 03:21 +0000
Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) olcott <NoOne@NoWhere.com> - 2021-05-20 22:38 -0500
Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) olcott <NoOne@NoWhere.com> - 2021-05-20 22:25 -0500
Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-21 00:45 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 23:37 -0400
Refutation of halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) olcott <NoOne@NoWhere.com> - 2021-05-19 22:43 -0500
Re: Refutation of halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) Richard Damon <Richard@Damon-Family.org> - 2021-05-20 07:34 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:11 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 18:19 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:31 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion ) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 16:20 -0400
Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 15:45 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 17:16 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 16:48 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:21 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 23:20 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-19 06:11 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus )(3) olcott <NoOne@NoWhere.com> - 2021-05-19 09:00 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus )(3) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 11:22 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus ) olcott <NoOne@NoWhere.com> - 2021-05-19 08:33 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-19 13:51 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus ) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 10:42 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-19 23:05 +0100
Halting theorem refutation( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 17:14 -0500
Re: Halting theorem refutation( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:26 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Jeff Barnett <jbb@notatt.com> - 2021-05-18 22:37 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-18 23:46 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Jeff Barnett <jbb@notatt.com> - 2021-05-19 12:04 -0600
Halting theorem refutation ( three irrefutable truisms lead to one conclusion ) olcott <NoOne@NoWhere.com> - 2021-05-19 13:45 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion ) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 16:39 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) olcott <NoOne@NoWhere.com> - 2021-05-19 15:48 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 17:24 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) olcott <NoOne@NoWhere.com> - 2021-05-19 16:50 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-19 22:20 +0000
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 17:33 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:27 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-19 15:39 -0700
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) olcott <NoOne@NoWhere.com> - 2021-05-19 17:49 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-19 23:04 +0000
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) olcott <NoOne@NoWhere.com> - 2021-05-19 18:16 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-20 00:07 +0000
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(Kaz Truism(1) agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 19:24 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(Kaz Truism(1) agreement) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-20 06:24 +0000
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(Kaz Truism(1) agreement)( Basic logic ) olcott <NoOne@NoWhere.com> - 2021-05-20 11:12 -0500
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:28 -0400
Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(agree with yourself?) Richard Damon <Richard@Damon-Family.org> - 2021-05-19 19:24 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-19 16:18 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-19 11:33 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-19 17:41 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-19 12:57 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-19 14:20 -0700
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) André G. Isaak <agisaak@gm.invalid> - 2021-05-19 13:48 -0600
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-18 16:51 -0700
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 00:06 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) olcott <NoOne@NoWhere.com> - 2021-05-11 19:20 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-12 00:52 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 21:47 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:26 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 16:17 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 10:27 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 00:40 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 18:48 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 01:49 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 20:45 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 20:52 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-12 00:37 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:49 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 16:29 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 11:07 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 00:53 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-10 19:01 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 02:00 +0100
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:51 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:49 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 20:03 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 21:18 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 20:25 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 22:09 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-09 13:01 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 14:50 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 17:45 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-09 01:40 +0000
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 21:16 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 22:48 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-09 13:03 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-09 14:05 +0000
Re: New test program (Succeeds V2) [ dishonesty ? ] (Seems like it) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:21 -0400
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:24 -0400
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) olcott <NoOne@NoWhere.com> - 2021-05-08 19:53 -0500
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 21:12 -0400
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) olcott <NoOne@NoWhere.com> - 2021-05-08 20:18 -0500
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 21:59 -0400
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) olcott <NoOne@NoWhere.com> - 2021-05-09 12:59 -0500
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 14:35 -0400
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-09 19:06 +0000
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) olcott <NoOne@NoWhere.com> - 2021-05-09 14:27 -0500
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 16:31 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:25 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 09:13 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:43 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 15:57 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 12:06 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 13:13 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 20:18 +0000
Re: New test program (Succeeds V2) [ dishonesty ? ] (Seems like it) olcott <NoOne@NoWhere.com> - 2021-05-08 15:57 -0500
Re: New test program (Succeeds V2) [ dishonesty ? ] (Seems like it) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 21:52 +0000
Re: New test program (Succeeds V2) [ dishonesty ? ] (maybe not) olcott <NoOne@NoWhere.com> - 2021-05-08 17:03 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ] olcott <NoOne@NoWhere.com> - 2021-05-08 12:46 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ] Richard Damon <Richard@Damon-Family.org> - 2021-05-08 14:13 -0400
Re: New test program (Succeeds V2)[ Honest Dialogue? ]( maybe not ) olcott <NoOne@NoWhere.com> - 2021-05-08 15:34 -0500
Re: New test program (Succeeds V2)[ Honest Dialogue? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 20:24 +0000
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:37 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 09:41 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:31 -0400
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:22 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:26 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:54 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:00 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:08 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:13 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:18 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:25 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:35 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:45 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:59 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 21:04 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 02:09 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 22:40 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 05:54 +0000
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:29 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 08:47 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 14:33 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 09:37 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 16:05 +0000
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:46 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 08:58 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:50 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 15:40 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 11:49 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 12:57 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 14:14 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:44 -0400
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 22:21 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 23:50 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 10:56 -0400
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 03:02 +0100
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 22:22 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 23:34 -0500
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:16 +0100
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:08 -0400
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 22:07 -0400
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 03:12 +0100
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 23:33 -0500
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:15 +0100
Re: New test program (Succeeds V2)(Ben contradicts himself) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:07 +0100
Re: New test program (Succeeds V2)(Ben contradicts himself) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:36 -0400
Re: New test program (Succeeds V2)(Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-05-08 11:18 -0500
Re: New test program (Succeeds V2)(Ben contradicts himself) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 16:24 +0000
Re: New test program (Succeeds V2)(Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-05-08 11:41 -0500
Re: New test program (Succeeds V2)(Ben contradicts himself) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 12:58 -0400
Re: New test program (Succeeds V2)(Ben contradicts himself) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 12:39 -0400
Re: New test program (Succeeds V2)(Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-05-08 11:44 -0500
Re: New test program (Succeeds V2)(Ben contradicts himself) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 13:00 -0400
Re: New test program (Succeeds V2)(Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-05-08 14:11 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 20:32 -0400
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 19:51 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 21:27 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 01:49 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 20:59 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 22:09 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 02:17 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 22:36 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:16 -0400
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 03:04 +0100
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 23:33 -0500
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 06:13 +0000
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:23 +0100
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 09:19 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 20:41 -0400
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:24 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 16:02 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 12:10 -0500
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 13:28 -0400
Re: New test program (Succeeds V2) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-08 20:21 +0000
Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-08 15:41 -0500
Re: New test program (Succeeds V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-08 23:15 +0100
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-08 11:18 -0400
Re: New test program (Succeeds V2) Richard Damon <Richard@Damon-Family.org> - 2021-05-07 18:28 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 14:41 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 15:55 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 15:10 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 16:38 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 16:08 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 17:27 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 16:33 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 17:46 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 13:50 -0400
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) olcott <NoOne@NoWhere.com> - 2021-05-06 14:37 -0500
Re: Solution To The Halting Problem [ H based on UTM ]( correct answer ) Richard Damon <Richard@Damon-Family.org> - 2021-05-06 15:57 -0400
Page 3 of 50 — ← Prev page 1 2 [3] 4 5 … 50 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-04 17:01 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210504094533.656@kylheku.com> |
| In reply to | #32663 |
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 12:29 PM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 10:05 AM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/3/2021 9:29 AM, Richard Damon wrote: >>>>>> But you SHOULD be looking at it. The TRUE answer to the Halting Behavior >>>>>> of H_Hat is what it does when it is run. Any 'logic' that gets a >>>>>> different answer than this is by definition WRONG. >>>>> >>>>> Since we have the software engineering principle that embedded code that >>>>> is removed and placed in a called function is computationally equivalent >>>>> to the original compution your persistent insistence on embedding this >>>>> code seems to ignore basic software engineering principles and is >>>>> utterly invalidated on this basis. >>>> >>>> If the embedded code is imperative code that references mutating >>>> external, neither the original procedure nor the refactored one >>>> that puts the code into a subroutine, are functions. >>>> >>> >>> The whole point only focuses on whether or not embedded code is >>> computationally equivalent to placing this same code in a called >>> function. >> >> Although we can refactor an imperative subroutine so that it performs >> the same calculation under the same conditions, that doesn't help you. >> >> Though the refactored subroutine and the original are equivalent, >> they are not computations *of their procedure arguments* if they refer >> to mutating global variables. >> >> A computation is a deterministic sequence of calculation steps beginning >> with a clearly defined input. >> > > In the case where a UTM X simulates its input this whole simulation > process is a pure function of this input no matter how many nested > simulations may be involved. All of these nested simulations are merely > data being processed by UTM X. Without a doubt. Now that big UTM calculation consists of a sequence many steps, which can be divided into subsequences, right? A properly identified subsequence of steps of a machine is a computation, like steps 17 through 29. We know what state the machine was in before reaching step 17, and that's the input to the computation. We know what state it will be after step 29, and that's the output. An invocation of an imperative subroutine, like Halts(H_Hat, H_Hat), is the beginning of a subsequence of the steps carried out within the UTM. For instance it may be that one Halts invocation happens at step #233, for example. And then another Halts invocation at #539, or whatever. You're falsely asserting that two of these subsequences are the same computation, simply because they share the same procedure address and formal arguments. However, the subsequences are not actually the same. They do not share the same informal arguments, namely global state. The machine is in a different state before step 233 and before 539, and the calculation represented by Halts depends on that state. The main issue isn't that the Halts calls are not pure functions or that they are not calculations. Because, as I have explained, we can convert an inpure computation into a pure one by refactoring the external state into another formal argument. The issue is that you're claiming two or more computations are the same, which are not the same. To meet the conditions of the proof, you must have it so that all the calls to Halts(H_Hat, H_Hat), whether with that syntax or as Halts(P, P) with P having a binding to H_Hat, perform the same sub-computation, and not different computations. > >> In the proof that you are trying to refute, Halts(P, I) and other >> function calls are calculations based on only those inputs that appear >> in the function call parentheses. >> >> In the appartus you have built, this is not the case. >> >> That's one of the ways in which it doesn't meet the conditions of the >> proof. >> >>> It looks like you are disagreeing with this basic software engineering >>> principle. >> >> Everyone I've met who can be called a software engineer knows what a >> function is, and how that is different from a subroutine. >> > > Not in C, C does not have any subroutines. When I refer to a C function > as a function this is correct. You are then simply equivocating on the word function. You're taking the meaning of "function" in a proof from computer science, and re-interpreting it as the C word "function" which denotes an imperative subroutine with formal parameters. Yes, C has subroutines. They are just not called subroutines in C jargon. You cannot reinterpret proofs about functions using C jargon. > computer science textbook quotes a computable function might have no > input and produce no output. "No input" is an input: the empty string of bits, and likewise it is an output. > The only actual requirement of a computable > function is that it halts. No, that isn't the only requirement. But, look, I'm conversing with a moron who thinks "C function" is the same thing as "function". > Although it is reasonable to believe that a computable function must > produce the same output for the same input none of the computer science > textbooks mentioned this requirement. These books likely assume that you passed first or second year, and so you know the basics. Or else, it's actually in the books, but it's dressed in some language you don't understand. (Whenever you don't understand something, you just declare it to be rubbish and skip to the next paragraph.) -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-04 13:07 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <OemdnVr0AL_VEAz9nZ2dnUU7-eXNnZ2d@giganews.com> |
| In reply to | #32691 |
On 5/4/2021 12:01 PM, Kaz Kylheku wrote: > On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 12:29 PM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/3/2021 10:05 AM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/3/2021 9:29 AM, Richard Damon wrote: >>>>>>> But you SHOULD be looking at it. The TRUE answer to the Halting Behavior >>>>>>> of H_Hat is what it does when it is run. Any 'logic' that gets a >>>>>>> different answer than this is by definition WRONG. >>>>>> >>>>>> Since we have the software engineering principle that embedded code that >>>>>> is removed and placed in a called function is computationally equivalent >>>>>> to the original compution your persistent insistence on embedding this >>>>>> code seems to ignore basic software engineering principles and is >>>>>> utterly invalidated on this basis. >>>>> >>>>> If the embedded code is imperative code that references mutating >>>>> external, neither the original procedure nor the refactored one >>>>> that puts the code into a subroutine, are functions. >>>>> >>>> >>>> The whole point only focuses on whether or not embedded code is >>>> computationally equivalent to placing this same code in a called >>>> function. >>> >>> Although we can refactor an imperative subroutine so that it performs >>> the same calculation under the same conditions, that doesn't help you. >>> >>> Though the refactored subroutine and the original are equivalent, >>> they are not computations *of their procedure arguments* if they refer >>> to mutating global variables. >>> >>> A computation is a deterministic sequence of calculation steps beginning >>> with a clearly defined input. >>> >> >> In the case where a UTM X simulates its input this whole simulation >> process is a pure function of this input no matter how many nested >> simulations may be involved. All of these nested simulations are merely >> data being processed by UTM X. > > Without a doubt. Now that big UTM calculation consists of a sequence > many steps, which can be divided into subsequences, right? That is merely changes the subject to an irrelevant tangential point. The point that I just made is that any halt decider based on an adapted UTM is a pure function of its inputs. This negates all arguments that Halts(H_Hat, H_Hat) is not a pure function of its inputs. Case closed. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-04 19:17 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210504120651.126@kylheku.com> |
| In reply to | #32696 |
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/4/2021 12:01 PM, Kaz Kylheku wrote: >> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 12:29 PM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/3/2021 10:05 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/3/2021 9:29 AM, Richard Damon wrote: >>>>>>>> But you SHOULD be looking at it. The TRUE answer to the Halting Behavior >>>>>>>> of H_Hat is what it does when it is run. Any 'logic' that gets a >>>>>>>> different answer than this is by definition WRONG. >>>>>>> >>>>>>> Since we have the software engineering principle that embedded code that >>>>>>> is removed and placed in a called function is computationally equivalent >>>>>>> to the original compution your persistent insistence on embedding this >>>>>>> code seems to ignore basic software engineering principles and is >>>>>>> utterly invalidated on this basis. >>>>>> >>>>>> If the embedded code is imperative code that references mutating >>>>>> external, neither the original procedure nor the refactored one >>>>>> that puts the code into a subroutine, are functions. >>>>>> >>>>> >>>>> The whole point only focuses on whether or not embedded code is >>>>> computationally equivalent to placing this same code in a called >>>>> function. >>>> >>>> Although we can refactor an imperative subroutine so that it performs >>>> the same calculation under the same conditions, that doesn't help you. >>>> >>>> Though the refactored subroutine and the original are equivalent, >>>> they are not computations *of their procedure arguments* if they refer >>>> to mutating global variables. >>>> >>>> A computation is a deterministic sequence of calculation steps beginning >>>> with a clearly defined input. >>>> >>> >>> In the case where a UTM X simulates its input this whole simulation >>> process is a pure function of this input no matter how many nested >>> simulations may be involved. All of these nested simulations are merely >>> data being processed by UTM X. >> >> Without a doubt. Now that big UTM calculation consists of a sequence >> many steps, which can be divided into subsequences, right? > > That is merely changes the subject to an irrelevant tangential point. How is it irrelevant? You have a big calculation going on, the whole x86utm simulation. That's repeatable. It consist of numerous internal steps, some of which are procedural calls like Halts(H_Hat, H_Hat). Those kick-off sub-calculations, which are slices of the overall calculation. The proof you're trying to refute specifies the same calculation in two places, and demands that it is the same calulation. The corresponding places in your simulation fail to be the same calculation. > The point that I just made is that any halt decider based on an adapted > UTM is a pure function of its inputs. This negates all arguments that > Halts(H_Hat, H_Hat) is not a pure function of its inputs. Case closed. This is correct if by "of its inputs" you do not mean "of the two arguments H_Hat, H_Hat", but "of the entire state of the machine". When your apparatus invokews Halts(H_Hat, H_Hat), the ensuing computation is indeed a deterministic sequence based on the state of the machine at that time, and that has a correspondence to a pure function. (Every step of a TM can be regarded as a pure function, mapping from the prior state to the new state.) That doesn't make Halts a pure function /of those two arguments/. The purity issue is moot, really. The multiple calls to Halts(H_Hat, H_Hat) in your program are not the same computation, as specified by the proof. The conventional proofs use functional notations. Each /function call/ is a new Turing machine whose inputs are just the arguments, and do not include any "breadcrumbs" from a larger, enclosing machine. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-04 20:36 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <2MGdnT4Alr0Iawz9nZ2dnUU7-SfNnZ2d@giganews.com> |
| In reply to | #32703 |
On 5/4/2021 2:17 PM, Kaz Kylheku wrote: > On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >> On 5/4/2021 12:01 PM, Kaz Kylheku wrote: >>> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/3/2021 12:29 PM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/3/2021 10:05 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/3/2021 9:29 AM, Richard Damon wrote: >>>>>>>>> But you SHOULD be looking at it. The TRUE answer to the Halting Behavior >>>>>>>>> of H_Hat is what it does when it is run. Any 'logic' that gets a >>>>>>>>> different answer than this is by definition WRONG. >>>>>>>> >>>>>>>> Since we have the software engineering principle that embedded code that >>>>>>>> is removed and placed in a called function is computationally equivalent >>>>>>>> to the original compution your persistent insistence on embedding this >>>>>>>> code seems to ignore basic software engineering principles and is >>>>>>>> utterly invalidated on this basis. >>>>>>> >>>>>>> If the embedded code is imperative code that references mutating >>>>>>> external, neither the original procedure nor the refactored one >>>>>>> that puts the code into a subroutine, are functions. >>>>>>> >>>>>> >>>>>> The whole point only focuses on whether or not embedded code is >>>>>> computationally equivalent to placing this same code in a called >>>>>> function. >>>>> >>>>> Although we can refactor an imperative subroutine so that it performs >>>>> the same calculation under the same conditions, that doesn't help you. >>>>> >>>>> Though the refactored subroutine and the original are equivalent, >>>>> they are not computations *of their procedure arguments* if they refer >>>>> to mutating global variables. >>>>> >>>>> A computation is a deterministic sequence of calculation steps beginning >>>>> with a clearly defined input. >>>>> >>>> >>>> In the case where a UTM X simulates its input this whole simulation >>>> process is a pure function of this input no matter how many nested >>>> simulations may be involved. All of these nested simulations are merely >>>> data being processed by UTM X. >>> >>> Without a doubt. Now that big UTM calculation consists of a sequence >>> many steps, which can be divided into subsequences, right? >> >> That is merely changes the subject to an irrelevant tangential point. > > How is it irrelevant? You have a big calculation going on, the whole > x86utm simulation. That's repeatable. It consist of numerous internal > steps, some of which are procedural calls like Halts(H_Hat, H_Hat). > Those kick-off sub-calculations, which are slices of the overall > calculation. > > The proof you're trying to refute specifies the same calculation in two > places, and demands that it is the same calulation. The corresponding > places in your simulation fail to be the same calculation. > >> The point that I just made is that any halt decider based on an adapted >> UTM is a pure function of its inputs. This negates all arguments that >> Halts(H_Hat, H_Hat) is not a pure function of its inputs. Case closed. > > This is correct if by "of its inputs" you do not mean "of the two > arguments H_Hat, H_Hat", but "of the entire state of the machine". > > When your apparatus invokews Halts(H_Hat, H_Hat), the ensuing > computation is indeed a deterministic sequence based on the state of the > machine at that time, and that has a correspondence to a pure function. > > (Every step of a TM can be regarded as a pure function, mapping from the > prior state to the new state.) > > That doesn't make Halts a pure function /of those two arguments/. > > The purity issue is moot, really. > > The multiple calls to Halts(H_Hat, H_Hat) in your program are not the > same computation, as specified by the proof. > > The conventional proofs use functional notations. Each /function call/ > is a new Turing machine whose inputs are just the arguments, and do not > include any "breadcrumbs" from a larger, enclosing machine. > Halts() is the only invocation, everything after that is data that Halts() is processing, thus a pure function of the input to Halts(). -- 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-05-04 15:26 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <ddhkI.221380$J_5.23870@fx46.iad> |
| In reply to | #32696 |
On 5/4/21 2:07 PM, olcott wrote: > On 5/4/2021 12:01 PM, Kaz Kylheku wrote: >> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 12:29 PM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/3/2021 10:05 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/3/2021 9:29 AM, Richard Damon wrote: >>>>>>>> But you SHOULD be looking at it. The TRUE answer to the Halting >>>>>>>> Behavior >>>>>>>> of H_Hat is what it does when it is run. Any 'logic' that gets a >>>>>>>> different answer than this is by definition WRONG. >>>>>>> >>>>>>> Since we have the software engineering principle that embedded >>>>>>> code that >>>>>>> is removed and placed in a called function is computationally >>>>>>> equivalent >>>>>>> to the original compution your persistent insistence on embedding >>>>>>> this >>>>>>> code seems to ignore basic software engineering principles and is >>>>>>> utterly invalidated on this basis. >>>>>> >>>>>> If the embedded code is imperative code that references mutating >>>>>> external, neither the original procedure nor the refactored one >>>>>> that puts the code into a subroutine, are functions. >>>>>> >>>>> >>>>> The whole point only focuses on whether or not embedded code is >>>>> computationally equivalent to placing this same code in a called >>>>> function. >>>> >>>> Although we can refactor an imperative subroutine so that it performs >>>> the same calculation under the same conditions, that doesn't help you. >>>> >>>> Though the refactored subroutine and the original are equivalent, >>>> they are not computations *of their procedure arguments* if they refer >>>> to mutating global variables. >>>> >>>> A computation is a deterministic sequence of calculation steps >>>> beginning >>>> with a clearly defined input. >>>> >>> >>> In the case where a UTM X simulates its input this whole simulation >>> process is a pure function of this input no matter how many nested >>> simulations may be involved. All of these nested simulations are merely >>> data being processed by UTM X. >> >> Without a doubt. Now that big UTM calculation consists of a sequence >> many steps, which can be divided into subsequences, right? > > That is merely changes the subject to an irrelevant tangential point. > > The point that I just made is that any halt decider based on an adapted > UTM is a pure function of its inputs. This negates all arguments that > Halts(H_Hat, H_Hat) is not a pure function of its inputs. Case closed. > > But, to be an adapted UTM, it needs to be a TM, by definition, which of course means it will be a computation. Halts is NOT really a TM, so the question comes, is it REALLY a computation (and thus possibly an equivalent to a Turing Machine). If Halts IS a pure Computation of its inputs (the parameters passed to it) you need to drop the argument that it can't return its answer to H_Hat, as the only way it can't is for Halts to not be a real Computation.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-03 11:14 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <ZqUjI.68100$9F5.41596@fx43.iad> |
| In reply to | #32623 |
On 5/3/21 10:45 AM, olcott wrote:
> On 5/3/2021 9:29 AM, Richard Damon wrote:
>> On 5/3/21 9:52 AM, olcott wrote:
>>> On 5/3/2021 5:42 AM, Richard Damon wrote:
>>>> On 5/2/21 11:49 PM, olcott wrote:
>>>>> On 5/2/2021 2:58 PM, Richard Damon wrote:
>>>>>> On 5/2/21 3:30 PM, olcott wrote:
>>>>>>> On 5/2/2021 1:40 PM, Richard Damon wrote:
>>>>>>>> On 5/2/21 2:18 PM, olcott wrote:
>>>>>>>>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>>>>>>>>> On 02/05/2021 18:55, olcott wrote:
>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble
>>>>>>>>>>>>>>>>>> <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting
>>>>>>>>>>>>>>>>>>> olcott's
>>>>>>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an
>>>>>>>>>>>>>>>>>> unproven
>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt
>>>>>>>>>>>>>>>>>> that
>>>>>>>>>>>>>>>>>> occurs
>>>>>>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to
>>>>>>>>>>>>>>>> provide an
>>>>>>>>>>>>>>>> accurate review?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection
>>>>>>>>>>>>>>>> criteria is
>>>>>>>>>>>>>>>> correct:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same
>>>>>>>>>>>>>>>> machine
>>>>>>>>>>>>>>>> address
>>>>>>>>>>>>>>>> of Y()
>>>>>>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in
>>>>>>>>>>>>>>>> Y()
>>>>>>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely
>>>>>>>>>>>>>>>> recursive.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>>>>>>>>> observation
>>>>>>>>>>>>>>> that is not involved in the computation, and has no
>>>>>>>>>>>>>>> effect on
>>>>>>>>>>>>>>> it.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>>>>>>>>> access to
>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any
>>>>>>>>>>>>>>> information
>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same
>>>>>>>>>>>>>>> address
>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always
>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>> same*.
>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the
>>>>>>>>>>>>>>> second
>>>>>>>>>>>>>>> call
>>>>>>>>>>>>>>> from the third call ...
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> A function having adcess to past execution traces is an
>>>>>>>>>>>>>>> imperative
>>>>>>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be
>>>>>>>>>>>>>> wrong on
>>>>>>>>>>>>>> the
>>>>>>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When
>>>>>>>>>>>>>> you
>>>>>>>>>>>>>> attempt
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar
>>>>>>>>>>>>> structure to
>>>>>>>>>>>>> the
>>>>>>>>>>>>> X and Y arrangement above.
>>>>>>>>>>>>>
>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are
>>>>>>>>>>>>> functions,
>>>>>>>>>>>>> and not imperative procedures. They have no access to
>>>>>>>>>>>>> some
>>>>>>>>>>>>> global,
>>>>>>>>>>>>> mutating state holding execution traces; such a
>>>>>>>>>>>>> situation
>>>>>>>>>>>>> would
>>>>>>>>>>>>> violate the conditions of the proof.
>>>>>>>>>>>
>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the
>>>>>>>>>>> infinite
>>>>>>>>>>> recursion pattern of its input, stops simulating its input on
>>>>>>>>>>> this
>>>>>>>>>>> basis, and decides not halting on this input,
>>>>>>>>>>>
>>>>>>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>>>>>>
>>>>>>>>>> Your solution cannot recognize infinite recursion because your
>>>>>>>>>> solution disregards branching logic and state that branching
>>>>>>>>>> logic is
>>>>>>>>>> predicated on.
>>>>>>>>>>
>>>>>>>>> This is provably false:
>>>>>>>>>
>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>> correct:
>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>> address
>>>>>>>>> of Y()
>>>>>>>>> with the same parameters to X()
>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>> with no function call returns from X()
>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>
>>>>>>>>
>>>>>>>> No, that is incorrect, because it ignores that the X() called by
>>>>>>>> Y() is
>>>>>>>> running within the compuation of Y, so any decision it makes is
>>>>>>>> part of
>>>>>>>> the computation of Y(), thus if X() will terminate the loop, Y()
>>>>>>>> is not
>>>>>>>> infinitely recursive.
>>>>>>>>
>>>>>>>> Maybe you are inventing a new definition, but it doesn't apply to
>>>>>>>> this
>>>>>>>> problem.
>>>>>>>
>>>>>>>
>>>>>>> To simplify things a bit more...
>>>>>>>
>>>>>>>
>>>>>>> H_Hat2(u32 P)
>>>>>>> {
>>>>>>> Simulate(P, P);
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> Simulate(H_Hat2, H_Hat2);
>>>>>>> H_Hat2(H_Hat2);
>>>>>>> }
>>>>>>>
>>>>>>> Both copmutations specified on line 1 and 2 of main() specify
>>>>>>> infinite
>>>>>>> recursion.
>>>>>>>
>>>>>>> If Simulate() had enough intelligence to see this infinite recursion
>>>>>>> so that it could stop its simulation, both lines 1 and 2 of main()
>>>>>>> still specify infinite recursion that will never stop unless the
>>>>>>> simulation is halted at some point.
>>>>>>>
>>>>>>
>>>>>> No argument that H_Hat2 using Simulate in non-Halting IF Simulate
>>>>>> is a
>>>>>> real simulator. The 'proof' of infinite execution is BASED on the
>>>>>> Simulator not stopping.
>>>>>>
>>>>>> If Simulate was 'smart enough to stop Simulating' it wouldn't be a
>>>>>> proper simulator, as it didn't simulate the infinite loop, thus the
>>>>>> infinite loop proofs don't apply.
>>>>>>
>>>>>> Since we KNOW (from your stipulations) that Halts will terminate its
>>>>>> simulation of H_Hat, H_Hat is a Halting Computation.
>>>>>>
>>>>>> If Simulate is smart enough to stop simulating, then H_Hat2 is too,
>>>>>> since it does stop.
>>>>>>
>>>>>> Sounds like a straw-man to me.
>>>>>>
>>>>>> The key point is that when H_Hat uses Halts to decide on its input,
>>>>>> then
>>>>>> Halts decision that it think the input is non-halting is a
>>>>>> decision by
>>>>>> the algorithm of H_Hat to stop, and thus we don't have an infinite
>>>>>> execution in H_Hat, but a finite one.
>>>>>>
>>>>>> Using a Simulator that doesn't meet the full definition of a
>>>>>> Simulator
>>>>>> doesn't prove anything.
>>>>>>
>>>>>
>>>>> Hypothesizing that a full halt decider exists this would be true:
>>>>
>>>> So you start with a false hypothesis.
>>>>>
>>>>> When we conflate the behavior of the halt decider with the behavior of
>>>>> its input then every full halt decider based on simulating its input
>>>>> must report that every element of the infinite set of Turing machine
>>>>> descriptions halts because the ones that do not halt are forced to
>>>>> halt
>>>>> by this full halt decider when it stops simulating them.
>>>>>
>>>>> On the other hand when we do not conflate the behavior of the full
>>>>> halt
>>>>> decider with the behavior of its input then a full halt decider would
>>>>> correctly decide not halting on every input would never halt unless
>>>>> this
>>>>> full halt decider stopped simulating it.
>>>>>
>>>>
>>>> Who is conflating the behaviors? When we run the machine H_Hat as an
>>>> actual machine, and not simulating it under the decider, then it
>>>> clearly
>>>> halts. Yes, part of this behavior is from the copy of the Halt Decider
>>>> within it, but that behavior IS part of H_Hat, not of a Decider trying
>>>> to decide on it. H_Hat does Halt, so it is a Halting Computation. No
>>>> funny words like it only halted because Halts stopped it make sense.
>>>>
>>>> YOUR proof conflates the behavior of the sub-machine Halts within H_Hat
>>>> deciding on an input given to it by H_Hat, with the top level Decider
>>>> trying to decide on the machine H_Hat.
>>>>
>>>
>>> I told you this is <Not> the sceneraio that I am analyzing.
>>> I don't know how H_Hat would behave under this scenario. Once we get
>>> done with the scenario that I am analyzing we can get back to this other
>>> one.
>>
>> But you SHOULD be looking at it. The TRUE answer to the Halting Behavior
>> of H_Hat is what it does when it is run. Any 'logic' that gets a
>> different answer than this is by definition WRONG.
>
> Since we have the software engineering principle that embedded code that
> is removed and placed in a called function is computationally equivalent
> to the original compution your persistent insistence on embedding this
> code seems to ignore basic software engineering principles and is
> utterly invalidated on this basis.
>
The fact that we factor it out isn't the issue. The fact that after you
do that you no longer consider it part of the algorithm of the calling
procedure is.
H_Hat, as a machine, must be COMPLETE. That is the nature of a Turing
Machine. Thus is can have NO 'external dependencies', like Halts, the
MUST be include in the description of the computation.
Proper Software Engineering understands this.
>>
>>>
>>> Until then I will consider this a dishonest dodge attempt to avoid the
>>> point. An honest dialogue requires points of mutual agreement. Changing
>>> the subject so that we do not reach any points of mutual agreement is a
>>> dishonest dodge.
>>>
>>
>> Do you agree or not that the REAL answer to the Halt Behavior of a
>> Turing Machine is ultimately based on the Behavior of the actual machine
>> when run.
>>
>
> I disagree because agreement would require someone to wait until the
> heat death of the universe to make sure that an infinite loop really is
> an infinite loop.
But Halting Behavior of the Machine CAN prove that it is halting.
Yes, it is a fact that for some machines it may be impossible to
actually PROVE that they are non-Halting. THAT actually IS an aspect of
the theory.
>
> At soon as a finite string is proved to have the propery of infinite
> execution on the basis of axioms then and only then can this finite
> string be deemed to execute infinitely.
But if the 'prove' can be shown wrong by actually running the machine
and it shows that it does halt, then by definition the rules that were
used to decide that is would never halt must be wrong
H_Hat CAN be shown to Halt, at least as long as Halts can be shown to
decide on H_Hat and answer non-Halting.
If Halts can not be shown to answer in finite time, then it isn't a
proper Halting Decider.
If a different version of Halts returns a different answer, then the
version of H_Hat built on it will show that it is also wrong for THAT
alternate H_Hat. So the nature of the proof is that either the Decider
is shown to not be a Decider by it not properly answering to H^, or the
answer it does give is Wrong.
This is an inevitable result of how H^ is built on the Decider it is
designed to foil. Since we can build a H^ for ANY H that might be
thought of, there can not be a H that gets things right for all possible
inputs, since it can not get the H^ based on itself right.
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-05-03 22:33 +0100 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <T_ZjI.1074804$8KY1.928612@fx12.ams4> |
| In reply to | #32582 |
On 02/05/2021 19:18, olcott wrote: > On 5/2/2021 1:14 PM, Mr Flibble wrote: >> On 02/05/2021 18:55, olcott wrote: >>> On 5/2/2021 12:50 PM, olcott wrote: >>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>> Usenet posts? >>>>>>>>>> >>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>> if everyone stops responding. >>>>>>>>>> >>>>>>>>> >>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>> >>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>> accurate review? >>>>>>>> >>>>>>>> It is a fact that this infinite recursion detection criteria is correct: >>>>>>>> >>>>>>>> If the execution trace of function Y() shows: >>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>> of Y() >>>>>>>> with the same parameters to X() >>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>> with no function call returns from X() >>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>> >>>>>>> This is only "right" from the perspective of an objective observation >>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>> >>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>> only its parameters, and its parameters do not carry any information >>>>>>> indicating to X that it has been called twice from the same address >>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>> from the third call ... >>>>>>> >>>>>>> A function having adcess to past execution traces is an imperative >>>>>>> procedure, which is completely invalid. >>>>>> >>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>> basis that you really believe that I am wrong. >>>>>> >>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>> >>>> >>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>> >>>> >>>> >>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>> X and Y arrangement above. >>>>> >>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>> and not imperative procedures. They have no access to some global, >>>>> mutating state holding execution traces; such a situation would >>>>> violate the conditions of the proof. >>> >>> So you are saying that an adapted UTM that recognizes the infinite recursion >>> pattern of its input, stops simulating its input on this basis, and decides >>> not halting on this input, >>> >>> IS SIMPLY NOT ALLOWED ? >> >> Your solution cannot recognize infinite recursion because your solution >> disregards branching logic and state that branching logic is predicated on. >> > This is provably false: > > It is a fact that this infinite recursion detection criteria is correct: > If the execution trace of function Y() shows: > function X() is called twice in sequence from the same machine address of Y() > with the same parameters to X() > with no conditional branch or indexed jump instructions in Y() > with no function call returns from X() > then the function call from Y() to X() is infinitely recursive. > > > If the execution trace of H_Hat() by function Halts() shows: > (1) Function Halts() is called twice in sequence from the same machine address > of H_Hat(). > (2) With the same parameters to Halts(). > (3) With no conditional branch or indexed jump instructions in H_Hat(). > (4) With no function call returns from Halts(). > then the function call from H_Hat() to Halts() is infinitely recursive. Provably false? You just stated twice that your "solution" only works if there are no conditional branch instructions as, like I asserted, you are disregarding a cornerstone of algorithms: branching logic and the state that logic is predicated on. You've go nothing, mate. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-02 19:57 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210502113712.320@kylheku.com> |
| In reply to | #32580 |
On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 12:50 PM, olcott wrote: >> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>> Usenet posts? >>>>>>>> >>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>> if everyone stops responding. >>>>>>>> >>>>>>> >>>>>>> We can ask him to stop. We can't prove that he will. >>>>>> >>>>>> The bigger question is when are my reviewers going to provide an >>>>>> accurate review? >>>>>> >>>>>> It is a fact that this infinite recursion detection criteria is >>>>>> correct: >>>>>> >>>>>> If the execution trace of function Y() shows: >>>>>> function X() is called twice in sequence from the same machine address >>>>>> of Y() >>>>>> with the same parameters to X() >>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>> with no function call returns from X() >>>>>> then the function call from Y() to X() is infinitely recursive. >>>>> >>>>> This is only "right" from the perspective of an objective observation >>>>> that is not involved in the computation, and has no effect on it. >>>>> >>>>> The function X() cannot itself make this observation. X has access to >>>>> only its parameters, and its parameters do not carry any information >>>>> indicating to X that it has been called twice from the same address >>>>> or any such thing. How can they; the parameters are *always the same*. >>>>> Therefore they cannot distinguish the first call from the second call >>>>> from the third call ... >>>>> >>>>> A function having adcess to past execution traces is an imperative >>>>> procedure, which is completely invalid. >>>> >>>> This is ridiculous, it is just like saying that I must be wrong on the >>>> basis that you really believe that I am wrong. >>>> >>>> You have to concretely prove these dogmatic statements. When you attempt >>> >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >> >> >> >>> 1. You're trying to refute a proof which has a similar structure to the >>> X and Y arrangement above. >>> >>> 2. In that proof, the entities corresponding to X and Y are functions, >>> and not imperative procedures. They have no access to some global, >>> mutating state holding execution traces; such a situation would >>> violate the conditions of the proof. > > So you are saying that an adapted UTM that recognizes the infinite > recursion pattern of its input, stops simulating its input on this > basis, and decides not halting on this input, > > IS SIMPLY NOT ALLOWED ? To clarify, that is false. Rather: 1) There is a proof that this recognizing machine cannot be the function identified as X above. This is the proof you're trying to dislodge. 2) The only way the machine can possibly be X is if it conforms to the requirements imposed on X: that it's a pure function of the two arguments. 3) You're obviously not conforming to the requiremnts in your implementation. You are endowing X with "super powers" beyond what a function is capable of. Without any information in its arguments, which are always the same, X can tell that it has been called twice. The idea is that a refutation of a proof should meet all of its conditions and demonstrate the conclusion to be false. E.g. if a proof claims that no element in some set has a certain property, you must show the existence of such an element, while holding all of the assumptions and requirements of the proof to be true. For instance, you cannot change the kind of element that the set is of, or the nature of the property in consideration. You can't rewrite the proof to suit your refutation. This idea no way carries any personal bias or dogma coming from me; it is completly uncontroversial. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 17:29 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <wPadnU0dN6MruhL9nZ2dnUU7-VfNnZ2d@giganews.com> |
| In reply to | #32590 |
On 5/2/2021 2:57 PM, Kaz Kylheku wrote: > On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 12:50 PM, olcott wrote: >>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>> Usenet posts? >>>>>>>>> >>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>> if everyone stops responding. >>>>>>>>> >>>>>>>> >>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>> >>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>> accurate review? >>>>>>> >>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>> correct: >>>>>>> >>>>>>> If the execution trace of function Y() shows: >>>>>>> function X() is called twice in sequence from the same machine address >>>>>>> of Y() >>>>>>> with the same parameters to X() >>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>> with no function call returns from X() >>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>> >>>>>> This is only "right" from the perspective of an objective observation >>>>>> that is not involved in the computation, and has no effect on it. >>>>>> >>>>>> The function X() cannot itself make this observation. X has access to >>>>>> only its parameters, and its parameters do not carry any information >>>>>> indicating to X that it has been called twice from the same address >>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>> Therefore they cannot distinguish the first call from the second call >>>>>> from the third call ... >>>>>> >>>>>> A function having adcess to past execution traces is an imperative >>>>>> procedure, which is completely invalid. >>>>> >>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>> basis that you really believe that I am wrong. >>>>> >>>>> You have to concretely prove these dogmatic statements. When you attempt >>>> >>> >>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>> >>> >>> >>>> 1. You're trying to refute a proof which has a similar structure to the >>>> X and Y arrangement above. >>>> >>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>> and not imperative procedures. They have no access to some global, >>>> mutating state holding execution traces; such a situation would >>>> violate the conditions of the proof. >> >> So you are saying that an adapted UTM that recognizes the infinite >> recursion pattern of its input, stops simulating its input on this >> basis, and decides not halting on this input, >> >> IS SIMPLY NOT ALLOWED ? > > To clarify, that is false. Rather: > > 1) There is a proof that this recognizing machine cannot be the function > identified as X above. This is the proof you're trying to dislodge. You stubbornly refuse to acknowledge that a UTM that simulates a machine that simulates another machine that simulates yet another machine is all simply data processed by the UTM, thus (as long as it halts) a single computation. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 02:12 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210502182707.456@kylheku.com> |
| In reply to | #32595 |
On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 12:50 PM, olcott wrote: >>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>> Usenet posts? >>>>>>>>>> >>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>> if everyone stops responding. >>>>>>>>>> >>>>>>>>> >>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>> >>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>> accurate review? >>>>>>>> >>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>> correct: >>>>>>>> >>>>>>>> If the execution trace of function Y() shows: >>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>> of Y() >>>>>>>> with the same parameters to X() >>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>> with no function call returns from X() >>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>> >>>>>>> This is only "right" from the perspective of an objective observation >>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>> >>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>> only its parameters, and its parameters do not carry any information >>>>>>> indicating to X that it has been called twice from the same address >>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>> from the third call ... >>>>>>> >>>>>>> A function having adcess to past execution traces is an imperative >>>>>>> procedure, which is completely invalid. >>>>>> >>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>> basis that you really believe that I am wrong. >>>>>> >>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>> >>>> >>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>> >>>> >>>> >>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>> X and Y arrangement above. >>>>> >>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>> and not imperative procedures. They have no access to some global, >>>>> mutating state holding execution traces; such a situation would >>>>> violate the conditions of the proof. >>> >>> So you are saying that an adapted UTM that recognizes the infinite >>> recursion pattern of its input, stops simulating its input on this >>> basis, and decides not halting on this input, >>> >>> IS SIMPLY NOT ALLOWED ? >> >> To clarify, that is false. Rather: >> >> 1) There is a proof that this recognizing machine cannot be the function >> identified as X above. This is the proof you're trying to dislodge. > > You stubbornly refuse to acknowledge that a UTM that simulates a machine > that simulates another machine that simulates yet another machine is all > simply data processed by the UTM, thus (as long as it halts) a single > computation. The issue is not that you do not have a computation. You probably do. You evidently have repeatable test cases; you can execute your rig repeatedly and obtain the same traces. The issue is that is simply that the procedure which corresponds to X is not a function. The application of the imperative procedure X to its arguments is not a TM, as required. Given the call X(p, i), we cannot convert X, p and i into the initial contents of a Turing tape, such that the conditions of your halting criteria are satisfied. If we correctly treat X(p, i) as a Turing machine, whereby the tape's contents depend only on X, p and i, then X cannot tell that it has been called twice. The definition of X, and the two arguments, are always the same (this is one of your conditions). Therefore, the tape is always the same, and the calculation which X performs is always the same. There is no room for it to be different based on the condition "X is called twice". If X(p, i) is a Turing machine, it cannot perform one computation when it's executed the first time and then a different computation when it's executed a second time. It may well be that the two (or more) calls to X(p, i) are Turing machines. You've arranged for them to be different Turing machines though. You've done that by sneaking in an additional input in the form of global state. That has to be included on the tape. The proof requires that the thing corresponding to X(p, i) is one Turing machine, not two or three different Turing machines distinguished by additional hidden input. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 21:31 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <pKOdnfWw3f3D_RL9nZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #32606 |
On 5/2/2021 9:12 PM, Kaz Kylheku wrote: > On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>> Usenet posts? >>>>>>>>>>> >>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>> if everyone stops responding. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>> >>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>> accurate review? >>>>>>>>> >>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>> correct: >>>>>>>>> >>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>> of Y() >>>>>>>>> with the same parameters to X() >>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>> with no function call returns from X() >>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>> >>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>> >>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>> from the third call ... >>>>>>>> >>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>> procedure, which is completely invalid. >>>>>>> >>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>> basis that you really believe that I am wrong. >>>>>>> >>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>> >>>>> >>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>> >>>>> >>>>> >>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>> X and Y arrangement above. >>>>>> >>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>> and not imperative procedures. They have no access to some global, >>>>>> mutating state holding execution traces; such a situation would >>>>>> violate the conditions of the proof. >>>> >>>> So you are saying that an adapted UTM that recognizes the infinite >>>> recursion pattern of its input, stops simulating its input on this >>>> basis, and decides not halting on this input, >>>> >>>> IS SIMPLY NOT ALLOWED ? >>> >>> To clarify, that is false. Rather: >>> >>> 1) There is a proof that this recognizing machine cannot be the function >>> identified as X above. This is the proof you're trying to dislodge. >> >> You stubbornly refuse to acknowledge that a UTM that simulates a machine >> that simulates another machine that simulates yet another machine is all >> simply data processed by the UTM, thus (as long as it halts) a single >> computation. > > The issue is not that you do not have a computation. You probably do. > You evidently have repeatable test cases; you can execute your rig > repeatedly and obtain the same traces. > > The issue is that is simply that the procedure which corresponds to X > is not a function. The application of the imperative procedure X to its > arguments is not a TM, as required. > When a UTM M that simulates a TM X that simulates another TM Y that simulates yet another TM Z and the UTM M eventually transations to a final state it is doing so as a pure function of its input X. > Given the call X(p, i), we cannot convert X, p and i into the initial > contents of a Turing tape, such that the conditions of your halting > criteria are satisfied. > > If we correctly treat X(p, i) as a Turing machine, whereby the tape's > contents depend only on X, p and i, then X cannot tell that it has been > called twice. The definition of X, and the two arguments, are always the > same (this is one of your conditions). Therefore, the tape is always > the same, and the calculation which X performs is always the same. > > There is no room for it to be different based on the condition "X is > called twice". If X(p, i) is a Turing machine, it cannot perform one > computation when it's executed the first time and then a different > computation when it's executed a second time. > > It may well be that the two (or more) calls to X(p, i) are Turing > machines. You've arranged for them to be different Turing machines > though. You've done that by sneaking in an additional input in the form > of global state. That has to be included on the tape. > > The proof requires that the thing corresponding to X(p, i) is one Turing > machine, not two or three different Turing machines distinguished by > additional hidden input. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 02:45 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210502194212.177@kylheku.com> |
| In reply to | #32607 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>> >>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>> >>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>> accurate review? >>>>>>>>>> >>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>> correct: >>>>>>>>>> >>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>> of Y() >>>>>>>>>> with the same parameters to X() >>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>> with no function call returns from X() >>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>> >>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>> >>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>> from the third call ... >>>>>>>>> >>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>> procedure, which is completely invalid. >>>>>>>> >>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>> basis that you really believe that I am wrong. >>>>>>>> >>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>> >>>>>> >>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>> >>>>>> >>>>>> >>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>> X and Y arrangement above. >>>>>>> >>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>> and not imperative procedures. They have no access to some global, >>>>>>> mutating state holding execution traces; such a situation would >>>>>>> violate the conditions of the proof. >>>>> >>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>> recursion pattern of its input, stops simulating its input on this >>>>> basis, and decides not halting on this input, >>>>> >>>>> IS SIMPLY NOT ALLOWED ? >>>> >>>> To clarify, that is false. Rather: >>>> >>>> 1) There is a proof that this recognizing machine cannot be the function >>>> identified as X above. This is the proof you're trying to dislodge. >>> >>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>> that simulates another machine that simulates yet another machine is all >>> simply data processed by the UTM, thus (as long as it halts) a single >>> computation. >> >> The issue is not that you do not have a computation. You probably do. >> You evidently have repeatable test cases; you can execute your rig >> repeatedly and obtain the same traces. >> >> The issue is that is simply that the procedure which corresponds to X >> is not a function. The application of the imperative procedure X to its >> arguments is not a TM, as required. >> > > When a UTM M that simulates a TM X that simulates another TM Y that > simulates yet another TM Z and the UTM M eventually transations to a > final state it is doing so as a pure function of its input X. Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. The point is that the invocation of X is not the same TM every time, as required, even though your whole show (inside of which the calls to X are playing out) may be a TM. Please re-read: Given the call X(p, i), we cannot convert X, p and i into the initial contents of a Turing tape, such that the conditions of your halting criteria are satisfied. If we correctly treat X(p, i) as a Turing machine, whereby the tape's contents depend only on X, p and i, then X cannot tell that it has been called twice. The definition of X, and the two arguments, are always the same (this is one of your conditions). Therefore, the tape is always the same, and the calculation which X performs is always the same. There is no room for it to be different based on the condition "X is called twice". If X(p, i) is a Turing machine, it cannot perform one computation when it's executed the first time and then a different computation when it's executed a second time. It may well be that the two (or more) calls to X(p, i) are Turing machines. You've arranged for them to be different Turing machines though. You've done that by sneaking in an additional input in the form of global state. That has to be included on the tape. The proof requires that the thing corresponding to X(p, i) is one Turing machine, not two or three different Turing machines distinguished by additional hidden input. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 22:54 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <AuGdncqEcJdn7hL9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #32608 |
On 5/2/2021 9:45 PM, Kaz Kylheku wrote: > On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>> >>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>> >>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>> accurate review? >>>>>>>>>>> >>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>> correct: >>>>>>>>>>> >>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>> of Y() >>>>>>>>>>> with the same parameters to X() >>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>> with no function call returns from X() >>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>> >>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>> >>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>> from the third call ... >>>>>>>>>> >>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>> procedure, which is completely invalid. >>>>>>>>> >>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>> >>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>> >>>>>>> >>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>> >>>>>>> >>>>>>> >>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>> X and Y arrangement above. >>>>>>>> >>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>> violate the conditions of the proof. >>>>>> >>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>> recursion pattern of its input, stops simulating its input on this >>>>>> basis, and decides not halting on this input, >>>>>> >>>>>> IS SIMPLY NOT ALLOWED ? >>>>> >>>>> To clarify, that is false. Rather: >>>>> >>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>> identified as X above. This is the proof you're trying to dislodge. >>>> >>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>> that simulates another machine that simulates yet another machine is all >>>> simply data processed by the UTM, thus (as long as it halts) a single >>>> computation. >>> >>> The issue is not that you do not have a computation. You probably do. >>> You evidently have repeatable test cases; you can execute your rig >>> repeatedly and obtain the same traces. >>> >>> The issue is that is simply that the procedure which corresponds to X >>> is not a function. The application of the imperative procedure X to its >>> arguments is not a TM, as required. >>> >> >> When a UTM M that simulates a TM X that simulates another TM Y that >> simulates yet another TM Z and the UTM M eventually transations to a >> final state it is doing so as a pure function of its input X. > > Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. > The point is that the invocation of X is not the same TM every time, The point is that the subsequent "invocations" are not invocations at all, they are data being processed by the only actual invocation that exists. > as required, even though your whole show (inside of which the calls to X > are playing out) may be a TM. > > Please re-read: > > Given the call X(p, i), we cannot convert X, p and i into the initial > contents of a Turing tape, such that the conditions of your halting > criteria are satisfied. > > If we correctly treat X(p, i) as a Turing machine, whereby the tape's > contents depend only on X, p and i, then X cannot tell that it has been > called twice. The definition of X, and the two arguments, are always the > same (this is one of your conditions). Therefore, the tape is always > the same, and the calculation which X performs is always the same. > > There is no room for it to be different based on the condition "X is > called twice". If X(p, i) is a Turing machine, it cannot perform one > computation when it's executed the first time and then a different > computation when it's executed a second time. > > It may well be that the two (or more) calls to X(p, i) are Turing > machines. You've arranged for them to be different Turing machines > though. You've done that by sneaking in an additional input in the form > of global state. That has to be included on the tape. > > The proof requires that the thing corresponding to X(p, i) is one Turing > machine, not two or three different Turing machines distinguished by > additional hidden input. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 04:12 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210502210440.894@kylheku.com> |
| In reply to | #32610 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote:
> On 5/2/2021 9:45 PM, Kaz Kylheku wrote:
>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote:
>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote:
>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote:
>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote:
>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's
>>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven
>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs
>>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>>
>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an
>>>>>>>>>>>> accurate review?
>>>>>>>>>>>>
>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>>>> correct:
>>>>>>>>>>>>
>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>> function X() is called twice in sequence from the same machine address
>>>>>>>>>>>> of Y()
>>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>>>
>>>>>>>>>>> This is only "right" from the perspective of an objective observation
>>>>>>>>>>> that is not involved in the computation, and has no effect on it.
>>>>>>>>>>>
>>>>>>>>>>> The function X() cannot itself make this observation. X has access to
>>>>>>>>>>> only its parameters, and its parameters do not carry any information
>>>>>>>>>>> indicating to X that it has been called twice from the same address
>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*.
>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call
>>>>>>>>>>> from the third call ...
>>>>>>>>>>>
>>>>>>>>>>> A function having adcess to past execution traces is an imperative
>>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>>
>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the
>>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>>
>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt
>>>>>>>>>
>>>>>>>>
>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the
>>>>>>>>> X and Y arrangement above.
>>>>>>>>>
>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions,
>>>>>>>>> and not imperative procedures. They have no access to some global,
>>>>>>>>> mutating state holding execution traces; such a situation would
>>>>>>>>> violate the conditions of the proof.
>>>>>>>
>>>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>>>> recursion pattern of its input, stops simulating its input on this
>>>>>>> basis, and decides not halting on this input,
>>>>>>>
>>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>>
>>>>>> To clarify, that is false. Rather:
>>>>>>
>>>>>> 1) There is a proof that this recognizing machine cannot be the function
>>>>>> identified as X above. This is the proof you're trying to dislodge.
>>>>>
>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine
>>>>> that simulates another machine that simulates yet another machine is all
>>>>> simply data processed by the UTM, thus (as long as it halts) a single
>>>>> computation.
>>>>
>>>> The issue is not that you do not have a computation. You probably do.
>>>> You evidently have repeatable test cases; you can execute your rig
>>>> repeatedly and obtain the same traces.
>>>>
>>>> The issue is that is simply that the procedure which corresponds to X
>>>> is not a function. The application of the imperative procedure X to its
>>>> arguments is not a TM, as required.
>>>>
>>>
>>> When a UTM M that simulates a TM X that simulates another TM Y that
>>> simulates yet another TM Z and the UTM M eventually transations to a
>>> final state it is doing so as a pure function of its input X.
>>
>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point.
>> The point is that the invocation of X is not the same TM every time,
>
> The point is that the subsequent "invocations" are not invocations at
> all, they are data being processed by the only actual invocation that
> exists.
Right, see? So we are nothing but agreeing. And so, here we go. In the
"conventional proofs" of halting the corresponding entity is a function
of two arguments (and only those arguments), which is subject to actual
invocations. That's a key part of these proofs.
In your framework, you've changed entities in the proof into some other
kind of thing.
In my opinion, this is a flaw in your work due to the general principle
that to refute the proofs, we have to work with their exact conditions
and objects.
Refutation of a proof cannot go like this:
Alan: I have a written a detailed proof that chickens cannot fly.
The main gist is that this due to their bodies being too heavy
for their tiny, weak wings.
Peter: Nonsense, bumblebees fly just fine, and they also have tiny
wings, and are chubby little buggers.
Alan: Wait, What? My proof is strictly about chickens; it speaks
nothing to any situation with bumblebees.
Peter: If so, your proof is wrong; it should be about bumblebees.
Then you would see that chubby things with tiny wings can fly.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 23:39 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <x_idnUAhponJ4xL9nZ2dnUU7-cfNnZ2d@giganews.com> |
| In reply to | #32611 |
On 5/2/2021 11:12 PM, Kaz Kylheku wrote: > On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>> >>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>> accurate review? >>>>>>>>>>>>> >>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>> correct: >>>>>>>>>>>>> >>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>> of Y() >>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>> >>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>> >>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>> from the third call ... >>>>>>>>>>>> >>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>> >>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>> >>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>> >>>>>>>>> >>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>> X and Y arrangement above. >>>>>>>>>> >>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>> violate the conditions of the proof. >>>>>>>> >>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>> basis, and decides not halting on this input, >>>>>>>> >>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>> >>>>>>> To clarify, that is false. Rather: >>>>>>> >>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>> >>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>> that simulates another machine that simulates yet another machine is all >>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>> computation. >>>>> >>>>> The issue is not that you do not have a computation. You probably do. >>>>> You evidently have repeatable test cases; you can execute your rig >>>>> repeatedly and obtain the same traces. >>>>> >>>>> The issue is that is simply that the procedure which corresponds to X >>>>> is not a function. The application of the imperative procedure X to its >>>>> arguments is not a TM, as required. >>>>> >>>> >>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>> simulates yet another TM Z and the UTM M eventually transations to a >>>> final state it is doing so as a pure function of its input X. >>> >>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>> The point is that the invocation of X is not the same TM every time, >> >> The point is that the subsequent "invocations" are not invocations at >> all, they are data being processed by the only actual invocation that >> exists. > > Right, see? So we are nothing but agreeing. And so, here we go. In the > "conventional proofs" of halting the corresponding entity is a function > of two arguments (and only those arguments), which is subject to actual > invocations. That's a key part of these proofs. > These proofs do not forbid simulating the input, and in fact do require that the inputs are not actual Turing machines they must be finite strings that describe Turing machines. > In your framework, you've changed entities in the proof into some other > kind of thing. > Not at all. I simply chose dynamic analysis over static analysis. Dynamic analysis requires an execution trace. > In my opinion, this is a flaw in your work due to the general principle > that to refute the proofs, we have to work with their exact conditions > and objects. > That is why I moved to C and x86, every detail can be specified no details can simply fail to be considered or simply be imagined away. If H_Hat() really is calling Halts() in the [ Infinite Recursion ] behavior pattern then the issue of which value do we return to H_Hat becomes moot. True is the wrong answer, false is the wrong answer the only correct answer is to terminate the simulation of H_Hat on the basis of the [ Infinite Recursion ] behavior pattern. > Refutation of a proof cannot go like this: > > Alan: I have a written a detailed proof that chickens cannot fly. > The main gist is that this due to their bodies being too heavy > for their tiny, weak wings. > > Peter: Nonsense, bumblebees fly just fine, and they also have tiny > wings, and are chubby little buggers. > > Alan: Wait, What? My proof is strictly about chickens; it speaks > nothing to any situation with bumblebees. > > Peter: If so, your proof is wrong; it should be about bumblebees. > Then you would see that chubby things with tiny wings can fly. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 14:27 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210503071022.521@kylheku.com> |
| In reply to | #32612 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>> >>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>> >>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>> correct: >>>>>>>>>>>>>> >>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>> >>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>> >>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>> >>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>> >>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>> >>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>> >>>>>>>>>> >>>>>>>>>> >>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>> >>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>> violate the conditions of the proof. >>>>>>>>> >>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>> basis, and decides not halting on this input, >>>>>>>>> >>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>> >>>>>>>> To clarify, that is false. Rather: >>>>>>>> >>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>> >>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>> computation. >>>>>> >>>>>> The issue is not that you do not have a computation. You probably do. >>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>> repeatedly and obtain the same traces. >>>>>> >>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>> is not a function. The application of the imperative procedure X to its >>>>>> arguments is not a TM, as required. >>>>>> >>>>> >>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>> final state it is doing so as a pure function of its input X. >>>> >>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>> The point is that the invocation of X is not the same TM every time, >>> >>> The point is that the subsequent "invocations" are not invocations at >>> all, they are data being processed by the only actual invocation that >>> exists. >> >> Right, see? So we are nothing but agreeing. And so, here we go. In the >> "conventional proofs" of halting the corresponding entity is a function >> of two arguments (and only those arguments), which is subject to actual >> invocations. That's a key part of these proofs. >> > > These proofs do not forbid simulating the input, and in fact do require > that the inputs are not actual Turing machines they must be finite > strings that describe Turing machines. Your belief here is uninformed and false. >> In your framework, you've changed entities in the proof into some other >> kind of thing. >> > > Not at all. I simply chose dynamic analysis over static analysis. > Dynamic analysis requires an execution trace. No, you not only did that, but you changed functions into non-functions. Entities which are supposed to be functions in the proof are edoing dynamic analysis, using state which is external to them and not appearing as input. This is a damning flaw in your work. Any analysis, whether static or dynamic, has to be done such that the conditions of the proof are held. This is a gaping, fatal flaw in your work. Yet, you claim nobody has found one. >> In my opinion, this is a flaw in your work due to the general principle >> that to refute the proofs, we have to work with their exact conditions >> and objects. >> > > That is why I moved to C and x86, every detail can be specified no > details can simply fail to be considered or simply be imagined away. > If H_Hat() really is calling Halts() in the [ Infinite Recursion ] > behavior pattern then the issue of which value do we return to H_Hat > becomes moot. No, the return value does not become moot in general. There are test cases in which Halts returns. You've singled out a test case in which Halts does not return. The return value is moot only becuase, as far as the proof is concerned, failing to return means that Halts has fails to decide. Halts failing to decide supports the proof's conclusion: the proof states that this is one of the ways that Halts is wrong. > True is the wrong answer, false is the wrong answer the Since H_Hat(H_Hat) doesn't terminate in that inifinitely recursive case, the correct answer is false. To be correct, Halt must stop running and return a value. It must do this while all the other proof conditiosn are met, like that Halts and H_Hat are pure functions, and consequently their invocations on arguments are Turing machines. To me, it is obvious that this is impossible; I'm convinced by the proof. Rational people ought to be convinced by correct, air-tight proofs. > only correct answer is to terminate the simulation of H_Hat on the basis The proof demands answers to be Boolean: true or false, and that they be returned by Halts. So this is another way in which you are misreading the proof conditions.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 09:36 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <JJ-dnWxXEPjZlw39nZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #32617 |
On 5/3/2021 9:27 AM, Kaz Kylheku wrote:
> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote:
>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote:
>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote:
>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote:
>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote:
>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote:
>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote:
>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's
>>>>>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven
>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs
>>>>>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an
>>>>>>>>>>>>>>> accurate review?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>>>>>>> correct:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address
>>>>>>>>>>>>>>> of Y()
>>>>>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation
>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to
>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information
>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address
>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*.
>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call
>>>>>>>>>>>>>> from the third call ...
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative
>>>>>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>>>>>
>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the
>>>>>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the
>>>>>>>>>>>> X and Y arrangement above.
>>>>>>>>>>>>
>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions,
>>>>>>>>>>>> and not imperative procedures. They have no access to some global,
>>>>>>>>>>>> mutating state holding execution traces; such a situation would
>>>>>>>>>>>> violate the conditions of the proof.
>>>>>>>>>>
>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>>>>>>> recursion pattern of its input, stops simulating its input on this
>>>>>>>>>> basis, and decides not halting on this input,
>>>>>>>>>>
>>>>>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>>>>>
>>>>>>>>> To clarify, that is false. Rather:
>>>>>>>>>
>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function
>>>>>>>>> identified as X above. This is the proof you're trying to dislodge.
>>>>>>>>
>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine
>>>>>>>> that simulates another machine that simulates yet another machine is all
>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single
>>>>>>>> computation.
>>>>>>>
>>>>>>> The issue is not that you do not have a computation. You probably do.
>>>>>>> You evidently have repeatable test cases; you can execute your rig
>>>>>>> repeatedly and obtain the same traces.
>>>>>>>
>>>>>>> The issue is that is simply that the procedure which corresponds to X
>>>>>>> is not a function. The application of the imperative procedure X to its
>>>>>>> arguments is not a TM, as required.
>>>>>>>
>>>>>>
>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that
>>>>>> simulates yet another TM Z and the UTM M eventually transations to a
>>>>>> final state it is doing so as a pure function of its input X.
>>>>>
>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point.
>>>>> The point is that the invocation of X is not the same TM every time,
>>>>
>>>> The point is that the subsequent "invocations" are not invocations at
>>>> all, they are data being processed by the only actual invocation that
>>>> exists.
>>>
>>> Right, see? So we are nothing but agreeing. And so, here we go. In the
>>> "conventional proofs" of halting the corresponding entity is a function
>>> of two arguments (and only those arguments), which is subject to actual
>>> invocations. That's a key part of these proofs.
>>>
>>
>> These proofs do not forbid simulating the input, and in fact do require
>> that the inputs are not actual Turing machines they must be finite
>> strings that describe Turing machines.
>
> Your belief here is uninformed and false.
I stop reading at your first big mistake.
I verified this with {Linz, Sipser and Kozen}
>
>>> In your framework, you've changed entities in the proof into some other
>>> kind of thing.
>>>
>>
>> Not at all. I simply chose dynamic analysis over static analysis.
>> Dynamic analysis requires an execution trace.
>
> No, you not only did that, but you changed functions into non-functions.
>
> Entities which are supposed to be functions in the proof are edoing
> dynamic analysis, using state which is external to them and not
> appearing as input.
>
> This is a damning flaw in your work.
>
> Any analysis, whether static or dynamic, has to be done such that
> the conditions of the proof are held.
>
> This is a gaping, fatal flaw in your work.
>
> Yet, you claim nobody has found one.
>
>>> In my opinion, this is a flaw in your work due to the general principle
>>> that to refute the proofs, we have to work with their exact conditions
>>> and objects.
>>>
>>
>> That is why I moved to C and x86, every detail can be specified no
>> details can simply fail to be considered or simply be imagined away.
>> If H_Hat() really is calling Halts() in the [ Infinite Recursion ]
>> behavior pattern then the issue of which value do we return to H_Hat
>> becomes moot.
>
> No, the return value does not become moot in general. There are test
> cases in which Halts returns.
>
> You've singled out a test case in which Halts does not return. The
> return value is moot only becuase, as far as the proof is concerned,
> failing to return means that Halts has fails to decide.
>
> Halts failing to decide supports the proof's conclusion: the proof
> states that this is one of the ways that Halts is wrong.
>
>> True is the wrong answer, false is the wrong answer the
>
> Since H_Hat(H_Hat) doesn't terminate in that inifinitely recursive case,
> the correct answer is false. To be correct, Halt must stop running and
> return a value. It must do this while all the other proof conditiosn are
> met, like that Halts and H_Hat are pure functions, and consequently
> their invocations on arguments are Turing machines.
>
> To me, it is obvious that this is impossible; I'm convinced by the
> proof.
>
> Rational people ought to be convinced by correct, air-tight proofs.
>
>> only correct answer is to terminate the simulation of H_Hat on the basis
>
> The proof demands answers to be Boolean: true or false, and that they be
> returned by Halts. So this is another way in which you are misreading
> the proof conditions.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 14:42 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210503073714.595@kylheku.com> |
| In reply to | #32620 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>> >>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>> >>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>> >>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>> >>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>> >>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>> >>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>> >>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>> >>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>> computation. >>>>>>>> >>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>> repeatedly and obtain the same traces. >>>>>>>> >>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>> arguments is not a TM, as required. >>>>>>>> >>>>>>> >>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>> final state it is doing so as a pure function of its input X. >>>>>> >>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>> The point is that the invocation of X is not the same TM every time, >>>>> >>>>> The point is that the subsequent "invocations" are not invocations at >>>>> all, they are data being processed by the only actual invocation that >>>>> exists. >>>> >>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>> "conventional proofs" of halting the corresponding entity is a function >>>> of two arguments (and only those arguments), which is subject to actual >>>> invocations. That's a key part of these proofs. >>>> >>> >>> These proofs do not forbid simulating the input, and in fact do require >>> that the inputs are not actual Turing machines they must be finite >>> strings that describe Turing machines. >> >> Your belief here is uninformed and false. > > I stop reading at your first big mistake. Strings that describe Turing machines *are* actual Turing machines, and must be correctly treated as such. Since you willfully ignore portions of responses, your claims that nobody has found a flaw in your work are unfounded. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 09:49 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <-4SdnSVZH_jGkA39nZ2dnUU7-cvNnZ2d@giganews.com> |
| In reply to | #32622 |
On 5/3/2021 9:42 AM, Kaz Kylheku wrote: > On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>> >>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>> >>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>> >>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>> >>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>> >>>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>>> >>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>>> computation. >>>>>>>>> >>>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>> >>>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>>> arguments is not a TM, as required. >>>>>>>>> >>>>>>>> >>>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>> >>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>>> The point is that the invocation of X is not the same TM every time, >>>>>> >>>>>> The point is that the subsequent "invocations" are not invocations at >>>>>> all, they are data being processed by the only actual invocation that >>>>>> exists. >>>>> >>>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>>> "conventional proofs" of halting the corresponding entity is a function >>>>> of two arguments (and only those arguments), which is subject to actual >>>>> invocations. That's a key part of these proofs. >>>>> >>>> >>>> These proofs do not forbid simulating the input, and in fact do require >>>> that the inputs are not actual Turing machines they must be finite >>>> strings that describe Turing machines. >>> >>> Your belief here is uninformed and false. >> >> I stop reading at your first big mistake. > > Strings that describe Turing machines *are* actual Turing machines, and > must be correctly treated as such. > > Since you willfully ignore portions of responses, your claims > that nobody has found a flaw in your work are unfounded. > Since they cannot be directly executed they are not actual machines, they represent actual machines that can only be simulated in a simulator. Try and run a C program without a compiler or an interpreter. The C program represents a computation it is not the actual computation itself. It is one level of indirection away form the computation itself. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-03 14:57 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210503075039.27@kylheku.com> |
| In reply to | #32625 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>> >>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>> >>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>> >>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>> >>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>>>> >>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>>>> computation. >>>>>>>>>> >>>>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>> >>>>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>> >>>>>>>>> >>>>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>> >>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>>>> The point is that the invocation of X is not the same TM every time, >>>>>>> >>>>>>> The point is that the subsequent "invocations" are not invocations at >>>>>>> all, they are data being processed by the only actual invocation that >>>>>>> exists. >>>>>> >>>>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>>>> "conventional proofs" of halting the corresponding entity is a function >>>>>> of two arguments (and only those arguments), which is subject to actual >>>>>> invocations. That's a key part of these proofs. >>>>>> >>>>> >>>>> These proofs do not forbid simulating the input, and in fact do require >>>>> that the inputs are not actual Turing machines they must be finite >>>>> strings that describe Turing machines. >>>> >>>> Your belief here is uninformed and false. >>> >>> I stop reading at your first big mistake. >> >> Strings that describe Turing machines *are* actual Turing machines, and >> must be correctly treated as such. >> >> Since you willfully ignore portions of responses, your claims >> that nobody has found a flaw in your work are unfounded. >> > > Since they cannot be directly executed they are not actual machines, "Turing machine" refers to the mathematical object and its description, not to a simulation. You are harboring a false belief here. False beliefs read to work flaws. > they represent actual machines that can only be simulated in a simulator. In the "conventional halting proof" each call to Halts(P, I) is a Turing machine instance. Executing it requires a fresh instance of a simulator whose behavior is free from any external influence, like from other simulations that have previously occurred. A given definition of Halts, a given P and a given I, completely determines the initial tape contents. No content must come from anywhere else. You have not assured this in your apparatus. Halts is not the invocation of an ordinary function whose behavior depends on its arguments. > > Try and run a C program without a compiler or an interpreter. > The C program represents a computation it is not the actual computation > itself. All we ever have is representations, so you are just flailing your fingers on a keyboard here without saying anything. When do we ever do any mathematics or logic with any object without using representations? -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
Page 3 of 50 — ← Prev page 1 2 [3] 4 5 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web