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 25 of 50 — ← Prev page 1 … 23 24 [25] 26 27 … 50 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 10:18 -0400 |
| Subject | Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) |
| Message-ID | <F69pI.187672$Qf2.114841@fx38.iad> |
| In reply to | #33905 |
On 5/19/21 9:47 AM, olcott wrote: > On 5/19/2021 6:01 AM, Richard Damon wrote: >> On 5/18/21 10:31 PM, olcott wrote: >>> On 5/18/2021 9:07 PM, Richard Damon wrote: >>>> On 5/18/21 7:31 PM, olcott wrote: >>>>> On 5/18/2021 6:23 PM, Richard Damon wrote: >>>>>> On 5/18/21 7:05 PM, olcott wrote: >>>>>>> On 5/18/2021 5:43 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> Such that the Linz Ĥ correctly decides not halting on its input >>>>>>>>> [Ĥ]. >>>>>>>> >>>>>>>> Nothing that can be called "Linz H" does any such thing, unless you >>>>>>>> can point to where Linz himself makes such a claim. >>>>>>>> >>>>>>>> Please stop dropping names. >>>>>>>> >>>>>>>> Refer to your moronic, non-existent nonsense as "Olcott H", >>>>>>>> not "Linz H". >>>>>>>> >>>>>>>>> >>>>>>>>>> (Note: only a partial pattern targetting one test case, not an >>>>>>>>>> actual >>>>>>>>>> halt-deciding pattern!) >>>>>>>>>> >>>>>>>>> >>>>>>>>> Only because you simply dodge key elements of the proof does your >>>>>>>> >>>>>>>> How would I dodge any element of your proof? >>>>>>>> >>>>>>>> How do I see that something is supposedly coming at me, that I may >>>>>>>> dodge >>>>>>>> it, if that something does not exist, and therefore has never been >>>>>>>> thrown? >>>>>>>> >>>>>>>>> rebuttal seem plausible to outside readers that are not paying >>>>>>>>> close >>>>>>>>> attention. >>>>>>>>> >>>>>>>>> Ben has dodged this for five years: >>>>>>>>> >>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>> >>>>>>>>> The above is adapted from (Linz:1990:319). >>>>>>>> >>>>>>>> You are not qualified to "adapt" anything. >>>>>>>> >>>>>>>>> The above definition specifies this execution trace: >>>>>>>>> It can be understood from the above specification that when the >>>>>>>>> embedded >>>>>>>>> halt decider @Ĥ.qx bases its halting decision on simulating its >>>>>>>>> input, >>>>>>>>> and it has ([Ĥ],[Ĥ]) as its input that: >>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>> with >>>>>>>>> this copy then >>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>> with >>>>>>>>> this copy then >>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>> with >>>>>>>>> this copy... >>>>>>>>> >>>>>>>>> Until we reach a mutual agreement on the above case we are at an >>>>>>>> >>>>>>>> I completely agree with any case which shows runaway simulation and >>>>>>>> failing to decide. >>>>>>> >>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>> >>>>>>> would specify infinitely nested simulation to the internal halt >>>>>>> decider >>>>>>> of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >>>>>>> when this internal halt decider is based on simulating its input? >>>>>>> >>>>>> >>>>>> Only if the claimed Halt Decider doesn't break the recursion, at >>>>>> which >>>>> >>>>> That answer is the best one provided so far and it is not wrong. >>>>> >>>>>> point it can't answer the question of H(H^,H^) and thus immediately >>>>>> fails at the job of being a Halt Decider, so H^ doesn't need to >>>>>> disprove it. >>>>>> >>>>>> If H CAN break the cycle, then it isn't one. >>>>>> >>>>> >>>>> >>>> >>>> And that shows why you get it wrong. You want to first assume that H >>>> doesn't break the loop, thus show that it is non-halting, but THEN you >>>> break that assumption and break the loop. >>>> >>> >>> Can you come up with a counter-example input P to any simulating halt >>> decider H such that the input P must have its simulation terminated to >>> prevent its infinite execution <and> input P is a halting computation? >>> >>> >> >> Per YOUR definitions: H^(H^) >> >> YOU claim it needs to be terminated, you also agree that when run by >> itself it Halts. >> >> If you don't allow that one, they your argument that H was right is >> broken. >> >> Which way is your argument wrong. >> > > _Infinite_Loop() only halts because its simulating halt decider stops > simulating it. > > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn > > The input: [Ĥ] to Ĥ([Ĥ]) only halts because its simulating halt decider > @Ĥ.qx stops simulating it. > > If you insist that the input: [Ĥ] to Ĥ([Ĥ]) is a halting computation > then this same reasoning concludes that _Infinite_Loop() is a halting > computation. > > Architectural design of simulating halt decider H > When the behavior of the input P to H > (a) correctly matches > (b) a correct non-halting behavior pattern > then H decides non-halting on P correctly. > > > Irrelevant. That fact that ONE program must be halted doesn't prove that some other program also needs to be halted. You have errors in your matching/pattern (depending on what you define), so the whole proof is invalid.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 09:45 -0500 |
| Subject | Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) |
| Message-ID | <NKidnbFL-MfOuTj9nZ2dnUU7-cPNnZ2d@giganews.com> |
| In reply to | #33909 |
On 5/19/2021 9:18 AM, Richard Damon wrote: > On 5/19/21 9:47 AM, olcott wrote: >> On 5/19/2021 6:01 AM, Richard Damon wrote: >>> On 5/18/21 10:31 PM, olcott wrote: >>>> On 5/18/2021 9:07 PM, Richard Damon wrote: >>>>> On 5/18/21 7:31 PM, olcott wrote: >>>>>> On 5/18/2021 6:23 PM, Richard Damon wrote: >>>>>>> On 5/18/21 7:05 PM, olcott wrote: >>>>>>>> On 5/18/2021 5:43 PM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> Such that the Linz Ĥ correctly decides not halting on its input >>>>>>>>>> [Ĥ]. >>>>>>>>> >>>>>>>>> Nothing that can be called "Linz H" does any such thing, unless you >>>>>>>>> can point to where Linz himself makes such a claim. >>>>>>>>> >>>>>>>>> Please stop dropping names. >>>>>>>>> >>>>>>>>> Refer to your moronic, non-existent nonsense as "Olcott H", >>>>>>>>> not "Linz H". >>>>>>>>> >>>>>>>>>> >>>>>>>>>>> (Note: only a partial pattern targetting one test case, not an >>>>>>>>>>> actual >>>>>>>>>>> halt-deciding pattern!) >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Only because you simply dodge key elements of the proof does your >>>>>>>>> >>>>>>>>> How would I dodge any element of your proof? >>>>>>>>> >>>>>>>>> How do I see that something is supposedly coming at me, that I may >>>>>>>>> dodge >>>>>>>>> it, if that something does not exist, and therefore has never been >>>>>>>>> thrown? >>>>>>>>> >>>>>>>>>> rebuttal seem plausible to outside readers that are not paying >>>>>>>>>> close >>>>>>>>>> attention. >>>>>>>>>> >>>>>>>>>> Ben has dodged this for five years: >>>>>>>>>> >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>> >>>>>>>>>> The above is adapted from (Linz:1990:319). >>>>>>>>> >>>>>>>>> You are not qualified to "adapt" anything. >>>>>>>>> >>>>>>>>>> The above definition specifies this execution trace: >>>>>>>>>> It can be understood from the above specification that when the >>>>>>>>>> embedded >>>>>>>>>> halt decider @Ĥ.qx bases its halting decision on simulating its >>>>>>>>>> input, >>>>>>>>>> and it has ([Ĥ],[Ĥ]) as its input that: >>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>> with >>>>>>>>>> this copy then >>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>> with >>>>>>>>>> this copy then >>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>> with >>>>>>>>>> this copy... >>>>>>>>>> >>>>>>>>>> Until we reach a mutual agreement on the above case we are at an >>>>>>>>> >>>>>>>>> I completely agree with any case which shows runaway simulation and >>>>>>>>> failing to decide. >>>>>>>> >>>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>> >>>>>>>> would specify infinitely nested simulation to the internal halt >>>>>>>> decider >>>>>>>> of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >>>>>>>> when this internal halt decider is based on simulating its input? >>>>>>>> >>>>>>> >>>>>>> Only if the claimed Halt Decider doesn't break the recursion, at >>>>>>> which >>>>>> >>>>>> That answer is the best one provided so far and it is not wrong. >>>>>> >>>>>>> point it can't answer the question of H(H^,H^) and thus immediately >>>>>>> fails at the job of being a Halt Decider, so H^ doesn't need to >>>>>>> disprove it. >>>>>>> >>>>>>> If H CAN break the cycle, then it isn't one. >>>>>>> >>>>>> >>>>>> >>>>> >>>>> And that shows why you get it wrong. You want to first assume that H >>>>> doesn't break the loop, thus show that it is non-halting, but THEN you >>>>> break that assumption and break the loop. >>>>> >>>> >>>> Can you come up with a counter-example input P to any simulating halt >>>> decider H such that the input P must have its simulation terminated to >>>> prevent its infinite execution <and> input P is a halting computation? >>>> >>>> >>> >>> Per YOUR definitions: H^(H^) >>> >>> YOU claim it needs to be terminated, you also agree that when run by >>> itself it Halts. >>> >>> If you don't allow that one, they your argument that H was right is >>> broken. >>> >>> Which way is your argument wrong. >>> >> >> _Infinite_Loop() only halts because its simulating halt decider stops >> simulating it. >> >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >> >> The input: [Ĥ] to Ĥ([Ĥ]) only halts because its simulating halt decider >> @Ĥ.qx stops simulating it. >> >> If you insist that the input: [Ĥ] to Ĥ([Ĥ]) is a halting computation >> then this same reasoning concludes that _Infinite_Loop() is a halting >> computation. >> >> Architectural design of simulating halt decider H >> When the behavior of the input P to H >> (a) correctly matches >> (b) a correct non-halting behavior pattern >> then H decides non-halting on P correctly. >> >> >> > Irrelevant. That fact that ONE program must be halted doesn't prove that > some other program also needs to be halted. > On the other hand if the simulation of [Ĥ] to Ĥ([Ĥ]) is never terminated then Ĥ([Ĥ]) never halts, you admitted that: On 5/18/2021 6:23 PM, Richard Damon wrote: > On 5/18/21 7:05 PM, olcott wrote: >> Do you agree that the definition of the Linz Ĥ on page 319 >> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >> >> would specify infinitely nested simulation to the internal halt >> decider of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >> when this internal halt decider is based on simulating its input? >> > > Only if the claimed Halt Decider doesn't break the recursion, -- 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-19 11:20 -0400 |
| Subject | Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) |
| Message-ID | <_0apI.117951$9L1.108547@fx05.iad> |
| In reply to | #33926 |
On 5/19/21 10:45 AM, olcott wrote: > On 5/19/2021 9:18 AM, Richard Damon wrote: >> On 5/19/21 9:47 AM, olcott wrote: >>> On 5/19/2021 6:01 AM, Richard Damon wrote: >>>> On 5/18/21 10:31 PM, olcott wrote: >>>>> On 5/18/2021 9:07 PM, Richard Damon wrote: >>>>>> On 5/18/21 7:31 PM, olcott wrote: >>>>>>> On 5/18/2021 6:23 PM, Richard Damon wrote: >>>>>>>> On 5/18/21 7:05 PM, olcott wrote: >>>>>>>>> On 5/18/2021 5:43 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> Such that the Linz Ĥ correctly decides not halting on its input >>>>>>>>>>> [Ĥ]. >>>>>>>>>> >>>>>>>>>> Nothing that can be called "Linz H" does any such thing, >>>>>>>>>> unless you >>>>>>>>>> can point to where Linz himself makes such a claim. >>>>>>>>>> >>>>>>>>>> Please stop dropping names. >>>>>>>>>> >>>>>>>>>> Refer to your moronic, non-existent nonsense as "Olcott H", >>>>>>>>>> not "Linz H". >>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>>> (Note: only a partial pattern targetting one test case, not an >>>>>>>>>>>> actual >>>>>>>>>>>> halt-deciding pattern!) >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Only because you simply dodge key elements of the proof does >>>>>>>>>>> your >>>>>>>>>> >>>>>>>>>> How would I dodge any element of your proof? >>>>>>>>>> >>>>>>>>>> How do I see that something is supposedly coming at me, that I >>>>>>>>>> may >>>>>>>>>> dodge >>>>>>>>>> it, if that something does not exist, and therefore has never >>>>>>>>>> been >>>>>>>>>> thrown? >>>>>>>>>> >>>>>>>>>>> rebuttal seem plausible to outside readers that are not paying >>>>>>>>>>> close >>>>>>>>>>> attention. >>>>>>>>>>> >>>>>>>>>>> Ben has dodged this for five years: >>>>>>>>>>> >>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>> >>>>>>>>>>> The above is adapted from (Linz:1990:319). >>>>>>>>>> >>>>>>>>>> You are not qualified to "adapt" anything. >>>>>>>>>> >>>>>>>>>>> The above definition specifies this execution trace: >>>>>>>>>>> It can be understood from the above specification that when the >>>>>>>>>>> embedded >>>>>>>>>>> halt decider @Ĥ.qx bases its halting decision on simulating its >>>>>>>>>>> input, >>>>>>>>>>> and it has ([Ĥ],[Ĥ]) as its input that: >>>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>>> with >>>>>>>>>>> this copy then >>>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>>> with >>>>>>>>>>> this copy then >>>>>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>>>>> with >>>>>>>>>>> this copy... >>>>>>>>>>> >>>>>>>>>>> Until we reach a mutual agreement on the above case we are at an >>>>>>>>>> >>>>>>>>>> I completely agree with any case which shows runaway >>>>>>>>>> simulation and >>>>>>>>>> failing to decide. >>>>>>>>> >>>>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>>> >>>>>>>>> would specify infinitely nested simulation to the internal halt >>>>>>>>> decider >>>>>>>>> of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >>>>>>>>> when this internal halt decider is based on simulating its input? >>>>>>>>> >>>>>>>> >>>>>>>> Only if the claimed Halt Decider doesn't break the recursion, at >>>>>>>> which >>>>>>> >>>>>>> That answer is the best one provided so far and it is not wrong. >>>>>>> >>>>>>>> point it can't answer the question of H(H^,H^) and thus immediately >>>>>>>> fails at the job of being a Halt Decider, so H^ doesn't need to >>>>>>>> disprove it. >>>>>>>> >>>>>>>> If H CAN break the cycle, then it isn't one. >>>>>>>> >>>>>>> >>>>>>> >>>>>> >>>>>> And that shows why you get it wrong. You want to first assume that H >>>>>> doesn't break the loop, thus show that it is non-halting, but THEN >>>>>> you >>>>>> break that assumption and break the loop. >>>>>> >>>>> >>>>> Can you come up with a counter-example input P to any simulating halt >>>>> decider H such that the input P must have its simulation terminated to >>>>> prevent its infinite execution <and> input P is a halting computation? >>>>> >>>>> >>>> >>>> Per YOUR definitions: H^(H^) >>>> >>>> YOU claim it needs to be terminated, you also agree that when run by >>>> itself it Halts. >>>> >>>> If you don't allow that one, they your argument that H was right is >>>> broken. >>>> >>>> Which way is your argument wrong. >>>> >>> >>> _Infinite_Loop() only halts because its simulating halt decider stops >>> simulating it. >>> >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>> >>> The input: [Ĥ] to Ĥ([Ĥ]) only halts because its simulating halt decider >>> @Ĥ.qx stops simulating it. >>> >>> If you insist that the input: [Ĥ] to Ĥ([Ĥ]) is a halting computation >>> then this same reasoning concludes that _Infinite_Loop() is a halting >>> computation. >>> >>> Architectural design of simulating halt decider H >>> When the behavior of the input P to H >>> (a) correctly matches >>> (b) a correct non-halting behavior pattern >>> then H decides non-halting on P correctly. >>> >>> >>> >> Irrelevant. That fact that ONE program must be halted doesn't prove that >> some other program also needs to be halted. >> > > On the other hand if the simulation of [Ĥ] to Ĥ([Ĥ]) is never terminated > then Ĥ([Ĥ]) never halts, you admitted that: > > On 5/18/2021 6:23 PM, Richard Damon wrote: >> On 5/18/21 7:05 PM, olcott wrote: >>> Do you agree that the definition of the Linz Ĥ on page 319 >>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >>> would specify infinitely nested simulation to the internal halt >>> decider of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >>> when this internal halt decider is based on simulating its input? >>> >> >> Only if the claimed Halt Decider doesn't break the recursion, > > > Misquoting. I siad that if H didn't have logic to break the loop, it would be an infinte execution, but then H doesn't answer to H(H^,H^) so isn't a valid Halt Decider. Since H DOES have the logic, the that logic IS in H^, and thus the loop will not be infinite. You keep trying to ignore that the logic in H is also within H^ since it has a copy of H, and thus, if H knows how to answer H(H^,H^) when directly asked, so does H^. It is a logical error to try to redefine halting to ignore that possibility, it gives you a definition that is in conflict with the true definition in the field. Doing so puts you outside the domain of the problem you claim to be working on.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 08:47 -0500 |
| Subject | Re: New test program (Succeeds V2)[ no sense talking about anything else ](best answer so far)(counter-example required) |
| Message-ID | <BOKdnSjPhdkqizj9nZ2dnUU7-YXNnZ2d@giganews.com> |
| In reply to | #33905 |
On 5/19/2021 6:01 AM, Richard Damon wrote: > On 5/18/21 10:31 PM, olcott wrote: >> On 5/18/2021 9:07 PM, Richard Damon wrote: >>> On 5/18/21 7:31 PM, olcott wrote: >>>> On 5/18/2021 6:23 PM, Richard Damon wrote: >>>>> On 5/18/21 7:05 PM, olcott wrote: >>>>>> On 5/18/2021 5:43 PM, Kaz Kylheku wrote: >>>>>>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> Such that the Linz Ĥ correctly decides not halting on its input [Ĥ]. >>>>>>> >>>>>>> Nothing that can be called "Linz H" does any such thing, unless you >>>>>>> can point to where Linz himself makes such a claim. >>>>>>> >>>>>>> Please stop dropping names. >>>>>>> >>>>>>> Refer to your moronic, non-existent nonsense as "Olcott H", >>>>>>> not "Linz H". >>>>>>> >>>>>>>> >>>>>>>>> (Note: only a partial pattern targetting one test case, not an >>>>>>>>> actual >>>>>>>>> halt-deciding pattern!) >>>>>>>>> >>>>>>>> >>>>>>>> Only because you simply dodge key elements of the proof does your >>>>>>> >>>>>>> How would I dodge any element of your proof? >>>>>>> >>>>>>> How do I see that something is supposedly coming at me, that I may >>>>>>> dodge >>>>>>> it, if that something does not exist, and therefore has never been >>>>>>> thrown? >>>>>>> >>>>>>>> rebuttal seem plausible to outside readers that are not paying close >>>>>>>> attention. >>>>>>>> >>>>>>>> Ben has dodged this for five years: >>>>>>>> >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>> >>>>>>>> The above is adapted from (Linz:1990:319). >>>>>>> >>>>>>> You are not qualified to "adapt" anything. >>>>>>> >>>>>>>> The above definition specifies this execution trace: >>>>>>>> It can be understood from the above specification that when the >>>>>>>> embedded >>>>>>>> halt decider @Ĥ.qx bases its halting decision on simulating its >>>>>>>> input, >>>>>>>> and it has ([Ĥ],[Ĥ]) as its input that: >>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>> with >>>>>>>> this copy then >>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>> with >>>>>>>> this copy then >>>>>>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>>>>>> with >>>>>>>> this copy... >>>>>>>> >>>>>>>> Until we reach a mutual agreement on the above case we are at an >>>>>>> >>>>>>> I completely agree with any case which shows runaway simulation and >>>>>>> failing to decide. >>>>>> >>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>> >>>>>> would specify infinitely nested simulation to the internal halt >>>>>> decider >>>>>> of Linz Ĥ @Ĥq0 wM wM (the second q0 start state of Ĥ) >>>>>> when this internal halt decider is based on simulating its input? >>>>>> >>>>> >>>>> Only if the claimed Halt Decider doesn't break the recursion, at which >>>> >>>> That answer is the best one provided so far and it is not wrong. >>>> >>>>> point it can't answer the question of H(H^,H^) and thus immediately >>>>> fails at the job of being a Halt Decider, so H^ doesn't need to >>>>> disprove it. >>>>> >>>>> If H CAN break the cycle, then it isn't one. >>>>> >>>> >>>> >>> >>> And that shows why you get it wrong. You want to first assume that H >>> doesn't break the loop, thus show that it is non-halting, but THEN you >>> break that assumption and break the loop. >>> >> >> Can you come up with a counter-example input P to any simulating halt >> decider H such that the input P must have its simulation terminated to >> prevent its infinite execution <and> input P is a halting computation? >> >> > > Per YOUR definitions: H^(H^) > > YOU claim it needs to be terminated, you also agree that when run by > itself it Halts. > > If you don't allow that one, they your argument that H was right is broken. > > Which way is your argument wrong. > _Infinite_Loop() only halts because its simulating halt decider stops simulating it. Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn The input: [Ĥ] to Ĥ([Ĥ]) only halts because its simulating halt decider @Ĥ.qx stops simulating it. If you insist that the input: [Ĥ] to Ĥ([Ĥ]) is a halting computation then this same reasoning concludes that _Infinite_Loop() is a halting computation. Architectural design of simulating halt decider H When the behavior of the input P to H (a) correctly matches (b) a correct non-halting behavior pattern then H decides non-halting on P correctly. -- 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-17 18:59 -0600 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <s7v3hv$l5e$1@dont-email.me> |
| In reply to | #33808 |
On 2021-05-17 16:50, olcott wrote: > On 5/17/2021 5:08 PM, André G. Isaak wrote: >> On 2021-05-17 15:33, olcott wrote: >>> On 5/17/2021 3:06 PM, André G. Isaak wrote: >>>> On 2021-05-17 12:15, olcott wrote: >>>>> On 5/17/2021 12:54 PM, André G. Isaak wrote: >>>>>> On 2021-05-17 11:17, olcott wrote: >>>>>>> On 5/17/2021 10:27 AM, André G. Isaak wrote: >>>>>>>> On 2021-05-17 08:58, olcott wrote: >>>>>>>>> On 5/16/2021 10:16 PM, André G. Isaak wrote: >>>>>>>>>> On 2021-05-16 19:31, olcott wrote: >>>>>>>>>>> On 5/16/2021 8:17 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-16 19:04, olcott wrote: >>>>>>>>>>>>> On 5/16/2021 4:26 PM, Ben Bacarisse wrote: >>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>> >>>>>>>>>>>>>> But this is from a man who still stands by this kind of >>>>>>>>>>>>>> nonsense: >>>>>>>>>>>>>> >>>>>>>>>>>>>> "the fact that a computation halts does not entail that >>>>>>>>>>>>>> it is a >>>>>>>>>>>>>> halting computation" >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> _Infinite_Loop() >>>>>>>>>>>>> [00000aaf](01) 55 push ebp >>>>>>>>>>>>> [00000ab0](02) 8bec mov ebp,esp >>>>>>>>>>>>> [00000ab2](02) ebfe jmp 00000ab2 >>>>>>>>>>>>> [00000ab4](01) 5d pop ebp >>>>>>>>>>>>> [00000ab5](01) c3 ret >>>>>>>>>>>>> Size in bytes:(0007) [00000ab5] >>>>>>>>>>>>> >>>>>>>>>>>>> // (a) The instruction is a JMP instruction. >>>>>>>>>>>>> // (b) It is jumping upward or to its own address. >>>>>>>>>>>>> // (c) There are no conditional branch instructions inbetween. >>>>>>>>>>>>> // (d) There are no other JMP instructions inbetween (André >>>>>>>>>>>>> G. Isaak) >>>>>>>>>>>>> >>>>>>>>>>>>> You already agreed that when simulation of an infinite loop >>>>>>>>>>>>> is terminated on the basis that its behavior matches the >>>>>>>>>>>>> [infinite_loop] behavior pattern that the fact that this >>>>>>>>>>>>> infinite loop does halt does not entail that it is a >>>>>>>>>>>>> halting computation. >>>>>>>>>>>> >>>>>>>>>>>> Halting has absolutely nothing to do with what happens >>>>>>>>>>>> inside some modified simulator. It is only concerned with >>>>>>>>>>>> the actual behaviour of a computation. >>>>>>>>>>>> >>>>>>>>>>>> And in your simulator, the infinite loop doesn't halt. Your >>>>>>>>>>>> simulator simply prematurely stops simulating it. For a >>>>>>>>>>>> simulation to halt, it would need reach one of the simulated >>>>>>>>>>>> TMs final states. >>>>>>>>>>>> >>>>>>>>>>>> André >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Unless simulating halt decider H or the embedded copy of H >>>>>>>>>>> @Ĥ.qx stops simulating Ĥ at some point the simulation of Ĥ >>>>>>>>>>> will never stop. >>>>>>>>>> >>>>>>>>>> And that OR is the major problem with your 'analysis'. >>>>>>>>>> >>>>>>>>>> If the simulation can be stopped by either H OR some code >>>>>>>>>> embedded in H_Hat, then your H *cannot* legitimately claim >>>>>>>>>> that it *needed* to stop the simulation. It did not. >>>>>>>>>> >>>>>>>>> >>>>>>>>> Yes I can. When-so-ever the input to any simulating halt >>>>>>>>> decider would not stop unless the simulation was aborted then >>>>>>>>> the input <is> correctly decided as non-halting. >>>>>>>> >>>>>>>> The problem is that you are being sloppy with respect to your >>>>>>>> wording. If you are describing how a halt decider works, then >>>>>>>> "then simulation" can only refer to the simulation which is >>>>>>>> being performed by Halts(). >>>>>>>> >>>>>>> >>>>>>> I am not sloppy. The way that I am defining it is the ONLY way to >>>>>>> unravel the pathological self reference error of Ĥ(<Ĥ>). >>>>>>> >>>>>>> Daryl McCullough sci.logic Jun 25, 2004 >>>>>>> You ask someone (we'll call him "Jack") to give a truthful >>>>>>> yes/no answer to the following question: >>>>>>> >>>>>>> Will Jack's answer to this question be no? >>>>>> >>>>>> This example has nothing whatsoever to do with the halting problem. >>>>>> >>>>>>> Jack can't possibly give a correct yes/no answer to the question. >>>>>>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ >>>>>>> >>>>>>> The ONLY way to unravel the pathological self reference error of >>>>>>> Ĥ(<Ĥ>): >>>>>> >>>>>> There IS NO SELF REFERENCE in Linz statement of the halting >>>>>> problem nor in his proof. >>>>> >>>>> The following Linz text specifies Ĥ(<Ĥ>) >>>>> Now Ĥ is a Turing machine, so that it will have some description in >>>>> Σ*, >>>>> say ŵ. This string, in addition to being the description of Ĥ can >>>>> also be used >>>>> as input string. We can therefore legitimately ask what would >>>>> happen if Ĥ is >>>>> applied to ŵ. >>>>> >>>>> That you keep saying that this is not self-reference is ridiculous. >>>> >>>> Where does the words 'reference' or 'self-reference' appear anywhere >>>> in that description? They don't. Nor is there anything in there that >>>> can be construed as self-reference. We are passing as an input to >>>> H_Hat a string. That string *is not* H_Hat. It is a description of a >>>> Turing Machine which corresponds to H_Hat. Nothing is passed a copy >>>> of itself. Nothing refers to itself. Nothing refers at all. >>>> >>> >>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>> say ŵ. This string, in addition to being the description of Ĥ can >>> also be used >>> as input string. We can therefore legitimately ask what would happen >>> if Ĥ is >>> applied to ŵ. (its own Turing machine description) >> >> You've already quoted that bit. There's nothing in it about >> self-reference. H_Hat is passed a *description* of a Turing Machine >> which happens to describe itself. That's not self-reference. A >> description of a TM is distinct from the TM itself. Nothing is being >> passed 'itself' as an argument, or even a copy of itself. It is being >> passed a desciption of a TM. >> > > For purpose of the pathological self-reference error <it is> analyzing > itself. It is easier to understand this when the executable machine and > the description are literally one-and-the-same thing. The the description of a machine and the the executable machine are *not* the same thing. They *cannot* be the same thing. Your ill-defined notion of 'pathological self-reference' is pretty worthless given that you don't appear to understand what 'self-reference' is. > That they are not does not mean that it is not analyzing itself it only > means that the fact that it is analyzing itself is hidden by one level > of indirection. It is analyzing a description, not itself. When a compiler is used to compile its own source code, people might sloppy refer to the compiler as 'compiling itself', but that *isn't* what is happening. It is compiling a piece of source code. That source code is entirely distinct from the compiler that is running even if it describes an identical compiler. >>> >>>>>> YOU have created self-reference by the way you've chosen to >>>>>> implement your decider, and if there is something pathological >>>>>> about this self-reference (whatever that means) it is entirely the >>>>>> fault of your design decisions. Not of the problem. Not of Linz. >>>>>> >>>>>>> An input is decided to be halting only if its simulation never >>>>>>> needs to be stopped by any halt decider anywhere in its entire >>>>>>> invocation chain. >>>>>> >>>>>> There only is ONE halt decider in the invocation chain. It is the >>>>>> uppermost Halts. >>>>>> >>>>>> H_Hat is *not* a halt decider. it is a modified version of a >>>>>> purported >>>>> >>>>> I quit talking about the the x86utm C/x86 H_Hat a long time ago. >>>>> I have been focusing on the actual Linz: Ĥ(<Ĥ>). >>>> >>>> So replace the term Halts with H is my description below. Everything >>>> I say still applies. For someone who feels free to abuse terminology >>>> to your hearts content, it is amazing that you can be thrown off by >>>> my decision to use a term like Halts rather than H. >>>> >>>>>> halts decider, but those modifications change it from a halt >>>>>> decider to something else. Your decider can't make any assumptions >>>>>> about what the nature of its input computation is. And your >>>>>> 'halting criterion' can't refer to things inside the input >>>>>> computation as 'halt deciders' or treat them as if something which >>>>>> they do is part of the decision made by your decider. >>>>>> >>>>>> H_Hat is simply a computation. Your decider's job is to determine >>>>>> whether that computation, *run independently*, will halt. That's >>>>>> how the problem is defined. And it will halt when run >>>>>> independently. There is thus no possible way for you to claim that >>>>>> anything other than 'yes, it halts' is the correct answer for >>>>>> Halts to give when provided with H_Hat, H_Hat as its input. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> This definition of halting circumvents the pathological >>>>> self-reference error: >>>>> An input is decided to be halting only if its simulation never >>>>> needs to be stopped by any halt decider anywhere in its entire >>>>> invocation chain. >>>> >>>> What does 'invocation chain' even mean? H is a halt decider. It is >>>> executed exactly once. It is given the description of a TM and an >>>> input string for that TM. >>>> >>> >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>> >>> In the specific case of Ĥ(<Ĥ>) it is only the internal halt decider >>> that matches the [infinitely_nested_simulation] non-halting behavior >>> pattern no sooner than the second complete repetition. >> >> What is 'the internal halt decider'? H_Hat is not a halt-decider. It >> was build by *modifying* a halt decider such that it is no longer a >> halt decider. The only purported halt-decider in the Linz proof is H. >> > > It is the copy of H that begins @ Ĥ.qx and ends @Ĥ.qy / @Ĥ.qn. But it is H which is purportedly answering whether its input halts or not. State transitions inside H_Hat are the computation which is being evaluated. They don't return any answer about whether H's input halted or not. They can't do this. >>> @Ĥ.qx bases its halting decision on simulating its input, and it has >>> (<Ĥ>,<Ĥ>) as its input that: >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then ... >>> >>> Because both Ĥ(<Ĥ>) and H(<Ĥ>,<Ĥ>) match the >>> [infinitely_nested_simulation] non-halting behavior pattern that >>> proves that at least one simulating halt decider in each invocation >>> chain stops simulating its input, thus meeting the pathological >>> self-reference adapted non-halting criteria. >> >> But you haven't even shown us your H. > > How many times do I have to repeat that I am only talking about the > Peter Linz H/Ĥ ? You really don't understand the Linz proof at all, do you. Linz doesn't provide either H or H_Hat. These are simply variables. Once you start talking about H 'matching some specific pattern', you are not talking about the Linz H. You are talking about some specific machine, which you claim is capabale of matching some specific pattern. You need to show how it would be possible to construct a TM which can recognise such a pattern > How many times do I have to repeat that I am only talking about the > Peter Linz H/Ĥ ? > > How many times do I have to repeat that I am only talking about the > Peter Linz H/Ĥ ? > >> >> You claim the above pattern is a 'non-halting pattern'. You don't show >> us how a Turing Machine could be built which detects such a pattern or >> even that it is possible to build such a machine. You claim that you >> are no longer talking about your C version, but about Linz's proof, >> but you haven't provided us with a Turing Machine. > > That is is very obviously an instance of the > [infinitely_nested_simulation] non-halting behavior pattern is entirely > sufficient. Possibly. But you need to show that you can construct a Turing Machine that can recognize such a pattern. Just because you think that you can recognize this pattern doesn't tell us that it is possible for a TM to do this. >> >> You can't make claims about what H_Hat does without first defining >> Turing Machine H since H_Hat is machine built from H using a specific >> transformation. >> > > H is the Peter Linz Turing machine with the added requirement that it Linz doesn't give a Turing Machine. H is a variable name. > bases its halting decision on simulating its input and comparing the > current set of simulated steps with a set of non-halting behavior > patterns. It does this immediately after it simulates each step of its > input. > >>> It looks like both Ĥ(<Ĥ>) and H(<Ĥ>,<Ĥ>) decide not halting at the >>> same point in the simulation of: Ĥ(<Ĥ>). This makes sense because >>> Ĥ(<Ĥ>) is stipulated to be an identical computation to H @ Ĥ.qx. >>> >>> If H waited for Ĥ.qx to decide not halting then it would wait forever >>> because H and Ĥ.qx are identical computations. >>> >>>> If your H happens to work by something which you call 'simulation', >>>> there is still only one Halt decider being run. That is H. >>>> Everything else is part of the input computation, not part of H. >>>> Anything that goes on within that computation is not being done by >>>> H. Anything decided by code within H_Hat is not being decided by H >>>> nor by a 'halt decider'. So if H_Hat 'simulates' part of its input >>>> and determines that it needs to stop that simulation, that decision >>>> is not being made by H or by a hlat decider; nor is H stopping that >>>> simulation. >>>> >>>>> It permits every input pair to be decided as halting or non-halting. >>>> >>>> But it decides at least one input incorrectly. H_Hat *is* a halting >>>> computation. If your H decides otherwise, it is wrong. >>>> >>> >>> As I have to keep repeating I quit talking about the x86utm C/x86 >>> H_Hat very many messages ago. To make this clear I refer to the >>> actual Unicode characters used in the Linz text: Ĥ. Henceforth Ĥ only >>> refers to the Linz text exact definition and H_Hat refers to the >>> x86utm C/x86 version. >> >> So then where is your H? >> >>> Ĥ(<Ĥ>) correctly decides to stop simulating its input on the basis >>> that its input matches the [infinitely_nested_simulation] non-halting >>> behavior pattern. >>> >>> The above definition specifies this execution trace: >> >> If you're now talking about Linz's H, what exactly is an 'execution >> trace'? > > An execution trace is only possible when we first assume that H is based > on simulating its input. As soon as we assume that then it is trivial to Even if we make that assumption that doesn't clarify what exactly you mean by 'execution trace' when talking about Turing Machines. André > show exactly how the internal copy of H contained within Ĥ behaves on > <Ĥ> input. > >> >> André >> >>> It can be understood from the above specification that when the >>> embedded halt decider @Ĥ.qx bases its halting decision on simulating >>> its input, and it has (<Ĥ>,<Ĥ>) as its input that: >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy... >>> >> >> > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-17 20:17 -0500 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <u_KdnTBXPLHCiD79nZ2dnUU7-YednZ2d@giganews.com> |
| In reply to | #33833 |
On 5/17/2021 7:59 PM, André G. Isaak wrote: > On 2021-05-17 16:50, olcott wrote: >> On 5/17/2021 5:08 PM, André G. Isaak wrote: >>> On 2021-05-17 15:33, olcott wrote: >>>> On 5/17/2021 3:06 PM, André G. Isaak wrote: >>>>> On 2021-05-17 12:15, olcott wrote: >>>>>> On 5/17/2021 12:54 PM, André G. Isaak wrote: >>>>>>> On 2021-05-17 11:17, olcott wrote: >>>>>>>> On 5/17/2021 10:27 AM, André G. Isaak wrote: >>>>>>>>> On 2021-05-17 08:58, olcott wrote: >>>>>>>>>> On 5/16/2021 10:16 PM, André G. Isaak wrote: >>>>>>>>>>> On 2021-05-16 19:31, olcott wrote: >>>>>>>>>>>> On 5/16/2021 8:17 PM, André G. Isaak wrote: >>>>>>>>>>>>> On 2021-05-16 19:04, olcott wrote: >>>>>>>>>>>>>> On 5/16/2021 4:26 PM, Ben Bacarisse wrote: >>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> But this is from a man who still stands by this kind of >>>>>>>>>>>>>>> nonsense: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> "the fact that a computation halts does not entail >>>>>>>>>>>>>>> that it is a >>>>>>>>>>>>>>> halting computation" >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> _Infinite_Loop() >>>>>>>>>>>>>> [00000aaf](01) 55 push ebp >>>>>>>>>>>>>> [00000ab0](02) 8bec mov ebp,esp >>>>>>>>>>>>>> [00000ab2](02) ebfe jmp 00000ab2 >>>>>>>>>>>>>> [00000ab4](01) 5d pop ebp >>>>>>>>>>>>>> [00000ab5](01) c3 ret >>>>>>>>>>>>>> Size in bytes:(0007) [00000ab5] >>>>>>>>>>>>>> >>>>>>>>>>>>>> // (a) The instruction is a JMP instruction. >>>>>>>>>>>>>> // (b) It is jumping upward or to its own address. >>>>>>>>>>>>>> // (c) There are no conditional branch instructions >>>>>>>>>>>>>> inbetween. >>>>>>>>>>>>>> // (d) There are no other JMP instructions inbetween >>>>>>>>>>>>>> (André G. Isaak) >>>>>>>>>>>>>> >>>>>>>>>>>>>> You already agreed that when simulation of an infinite >>>>>>>>>>>>>> loop is terminated on the basis that its behavior matches >>>>>>>>>>>>>> the [infinite_loop] behavior pattern that the fact that >>>>>>>>>>>>>> this infinite loop does halt does not entail that it is a >>>>>>>>>>>>>> halting computation. >>>>>>>>>>>>> >>>>>>>>>>>>> Halting has absolutely nothing to do with what happens >>>>>>>>>>>>> inside some modified simulator. It is only concerned with >>>>>>>>>>>>> the actual behaviour of a computation. >>>>>>>>>>>>> >>>>>>>>>>>>> And in your simulator, the infinite loop doesn't halt. Your >>>>>>>>>>>>> simulator simply prematurely stops simulating it. For a >>>>>>>>>>>>> simulation to halt, it would need reach one of the >>>>>>>>>>>>> simulated TMs final states. >>>>>>>>>>>>> >>>>>>>>>>>>> André >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Unless simulating halt decider H or the embedded copy of H >>>>>>>>>>>> @Ĥ.qx stops simulating Ĥ at some point the simulation of Ĥ >>>>>>>>>>>> will never stop. >>>>>>>>>>> >>>>>>>>>>> And that OR is the major problem with your 'analysis'. >>>>>>>>>>> >>>>>>>>>>> If the simulation can be stopped by either H OR some code >>>>>>>>>>> embedded in H_Hat, then your H *cannot* legitimately claim >>>>>>>>>>> that it *needed* to stop the simulation. It did not. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Yes I can. When-so-ever the input to any simulating halt >>>>>>>>>> decider would not stop unless the simulation was aborted then >>>>>>>>>> the input <is> correctly decided as non-halting. >>>>>>>>> >>>>>>>>> The problem is that you are being sloppy with respect to your >>>>>>>>> wording. If you are describing how a halt decider works, then >>>>>>>>> "then simulation" can only refer to the simulation which is >>>>>>>>> being performed by Halts(). >>>>>>>>> >>>>>>>> >>>>>>>> I am not sloppy. The way that I am defining it is the ONLY way >>>>>>>> to unravel the pathological self reference error of Ĥ(<Ĥ>). >>>>>>>> >>>>>>>> Daryl McCullough sci.logic Jun 25, 2004 >>>>>>>> You ask someone (we'll call him "Jack") to give a truthful >>>>>>>> yes/no answer to the following question: >>>>>>>> >>>>>>>> Will Jack's answer to this question be no? >>>>>>> >>>>>>> This example has nothing whatsoever to do with the halting problem. >>>>>>> >>>>>>>> Jack can't possibly give a correct yes/no answer to the question. >>>>>>>> https://groups.google.com/g/sci.logic/c/4kIXI1kxmsI/m/hRroMoQZx2IJ >>>>>>>> >>>>>>>> The ONLY way to unravel the pathological self reference error of >>>>>>>> Ĥ(<Ĥ>): >>>>>>> >>>>>>> There IS NO SELF REFERENCE in Linz statement of the halting >>>>>>> problem nor in his proof. >>>>>> >>>>>> The following Linz text specifies Ĥ(<Ĥ>) >>>>>> Now Ĥ is a Turing machine, so that it will have some description >>>>>> in Σ*, >>>>>> say ŵ. This string, in addition to being the description of Ĥ can >>>>>> also be used >>>>>> as input string. We can therefore legitimately ask what would >>>>>> happen if Ĥ is >>>>>> applied to ŵ. >>>>>> >>>>>> That you keep saying that this is not self-reference is ridiculous. >>>>> >>>>> Where does the words 'reference' or 'self-reference' appear >>>>> anywhere in that description? They don't. Nor is there anything in >>>>> there that can be construed as self-reference. We are passing as an >>>>> input to H_Hat a string. That string *is not* H_Hat. It is a >>>>> description of a Turing Machine which corresponds to H_Hat. Nothing >>>>> is passed a copy of itself. Nothing refers to itself. Nothing >>>>> refers at all. >>>>> >>>> >>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>>> say ŵ. This string, in addition to being the description of Ĥ can >>>> also be used >>>> as input string. We can therefore legitimately ask what would happen >>>> if Ĥ is >>>> applied to ŵ. (its own Turing machine description) >>> >>> You've already quoted that bit. There's nothing in it about >>> self-reference. H_Hat is passed a *description* of a Turing Machine >>> which happens to describe itself. That's not self-reference. A >>> description of a TM is distinct from the TM itself. Nothing is being >>> passed 'itself' as an argument, or even a copy of itself. It is being >>> passed a desciption of a TM. >>> >> >> For purpose of the pathological self-reference error <it is> analyzing >> itself. It is easier to understand this when the executable machine >> and the description are literally one-and-the-same thing. > > The the description of a machine and the the executable machine are > *not* the same thing. They *cannot* be the same thing. > > Your ill-defined notion of 'pathological self-reference' is pretty > worthless given that you don't appear to understand what > 'self-reference' is. > >> That they are not does not mean that it is not analyzing itself it >> only means that the fact that it is analyzing itself is hidden by one >> level of indirection. > > It is analyzing a description, not itself. > > When a compiler is used to compile its own source code, people might > sloppy refer to the compiler as 'compiling itself', but that *isn't* > what is happening. It is compiling a piece of source code. That source > code is entirely distinct from the compiler that is running even if it > describes an identical compiler. > >>>> >>>>>>> YOU have created self-reference by the way you've chosen to >>>>>>> implement your decider, and if there is something pathological >>>>>>> about this self-reference (whatever that means) it is entirely >>>>>>> the fault of your design decisions. Not of the problem. Not of Linz. >>>>>>> >>>>>>>> An input is decided to be halting only if its simulation never >>>>>>>> needs to be stopped by any halt decider anywhere in its entire >>>>>>>> invocation chain. >>>>>>> >>>>>>> There only is ONE halt decider in the invocation chain. It is the >>>>>>> uppermost Halts. >>>>>>> >>>>>>> H_Hat is *not* a halt decider. it is a modified version of a >>>>>>> purported >>>>>> >>>>>> I quit talking about the the x86utm C/x86 H_Hat a long time ago. >>>>>> I have been focusing on the actual Linz: Ĥ(<Ĥ>). >>>>> >>>>> So replace the term Halts with H is my description below. >>>>> Everything I say still applies. For someone who feels free to abuse >>>>> terminology to your hearts content, it is amazing that you can be >>>>> thrown off by my decision to use a term like Halts rather than H. >>>>> >>>>>>> halts decider, but those modifications change it from a halt >>>>>>> decider to something else. Your decider can't make any >>>>>>> assumptions about what the nature of its input computation is. >>>>>>> And your 'halting criterion' can't refer to things inside the >>>>>>> input computation as 'halt deciders' or treat them as if >>>>>>> something which they do is part of the decision made by your >>>>>>> decider. >>>>>>> >>>>>>> H_Hat is simply a computation. Your decider's job is to determine >>>>>>> whether that computation, *run independently*, will halt. That's >>>>>>> how the problem is defined. And it will halt when run >>>>>>> independently. There is thus no possible way for you to claim >>>>>>> that anything other than 'yes, it halts' is the correct answer >>>>>>> for Halts to give when provided with H_Hat, H_Hat as its input. >>>>>>> >>>>>>> André >>>>>>> >>>>>> >>>>>> This definition of halting circumvents the pathological >>>>>> self-reference error: >>>>>> An input is decided to be halting only if its simulation never >>>>>> needs to be stopped by any halt decider anywhere in its entire >>>>>> invocation chain. >>>>> >>>>> What does 'invocation chain' even mean? H is a halt decider. It is >>>>> executed exactly once. It is given the description of a TM and an >>>>> input string for that TM. >>>>> >>>> >>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>> >>>> In the specific case of Ĥ(<Ĥ>) it is only the internal halt decider >>>> that matches the [infinitely_nested_simulation] non-halting behavior >>>> pattern no sooner than the second complete repetition. >>> >>> What is 'the internal halt decider'? H_Hat is not a halt-decider. It >>> was build by *modifying* a halt decider such that it is no longer a >>> halt decider. The only purported halt-decider in the Linz proof is H. >>> >> >> It is the copy of H that begins @ Ĥ.qx and ends @Ĥ.qy / @Ĥ.qn. > > But it is H which is purportedly answering whether its input halts or > not. State transitions inside H_Hat are the computation which is being > evaluated. They don't return any answer about whether H's input halted > or not. They can't do this. > >>>> @Ĥ.qx bases its halting decision on simulating its input, and it has >>>> (<Ĥ>,<Ĥ>) as its input that: >>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>> with this copy then >>>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input >>>> with this copy then ... >>>> >>>> Because both Ĥ(<Ĥ>) and H(<Ĥ>,<Ĥ>) match the >>>> [infinitely_nested_simulation] non-halting behavior pattern that >>>> proves that at least one simulating halt decider in each invocation >>>> chain stops simulating its input, thus meeting the pathological >>>> self-reference adapted non-halting criteria. >>> >>> But you haven't even shown us your H. >> >> How many times do I have to repeat that I am only talking about the >> Peter Linz H/Ĥ ? > > You really don't understand the Linz proof at all, do you. Linz doesn't > provide either H or H_Hat. These are simply variables. > > Once you start talking about H 'matching some specific pattern', you are > not talking about the Linz H. You are talking about some specific > machine, which you claim is capabale of matching some specific pattern. > > You need to show how it would be possible to construct a TM which can > recognise such a pattern > >> How many times do I have to repeat that I am only talking about the >> Peter Linz H/Ĥ ? >> >> How many times do I have to repeat that I am only talking about the >> Peter Linz H/Ĥ ? >> >>> >>> You claim the above pattern is a 'non-halting pattern'. You don't >>> show us how a Turing Machine could be built which detects such a >>> pattern or even that it is possible to build such a machine. You >>> claim that you are no longer talking about your C version, but about >>> Linz's proof, but you haven't provided us with a Turing Machine. >> >> That is is very obviously an instance of the >> [infinitely_nested_simulation] non-halting behavior pattern is >> entirely sufficient. > > Possibly. > > But you need to show that you can construct a Turing Machine that can > recognize such a pattern. Just because you think that you can recognize > this pattern doesn't tell us that it is possible for a TM to do this. > >>> >>> You can't make claims about what H_Hat does without first defining >>> Turing Machine H since H_Hat is machine built from H using a specific >>> transformation. >>> >> >> H is the Peter Linz Turing machine with the added requirement that it > > Linz doesn't give a Turing Machine. H is a variable name. > >> bases its halting decision on simulating its input and comparing the >> current set of simulated steps with a set of non-halting behavior >> patterns. It does this immediately after it simulates each step of its >> input. >> >>>> It looks like both Ĥ(<Ĥ>) and H(<Ĥ>,<Ĥ>) decide not halting at the >>>> same point in the simulation of: Ĥ(<Ĥ>). This makes sense because >>>> Ĥ(<Ĥ>) is stipulated to be an identical computation to H @ Ĥ.qx. >>>> >>>> If H waited for Ĥ.qx to decide not halting then it would wait >>>> forever because H and Ĥ.qx are identical computations. >>>> >>>>> If your H happens to work by something which you call 'simulation', >>>>> there is still only one Halt decider being run. That is H. >>>>> Everything else is part of the input computation, not part of H. >>>>> Anything that goes on within that computation is not being done by >>>>> H. Anything decided by code within H_Hat is not being decided by H >>>>> nor by a 'halt decider'. So if H_Hat 'simulates' part of its input >>>>> and determines that it needs to stop that simulation, that decision >>>>> is not being made by H or by a hlat decider; nor is H stopping that >>>>> simulation. >>>>> >>>>>> It permits every input pair to be decided as halting or non-halting. >>>>> >>>>> But it decides at least one input incorrectly. H_Hat *is* a halting >>>>> computation. If your H decides otherwise, it is wrong. >>>>> >>>> >>>> As I have to keep repeating I quit talking about the x86utm C/x86 >>>> H_Hat very many messages ago. To make this clear I refer to the >>>> actual Unicode characters used in the Linz text: Ĥ. Henceforth Ĥ >>>> only refers to the Linz text exact definition and H_Hat refers to >>>> the x86utm C/x86 version. >>> >>> So then where is your H? >>> >>>> Ĥ(<Ĥ>) correctly decides to stop simulating its input on the basis >>>> that its input matches the [infinitely_nested_simulation] >>>> non-halting behavior pattern. >>>> >>>> The above definition specifies this execution trace: >>> >>> If you're now talking about Linz's H, what exactly is an 'execution >>> trace'? >> >> An execution trace is only possible when we first assume that H is >> based on simulating its input. As soon as we assume that then it is >> trivial to > > Even if we make that assumption that doesn't clarify what exactly you > mean by 'execution trace' when talking about Turing Machines. > > André > The following is referred to as: Ĥ(<Ĥ>) ** Now Ĥ is a Turing machine, so that it will have some description in Σ*, say ŵ. This string, in addition to being the description of Ĥ can also be used as input string. We can therefore legitimately ask what would happen if Ĥ is applied to ŵ. ** That notation was provided by Ben Unless the nested simulations specified by <Ĥ> are terminated at some point they are infinite and Ĥ(<Ĥ>) never halts. The fact that these nested simulations must be terminated at some point proves that <Ĥ> specifies an infinite computation and can be correctly decided as non-halting. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-17 22:13 -0600 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <s7veta$m63$1@dont-email.me> |
| In reply to | #33840 |
On 2021-05-17 19:17, olcott wrote: > The following is referred to as: Ĥ(<Ĥ>) ** > Now Ĥ is a Turing machine, so that it will have some description in Σ*, > say ŵ. This string, in addition to being the description of Ĥ can also > be used > as input string. We can therefore legitimately ask what would happen if > Ĥ is > applied to ŵ. > > ** That notation was provided by Ben > > Unless the nested simulations specified by <Ĥ> are terminated at some > point they are infinite and Ĥ(<Ĥ>) never halts. What do you mean "specified by <Ĥ>"? Nothing in the text above even mentions simulations, nested or otherwise. 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-17 23:33 -0500 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <X8KdnWpPKMsc3j79nZ2dnUU7-d2dnZ2d@giganews.com> |
| In reply to | #33846 |
On 5/17/2021 11:13 PM, André G. Isaak wrote: > On 2021-05-17 19:17, olcott wrote: > >> The following is referred to as: Ĥ(<Ĥ>) ** >> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >> say ŵ. This string, in addition to being the description of Ĥ can also >> be used >> as input string. We can therefore legitimately ask what would happen >> if Ĥ is >> applied to ŵ. >> >> ** That notation was provided by Ben >> >> Unless the nested simulations specified by <Ĥ> are terminated at some >> point they are infinite and Ĥ(<Ĥ>) never halts. > > What do you mean "specified by <Ĥ>"? Nothing in the text above even > mentions simulations, nested or otherwise. > > André > It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep remembering that ŵ is the Turing machine description of Ĥ. It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. Ben and I have been talking about these things since 2006. -- 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-17 23:33 -0600 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <s7vjio$5f8$1@dont-email.me> |
| In reply to | #33847 |
On 2021-05-17 22:33, olcott wrote: > On 5/17/2021 11:13 PM, André G. Isaak wrote: >> On 2021-05-17 19:17, olcott wrote: >> >>> The following is referred to as: Ĥ(<Ĥ>) ** >>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>> say ŵ. This string, in addition to being the description of Ĥ can >>> also be used >>> as input string. We can therefore legitimately ask what would happen >>> if Ĥ is >>> applied to ŵ. >>> >>> ** That notation was provided by Ben >>> >>> Unless the nested simulations specified by <Ĥ> are terminated at some >>> point they are infinite and Ĥ(<Ĥ>) never halts. >> >> What do you mean "specified by <Ĥ>"? Nothing in the text above even >> mentions simulations, nested or otherwise. >> >> André >> > > It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep remembering > that ŵ is the Turing machine description of Ĥ. > > It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. > Ben and I have been talking about these things since 2006. You seem, as usual, to be missing my point, which was that nothing in the above description of H_Hat makes any mention of simulation. Above you are suggesting that there is something about how H_Hat is defined which specifies 'nested simulations' which is simply not the case. Linz's definition of H_Hat makes no mention of simulation at all. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-18 07:22 -0400 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <2sNoI.608507$%W6.193373@fx44.iad> |
| In reply to | #33848 |
On 5/18/21 1:33 AM, André G. Isaak wrote: > On 2021-05-17 22:33, olcott wrote: >> On 5/17/2021 11:13 PM, André G. Isaak wrote: >>> On 2021-05-17 19:17, olcott wrote: >>> >>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>>> say ŵ. This string, in addition to being the description of Ĥ can >>>> also be used >>>> as input string. We can therefore legitimately ask what would happen >>>> if Ĥ is >>>> applied to ŵ. >>>> >>>> ** That notation was provided by Ben >>>> >>>> Unless the nested simulations specified by <Ĥ> are terminated at >>>> some point they are infinite and Ĥ(<Ĥ>) never halts. >>> >>> What do you mean "specified by <Ĥ>"? Nothing in the text above even >>> mentions simulations, nested or otherwise. >>> >>> André >>> >> >> It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep >> remembering that ŵ is the Turing machine description of Ĥ. >> >> It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. >> Ben and I have been talking about these things since 2006. > > You seem, as usual, to be missing my point, which was that nothing in > the above description of H_Hat makes any mention of simulation. Above > you are suggesting that there is something about how H_Hat is defined > which specifies 'nested simulations' which is simply not the case. > Linz's definition of H_Hat makes no mention of simulation at all. > > André > Once you add that H will try to decide by simulating its input, you get an effective nested simulation definition. What PO misses is that if H doesn't have any code to break the loop then H(H^,H^) fails to answer and thus fails to be a decider, or H does have code to break that loop, at which point the nested simulation won't be infinite. Only by NOT defining what H WILL do and changing the question to what H should do to get the right answer do we get into the conundrum that Peter runs into. He then fails to note that this conundrum is actually the answer he doesn't want to hear, that it is telling him that there is NO H that can give a right answer.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-18 08:53 -0500 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <gOGdnfCMK4MnWz79nZ2dnUU7-U3NnZ2d@giganews.com> |
| In reply to | #33848 |
On 5/18/2021 12:33 AM, André G. Isaak wrote: > On 2021-05-17 22:33, olcott wrote: >> On 5/17/2021 11:13 PM, André G. Isaak wrote: >>> On 2021-05-17 19:17, olcott wrote: >>> >>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>>> say ŵ. This string, in addition to being the description of Ĥ can >>>> also be used >>>> as input string. We can therefore legitimately ask what would happen >>>> if Ĥ is >>>> applied to ŵ. >>>> >>>> ** That notation was provided by Ben >>>> >>>> Unless the nested simulations specified by <Ĥ> are terminated at >>>> some point they are infinite and Ĥ(<Ĥ>) never halts. >>> >>> What do you mean "specified by <Ĥ>"? Nothing in the text above even >>> mentions simulations, nested or otherwise. >>> >>> André >>> >> >> It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep >> remembering that ŵ is the Turing machine description of Ĥ. >> >> It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. >> Ben and I have been talking about these things since 2006. > > You seem, as usual, to be missing my point, which was that nothing in > the above description of H_Hat makes any mention of simulation. That is irrelevant. The point of simulation is that it is a method that does make the input decidable. H.q0 wM w ⊢* H.qy ∞ H.q0 wM w ⊢* H.qn The wildcard state transitions from H.q0 to H.qy or H.qn are the "do any damn thing you want" as lomg as H.qy or H.qn correctly decides halting on (wM w) state transitions. > Above > you are suggesting that there is something about how H_Hat is defined > which specifies 'nested simulations' which is simply not the case. > Linz's definition of H_Hat makes no mention of simulation at all. > > André > Of course he doesn't he doesn't know about the correct refutation of his own proof so he is not going to write about it. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-18 13:37 +0100 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <87mtssz09a.fsf@bsb.me.uk> |
| In reply to | #33847 |
olcott <NoOne@NoWhere.com> writes: > On 5/17/2021 11:13 PM, André G. Isaak wrote: >> On 2021-05-17 19:17, olcott wrote: >> >>> The following is referred to as: Ĥ(<Ĥ>) ** >>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>> say ŵ. This string, in addition to being the description of Ĥ can also be used >>> as input string. We can therefore legitimately ask what would happen if Ĥ is >>> applied to ŵ. >>> >>> ** That notation was provided by Ben >>> >>> Unless the nested simulations specified by <Ĥ> are terminated at some point they are infinite and Ĥ(<Ĥ>) never halts. >> >> What do you mean "specified by <Ĥ>"? Nothing in the text above even mentions simulations, nested or otherwise. >> > > It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep > remembering that ŵ is the Turing machine description of Ĥ. This does not answer André's question. He is pointing out you have no departed from Linz. It is your H and your Ĥ you are now talking about. Linz makes no assumptions about H doing any simulation. > It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. > Ben and I have been talking about these things since 2006. You repeatedly refused to use a proper notation, and now that you have decided to use one you are misrepresenting mine. I wrote [M] for the string encoding TM, M and <x, y> for the string encoding the pair of strings x and y. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-18 09:01 -0500 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <gOGdneyMK4PgVT79nZ2dnUU7-U2dnZ2d@giganews.com> |
| In reply to | #33855 |
On 5/18/2021 7:37 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/17/2021 11:13 PM, André G. Isaak wrote: >>> On 2021-05-17 19:17, olcott wrote: >>> >>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>>> say ŵ. This string, in addition to being the description of Ĥ can also be used >>>> as input string. We can therefore legitimately ask what would happen if Ĥ is >>>> applied to ŵ. >>>> >>>> ** That notation was provided by Ben >>>> >>>> Unless the nested simulations specified by <Ĥ> are terminated at some point they are infinite and Ĥ(<Ĥ>) never halts. >>> >>> What do you mean "specified by <Ĥ>"? Nothing in the text above even mentions simulations, nested or otherwise. >>> >> >> It is clearer to say Ĥ(<Ĥ>) than it is to say Ĥ(ŵ) and keep >> remembering that ŵ is the Turing machine description of Ĥ. > > This does not answer André's question. He is pointing out you have no > departed from Linz. It is your H and your Ĥ you are now talking about. > Linz makes no assumptions about H doing any simulation. > >> It is clearer to say Ĥ(<Ĥ>) than it is to say H applied to <Ĥ>. >> Ben and I have been talking about these things since 2006. > > You repeatedly refused to use a proper notation, and now that you have > decided to use one you are misrepresenting mine. I wrote [M] for the > string encoding TM, M and <x, y> for the string encoding the pair of > strings x and y. > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn The above is adapted from (Linz:1990:319). It shows that Turing machine Ĥ copies its input at (q0) and begins executing an embedded copy of the original halt decider with this input at (qx). The (qy) state indicates that the halt decider decides that its input would halt. The ((qn)) state indicates the input would not halt. The appended (qa) and (qb) states cause Ĥ to infinitely loop if the halt decider decides that its input would halt. Linz, Peter 1990. An Introduction to Formal Languages and Automata. Lexington/Toronto: D. C. Heath and Company. The above definition specifies this execution trace: It can be understood from the above specification that when the embedded halt decider @Ĥ.qx bases its halting decision on simulating its input, and it has ([Ĥ],[Ĥ]) as its input that: Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy... Unless you understand and agree that the above sequence would be the sequence derived when the copy of H @Ĥ.qx is a simulating halt decider for this computation Ĥ([Ĥ]) then you and I have to stay eternally on this point until we do have a mutual understanding. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-18 17:58 +0000 |
| Subject | Re: New test program (Succeeds V2)[ self-reference ] |
| Message-ID | <20210518105053.738@kylheku.com> |
| In reply to | #33862 |
On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: > Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with > this copy then > Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with > this copy then > Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with > this copy... Here, you are recognizing that there is an infinite regress when you follow the state machine logic. The halting decision is not terminating. If you want to demonstrate termination, you have to repair this somehow. To repair it, you need a halting algorithm. The "halting problem" says that there isn't one. Where does Linz say that there is a halting algorithm that can repair the state machine configuration into being able to decide halting? -- 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-17 09:58 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ] |
| Message-ID | <_LednVrB0N_4GT_9nZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #33763 |
On 5/16/2021 10:16 PM, André G. Isaak wrote: > On 2021-05-16 19:31, olcott wrote: >> On 5/16/2021 8:17 PM, André G. Isaak wrote: >>> On 2021-05-16 19:04, olcott wrote: >>>> On 5/16/2021 4:26 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>> But this is from a man who still stands by this kind of nonsense: >>>>> >>>>> "the fact that a computation halts does not entail that it is a >>>>> halting computation" >>>>> >>>> >>>> _Infinite_Loop() >>>> [00000aaf](01) 55 push ebp >>>> [00000ab0](02) 8bec mov ebp,esp >>>> [00000ab2](02) ebfe jmp 00000ab2 >>>> [00000ab4](01) 5d pop ebp >>>> [00000ab5](01) c3 ret >>>> Size in bytes:(0007) [00000ab5] >>>> >>>> // (a) The instruction is a JMP instruction. >>>> // (b) It is jumping upward or to its own address. >>>> // (c) There are no conditional branch instructions inbetween. >>>> // (d) There are no other JMP instructions inbetween (André G. Isaak) >>>> >>>> You already agreed that when simulation of an infinite loop is >>>> terminated on the basis that its behavior matches the >>>> [infinite_loop] behavior pattern that the fact that this infinite >>>> loop does halt does not entail that it is a halting computation. >>> >>> Halting has absolutely nothing to do with what happens inside some >>> modified simulator. It is only concerned with the actual behaviour of >>> a computation. >>> >>> And in your simulator, the infinite loop doesn't halt. Your simulator >>> simply prematurely stops simulating it. For a simulation to halt, it >>> would need reach one of the simulated TMs final states. >>> >>> André >>> >> >> Unless simulating halt decider H or the embedded copy of H @Ĥ.qx stops >> simulating Ĥ at some point the simulation of Ĥ will never stop. > > And that OR is the major problem with your 'analysis'. > > If the simulation can be stopped by either H OR some code embedded in > H_Hat, then your H *cannot* legitimately claim that it *needed* to stop > the simulation. It did not. > Yes I can. When-so-ever the input to any simulating halt decider would not stop unless the simulation was aborted then the input <is> correctly decided as non-halting. _Infinite_Loop() [00000aaf](01) 55 push ebp [00000ab0](02) 8bec mov ebp,esp [00000ab2](02) ebfe jmp 00000ab2 [00000ab4](01) 5d pop ebp [00000ab5](01) c3 ret Size in bytes:(0007) [00000ab5] // (a) The instruction is a JMP instruction. // (b) It is jumping upward or to its own address. // (c) There are no conditional branch instructions inbetween. // (d) There are no other JMP instructions inbetween (André G. Isaak) > Your 'halting criterion' can't refer to things done by code contained in > its input, since the Halt decider has no idea what its input might be. Did you think that halt deciders are psychic? If a halt decider recognizes a non-halting behavior pattern in the simulation of its input the halt decider stops simulating this input and decides non-halting. > Either your halt decider must stop the simulation to avoid infinite > simulation or it must not. In the case of H_Hat, it must not because the > code contained in H_Hat ensures that the H_Hat will eventually stop. As long as the simulation of the input ever has to be stopped to prevent the infinite execution this input does specify non-halting. The first halt decider recognizing this reports it. This corrected non-halting criterion unravels the pathological self-reference error. > So > if your Halts() claims that it (i.e. the uppermost Halts, not some code > contained in H_Hat) must stop H_Hat it is simply wrong. > > André > As long as any halt decider must ever stop simulating its input the input does specify non-halting. The first halt decider that see this reports it. The convoluted way of saying Ĥ(<Ĥ>): Now Ĥ is a Turing machine, so that it will have some description in Σ*, say ŵ. This string, in addition to being the description of Ĥ can also be used as input string. We can therefore legitimately ask what would happen if Ĥ is applied to ŵ. Because Ĥ(<Ĥ>) must abort the simulation of its input ∴ this input <is> correctly decided as non-halting. Because H(<Ĥ>,<Ĥ>) must abort the simulation of its input ∴ this input <is> correctly decided as non-halting. >> Thus meeting this Truism non-halting criteria: >> >> 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. >> >> >> >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >> >> The above is adapted from (Linz:1990:319). >> It shows that Turing machine Ĥ copies its input at (q0) and begins >> executing an embedded copy of the original halt decider with this >> input at (qx). >> >> The (qy) state indicates that the halt decider decides that its input >> would halt. The ((qn)) state indicates the input would not halt. The >> appended (qa) and (qb) states cause Ĥ to infinitely loop if the halt >> decider decides that its input would halt. >> >> It can be understood from the above specification that when the >> embedded halt decider @Ĥ.qx bases its halting decision on simulating >> its input, and it has (Ĥ, Ĥ) as its input that: >> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >> this copy then >> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >> this copy then >> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >> this copy... >> unless and until the halt decider @Ĥ.qx stops simulating its input. >> >> Linz, Peter 1990. An Introduction to Formal Languages and Automata. >> Lexington/Toronto: D. C. Heath and Company. >> >> > > -- 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-17 09:27 -0600 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ] |
| Message-ID | <s7u207$epe$1@dont-email.me> |
| In reply to | #33780 |
On 2021-05-17 08:58, olcott wrote: > On 5/16/2021 10:16 PM, André G. Isaak wrote: >> On 2021-05-16 19:31, olcott wrote: >>> On 5/16/2021 8:17 PM, André G. Isaak wrote: >>>> On 2021-05-16 19:04, olcott wrote: >>>>> On 5/16/2021 4:26 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>> But this is from a man who still stands by this kind of nonsense: >>>>>> >>>>>> "the fact that a computation halts does not entail that it is a >>>>>> halting computation" >>>>>> >>>>> >>>>> _Infinite_Loop() >>>>> [00000aaf](01) 55 push ebp >>>>> [00000ab0](02) 8bec mov ebp,esp >>>>> [00000ab2](02) ebfe jmp 00000ab2 >>>>> [00000ab4](01) 5d pop ebp >>>>> [00000ab5](01) c3 ret >>>>> Size in bytes:(0007) [00000ab5] >>>>> >>>>> // (a) The instruction is a JMP instruction. >>>>> // (b) It is jumping upward or to its own address. >>>>> // (c) There are no conditional branch instructions inbetween. >>>>> // (d) There are no other JMP instructions inbetween (André G. Isaak) >>>>> >>>>> You already agreed that when simulation of an infinite loop is >>>>> terminated on the basis that its behavior matches the >>>>> [infinite_loop] behavior pattern that the fact that this infinite >>>>> loop does halt does not entail that it is a halting computation. >>>> >>>> Halting has absolutely nothing to do with what happens inside some >>>> modified simulator. It is only concerned with the actual behaviour >>>> of a computation. >>>> >>>> And in your simulator, the infinite loop doesn't halt. Your >>>> simulator simply prematurely stops simulating it. For a simulation >>>> to halt, it would need reach one of the simulated TMs final states. >>>> >>>> André >>>> >>> >>> Unless simulating halt decider H or the embedded copy of H @Ĥ.qx >>> stops simulating Ĥ at some point the simulation of Ĥ will never stop. >> >> And that OR is the major problem with your 'analysis'. >> >> If the simulation can be stopped by either H OR some code embedded in >> H_Hat, then your H *cannot* legitimately claim that it *needed* to >> stop the simulation. It did not. >> > > Yes I can. When-so-ever the input to any simulating halt decider would > not stop unless the simulation was aborted then the input <is> correctly > decided as non-halting. The problem is that you are being sloppy with respect to your wording. If you are describing how a halt decider works, then "then simulation" can only refer to the simulation which is being performed by Halts(). The simulation triggered by the call to Halts() *inside* H_Hat is part of the input computation. It is not part of your Halt Decider. Your Halt decider does not *need* to stop the simulation. If it does not, then H_Hat itself will ultimately stop the simulation using the logic inside its own private copy of Halts(). Just because that code happens to be built around a piece of code which is identical to your Halt decider doesn't make it an extension of your Halt decider. It is part of the input computation, not the Halt decider. > _Infinite_Loop() > [00000aaf](01) 55 push ebp > [00000ab0](02) 8bec mov ebp,esp > [00000ab2](02) ebfe jmp 00000ab2 > [00000ab4](01) 5d pop ebp > [00000ab5](01) c3 ret > Size in bytes:(0007) [00000ab5] > > // (a) The instruction is a JMP instruction. > // (b) It is jumping upward or to its own address. > // (c) There are no conditional branch instructions inbetween. > // (d) There are no other JMP instructions inbetween (André G. Isaak) > >> Your 'halting criterion' can't refer to things done by code contained >> in its input, since the Halt decider has no idea what its input might be. > > Did you think that halt deciders are psychic? Non sequitur. > If a halt decider recognizes a non-halting behavior pattern in the > simulation of its input the halt decider stops simulating this input and > decides non-halting. But it needs to *correctly* recognize non-halting behaviour. Yours does not. If your Halts() did not abort its input, the input would still halt. >> Either your halt decider must stop the simulation to avoid infinite >> simulation or it must not. In the case of H_Hat, it must not because >> the code contained in H_Hat ensures that the H_Hat will eventually stop. > > As long as the simulation of the input ever has to be stopped to prevent The input to the Halt decider is H_Hat(H_Hat). That's the only thing your Halts() is simulating. Any subsequent calls to halts involve simulations being performed by the input computation, not by Halts. > the infinite execution this input does specify non-halting. The first > halt decider recognizing this reports it. There is only one halt decider. It is the topmost call to Halts. All subsequent calls to Halts are part of the input computation which is not a halt decider. > This corrected non-halting criterion unravels the pathological > self-reference error. > >> So if your Halts() claims that it (i.e. the uppermost Halts, not some >> code contained in H_Hat) must stop H_Hat it is simply wrong. >> >> André >> > > As long as any halt decider must ever stop simulating its input the > input does specify non-halting. The first halt decider that see this > reports it. Again, there is only one halt decider running. That would be the topmost Halts(). Talk about the 'first halt decider' is nonsense. André > The convoluted way of saying Ĥ(<Ĥ>): > Now Ĥ is a Turing machine, so that it will have some description in Σ*, > say ŵ. This string, in addition to being the description of Ĥ can also > be used > as input string. We can therefore legitimately ask what would happen if > Ĥ is > applied to ŵ. > > Because Ĥ(<Ĥ>) must abort the simulation of its input ∴ this input <is> > correctly decided as non-halting. > > Because H(<Ĥ>,<Ĥ>) must abort the simulation of its input ∴ this input > <is> correctly decided as non-halting. > > >>> Thus meeting this Truism non-halting criteria: >>> >>> 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. >>> >>> >>> >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>> >>> The above is adapted from (Linz:1990:319). >>> It shows that Turing machine Ĥ copies its input at (q0) and begins >>> executing an embedded copy of the original halt decider with this >>> input at (qx). >>> >>> The (qy) state indicates that the halt decider decides that its input >>> would halt. The ((qn)) state indicates the input would not halt. The >>> appended (qa) and (qb) states cause Ĥ to infinitely loop if the halt >>> decider decides that its input would halt. >>> >>> It can be understood from the above specification that when the >>> embedded halt decider @Ĥ.qx bases its halting decision on simulating >>> its input, and it has (Ĥ, Ĥ) as its input that: >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy then >>> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with >>> this copy... >>> unless and until the halt decider @Ĥ.qx stops simulating its input. >>> >>> Linz, Peter 1990. An Introduction to Formal Languages and Automata. >>> Lexington/Toronto: D. C. Heath and Company. >>> >>> >> >> > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-17 07:42 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ] |
| Message-ID | <bEsoI.84713$qy1.23335@fx26.iad> |
| In reply to | #33745 |
On 5/16/21 9:31 PM, olcott wrote: > > Unless simulating halt decider H or the embedded copy of H @Ĥ.qx stops > simulating Ĥ at some point the simulation of Ĥ will never stop. And, as Andre points out, if the embedded copy is what stops the otherwise infinite execution, then it is the algorithm of H^ that stopped it so the execution of H^ is really finite. Your logic would say that the following is a infinite loop: for(int i; isLessThan(i, 5); i++) continue; because it is only isLessThan that stops the loop, not the loop itself. Is that REALLY what you mean to say?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-18 01:56 +0100 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ] |
| Message-ID | <87wnrw271v.fsf@bsb.me.uk> |
| In reply to | #33739 |
olcott <NoOne@NoWhere.com> writes: > You already agreed that when simulation of an infinite loop is > terminated on the basis that its behavior matches the [infinite_loop] > behavior pattern that the fact that this infinite loop does halt does > not entail that it is a halting computation. No. -- Ben. "Whether a computation is finite is more nuanced than it simply stops running" Peter Olcott, May 2021.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-17 16:13 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ](first repeat) |
| Message-ID | <-dGdnVJjoqC1QT_9nZ2dnUU7-KmdnZ2d@giganews.com> |
| In reply to | #33729 |
On 5/16/2021 4:26 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > > But this is from a man who still stands by this kind of nonsense: > > "the fact that a computation halts does not entail that it is a > halting computation" > _Infinite_Loop() [00000aaf](01) 55 push ebp [00000ab0](02) 8bec mov ebp,esp [00000ab2](02) ebfe jmp 00000ab2 [00000ab4](01) 5d pop ebp [00000ab5](01) c3 ret Size in bytes:(0007) [00000ab5] // (a) The instruction is a JMP instruction. // (b) It is jumping upward or to its own address. // (c) There are no conditional branch instructions inbetween. // (d) There are no other JMP instructions inbetween (André G. Isaak) You already agreed that when simulation of an infinite loop is terminated on the basis that its behavior matches the [infinite_loop] behavior pattern that the fact that this infinite loop does halt does not entail that it is a halting computation. -- 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-17 21:39 +0000 |
| Subject | Re: New test program (Succeeds V2)[ fess up ! ](first repeat) |
| Message-ID | <20210517143651.903@kylheku.com> |
| In reply to | #33795 |
On 2021-05-17, olcott <NoOne@NoWhere.com> wrote: > On 5/16/2021 4:26 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >> But this is from a man who still stands by this kind of nonsense: >> >> "the fact that a computation halts does not entail that it is a >> halting computation" >> > > _Infinite_Loop() > [00000aaf](01) 55 push ebp > [00000ab0](02) 8bec mov ebp,esp > [00000ab2](02) ebfe jmp 00000ab2 > [00000ab4](01) 5d pop ebp > [00000ab5](01) c3 ret > Size in bytes:(0007) [00000ab5] > > // (a) The instruction is a JMP instruction. > // (b) It is jumping upward or to its own address. > // (c) There are no conditional branch instructions inbetween. > // (d) There are no other JMP instructions inbetween (André G. Isaak) The conditions for detecting this loop are trivial. The loop is simpy not a test case which defies the partial decider. Look, it's not calling the decider anywhere and not "behaving opposite". You cannot extrapolate from the correctness of the criteria for this loop that your other criteria for the runaway simulation are correct. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
Page 25 of 50 — ← Prev page 1 … 23 24 [25] 26 27 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web