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 18 of 50 — ← Prev page 1 … 16 17 [18] 19 20 … 50 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-19 13:57 +0000 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <20210519065152.705@kylheku.com> |
| In reply to | #33917 |
On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: > On 5/19/2021 5:58 AM, Richard Damon wrote: >> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >> in Computation Theory. That is how Logic works. >> >> The CORRECT definition of Halting is to look at what the machine does >> when it is run. For H^(H^) that is to Halt. >> >> > > On that basis we would conclude that _Infinite_Loop() is a halting > computation: Just because a simulating decider machine has identified that the infinite loop is and discontinued simulating it doesn't mean the loop matchine has become halting. The decider and the infinite loop are not the same machine. One can terminate even while the other does not. That's the very basis for halting: can we have machines which terminate, and indicate whether other machines do so? And to what extent can we have that. A non-halting computation doesn't become halting any more than the integers become finite when you stop counting at 100. And you, the counter, are not those integers. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-18 14:13 +0100 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <87bl98yyke.fsf@bsb.me.uk> |
| In reply to | #33843 |
olcott <NoOne@NoWhere.com> writes: > On 5/17/2021 8:49 PM, Richard Damon wrote: >> And what you miss is that if the algorithm in the copy of H that is in >> H^ doesn't know how to stop this infinite recursion, than neither does >> H, and thus H(H^,H^) will not return and thus H fails to be a decider. > >> If the algorithm in the copy of H does know how to stop this, then H^ >> when run as a machine WILL Halt on its own, and be a Halting Computation. > > This is the part that you (and others) continue to fail to understand: > > The following is referred to as: Ĥ(<Ĥ>) ** > ** That notation was provided by Ben No it wasn't. Please stop saying it was. > Unless the nested simulations specified by <Ĥ> are terminated at some > point they are infinite and Ĥ(<Ĥ>) never halts. > > The fact that these nested simulations must be terminated at some > point proves that <Ĥ> specifies an infinite computation and can be > correctly decided as non-halting by Ĥ. You say people don't understand, but all the posts I see are from people who understand perfectly well. They just know you are wrong if you claim to be talking about halting (which you keep doing). H([Ĥ]) (to use my notation) is a finite (AKA halting) computation but H(<[Ĥ], [Ĥ]>) incorrectly says otherwise. You could choose to be "right" (at least until we got into the details) if you admitted that the H you are talking about is only supposed to be a decider for the silly-non-halting problem. We know for sure, that it is not a decider for the halting problem. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-18 08:57 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <gOGdnfOMK4PiWj79nZ2dnUU7-U2dnZ2d@giganews.com> |
| In reply to | #33856 |
On 5/18/2021 8:13 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/17/2021 8:49 PM, Richard Damon wrote: > >>> And what you miss is that if the algorithm in the copy of H that is in >>> H^ doesn't know how to stop this infinite recursion, than neither does >>> H, and thus H(H^,H^) will not return and thus H fails to be a decider. >> >>> If the algorithm in the copy of H does know how to stop this, then H^ >>> when run as a machine WILL Halt on its own, and be a Halting Computation. >> >> This is the part that you (and others) continue to fail to understand: >> >> The following is referred to as: Ĥ(<Ĥ>) ** > >> ** That notation was provided by Ben > > No it wasn't. Please stop saying it was. > >> Unless the nested simulations specified by <Ĥ> are terminated at some >> point they are infinite and Ĥ(<Ĥ>) never halts. >> >> The fact that these nested simulations must be terminated at some >> point proves that <Ĥ> specifies an infinite computation and can be >> correctly decided as non-halting by Ĥ. > > You say people don't understand, but all the posts I see are from people > who understand perfectly well. They just know you are wrong if you > claim to be talking about halting (which you keep doing). > > H([Ĥ]) (to use my notation) is a finite (AKA halting) computation but > H(<[Ĥ], [Ĥ]>) incorrectly says otherwise. > > You could choose to be "right" (at least until we got into the details) > if you admitted that the H you are talking about is only supposed to be > a decider for the silly-non-halting problem. We know for sure, that it > is not a decider for the halting problem. > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn The above is adapted from (Linz:1990:319). It shows that Turing machine Ĥ copies its input at (q0) and begins executing an embedded copy of the original halt decider with this input at (qx). The (qy) state indicates that the halt decider decides that its input would halt. The ((qn)) state indicates the input would not halt. The appended (qa) and (qb) states cause Ĥ to infinitely loop if the halt decider decides that its input would halt. Linz, Peter 1990. An Introduction to Formal Languages and Automata. Lexington/Toronto: D. C. Heath and Company. The above definition specifies this execution trace: It can be understood from the above specification that when the embedded halt decider @Ĥ.qx bases its halting decision on simulating its input, and it has ([Ĥ],[Ĥ]) as its input that: Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy... Unless you understand and agree that the above sequence would be the sequence derived when the copy of H @Ĥ.qx is a simulating halt decider for this computation Ĥ([Ĥ]) then you and I have to stay eternally on this point until we do have a mutual understanding. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-18 01:56 +0100 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <87tun0271g.fsf@bsb.me.uk> |
| In reply to | #33744 |
olcott <NoOne@NoWhere.com> writes: > You already agreed that when simulation of an infinite loop is > terminated on the basis that its behavior matches the [infinite_loop] > behavior pattern that the fact that this infinite loop does halt does > not entail that it is a halting computation. No. You don't understand what I said, and your massive arrogance prevents you from trying to understand. >> olcott <NoOne@NoWhere.com> writes: >> >>> Truism: >>> Every simulation that would never stop unless Halts() stops >>> it at some point specifies infinite execution. > When non-halting behavior patterns are the measure of the above Truism > reject state (not_halting) then the remaining inputs are in the accept > state (halting). > > Every behavior pattern that correctly measures the Truism criteria > does decide non-halting correctly. Impossible to tell because this is just hand-waving, but a few facts can be teased from your waffle. The function you are so carefully hiding called Halts is wrong about the halting of at least one computation. Any algorithm that can decide whether a simulation will stop or not is a halt decider (and therefore impossible). To use a halt decider in order to give the wrong answer for the halting of a computation is a delicious kind of ironic madness that can only pop up on Usenet. -- Ben. "Whether a computation is finite is more nuanced than it simply stops running" Peter Olcott, May 2021.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-17 20:19 -0500 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <u_KdnTJXPLFKiD79nZ2dnUU7-YednZ2d@giganews.com> |
| In reply to | #33830 |
On 5/17/2021 7:56 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> You already agreed that when simulation of an infinite loop is >> terminated on the basis that its behavior matches the [infinite_loop] >> behavior pattern that the fact that this infinite loop does halt does >> not entail that it is a halting computation. > > No. You don't understand what I said, and your massive arrogance > prevents you from trying to understand. > >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> Truism: >>>> Every simulation that would never stop unless Halts() stops >>>> it at some point specifies infinite execution. > >> When non-halting behavior patterns are the measure of the above Truism >> reject state (not_halting) then the remaining inputs are in the accept >> state (halting). >> >> Every behavior pattern that correctly measures the Truism criteria >> does decide non-halting correctly. > > Impossible to tell because this is just hand-waving, but a few facts can > be teased from your waffle. The function you are so carefully hiding > called Halts is wrong about the halting of at least one computation. > Any algorithm that can decide whether a simulation will stop or not is a > halt decider (and therefore impossible). To use a halt decider in order > to give the wrong answer for the halting of a computation is a delicious > kind of ironic madness that can only pop up on Usenet. > The following is referred to as: Ĥ(<Ĥ>) ** Now Ĥ is a Turing machine, so that it will have some description in Σ*, say ŵ. This string, in addition to being the description of Ĥ can also be used as input string. We can therefore legitimately ask what would happen if Ĥ is applied to ŵ. ** That notation was provided by Ben Unless the nested simulations specified by <Ĥ> are terminated at some point they are infinite and Ĥ(<Ĥ>) never halts. The fact that these nested simulations must be terminated at some point proves that <Ĥ> specifies an infinite computation and can be correctly decided as non-halting. -- 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-15 18:05 -0400 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <6BXnI.45561$zx1.18289@fx20.iad> |
| In reply to | #33632 |
On 5/15/21 3:30 PM, olcott wrote:
> On 5/15/2021 12:37 PM, olcott wrote:
>> When we remove the pathological self-reference error of the original
>> halting problem specification then we no longer have any basis to
>> show that every input cannot be divided into this corrected criterion
>> measure of halting and not halting.
>>
>> Halting is defined as before, the machine halts on its input.
>> Not halting is defined differently to eliminate the pathological self
>> reference error.
>>
>> >> void H_Hat(u32 P)
>> >> {
>> >> u32 Input_Halts = Halts(P, P);
>> >> if (Input_Halts)
>> >> HERE: goto HERE;
>> >> }
>> >>
>> >> If the simulation never needs to be stopped then we can swap
>> >> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>> >> the simulation must have needed to have been stopped at some point.
>>
>> Every input to Halts that itself involves a call to Halts
>> has the same halting value as the halting value of the computation
>> having all calls to Halts replaced with calls to Simulate.
>
> We can see that on the basis of this corrected criteria the actual Linz
> H would correctly decide not halting on the actual Linz Ĥ shown on page
> 319. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>
You CAN'T 'correct' the criteria!! The criteria of what the actual
machine does, IS the right criteria for the classical halting problem of
computation theory. PERIOD.
Change it, and you are no longer working in that problem, and NOTHING
you say matters to it. PERIOD. DEFINITION.
First, there is NO 'Pathological' Self-Reference in the problem, at
least when properly stated. There is truely NO self-reference in the
definition of the Halting Problem or in the definition of H^. These are
all perfectly well defined without ANY reference to any 'self'.
The test case of H^ that causes H the problem does have something that
is sort of self-reference, but it isn't pathological. There is no
'Pathos' in it, it causes no issue to the problem. It isn't even really
a self-reference, H^ is just given a description that happens to be
itself. (The description doesn't say 'H^', it just happens to match it).
YOU create the form of self-reference by failing to meet the definition
of the problem by failing to make the copies that are actually REQUIRED
to properly express things as real Turing Machines. In fact, your whole
proof collapses if you try to translate it into Turing Machines because
you have broken 'equivalences'.
When we check H based on the ACTUAL definition of halting (did the
actual Turing Machine halt or not) we that it was wrong in its decision
on H*H^, H^) as you have already agreed.
Maybe you can say that you can show that your can say that Linz's proof
doesn't apply to the Olcott recursion problem, but you CAN'T say you
have refuted it for the actual Halting Problem.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-05-15 15:54 -0700 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <7e7002b6-d394-4a0e-9430-5d15672dd374n@googlegroups.com> |
| In reply to | #33643 |
On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote: > > Maybe you can say that you can show that your can say that Linz's proof > doesn't apply to the Olcott recursion problem, but you CAN'T say you > have refuted it for the actual Halting Problem. > Ben put it very well. We have another property of Turing machines which is not "halting". Linz's proof that "halting" is not TM_decideable does not apply to it. So far we've got a fairly weak, but perfectly reasonable claim. Now it is also claimed that the property is TM_decideable, hasn't been proposed before, and is "interesting". Now we're talking. But only if the property is carefully defined. That has to be the starting point.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 18:15 -0500 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <wd-dnXI8RPRpyD39nZ2dnUU7-KednZ2d@giganews.com> |
| In reply to | #33645 |
On 5/15/2021 5:54 PM, Malcolm McLean wrote:
> On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote:
>>
>> Maybe you can say that you can show that your can say that Linz's proof
>> doesn't apply to the Olcott recursion problem, but you CAN'T say you
>> have refuted it for the actual Halting Problem.
>>
> Ben put it very well. We have another property of Turing machines which
> is not "halting". Linz's proof that "halting" is not TM_decideable does not
> apply to it.
> So far we've got a fairly weak, but perfectly reasonable claim.
> Now it is also claimed that the property is TM_decideable, hasn't been
> proposed before, and is "interesting".
>
> Now we're talking. But only if the property is carefully defined. That has
> to be the starting point.
>
I finally tracked down the original author of this thought experiment:
Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM
You ask someone (we'll call him "Jack") to give a truthful
yes/no answer to the following question:
Will Jack's answer to this question be no?
Jack can't possibly give a correct yes/no answer to the question.
https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ?pli=1
Likewise Halts cannot possibly return a correct true/false value to
H_Hat when H_Hat has its own machine address as input.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
If Halts(P,P) on the first line of H_Hat returns true to H_Hat then
H_Hat does the opposite and loops.
If Halts(P,P) on the first line of H_Hat returns false to H_Hat then
H_Hat does the opposite and halts.
Thus proving that there is no correct value that Halts can return to H_Hat.
To circumvent this pathological self reference error we adapt the halt
deciding
criteria from Does the input halt on its input? To this truism:
On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> Truism:
>> Every simulation that would never stop unless Halts() stops
>> it at some point specifies infinite execution.
>
> Any algorithm that implements this truism is, of course, a halting
> decider.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
The explanation is not the algorithm its purpose is merely convey the
gist of the idea to humans:
If the simulation never needs to be stopped then we could swap
Simulate(P,P) for
Halts(P,P) and it will stop otherwise we know that the simulation must
have needed
to have been stopped at some point.
Because the original question was rigged so that Halts could not provide
a correct answer when we remove the pathological self reference error by
transforming the original question into a computationally equivalent
question:
Does the simulation of input P by simulating halt decider H have to be
stopped to prevent the infinite execution of P?
The answer is clearly yes.
--
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-15 19:36 -0400 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <KVYnI.600802$%W6.309298@fx44.iad> |
| In reply to | #33647 |
On 5/15/21 7:15 PM, olcott wrote:
> On 5/15/2021 5:54 PM, Malcolm McLean wrote:
>> On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote:
>>>
>>> Maybe you can say that you can show that your can say that Linz's proof
>>> doesn't apply to the Olcott recursion problem, but you CAN'T say you
>>> have refuted it for the actual Halting Problem.
>>>
>> Ben put it very well. We have another property of Turing machines which
>> is not "halting". Linz's proof that "halting" is not TM_decideable
>> does not
>> apply to it.
>> So far we've got a fairly weak, but perfectly reasonable claim.
>> Now it is also claimed that the property is TM_decideable, hasn't been
>> proposed before, and is "interesting".
>>
>> Now we're talking. But only if the property is carefully defined. That
>> has
>> to be the starting point.
>>
>
> I finally tracked down the original author of this thought experiment:
> Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM
>
> You ask someone (we'll call him "Jack") to give a truthful
> yes/no answer to the following question:
>
> Will Jack's answer to this question be no?
>
> Jack can't possibly give a correct yes/no answer to the question.
> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ?pli=1
>
> Likewise Halts cannot possibly return a correct true/false value to
> H_Hat when H_Hat has its own machine address as input.
And what is wrong with this fact?
The Question being given is one that has a natural need for an answer.
That is what the Halting Problem is.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> If Halts(P,P) on the first line of H_Hat returns true to H_Hat then
> H_Hat does the opposite and loops.
> If Halts(P,P) on the first line of H_Hat returns false to H_Hat then
> H_Hat does the opposite and halts.
> Thus proving that there is no correct value that Halts can return to H_Hat.
Right, so you just repeated the PROOF of Linz and the like.
The can be no Halt Decider that can decide Halting for All machines.
So what.
>
> To circumvent this pathological self reference error we adapt the halt
> deciding
> criteria from Does the input halt on its input? To this truism:
But WHY do we need an alternate criteria?
You just get an answer to the question not being asked.
This is like someone asking you a question about the color of a Black
Cat, and you answer with the color of your White Dog because you don't
happen to like cats.
It is the WRONG answer to the question that was desired.
>
> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> Truism:
>>> Every simulation that would never stop unless Halts() stops
>>> it at some point specifies infinite execution.
>>
>> Any algorithm that implements this truism is, of course, a halting
>> decider.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> The explanation is not the algorithm its purpose is merely convey the
> gist of the idea to humans:
> If the simulation never needs to be stopped then we could swap
> Simulate(P,P) for
> Halts(P,P) and it will stop otherwise we know that the simulation must
> have needed
> to have been stopped at some point.
>
> Because the original question was rigged so that Halts could not provide
> a correct answer when we remove the pathological self reference error by
> transforming the original question into a computationally equivalent
> question:
>
> Does the simulation of input P by simulating halt decider H have to be
> stopped to prevent the infinite execution of P?
>
> The answer is clearly yes.
>
>
And what is the problem with there being 'rigged' questions. Many
questions in life are rigged.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-05-15 16:42 -0700 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <a0afb4e3-2f45-4788-8a0b-736524baac6dn@googlegroups.com> |
| In reply to | #33647 |
On Sunday, 16 May 2021 at 00:15:08 UTC+1, olcott wrote:
> On 5/15/2021 5:54 PM, Malcolm McLean wrote:
> > On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote:
> >>
> >> Maybe you can say that you can show that your can say that Linz's proof
> >> doesn't apply to the Olcott recursion problem, but you CAN'T say you
> >> have refuted it for the actual Halting Problem.
> >>
> > Ben put it very well. We have another property of Turing machines which
> > is not "halting". Linz's proof that "halting" is not TM_decideable does not
> > apply to it.
> > So far we've got a fairly weak, but perfectly reasonable claim.
> > Now it is also claimed that the property is TM_decideable, hasn't been
> > proposed before, and is "interesting".
> >
> > Now we're talking. But only if the property is carefully defined. That has
> > to be the starting point.
> >
> I finally tracked down the original author of this thought experiment:
> Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM
>
> You ask someone (we'll call him "Jack") to give a truthful
> yes/no answer to the following question:
>
> Will Jack's answer to this question be no?
>
So by analogy, the Linz H_Hat(H_Hat) input is unfair. That's not an obviously
false claim but it doesn't really matter. If we agree that there is some question
which is not "does this computation halt?", then it doesn't matter whether
an input to "H" is "fair" or not.
>
> Jack can't possibly give a correct yes/no answer to the question.
> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ?pli=1
>
> Likewise Halts cannot possibly return a correct true/false value to
> H_Hat when H_Hat has its own machine address as input.
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
> If Halts(P,P) on the first line of H_Hat returns true to H_Hat then
> H_Hat does the opposite and loops.
> If Halts(P,P) on the first line of H_Hat returns false to H_Hat then
> H_Hat does the opposite and halts.
> Thus proving that there is no correct value that Halts can return to H_Hat.
>
> To circumvent this pathological self reference error we adapt the halt
> deciding
> criteria from Does the input halt on its input? To this truism:
>
Exactly. You need a different property. One to which H_Hat(H_Hat) doesn't
present an impossible conundrum.
>
> Because the original question was rigged so that Halts could not provide
> a correct answer when we remove the pathological self reference error by
> transforming the original question into a computationally equivalent
> question:
> Does the simulation of input P by simulating halt decider H have to be
> stopped to prevent the infinite execution of P?
>
And here we have it. The job now is to reformulate that idea so that it applies
to all Turing machines (or all C programs if you prefer), such that you can
separate them into two classes, those with the property and those without the
property. Then you need to show that the property is "interesting".
And to be fair, that's all you really need to do.
If you can show that the property is TM-decideable, that's a bonus. If it hasn't
been proposed before, then of course you get to call it yours. But really all
you need is a property of Turing machines which is not "halting" / "non-halting"
and is of interest.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 19:02 -0500 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <WcSdnUuif45Z_T39nZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #33652 |
On 5/15/2021 6:42 PM, Malcolm McLean wrote:
> On Sunday, 16 May 2021 at 00:15:08 UTC+1, olcott wrote:
>> On 5/15/2021 5:54 PM, Malcolm McLean wrote:
>>> On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote:
>>>>
>>>> Maybe you can say that you can show that your can say that Linz's proof
>>>> doesn't apply to the Olcott recursion problem, but you CAN'T say you
>>>> have refuted it for the actual Halting Problem.
>>>>
>>> Ben put it very well. We have another property of Turing machines which
>>> is not "halting". Linz's proof that "halting" is not TM_decideable does not
>>> apply to it.
>>> So far we've got a fairly weak, but perfectly reasonable claim.
>>> Now it is also claimed that the property is TM_decideable, hasn't been
>>> proposed before, and is "interesting".
>>>
>>> Now we're talking. But only if the property is carefully defined. That has
>>> to be the starting point.
>>>
>> I finally tracked down the original author of this thought experiment:
>> Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM
>>
>> You ask someone (we'll call him "Jack") to give a truthful
>> yes/no answer to the following question:
>>
>> Will Jack's answer to this question be no?
>>
> So by analogy, the Linz H_Hat(H_Hat) input is unfair. That's not an obviously
> false claim but it doesn't really matter. If we agree that there is some question
> which is not "does this computation halt?", then it doesn't matter whether
> an input to "H" is "fair" or not.
>>
>> Jack can't possibly give a correct yes/no answer to the question.
>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ?pli=1
>>
>> Likewise Halts cannot possibly return a correct true/false value to
>> H_Hat when H_Hat has its own machine address as input.
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>> If Halts(P,P) on the first line of H_Hat returns true to H_Hat then
>> H_Hat does the opposite and loops.
>> If Halts(P,P) on the first line of H_Hat returns false to H_Hat then
>> H_Hat does the opposite and halts.
>> Thus proving that there is no correct value that Halts can return to H_Hat.
>>
>> To circumvent this pathological self reference error we adapt the halt
>> deciding
>> criteria from Does the input halt on its input? To this truism:
>>
> Exactly. You need a different property. One to which H_Hat(H_Hat) doesn't
> present an impossible conundrum.
> >
>> Because the original question was rigged so that Halts could not provide
>> a correct answer when we remove the pathological self reference error by
>> transforming the original question into a computationally equivalent
>> question:
>> Does the simulation of input P by simulating halt decider H have to be
>> stopped to prevent the infinite execution of P?
>>
> And here we have it. The job now is to reformulate that idea so that it applies
> to all Turing machines (or all C programs if you prefer), such that you can
> separate them into two classes, those with the property and those without the
> property. Then you need to show that the property is "interesting".
> And to be fair, that's all you really need to do.
> If you can show that the property is TM-decideable, that's a bonus. If it hasn't
> been proposed before, then of course you get to call it yours. But really all
> you need is a property of Turing machines which is not "halting" / "non-halting"
> and is of interest.
>
This criteria can be used to divide all inputs into halting and not
halting, including those inputs that specify pathological self-reference.
When the behavior of the input P to Halts
(a) correctly matches
(b) a correct non-halting behavior pattern
then Halts decides non-halting on P correctly.
It is sufficiently obvious that the original Linz proof specifies the
[infinitely_nested_simulation] non halting behavior pattern to every
simulating halt decider.
http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
When I say sufficiently obvious I mean that you might get it right away
and several others will have a harder time yet eventually get it.
--
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-15 20:40 -0400 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <ZRZnI.96643$v3H9.52402@fx01.iad> |
| In reply to | #33654 |
On 5/15/21 8:02 PM, olcott wrote:
> On 5/15/2021 6:42 PM, Malcolm McLean wrote:
>> On Sunday, 16 May 2021 at 00:15:08 UTC+1, olcott wrote:
>>> On 5/15/2021 5:54 PM, Malcolm McLean wrote:
>>>> On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote:
>>>>>
>>>>> Maybe you can say that you can show that your can say that Linz's
>>>>> proof
>>>>> doesn't apply to the Olcott recursion problem, but you CAN'T say you
>>>>> have refuted it for the actual Halting Problem.
>>>>>
>>>> Ben put it very well. We have another property of Turing machines which
>>>> is not "halting". Linz's proof that "halting" is not TM_decideable
>>>> does not
>>>> apply to it.
>>>> So far we've got a fairly weak, but perfectly reasonable claim.
>>>> Now it is also claimed that the property is TM_decideable, hasn't been
>>>> proposed before, and is "interesting".
>>>>
>>>> Now we're talking. But only if the property is carefully defined.
>>>> That has
>>>> to be the starting point.
>>>>
>>> I finally tracked down the original author of this thought experiment:
>>> Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM
>>>
>>> You ask someone (we'll call him "Jack") to give a truthful
>>> yes/no answer to the following question:
>>>
>>> Will Jack's answer to this question be no?
>>>
>> So by analogy, the Linz H_Hat(H_Hat) input is unfair. That's not an
>> obviously
>> false claim but it doesn't really matter. If we agree that there is
>> some question
>> which is not "does this computation halt?", then it doesn't matter
>> whether
>> an input to "H" is "fair" or not.
>>>
>>> Jack can't possibly give a correct yes/no answer to the question.
>>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ?pli=1
>>>
>>> Likewise Halts cannot possibly return a correct true/false value to
>>> H_Hat when H_Hat has its own machine address as input.
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>> If Halts(P,P) on the first line of H_Hat returns true to H_Hat then
>>> H_Hat does the opposite and loops.
>>> If Halts(P,P) on the first line of H_Hat returns false to H_Hat then
>>> H_Hat does the opposite and halts.
>>> Thus proving that there is no correct value that Halts can return to
>>> H_Hat.
>>>
>>> To circumvent this pathological self reference error we adapt the halt
>>> deciding
>>> criteria from Does the input halt on its input? To this truism:
>>>
>> Exactly. You need a different property. One to which H_Hat(H_Hat) doesn't
>> present an impossible conundrum.
>> >
>>> Because the original question was rigged so that Halts could not provide
>>> a correct answer when we remove the pathological self reference error by
>>> transforming the original question into a computationally equivalent
>>> question:
>>> Does the simulation of input P by simulating halt decider H have to be
>>> stopped to prevent the infinite execution of P?
>>>
>> And here we have it. The job now is to reformulate that idea so that
>> it applies
>> to all Turing machines (or all C programs if you prefer), such that
>> you can
>> separate them into two classes, those with the property and those
>> without the
>> property. Then you need to show that the property is "interesting".
>> And to be fair, that's all you really need to do.
>> If you can show that the property is TM-decideable, that's a bonus. If
>> it hasn't
>> been proposed before, then of course you get to call it yours. But
>> really all
>> you need is a property of Turing machines which is not "halting" /
>> "non-halting"
>> and is of interest.
>>
>
> This criteria can be used to divide all inputs into halting and not
> halting, including those inputs that specify pathological self-reference.
But it classifies some machines that DO Halt, as Non-Halting.
You do this just so you can get a 'right' answer that is actually wrong.
>
> When the behavior of the input P to Halts
> (a) correctly matches
> (b) a correct non-halting behavior pattern
> then Halts decides non-halting on P correctly.
So how is a machine that when run does Halt, correctly decided as
Non-Halting?
>
> It is sufficiently obvious that the original Linz proof specifies the
> [infinitely_nested_simulation] non halting behavior pattern to every
> simulating halt decider.
>
> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>
> When I say sufficiently obvious I mean that you might get it right away
> and several others will have a harder time yet eventually get it.
>
So, you are saying that the answer to the Halting Problem depends on the
Decider that is being used to decide?
ONLY H has the problem with H^, in fact, you can make a second version
of Halts called Halts2 which checks for recursion into itself (Halts2)
and ask Halts2(H_Hat, H_Hat) and it will get the right answer of Halting.
Does that mean THIS decider is wrong?
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-16 02:30 +0000 |
| Subject | Re: New test program (Succeeds V2)[ mutual agreement? ] |
| Message-ID | <20210515191437.385@kylheku.com> |
| In reply to | #33647 |
On 2021-05-15, olcott <NoOne@NoWhere.com> wrote: > On 5/15/2021 5:54 PM, Malcolm McLean wrote: >> On Saturday, 15 May 2021 at 23:05:57 UTC+1, Richard Damon wrote: >>> >>> Maybe you can say that you can show that your can say that Linz's proof >>> doesn't apply to the Olcott recursion problem, but you CAN'T say you >>> have refuted it for the actual Halting Problem. >>> >> Ben put it very well. We have another property of Turing machines which >> is not "halting". Linz's proof that "halting" is not TM_decideable does not >> apply to it. >> So far we've got a fairly weak, but perfectly reasonable claim. >> Now it is also claimed that the property is TM_decideable, hasn't been >> proposed before, and is "interesting". >> >> Now we're talking. But only if the property is carefully defined. That has >> to be the starting point. >> > > I finally tracked down the original author of this thought experiment: > Daryl McCullough sci.logic Jun 25, 2004, 6:30:39 PM > > You ask someone (we'll call him "Jack") to give a truthful > yes/no answer to the following question: > > Will Jack's answer to this question be no? If we take the question to be some mathematical proposition, and Jack is a recursive function, then Jack must somehow produce a particular answer to this question, and always produce that same answer. If Jack sometimes produces yes and sometimes no, Jack is disqualified. Suppose Jack's answer is "No.". Then the correct answer to the question is yes. Dialog time: Interlocutor: Jack, will Jack's answer to this question be no? Jack: Yes. Interlocutor: Bob, what do you think? Bob: No. Interlocutor: Indeed, Bob is right. The question has a correct answer, and Bob got it. (Enter a lunatic) Olcott: I can produce a Jack who answers correctly. We just rewrite the question to address Bob rather than Jack. My Jack implementation then simulates Bob, and inverts Bob's answer. Interlocutor: but, whatever that answer is, it is interpreted as an answer to the original question. If your Jack edits the question as part of its calculation, that's just just Jack's private reasoning which doesn't change the question being answered. The answer given by Jack is to the question it was asked, "will Jack's answer to the question be no". I don't see how Jack can answer correctly. Olcott: that is a dishonest, off-topic dodge. Your question is unfair and incorrect, so to refute the theorem that Jack cannot answer, we must first change the question to Bob. That must be accepted as the correct question before we can proceed. (Except when Bob is given the question, then we can change it back to Jack.) Interlocutor: but that is not surprising; just before you got here we saw how Bob can get the answer for the Jack question. So of course Jack can get the answer for the Bob question. Olcott: No, I am adamant that I hit upon this idea first! The idea that Jack can answer Bob's question is completely original and has nothing to dow with Bob being able to answer Jack's question.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-15 19:31 +0000 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <20210515122658.536@kylheku.com> |
| In reply to | #33628 |
On 2021-05-15, olcott <NoOne@NoWhere.com> wrote: > When we remove the pathological self-reference error of the original > halting problem specification then we no longer have any basis to > show that every input cannot be divided into this corrected criterion > measure of halting and not halting. 1. The halting *problem* specification has no such self-reference error. 2. The counterexample mechanism used in halting *proofs* has no self-reference, therefore no self-reference error. 3. It is a grievous error of the intellect to change anything about a problem specification, and then continue as if it were the original specification, believing that properties of the new specification are also properties of the original. > Every input to Halts that itself involves a call to Halts > has the same halting value as the halting value of the computation > having all calls to Halts replaced with calls to Simulate. It absolutely does not; are you stupid?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-15 21:28 +0100 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <871ra7pwr7.fsf@bsb.me.uk> |
| In reply to | #33628 |
olcott <NoOne@NoWhere.com> writes: > When we remove the pathological self-reference error of the original > halting problem specification then we no longer have any basis to show > that every input cannot be divided into this corrected criterion > measure of halting and not halting. Without any removal or correction, the criterion of halting divides all inputs into those that do and those that don't, (though I prefer the terms "those that represent finite computations and those that don't"). > Halting is defined as before, the machine halts on its input. > Not halting is define differently to eliminate the pathological self > reference error. The "not halting" inputs the ones that don't halt. If the meaning of halting does not change, then the meaning of not halting does not change. Every computation either halts or does not halt. Even you know this. You need a new term for this new not-quite-halting problem. If you keep re-using halting and not halting you will fail to communicate. Every now and then your meaning is clear despite the words. You determine a property of some halting computations and declare that false is the correct answer because a related computation does not halt. What do you want to call this property? How about "other halting"? You have come up with the other-halting problem and you have a claim: other-halting for TMs is TM decidable. It may well be, but you will never be able to define the problem, much less prove the theorem, so we will never know. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-15 08:59 -0400 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <aBPnI.109417$9F5.23381@fx43.iad> |
| In reply to | #33607 |
On 5/14/21 11:00 PM, olcott wrote:
> On 5/14/2021 4:47 PM, Kaz Kylheku wrote:
>> On 2021-05-14, olcott <NoOne@NoWhere.com> wrote:
>>> When the behavior of the input P to Halts
>>> (a) correctly matches
>>> (b) a correct non-halting behavior pattern
>>> then Halts decides non-halting on P correctly.
>>
>> Do you not agree that:
>>
>> When the behavior of the input P to Halts
>> (a) correctly matches
>> (b) an incorrect non-halting behavior pattern
>> then Halts decides non-halting on P incorrectly?
>>
>> The only question is which of these two possibilities is
>> your program?
>>
>> You have dreamed up some conditions, and produced a program
>> to test them.
>>
>> The program is not correctly deciding an obvious test case.
>>
>> Therefore, if the conditions are implemented as specified, they must be
>> wrong. Effectivey, those conditions themselves are failing.
>>
>
> Does the simulation of input P by simulating (at least partial) halt
> decider H have to be stopped to prevent the infinite execution of P?
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> THIS IS A TRUISM:
> If the simulation never needs to be stopped then we can swap
> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
> simulation must have needed to have been stopped at some point.
>
> I know that this logic is correct. I do not currently know how to
> formalize it. Part of what I am doing is unraveling the pathological
> self-reference.
>
>
The swapping of Halts with Simulate is ONLY valid if the operation is
finite. If you later want to be able to decide that the operation might
have been non-halting, you can't have started with that operation.
Thus, having done so, the only answer that Halts is allowed to legally
(by the laws of logic) return in Halting. As soon as it wants to say
non-halting it needs to redo that part of its proof based on that
assumption.
Your logic of assuming it is finite, and then using that to prove it is
non-halting is introducing an inconsistent logic to your system, which
makes it worthless to actual try to prove anything.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 10:23 -0500 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <OpadnWFKYt7QegL9nZ2dnUU7-bWdnZ2d@giganews.com> |
| In reply to | #33613 |
On 5/15/2021 7:59 AM, Richard Damon wrote:
> On 5/14/21 11:00 PM, olcott wrote:
>> On 5/14/2021 4:47 PM, Kaz Kylheku wrote:
>>> On 2021-05-14, olcott <NoOne@NoWhere.com> wrote:
>>>> When the behavior of the input P to Halts
>>>> (a) correctly matches
>>>> (b) a correct non-halting behavior pattern
>>>> then Halts decides non-halting on P correctly.
>>>
>>> Do you not agree that:
>>>
>>> When the behavior of the input P to Halts
>>> (a) correctly matches
>>> (b) an incorrect non-halting behavior pattern
>>> then Halts decides non-halting on P incorrectly?
>>>
>>> The only question is which of these two possibilities is
>>> your program?
>>>
>>> You have dreamed up some conditions, and produced a program
>>> to test them.
>>>
>>> The program is not correctly deciding an obvious test case.
>>>
>>> Therefore, if the conditions are implemented as specified, they must be
>>> wrong. Effectivey, those conditions themselves are failing.
>>>
>>
>> Does the simulation of input P by simulating (at least partial) halt
>> decider H have to be stopped to prevent the infinite execution of P?
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>> THIS IS A TRUISM:
>> If the simulation never needs to be stopped then we can swap
>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
>> simulation must have needed to have been stopped at some point.
>>
>> I know that this logic is correct. I do not currently know how to
>> formalize it. Part of what I am doing is unraveling the pathological
>> self-reference.
>>
>>
>
> The swapping of Halts with Simulate is ONLY valid if the operation is
> finite. If you later want to be able to decide that the operation might
> have been non-halting, you can't have started with that operation.
>
> Thus, having done so, the only answer that Halts is allowed to legally
> (by the laws of logic) return in Halting. As soon as it wants to say
> non-halting it needs to redo that part of its proof based on that
> assumption.
>
> Your logic of assuming it is finite, and then using that to prove it is
> non-halting is introducing an inconsistent logic to your system, which
> makes it worthless to actual try to prove anything.
>
Does the simulation of input P by simulating (at least partial) halt
decider H have to be stopped to prevent the infinite execution of P?
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
THIS IS A TRUISM:
If the simulation never needs to be stopped then we can swap
Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
simulation must have needed to have been stopped at some point.
I know that this logic is correct. I do not currently know how to
formalize it. Part of what I am doing is unraveling the pathological
self-reference.
If we cannot swap a simulating halt decider (that only stops simulating
its input when it determines that its infinite specifies an infinite
computation) for an ordinary simulator without causing the computation
to become infinite then this is complete proof that the simulating halt
decider must have stopped simulating its input at some point.
If a simulating halt decider ever has to stop simulating its input to
prevent the infinite execution of this input that proves that this input
specifies infinite execution and the non-halting decision of the
simulating halt decider is correct.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 10:26 -0500 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <OpadnWBKYt6ZdQL9nZ2dnUU7-bWdnZ2d@giganews.com> |
| In reply to | #33617 |
On 5/15/2021 10:23 AM, olcott wrote:
> On 5/15/2021 7:59 AM, Richard Damon wrote:
>> On 5/14/21 11:00 PM, olcott wrote:
>>> On 5/14/2021 4:47 PM, Kaz Kylheku wrote:
>>>> On 2021-05-14, olcott <NoOne@NoWhere.com> wrote:
>>>>> When the behavior of the input P to Halts
>>>>> (a) correctly matches
>>>>> (b) a correct non-halting behavior pattern
>>>>> then Halts decides non-halting on P correctly.
>>>>
>>>> Do you not agree that:
>>>>
>>>> When the behavior of the input P to Halts
>>>> (a) correctly matches
>>>> (b) an incorrect non-halting behavior pattern
>>>> then Halts decides non-halting on P incorrectly?
>>>>
>>>> The only question is which of these two possibilities is
>>>> your program?
>>>>
>>>> You have dreamed up some conditions, and produced a program
>>>> to test them.
>>>>
>>>> The program is not correctly deciding an obvious test case.
>>>>
>>>> Therefore, if the conditions are implemented as specified, they must be
>>>> wrong. Effectivey, those conditions themselves are failing.
>>>>
>>>
>>> Does the simulation of input P by simulating (at least partial) halt
>>> decider H have to be stopped to prevent the infinite execution of P?
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> THIS IS A TRUISM:
>>> If the simulation never needs to be stopped then we can swap
>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
>>> simulation must have needed to have been stopped at some point.
>>>
>>> I know that this logic is correct. I do not currently know how to
>>> formalize it. Part of what I am doing is unraveling the pathological
>>> self-reference.
>>>
>>>
>>
>> The swapping of Halts with Simulate is ONLY valid if the operation is
>> finite. If you later want to be able to decide that the operation might
>> have been non-halting, you can't have started with that operation.
>>
>> Thus, having done so, the only answer that Halts is allowed to legally
>> (by the laws of logic) return in Halting. As soon as it wants to say
>> non-halting it needs to redo that part of its proof based on that
>> assumption.
>>
>> Your logic of assuming it is finite, and then using that to prove it is
>> non-halting is introducing an inconsistent logic to your system, which
>> makes it worthless to actual try to prove anything.
>>
>
> Does the simulation of input P by simulating (at least partial) halt
> decider H have to be stopped to prevent the infinite execution of P?
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> THIS IS A TRUISM:
> If the simulation never needs to be stopped then we can swap
> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
> simulation must have needed to have been stopped at some point.
>
> I know that this logic is correct. I do not currently know how to
> formalize it. Part of what I am doing is unraveling the pathological
> self-reference.
WHOOPS TYPO CORRECTED
If we cannot swap a simulating halt decider (that only stops simulating
its input when it determines that its [input] specifies an infinite
computation) for an ordinary simulator without causing the computation
to become infinite then this is complete proof that the simulating halt
decider must have stopped simulating its input at some point.
If a simulating halt decider ever has to stop simulating its input to
prevent the infinite execution of this input that proves that this input
specifies infinite execution and the non-halting decision of the
simulating halt decider is correct.
--
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-15 12:16 -0400 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <%tSnI.109660$9F5.6051@fx43.iad> |
| In reply to | #33617 |
On 5/15/21 11:23 AM, olcott wrote:
> On 5/15/2021 7:59 AM, Richard Damon wrote:
>> On 5/14/21 11:00 PM, olcott wrote:
>>> On 5/14/2021 4:47 PM, Kaz Kylheku wrote:
>>>> On 2021-05-14, olcott <NoOne@NoWhere.com> wrote:
>>>>> When the behavior of the input P to Halts
>>>>> (a) correctly matches
>>>>> (b) a correct non-halting behavior pattern
>>>>> then Halts decides non-halting on P correctly.
>>>>
>>>> Do you not agree that:
>>>>
>>>> When the behavior of the input P to Halts
>>>> (a) correctly matches
>>>> (b) an incorrect non-halting behavior pattern
>>>> then Halts decides non-halting on P incorrectly?
>>>>
>>>> The only question is which of these two possibilities is
>>>> your program?
>>>>
>>>> You have dreamed up some conditions, and produced a program
>>>> to test them.
>>>>
>>>> The program is not correctly deciding an obvious test case.
>>>>
>>>> Therefore, if the conditions are implemented as specified, they must be
>>>> wrong. Effectivey, those conditions themselves are failing.
>>>>
>>>
>>> Does the simulation of input P by simulating (at least partial) halt
>>> decider H have to be stopped to prevent the infinite execution of P?
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> THIS IS A TRUISM:
>>> If the simulation never needs to be stopped then we can swap
>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
>>> simulation must have needed to have been stopped at some point.
>>>
>>> I know that this logic is correct. I do not currently know how to
>>> formalize it. Part of what I am doing is unraveling the pathological
>>> self-reference.
>>>
>>>
>>
>> The swapping of Halts with Simulate is ONLY valid if the operation is
>> finite. If you later want to be able to decide that the operation might
>> have been non-halting, you can't have started with that operation.
>>
>> Thus, having done so, the only answer that Halts is allowed to legally
>> (by the laws of logic) return in Halting. As soon as it wants to say
>> non-halting it needs to redo that part of its proof based on that
>> assumption.
>>
>> Your logic of assuming it is finite, and then using that to prove it is
>> non-halting is introducing an inconsistent logic to your system, which
>> makes it worthless to actual try to prove anything.
>>
>
> Does the simulation of input P by simulating (at least partial) halt
> decider H have to be stopped to prevent the infinite execution of P?
And, for H_Hat, it doesn't need to be stopped by the Halt Decider
processing it. This is seen by running H_Hat(H_Hat) as a Computation
(with the existing definition of Halts) and it does halt.
You have agreed to it.
Thus, the Halts that is deciding does NOT need to stop the simulation of
H_Hat to avoid infinite execution.
IMPORTANT NOTE: The fact that it DOES halt it does not mean that it
needs to. Changing Halts to verify this must be done in a way that
doesn't affect the computation of H_Hat which includes its own 'copy' of
Halts, so you are not allowed to change that version of Halts.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> THIS IS A TRUISM:
> If the simulation never needs to be stopped then we can swap
> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
> simulation must have needed to have been stopped at some point.
WRONG. This substitution may add a finite time to the execution time for
each instance of it happening. It is NOT valid if the number of times it
gets applied is unbounded. This happens in H_Hat, thus it is NOT a valid
operation.
>
> I know that this logic is correct. I do not currently know how to
> formalize it. Part of what I am doing is unraveling the pathological
> self-reference.
It isn't. It is neglecting that the self-reference makes the
substitution invalid.
>
> If we cannot swap a simulating halt decider (that only stops simulating
> its input when it determines that its infinite specifies an infinite
> computation) for an ordinary simulator without causing the computation
> to become infinite then this is complete proof that the simulating halt
> decider must have stopped simulating its input at some point.\
Nope, as I said, the substituion isn't valid.
>
> If a simulating halt decider ever has to stop simulating its input to
> prevent the infinite execution of this input that proves that this input
> specifies infinite execution and the non-halting decision of the
> simulating halt decider is correct.
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-15 00:12 +0100 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <87tun4rjul.fsf@bsb.me.uk> |
| In reply to | #33583 |
olcott <NoOne@NoWhere.com> writes: > When the behavior of the input P to Halts > (a) correctly matches > (b) a correct non-halting behavior pattern > then Halts decides non-halting on P correctly. What are you going to call this problem? (You need to tidy up your use of words, too, but that will be a struggle for you.) -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 18 of 50 — ← Prev page 1 … 16 17 [18] 19 20 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web