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 13 of 50 — ← Prev page 1 … 11 12 [13] 14 15 … 50 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-12 15:04 +0000 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <20210512080241.12@kylheku.com> |
| In reply to | #33433 |
On 2021-05-12, Malcolm McLean <malcolm.arthur.mclean@gmail.com> wrote: > On Wednesday, 12 May 2021 at 15:17:34 UTC+1, olcott wrote: >> On 5/12/2021 5:03 AM, Ben Bacarisse wrote: >> > Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts. >> Although this seem to be a contradiction it is not. > I think we've established by now that H_Hat(H_Hat) halts, but that's > because Halts itself issued an internal abort. So your claim is that > this halt doesn't count. Halts doesn't issue anything. It steps a simulator and checks some conditions about logged execution traces. Then it makes an ordinary decision to quit out of that loop and return 0. There is no event in there identifiable as "abort". By the same token, we could say that strlen "aborts" when it finds a null byte.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 10:48 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <QtSdnSGWms8_ZQb9nZ2dnUU7-LvNnZ2d@giganews.com> |
| In reply to | #33435 |
On 5/12/2021 10:04 AM, Kaz Kylheku wrote: > On 2021-05-12, Malcolm McLean <malcolm.arthur.mclean@gmail.com> wrote: >> On Wednesday, 12 May 2021 at 15:17:34 UTC+1, olcott wrote: >>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote: >>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts. >>> Although this seem to be a contradiction it is not. >> I think we've established by now that H_Hat(H_Hat) halts, but that's >> because Halts itself issued an internal abort. So your claim is that >> this halt doesn't count. > > Halts doesn't issue anything. It steps a simulator and checks some > conditions about logged execution traces. Then it makes an ordinary > decision to quit out of that loop and return 0. > > There is no event in there identifiable as "abort". > > By the same token, we could say that strlen "aborts" when it finds > a null byte. > Internally the flag that it checks to break out of the simulation loop is named: u32 Aborted; -- 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-12 16:45 +0000 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <20210512094159.979@kylheku.com> |
| In reply to | #33437 |
On 2021-05-12, olcott <NoOne@NoWhere.com> wrote: > On 5/12/2021 10:04 AM, Kaz Kylheku wrote: >> On 2021-05-12, Malcolm McLean <malcolm.arthur.mclean@gmail.com> wrote: >>> On Wednesday, 12 May 2021 at 15:17:34 UTC+1, olcott wrote: >>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote: >>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts. >>>> Although this seem to be a contradiction it is not. >>> I think we've established by now that H_Hat(H_Hat) halts, but that's >>> because Halts itself issued an internal abort. So your claim is that >>> this halt doesn't count. >> >> Halts doesn't issue anything. It steps a simulator and checks some >> conditions about logged execution traces. Then it makes an ordinary >> decision to quit out of that loop and return 0. >> >> There is no event in there identifiable as "abort". >> >> By the same token, we could say that strlen "aborts" when it finds >> a null byte. >> > > Internally the flag that it checks to break out of the simulation loop > is named: u32 Aborted; So flippin' what? As a purported software engineer you should know that you can call it "u32 HamSandwich" and it doesn't make a difference, other than to readability. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 11:50 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <57ydnW5dVoyhmgH9nZ2dnUU7-KOdnZ2d@giganews.com> |
| In reply to | #33439 |
On 5/12/2021 11:45 AM, Kaz Kylheku wrote: > On 2021-05-12, olcott <NoOne@NoWhere.com> wrote: >> On 5/12/2021 10:04 AM, Kaz Kylheku wrote: >>> On 2021-05-12, Malcolm McLean <malcolm.arthur.mclean@gmail.com> wrote: >>>> On Wednesday, 12 May 2021 at 15:17:34 UTC+1, olcott wrote: >>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote: >>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts. >>>>> Although this seem to be a contradiction it is not. >>>> I think we've established by now that H_Hat(H_Hat) halts, but that's >>>> because Halts itself issued an internal abort. So your claim is that >>>> this halt doesn't count. >>> >>> Halts doesn't issue anything. It steps a simulator and checks some >>> conditions about logged execution traces. Then it makes an ordinary >>> decision to quit out of that loop and return 0. >>> >>> There is no event in there identifiable as "abort". >>> >>> By the same token, we could say that strlen "aborts" when it finds >>> a null byte. >>> >> >> Internally the flag that it checks to break out of the simulation loop >> is named: u32 Aborted; > > So flippin' what? As a purported software engineer you should know that > you can call it "u32 HamSandwich" and it doesn't make a difference, > other than to readability. > When the halt decider was global and an intrinsic part of the x86utm operating system then it was the operating system that was aborting an error comparable to a divide by zero exception. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-12 22:54 +0100 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <871rab1uua.fsf@bsb.me.uk> |
| In reply to | #33437 |
olcott <NoOne@NoWhere.com> writes: > On 5/12/2021 10:04 AM, Kaz Kylheku wrote: >> There is no event in there identifiable as "abort". <cut> > Internally the flag that it checks to break out of the simulation loop > is named: u32 Aborted; I would never have though that one of these threads would provide the best laugh of the day! -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 17:55 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <soOdnQbiYcsswQH9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #33454 |
On 5/12/2021 4:54 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/12/2021 10:04 AM, Kaz Kylheku wrote: >>> There is no event in there identifiable as "abort". > <cut> >> Internally the flag that it checks to break out of the simulation loop >> is named: u32 Aborted; > > I would never have though that one of these threads would provide the > best laugh of the day! > Within the context that is was an abnormal termination error (similar to a divide by zero error) by the global halt decider from the x86utm operating system abort is a perfectly apt name. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-13 00:01 +0100 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <87v97nzhd0.fsf@bsb.me.uk> |
| In reply to | #33430 |
olcott <NoOne@NoWhere.com> writes:
> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> ... I have the very persistent single-minded focus of correctly
>>> deciding one halting problem instance as efficiently as possible.
>>
>> The halting problem requires that the true/false answers correspond to
>> halting and non-halting instances respectively. (I can't believe I
>> still have to say this.)
>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> Halts((u32)H_Hat, (u32)H_Hat);
>>> }
>>
>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>
> Although this seem to be a contradiction it is not.
Of course it is not a contradiction. I said that the last time you
suggested someone might think it is. It's the wrong answer, that's all.
Halts (as you have written it) has a bug. It's really very simple.
>>> We can eventually proceed to these details after the architectural
>>> design has been approved by a broad consensus.
>>
>> There should be consensus on what constitutes the problem before even
>> starting on a design. You are not addressing the halting problem until
>> you accept that
>
> People are too disagreeable for that.
You mean people are too disagreeable for you to show them you have made
a contribution to the halting problem? You are cutting off your nose
off to spite your face. Bite the bullet and tell these disagreeable
people that you know what the halting problem is:
(A1) For every instance of the halting problem that represents a finite
computation, the correct answer is "yes".
(A2) For every instance of the halting problem that does not represent
a finite computation, the correct answer is "no".
Either that or define the PO-halting problem with (at least) a slightly
different A1.
> I am stipulating that this is the problem that I am solving:
>
> Every partial halt decider X that that bases its halting decision
> on simulating its input P until criteria (1)(2)(3) are met by the
> execution trace of P correctly decides not halting on input P.
How come you have not solved this problem already? Do you not know what
your criteria mean? Are you having trouble implementing them? I
thought you had working code. Did you just get the tense wrong and you
meant "this is the problem I have solved"?
I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
answer to some /other/ decision problem, but you should avoid using
words with established meanings like "correctly decides not halting".
For the problem you claim to have been addressing for years, your
criteria appear to be very the reason that Halts gets the answer wrong.
You should come clean. Define the PO-halting problem that you have been
talking about for months -- the one in which "no" is the correct answer
for some halting computation because of what they would do, were they
not quite the computations that they are. Or, to put it another way,
computations that only halt because of a reason you find interesting
enough spend years talking about it. The breath of fresh air that this
honesty would bring to the debate is surely a noble goal.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 18:11 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <mpSdnXPwDuXH_QH9nZ2dnUU7-UWdnZ2d@giganews.com> |
| In reply to | #33457 |
On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> ... I have the very persistent single-minded focus of correctly
>>>> deciding one halting problem instance as efficiently as possible.
>>>
>>> The halting problem requires that the true/false answers correspond to
>>> halting and non-halting instances respectively. (I can't believe I
>>> still have to say this.)
>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>> }
>>>
>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>
>> Although this seem to be a contradiction it is not.
>
> Of course it is not a contradiction. I said that the last time you
> suggested someone might think it is. It's the wrong answer, that's all.
> Halts (as you have written it) has a bug. It's really very simple.
>
>>>> We can eventually proceed to these details after the architectural
>>>> design has been approved by a broad consensus.
>>>
>>> There should be consensus on what constitutes the problem before even
>>> starting on a design. You are not addressing the halting problem until
>>> you accept that
>>
>> People are too disagreeable for that.
>
> You mean people are too disagreeable for you to show them you have made
> a contribution to the halting problem? You are cutting off your nose
> off to spite your face. Bite the bullet and tell these disagreeable
> people that you know what the halting problem is:
>
> (A1) For every instance of the halting problem that represents a finite
> computation, the correct answer is "yes".
> (A2) For every instance of the halting problem that does not represent
> a finite computation, the correct answer is "no".
>
> Either that or define the PO-halting problem with (at least) a slightly
> different A1.
>
>> I am stipulating that this is the problem that I am solving:
>>
>> Every partial halt decider X that that bases its halting decision
>> on simulating its input P until criteria (1)(2)(3) are met by the
>> execution trace of P correctly decides not halting on input P.
>
> How come you have not solved this problem already? Do you not know what
> your criteria mean? Are you having trouble implementing them? I
> thought you had working code. Did you just get the tense wrong and you
> meant "this is the problem I have solved"?
>
> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
> answer to some /other/ decision problem, but you should avoid using
> words with established meanings like "correctly decides not halting".
> For the problem you claim to have been addressing for years, your
> criteria appear to be very the reason that Halts gets the answer wrong.
>
> You should come clean. Define the PO-halting problem that you have been
> talking about for months -- the one in which "no" is the correct answer
> for some halting computation because of what they would do, were they
> not quite the computations that they are. Or, to put it another way,
> computations that only halt because of a reason you find interesting
> enough spend years talking about it. The breath of fresh air that this
> honesty would bring to the debate is surely a noble goal.
>
On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> Truism:
>> Every simulation that would never stop unless Halts() stops
>> it at some point specifies infinite execution.
>
> Any algorithm that implements this truism is, of course, a halting
> decider.
I am stipulating a simulating halt decider that behaves exactly like a
simulator until it decides not halting.
Every partial halt decider H that that bases its halting decision
on simulating its input P until criteria (1)(2)(3) are met by the
execution trace of P correctly decides not halting on input P.
If the execution trace of function P() [i.e. the input to H] shows:
(1) Partial halt decider H is called twice in sequence from the same
machine address of P.
(2) with the same machine address parameters to H
(3) with no conditional branch or indexed jump instructions in P
then H correctly decides not halting on P.
--
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-12 18:15 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <-JqdnU3wltLN_AH9nZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #33458 |
On 5/12/2021 6:11 PM, olcott wrote:
> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> ... I have the very persistent single-minded focus of correctly
>>>>> deciding one halting problem instance as efficiently as possible.
>>>>
>>>> The halting problem requires that the true/false answers correspond to
>>>> halting and non-halting instances respectively. (I can't believe I
>>>> still have to say this.)
>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>> }
>>>>
>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>
>>> Although this seem to be a contradiction it is not.
>>
>> Of course it is not a contradiction. I said that the last time you
>> suggested someone might think it is. It's the wrong answer, that's all.
>> Halts (as you have written it) has a bug. It's really very simple.
>>
>>>>> We can eventually proceed to these details after the architectural
>>>>> design has been approved by a broad consensus.
>>>>
>>>> There should be consensus on what constitutes the problem before even
>>>> starting on a design. You are not addressing the halting problem until
>>>> you accept that
>>>
>>> People are too disagreeable for that.
>>
>> You mean people are too disagreeable for you to show them you have made
>> a contribution to the halting problem? You are cutting off your nose
>> off to spite your face. Bite the bullet and tell these disagreeable
>> people that you know what the halting problem is:
>>
>> (A1) For every instance of the halting problem that represents a finite
>> computation, the correct answer is "yes".
>> (A2) For every instance of the halting problem that does not represent
>> a finite computation, the correct answer is "no".
>>
>> Either that or define the PO-halting problem with (at least) a slightly
>> different A1.
>>
>>> I am stipulating that this is the problem that I am solving:
>>>
>>> Every partial halt decider X that that bases its halting decision
>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>> execution trace of P correctly decides not halting on input P.
>>
>> How come you have not solved this problem already? Do you not know what
>> your criteria mean? Are you having trouble implementing them? I
>> thought you had working code. Did you just get the tense wrong and you
>> meant "this is the problem I have solved"?
>>
>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>> answer to some /other/ decision problem, but you should avoid using
>> words with established meanings like "correctly decides not halting".
>> For the problem you claim to have been addressing for years, your
>> criteria appear to be very the reason that Halts gets the answer wrong.
>>
>> You should come clean. Define the PO-halting problem that you have been
>> talking about for months -- the one in which "no" is the correct answer
>> for some halting computation because of what they would do, were they
>> not quite the computations that they are. Or, to put it another way,
>> computations that only halt because of a reason you find interesting
>> enough spend years talking about it. The breath of fresh air that this
>> honesty would bring to the debate is surely a noble goal.
>>
>
> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
> > olcott <NoOne@NoWhere.com> writes:
> >
> >> Truism:
> >> Every simulation that would never stop unless Halts() stops
> >> it at some point specifies infinite execution.
> >
> > Any algorithm that implements this truism is, of course, a halting
> > decider.
>
> I am stipulating a simulating halt decider that behaves exactly like a
> simulator until it decides not halting.
>
> Every partial halt decider H that that bases its halting decision
> on simulating its input P until criteria (1)(2)(3) are met by the
> execution trace of P correctly decides not halting on input P.
>
> If the execution trace of function P() [i.e. the input to H] shows:
> (1) Partial halt decider H is called twice in sequence from the same
> machine address of P.
> (2) with the same machine address parameters to H
> (3) with no conditional branch or indexed jump instructions in P
> then H correctly decides not halting on P.
The above is correct unless it is possible to derive some code sample CS
input to H such that the execution trace of of CS does match the
(1)(2)(3) criteria above and CS halts on its own without the need for H
to stop simulating CS.
--
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-12 23:11 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <AN0nI.47445$N%1.16287@fx28.iad> |
| In reply to | #33459 |
On 5/12/21 7:15 PM, olcott wrote:
> On 5/12/2021 6:11 PM, olcott wrote:
>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>
>>>>> The halting problem requires that the true/false answers correspond to
>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>> still have to say this.)
>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> }
>>>>>
>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>
>>>> Although this seem to be a contradiction it is not.
>>>
>>> Of course it is not a contradiction. I said that the last time you
>>> suggested someone might think it is. It's the wrong answer, that's all.
>>> Halts (as you have written it) has a bug. It's really very simple.
>>>
>>>>>> We can eventually proceed to these details after the architectural
>>>>>> design has been approved by a broad consensus.
>>>>>
>>>>> There should be consensus on what constitutes the problem before even
>>>>> starting on a design. You are not addressing the halting problem
>>>>> until
>>>>> you accept that
>>>>
>>>> People are too disagreeable for that.
>>>
>>> You mean people are too disagreeable for you to show them you have made
>>> a contribution to the halting problem? You are cutting off your nose
>>> off to spite your face. Bite the bullet and tell these disagreeable
>>> people that you know what the halting problem is:
>>>
>>> (A1) For every instance of the halting problem that represents a finite
>>> computation, the correct answer is "yes".
>>> (A2) For every instance of the halting problem that does not represent
>>> a finite computation, the correct answer is "no".
>>>
>>> Either that or define the PO-halting problem with (at least) a slightly
>>> different A1.
>>>
>>>> I am stipulating that this is the problem that I am solving:
>>>>
>>>> Every partial halt decider X that that bases its halting decision
>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>> execution trace of P correctly decides not halting on input P.
>>>
>>> How come you have not solved this problem already? Do you not know what
>>> your criteria mean? Are you having trouble implementing them? I
>>> thought you had working code. Did you just get the tense wrong and you
>>> meant "this is the problem I have solved"?
>>>
>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>> answer to some /other/ decision problem, but you should avoid using
>>> words with established meanings like "correctly decides not halting".
>>> For the problem you claim to have been addressing for years, your
>>> criteria appear to be very the reason that Halts gets the answer wrong.
>>>
>>> You should come clean. Define the PO-halting problem that you have been
>>> talking about for months -- the one in which "no" is the correct answer
>>> for some halting computation because of what they would do, were they
>>> not quite the computations that they are. Or, to put it another way,
>>> computations that only halt because of a reason you find interesting
>>> enough spend years talking about it. The breath of fresh air that this
>>> honesty would bring to the debate is surely a noble goal.
>>>
>>
>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>> > olcott <NoOne@NoWhere.com> writes:
>> >
>> >> Truism:
>> >> Every simulation that would never stop unless Halts() stops
>> >> it at some point specifies infinite execution.
>> >
>> > Any algorithm that implements this truism is, of course, a halting
>> > decider.
>>
>> I am stipulating a simulating halt decider that behaves exactly like a
>> simulator until it decides not halting.
>>
>> Every partial halt decider H that that bases its halting decision
>> on simulating its input P until criteria (1)(2)(3) are met by the
>> execution trace of P correctly decides not halting on input P.
>>
>> If the execution trace of function P() [i.e. the input to H] shows:
>> (1) Partial halt decider H is called twice in sequence from the same
>> machine address of P.
>> (2) with the same machine address parameters to H
>> (3) with no conditional branch or indexed jump instructions in P
>> then H correctly decides not halting on P.
>
> The above is correct unless it is possible to derive some code sample CS
> input to H such that the execution trace of of CS does match the
> (1)(2)(3) criteria above and CS halts on its own without the need for H
> to stop simulating CS.
>
>
H_Hat(H_Hat)
H_Hat(H_Hat) Halts on its own when run as a Turing Machine.
Even you have agreed to this.
That makes it a Halting_Computation by the clear definition.
H(H_Hat, H_Hat) says it is non-halting.
This it is wrong as no non-halting program halts when run, that is a
definition.
Your Olcottology doesn't mean anything for this.
Note, The fact that the copy of H within H_Hat deciding to terminate its
simulation of a copy of the description of H_Hat does NOT make it a
non-halting computation, as H_Hat STILL halted by just its own
algorithm, which includes the algorithm of the copy of H that is in it.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 22:20 -0500 |
| Subject | Re: New test program (Succeeds V2)[ software engineering competence ] |
| Message-ID | <bJadnVNf4_F_BwH9nZ2dnUU78SPNnZ2d@giganews.com> |
| In reply to | #33488 |
On 5/12/2021 10:11 PM, Richard Damon wrote:
> On 5/12/21 7:15 PM, olcott wrote:
>> On 5/12/2021 6:11 PM, olcott wrote:
>>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>>
>>>>>> The halting problem requires that the true/false answers correspond to
>>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>>> still have to say this.)
>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> }
>>>>>>
>>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>>
>>>>> Although this seem to be a contradiction it is not.
>>>>
>>>> Of course it is not a contradiction. I said that the last time you
>>>> suggested someone might think it is. It's the wrong answer, that's all.
>>>> Halts (as you have written it) has a bug. It's really very simple.
>>>>
>>>>>>> We can eventually proceed to these details after the architectural
>>>>>>> design has been approved by a broad consensus.
>>>>>>
>>>>>> There should be consensus on what constitutes the problem before even
>>>>>> starting on a design. You are not addressing the halting problem
>>>>>> until
>>>>>> you accept that
>>>>>
>>>>> People are too disagreeable for that.
>>>>
>>>> You mean people are too disagreeable for you to show them you have made
>>>> a contribution to the halting problem? You are cutting off your nose
>>>> off to spite your face. Bite the bullet and tell these disagreeable
>>>> people that you know what the halting problem is:
>>>>
>>>> (A1) For every instance of the halting problem that represents a finite
>>>> computation, the correct answer is "yes".
>>>> (A2) For every instance of the halting problem that does not represent
>>>> a finite computation, the correct answer is "no".
>>>>
>>>> Either that or define the PO-halting problem with (at least) a slightly
>>>> different A1.
>>>>
>>>>> I am stipulating that this is the problem that I am solving:
>>>>>
>>>>> Every partial halt decider X that that bases its halting decision
>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>> execution trace of P correctly decides not halting on input P.
>>>>
>>>> How come you have not solved this problem already? Do you not know what
>>>> your criteria mean? Are you having trouble implementing them? I
>>>> thought you had working code. Did you just get the tense wrong and you
>>>> meant "this is the problem I have solved"?
>>>>
>>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>>> answer to some /other/ decision problem, but you should avoid using
>>>> words with established meanings like "correctly decides not halting".
>>>> For the problem you claim to have been addressing for years, your
>>>> criteria appear to be very the reason that Halts gets the answer wrong.
>>>>
>>>> You should come clean. Define the PO-halting problem that you have been
>>>> talking about for months -- the one in which "no" is the correct answer
>>>> for some halting computation because of what they would do, were they
>>>> not quite the computations that they are. Or, to put it another way,
>>>> computations that only halt because of a reason you find interesting
>>>> enough spend years talking about it. The breath of fresh air that this
>>>> honesty would bring to the debate is surely a noble goal.
>>>>
>>>
>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>> > olcott <NoOne@NoWhere.com> writes:
>>> >
>>> >> Truism:
>>> >> Every simulation that would never stop unless Halts() stops
>>> >> it at some point specifies infinite execution.
>>> >
>>> > Any algorithm that implements this truism is, of course, a halting
>>> > decider.
>>>
>>> I am stipulating a simulating halt decider that behaves exactly like a
>>> simulator until it decides not halting.
>>>
>>> Every partial halt decider H that that bases its halting decision
>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>> execution trace of P correctly decides not halting on input P.
>>>
>>> If the execution trace of function P() [i.e. the input to H] shows:
>>> (1) Partial halt decider H is called twice in sequence from the same
>>> machine address of P.
>>> (2) with the same machine address parameters to H
>>> (3) with no conditional branch or indexed jump instructions in P
>>> then H correctly decides not halting on P.
>>
>> The above is correct unless it is possible to derive some code sample CS
>> input to H such that the execution trace of of CS does match the
>> (1)(2)(3) criteria above and CS halts on its own without the need for H
>> to stop simulating CS.
>>
>>
>
> H_Hat(H_Hat)
>
> H_Hat(H_Hat) Halts on its own when run as a Turing Machine.
>
What I never agreed to is that the behavior of that entirely different
computation ever refutes Halts(H_Hat, H_Hat) == 0;
THE FOLLOWING MAY BE BEYOND YOUR SOFTWARE ENGINEERING COMPETENCE:
I am stipulating a simulating halt decider that behaves exactly like a
simulator until it decides not halting.
Every partial halt decider H that that bases its halting decision
on simulating its input P until criteria (1)(2)(3) are met by the
execution trace of P correctly decides not halting on input P.
THIS KEY ELEMENT MAY BE BEYOND YOUR SOFTWARE ENGINEERING COMPETENCE:
If a code sample CS that matches the (1)(2)(3) criteria and
halts without its simulation being terminated by the halt decider
does not exist, this proves that Halts(H_Hat, H_Hat) == 0 is correct.
If the execution trace of function P() [i.e. the input to H] shows:
(1) Partial halt decider H is called twice in sequence from the same
machine address of P.
(2) with the same machine address parameters to H
(3) with no conditional branch or indexed jump instructions in P
then H correctly decides not halting on P.
> Even you have agreed to this.
>
> That makes it a Halting_Computation by the clear definition.
>
> H(H_Hat, H_Hat) says it is non-halting.
>
> This it is wrong as no non-halting program halts when run, that is a
> definition.
>
> Your Olcottology doesn't mean anything for this.
>
>
> Note, The fact that the copy of H within H_Hat deciding to terminate its
> simulation of a copy of the description of H_Hat does NOT make it a
> non-halting computation, as H_Hat STILL halted by just its own
> algorithm, which includes the algorithm of the copy of H that is in it.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-12 23:41 -0400 |
| Subject | Re: New test program (Succeeds V2)[ software engineering competence ] |
| Message-ID | <6e1nI.303968$ST2.28517@fx47.iad> |
| In reply to | #33490 |
On 5/12/21 11:20 PM, olcott wrote:
> On 5/12/2021 10:11 PM, Richard Damon wrote:
>> On 5/12/21 7:15 PM, olcott wrote:
>>> On 5/12/2021 6:11 PM, olcott wrote:
>>>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>>>
>>>>>>> The halting problem requires that the true/false answers
>>>>>>> correspond to
>>>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>>>> still have to say this.)
>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>> if (Input_Halts)
>>>>>>>> HERE: goto HERE;
>>>>>>>> }
>>>>>>>>
>>>>>>>> int main()
>>>>>>>> {
>>>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>>> }
>>>>>>>
>>>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>>>
>>>>>> Although this seem to be a contradiction it is not.
>>>>>
>>>>> Of course it is not a contradiction. I said that the last time you
>>>>> suggested someone might think it is. It's the wrong answer, that's
>>>>> all.
>>>>> Halts (as you have written it) has a bug. It's really very simple.
>>>>>
>>>>>>>> We can eventually proceed to these details after the architectural
>>>>>>>> design has been approved by a broad consensus.
>>>>>>>
>>>>>>> There should be consensus on what constitutes the problem before
>>>>>>> even
>>>>>>> starting on a design. You are not addressing the halting problem
>>>>>>> until
>>>>>>> you accept that
>>>>>>
>>>>>> People are too disagreeable for that.
>>>>>
>>>>> You mean people are too disagreeable for you to show them you have
>>>>> made
>>>>> a contribution to the halting problem? You are cutting off your nose
>>>>> off to spite your face. Bite the bullet and tell these disagreeable
>>>>> people that you know what the halting problem is:
>>>>>
>>>>> (A1) For every instance of the halting problem that represents a
>>>>> finite
>>>>> computation, the correct answer is "yes".
>>>>> (A2) For every instance of the halting problem that does not represent
>>>>> a finite computation, the correct answer is "no".
>>>>>
>>>>> Either that or define the PO-halting problem with (at least) a
>>>>> slightly
>>>>> different A1.
>>>>>
>>>>>> I am stipulating that this is the problem that I am solving:
>>>>>>
>>>>>> Every partial halt decider X that that bases its halting decision
>>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>>> execution trace of P correctly decides not halting on input P.
>>>>>
>>>>> How come you have not solved this problem already? Do you not know
>>>>> what
>>>>> your criteria mean? Are you having trouble implementing them? I
>>>>> thought you had working code. Did you just get the tense wrong and
>>>>> you
>>>>> meant "this is the problem I have solved"?
>>>>>
>>>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>>>> answer to some /other/ decision problem, but you should avoid using
>>>>> words with established meanings like "correctly decides not halting".
>>>>> For the problem you claim to have been addressing for years, your
>>>>> criteria appear to be very the reason that Halts gets the answer
>>>>> wrong.
>>>>>
>>>>> You should come clean. Define the PO-halting problem that you have
>>>>> been
>>>>> talking about for months -- the one in which "no" is the correct
>>>>> answer
>>>>> for some halting computation because of what they would do, were they
>>>>> not quite the computations that they are. Or, to put it another way,
>>>>> computations that only halt because of a reason you find interesting
>>>>> enough spend years talking about it. The breath of fresh air that
>>>>> this
>>>>> honesty would bring to the debate is surely a noble goal.
>>>>>
>>>>
>>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>>> > olcott <NoOne@NoWhere.com> writes:
>>>> >
>>>> >> Truism:
>>>> >> Every simulation that would never stop unless Halts() stops
>>>> >> it at some point specifies infinite execution.
>>>> >
>>>> > Any algorithm that implements this truism is, of course, a halting
>>>> > decider.
>>>>
>>>> I am stipulating a simulating halt decider that behaves exactly like a
>>>> simulator until it decides not halting.
>>>>
>>>> Every partial halt decider H that that bases its halting decision
>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>> execution trace of P correctly decides not halting on input P.
>>>>
>>>> If the execution trace of function P() [i.e. the input to H] shows:
>>>> (1) Partial halt decider H is called twice in sequence from the same
>>>> machine address of P.
>>>> (2) with the same machine address parameters to H
>>>> (3) with no conditional branch or indexed jump instructions in P
>>>> then H correctly decides not halting on P.
>>>
>>> The above is correct unless it is possible to derive some code sample CS
>>> input to H such that the execution trace of of CS does match the
>>> (1)(2)(3) criteria above and CS halts on its own without the need for H
>>> to stop simulating CS.
>>>
>>>
>>
>> H_Hat(H_Hat)
>>
>> H_Hat(H_Hat) Halts on its own when run as a Turing Machine.
>>
>
> What I never agreed to is that the behavior of that entirely different
> computation ever refutes Halts(H_Hat, H_Hat) == 0;
>
>
> THE FOLLOWING MAY BE BEYOND YOUR SOFTWARE ENGINEERING COMPETENCE:
>
> I am stipulating a simulating halt decider that behaves exactly like a
> simulator until it decides not halting.
>
> Every partial halt decider H that that bases its halting decision
> on simulating its input P until criteria (1)(2)(3) are met by the
> execution trace of P correctly decides not halting on input P.
>
> THIS KEY ELEMENT MAY BE BEYOND YOUR SOFTWARE ENGINEERING COMPETENCE:
> If a code sample CS that matches the (1)(2)(3) criteria and
> halts without its simulation being terminated by the halt decider
> does not exist, this proves that Halts(H_Hat, H_Hat) == 0 is correct.
>
> If the execution trace of function P() [i.e. the input to H] shows:
> (1) Partial halt decider H is called twice in sequence from the same
> machine address of P.
> (2) with the same machine address parameters to H
> (3) with no conditional branch or indexed jump instructions in P
> then H correctly decides not halting on P.
>
BY DEFINITION: The question being asked of Halts(H_Hat, H_Hat) is what
is the results of running the computaiton H_Hat(H_Hat), is it a halting
computation or a non-halting computation.
THAT IS LITERALLY THE DEFINITION OF THE PROBLEM IT IS NEEDING TO SOLVE.
That is like someone asking if this black cat is black, and the answer
is that this other cat over here is white, so you are going to answer
based on this other cat, so it isn't black.
The answer is still wrong. That cat that question was about was black,
so the answer is yes.
The Question is what will H_Hat(H_Hat) do, so the only right answer is
Halts.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-13 00:50 +0100 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <87v97ny0iq.fsf@bsb.me.uk> |
| In reply to | #33458 |
olcott <NoOne@NoWhere.com> writes:
> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> ... I have the very persistent single-minded focus of correctly
>>>>> deciding one halting problem instance as efficiently as possible.
>>>>
>>>> The halting problem requires that the true/false answers correspond to
>>>> halting and non-halting instances respectively. (I can't believe I
>>>> still have to say this.)
>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>> }
>>>>
>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>
>>> Although this seem to be a contradiction it is not.
>>
>> Of course it is not a contradiction. I said that the last time you
>> suggested someone might think it is. It's the wrong answer, that's all.
>> Halts (as you have written it) has a bug. It's really very simple.
>>
>>>>> We can eventually proceed to these details after the architectural
>>>>> design has been approved by a broad consensus.
>>>>
>>>> There should be consensus on what constitutes the problem before even
>>>> starting on a design. You are not addressing the halting problem until
>>>> you accept that
>>>
>>> People are too disagreeable for that.
>>
>> You mean people are too disagreeable for you to show them you have made
>> a contribution to the halting problem? You are cutting off your nose
>> off to spite your face. Bite the bullet and tell these disagreeable
>> people that you know what the halting problem is:
>>
>> (A1) For every instance of the halting problem that represents a finite
>> computation, the correct answer is "yes".
>> (A2) For every instance of the halting problem that does not represent
>> a finite computation, the correct answer is "no".
>>
>> Either that or define the PO-halting problem with (at least) a slightly
>> different A1.
>>
>>> I am stipulating that this is the problem that I am solving:
>>>
>>> Every partial halt decider X that that bases its halting decision
>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>> execution trace of P correctly decides not halting on input P.
>>
>> How come you have not solved this problem already? Do you not know what
>> your criteria mean? Are you having trouble implementing them? I
>> thought you had working code. Did you just get the tense wrong and you
>> meant "this is the problem I have solved"?
>>
>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>> answer to some /other/ decision problem, but you should avoid using
>> words with established meanings like "correctly decides not halting".
>> For the problem you claim to have been addressing for years, your
>> criteria appear to be very the reason that Halts gets the answer wrong.
>>
>> You should come clean. Define the PO-halting problem that you have been
>> talking about for months -- the one in which "no" is the correct answer
>> for some halting computation because of what they would do, were they
>> not quite the computations that they are. Or, to put it another way,
>> computations that only halt because of a reason you find interesting
>> enough spend years talking about it. The breath of fresh air that this
>> honesty would bring to the debate is surely a noble goal.
>
> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
<cut non-responsive text>
I'm sorry to see that you are having a manic episode. I hope you get
things under control very soon.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 18:59 -0500 |
| Subject | Re: New test program (Succeeds V2)[ will not blink ] |
| Message-ID | <tuqdnWyF19w49gH9nZ2dnUU7-RnNnZ2d@giganews.com> |
| In reply to | #33465 |
On 5/12/2021 6:50 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>
>>>>> The halting problem requires that the true/false answers correspond to
>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>> still have to say this.)
>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> }
>>>>>
>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>
>>>> Although this seem to be a contradiction it is not.
>>>
>>> Of course it is not a contradiction. I said that the last time you
>>> suggested someone might think it is. It's the wrong answer, that's all.
>>> Halts (as you have written it) has a bug. It's really very simple.
>>>
>>>>>> We can eventually proceed to these details after the architectural
>>>>>> design has been approved by a broad consensus.
>>>>>
>>>>> There should be consensus on what constitutes the problem before even
>>>>> starting on a design. You are not addressing the halting problem until
>>>>> you accept that
>>>>
>>>> People are too disagreeable for that.
>>>
>>> You mean people are too disagreeable for you to show them you have made
>>> a contribution to the halting problem? You are cutting off your nose
>>> off to spite your face. Bite the bullet and tell these disagreeable
>>> people that you know what the halting problem is:
>>>
>>> (A1) For every instance of the halting problem that represents a finite
>>> computation, the correct answer is "yes".
>>> (A2) For every instance of the halting problem that does not represent
>>> a finite computation, the correct answer is "no".
>>>
>>> Either that or define the PO-halting problem with (at least) a slightly
>>> different A1.
>>>
>>>> I am stipulating that this is the problem that I am solving:
>>>>
>>>> Every partial halt decider X that that bases its halting decision
>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>> execution trace of P correctly decides not halting on input P.
>>>
>>> How come you have not solved this problem already? Do you not know what
>>> your criteria mean? Are you having trouble implementing them? I
>>> thought you had working code. Did you just get the tense wrong and you
>>> meant "this is the problem I have solved"?
>>>
>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>> answer to some /other/ decision problem, but you should avoid using
>>> words with established meanings like "correctly decides not halting".
>>> For the problem you claim to have been addressing for years, your
>>> criteria appear to be very the reason that Halts gets the answer wrong.
>>>
>>> You should come clean. Define the PO-halting problem that you have been
>>> talking about for months -- the one in which "no" is the correct answer
>>> for some halting computation because of what they would do, were they
>>> not quite the computations that they are. Or, to put it another way,
>>> computations that only halt because of a reason you find interesting
>>> enough spend years talking about it. The breath of fresh air that this
>>> honesty would bring to the debate is surely a noble goal.
>>
>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>
> <cut non-responsive text>
>
> I'm sorry to see that you are having a manic episode. I hope you get
> things under control very soon.
>
I simply remain on the single-key most important aspect of my proof
however long it takes for people to accurately review it.
When these same people realize that this point is irrefutable and they
are dead-set on only providing a rebuttal they continue to try to change
the subject. I cannot afford to tolerate this kind of dishonest dodge.
If my claim is false then it would possible to derive some code sample
CS input to H such that the execution trace of of CS does match the
(1)(2)(3) criteria and CS halts on its own without the need for H to
stop simulating CS.
I must continue to repeat this challenge however long that people
continue to dodge it. If this is a staring contest, I absolutely will
not blink.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-13 01:26 +0100 |
| Subject | Re: New test program (Succeeds V2)[ will not blink ] |
| Message-ID | <87cztvxyvg.fsf@bsb.me.uk> |
| In reply to | #33467 |
olcott <NoOne@NoWhere.com> writes:
> On 5/12/2021 6:50 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>>
>>>>>> The halting problem requires that the true/false answers correspond to
>>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>>> still have to say this.)
>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> }
>>>>>>
>>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>>
>>>>> Although this seem to be a contradiction it is not.
>>>>
>>>> Of course it is not a contradiction. I said that the last time you
>>>> suggested someone might think it is. It's the wrong answer, that's all.
>>>> Halts (as you have written it) has a bug. It's really very simple.
>>>>
>>>>>>> We can eventually proceed to these details after the architectural
>>>>>>> design has been approved by a broad consensus.
>>>>>>
>>>>>> There should be consensus on what constitutes the problem before even
>>>>>> starting on a design. You are not addressing the halting problem until
>>>>>> you accept that
>>>>>
>>>>> People are too disagreeable for that.
>>>>
>>>> You mean people are too disagreeable for you to show them you have made
>>>> a contribution to the halting problem? You are cutting off your nose
>>>> off to spite your face. Bite the bullet and tell these disagreeable
>>>> people that you know what the halting problem is:
>>>>
>>>> (A1) For every instance of the halting problem that represents a finite
>>>> computation, the correct answer is "yes".
>>>> (A2) For every instance of the halting problem that does not represent
>>>> a finite computation, the correct answer is "no".
>>>>
>>>> Either that or define the PO-halting problem with (at least) a slightly
>>>> different A1.
>>>>
>>>>> I am stipulating that this is the problem that I am solving:
>>>>>
>>>>> Every partial halt decider X that that bases its halting decision
>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>> execution trace of P correctly decides not halting on input P.
>>>>
>>>> How come you have not solved this problem already? Do you not know what
>>>> your criteria mean? Are you having trouble implementing them? I
>>>> thought you had working code. Did you just get the tense wrong and you
>>>> meant "this is the problem I have solved"?
>>>>
>>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>>> answer to some /other/ decision problem, but you should avoid using
>>>> words with established meanings like "correctly decides not halting".
>>>> For the problem you claim to have been addressing for years, your
>>>> criteria appear to be very the reason that Halts gets the answer wrong.
>>>>
>>>> You should come clean. Define the PO-halting problem that you have been
>>>> talking about for months -- the one in which "no" is the correct answer
>>>> for some halting computation because of what they would do, were they
>>>> not quite the computations that they are. Or, to put it another way,
>>>> computations that only halt because of a reason you find interesting
>>>> enough spend years talking about it. The breath of fresh air that this
>>>> honesty would bring to the debate is surely a noble goal.
>>>
>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>
>> <cut non-responsive text>
>>
>> I'm sorry to see that you are having a manic episode. I hope you get
>> things under control very soon.
>
> I simply remain on the single-key most important aspect of my proof
> however long it takes for people to accurately review it.
OK. And I will remain on the single most important error that you are
making. Maybe once you have good reviews of the method by which you
arrive at the wrong answer, you will take a moment to address the
mistake itself.
However, I suspect no review will ever be considered accurate, so you
will be able to ignore the elephant in the room indefinitely. Many more
months of boasting lie ahead...
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-12 23:15 -0400 |
| Subject | Re: New test program (Succeeds V2)[ will not blink ] |
| Message-ID | <ER0nI.399186$2N3.153557@fx33.iad> |
| In reply to | #33467 |
On 5/12/21 7:59 PM, olcott wrote:
> On 5/12/2021 6:50 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/12/2021 6:01 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 5/12/2021 5:03 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> ... I have the very persistent single-minded focus of correctly
>>>>>>> deciding one halting problem instance as efficiently as possible.
>>>>>>
>>>>>> The halting problem requires that the true/false answers
>>>>>> correspond to
>>>>>> halting and non-halting instances respectively. (I can't believe I
>>>>>> still have to say this.)
>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> }
>>>>>>
>>>>>> Halts(H_Hat, H_Hat) is false, but H_Hat(H_Hat) halts.
>>>>>
>>>>> Although this seem to be a contradiction it is not.
>>>>
>>>> Of course it is not a contradiction. I said that the last time you
>>>> suggested someone might think it is. It's the wrong answer, that's
>>>> all.
>>>> Halts (as you have written it) has a bug. It's really very simple.
>>>>
>>>>>>> We can eventually proceed to these details after the architectural
>>>>>>> design has been approved by a broad consensus.
>>>>>>
>>>>>> There should be consensus on what constitutes the problem before even
>>>>>> starting on a design. You are not addressing the halting problem
>>>>>> until
>>>>>> you accept that
>>>>>
>>>>> People are too disagreeable for that.
>>>>
>>>> You mean people are too disagreeable for you to show them you have made
>>>> a contribution to the halting problem? You are cutting off your nose
>>>> off to spite your face. Bite the bullet and tell these disagreeable
>>>> people that you know what the halting problem is:
>>>>
>>>> (A1) For every instance of the halting problem that represents a finite
>>>> computation, the correct answer is "yes".
>>>> (A2) For every instance of the halting problem that does not represent
>>>> a finite computation, the correct answer is "no".
>>>>
>>>> Either that or define the PO-halting problem with (at least) a slightly
>>>> different A1.
>>>>
>>>>> I am stipulating that this is the problem that I am solving:
>>>>>
>>>>> Every partial halt decider X that that bases its halting decision
>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>> execution trace of P correctly decides not halting on input P.
>>>>
>>>> How come you have not solved this problem already? Do you not know
>>>> what
>>>> your criteria mean? Are you having trouble implementing them? I
>>>> thought you had working code. Did you just get the tense wrong and you
>>>> meant "this is the problem I have solved"?
>>>>
>>>> I have no trouble accepting that Halts(H_Hat, H_Hat) gets the right
>>>> answer to some /other/ decision problem, but you should avoid using
>>>> words with established meanings like "correctly decides not halting".
>>>> For the problem you claim to have been addressing for years, your
>>>> criteria appear to be very the reason that Halts gets the answer wrong.
>>>>
>>>> You should come clean. Define the PO-halting problem that you have
>>>> been
>>>> talking about for months -- the one in which "no" is the correct answer
>>>> for some halting computation because of what they would do, were they
>>>> not quite the computations that they are. Or, to put it another way,
>>>> computations that only halt because of a reason you find interesting
>>>> enough spend years talking about it. The breath of fresh air that this
>>>> honesty would bring to the debate is surely a noble goal.
>>>
>>> On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
>>
>> <cut non-responsive text>
>>
>> I'm sorry to see that you are having a manic episode. I hope you get
>> things under control very soon.
>>
>
> I simply remain on the single-key most important aspect of my proof
> however long it takes for people to accurately review it.
>
> When these same people realize that this point is irrefutable and they
> are dead-set on only providing a rebuttal they continue to try to change
> the subject. I cannot afford to tolerate this kind of dishonest dodge.
>
> If my claim is false then it would possible to derive some code sample
> CS input to H such that the execution trace of of CS does match the
> (1)(2)(3) criteria and CS halts on its own without the need for H to
> stop simulating CS.
>
> I must continue to repeat this challenge however long that people
> continue to dodge it. If this is a staring contest, I absolutely will
> not blink.
>
You are using the wrong test. The test of a machine halting is does it
halt when run on its own. H_Hat does, so it is.
Do you have ANY real PROOF of your claim or is this just some weird
Olcott logic that things can just be claimed true by fiat, and not need
to be proved, even though acording to you, nothing is True if it can't
be analytically proven.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-12 11:52 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7h4ku$nsv$1@dont-email.me> |
| In reply to | #33425 |
On 2021-05-11 23:01, olcott wrote:
> On 5/11/2021 11:45 PM, André G. Isaak wrote:
>> On 2021-05-11 21:27, olcott wrote:
>>> On 5/11/2021 10:01 PM, André G. Isaak wrote:
>>>> On 2021-05-11 20:40, olcott wrote:
>>>>> On 5/11/2021 9:10 PM, André G. Isaak wrote:
>>>>>> On 2021-05-11 20:02, olcott wrote:
>>>>>>> On 5/11/2021 8:46 PM, André G. Isaak wrote:
>>>>>>>> On 2021-05-11 19:25, olcott wrote:
>>>>>>>>> On 5/11/2021 8:01 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-05-11 18:13, olcott wrote:
>>>>>>>>>>> On 5/11/2021 6:36 PM, André G. Isaak wrote:
>>>>>>>>>>>> On 2021-05-11 16:37, olcott wrote:
>>>>>>>>>>>>> On 5/11/2021 5:27 PM, André G. Isaak wrote:
>>>>>>>>>>>>>> On 2021-05-11 14:15, olcott wrote:
>>>>>>>>>>>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If we make sure to force halts to behave like a simulator
>>>>>>>>>>>>>>> then we are forbidding halts to be a decider.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> A program cannot be two different programs at once. Either
>>>>>>>>>>>>>> your program is a simulator or it is a decider.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Halts() is exactly a simulator until is has proof that
>>>>>>>>>>>>>>> its input would never stop unless Halts() stopped it.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> No. It isn't exactly a simulator, because for the above to
>>>>>>>>>>>>>> make any sort of sense it must be doing at least one thing
>>>>>>>>>>>>>> which a simulator does *not* do: it must be looking for
>>>>>>>>>>>>>> that 'proof' that its input would never stop. That
>>>>>>>>>>>>>> involves tests. Tests entail conditional branches.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat)
>>>>>>>>>>>>>> which in turn runs makes a call to Halts() as part of its
>>>>>>>>>>>>>> simulation (call it 'simulated halts' to distinguish it
>>>>>>>>>>>>>> from the outermost call), your 'halt detection logic' must
>>>>>>>>>>>>>> look inside this simulated halts, and inside the new
>>>>>>>>>>>>>> simulation of H_Hat(H_Hat) triggered by simulated halts.
>>>>>>>>>>>>>> All of those conditional branches associated with your
>>>>>>>>>>>>>> tests count as conditional branches intervening between
>>>>>>>>>>>>>> two calls to the same address.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The first three criteria are the exactly same criteria
>>>>>>>>>>>>>>>>> that I have been referring to for many months (3 has
>>>>>>>>>>>>>>>>> been augmented)
>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You can't mention H_Hat in your criteria. Halts() isn't
>>>>>>>>>>>>>>>> restricted to running on just one input.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated
>>>>>>>>>>>>>>>>> [Truism] non halting criteria:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> That is an entirely vacuous statement. Unless you can
>>>>>>>>>>>>>>>> provide a foolproof mechanism for correctly identifying
>>>>>>>>>>>>>>>> such cases, the above doesn't help you in the slightest.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You've already been given numerous examples which show
>>>>>>>>>>>>>> that the above criteria don't work, at least not as you
>>>>>>>>>>>>>> are applying them.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This is proof that Halts() must stop simulating H_Hat()
>>>>>>>>>>>>>>> thus matching the truism.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Have you ever actually read a real proof? Even a really
>>>>>>>>>>>>>> simple one?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The above doesn't even remotely constitute a proof. Proofs
>>>>>>>>>>>>>> have premises along with arguments which show how those
>>>>>>>>>>>>>> premises lead to a conclusion. All you have above is claim
>>>>>>>>>>>>>> that you can use the three criteria above to somehow
>>>>>>>>>>>>>> identify runaway recursion. You have no argumentation to
>>>>>>>>>>>>>> support that these criteria actually work, and
>>>>>>>>>>>>>> counterexamples have already been provided which
>>>>>>>>>>>>>> demonstrate that they do not.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Argumentum ad repetitione does not constitute valid logic.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Try and form a counter-example where the input to Halts()
>>>>>>>>>>>>> would halt if Halts() did not stop simulating it and the
>>>>>>>>>>>>> input does match (1)(2)(3).
>>>>>>>>>>>>>
>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> First, why are your criteria suddenly talking about Halts()
>>>>>>>>>>>> and H_Hat rather than variables? Your criteria need to be
>>>>>>>>>>>> generic, not tied to specific inputs.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> I could say for every partial halt decider X() that
>>>>>>>>>>> that bases its halting decision on simulating its input Y()
>>>>>>>>>>> until criteria (1)(2)(3) are met by its input Y()...
>>>>>>>>>>
>>>>>>>>>> Not only could you do this, you should do this.
>>>>>>>>>>
>>>>>>>>>>>> Second, why don't you rewrite the above so it is actually
>>>>>>>>>>>> clear what they mean. I'll briefly outline some of the
>>>>>>>>>>>> vagueness inherent in the above.
>>>>>>>>>>>>
>>>>>>>>>>>> If the execution trace of function P() [i.e. the input to
>>>>>>>>>>>> halts] shows:
>>>>>>>>>>>>
>>>>>>>>>>>> 1) some function X is called twice in sequence from the same
>>>>>>>>>>>> machine address of P.
>>>>>>>>>>>>
>>>>>>>>>>>> To make sense of the above, we need to know what 'in
>>>>>>>>>>>> sequence' actually means. We also need to know how the
>>>>>>>>>>>> address space used in your nested simulations actually works.
>>>>>>>>>>>
>>>>>>>>>>> The execution trace of N instructions of P repeats over and over
>>>>>>>>>>> with nothing inbetween.
>>>>>>>>>>
>>>>>>>>>> That's even less clear than the original. And it doesn't even
>>>>>>>>>> mention the function X which is supposedly being called 'in
>>>>>>>>>> sequence'.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> In sequence always refers to an execution trace of one
>>>>>>>>> instruction after another
>>>>>>>>>
>>>>>>>>> The following 16 instructions are a single contiguous execution
>>>>>>>>> trace of H_Hat() where 8 instructions are repeated until Halts
>>>>>>>>> stop simulating H_Hat().
>>>>>>>>>
>>>>>>>>> Begin Local Halt Decider Simulation at Machine Address:b1f
>>>>>>>>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp
>>>>>>>>> ...[00000b20][002115e2][002115e6](02) 8bec mov ebp,esp
>>>>>>>>> ...[00000b22][002115de][002015b2](01) 51 push ecx
>>>>>>>>> ...[00000b23][002115de][002015b2](03) 8b4508 mov
>>>>>>>>> eax,[ebp+08]
>>>>>>>>> ...[00000b26][002115da][00000b1f](01) 50 push eax
>>>>>>>>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov
>>>>>>>>> ecx,[ebp+08]
>>>>>>>>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx
>>>>>>>>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call
>>>>>>>>> 0000095f
>>>>>>>>
>>>>>>>> But you've skipped over absolutely all of the instructions which
>>>>>>>> are executed at this point. Why? There could be any number of
>>>>>>>> conditional branches or other flow-control instruction in the
>>>>>>>> code you've skipped.
>>>>>>>>
>>>>>>>
>>>>>>> It turns out that it does not make any difference.
>>>>>>> If it does make a difference then this counter-example would show
>>>>>>> the difference that it makes:
>>>>>>
>>>>>> I've already *given* you examples where it clearly makes a
>>>>>> difference.
>>>>>>
>>>>>> As has Kaz.
>>>>>>
>>>>>> And you cannot simply claim that it does not make a difference --
>>>>>> you'd need to show the actual trace and *demonstrate* that it
>>>>>> makes no difference. You'd then have to explain how it is that
>>>>>> your code decides which calls it needs to follow and which ones it
>>>>>> does not.
>>>>>>
>>>>>
>>>>> Because the very excellent review that you and Kaz provided I
>>>>> narrowed my definitions so that the differences that you and he did
>>>>> show no longer apply to the current specification.
>>>>>
>>>>> I just cleaned up how I am saying this based on your review:
>>>>>
>>>>> Every partial halt decider X that that bases its halting decision
>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>> execution trace of P correctly decides not halting on input P.
>>>>>
>>>>> If the execution trace of function P() [i.e. the input to halts]
>>>>> shows:
>>>>> (1) Partial halt decider X is called twice in sequence from the
>>>>> same machine address of P.
>>>>> (2) with the same machine address parameters to X
>>>>> (3) with no conditional branch or indexed jump instructions in P
>>>>> then X correctly decides not halting on P.
>>>>
>>>> Nothing in these new criteria makes any of the problematic cases you
>>>> were previously given go away. They are all still just as
>>>> problematic. If you believe otherwise, you need to demonstrate how
>>>> this solves anything.
>>>
>>> All of the instances of X that were shown to be problematic no longer
>>> exist because of the way that X has been redefined.
>>
>> So now you're requiring that X must be a partial halt decider? If
>> that's your solution, then its an incredibly stupid one since you've
>> made it so that it will no longer identify
>>
>> void foo(void) {
>> foo();
>> }
>>
>> as infinitely recursive simply because this isn't a partial halt decider?
>>
>
> Yes, I have the very persistent single-minded focus of correctly
> deciding one halting problem instance as efficiently as possible.
This also means you're being entirely disingenuous in your requests for
'counterexamples' because your defining your criterion such that it only
applies to a single example.
>> You also claim that if X is called twice by P, that X correctly
>> decides P. If X is being called *by* P, then P isn't the input to X in
>> the first place rendering the entire statement incoherent.
>
>
> Halts == X
> H_Hat == P
> I have only been talking about this one case for about six months.
> X is called by main() with P and it is also called by P with P.
But these two instances are *different* calls. You can't refer to them
using the same variable name.
<snippage>
>>> There is no code in my entire system that is not simulated so how
>>> else can I address a statement that is very simply factually incorrect?
>>
>> Of course there is code that isn't simulated. The top level code which
>> performs the simulating can't be simulated.
>
> It is an x86 emulator that executes main().
OK. Based on the above it sounds like your entire description of what
you've been doing thus far has been completely misleading.
In the past, you've said that Halts() simulates its input. But from what
you write above that is simply false. It sounds like your x86 emulator
simulates Halts() which in turn simply *calls* H_Hat. Yes, H_Hat is part
of a simulation, but it isn't being simulated by Halts as you previously
claimed. The simulator code isn't actually part of Halts at all. This
means you don't have 'nested simulations'; you simply have a single
simulation of some recursive calls.
This means that Halts *cannot* be the thing which stops the simulation.
Only the simulator can do that. Sure, halts might set a global flag
which the simulator uses to decide to stop a given simulation.
This makes it even clearer that your entire approach fails to capture
the correct H ~ H_Hat relationship (something we've known all along).
You're input to Halts must be something which calls your *x86 emulator*,
not Halts, if you want to properly refer to that input as H_Hat.
>>> I don't want to get into any of the underlying technical details so
>>> that the current implemenation can be endlessly nit picked to death.
>>> I only want to verify that my architectural design is correct.
>>
>> You can't talk about the 'architectural design' absent details on how
>> addressing is dealt with in your simulations given that your whole
>> argument rests on certain addresses being the same.
>>
>> André
>
> Exactly. We can eventually proceed to these details after the
> architectural design has been approved by a broad consensus.
We can't ever "approve" your architectural design when you hide details
of that architectural design and refuse to answer question about it
before we "agree" to it.
That's like being told you must first sign and agree to a contract
before the actual details of that contract will be revealed to you. I'll
give you the 'gist' of the contract, but I won't let you read the fine
print until you sign. Then all of your bases are belong to us!
> For now my whole argument rests on correctly matching a correct
> non-halting behavior pattern.
You have to show that you've actually identified a pattern which is
correct before you can show that you correctly match that pattern.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 13:11 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <If2dnZF9ney2hwH9nZ2dnUU7-N_NnZ2d@giganews.com> |
| In reply to | #33445 |
On 5/12/2021 12:52 PM, André G. Isaak wrote:
> On 2021-05-11 23:01, olcott wrote:
>> On 5/11/2021 11:45 PM, André G. Isaak wrote:
>>> On 2021-05-11 21:27, olcott wrote:
>>>> On 5/11/2021 10:01 PM, André G. Isaak wrote:
>>>>> On 2021-05-11 20:40, olcott wrote:
>>>>>> On 5/11/2021 9:10 PM, André G. Isaak wrote:
>>>>>>> On 2021-05-11 20:02, olcott wrote:
>>>>>>>> On 5/11/2021 8:46 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-05-11 19:25, olcott wrote:
>>>>>>>>>> On 5/11/2021 8:01 PM, André G. Isaak wrote:
>>>>>>>>>>> On 2021-05-11 18:13, olcott wrote:
>>>>>>>>>>>> On 5/11/2021 6:36 PM, André G. Isaak wrote:
>>>>>>>>>>>>> On 2021-05-11 16:37, olcott wrote:
>>>>>>>>>>>>>> On 5/11/2021 5:27 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>> On 2021-05-11 14:15, olcott wrote:
>>>>>>>>>>>>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If we make sure to force halts to behave like a
>>>>>>>>>>>>>>>> simulator then we are forbidding halts to be a decider.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> A program cannot be two different programs at once.
>>>>>>>>>>>>>>> Either your program is a simulator or it is a decider.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Halts() is exactly a simulator until is has proof that
>>>>>>>>>>>>>>>> its input would never stop unless Halts() stopped it.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> No. It isn't exactly a simulator, because for the above
>>>>>>>>>>>>>>> to make any sort of sense it must be doing at least one
>>>>>>>>>>>>>>> thing which a simulator does *not* do: it must be looking
>>>>>>>>>>>>>>> for that 'proof' that its input would never stop. That
>>>>>>>>>>>>>>> involves tests. Tests entail conditional branches.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Therefore, when Halts(H_Hat, H_Hat) simulates
>>>>>>>>>>>>>>> H_Hat(H_Hat) which in turn runs makes a call to Halts()
>>>>>>>>>>>>>>> as part of its simulation (call it 'simulated halts' to
>>>>>>>>>>>>>>> distinguish it from the outermost call), your 'halt
>>>>>>>>>>>>>>> detection logic' must look inside this simulated halts,
>>>>>>>>>>>>>>> and inside the new simulation of H_Hat(H_Hat) triggered
>>>>>>>>>>>>>>> by simulated halts. All of those conditional branches
>>>>>>>>>>>>>>> associated with your tests count as conditional branches
>>>>>>>>>>>>>>> intervening between two calls to the same address.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The first three criteria are the exactly same criteria
>>>>>>>>>>>>>>>>>> that I have been referring to for many months (3 has
>>>>>>>>>>>>>>>>>> been augmented)
>>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You can't mention H_Hat in your criteria. Halts() isn't
>>>>>>>>>>>>>>>>> restricted to running on just one input.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated
>>>>>>>>>>>>>>>>>> [Truism] non halting criteria:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> That is an entirely vacuous statement. Unless you can
>>>>>>>>>>>>>>>>> provide a foolproof mechanism for correctly identifying
>>>>>>>>>>>>>>>>> such cases, the above doesn't help you in the slightest.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You've already been given numerous examples which show
>>>>>>>>>>>>>>> that the above criteria don't work, at least not as you
>>>>>>>>>>>>>>> are applying them.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> This is proof that Halts() must stop simulating H_Hat()
>>>>>>>>>>>>>>>> thus matching the truism.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Have you ever actually read a real proof? Even a really
>>>>>>>>>>>>>>> simple one?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The above doesn't even remotely constitute a proof.
>>>>>>>>>>>>>>> Proofs have premises along with arguments which show how
>>>>>>>>>>>>>>> those premises lead to a conclusion. All you have above
>>>>>>>>>>>>>>> is claim that you can use the three criteria above to
>>>>>>>>>>>>>>> somehow identify runaway recursion. You have no
>>>>>>>>>>>>>>> argumentation to support that these criteria actually
>>>>>>>>>>>>>>> work, and counterexamples have already been provided
>>>>>>>>>>>>>>> which demonstrate that they do not.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Argumentum ad repetitione does not constitute valid logic.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Try and form a counter-example where the input to Halts()
>>>>>>>>>>>>>> would halt if Halts() did not stop simulating it and the
>>>>>>>>>>>>>> input does match (1)(2)(3).
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> First, why are your criteria suddenly talking about Halts()
>>>>>>>>>>>>> and H_Hat rather than variables? Your criteria need to be
>>>>>>>>>>>>> generic, not tied to specific inputs.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> I could say for every partial halt decider X() that
>>>>>>>>>>>> that bases its halting decision on simulating its input Y()
>>>>>>>>>>>> until criteria (1)(2)(3) are met by its input Y()...
>>>>>>>>>>>
>>>>>>>>>>> Not only could you do this, you should do this.
>>>>>>>>>>>
>>>>>>>>>>>>> Second, why don't you rewrite the above so it is actually
>>>>>>>>>>>>> clear what they mean. I'll briefly outline some of the
>>>>>>>>>>>>> vagueness inherent in the above.
>>>>>>>>>>>>>
>>>>>>>>>>>>> If the execution trace of function P() [i.e. the input to
>>>>>>>>>>>>> halts] shows:
>>>>>>>>>>>>>
>>>>>>>>>>>>> 1) some function X is called twice in sequence from the
>>>>>>>>>>>>> same machine address of P.
>>>>>>>>>>>>>
>>>>>>>>>>>>> To make sense of the above, we need to know what 'in
>>>>>>>>>>>>> sequence' actually means. We also need to know how the
>>>>>>>>>>>>> address space used in your nested simulations actually works.
>>>>>>>>>>>>
>>>>>>>>>>>> The execution trace of N instructions of P repeats over and
>>>>>>>>>>>> over
>>>>>>>>>>>> with nothing inbetween.
>>>>>>>>>>>
>>>>>>>>>>> That's even less clear than the original. And it doesn't even
>>>>>>>>>>> mention the function X which is supposedly being called 'in
>>>>>>>>>>> sequence'.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> In sequence always refers to an execution trace of one
>>>>>>>>>> instruction after another
>>>>>>>>>>
>>>>>>>>>> The following 16 instructions are a single contiguous
>>>>>>>>>> execution trace of H_Hat() where 8 instructions are repeated
>>>>>>>>>> until Halts stop simulating H_Hat().
>>>>>>>>>>
>>>>>>>>>> Begin Local Halt Decider Simulation at Machine Address:b1f
>>>>>>>>>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp
>>>>>>>>>> ...[00000b20][002115e2][002115e6](02) 8bec mov
>>>>>>>>>> ebp,esp
>>>>>>>>>> ...[00000b22][002115de][002015b2](01) 51 push ecx
>>>>>>>>>> ...[00000b23][002115de][002015b2](03) 8b4508 mov
>>>>>>>>>> eax,[ebp+08]
>>>>>>>>>> ...[00000b26][002115da][00000b1f](01) 50 push eax
>>>>>>>>>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov
>>>>>>>>>> ecx,[ebp+08]
>>>>>>>>>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx
>>>>>>>>>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call
>>>>>>>>>> 0000095f
>>>>>>>>>
>>>>>>>>> But you've skipped over absolutely all of the instructions
>>>>>>>>> which are executed at this point. Why? There could be any
>>>>>>>>> number of conditional branches or other flow-control
>>>>>>>>> instruction in the code you've skipped.
>>>>>>>>>
>>>>>>>>
>>>>>>>> It turns out that it does not make any difference.
>>>>>>>> If it does make a difference then this counter-example would
>>>>>>>> show the difference that it makes:
>>>>>>>
>>>>>>> I've already *given* you examples where it clearly makes a
>>>>>>> difference.
>>>>>>>
>>>>>>> As has Kaz.
>>>>>>>
>>>>>>> And you cannot simply claim that it does not make a difference --
>>>>>>> you'd need to show the actual trace and *demonstrate* that it
>>>>>>> makes no difference. You'd then have to explain how it is that
>>>>>>> your code decides which calls it needs to follow and which ones
>>>>>>> it does not.
>>>>>>>
>>>>>>
>>>>>> Because the very excellent review that you and Kaz provided I
>>>>>> narrowed my definitions so that the differences that you and he
>>>>>> did show no longer apply to the current specification.
>>>>>>
>>>>>> I just cleaned up how I am saying this based on your review:
>>>>>>
>>>>>> Every partial halt decider X that that bases its halting decision
>>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>>> execution trace of P correctly decides not halting on input P.
>>>>>>
>>>>>> If the execution trace of function P() [i.e. the input to halts]
>>>>>> shows:
>>>>>> (1) Partial halt decider X is called twice in sequence from the
>>>>>> same machine address of P.
>>>>>> (2) with the same machine address parameters to X
>>>>>> (3) with no conditional branch or indexed jump instructions in P
>>>>>> then X correctly decides not halting on P.
>>>>>
>>>>> Nothing in these new criteria makes any of the problematic cases
>>>>> you were previously given go away. They are all still just as
>>>>> problematic. If you believe otherwise, you need to demonstrate how
>>>>> this solves anything.
>>>>
>>>> All of the instances of X that were shown to be problematic no
>>>> longer exist because of the way that X has been redefined.
>>>
>>> So now you're requiring that X must be a partial halt decider? If
>>> that's your solution, then its an incredibly stupid one since you've
>>> made it so that it will no longer identify
>>>
>>> void foo(void) {
>>> foo();
>>> }
>>>
>>> as infinitely recursive simply because this isn't a partial halt
>>> decider?
>>>
>>
>> Yes, I have the very persistent single-minded focus of correctly
>> deciding one halting problem instance as efficiently as possible.
>
> This also means you're being entirely disingenuous in your requests for
> 'counterexamples' because your defining your criterion such that it only
> applies to a single example.
>
Not at all. The partial halt deciding simulator X correctly decides not
halting on every input P that has an execution trace matching the
(1)(2)(3) criteria.
>>> You also claim that if X is called twice by P, that X correctly
>>> decides P. If X is being called *by* P, then P isn't the input to X
>>> in the first place rendering the entire statement incoherent.
>>
>>
>> Halts == X
>> H_Hat == P
>> I have only been talking about this one case for about six months.
>> X is called by main() with P and it is also called by P with P.
>
> But these two instances are *different* calls. You can't refer to them
> using the same variable name.
Why not?
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 P = (u32)H_Hat;
u32 Input_Would_Halt = Halts(P, P);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
>>>> There is no code in my entire system that is not simulated so how
>>>> else can I address a statement that is very simply factually incorrect?
>>>
>>> Of course there is code that isn't simulated. The top level code
>>> which performs the simulating can't be simulated.
>>
>> It is an x86 emulator that executes main().
>
> OK. Based on the above it sounds like your entire description of what
> you've been doing thus far has been completely misleading.
>
Is it clear to you that I do not want to get into implementation details
until after the architectural design of my system is validated?
In the future any reference to implementation details will be trimmed
and ignored.
After my architectural design is validated, then we can get into
implementation details. Before my architectural design is validated
implementation details can be an endless distraction.
> In the past, you've said that Halts() simulates its input. But from what
> you write above that is simply false. It sounds like your x86 emulator
> simulates Halts() which in turn simply *calls* H_Hat. Yes, H_Hat is part
> of a simulation, but it isn't being simulated by Halts as you previously
> claimed. The simulator code isn't actually part of Halts at all. This
> means you don't have 'nested simulations'; you simply have a single
> simulation of some recursive calls.
>
> This means that Halts *cannot* be the thing which stops the simulation.
> Only the simulator can do that. Sure, halts might set a global flag
> which the simulator uses to decide to stop a given simulation.
>
> This makes it even clearer that your entire approach fails to capture
> the correct H ~ H_Hat relationship (something we've known all along).
> You're input to Halts must be something which calls your *x86 emulator*,
> not Halts, if you want to properly refer to that input as H_Hat.
>
>>>> I don't want to get into any of the underlying technical details so
>>>> that the current implemenation can be endlessly nit picked to death.
>>>> I only want to verify that my architectural design is correct.
>>>
>>> You can't talk about the 'architectural design' absent details on how
>>> addressing is dealt with in your simulations given that your whole
>>> argument rests on certain addresses being the same.
>>>
>>> André
>>
>> Exactly. We can eventually proceed to these details after the
>> architectural design has been approved by a broad consensus.
>
> We can't ever "approve" your architectural design when you hide details
> of that architectural design and refuse to answer question about it
> before we "agree" to it.
>
It is a "given" that Halts() simulates its input.
If at some point after the architectural design is validated it is
proven then no implementation of Halts() can possibly simulate its input
then the validated architectural design will have hit a dead end.
> That's like being told you must first sign and agree to a contract
> before the actual details of that contract will be revealed to you. I'll
> give you the 'gist' of the contract, but I won't let you read the fine
> print until you sign. Then all of your bases are belong to us!
>
>> For now my whole argument rests on correctly matching a correct
>> non-halting behavior pattern.
>
> You have to show that you've actually identified a pattern which is
> correct before you can show that you correctly match that pattern.
>
> André
>
Not at all. As long as counter-example inputs are impossible my result
is proven.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-12 15:21 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7hgru$9ni$1@dont-email.me> |
| In reply to | #33446 |
On 2021-05-12 12:11, olcott wrote:
> On 5/12/2021 12:52 PM, André G. Isaak wrote:
>> On 2021-05-11 23:01, olcott wrote:
>>> On 5/11/2021 11:45 PM, André G. Isaak wrote:
>>>> On 2021-05-11 21:27, olcott wrote:
>>>>> On 5/11/2021 10:01 PM, André G. Isaak wrote:
>>>>>> On 2021-05-11 20:40, olcott wrote:
>>>>>>> On 5/11/2021 9:10 PM, André G. Isaak wrote:
>>>>>>>> On 2021-05-11 20:02, olcott wrote:
>>>>>>>>> On 5/11/2021 8:46 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-05-11 19:25, olcott wrote:
>>>>>>>>>>> On 5/11/2021 8:01 PM, André G. Isaak wrote:
>>>>>>>>>>>> On 2021-05-11 18:13, olcott wrote:
>>>>>>>>>>>>> On 5/11/2021 6:36 PM, André G. Isaak wrote:
>>>>>>>>>>>>>> On 2021-05-11 16:37, olcott wrote:
>>>>>>>>>>>>>>> On 5/11/2021 5:27 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>> On 2021-05-11 14:15, olcott wrote:
>>>>>>>>>>>>>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If we make sure to force halts to behave like a
>>>>>>>>>>>>>>>>> simulator then we are forbidding halts to be a decider.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> A program cannot be two different programs at once.
>>>>>>>>>>>>>>>> Either your program is a simulator or it is a decider.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Halts() is exactly a simulator until is has proof that
>>>>>>>>>>>>>>>>> its input would never stop unless Halts() stopped it.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> No. It isn't exactly a simulator, because for the above
>>>>>>>>>>>>>>>> to make any sort of sense it must be doing at least one
>>>>>>>>>>>>>>>> thing which a simulator does *not* do: it must be
>>>>>>>>>>>>>>>> looking for that 'proof' that its input would never
>>>>>>>>>>>>>>>> stop. That involves tests. Tests entail conditional
>>>>>>>>>>>>>>>> branches.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Therefore, when Halts(H_Hat, H_Hat) simulates
>>>>>>>>>>>>>>>> H_Hat(H_Hat) which in turn runs makes a call to Halts()
>>>>>>>>>>>>>>>> as part of its simulation (call it 'simulated halts' to
>>>>>>>>>>>>>>>> distinguish it from the outermost call), your 'halt
>>>>>>>>>>>>>>>> detection logic' must look inside this simulated halts,
>>>>>>>>>>>>>>>> and inside the new simulation of H_Hat(H_Hat) triggered
>>>>>>>>>>>>>>>> by simulated halts. All of those conditional branches
>>>>>>>>>>>>>>>> associated with your tests count as conditional branches
>>>>>>>>>>>>>>>> intervening between two calls to the same address.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The first three criteria are the exactly same
>>>>>>>>>>>>>>>>>>> criteria that I have been referring to for many
>>>>>>>>>>>>>>>>>>> months (3 has been augmented)
>>>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You can't mention H_Hat in your criteria. Halts()
>>>>>>>>>>>>>>>>>> isn't restricted to running on just one input.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated
>>>>>>>>>>>>>>>>>>> [Truism] non halting criteria:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> That is an entirely vacuous statement. Unless you can
>>>>>>>>>>>>>>>>>> provide a foolproof mechanism for correctly
>>>>>>>>>>>>>>>>>> identifying such cases, the above doesn't help you in
>>>>>>>>>>>>>>>>>> the slightest.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You've already been given numerous examples which show
>>>>>>>>>>>>>>>> that the above criteria don't work, at least not as you
>>>>>>>>>>>>>>>> are applying them.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> This is proof that Halts() must stop simulating H_Hat()
>>>>>>>>>>>>>>>>> thus matching the truism.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Have you ever actually read a real proof? Even a really
>>>>>>>>>>>>>>>> simple one?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The above doesn't even remotely constitute a proof.
>>>>>>>>>>>>>>>> Proofs have premises along with arguments which show how
>>>>>>>>>>>>>>>> those premises lead to a conclusion. All you have above
>>>>>>>>>>>>>>>> is claim that you can use the three criteria above to
>>>>>>>>>>>>>>>> somehow identify runaway recursion. You have no
>>>>>>>>>>>>>>>> argumentation to support that these criteria actually
>>>>>>>>>>>>>>>> work, and counterexamples have already been provided
>>>>>>>>>>>>>>>> which demonstrate that they do not.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Argumentum ad repetitione does not constitute valid logic.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Try and form a counter-example where the input to Halts()
>>>>>>>>>>>>>>> would halt if Halts() did not stop simulating it and the
>>>>>>>>>>>>>>> input does match (1)(2)(3).
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> First, why are your criteria suddenly talking about
>>>>>>>>>>>>>> Halts() and H_Hat rather than variables? Your criteria
>>>>>>>>>>>>>> need to be generic, not tied to specific inputs.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> I could say for every partial halt decider X() that
>>>>>>>>>>>>> that bases its halting decision on simulating its input Y()
>>>>>>>>>>>>> until criteria (1)(2)(3) are met by its input Y()...
>>>>>>>>>>>>
>>>>>>>>>>>> Not only could you do this, you should do this.
>>>>>>>>>>>>
>>>>>>>>>>>>>> Second, why don't you rewrite the above so it is actually
>>>>>>>>>>>>>> clear what they mean. I'll briefly outline some of the
>>>>>>>>>>>>>> vagueness inherent in the above.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> If the execution trace of function P() [i.e. the input to
>>>>>>>>>>>>>> halts] shows:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> 1) some function X is called twice in sequence from the
>>>>>>>>>>>>>> same machine address of P.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> To make sense of the above, we need to know what 'in
>>>>>>>>>>>>>> sequence' actually means. We also need to know how the
>>>>>>>>>>>>>> address space used in your nested simulations actually works.
>>>>>>>>>>>>>
>>>>>>>>>>>>> The execution trace of N instructions of P repeats over and
>>>>>>>>>>>>> over
>>>>>>>>>>>>> with nothing inbetween.
>>>>>>>>>>>>
>>>>>>>>>>>> That's even less clear than the original. And it doesn't
>>>>>>>>>>>> even mention the function X which is supposedly being called
>>>>>>>>>>>> 'in sequence'.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> In sequence always refers to an execution trace of one
>>>>>>>>>>> instruction after another
>>>>>>>>>>>
>>>>>>>>>>> The following 16 instructions are a single contiguous
>>>>>>>>>>> execution trace of H_Hat() where 8 instructions are repeated
>>>>>>>>>>> until Halts stop simulating H_Hat().
>>>>>>>>>>>
>>>>>>>>>>> Begin Local Halt Decider Simulation at Machine Address:b1f
>>>>>>>>>>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp
>>>>>>>>>>> ...[00000b20][002115e2][002115e6](02) 8bec mov
>>>>>>>>>>> ebp,esp
>>>>>>>>>>> ...[00000b22][002115de][002015b2](01) 51 push ecx
>>>>>>>>>>> ...[00000b23][002115de][002015b2](03) 8b4508 mov
>>>>>>>>>>> eax,[ebp+08]
>>>>>>>>>>> ...[00000b26][002115da][00000b1f](01) 50 push eax
>>>>>>>>>>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov
>>>>>>>>>>> ecx,[ebp+08]
>>>>>>>>>>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx
>>>>>>>>>>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call
>>>>>>>>>>> 0000095f
>>>>>>>>>>
>>>>>>>>>> But you've skipped over absolutely all of the instructions
>>>>>>>>>> which are executed at this point. Why? There could be any
>>>>>>>>>> number of conditional branches or other flow-control
>>>>>>>>>> instruction in the code you've skipped.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> It turns out that it does not make any difference.
>>>>>>>>> If it does make a difference then this counter-example would
>>>>>>>>> show the difference that it makes:
>>>>>>>>
>>>>>>>> I've already *given* you examples where it clearly makes a
>>>>>>>> difference.
>>>>>>>>
>>>>>>>> As has Kaz.
>>>>>>>>
>>>>>>>> And you cannot simply claim that it does not make a difference
>>>>>>>> -- you'd need to show the actual trace and *demonstrate* that it
>>>>>>>> makes no difference. You'd then have to explain how it is that
>>>>>>>> your code decides which calls it needs to follow and which ones
>>>>>>>> it does not.
>>>>>>>>
>>>>>>>
>>>>>>> Because the very excellent review that you and Kaz provided I
>>>>>>> narrowed my definitions so that the differences that you and he
>>>>>>> did show no longer apply to the current specification.
>>>>>>>
>>>>>>> I just cleaned up how I am saying this based on your review:
>>>>>>>
>>>>>>> Every partial halt decider X that that bases its halting decision
>>>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>>>> execution trace of P correctly decides not halting on input P.
>>>>>>>
>>>>>>> If the execution trace of function P() [i.e. the input to halts]
>>>>>>> shows:
>>>>>>> (1) Partial halt decider X is called twice in sequence from the
>>>>>>> same machine address of P.
>>>>>>> (2) with the same machine address parameters to X
>>>>>>> (3) with no conditional branch or indexed jump instructions in P
>>>>>>> then X correctly decides not halting on P.
>>>>>>
>>>>>> Nothing in these new criteria makes any of the problematic cases
>>>>>> you were previously given go away. They are all still just as
>>>>>> problematic. If you believe otherwise, you need to demonstrate how
>>>>>> this solves anything.
>>>>>
>>>>> All of the instances of X that were shown to be problematic no
>>>>> longer exist because of the way that X has been redefined.
>>>>
>>>> So now you're requiring that X must be a partial halt decider? If
>>>> that's your solution, then its an incredibly stupid one since you've
>>>> made it so that it will no longer identify
>>>>
>>>> void foo(void) {
>>>> foo();
>>>> }
>>>>
>>>> as infinitely recursive simply because this isn't a partial halt
>>>> decider?
>>>>
>>>
>>> Yes, I have the very persistent single-minded focus of correctly
>>> deciding one halting problem instance as efficiently as possible.
>>
>> This also means you're being entirely disingenuous in your requests
>> for 'counterexamples' because your defining your criterion such that
>> it only applies to a single example.
>>
>
> Not at all. The partial halt deciding simulator X correctly decides not
> halting on every input P that has an execution trace matching the
> (1)(2)(3) criteria.
But your criteria appear to be requiring that the *input* must be a
partial halt decider.
>>>> You also claim that if X is called twice by P, that X correctly
>>>> decides P. If X is being called *by* P, then P isn't the input to X
>>>> in the first place rendering the entire statement incoherent.
>>>
>>>
>>> Halts == X
>>> H_Hat == P
>>> I have only been talking about this one case for about six months.
>>> X is called by main() with P and it is also called by P with P.
>>
>> But these two instances are *different* calls. You can't refer to them
>> using the same variable name.
>
> Why not?
Why? Because then it isn't clear which of the two you are claiming is
making the decision. You can't use the same variable name to refer to
two different entities in the same definition.
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 P = (u32)H_Hat;
> u32 Input_Would_Halt = Halts(P, P);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
>
>
>>>>> There is no code in my entire system that is not simulated so how
>>>>> else can I address a statement that is very simply factually
>>>>> incorrect?
>>>>
>>>> Of course there is code that isn't simulated. The top level code
>>>> which performs the simulating can't be simulated.
>>>
>>> It is an x86 emulator that executes main().
>>
>> OK. Based on the above it sounds like your entire description of what
>> you've been doing thus far has been completely misleading.
>>
>
> Is it clear to you that I do not want to get into implementation details
> until after the architectural design of my system is validated?
Apparently we have very different notions of what constitutes
'architectural design" and what constitutes "implementational details".
No one is going to ever validate your architectural design when you
haven't given sufficient detail of what that design is.
Asking whether Halts() is actually doing the simulating or whether the
only simulator is something higher up *is* a question about
architectural design, not mere implementational details. As are all of
the other questions I have asked.
> In the future any reference to implementation details will be trimmed
> and ignored.
>
> After my architectural design is validated, then we can get into
> implementation details. Before my architectural design is validated
> implementation details can be an endless distraction.
>
>> In the past, you've said that Halts() simulates its input. But from
>> what you write above that is simply false. It sounds like your x86
>> emulator simulates Halts() which in turn simply *calls* H_Hat. Yes,
>> H_Hat is part of a simulation, but it isn't being simulated by Halts
>> as you previously claimed. The simulator code isn't actually part of
>> Halts at all. This means you don't have 'nested simulations'; you
>> simply have a single simulation of some recursive calls.
>>
>> This means that Halts *cannot* be the thing which stops the
>> simulation. Only the simulator can do that. Sure, halts might set a
>> global flag which the simulator uses to decide to stop a given
>> simulation.
>>
>> This makes it even clearer that your entire approach fails to capture
>> the correct H ~ H_Hat relationship (something we've known all along).
>> You're input to Halts must be something which calls your *x86
>> emulator*, not Halts, if you want to properly refer to that input as
>> H_Hat.
>>
>>>>> I don't want to get into any of the underlying technical details so
>>>>> that the current implemenation can be endlessly nit picked to
>>>>> death. I only want to verify that my architectural design is correct.
>>>>
>>>> You can't talk about the 'architectural design' absent details on
>>>> how addressing is dealt with in your simulations given that your
>>>> whole argument rests on certain addresses being the same.
>>>>
>>>> André
>>>
>>> Exactly. We can eventually proceed to these details after the
>>> architectural design has been approved by a broad consensus.
>>
>> We can't ever "approve" your architectural design when you hide
>> details of that architectural design and refuse to answer question
>> about it before we "agree" to it.
>>
>
> It is a "given" that Halts() simulates its input.
Except that this appears to contradict what you write above. Either
something you have said is blatantly wrong, or you are using the term
'simulate' to mean something entirely different that I am.
Does the Halts() routine actually contain any code which is capable of
simulating x86 instructions, or is it relying on the simulator which you
said main() is being run in?
And once again, that's not a mere implementational detail. That's a
fundamental question about the "architectural design".
> If at some point after the architectural design is validated it is
> proven then no implementation of Halts() can possibly simulate its input
> then the validated architectural design will have hit a dead end.
>
>> That's like being told you must first sign and agree to a contract
>> before the actual details of that contract will be revealed to you.
>> I'll give you the 'gist' of the contract, but I won't let you read the
>> fine print until you sign. Then all of your bases are belong to us!
>>
>>> For now my whole argument rests on correctly matching a correct
>>> non-halting behavior pattern.
>>
>> You have to show that you've actually identified a pattern which is
>> correct before you can show that you correctly match that pattern.
>>
>> André
>>
>
> Not at all. As long as counter-example inputs are impossible my result
> is proven.
And where have you shown that 'counter-example inputs are impossible'?
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-12 16:54 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <ZaKdnW30N6gd0wH9nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #33452 |
On 5/12/2021 4:21 PM, André G. Isaak wrote:
> On 2021-05-12 12:11, olcott wrote:
>> On 5/12/2021 12:52 PM, André G. Isaak wrote:
>>> On 2021-05-11 23:01, olcott wrote:
>>>> On 5/11/2021 11:45 PM, André G. Isaak wrote:
>>>>> On 2021-05-11 21:27, olcott wrote:
>>>>>> On 5/11/2021 10:01 PM, André G. Isaak wrote:
>>>>>>> On 2021-05-11 20:40, olcott wrote:
>>>>>>>> On 5/11/2021 9:10 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-05-11 20:02, olcott wrote:
>>>>>>>>>> On 5/11/2021 8:46 PM, André G. Isaak wrote:
>>>>>>>>>>> On 2021-05-11 19:25, olcott wrote:
>>>>>>>>>>>> On 5/11/2021 8:01 PM, André G. Isaak wrote:
>>>>>>>>>>>>> On 2021-05-11 18:13, olcott wrote:
>>>>>>>>>>>>>> On 5/11/2021 6:36 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>> On 2021-05-11 16:37, olcott wrote:
>>>>>>>>>>>>>>>> On 5/11/2021 5:27 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>>> On 2021-05-11 14:15, olcott wrote:
>>>>>>>>>>>>>>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If we make sure to force halts to behave like a
>>>>>>>>>>>>>>>>>> simulator then we are forbidding halts to be a decider.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> A program cannot be two different programs at once.
>>>>>>>>>>>>>>>>> Either your program is a simulator or it is a decider.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Halts() is exactly a simulator until is has proof that
>>>>>>>>>>>>>>>>>> its input would never stop unless Halts() stopped it.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> No. It isn't exactly a simulator, because for the above
>>>>>>>>>>>>>>>>> to make any sort of sense it must be doing at least one
>>>>>>>>>>>>>>>>> thing which a simulator does *not* do: it must be
>>>>>>>>>>>>>>>>> looking for that 'proof' that its input would never
>>>>>>>>>>>>>>>>> stop. That involves tests. Tests entail conditional
>>>>>>>>>>>>>>>>> branches.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Therefore, when Halts(H_Hat, H_Hat) simulates
>>>>>>>>>>>>>>>>> H_Hat(H_Hat) which in turn runs makes a call to Halts()
>>>>>>>>>>>>>>>>> as part of its simulation (call it 'simulated halts' to
>>>>>>>>>>>>>>>>> distinguish it from the outermost call), your 'halt
>>>>>>>>>>>>>>>>> detection logic' must look inside this simulated halts,
>>>>>>>>>>>>>>>>> and inside the new simulation of H_Hat(H_Hat) triggered
>>>>>>>>>>>>>>>>> by simulated halts. All of those conditional branches
>>>>>>>>>>>>>>>>> associated with your tests count as conditional
>>>>>>>>>>>>>>>>> branches intervening between two calls to the same
>>>>>>>>>>>>>>>>> address.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>>> Every simulation that would never stop unless Halts()
>>>>>>>>>>>>>>>>>> stops it at some
>>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> The first three criteria are the exactly same
>>>>>>>>>>>>>>>>>>>> criteria that I have been referring to for many
>>>>>>>>>>>>>>>>>>>> months (3 has been augmented)
>>>>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You can't mention H_Hat in your criteria. Halts()
>>>>>>>>>>>>>>>>>>> isn't restricted to running on just one input.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated
>>>>>>>>>>>>>>>>>>>> [Truism] non halting criteria:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>>>>>>>>> Every simulation that would never stop unless
>>>>>>>>>>>>>>>>>>>> Halts() stops it at some
>>>>>>>>>>>>>>>>>>>> point specifies infinite execution.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> That is an entirely vacuous statement. Unless you can
>>>>>>>>>>>>>>>>>>> provide a foolproof mechanism for correctly
>>>>>>>>>>>>>>>>>>> identifying such cases, the above doesn't help you in
>>>>>>>>>>>>>>>>>>> the slightest.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You've already been given numerous examples which show
>>>>>>>>>>>>>>>>> that the above criteria don't work, at least not as you
>>>>>>>>>>>>>>>>> are applying them.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> This is proof that Halts() must stop simulating
>>>>>>>>>>>>>>>>>> H_Hat() thus matching the truism.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Have you ever actually read a real proof? Even a really
>>>>>>>>>>>>>>>>> simple one?
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The above doesn't even remotely constitute a proof.
>>>>>>>>>>>>>>>>> Proofs have premises along with arguments which show
>>>>>>>>>>>>>>>>> how those premises lead to a conclusion. All you have
>>>>>>>>>>>>>>>>> above is claim that you can use the three criteria
>>>>>>>>>>>>>>>>> above to somehow identify runaway recursion. You have
>>>>>>>>>>>>>>>>> no argumentation to support that these criteria
>>>>>>>>>>>>>>>>> actually work, and counterexamples have already been
>>>>>>>>>>>>>>>>> provided which demonstrate that they do not.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Argumentum ad repetitione does not constitute valid logic.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> André
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Try and form a counter-example where the input to
>>>>>>>>>>>>>>>> Halts() would halt if Halts() did not stop simulating it
>>>>>>>>>>>>>>>> and the input does match (1)(2)(3).
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>>>>>>>> (1) 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()
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> First, why are your criteria suddenly talking about
>>>>>>>>>>>>>>> Halts() and H_Hat rather than variables? Your criteria
>>>>>>>>>>>>>>> need to be generic, not tied to specific inputs.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I could say for every partial halt decider X() that
>>>>>>>>>>>>>> that bases its halting decision on simulating its input Y()
>>>>>>>>>>>>>> until criteria (1)(2)(3) are met by its input Y()...
>>>>>>>>>>>>>
>>>>>>>>>>>>> Not only could you do this, you should do this.
>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Second, why don't you rewrite the above so it is actually
>>>>>>>>>>>>>>> clear what they mean. I'll briefly outline some of the
>>>>>>>>>>>>>>> vagueness inherent in the above.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If the execution trace of function P() [i.e. the input to
>>>>>>>>>>>>>>> halts] shows:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> 1) some function X is called twice in sequence from the
>>>>>>>>>>>>>>> same machine address of P.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> To make sense of the above, we need to know what 'in
>>>>>>>>>>>>>>> sequence' actually means. We also need to know how the
>>>>>>>>>>>>>>> address space used in your nested simulations actually
>>>>>>>>>>>>>>> works.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The execution trace of N instructions of P repeats over
>>>>>>>>>>>>>> and over
>>>>>>>>>>>>>> with nothing inbetween.
>>>>>>>>>>>>>
>>>>>>>>>>>>> That's even less clear than the original. And it doesn't
>>>>>>>>>>>>> even mention the function X which is supposedly being
>>>>>>>>>>>>> called 'in sequence'.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> In sequence always refers to an execution trace of one
>>>>>>>>>>>> instruction after another
>>>>>>>>>>>>
>>>>>>>>>>>> The following 16 instructions are a single contiguous
>>>>>>>>>>>> execution trace of H_Hat() where 8 instructions are repeated
>>>>>>>>>>>> until Halts stop simulating H_Hat().
>>>>>>>>>>>>
>>>>>>>>>>>> Begin Local Halt Decider Simulation at Machine Address:b1f
>>>>>>>>>>>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp
>>>>>>>>>>>> ...[00000b20][002115e2][002115e6](02) 8bec mov
>>>>>>>>>>>> ebp,esp
>>>>>>>>>>>> ...[00000b22][002115de][002015b2](01) 51 push ecx
>>>>>>>>>>>> ...[00000b23][002115de][002015b2](03) 8b4508 mov
>>>>>>>>>>>> eax,[ebp+08]
>>>>>>>>>>>> ...[00000b26][002115da][00000b1f](01) 50 push eax
>>>>>>>>>>>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov
>>>>>>>>>>>> ecx,[ebp+08]
>>>>>>>>>>>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx
>>>>>>>>>>>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call
>>>>>>>>>>>> 0000095f
>>>>>>>>>>>
>>>>>>>>>>> But you've skipped over absolutely all of the instructions
>>>>>>>>>>> which are executed at this point. Why? There could be any
>>>>>>>>>>> number of conditional branches or other flow-control
>>>>>>>>>>> instruction in the code you've skipped.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> It turns out that it does not make any difference.
>>>>>>>>>> If it does make a difference then this counter-example would
>>>>>>>>>> show the difference that it makes:
>>>>>>>>>
>>>>>>>>> I've already *given* you examples where it clearly makes a
>>>>>>>>> difference.
>>>>>>>>>
>>>>>>>>> As has Kaz.
>>>>>>>>>
>>>>>>>>> And you cannot simply claim that it does not make a difference
>>>>>>>>> -- you'd need to show the actual trace and *demonstrate* that
>>>>>>>>> it makes no difference. You'd then have to explain how it is
>>>>>>>>> that your code decides which calls it needs to follow and which
>>>>>>>>> ones it does not.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Because the very excellent review that you and Kaz provided I
>>>>>>>> narrowed my definitions so that the differences that you and he
>>>>>>>> did show no longer apply to the current specification.
>>>>>>>>
>>>>>>>> I just cleaned up how I am saying this based on your review:
>>>>>>>>
>>>>>>>> Every partial halt decider X that that bases its halting decision
>>>>>>>> on simulating its input P until criteria (1)(2)(3) are met by the
>>>>>>>> execution trace of P correctly decides not halting on input P.
>>>>>>>>
>>>>>>>> If the execution trace of function P() [i.e. the input to halts]
>>>>>>>> shows:
>>>>>>>> (1) Partial halt decider X is called twice in sequence from the
>>>>>>>> same machine address of P.
>>>>>>>> (2) with the same machine address parameters to X
>>>>>>>> (3) with no conditional branch or indexed jump instructions in P
>>>>>>>> then X correctly decides not halting on P.
>>>>>>>
>>>>>>> Nothing in these new criteria makes any of the problematic cases
>>>>>>> you were previously given go away. They are all still just as
>>>>>>> problematic. If you believe otherwise, you need to demonstrate
>>>>>>> how this solves anything.
>>>>>>
>>>>>> All of the instances of X that were shown to be problematic no
>>>>>> longer exist because of the way that X has been redefined.
>>>>>
>>>>> So now you're requiring that X must be a partial halt decider? If
>>>>> that's your solution, then its an incredibly stupid one since
>>>>> you've made it so that it will no longer identify
>>>>>
>>>>> void foo(void) {
>>>>> foo();
>>>>> }
>>>>>
>>>>> as infinitely recursive simply because this isn't a partial halt
>>>>> decider?
>>>>>
>>>>
>>>> Yes, I have the very persistent single-minded focus of correctly
>>>> deciding one halting problem instance as efficiently as possible.
>>>
>>> This also means you're being entirely disingenuous in your requests
>>> for 'counterexamples' because your defining your criterion such that
>>> it only applies to a single example.
>>>
>>
>> Not at all. The partial halt deciding simulator X correctly decides
>> not halting on every input P that has an execution trace matching the
>> (1)(2)(3) criteria.
>
> But your criteria appear to be requiring that the *input* must be a
> partial halt decider.
I started using H to make it clearer:
Every partial halt decider H that that bases its halting decision
on simulating its input P until criteria (1)(2)(3) are met by the
execution trace of P correctly decides not halting on input P.
If the execution trace of function P() [i.e. the input to H] shows:
(1) Partial halt decider H is called twice in sequence from the same
machine address of P.
(2) with the same machine address parameters to H
(3) with no conditional branch or indexed jump instructions in P
then H correctly decides not halting on P.
>>>>> You also claim that if X is called twice by P, that X correctly
>>>>> decides P. If X is being called *by* P, then P isn't the input to X
>>>>> in the first place rendering the entire statement incoherent.
>>>>
>>>>
>>>> Halts == X
>>>> H_Hat == P
>>>> I have only been talking about this one case for about six months.
>>>> X is called by main() with P and it is also called by P with P.
>>>
>>> But these two instances are *different* calls. You can't refer to
>>> them using the same variable name.
>>
>> Why not?
>
> Why? Because then it isn't clear which of the two you are claiming is
> making the decision. You can't use the same variable name to refer to
> two different entities in the same definition.
>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> u32 P = (u32)H_Hat;
>> u32 Input_Would_Halt = Halts(P, P);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>>
>>
>>>>>> There is no code in my entire system that is not simulated so how
>>>>>> else can I address a statement that is very simply factually
>>>>>> incorrect?
>>>>>
>>>>> Of course there is code that isn't simulated. The top level code
>>>>> which performs the simulating can't be simulated.
>>>>
>>>> It is an x86 emulator that executes main().
>>>
>>> OK. Based on the above it sounds like your entire description of what
>>> you've been doing thus far has been completely misleading.
>>>
>>
>> Is it clear to you that I do not want to get into implementation
>> details until after the architectural design of my system is validated?
>
> Apparently we have very different notions of what constitutes
> 'architectural design" and what constitutes "implementational details".
> No one is going to ever validate your architectural design when you
> haven't given sufficient detail of what that design is.
>
You and Kaz did a very excellent job finding the imperfections of my
prior criteria. I am merely asking you to do the same thing again.
> Asking whether Halts() is actually doing the simulating or whether the
> only simulator is something higher up *is* a question about
> architectural design, not mere implementational details. As are all of
> the other questions I have asked.
>
void H_Hat2(u32 P)
{
Simulate(P, P);
}
int main()
{
Simulate((u32)H_Hat2, (u32)H_Hat2);
}
It is perfectly clear that the above computation never halts without
know any of its internals other than the fact that Simulate() only
simulates.
>> In the future any reference to implementation details will be trimmed
>> and ignored.
>>
>> After my architectural design is validated, then we can get into
>> implementation details. Before my architectural design is validated
>> implementation details can be an endless distraction.
>>
>>> In the past, you've said that Halts() simulates its input. But from
>>> what you write above that is simply false. It sounds like your x86
>>> emulator simulates Halts() which in turn simply *calls* H_Hat. Yes,
>>> H_Hat is part of a simulation, but it isn't being simulated by Halts
>>> as you previously claimed. The simulator code isn't actually part of
>>> Halts at all. This means you don't have 'nested simulations'; you
>>> simply have a single simulation of some recursive calls.
>>>
>>> This means that Halts *cannot* be the thing which stops the
>>> simulation. Only the simulator can do that. Sure, halts might set a
>>> global flag which the simulator uses to decide to stop a given
>>> simulation.
>>>
>>> This makes it even clearer that your entire approach fails to capture
>>> the correct H ~ H_Hat relationship (something we've known all along).
>>> You're input to Halts must be something which calls your *x86
>>> emulator*, not Halts, if you want to properly refer to that input as
>>> H_Hat.
>>>
>>>>>> I don't want to get into any of the underlying technical details
>>>>>> so that the current implemenation can be endlessly nit picked to
>>>>>> death. I only want to verify that my architectural design is correct.
>>>>>
>>>>> You can't talk about the 'architectural design' absent details on
>>>>> how addressing is dealt with in your simulations given that your
>>>>> whole argument rests on certain addresses being the same.
>>>>>
>>>>> André
>>>>
>>>> Exactly. We can eventually proceed to these details after the
>>>> architectural design has been approved by a broad consensus.
>>>
>>> We can't ever "approve" your architectural design when you hide
>>> details of that architectural design and refuse to answer question
>>> about it before we "agree" to it.
>>>
>>
>> It is a "given" that Halts() simulates its input.
>
> Except that this appears to contradict what you write above. Either
> something you have said is blatantly wrong, or you are using the term
> 'simulate' to mean something entirely different that I am.
>
I am stipulating a simulating halt decider that behaves exactly like a
simulator until it decides not halting.
Every partial halt decider H that that bases its halting decision
on simulating its input P until criteria (1)(2)(3) are met by the
execution trace of P correctly decides not halting on input P.
If the execution trace of function P() [i.e. the input to H] shows:
(1) Partial halt decider H is called twice in sequence from the same
machine address of P.
(2) with the same machine address parameters to H
(3) with no conditional branch or indexed jump instructions in P
then H correctly decides not halting on P.
> Does the Halts() routine actually contain any code which is capable of
> simulating x86 instructions, or is it relying on the simulator which you
> said main() is being run in?
>
I provide the x86utm operating system function u32 DebugStep() so that
any C function can simulate any other C function, including the other C
functions that the simulated function calls.
> And once again, that's not a mere implementational detail. That's a
> fundamental question about the "architectural design".
"given" that the input <is> simulated and additional details are
forbidden from scope.
It seems like there are no counter-examples and you are grasping at
straws. If there are no errors in the architectural design then any
short-comings of the implementation details can be overcome.
Unless we stay focused on the first principles of this architectural
level of design evaluating my work will take an infeasible amount of
time. https://jamesclear.com/first-principles
>> If at some point after the architectural design is validated it is
>> proven then no implementation of Halts() can possibly simulate its
>> input then the validated architectural design will have hit a dead end.
>>
>>> That's like being told you must first sign and agree to a contract
>>> before the actual details of that contract will be revealed to you.
>>> I'll give you the 'gist' of the contract, but I won't let you read
>>> the fine print until you sign. Then all of your bases are belong to us!
>>>
>>>> For now my whole argument rests on correctly matching a correct
>>>> non-halting behavior pattern.
>>>
>>> You have to show that you've actually identified a pattern which is
>>> correct before you can show that you correctly match that pattern.
>>>
>>> André
>>>
>>
>> Not at all. As long as counter-example inputs are impossible my result
>> is proven.
>
> And where have you shown that 'counter-example inputs are impossible'?
>
> André
>
Evidence that counter-examples are impossible is that you and Kaz have
not provided any. That is currently very weak evidence.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 13 of 50 — ← Prev page 1 … 11 12 [13] 14 15 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web