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 1 of 50 [1] 2 3 … 50 Next page →
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-05-02 14:15 +0100 |
| Subject | Solution To The Halting Problem |
| Message-ID | <eCxjI.450528$AWcd.220764@fx42.ams4> |
Does anyone know the solution to the problem of halting olcott's Usenet posts? /Flibble -- 😎
[toc] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-02 14:03 +0000 |
| Message-ID | <20210502070155.115@kylheku.com> |
| In reply to | #32563 |
On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: > Does anyone know the solution to the problem of halting olcott's Usenet posts? Everyone halts. For this case, specifically, there is an unproven and empirically untested hypothesis about an early halt that occurs if everyone stops responding. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Richard Harnden <richard.nospam@gmail.com> |
|---|---|
| Date | 2021-05-02 15:15 +0100 |
| Message-ID | <s6mc6o$n39$1@dont-email.me> |
| In reply to | #32564 |
On 02/05/2021 15:03, Kaz Kylheku wrote: > On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >> Does anyone know the solution to the problem of halting olcott's Usenet posts? > > Everyone halts. For this case, specifically, there is an unproven > and empirically untested hypothesis about an early halt that occurs > if everyone stops responding. > We can ask him to stop. We can't prove that he will.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 10:21 -0500 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <c_mdnSsTsd_VXhP9nZ2dnUU7-InNnZ2d@giganews.com> |
| In reply to | #32565 |
On 5/2/2021 9:15 AM, Richard Harnden wrote:
> On 02/05/2021 15:03, Kaz Kylheku wrote:
>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote:
>>> Does anyone know the solution to the problem of halting olcott's
>>> Usenet posts?
>>
>> Everyone halts. For this case, specifically, there is an unproven
>> and empirically untested hypothesis about an early halt that occurs
>> if everyone stops responding.
>>
>
> We can ask him to stop. We can't prove that he will.
The bigger question is when are my reviewers going to provide an
accurate review?
It is a fact that this infinite recursion detection criteria is correct:
If the execution trace of function Y() shows:
function X() is called twice in sequence from the same machine address
of Y()
with the same parameters to X()
with no conditional branch or indexed jump instructions in Y()
with no function call returns from X()
then the function call from Y() to X() is infinitely recursive.
It is a fact that this criteria correctly decides all calls from
H_Hat() to Halts() are infinitely recursive:
If the execution trace of H_Hat() by function Halts() shows:
(1) Function Halts() is called twice in sequence from the same machine
address of H_Hat().
(2) With the same parameters to Halts().
(3) With no conditional branch or indexed jump instructions in H_Hat().
(4) With no function call returns from Halts().
then the function call from H_Hat() to Halts() is infinitely recursive.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
All of the details including a fresh execution trace are provided here:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Harnden <richard.nospam@gmail.com> |
|---|---|
| Date | 2021-05-02 17:11 +0100 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <s6mj0b$a22$1@dont-email.me> |
| In reply to | #32567 |
On 02/05/2021 16:21, olcott wrote:
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
You keep posting this or something very similar.
That doesn't make it correct. It doesn't matter how many times you
repeat it.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 11:18 -0500 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <DridnefgF6AlTRP9nZ2dnUU7-TGdnZ2d@giganews.com> |
| In reply to | #32570 |
On 5/2/2021 11:11 AM, Richard Harnden wrote:
> On 02/05/2021 16:21, olcott wrote:
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>
> You keep posting this or something very similar.
>
> That doesn't make it correct. It doesn't matter how many times you
> repeat it.
>
This is the part that makes it correct:
If the execution trace of function Y() shows:
function X() is called twice in sequence from the same machine address
of Y()
with the same parameters to X()
with no conditional branch or indexed jump instructions in Y()
with no function call returns from X()
then the function call from Y() to X() is infinitely recursive.
All of the details including a fresh execution trace are provided here:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
--
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-02 13:53 -0400 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <HGBjI.270295$2N3.114562@fx33.iad> |
| In reply to | #32571 |
On 5/2/21 12:18 PM, olcott wrote:
> On 5/2/2021 11:11 AM, Richard Harnden wrote:
>> On 02/05/2021 16:21, olcott wrote:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>
>> You keep posting this or something very similar.
>>
>> That doesn't make it correct. It doesn't matter how many times you
>> repeat it.
>>
>
> This is the part that makes it correct:
>
> If the execution trace of function Y() shows:
> function X() is called twice in sequence from the same machine address
> of Y()
> with the same parameters to X()
> with no conditional branch or indexed jump instructions in Y()
> with no function call returns from X()
> then the function call from Y() to X() is infinitely recursive.
>
>
>
> All of the details including a fresh execution trace are provided here:
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
>
Your saying to does not make it right. You are using bad definitions.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-02 16:38 +0000 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <20210502092107.409@kylheku.com> |
| In reply to | #32567 |
On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 9:15 AM, Richard Harnden wrote: >> On 02/05/2021 15:03, Kaz Kylheku wrote: >>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>> Does anyone know the solution to the problem of halting olcott's >>>> Usenet posts? >>> >>> Everyone halts. For this case, specifically, there is an unproven >>> and empirically untested hypothesis about an early halt that occurs >>> if everyone stops responding. >>> >> >> We can ask him to stop. We can't prove that he will. > > The bigger question is when are my reviewers going to provide an > accurate review? > > It is a fact that this infinite recursion detection criteria is correct: > > If the execution trace of function Y() shows: > function X() is called twice in sequence from the same machine address > of Y() > with the same parameters to X() > with no conditional branch or indexed jump instructions in Y() > with no function call returns from X() > then the function call from Y() to X() is infinitely recursive. This is only "right" from the perspective of an objective observation that is not involved in the computation, and has no effect on it. The function X() cannot itself make this observation. X has access to only its parameters, and its parameters do not carry any information indicating to X that it has been called twice from the same address or any such thing. How can they; the parameters are *always the same*. Therefore they cannot distinguish the first call from the second call from the third call ... A function having adcess to past execution traces is an imperative procedure, which is completely invalid. It may be possible to rigorously define the halting criteria using imperative procedures, but it has to be in a completely different way. (After all, Turing's machine is imperative: it mutates a tape.) You cannot simply use a definition built around functions and just substitute procedures into it. I believe this to be an accurate review of your definition. It points to flaws in the definition. You have done nothing to correct the definition to fix the flaws; you simply keep re-asserting the same definition as correct.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 12:10 -0500 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <tPCdnWlh2-t2QRP9nZ2dnUU7-dnNnZ2d@giganews.com> |
| In reply to | #32572 |
On 5/2/2021 11:38 AM, Kaz Kylheku wrote: > On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>> Does anyone know the solution to the problem of halting olcott's >>>>> Usenet posts? >>>> >>>> Everyone halts. For this case, specifically, there is an unproven >>>> and empirically untested hypothesis about an early halt that occurs >>>> if everyone stops responding. >>>> >>> >>> We can ask him to stop. We can't prove that he will. >> >> The bigger question is when are my reviewers going to provide an >> accurate review? >> >> It is a fact that this infinite recursion detection criteria is correct: >> >> If the execution trace of function Y() shows: >> function X() is called twice in sequence from the same machine address >> of Y() >> with the same parameters to X() >> with no conditional branch or indexed jump instructions in Y() >> with no function call returns from X() >> then the function call from Y() to X() is infinitely recursive. > > This is only "right" from the perspective of an objective observation > that is not involved in the computation, and has no effect on it. > > The function X() cannot itself make this observation. X has access to > only its parameters, and its parameters do not carry any information > indicating to X that it has been called twice from the same address > or any such thing. How can they; the parameters are *always the same*. > Therefore they cannot distinguish the first call from the second call > from the third call ... > > A function having adcess to past execution traces is an imperative > procedure, which is completely invalid. This is ridiculous, it is just like saying that I must be wrong on the basis that you really believe that I am wrong. You have to concretely prove these dogmatic statements. When you attempt to do this it becomes obvious the the code shown in this link does what you say is utterly impossible: All of the details including a fresh execution trace are provided here: http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > It may be possible to rigorously define the halting criteria using > imperative procedures, but it has to be in a completely different way. > (After all, Turing's machine is imperative: it mutates a tape.) You > cannot simply use a definition built around functions and just > substitute procedures into it. > > I believe this to be an accurate review of your definition. It points to > flaws in the definition. You have done nothing to correct the definition > to fix the flaws; you simply keep re-asserting the same definition as > correct. You essentially only said that you really believe that I am wrong. Since I provided an execution trace of code doing what you said is impossible your assertion that it is impossible is utterly refuted. What is you motive for making such nutty statements? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-02 17:39 +0000 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <20210502102359.306@kylheku.com> |
| In reply to | #32573 |
On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: > On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>> Usenet posts? >>>>> >>>>> Everyone halts. For this case, specifically, there is an unproven >>>>> and empirically untested hypothesis about an early halt that occurs >>>>> if everyone stops responding. >>>>> >>>> >>>> We can ask him to stop. We can't prove that he will. >>> >>> The bigger question is when are my reviewers going to provide an >>> accurate review? >>> >>> It is a fact that this infinite recursion detection criteria is correct: >>> >>> If the execution trace of function Y() shows: >>> function X() is called twice in sequence from the same machine address >>> of Y() >>> with the same parameters to X() >>> with no conditional branch or indexed jump instructions in Y() >>> with no function call returns from X() >>> then the function call from Y() to X() is infinitely recursive. >> >> This is only "right" from the perspective of an objective observation >> that is not involved in the computation, and has no effect on it. >> >> The function X() cannot itself make this observation. X has access to >> only its parameters, and its parameters do not carry any information >> indicating to X that it has been called twice from the same address >> or any such thing. How can they; the parameters are *always the same*. >> Therefore they cannot distinguish the first call from the second call >> from the third call ... >> >> A function having adcess to past execution traces is an imperative >> procedure, which is completely invalid. > > This is ridiculous, it is just like saying that I must be wrong on the > basis that you really believe that I am wrong. > > You have to concretely prove these dogmatic statements. When you attempt 1. You're trying to refute a proof which has a similar structure to the X and Y arrangement above. 2. In that proof, the entities corresponding to X and Y are functions, and not imperative procedures. They have no access to some global, mutating state holding execution traces; such a situation would violate the conditions of the proof. 3. The proof says, specifically, that X cannot decide the halting situation. Either X returns the wrong value, or does not return. (The proof does not say that the situation's halting is not decidable, as such; it most certainly is decidable.) You've come along claiming the obvious: "Look, the situation is decidable. If I supply a definition of X which simply executes Y, then X does not return because X and Y are caught in an infinite recursion. If X and Y are implemented in C and the machine code is run on a special simulator, that simulator can detect the recursion after just a few calls and call it non-halting. Okay, so what? That doesn't refute the proof: 1. You have not shown that X can return, with the correct answer, contrary to what the proof claims. The proof claims that specifically X cannot decide. 2. The X definition you have provided is not required or specified by the proof; the proof makes a general claim about all possible possible X functions that otherwise meet the criteria, including functions that do not simply execute Y. In other words, the runaway recursion itself is not a given. It is possible to have definitions of X which return a value, and for those cases, the proof shows that for any definition of X which returns, the value is incorrect. You have not disproved this. The above is a complete and accurate review of the main ideas in your work, free of any bias. If you want a different review, ask other people elsewhere. If you ask enough people in the world, someone will flatter your ears. My advice is, though: under no circumstances give them any money or let them stay in your home.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 12:50 -0500 |
| Subject | Re: Solution To The Halting Problem [ Accurate review? ] |
| Message-ID | <i8-dnb15wYusexP9nZ2dnUU7-SGdnZ2d@giganews.com> |
| In reply to | #32575 |
On 5/2/2021 12:39 PM, Kaz Kylheku wrote: > On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>> Usenet posts? >>>>>> >>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>> if everyone stops responding. >>>>>> >>>>> >>>>> We can ask him to stop. We can't prove that he will. >>>> >>>> The bigger question is when are my reviewers going to provide an >>>> accurate review? >>>> >>>> It is a fact that this infinite recursion detection criteria is correct: >>>> >>>> If the execution trace of function Y() shows: >>>> function X() is called twice in sequence from the same machine address >>>> of Y() >>>> with the same parameters to X() >>>> with no conditional branch or indexed jump instructions in Y() >>>> with no function call returns from X() >>>> then the function call from Y() to X() is infinitely recursive. >>> >>> This is only "right" from the perspective of an objective observation >>> that is not involved in the computation, and has no effect on it. >>> >>> The function X() cannot itself make this observation. X has access to >>> only its parameters, and its parameters do not carry any information >>> indicating to X that it has been called twice from the same address >>> or any such thing. How can they; the parameters are *always the same*. >>> Therefore they cannot distinguish the first call from the second call >>> from the third call ... >>> >>> A function having adcess to past execution traces is an imperative >>> procedure, which is completely invalid. >> >> This is ridiculous, it is just like saying that I must be wrong on the >> basis that you really believe that I am wrong. >> >> You have to concretely prove these dogmatic statements. When you attempt > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > 1. You're trying to refute a proof which has a similar structure to the > X and Y arrangement above. > > 2. In that proof, the entities corresponding to X and Y are functions, > and not imperative procedures. They have no access to some global, > mutating state holding execution traces; such a situation would > violate the conditions of the proof. > > 3. The proof says, specifically, that X cannot decide the halting situation. > Either X returns the wrong value, or does not return. > (The proof does not say that the situation's halting is not decidable, > as such; it most certainly is decidable.) > > You've come along claiming the obvious: "Look, the situation is > decidable. If I supply a definition of X which simply executes Y, then X > does not return because X and Y are caught in an infinite recursion. > If X and Y are implemented in C and the machine code is run on a special > simulator, that simulator can detect the recursion after just a few > calls and call it non-halting. > > Okay, so what? That doesn't refute the proof: > > 1. You have not shown that X can return, with the correct answer, > contrary to what the proof claims. The proof claims that specifically > X cannot decide. > > 2. The X definition you have provided is not required or specified by > the proof; the proof makes a general claim about all possible > possible X functions that otherwise meet the criteria, including > functions that do not simply execute Y. In other words, the runaway > recursion itself is not a given. It is possible to have definitions > of X which return a value, and for those cases, the proof shows that > for any definition of X which returns, the value is incorrect. > You have not disproved this. > > The above is a complete and accurate review of the main ideas in your > work, free of any bias. > > If you want a different review, ask other people elsewhere. > > If you ask enough people in the world, someone will flatter your ears. > > My advice is, though: under no circumstances give them any money > or let them stay in your home. > -- 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-02 12:55 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <1O2dncbvMtfmehP9nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #32577 |
On 5/2/2021 12:50 PM, olcott wrote: > On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>> Usenet posts? >>>>>>> >>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>> if everyone stops responding. >>>>>>> >>>>>> >>>>>> We can ask him to stop. We can't prove that he will. >>>>> >>>>> The bigger question is when are my reviewers going to provide an >>>>> accurate review? >>>>> >>>>> It is a fact that this infinite recursion detection criteria is >>>>> correct: >>>>> >>>>> If the execution trace of function Y() shows: >>>>> function X() is called twice in sequence from the same machine address >>>>> of Y() >>>>> with the same parameters to X() >>>>> with no conditional branch or indexed jump instructions in Y() >>>>> with no function call returns from X() >>>>> then the function call from Y() to X() is infinitely recursive. >>>> >>>> This is only "right" from the perspective of an objective observation >>>> that is not involved in the computation, and has no effect on it. >>>> >>>> The function X() cannot itself make this observation. X has access to >>>> only its parameters, and its parameters do not carry any information >>>> indicating to X that it has been called twice from the same address >>>> or any such thing. How can they; the parameters are *always the same*. >>>> Therefore they cannot distinguish the first call from the second call >>>> from the third call ... >>>> >>>> A function having adcess to past execution traces is an imperative >>>> procedure, which is completely invalid. >>> >>> This is ridiculous, it is just like saying that I must be wrong on the >>> basis that you really believe that I am wrong. >>> >>> You have to concretely prove these dogmatic statements. When you attempt >> > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > > > >> 1. You're trying to refute a proof which has a similar structure to the >> X and Y arrangement above. >> >> 2. In that proof, the entities corresponding to X and Y are functions, >> and not imperative procedures. They have no access to some global, >> mutating state holding execution traces; such a situation would >> violate the conditions of the proof. So you are saying that an adapted UTM that recognizes the infinite recursion pattern of its input, stops simulating its input on this basis, and decides not halting on this input, IS SIMPLY NOT ALLOWED ? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-05-02 19:14 +0100 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <XZBjI.238624$ON31.117065@fx23.ams4> |
| In reply to | #32580 |
On 02/05/2021 18:55, olcott wrote: > On 5/2/2021 12:50 PM, olcott wrote: >> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>> Usenet posts? >>>>>>>> >>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>> if everyone stops responding. >>>>>>>> >>>>>>> >>>>>>> We can ask him to stop. We can't prove that he will. >>>>>> >>>>>> The bigger question is when are my reviewers going to provide an >>>>>> accurate review? >>>>>> >>>>>> It is a fact that this infinite recursion detection criteria is correct: >>>>>> >>>>>> If the execution trace of function Y() shows: >>>>>> function X() is called twice in sequence from the same machine address >>>>>> of Y() >>>>>> with the same parameters to X() >>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>> with no function call returns from X() >>>>>> then the function call from Y() to X() is infinitely recursive. >>>>> >>>>> This is only "right" from the perspective of an objective observation >>>>> that is not involved in the computation, and has no effect on it. >>>>> >>>>> The function X() cannot itself make this observation. X has access to >>>>> only its parameters, and its parameters do not carry any information >>>>> indicating to X that it has been called twice from the same address >>>>> or any such thing. How can they; the parameters are *always the same*. >>>>> Therefore they cannot distinguish the first call from the second call >>>>> from the third call ... >>>>> >>>>> A function having adcess to past execution traces is an imperative >>>>> procedure, which is completely invalid. >>>> >>>> This is ridiculous, it is just like saying that I must be wrong on the >>>> basis that you really believe that I am wrong. >>>> >>>> You have to concretely prove these dogmatic statements. When you attempt >>> >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >> >> >> >>> 1. You're trying to refute a proof which has a similar structure to the >>> X and Y arrangement above. >>> >>> 2. In that proof, the entities corresponding to X and Y are functions, >>> and not imperative procedures. They have no access to some global, >>> mutating state holding execution traces; such a situation would >>> violate the conditions of the proof. > > So you are saying that an adapted UTM that recognizes the infinite recursion > pattern of its input, stops simulating its input on this basis, and decides not > halting on this input, > > IS SIMPLY NOT ALLOWED ? Your solution cannot recognize infinite recursion because your solution disregards branching logic and state that branching logic is predicated on. In general an algorithm contains LOGIC acting on STATE and the longer you continue to ignore this fact the more time you will waste (in addition to wasting the time of people reading and replying to your Usenet posts). I pity you and your obtuseness. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 13:18 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <JfudnXsrH95scRP9nZ2dnUU7-I2dnZ2d@giganews.com> |
| In reply to | #32581 |
On 5/2/2021 1:14 PM, Mr Flibble wrote: > On 02/05/2021 18:55, olcott wrote: >> On 5/2/2021 12:50 PM, olcott wrote: >>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>> Usenet posts? >>>>>>>>> >>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>> and empirically untested hypothesis about an early halt that >>>>>>>>> occurs >>>>>>>>> if everyone stops responding. >>>>>>>>> >>>>>>>> >>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>> >>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>> accurate review? >>>>>>> >>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>> correct: >>>>>>> >>>>>>> If the execution trace of function Y() shows: >>>>>>> function X() is called twice in sequence from the same machine >>>>>>> address >>>>>>> of Y() >>>>>>> with the same parameters to X() >>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>> with no function call returns from X() >>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>> >>>>>> This is only "right" from the perspective of an objective observation >>>>>> that is not involved in the computation, and has no effect on it. >>>>>> >>>>>> The function X() cannot itself make this observation. X has access to >>>>>> only its parameters, and its parameters do not carry any information >>>>>> indicating to X that it has been called twice from the same address >>>>>> or any such thing. How can they; the parameters are *always the >>>>>> same*. >>>>>> Therefore they cannot distinguish the first call from the second call >>>>>> from the third call ... >>>>>> >>>>>> A function having adcess to past execution traces is an imperative >>>>>> procedure, which is completely invalid. >>>>> >>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>> basis that you really believe that I am wrong. >>>>> >>>>> You have to concretely prove these dogmatic statements. When you >>>>> attempt >>>> >>> >>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>> >>> >>> >>>> 1. You're trying to refute a proof which has a similar structure to the >>>> X and Y arrangement above. >>>> >>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>> and not imperative procedures. They have no access to some global, >>>> mutating state holding execution traces; such a situation would >>>> violate the conditions of the proof. >> >> So you are saying that an adapted UTM that recognizes the infinite >> recursion pattern of its input, stops simulating its input on this >> basis, and decides not halting on this input, >> >> IS SIMPLY NOT ALLOWED ? > > Your solution cannot recognize infinite recursion because your solution > disregards branching logic and state that branching logic is predicated on. > This is provably false: It is a fact that this infinite recursion detection criteria is correct: If the execution trace of function Y() shows: function X() is called twice in sequence from the same machine address of Y() with the same parameters to X() with no conditional branch or indexed jump instructions in Y() with no function call returns from X() then the function call from Y() to X() is infinitely recursive. If the execution trace of H_Hat() by function Halts() shows: (1) Function Halts() is called twice in sequence from the same machine address of H_Hat(). (2) With the same parameters to Halts(). (3) With no conditional branch or indexed jump instructions in H_Hat(). (4) With no function call returns from Halts(). then the function call from H_Hat() to Halts() is infinitely recursive. > In general an algorithm contains LOGIC acting on STATE and the longer > you continue to ignore this fact the more time you will waste (in > addition to wasting the time of people reading and replying to your > Usenet posts). I pity you and your obtuseness. > > /Flibble > -- 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-02 14:40 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <KmCjI.23563$ft1.16223@fx10.iad> |
| In reply to | #32582 |
On 5/2/21 2:18 PM, olcott wrote: > On 5/2/2021 1:14 PM, Mr Flibble wrote: >> On 02/05/2021 18:55, olcott wrote: >>> On 5/2/2021 12:50 PM, olcott wrote: >>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> >>>>>>>>>> wrote: >>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>> Usenet posts? >>>>>>>>>> >>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>> and empirically untested hypothesis about an early halt that >>>>>>>>>> occurs >>>>>>>>>> if everyone stops responding. >>>>>>>>>> >>>>>>>>> >>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>> >>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>> accurate review? >>>>>>>> >>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>> correct: >>>>>>>> >>>>>>>> If the execution trace of function Y() shows: >>>>>>>> function X() is called twice in sequence from the same machine >>>>>>>> address >>>>>>>> of Y() >>>>>>>> with the same parameters to X() >>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>> with no function call returns from X() >>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>> >>>>>>> This is only "right" from the perspective of an objective >>>>>>> observation >>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>> >>>>>>> The function X() cannot itself make this observation. X has >>>>>>> access to >>>>>>> only its parameters, and its parameters do not carry any information >>>>>>> indicating to X that it has been called twice from the same address >>>>>>> or any such thing. How can they; the parameters are *always the >>>>>>> same*. >>>>>>> Therefore they cannot distinguish the first call from the second >>>>>>> call >>>>>>> from the third call ... >>>>>>> >>>>>>> A function having adcess to past execution traces is an imperative >>>>>>> procedure, which is completely invalid. >>>>>> >>>>>> This is ridiculous, it is just like saying that I must be wrong on >>>>>> the >>>>>> basis that you really believe that I am wrong. >>>>>> >>>>>> You have to concretely prove these dogmatic statements. When you >>>>>> attempt >>>>> >>>> >>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>> >>>> >>>> >>>>> 1. You're trying to refute a proof which has a similar structure to >>>>> the >>>>> X and Y arrangement above. >>>>> >>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>> and not imperative procedures. They have no access to some global, >>>>> mutating state holding execution traces; such a situation would >>>>> violate the conditions of the proof. >>> >>> So you are saying that an adapted UTM that recognizes the infinite >>> recursion pattern of its input, stops simulating its input on this >>> basis, and decides not halting on this input, >>> >>> IS SIMPLY NOT ALLOWED ? >> >> Your solution cannot recognize infinite recursion because your >> solution disregards branching logic and state that branching logic is >> predicated on. >> > This is provably false: > > It is a fact that this infinite recursion detection criteria is correct: > If the execution trace of function Y() shows: > function X() is called twice in sequence from the same machine address > of Y() > with the same parameters to X() > with no conditional branch or indexed jump instructions in Y() > with no function call returns from X() > then the function call from Y() to X() is infinitely recursive. > No, that is incorrect, because it ignores that the X() called by Y() is running within the compuation of Y, so any decision it makes is part of the computation of Y(), thus if X() will terminate the loop, Y() is not infinitely recursive. Maybe you are inventing a new definition, but it doesn't apply to this problem. > > If the execution trace of H_Hat() by function Halts() shows: > (1) Function Halts() is called twice in sequence from the same machine > address of H_Hat(). > (2) With the same parameters to Halts(). > (3) With no conditional branch or indexed jump instructions in H_Hat(). > (4) With no function call returns from Halts(). > then the function call from H_Hat() to Halts() is infinitely recursive. > > >> In general an algorithm contains LOGIC acting on STATE and the longer >> you continue to ignore this fact the more time you will waste (in >> addition to wasting the time of people reading and replying to your >> Usenet posts). I pity you and your obtuseness. >> >> /Flibble >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 14:30 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <esadneLcfuVVYBP9nZ2dnUU78N3NnZ2d@giganews.com> |
| In reply to | #32584 |
On 5/2/2021 1:40 PM, Richard Damon wrote:
> On 5/2/21 2:18 PM, olcott wrote:
>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>> On 02/05/2021 18:55, olcott wrote:
>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>> wrote:
>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's
>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>
>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven
>>>>>>>>>>> and empirically untested hypothesis about an early halt that
>>>>>>>>>>> occurs
>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>
>>>>>>>>> The bigger question is when are my reviewers going to provide an
>>>>>>>>> accurate review?
>>>>>>>>>
>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>> correct:
>>>>>>>>>
>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>> address
>>>>>>>>> of Y()
>>>>>>>>> with the same parameters to X()
>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>> with no function call returns from X()
>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>
>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>> observation
>>>>>>>> that is not involved in the computation, and has no effect on it.
>>>>>>>>
>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>> access to
>>>>>>>> only its parameters, and its parameters do not carry any information
>>>>>>>> indicating to X that it has been called twice from the same address
>>>>>>>> or any such thing. How can they; the parameters are *always the
>>>>>>>> same*.
>>>>>>>> Therefore they cannot distinguish the first call from the second
>>>>>>>> call
>>>>>>>> from the third call ...
>>>>>>>>
>>>>>>>> A function having adcess to past execution traces is an imperative
>>>>>>>> procedure, which is completely invalid.
>>>>>>>
>>>>>>> This is ridiculous, it is just like saying that I must be wrong on
>>>>>>> the
>>>>>>> basis that you really believe that I am wrong.
>>>>>>>
>>>>>>> You have to concretely prove these dogmatic statements. When you
>>>>>>> attempt
>>>>>>
>>>>>
>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>
>>>>>
>>>>>
>>>>>> 1. You're trying to refute a proof which has a similar structure to
>>>>>> the
>>>>>> X and Y arrangement above.
>>>>>>
>>>>>> 2. In that proof, the entities corresponding to X and Y are functions,
>>>>>> and not imperative procedures. They have no access to some global,
>>>>>> mutating state holding execution traces; such a situation would
>>>>>> violate the conditions of the proof.
>>>>
>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>> recursion pattern of its input, stops simulating its input on this
>>>> basis, and decides not halting on this input,
>>>>
>>>> IS SIMPLY NOT ALLOWED ?
>>>
>>> Your solution cannot recognize infinite recursion because your
>>> solution disregards branching logic and state that branching logic is
>>> predicated on.
>>>
>> This is provably false:
>>
>> It is a fact that this infinite recursion detection criteria is correct:
>> If the execution trace of function Y() shows:
>> function X() is called twice in sequence from the same machine address
>> of Y()
>> with the same parameters to X()
>> with no conditional branch or indexed jump instructions in Y()
>> with no function call returns from X()
>> then the function call from Y() to X() is infinitely recursive.
>>
>
> No, that is incorrect, because it ignores that the X() called by Y() is
> running within the compuation of Y, so any decision it makes is part of
> the computation of Y(), thus if X() will terminate the loop, Y() is not
> infinitely recursive.
>
> Maybe you are inventing a new definition, but it doesn't apply to this
> problem.
To simplify things a bit more...
H_Hat2(u32 P)
{
Simulate(P, P);
}
int main()
{
Simulate(H_Hat2, H_Hat2);
H_Hat2(H_Hat2);
}
Both copmutations specified on line 1 and 2 of main() specify infinite
recursion.
If Simulate() had enough intelligence to see this infinite recursion
so that it could stop its simulation, both lines 1 and 2 of main()
still specify infinite recursion that will never stop unless the
simulation is halted at some point.
>>
>> If the execution trace of H_Hat() by function Halts() shows:
>> (1) Function Halts() is called twice in sequence from the same machine
>> address of H_Hat().
>> (2) With the same parameters to Halts().
>> (3) With no conditional branch or indexed jump instructions in H_Hat().
>> (4) With no function call returns from Halts().
>> then the function call from H_Hat() to Halts() is infinitely recursive.
>>
>>
>>> In general an algorithm contains LOGIC acting on STATE and the longer
>>> you continue to ignore this fact the more time you will waste (in
>>> addition to wasting the time of people reading and replying to your
>>> Usenet posts). I pity you and your obtuseness.
>>>
>>> /Flibble
>>>
>>
>>
>
--
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-02 15:58 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <yvDjI.185056$J_5.21950@fx46.iad> |
| In reply to | #32586 |
On 5/2/21 3:30 PM, olcott wrote:
> On 5/2/2021 1:40 PM, Richard Damon wrote:
>> On 5/2/21 2:18 PM, olcott wrote:
>>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>>> On 02/05/2021 18:55, olcott wrote:
>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>>> wrote:
>>>>>>>>>>>>> Does anyone know the solution to the problem of halting
>>>>>>>>>>>>> olcott's
>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>
>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an
>>>>>>>>>>>> unproven
>>>>>>>>>>>> and empirically untested hypothesis about an early halt that
>>>>>>>>>>>> occurs
>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>
>>>>>>>>>> The bigger question is when are my reviewers going to provide an
>>>>>>>>>> accurate review?
>>>>>>>>>>
>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>> correct:
>>>>>>>>>>
>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>>> address
>>>>>>>>>> of Y()
>>>>>>>>>> with the same parameters to X()
>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>> with no function call returns from X()
>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>
>>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>>> observation
>>>>>>>>> that is not involved in the computation, and has no effect on it.
>>>>>>>>>
>>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>>> access to
>>>>>>>>> only its parameters, and its parameters do not carry any
>>>>>>>>> information
>>>>>>>>> indicating to X that it has been called twice from the same
>>>>>>>>> address
>>>>>>>>> or any such thing. How can they; the parameters are *always the
>>>>>>>>> same*.
>>>>>>>>> Therefore they cannot distinguish the first call from the second
>>>>>>>>> call
>>>>>>>>> from the third call ...
>>>>>>>>>
>>>>>>>>> A function having adcess to past execution traces is an imperative
>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>
>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on
>>>>>>>> the
>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>
>>>>>>>> You have to concretely prove these dogmatic statements. When you
>>>>>>>> attempt
>>>>>>>
>>>>>>
>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>> 1. You're trying to refute a proof which has a similar structure to
>>>>>>> the
>>>>>>> X and Y arrangement above.
>>>>>>>
>>>>>>> 2. In that proof, the entities corresponding to X and Y are
>>>>>>> functions,
>>>>>>> and not imperative procedures. They have no access to some
>>>>>>> global,
>>>>>>> mutating state holding execution traces; such a situation would
>>>>>>> violate the conditions of the proof.
>>>>>
>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>> recursion pattern of its input, stops simulating its input on this
>>>>> basis, and decides not halting on this input,
>>>>>
>>>>> IS SIMPLY NOT ALLOWED ?
>>>>
>>>> Your solution cannot recognize infinite recursion because your
>>>> solution disregards branching logic and state that branching logic is
>>>> predicated on.
>>>>
>>> This is provably false:
>>>
>>> It is a fact that this infinite recursion detection criteria is correct:
>>> If the execution trace of function Y() shows:
>>> function X() is called twice in sequence from the same machine address
>>> of Y()
>>> with the same parameters to X()
>>> with no conditional branch or indexed jump instructions in Y()
>>> with no function call returns from X()
>>> then the function call from Y() to X() is infinitely recursive.
>>>
>>
>> No, that is incorrect, because it ignores that the X() called by Y() is
>> running within the compuation of Y, so any decision it makes is part of
>> the computation of Y(), thus if X() will terminate the loop, Y() is not
>> infinitely recursive.
>>
>> Maybe you are inventing a new definition, but it doesn't apply to this
>> problem.
>
>
> To simplify things a bit more...
>
>
> H_Hat2(u32 P)
> {
> Simulate(P, P);
> }
>
> int main()
> {
> Simulate(H_Hat2, H_Hat2);
> H_Hat2(H_Hat2);
> }
>
> Both copmutations specified on line 1 and 2 of main() specify infinite
> recursion.
>
> If Simulate() had enough intelligence to see this infinite recursion
> so that it could stop its simulation, both lines 1 and 2 of main()
> still specify infinite recursion that will never stop unless the
> simulation is halted at some point.
>
No argument that H_Hat2 using Simulate in non-Halting IF Simulate is a
real simulator. The 'proof' of infinite execution is BASED on the
Simulator not stopping.
If Simulate was 'smart enough to stop Simulating' it wouldn't be a
proper simulator, as it didn't simulate the infinite loop, thus the
infinite loop proofs don't apply.
Since we KNOW (from your stipulations) that Halts will terminate its
simulation of H_Hat, H_Hat is a Halting Computation.
If Simulate is smart enough to stop simulating, then H_Hat2 is too,
since it does stop.
Sounds like a straw-man to me.
The key point is that when H_Hat uses Halts to decide on its input, then
Halts decision that it think the input is non-halting is a decision by
the algorithm of H_Hat to stop, and thus we don't have an infinite
execution in H_Hat, but a finite one.
Using a Simulator that doesn't meet the full definition of a Simulator
doesn't prove anything.
>>>
>>> If the execution trace of H_Hat() by function Halts() shows:
>>> (1) Function Halts() is called twice in sequence from the same machine
>>> address of H_Hat().
>>> (2) With the same parameters to Halts().
>>> (3) With no conditional branch or indexed jump instructions in H_Hat().
>>> (4) With no function call returns from Halts().
>>> then the function call from H_Hat() to Halts() is infinitely recursive.
>>>
>>>
>>>> In general an algorithm contains LOGIC acting on STATE and the longer
>>>> you continue to ignore this fact the more time you will waste (in
>>>> addition to wasting the time of people reading and replying to your
>>>> Usenet posts). I pity you and your obtuseness.
>>>>
>>>> /Flibble
>>>>
>>>
>>>
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-02 22:49 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <vcednVn3Tdki7xL9nZ2dnUU7-XfNnZ2d@giganews.com> |
| In reply to | #32591 |
On 5/2/2021 2:58 PM, Richard Damon wrote:
> On 5/2/21 3:30 PM, olcott wrote:
>> On 5/2/2021 1:40 PM, Richard Damon wrote:
>>> On 5/2/21 2:18 PM, olcott wrote:
>>>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>>>> On 02/05/2021 18:55, olcott wrote:
>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting
>>>>>>>>>>>>>> olcott's
>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>
>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an
>>>>>>>>>>>>> unproven
>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that
>>>>>>>>>>>>> occurs
>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>
>>>>>>>>>>> The bigger question is when are my reviewers going to provide an
>>>>>>>>>>> accurate review?
>>>>>>>>>>>
>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>>> correct:
>>>>>>>>>>>
>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>>>> address
>>>>>>>>>>> of Y()
>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>>
>>>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>>>> observation
>>>>>>>>>> that is not involved in the computation, and has no effect on it.
>>>>>>>>>>
>>>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>>>> access to
>>>>>>>>>> only its parameters, and its parameters do not carry any
>>>>>>>>>> information
>>>>>>>>>> indicating to X that it has been called twice from the same
>>>>>>>>>> address
>>>>>>>>>> or any such thing. How can they; the parameters are *always the
>>>>>>>>>> same*.
>>>>>>>>>> Therefore they cannot distinguish the first call from the second
>>>>>>>>>> call
>>>>>>>>>> from the third call ...
>>>>>>>>>>
>>>>>>>>>> A function having adcess to past execution traces is an imperative
>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>
>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on
>>>>>>>>> the
>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>
>>>>>>>>> You have to concretely prove these dogmatic statements. When you
>>>>>>>>> attempt
>>>>>>>>
>>>>>>>
>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>> 1. You're trying to refute a proof which has a similar structure to
>>>>>>>> the
>>>>>>>> X and Y arrangement above.
>>>>>>>>
>>>>>>>> 2. In that proof, the entities corresponding to X and Y are
>>>>>>>> functions,
>>>>>>>> and not imperative procedures. They have no access to some
>>>>>>>> global,
>>>>>>>> mutating state holding execution traces; such a situation would
>>>>>>>> violate the conditions of the proof.
>>>>>>
>>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>>> recursion pattern of its input, stops simulating its input on this
>>>>>> basis, and decides not halting on this input,
>>>>>>
>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>
>>>>> Your solution cannot recognize infinite recursion because your
>>>>> solution disregards branching logic and state that branching logic is
>>>>> predicated on.
>>>>>
>>>> This is provably false:
>>>>
>>>> It is a fact that this infinite recursion detection criteria is correct:
>>>> If the execution trace of function Y() shows:
>>>> function X() is called twice in sequence from the same machine address
>>>> of Y()
>>>> with the same parameters to X()
>>>> with no conditional branch or indexed jump instructions in Y()
>>>> with no function call returns from X()
>>>> then the function call from Y() to X() is infinitely recursive.
>>>>
>>>
>>> No, that is incorrect, because it ignores that the X() called by Y() is
>>> running within the compuation of Y, so any decision it makes is part of
>>> the computation of Y(), thus if X() will terminate the loop, Y() is not
>>> infinitely recursive.
>>>
>>> Maybe you are inventing a new definition, but it doesn't apply to this
>>> problem.
>>
>>
>> To simplify things a bit more...
>>
>>
>> H_Hat2(u32 P)
>> {
>> Simulate(P, P);
>> }
>>
>> int main()
>> {
>> Simulate(H_Hat2, H_Hat2);
>> H_Hat2(H_Hat2);
>> }
>>
>> Both copmutations specified on line 1 and 2 of main() specify infinite
>> recursion.
>>
>> If Simulate() had enough intelligence to see this infinite recursion
>> so that it could stop its simulation, both lines 1 and 2 of main()
>> still specify infinite recursion that will never stop unless the
>> simulation is halted at some point.
>>
>
> No argument that H_Hat2 using Simulate in non-Halting IF Simulate is a
> real simulator. The 'proof' of infinite execution is BASED on the
> Simulator not stopping.
>
> If Simulate was 'smart enough to stop Simulating' it wouldn't be a
> proper simulator, as it didn't simulate the infinite loop, thus the
> infinite loop proofs don't apply.
>
> Since we KNOW (from your stipulations) that Halts will terminate its
> simulation of H_Hat, H_Hat is a Halting Computation.
>
> If Simulate is smart enough to stop simulating, then H_Hat2 is too,
> since it does stop.
>
> Sounds like a straw-man to me.
>
> The key point is that when H_Hat uses Halts to decide on its input, then
> Halts decision that it think the input is non-halting is a decision by
> the algorithm of H_Hat to stop, and thus we don't have an infinite
> execution in H_Hat, but a finite one.
>
> Using a Simulator that doesn't meet the full definition of a Simulator
> doesn't prove anything.
>
Hypothesizing that a full halt decider exists this would be true:
When we conflate the behavior of the halt decider with the behavior of
its input then every full halt decider based on simulating its input
must report that every element of the infinite set of Turing machine
descriptions halts because the ones that do not halt are forced to halt
by this full halt decider when it stops simulating them.
On the other hand when we do not conflate the behavior of the full halt
decider with the behavior of its input then a full halt decider would
correctly decide not halting on every input would never halt unless this
full halt decider stopped simulating it.
void Infinite_Loop()
{
HERE: goto HERE;
}
int Infinite_Recursion(u32 N)
{
Infinite_Recursion(N);
}
void H_Hat2(u32 P)
{
u32 Input_Would_Halt = Simulate(P, P);
}
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
}
int main()
{
u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
}
All of the above four computations only halt because Halts() stops
simulating them.
>>>>
>>>> If the execution trace of H_Hat() by function Halts() shows:
>>>> (1) Function Halts() is called twice in sequence from the same machine
>>>> address of H_Hat().
>>>> (2) With the same parameters to Halts().
>>>> (3) With no conditional branch or indexed jump instructions in H_Hat().
>>>> (4) With no function call returns from Halts().
>>>> then the function call from H_Hat() to Halts() is infinitely recursive.
>>>>
>>>>
>>>>> In general an algorithm contains LOGIC acting on STATE and the longer
>>>>> you continue to ignore this fact the more time you will waste (in
>>>>> addition to wasting the time of people reading and replying to your
>>>>> Usenet posts). I pity you and your obtuseness.
>>>>>
>>>>> /Flibble
>>>>>
>>>>
>>>>
>>>
>>
>>
>
--
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-03 06:42 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <asQjI.36344$7u1.26571@fx12.iad> |
| In reply to | #32609 |
On 5/2/21 11:49 PM, olcott wrote:
> On 5/2/2021 2:58 PM, Richard Damon wrote:
>> On 5/2/21 3:30 PM, olcott wrote:
>>> On 5/2/2021 1:40 PM, Richard Damon wrote:
>>>> On 5/2/21 2:18 PM, olcott wrote:
>>>>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>>>>> On 02/05/2021 18:55, olcott wrote:
>>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting
>>>>>>>>>>>>>>> olcott's
>>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an
>>>>>>>>>>>>>> unproven
>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that
>>>>>>>>>>>>>> occurs
>>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>>
>>>>>>>>>>>> The bigger question is when are my reviewers going to
>>>>>>>>>>>> provide an
>>>>>>>>>>>> accurate review?
>>>>>>>>>>>>
>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>>>> correct:
>>>>>>>>>>>>
>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>>>>> address
>>>>>>>>>>>> of Y()
>>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>>>
>>>>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>>>>> observation
>>>>>>>>>>> that is not involved in the computation, and has no effect on
>>>>>>>>>>> it.
>>>>>>>>>>>
>>>>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>>>>> access to
>>>>>>>>>>> only its parameters, and its parameters do not carry any
>>>>>>>>>>> information
>>>>>>>>>>> indicating to X that it has been called twice from the same
>>>>>>>>>>> address
>>>>>>>>>>> or any such thing. How can they; the parameters are *always the
>>>>>>>>>>> same*.
>>>>>>>>>>> Therefore they cannot distinguish the first call from the second
>>>>>>>>>>> call
>>>>>>>>>>> from the third call ...
>>>>>>>>>>>
>>>>>>>>>>> A function having adcess to past execution traces is an
>>>>>>>>>>> imperative
>>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>>
>>>>>>>>>> This is ridiculous, it is just like saying that I must be
>>>>>>>>>> wrong on
>>>>>>>>>> the
>>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>>
>>>>>>>>>> You have to concretely prove these dogmatic statements. When you
>>>>>>>>>> attempt
>>>>>>>>>
>>>>>>>>
>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>> 1. You're trying to refute a proof which has a similar
>>>>>>>>> structure to
>>>>>>>>> the
>>>>>>>>> X and Y arrangement above.
>>>>>>>>>
>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are
>>>>>>>>> functions,
>>>>>>>>> and not imperative procedures. They have no access to some
>>>>>>>>> global,
>>>>>>>>> mutating state holding execution traces; such a situation
>>>>>>>>> would
>>>>>>>>> violate the conditions of the proof.
>>>>>>>
>>>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>>>> recursion pattern of its input, stops simulating its input on this
>>>>>>> basis, and decides not halting on this input,
>>>>>>>
>>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>>
>>>>>> Your solution cannot recognize infinite recursion because your
>>>>>> solution disregards branching logic and state that branching logic is
>>>>>> predicated on.
>>>>>>
>>>>> This is provably false:
>>>>>
>>>>> It is a fact that this infinite recursion detection criteria is
>>>>> correct:
>>>>> If the execution trace of function Y() shows:
>>>>> function X() is called twice in sequence from the same machine address
>>>>> of Y()
>>>>> with the same parameters to X()
>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>> with no function call returns from X()
>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>
>>>>
>>>> No, that is incorrect, because it ignores that the X() called by Y() is
>>>> running within the compuation of Y, so any decision it makes is part of
>>>> the computation of Y(), thus if X() will terminate the loop, Y() is not
>>>> infinitely recursive.
>>>>
>>>> Maybe you are inventing a new definition, but it doesn't apply to this
>>>> problem.
>>>
>>>
>>> To simplify things a bit more...
>>>
>>>
>>> H_Hat2(u32 P)
>>> {
>>> Simulate(P, P);
>>> }
>>>
>>> int main()
>>> {
>>> Simulate(H_Hat2, H_Hat2);
>>> H_Hat2(H_Hat2);
>>> }
>>>
>>> Both copmutations specified on line 1 and 2 of main() specify infinite
>>> recursion.
>>>
>>> If Simulate() had enough intelligence to see this infinite recursion
>>> so that it could stop its simulation, both lines 1 and 2 of main()
>>> still specify infinite recursion that will never stop unless the
>>> simulation is halted at some point.
>>>
>>
>> No argument that H_Hat2 using Simulate in non-Halting IF Simulate is a
>> real simulator. The 'proof' of infinite execution is BASED on the
>> Simulator not stopping.
>>
>> If Simulate was 'smart enough to stop Simulating' it wouldn't be a
>> proper simulator, as it didn't simulate the infinite loop, thus the
>> infinite loop proofs don't apply.
>>
>> Since we KNOW (from your stipulations) that Halts will terminate its
>> simulation of H_Hat, H_Hat is a Halting Computation.
>>
>> If Simulate is smart enough to stop simulating, then H_Hat2 is too,
>> since it does stop.
>>
>> Sounds like a straw-man to me.
>>
>> The key point is that when H_Hat uses Halts to decide on its input, then
>> Halts decision that it think the input is non-halting is a decision by
>> the algorithm of H_Hat to stop, and thus we don't have an infinite
>> execution in H_Hat, but a finite one.
>>
>> Using a Simulator that doesn't meet the full definition of a Simulator
>> doesn't prove anything.
>>
>
> Hypothesizing that a full halt decider exists this would be true:
So you start with a false hypothesis.
>
> When we conflate the behavior of the halt decider with the behavior of
> its input then every full halt decider based on simulating its input
> must report that every element of the infinite set of Turing machine
> descriptions halts because the ones that do not halt are forced to halt
> by this full halt decider when it stops simulating them.
>
> On the other hand when we do not conflate the behavior of the full halt
> decider with the behavior of its input then a full halt decider would
> correctly decide not halting on every input would never halt unless this
> full halt decider stopped simulating it.
>
Who is conflating the behaviors? When we run the machine H_Hat as an
actual machine, and not simulating it under the decider, then it clearly
halts. Yes, part of this behavior is from the copy of the Halt Decider
within it, but that behavior IS part of H_Hat, not of a Decider trying
to decide on it. H_Hat does Halt, so it is a Halting Computation. No
funny words like it only halted because Halts stopped it make sense.
YOUR proof conflates the behavior of the sub-machine Halts within H_Hat
deciding on an input given to it by H_Hat, with the top level Decider
trying to decide on the machine H_Hat.
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> int Infinite_Recursion(u32 N)
> {
> Infinite_Recursion(N);
> }
>
> void H_Hat2(u32 P)
> {
> u32 Input_Would_Halt = Simulate(P, P);
> }
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> }
>
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> }
>
>
> All of the above four computations only halt because Halts() stops
> simulating them.
>
Wrong. H_Hat WILL stop when run as its own machine, and thus is a
Halting Computation. The fact that Halts can't determine this is the
fault of Halts.
1) Halts is stipulated to meet the requirements of a Halt Decider for
Computation Theory, as used in the proof of Linz and Sipser.
2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
asked directly.
3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
halt when the Halt decider it is built on decides H_Hat’s input is
non-Halting on itself.
4) 1 Means that Halts is a Computation, and will always return the same
answer (or never return an answer) for a given input.
5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
H_Hat)
6) by 4 and 2, this means that Halts will return the decision on
non-halting to H_Hat
7) By 3, this means that H_Hat will Halt.
You even proved this yourself by posting the trace that went all the way
to the end, showing that after the Halts inside H_Hat declared H_Hat
non-halting, it returned the answer and H_Hat halted:
On 4/27/21 12:55 AM, olcott wrote:
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
> [00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
> 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
> 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
> 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
> 00000938
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
> eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
> ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
> 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov
> [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
> [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 08:52 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <7bydnXCr38GXnQ39nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #32613 |
On 5/3/2021 5:42 AM, Richard Damon wrote:
> On 5/2/21 11:49 PM, olcott wrote:
>> On 5/2/2021 2:58 PM, Richard Damon wrote:
>>> On 5/2/21 3:30 PM, olcott wrote:
>>>> On 5/2/2021 1:40 PM, Richard Damon wrote:
>>>>> On 5/2/21 2:18 PM, olcott wrote:
>>>>>> On 5/2/2021 1:14 PM, Mr Flibble wrote:
>>>>>>> On 02/05/2021 18:55, olcott wrote:
>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote:
>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting
>>>>>>>>>>>>>>>> olcott's
>>>>>>>>>>>>>>>> Usenet posts?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an
>>>>>>>>>>>>>>> unproven
>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that
>>>>>>>>>>>>>>> occurs
>>>>>>>>>>>>>>> if everyone stops responding.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will.
>>>>>>>>>>>>>
>>>>>>>>>>>>> The bigger question is when are my reviewers going to
>>>>>>>>>>>>> provide an
>>>>>>>>>>>>> accurate review?
>>>>>>>>>>>>>
>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>>>>>>>>> correct:
>>>>>>>>>>>>>
>>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>>> function X() is called twice in sequence from the same machine
>>>>>>>>>>>>> address
>>>>>>>>>>>>> of Y()
>>>>>>>>>>>>> with the same parameters to X()
>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>>>>>>>>> with no function call returns from X()
>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>>>>>>>
>>>>>>>>>>>> This is only "right" from the perspective of an objective
>>>>>>>>>>>> observation
>>>>>>>>>>>> that is not involved in the computation, and has no effect on
>>>>>>>>>>>> it.
>>>>>>>>>>>>
>>>>>>>>>>>> The function X() cannot itself make this observation. X has
>>>>>>>>>>>> access to
>>>>>>>>>>>> only its parameters, and its parameters do not carry any
>>>>>>>>>>>> information
>>>>>>>>>>>> indicating to X that it has been called twice from the same
>>>>>>>>>>>> address
>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the
>>>>>>>>>>>> same*.
>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second
>>>>>>>>>>>> call
>>>>>>>>>>>> from the third call ...
>>>>>>>>>>>>
>>>>>>>>>>>> A function having adcess to past execution traces is an
>>>>>>>>>>>> imperative
>>>>>>>>>>>> procedure, which is completely invalid.
>>>>>>>>>>>
>>>>>>>>>>> This is ridiculous, it is just like saying that I must be
>>>>>>>>>>> wrong on
>>>>>>>>>>> the
>>>>>>>>>>> basis that you really believe that I am wrong.
>>>>>>>>>>>
>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you
>>>>>>>>>>> attempt
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>>> 1. You're trying to refute a proof which has a similar
>>>>>>>>>> structure to
>>>>>>>>>> the
>>>>>>>>>> X and Y arrangement above.
>>>>>>>>>>
>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are
>>>>>>>>>> functions,
>>>>>>>>>> and not imperative procedures. They have no access to some
>>>>>>>>>> global,
>>>>>>>>>> mutating state holding execution traces; such a situation
>>>>>>>>>> would
>>>>>>>>>> violate the conditions of the proof.
>>>>>>>>
>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite
>>>>>>>> recursion pattern of its input, stops simulating its input on this
>>>>>>>> basis, and decides not halting on this input,
>>>>>>>>
>>>>>>>> IS SIMPLY NOT ALLOWED ?
>>>>>>>
>>>>>>> Your solution cannot recognize infinite recursion because your
>>>>>>> solution disregards branching logic and state that branching logic is
>>>>>>> predicated on.
>>>>>>>
>>>>>> This is provably false:
>>>>>>
>>>>>> It is a fact that this infinite recursion detection criteria is
>>>>>> correct:
>>>>>> If the execution trace of function Y() shows:
>>>>>> function X() is called twice in sequence from the same machine address
>>>>>> of Y()
>>>>>> with the same parameters to X()
>>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>>> with no function call returns from X()
>>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>>>
>>>>>
>>>>> No, that is incorrect, because it ignores that the X() called by Y() is
>>>>> running within the compuation of Y, so any decision it makes is part of
>>>>> the computation of Y(), thus if X() will terminate the loop, Y() is not
>>>>> infinitely recursive.
>>>>>
>>>>> Maybe you are inventing a new definition, but it doesn't apply to this
>>>>> problem.
>>>>
>>>>
>>>> To simplify things a bit more...
>>>>
>>>>
>>>> H_Hat2(u32 P)
>>>> {
>>>> Simulate(P, P);
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> Simulate(H_Hat2, H_Hat2);
>>>> H_Hat2(H_Hat2);
>>>> }
>>>>
>>>> Both copmutations specified on line 1 and 2 of main() specify infinite
>>>> recursion.
>>>>
>>>> If Simulate() had enough intelligence to see this infinite recursion
>>>> so that it could stop its simulation, both lines 1 and 2 of main()
>>>> still specify infinite recursion that will never stop unless the
>>>> simulation is halted at some point.
>>>>
>>>
>>> No argument that H_Hat2 using Simulate in non-Halting IF Simulate is a
>>> real simulator. The 'proof' of infinite execution is BASED on the
>>> Simulator not stopping.
>>>
>>> If Simulate was 'smart enough to stop Simulating' it wouldn't be a
>>> proper simulator, as it didn't simulate the infinite loop, thus the
>>> infinite loop proofs don't apply.
>>>
>>> Since we KNOW (from your stipulations) that Halts will terminate its
>>> simulation of H_Hat, H_Hat is a Halting Computation.
>>>
>>> If Simulate is smart enough to stop simulating, then H_Hat2 is too,
>>> since it does stop.
>>>
>>> Sounds like a straw-man to me.
>>>
>>> The key point is that when H_Hat uses Halts to decide on its input, then
>>> Halts decision that it think the input is non-halting is a decision by
>>> the algorithm of H_Hat to stop, and thus we don't have an infinite
>>> execution in H_Hat, but a finite one.
>>>
>>> Using a Simulator that doesn't meet the full definition of a Simulator
>>> doesn't prove anything.
>>>
>>
>> Hypothesizing that a full halt decider exists this would be true:
>
> So you start with a false hypothesis.
>>
>> When we conflate the behavior of the halt decider with the behavior of
>> its input then every full halt decider based on simulating its input
>> must report that every element of the infinite set of Turing machine
>> descriptions halts because the ones that do not halt are forced to halt
>> by this full halt decider when it stops simulating them.
>>
>> On the other hand when we do not conflate the behavior of the full halt
>> decider with the behavior of its input then a full halt decider would
>> correctly decide not halting on every input would never halt unless this
>> full halt decider stopped simulating it.
>>
>
> Who is conflating the behaviors? When we run the machine H_Hat as an
> actual machine, and not simulating it under the decider, then it clearly
> halts. Yes, part of this behavior is from the copy of the Halt Decider
> within it, but that behavior IS part of H_Hat, not of a Decider trying
> to decide on it. H_Hat does Halt, so it is a Halting Computation. No
> funny words like it only halted because Halts stopped it make sense.
>
> YOUR proof conflates the behavior of the sub-machine Halts within H_Hat
> deciding on an input given to it by H_Hat, with the top level Decider
> trying to decide on the machine H_Hat.
>
I told you this is <Not> the sceneraio that I am analyzing.
I don't know how H_Hat would behave under this scenario. Once we get
done with the scenario that I am analyzing we can get back to this other
one.
Until then I will consider this a dishonest dodge attempt to avoid the
point. An honest dialogue requires points of mutual agreement. Changing
the subject so that we do not reach any points of mutual agreement is a
dishonest dodge.
>>
>> void Infinite_Loop()
>> {
>> HERE: goto HERE;
>> }
>>
>> int Infinite_Recursion(u32 N)
>> {
>> Infinite_Recursion(N);
>> }
>>
>> void H_Hat2(u32 P)
>> {
>> u32 Input_Would_Halt = Simulate(P, P);
>> }
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> }
>>
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
>> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
>> u32 Input_Would_Halt = Halts((u32)H_Hat2, (u32)H_Hat2);
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> }
>>
>>
>> All of the above four computations only halt because Halts() stops
>> simulating them.
>>
>
> Wrong. H_Hat WILL stop when run as its own machine, and thus is a
> Halting Computation. The fact that Halts can't determine this is the
> fault of Halts.
>
>
> 1) Halts is stipulated to meet the requirements of a Halt Decider for
> Computation Theory, as used in the proof of Linz and Sipser.
>
> 2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
> asked directly.
>
> 3) H_Hat is stipulated to be built like Linz or Sipser, in that it will
> halt when the Halt decider it is built on decides H_Hat’s input is
> non-Halting on itself.
>
> 4) 1 Means that Halts is a Computation, and will always return the same
> answer (or never return an answer) for a given input.
>
> 5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
> H_Hat)
>
> 6) by 4 and 2, this means that Halts will return the decision on
> non-halting to H_Hat
>
> 7) By 3, this means that H_Hat will Halt.
>
>
>
> You even proved this yourself by posting the trace that went all the way
> to the end, showing that after the Halts inside H_Hat declared H_Hat
> non-halting, it returned the answer and H_Hat halted:
>
>
> On 4/27/21 12:55 AM, olcott wrote:
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>>
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> }
>>
>>
>> _H_Hat()
>> [00000b98](01) 55 push ebp
>> [00000b99](02) 8bec mov ebp,esp
>> [00000b9b](01) 51 push ecx
>> [00000b9c](03) 8b4508 mov eax,[ebp+08]
>> [00000b9f](01) 50 push eax
>> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
>> [00000ba3](01) 51 push ecx
>> [00000ba4](05) e88ffdffff call 00000938
>> [00000ba9](03) 83c408 add esp,+08
>> [00000bac](03) 8945fc mov [ebp-04],eax
>> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
>> [00000bb3](02) 7402 jz 00000bb7
>> [00000bb5](02) ebfe jmp 00000bb5
>> [00000bb7](02) 8be5 mov esp,ebp
>> [00000bb9](01) 5d pop ebp
>> [00000bba](01) c3 ret
>> Size in bytes:(0035) [00000bba]
>>
>> _main()
>> [00000bc8](01) 55 push ebp
>> [00000bc9](02) 8bec mov ebp,esp
>> [00000bcb](05) 68980b0000 push 00000b98
>> [00000bd0](05) e8c3ffffff call 00000b98
>> [00000bd5](03) 83c404 add esp,+04
>> [00000bd8](02) 33c0 xor eax,eax
>> [00000bda](01) 5d pop ebp
>> [00000bdb](01) c3 ret
>> Size in bytes:(0020) [00000bdb]
>>
>> ===============================
>> ...[00000bc8][001015d4][00000000](01) 55 push ebp
>> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
>> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push
>> 00000b98
>> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call
>> 00000b98
>> ...[00000b98][001015c8][001015d4](01) 55 push ebp
>> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
>> ...[00000b9b][001015c4][00000000](01) 51 push ecx
>> ...[00000b9c][001015c4][00000000](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][001015c0][00000b98](01) 50 push eax
>> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
>> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call
>> 00000938
>> Begin Local Halt Decider Simulation at Machine Address:b98
>> ...[00000b98][00211674][00211678](01) 55 push ebp
>> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
>> ...[00000b9b][00211670][00201644](01) 51 push ecx
>> ...[00000b9c][00211670][00201644](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][0021166c][00000b98](01) 50 push eax
>> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][00211668][00000b98](01) 51 push ecx
>> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call
>> 00000938
>> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
>> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
>> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
>> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov
>> eax,[ebp+08]
>> ...[00000b9f][0025c094][00000b98](01) 50 push eax
>> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov
>> ecx,[ebp+08]
>> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
>> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call
>> 00000938
>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
>> ...[00000bac][001015c4][00000000](03) 8945fc mov
>> [ebp-04],eax
>> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword
>> [ebp-04],+00
>> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
>> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
>> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
>> ...[00000bba][001015d0][00000b98](01) c3 ret
>> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
>> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
>> ...[00000bda][001015d8][00100000](01) 5d pop ebp
>> ...[00000bdb][001015dc][00000098](01) c3 ret
>> Number_of_User_Instructions(39)
>> Number of Instructions Executed(26567)
>>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 1 of 50 [1] 2 3 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web