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 17 of 50 — ← Prev page 1 … 15 16 [17] 18 19 … 50 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-15 18:07 -0400 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <rCXnI.45562$zx1.16819@fx20.iad> |
| In reply to | #33636 |
On 5/15/21 4:10 PM, olcott wrote: > > To overcome the pathological self-reference error of the conventional > halting problem proofs we simply define halt decider H such that every > input P to halt decider H that itself calls H has the same halting value > as the halting value as input P2 adapted from input P where all calls to > H have been replaced with calls to Simulate. i.e. you want to define Halting as Non-Halting. BOOM logic system is inconsistent.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-16 22:50 +0100 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <87y2ce4acs.fsf@bsb.me.uk> |
| In reply to | #33636 |
olcott <NoOne@NoWhere.com> writes: > To overcome the pathological self-reference error of the conventional > halting problem proofs we simply define halt decider H such that every > input P to halt decider H that itself calls H has the same halting > value as the halting value as input P2 adapted from input P where all > calls to H have been replaced with calls to Simulate. Quite well put -- the two computations ruse of the silly-non-halting problem explained with about as much clarity as you can, given that you are not using a formal model of computation. It would be improved if you did not also try to pretend that you are dealing with the halting problem. If you were, there would be no need for all this verbiage because halting is simple to define. And of course there is a concrete example you've provided of a computation that halts which the silly-not-halting criterion declares to be non-halting. That exposes the pretence for what it is. There are lots if detailed problems too. You don't say what happens with computations that make no reference to "H". You don't say what happens with computations that calls something computationally equivalent to itself that calls "H" but with is not literally "H"[1]. All of these make your silly-non-halting problem undecidable. [1] Clumsy words because I am echoing yours. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 17:09 -0500 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <Cb-dnZzWkctQCjz9nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #33727 |
On 5/16/2021 4:50 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> To overcome the pathological self-reference error of the conventional >> halting problem proofs we simply define halt decider H such that every >> input P to halt decider H that itself calls H has the same halting >> value as the halting value as input P2 adapted from input P where all >> calls to H have been replaced with calls to Simulate. > > Quite well put -- the two computations ruse of the silly-non-halting > problem explained with about as much clarity as you can, given that you > are not using a formal model of computation. The above <is not> and algorithm to be used by any halt decider. It is ONLY a conceptual hypothetical example so that the human mind can grasp the gist of how this truism: On 5/11/2021 11:10 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Truism: >> Every simulation that would never stop unless Halts() stops >> it at some point specifies infinite execution. > > Any algorithm that implements this truism is, of course, a halting > decider. does actually correctly decide the halting problem instances as non-halting when they match one [infinitely_nested_simulation] non-halting behavior pattern or another. -- 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-17 01:52 +0100 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <87mtsu41wj.fsf@bsb.me.uk> |
| In reply to | #33733 |
olcott <NoOne@NoWhere.com> writes: > On 5/16/2021 4:50 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> To overcome the pathological self-reference error of the conventional >>> halting problem proofs we simply define halt decider H such that every >>> input P to halt decider H that itself calls H has the same halting >>> value as the halting value as input P2 adapted from input P where all >>> calls to H have been replaced with calls to Simulate. >> >> Quite well put -- the two computations ruse of the silly-non-halting >> problem explained with about as much clarity as you can, given that you >> are not using a formal model of computation. > > The above <is not> and algorithm to be used by any halt decider. Of course. It's got very little to with the halting problem. It's a partial definition of your silly-not-halting problem. You are not dealing with the halting problem anymore. In fact, it's not clear if you are dealing with reality anymore: "Whether a computation is finite is more nuanced than it simply stops running..." "the fact that a computation halts does not entail that it is a halting computation" -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 20:25 -0500 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <L66dnf-rx5BUWDz9nZ2dnUU7-UHNnZ2d@giganews.com> |
| In reply to | #33738 |
On 5/16/2021 7:52 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/16/2021 4:50 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> To overcome the pathological self-reference error of the conventional >>>> halting problem proofs we simply define halt decider H such that every >>>> input P to halt decider H that itself calls H has the same halting >>>> value as the halting value as input P2 adapted from input P where all >>>> calls to H have been replaced with calls to Simulate. >>> >>> Quite well put -- the two computations ruse of the silly-non-halting >>> problem explained with about as much clarity as you can, given that you >>> are not using a formal model of computation. >> >> The above <is not> and algorithm to be used by any halt decider. > > Of course. It's got very little to with the halting problem. It's a > partial definition of your silly-not-halting problem. You are not > dealing with the halting problem anymore. > _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. 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. Intuitively, a decider should be a Turing machine that given an input, halts and either accepts or rejects, relaying its answer in one of many equivalent ways, such as halting at an ACCEPT or REJECT state, or leaving its answer on the output tape. https://cs.stackexchange.com/questions/84433/what-is-decider When non-halting behavior patterns are the measure of the above Truism reject state (not_halting) then the remaining inputs are in the accept state (halting). Every behavior pattern that correctly measures the Truism criteria does decide non-halting correctly. Various [infinitely_nested_simulation] non-halting patterns match the halting problem instances. -- 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-17 21:49 -0400 |
| Subject | Re: New test program (Succeeds V2)[ single-minded focus ] |
| Message-ID | <g2FoI.56601$DZ5.22715@fx23.iad> |
| In reply to | #33744 |
On 5/17/21 9:19 PM, olcott wrote: > On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> You already agreed that when simulation of an infinite loop is >>> terminated on the basis that its behavior matches the [infinite_loop] >>> behavior pattern that the fact that this infinite loop does halt does >>> not entail that it is a halting computation. >> >> No. You don't understand what I said, and your massive arrogance >> prevents you from trying to understand. >> >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> Truism: >>>>> Every simulation that would never stop unless Halts() stops >>>>> it at some point specifies infinite execution. >> >>> When non-halting behavior patterns are the measure of the above Truism >>> reject state (not_halting) then the remaining inputs are in the accept >>> state (halting). >>> >>> Every behavior pattern that correctly measures the Truism criteria >>> does decide non-halting correctly. >> >> Impossible to tell because this is just hand-waving, but a few facts can >> be teased from your waffle. The function you are so carefully hiding >> called Halts is wrong about the halting of at least one computation. >> Any algorithm that can decide whether a simulation will stop or not is a >> halt decider (and therefore impossible). To use a halt decider in order >> to give the wrong answer for the halting of a computation is a delicious >> kind of ironic madness that can only pop up on Usenet. >> > > The following is referred to as: Ĥ(<Ĥ>) ** > Now Ĥ is a Turing machine, so that it will have some description in Σ*, > say ŵ. This string, in addition to being the description of Ĥ can also > be used > as input string. We can therefore legitimately ask what would happen if > Ĥ is > applied to ŵ. > > ** That notation was provided by Ben > > Unless the nested simulations specified by <Ĥ> are terminated at some > point they are infinite and Ĥ(<Ĥ>) never halts. > > The fact that these nested simulations must be terminated at some point > proves that <Ĥ> specifies an infinite computation and can be correctly > decided as non-halting. > > And what you miss is that if the algorithm in the copy of H that is in H^ doesn't know how to stop this infinite recursion, than neither does H, and thus H(H^,H^) will not return and thus H fails to be a decider. If the algorithm in the copy of H does know how to stop this, then H^ when run as a machine WILL Halt on its own, and be a Halting Computation. The problem is that H isn't smart enough to know that the H inside H^ will stop the simulation itself, so H^ will be Halting. And then, if it was, then H^ would see that and become non-Halting, as H^ is always one step ahead of H in logic, since H needs to make its decison first.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-17 22:28 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <ws-dnQg5huvZqT79nZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #33826 |
On 5/17/2021 8:49 PM, Richard Damon wrote: > On 5/17/21 9:19 PM, olcott wrote: >> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> You already agreed that when simulation of an infinite loop is >>>> terminated on the basis that its behavior matches the [infinite_loop] >>>> behavior pattern that the fact that this infinite loop does halt does >>>> not entail that it is a halting computation. >>> >>> No. You don't understand what I said, and your massive arrogance >>> prevents you from trying to understand. >>> >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> Truism: >>>>>> Every simulation that would never stop unless Halts() stops >>>>>> it at some point specifies infinite execution. >>> >>>> When non-halting behavior patterns are the measure of the above Truism >>>> reject state (not_halting) then the remaining inputs are in the accept >>>> state (halting). >>>> >>>> Every behavior pattern that correctly measures the Truism criteria >>>> does decide non-halting correctly. >>> >>> Impossible to tell because this is just hand-waving, but a few facts can >>> be teased from your waffle. The function you are so carefully hiding >>> called Halts is wrong about the halting of at least one computation. >>> Any algorithm that can decide whether a simulation will stop or not is a >>> halt decider (and therefore impossible). To use a halt decider in order >>> to give the wrong answer for the halting of a computation is a delicious >>> kind of ironic madness that can only pop up on Usenet. >>> >> >> The following is referred to as: Ĥ(<Ĥ>) ** >> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >> say ŵ. This string, in addition to being the description of Ĥ can also >> be used >> as input string. We can therefore legitimately ask what would happen if >> Ĥ is >> applied to ŵ. >> >> ** That notation was provided by Ben >> >> Unless the nested simulations specified by <Ĥ> are terminated at some >> point they are infinite and Ĥ(<Ĥ>) never halts. >> >> The fact that these nested simulations must be terminated at some point >> proves that <Ĥ> specifies an infinite computation and can be correctly >> decided as non-halting. >> >> > > > And what you miss is that if the algorithm in the copy of H that is in > H^ doesn't know how to stop this infinite recursion, than neither does > H, and thus H(H^,H^) will not return and thus H fails to be a decider. > If the algorithm in the copy of H does know how to stop this, then H^ > when run as a machine WILL Halt on its own, and be a Halting Computation. > This is the part that you (and others) continue to fail to understand: The following is referred to as: Ĥ(<Ĥ>) ** 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 by Ĥ. > The problem is that H isn't smart enough to know that the H inside H^ > will stop the simulation itself, so H^ will be Halting. > > And then, if it was, then H^ would see that and become non-Halting, as > H^ is always one step ahead of H in logic, since H needs to make its > decison first. > -- 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-18 07:16 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <DmNoI.608506$%W6.148302@fx44.iad> |
| In reply to | #33843 |
On 5/17/21 11:28 PM, olcott wrote: > On 5/17/2021 8:49 PM, Richard Damon wrote: >> On 5/17/21 9:19 PM, olcott wrote: >>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> You already agreed that when simulation of an infinite loop is >>>>> terminated on the basis that its behavior matches the [infinite_loop] >>>>> behavior pattern that the fact that this infinite loop does halt does >>>>> not entail that it is a halting computation. >>>> >>>> No. You don't understand what I said, and your massive arrogance >>>> prevents you from trying to understand. >>>> >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> Truism: >>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>> it at some point specifies infinite execution. >>>> >>>>> When non-halting behavior patterns are the measure of the above Truism >>>>> reject state (not_halting) then the remaining inputs are in the accept >>>>> state (halting). >>>>> >>>>> Every behavior pattern that correctly measures the Truism criteria >>>>> does decide non-halting correctly. >>>> >>>> Impossible to tell because this is just hand-waving, but a few facts >>>> can >>>> be teased from your waffle. The function you are so carefully hiding >>>> called Halts is wrong about the halting of at least one computation. >>>> Any algorithm that can decide whether a simulation will stop or not >>>> is a >>>> halt decider (and therefore impossible). To use a halt decider in >>>> order >>>> to give the wrong answer for the halting of a computation is a >>>> delicious >>>> kind of ironic madness that can only pop up on Usenet. >>>> >>> >>> The following is referred to as: Ĥ(<Ĥ>) ** >>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>> say ŵ. This string, in addition to being the description of Ĥ can also >>> be used >>> as input string. We can therefore legitimately ask what would happen if >>> Ĥ is >>> applied to ŵ. >>> >>> ** That notation was provided by Ben >>> >>> Unless the nested simulations specified by <Ĥ> are terminated at some >>> point they are infinite and Ĥ(<Ĥ>) never halts. >>> >>> The fact that these nested simulations must be terminated at some point >>> proves that <Ĥ> specifies an infinite computation and can be correctly >>> decided as non-halting. >>> >>> >> >> >> And what you miss is that if the algorithm in the copy of H that is in >> H^ doesn't know how to stop this infinite recursion, than neither does >> H, and thus H(H^,H^) will not return and thus H fails to be a decider. > >> If the algorithm in the copy of H does know how to stop this, then H^ >> when run as a machine WILL Halt on its own, and be a Halting Computation. >> > > This is the part that you (and others) continue to fail to understand: > > The following is referred to as: Ĥ(<Ĥ>) ** > 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 by Ĥ. > The point YOU continue to fail to understand is that BECAUSE H DOES have the logic to abort the otherwise infinite recursion, so does the copy of H in H^, and because of that H^ will be finite in execution. The outer deciding simulator decides wrong that it NEEDS to abort at this time, because it fails to take into account that the copy of it within H^ that it is simulating will also be able to make this same decision. The fact that it will, is what makes H^ finite in execution. The only 'pathology' involved is bad logic that refuses to see this happening. A second problem is that you are trying to show that H can somehow return the 'right' answer. But your logic of doing so is broken. The ONLY answer that H can return is the answer its algorithm says it should, whether that answer is right or wrong for the halting problem. Trying to re-frame that to what is the right answer it can give then DOES get into having to deal with a logic problem with self-reference, which can be used to show that there is no answer. As I have said before, this is like the game of Tic-Tac-Toe. It is a well defined and playable game. If you establish a goal of creating a strategy to always win, you will find that goal impossible. So you need to live with that result. Exactly like when we play the Halting Problem Game, we can't always win and make the right decision.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-18 09:05 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <MuCdnfr7hsjEVD79nZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #33852 |
On 5/18/2021 6:16 AM, Richard Damon wrote: > On 5/17/21 11:28 PM, olcott wrote: >> On 5/17/2021 8:49 PM, Richard Damon wrote: >>> On 5/17/21 9:19 PM, olcott wrote: >>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> You already agreed that when simulation of an infinite loop is >>>>>> terminated on the basis that its behavior matches the [infinite_loop] >>>>>> behavior pattern that the fact that this infinite loop does halt does >>>>>> not entail that it is a halting computation. >>>>> >>>>> No. You don't understand what I said, and your massive arrogance >>>>> prevents you from trying to understand. >>>>> >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> Truism: >>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>> it at some point specifies infinite execution. >>>>> >>>>>> When non-halting behavior patterns are the measure of the above Truism >>>>>> reject state (not_halting) then the remaining inputs are in the accept >>>>>> state (halting). >>>>>> >>>>>> Every behavior pattern that correctly measures the Truism criteria >>>>>> does decide non-halting correctly. >>>>> >>>>> Impossible to tell because this is just hand-waving, but a few facts >>>>> can >>>>> be teased from your waffle. The function you are so carefully hiding >>>>> called Halts is wrong about the halting of at least one computation. >>>>> Any algorithm that can decide whether a simulation will stop or not >>>>> is a >>>>> halt decider (and therefore impossible). To use a halt decider in >>>>> order >>>>> to give the wrong answer for the halting of a computation is a >>>>> delicious >>>>> kind of ironic madness that can only pop up on Usenet. >>>>> >>>> >>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*, >>>> say ŵ. This string, in addition to being the description of Ĥ can also >>>> be used >>>> as input string. We can therefore legitimately ask what would happen if >>>> Ĥ is >>>> applied to ŵ. >>>> >>>> ** That notation was provided by Ben >>>> >>>> Unless the nested simulations specified by <Ĥ> are terminated at some >>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>> >>>> The fact that these nested simulations must be terminated at some point >>>> proves that <Ĥ> specifies an infinite computation and can be correctly >>>> decided as non-halting. >>>> >>>> >>> >>> >>> And what you miss is that if the algorithm in the copy of H that is in >>> H^ doesn't know how to stop this infinite recursion, than neither does >>> H, and thus H(H^,H^) will not return and thus H fails to be a decider. >> >>> If the algorithm in the copy of H does know how to stop this, then H^ >>> when run as a machine WILL Halt on its own, and be a Halting Computation. >>> >> >> This is the part that you (and others) continue to fail to understand: >> >> The following is referred to as: Ĥ(<Ĥ>) ** >> 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 by Ĥ. >> > > The point YOU continue to fail to understand is that BECAUSE H DOES have > the logic to abort the otherwise infinite recursion, so does the copy of > H in H^, and because of that H^ will be finite in execution. > All that you have to do to understand is simply pay attention: When non-halting is defined as the requirement to abort the simulation of an input to prevent its infinite execution then the input [Ĥ] to Ĥ([Ĥ]) is correctly decided as non-halting. > The outer deciding simulator decides wrong that it NEEDS to abort at > this time, because it fails to take into account that the copy of it > within H^ that it is simulating will also be able to make this same > decision. The fact that it will, is what makes H^ finite in execution. > > The only 'pathology' involved is bad logic that refuses to see this > happening. > > A second problem is that you are trying to show that H can somehow > return the 'right' answer. But your logic of doing so is broken. The > ONLY answer that H can return is the answer its algorithm says it > should, whether that answer is right or wrong for the halting problem. > Trying to re-frame that to what is the right answer it can give then > DOES get into having to deal with a logic problem with self-reference, > which can be used to show that there is no answer. > > As I have said before, this is like the game of Tic-Tac-Toe. It is a > well defined and playable game. If you establish a goal of creating a > strategy to always win, you will find that goal impossible. So you need > to live with that result. Exactly like when we play the Halting Problem > Game, we can't always win and make the right decision. > -- 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-18 22:03 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <bm_oI.122450$Ms7.113723@fx34.iad> |
| In reply to | #33864 |
On 5/18/21 10:05 AM, olcott wrote: > On 5/18/2021 6:16 AM, Richard Damon wrote: >> On 5/17/21 11:28 PM, olcott wrote: >>> On 5/17/2021 8:49 PM, Richard Damon wrote: >>>> On 5/17/21 9:19 PM, olcott wrote: >>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> You already agreed that when simulation of an infinite loop is >>>>>>> terminated on the basis that its behavior matches the >>>>>>> [infinite_loop] >>>>>>> behavior pattern that the fact that this infinite loop does halt >>>>>>> does >>>>>>> not entail that it is a halting computation. >>>>>> >>>>>> No. You don't understand what I said, and your massive arrogance >>>>>> prevents you from trying to understand. >>>>>> >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> Truism: >>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>> it at some point specifies infinite execution. >>>>>> >>>>>>> When non-halting behavior patterns are the measure of the above >>>>>>> Truism >>>>>>> reject state (not_halting) then the remaining inputs are in the >>>>>>> accept >>>>>>> state (halting). >>>>>>> >>>>>>> Every behavior pattern that correctly measures the Truism criteria >>>>>>> does decide non-halting correctly. >>>>>> >>>>>> Impossible to tell because this is just hand-waving, but a few facts >>>>>> can >>>>>> be teased from your waffle. The function you are so carefully hiding >>>>>> called Halts is wrong about the halting of at least one computation. >>>>>> Any algorithm that can decide whether a simulation will stop or not >>>>>> is a >>>>>> halt decider (and therefore impossible). To use a halt decider in >>>>>> order >>>>>> to give the wrong answer for the halting of a computation is a >>>>>> delicious >>>>>> kind of ironic madness that can only pop up on Usenet. >>>>>> >>>>> >>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>> Now Ĥ is a Turing machine, so that it will have some description in >>>>> Σ*, >>>>> say ŵ. This string, in addition to being the description of Ĥ can also >>>>> be used >>>>> as input string. We can therefore legitimately ask what would >>>>> happen if >>>>> Ĥ is >>>>> applied to ŵ. >>>>> >>>>> ** That notation was provided by Ben >>>>> >>>>> Unless the nested simulations specified by <Ĥ> are terminated at some >>>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>>> >>>>> The fact that these nested simulations must be terminated at some >>>>> point >>>>> proves that <Ĥ> specifies an infinite computation and can be correctly >>>>> decided as non-halting. >>>>> >>>>> >>>> >>>> >>>> And what you miss is that if the algorithm in the copy of H that is in >>>> H^ doesn't know how to stop this infinite recursion, than neither does >>>> H, and thus H(H^,H^) will not return and thus H fails to be a decider. >>> >>>> If the algorithm in the copy of H does know how to stop this, then H^ >>>> when run as a machine WILL Halt on its own, and be a Halting >>>> Computation. >>>> >>> >>> This is the part that you (and others) continue to fail to understand: >>> >>> The following is referred to as: Ĥ(<Ĥ>) ** >>> 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 by Ĥ. >>> >> >> The point YOU continue to fail to understand is that BECAUSE H DOES have >> the logic to abort the otherwise infinite recursion, so does the copy of >> H in H^, and because of that H^ will be finite in execution. >> > > All that you have to do to understand is simply pay attention: > > When non-halting is defined as the requirement to abort the simulation > of an input to prevent its infinite execution then the input [Ĥ] to > Ĥ([Ĥ]) is correctly decided as non-halting. > Except that isn't the right definition of Halting. Now, with proper definitions of the terms, and the proper application of it, that description can be used to make a decision which matches the real definition. But you don't do that, so you get the wrong answer.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-18 21:24 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <SaadneHiUf486zn9nZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #33891 |
On 5/18/2021 9:03 PM, Richard Damon wrote: > On 5/18/21 10:05 AM, olcott wrote: >> On 5/18/2021 6:16 AM, Richard Damon wrote: >>> On 5/17/21 11:28 PM, olcott wrote: >>>> On 5/17/2021 8:49 PM, Richard Damon wrote: >>>>> On 5/17/21 9:19 PM, olcott wrote: >>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> You already agreed that when simulation of an infinite loop is >>>>>>>> terminated on the basis that its behavior matches the >>>>>>>> [infinite_loop] >>>>>>>> behavior pattern that the fact that this infinite loop does halt >>>>>>>> does >>>>>>>> not entail that it is a halting computation. >>>>>>> >>>>>>> No. You don't understand what I said, and your massive arrogance >>>>>>> prevents you from trying to understand. >>>>>>> >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> Truism: >>>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>>> it at some point specifies infinite execution. >>>>>>> >>>>>>>> When non-halting behavior patterns are the measure of the above >>>>>>>> Truism >>>>>>>> reject state (not_halting) then the remaining inputs are in the >>>>>>>> accept >>>>>>>> state (halting). >>>>>>>> >>>>>>>> Every behavior pattern that correctly measures the Truism criteria >>>>>>>> does decide non-halting correctly. >>>>>>> >>>>>>> Impossible to tell because this is just hand-waving, but a few facts >>>>>>> can >>>>>>> be teased from your waffle. The function you are so carefully hiding >>>>>>> called Halts is wrong about the halting of at least one computation. >>>>>>> Any algorithm that can decide whether a simulation will stop or not >>>>>>> is a >>>>>>> halt decider (and therefore impossible). To use a halt decider in >>>>>>> order >>>>>>> to give the wrong answer for the halting of a computation is a >>>>>>> delicious >>>>>>> kind of ironic madness that can only pop up on Usenet. >>>>>>> >>>>>> >>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>> Now Ĥ is a Turing machine, so that it will have some description in >>>>>> Σ*, >>>>>> say ŵ. This string, in addition to being the description of Ĥ can also >>>>>> be used >>>>>> as input string. We can therefore legitimately ask what would >>>>>> happen if >>>>>> Ĥ is >>>>>> applied to ŵ. >>>>>> >>>>>> ** That notation was provided by Ben >>>>>> >>>>>> Unless the nested simulations specified by <Ĥ> are terminated at some >>>>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>>>> >>>>>> The fact that these nested simulations must be terminated at some >>>>>> point >>>>>> proves that <Ĥ> specifies an infinite computation and can be correctly >>>>>> decided as non-halting. >>>>>> >>>>>> >>>>> >>>>> >>>>> And what you miss is that if the algorithm in the copy of H that is in >>>>> H^ doesn't know how to stop this infinite recursion, than neither does >>>>> H, and thus H(H^,H^) will not return and thus H fails to be a decider. >>>> >>>>> If the algorithm in the copy of H does know how to stop this, then H^ >>>>> when run as a machine WILL Halt on its own, and be a Halting >>>>> Computation. >>>>> >>>> >>>> This is the part that you (and others) continue to fail to understand: >>>> >>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>> 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 by Ĥ. >>>> >>> >>> The point YOU continue to fail to understand is that BECAUSE H DOES have >>> the logic to abort the otherwise infinite recursion, so does the copy of >>> H in H^, and because of that H^ will be finite in execution. >>> >> >> All that you have to do to understand is simply pay attention: >> >> When non-halting is defined as the requirement to abort the simulation >> of an input to prevent its infinite execution then the input [Ĥ] to >> Ĥ([Ĥ]) is correctly decided as non-halting. >> > > Except that isn't the right definition of Halting. Now, with proper > definitions of the terms, and the proper application of it, that > description can be used to make a decision which matches the real > definition. But you don't do that, so you get the wrong answer. > My uncoventional definition of halting <is> a correct definition <and> overcomes the pathological self-reference error of the halting theorem. There are no computations in the universe that <are> [halting computations] <and> [require their simulation to be terminated] to prevent them from never halting. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 06:58 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <zb6pI.44255$AU5.24374@fx29.iad> |
| In reply to | #33895 |
On 5/18/21 10:24 PM, olcott wrote: > On 5/18/2021 9:03 PM, Richard Damon wrote: >> On 5/18/21 10:05 AM, olcott wrote: >>> On 5/18/2021 6:16 AM, Richard Damon wrote: >>>> On 5/17/21 11:28 PM, olcott wrote: >>>>> On 5/17/2021 8:49 PM, Richard Damon wrote: >>>>>> On 5/17/21 9:19 PM, olcott wrote: >>>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> You already agreed that when simulation of an infinite loop is >>>>>>>>> terminated on the basis that its behavior matches the >>>>>>>>> [infinite_loop] >>>>>>>>> behavior pattern that the fact that this infinite loop does halt >>>>>>>>> does >>>>>>>>> not entail that it is a halting computation. >>>>>>>> >>>>>>>> No. You don't understand what I said, and your massive arrogance >>>>>>>> prevents you from trying to understand. >>>>>>>> >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> Truism: >>>>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>>>> it at some point specifies infinite execution. >>>>>>>> >>>>>>>>> When non-halting behavior patterns are the measure of the above >>>>>>>>> Truism >>>>>>>>> reject state (not_halting) then the remaining inputs are in the >>>>>>>>> accept >>>>>>>>> state (halting). >>>>>>>>> >>>>>>>>> Every behavior pattern that correctly measures the Truism criteria >>>>>>>>> does decide non-halting correctly. >>>>>>>> >>>>>>>> Impossible to tell because this is just hand-waving, but a few >>>>>>>> facts >>>>>>>> can >>>>>>>> be teased from your waffle. The function you are so carefully >>>>>>>> hiding >>>>>>>> called Halts is wrong about the halting of at least one >>>>>>>> computation. >>>>>>>> Any algorithm that can decide whether a simulation will stop or not >>>>>>>> is a >>>>>>>> halt decider (and therefore impossible). To use a halt decider in >>>>>>>> order >>>>>>>> to give the wrong answer for the halting of a computation is a >>>>>>>> delicious >>>>>>>> kind of ironic madness that can only pop up on Usenet. >>>>>>>> >>>>>>> >>>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>>> Now Ĥ is a Turing machine, so that it will have some description in >>>>>>> Σ*, >>>>>>> say ŵ. This string, in addition to being the description of Ĥ can >>>>>>> also >>>>>>> be used >>>>>>> as input string. We can therefore legitimately ask what would >>>>>>> happen if >>>>>>> Ĥ is >>>>>>> applied to ŵ. >>>>>>> >>>>>>> ** That notation was provided by Ben >>>>>>> >>>>>>> Unless the nested simulations specified by <Ĥ> are terminated at >>>>>>> some >>>>>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>>>>> >>>>>>> The fact that these nested simulations must be terminated at some >>>>>>> point >>>>>>> proves that <Ĥ> specifies an infinite computation and can be >>>>>>> correctly >>>>>>> decided as non-halting. >>>>>>> >>>>>>> >>>>>> >>>>>> >>>>>> And what you miss is that if the algorithm in the copy of H that >>>>>> is in >>>>>> H^ doesn't know how to stop this infinite recursion, than neither >>>>>> does >>>>>> H, and thus H(H^,H^) will not return and thus H fails to be a >>>>>> decider. >>>>> >>>>>> If the algorithm in the copy of H does know how to stop this, then H^ >>>>>> when run as a machine WILL Halt on its own, and be a Halting >>>>>> Computation. >>>>>> >>>>> >>>>> This is the part that you (and others) continue to fail to understand: >>>>> >>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>> 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 by Ĥ. >>>>> >>>> >>>> The point YOU continue to fail to understand is that BECAUSE H DOES >>>> have >>>> the logic to abort the otherwise infinite recursion, so does the >>>> copy of >>>> H in H^, and because of that H^ will be finite in execution. >>>> >>> >>> All that you have to do to understand is simply pay attention: >>> >>> When non-halting is defined as the requirement to abort the simulation >>> of an input to prevent its infinite execution then the input [Ĥ] to >>> Ĥ([Ĥ]) is correctly decided as non-halting. >>> >> >> Except that isn't the right definition of Halting. Now, with proper >> definitions of the terms, and the proper application of it, that >> description can be used to make a decision which matches the real >> definition. But you don't do that, so you get the wrong answer. >> > > My uncoventional definition of halting <is> a correct definition <and> > overcomes the pathological self-reference error of the halting theorem. No, it is NOT. There is ONE and only ONE CORRECT definition of Halting in Computation Theory. That is how Logic works. The CORRECT definition of Halting is to look at what the machine does when it is run. For H^(H^) that is to Halt. > > There are no computations in the universe that <are> [halting > computations] <and> [require their simulation to be terminated] to > prevent them from never halting. > Except maybe H^(H^)? (by your broken definitions) Since that top H that is deciding could be replaced with a plain UTM, and this finishes, the simulation of H^ does not REALLY need to be terminated, but you have defined that the termination clause to be true even if another copy of H within H^ simulating a copy of the description of H^(H^) stops is simulation, and THAT is an incorrect definition to make the statement true. That definition conflates the operation of the simulator with the actions within the simulation.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 10:13 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <p29pI.413362$2N3.208856@fx33.iad> |
| In reply to | #33903 |
On 5/19/21 9:36 AM, olcott wrote:
> On 5/19/2021 5:58 AM, Richard Damon wrote:
>> On 5/18/21 10:24 PM, olcott wrote:
>>> On 5/18/2021 9:03 PM, Richard Damon wrote:
>>>> On 5/18/21 10:05 AM, olcott wrote:
>>>>> On 5/18/2021 6:16 AM, Richard Damon wrote:
>>>>>> On 5/17/21 11:28 PM, olcott wrote:
>>>>>>> On 5/17/2021 8:49 PM, Richard Damon wrote:
>>>>>>>> On 5/17/21 9:19 PM, olcott wrote:
>>>>>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> You already agreed that when simulation of an infinite loop is
>>>>>>>>>>> terminated on the basis that its behavior matches the
>>>>>>>>>>> [infinite_loop]
>>>>>>>>>>> behavior pattern that the fact that this infinite loop does halt
>>>>>>>>>>> does
>>>>>>>>>>> not entail that it is a halting computation.
>>>>>>>>>>
>>>>>>>>>> No. You don't understand what I said, and your massive arrogance
>>>>>>>>>> prevents you from trying to understand.
>>>>>>>>>>
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> Truism:
>>>>>>>>>>>>> Every simulation that would never stop unless Halts() stops
>>>>>>>>>>>>> it at some point specifies infinite execution.
>>>>>>>>>>
>>>>>>>>>>> When non-halting behavior patterns are the measure of the above
>>>>>>>>>>> Truism
>>>>>>>>>>> reject state (not_halting) then the remaining inputs are in the
>>>>>>>>>>> accept
>>>>>>>>>>> state (halting).
>>>>>>>>>>>
>>>>>>>>>>> Every behavior pattern that correctly measures the Truism
>>>>>>>>>>> criteria
>>>>>>>>>>> does decide non-halting correctly.
>>>>>>>>>>
>>>>>>>>>> Impossible to tell because this is just hand-waving, but a few
>>>>>>>>>> facts
>>>>>>>>>> can
>>>>>>>>>> be teased from your waffle. The function you are so carefully
>>>>>>>>>> hiding
>>>>>>>>>> called Halts is wrong about the halting of at least one
>>>>>>>>>> computation.
>>>>>>>>>> Any algorithm that can decide whether a simulation will stop
>>>>>>>>>> or not
>>>>>>>>>> is a
>>>>>>>>>> halt decider (and therefore impossible). To use a halt
>>>>>>>>>> decider in
>>>>>>>>>> order
>>>>>>>>>> to give the wrong answer for the halting of a computation is a
>>>>>>>>>> delicious
>>>>>>>>>> kind of ironic madness that can only pop up on Usenet.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> The following is referred to as: Ĥ(<Ĥ>) **
>>>>>>>>> Now Ĥ is a Turing machine, so that it will have some
>>>>>>>>> description in
>>>>>>>>> Σ*,
>>>>>>>>> say ŵ. This string, in addition to being the description of Ĥ can
>>>>>>>>> also
>>>>>>>>> be used
>>>>>>>>> as input string. We can therefore legitimately ask what would
>>>>>>>>> happen if
>>>>>>>>> Ĥ is
>>>>>>>>> applied to ŵ.
>>>>>>>>>
>>>>>>>>> ** That notation was provided by Ben
>>>>>>>>>
>>>>>>>>> Unless the nested simulations specified by <Ĥ> are terminated at
>>>>>>>>> some
>>>>>>>>> point they are infinite and Ĥ(<Ĥ>) never halts.
>>>>>>>>>
>>>>>>>>> The fact that these nested simulations must be terminated at some
>>>>>>>>> point
>>>>>>>>> proves that <Ĥ> specifies an infinite computation and can be
>>>>>>>>> correctly
>>>>>>>>> decided as non-halting.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>> And what you miss is that if the algorithm in the copy of H that
>>>>>>>> is in
>>>>>>>> H^ doesn't know how to stop this infinite recursion, than neither
>>>>>>>> does
>>>>>>>> H, and thus H(H^,H^) will not return and thus H fails to be a
>>>>>>>> decider.
>>>>>>>
>>>>>>>> If the algorithm in the copy of H does know how to stop this,
>>>>>>>> then H^
>>>>>>>> when run as a machine WILL Halt on its own, and be a Halting
>>>>>>>> Computation.
>>>>>>>>
>>>>>>>
>>>>>>> This is the part that you (and others) continue to fail to
>>>>>>> understand:
>>>>>>>
>>>>>>> The following is referred to as: Ĥ(<Ĥ>) **
>>>>>>> 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 by Ĥ.
>>>>>>>
>>>>>>
>>>>>> The point YOU continue to fail to understand is that BECAUSE H DOES
>>>>>> have
>>>>>> the logic to abort the otherwise infinite recursion, so does the
>>>>>> copy of
>>>>>> H in H^, and because of that H^ will be finite in execution.
>>>>>>
>>>>>
>>>>> All that you have to do to understand is simply pay attention:
>>>>>
>>>>> When non-halting is defined as the requirement to abort the simulation
>>>>> of an input to prevent its infinite execution then the input [Ĥ] to
>>>>> Ĥ([Ĥ]) is correctly decided as non-halting.
>>>>>
>>>>
>>>> Except that isn't the right definition of Halting. Now, with proper
>>>> definitions of the terms, and the proper application of it, that
>>>> description can be used to make a decision which matches the real
>>>> definition. But you don't do that, so you get the wrong answer.
>>>>
>>>
>>> My uncoventional definition of halting <is> a correct definition <and>
>>> overcomes the pathological self-reference error of the halting theorem.
>>
>>
>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting
>> in Computation Theory. That is how Logic works.
>>
>> The CORRECT definition of Halting is to look at what the machine does
>> when it is run. For H^(H^) that is to Halt.
>>
>>
>
> On that basis we would conclude that _Infinite_Loop() is a halting
> computation:
>
No, WHEN does Infinite_Loop halt when it is run as an actual machine.
YOU are conflating the simulation of a machine (with a simulator that
might decide to terminate the simulation) with the actual halting
behavior of the actual machine.
If a sort-of simulator decides to stop simulating a machine, that
doesn't mean the actual machine halted. It actually doesn't tell us much
about the acutal machine.
That is like running a long running program on your computer and then
turning it off in the middle and then claiming that the program fihished.
> The following finite string has the property of infinite execution even
> after it halts because the halt decider stopped simulating it:
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> _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]
>
> [infinite_loop] non-halting behavior pattern
> (a) The instruction is a JMP instruction.
> (b) It is jumping upward or to its own address.
> (c) There are no conditional branch instructions in-between.
> (d) There are no other JMP instructions in-between (André G. Isaak)
>
> When the [infinite_loop] non-halting behavior pattern of the simulation
> of _Infinite_Loop() is matched by the behavior of _Infinite_Loop() the
> simulating halt decider correctly decides not-halting on this input.
>
> Begin Local Halt Decider Simulation at Machine Address:aaf
> ...[00000aaf][002115e2][002115e6](01) 55 push ebp
> ...[00000ab0][002115e2][002115e6](02) 8bec mov ebp,esp
> ...[00000ab2][002115e2][002115e6](02) ebfe jmp 00000ab2
> ...[00000ab2][002115e2][002115e6](02) ebfe jmp 00000ab2
> Local Halt Decider: Infinite Loop Detected Simulation Stopped
>
> The fact that the only reason the input halted was that its simulation
> was aborted by the simulating halt decider proves that it is a
> non-halting computation.
>
>
You are mixing up cause and effect. The simulation halted because it was
halted. In THIS case, if it didn't, it would run forever. That does NOT
Mean that in every case where the simulator stops, it would have run
forever.
>
>>>
>>> There are no computations in the universe that <are> [halting
>>> computations] <and> [require their simulation to be terminated] to
>>> prevent them from never halting.
>>>
>>
>> Except maybe H^(H^)? (by your broken definitions)
>>
>> Since that top H that is deciding could be replaced with a plain UTM,
>> and this finishes, the simulation of H^ does not REALLY need to be
>> terminated, but you have defined that the termination clause to be true
>> even if another copy of H within H^ simulating a copy of the description
>> of H^(H^) stops is simulation, and THAT is an incorrect definition to
>> make the statement true.
>>
>> That definition conflates the operation of the simulator with the
>> actions within the simulation.
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 09:21 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <NsadnZl3G-pVgzj9nZ2dnUU7-THNnZ2d@giganews.com> |
| In reply to | #33910 |
On 5/19/2021 9:13 AM, Richard Damon wrote: > On 5/19/21 9:36 AM, olcott wrote: >> On 5/19/2021 5:58 AM, Richard Damon wrote: >>> On 5/18/21 10:24 PM, olcott wrote: >>>> On 5/18/2021 9:03 PM, Richard Damon wrote: >>>>> On 5/18/21 10:05 AM, olcott wrote: >>>>>> On 5/18/2021 6:16 AM, Richard Damon wrote: >>>>>>> On 5/17/21 11:28 PM, olcott wrote: >>>>>>>> On 5/17/2021 8:49 PM, Richard Damon wrote: >>>>>>>>> On 5/17/21 9:19 PM, olcott wrote: >>>>>>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>> >>>>>>>>>>>> You already agreed that when simulation of an infinite loop is >>>>>>>>>>>> terminated on the basis that its behavior matches the >>>>>>>>>>>> [infinite_loop] >>>>>>>>>>>> behavior pattern that the fact that this infinite loop does halt >>>>>>>>>>>> does >>>>>>>>>>>> not entail that it is a halting computation. >>>>>>>>>>> >>>>>>>>>>> No. You don't understand what I said, and your massive arrogance >>>>>>>>>>> prevents you from trying to understand. >>>>>>>>>>> >>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>> >>>>>>>>>>>>>> Truism: >>>>>>>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>>>>>>> it at some point specifies infinite execution. >>>>>>>>>>> >>>>>>>>>>>> When non-halting behavior patterns are the measure of the above >>>>>>>>>>>> Truism >>>>>>>>>>>> reject state (not_halting) then the remaining inputs are in the >>>>>>>>>>>> accept >>>>>>>>>>>> state (halting). >>>>>>>>>>>> >>>>>>>>>>>> Every behavior pattern that correctly measures the Truism >>>>>>>>>>>> criteria >>>>>>>>>>>> does decide non-halting correctly. >>>>>>>>>>> >>>>>>>>>>> Impossible to tell because this is just hand-waving, but a few >>>>>>>>>>> facts >>>>>>>>>>> can >>>>>>>>>>> be teased from your waffle. The function you are so carefully >>>>>>>>>>> hiding >>>>>>>>>>> called Halts is wrong about the halting of at least one >>>>>>>>>>> computation. >>>>>>>>>>> Any algorithm that can decide whether a simulation will stop >>>>>>>>>>> or not >>>>>>>>>>> is a >>>>>>>>>>> halt decider (and therefore impossible). To use a halt >>>>>>>>>>> decider in >>>>>>>>>>> order >>>>>>>>>>> to give the wrong answer for the halting of a computation is a >>>>>>>>>>> delicious >>>>>>>>>>> kind of ironic madness that can only pop up on Usenet. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>>>>>> Now Ĥ is a Turing machine, so that it will have some >>>>>>>>>> description in >>>>>>>>>> Σ*, >>>>>>>>>> say ŵ. This string, in addition to being the description of Ĥ can >>>>>>>>>> also >>>>>>>>>> be used >>>>>>>>>> as input string. We can therefore legitimately ask what would >>>>>>>>>> happen if >>>>>>>>>> Ĥ is >>>>>>>>>> applied to ŵ. >>>>>>>>>> >>>>>>>>>> ** That notation was provided by Ben >>>>>>>>>> >>>>>>>>>> Unless the nested simulations specified by <Ĥ> are terminated at >>>>>>>>>> some >>>>>>>>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>>>>>>>> >>>>>>>>>> The fact that these nested simulations must be terminated at some >>>>>>>>>> point >>>>>>>>>> proves that <Ĥ> specifies an infinite computation and can be >>>>>>>>>> correctly >>>>>>>>>> decided as non-halting. >>>>>>>>>> >>>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> And what you miss is that if the algorithm in the copy of H that >>>>>>>>> is in >>>>>>>>> H^ doesn't know how to stop this infinite recursion, than neither >>>>>>>>> does >>>>>>>>> H, and thus H(H^,H^) will not return and thus H fails to be a >>>>>>>>> decider. >>>>>>>> >>>>>>>>> If the algorithm in the copy of H does know how to stop this, >>>>>>>>> then H^ >>>>>>>>> when run as a machine WILL Halt on its own, and be a Halting >>>>>>>>> Computation. >>>>>>>>> >>>>>>>> >>>>>>>> This is the part that you (and others) continue to fail to >>>>>>>> understand: >>>>>>>> >>>>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>>>> 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 by Ĥ. >>>>>>>> >>>>>>> >>>>>>> The point YOU continue to fail to understand is that BECAUSE H DOES >>>>>>> have >>>>>>> the logic to abort the otherwise infinite recursion, so does the >>>>>>> copy of >>>>>>> H in H^, and because of that H^ will be finite in execution. >>>>>>> >>>>>> >>>>>> All that you have to do to understand is simply pay attention: >>>>>> >>>>>> When non-halting is defined as the requirement to abort the simulation >>>>>> of an input to prevent its infinite execution then the input [Ĥ] to >>>>>> Ĥ([Ĥ]) is correctly decided as non-halting. >>>>>> >>>>> >>>>> Except that isn't the right definition of Halting. Now, with proper >>>>> definitions of the terms, and the proper application of it, that >>>>> description can be used to make a decision which matches the real >>>>> definition. But you don't do that, so you get the wrong answer. >>>>> >>>> >>>> My uncoventional definition of halting <is> a correct definition <and> >>>> overcomes the pathological self-reference error of the halting theorem. >>> >>> >>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >>> in Computation Theory. That is how Logic works. >>> >>> The CORRECT definition of Halting is to look at what the machine does >>> when it is run. For H^(H^) that is to Halt. >>> >>> >> >> On that basis we would conclude that _Infinite_Loop() is a halting >> computation: >> > > No, WHEN does Infinite_Loop halt when it is run as an actual machine. > > YOU are conflating the simulation of a machine (with a simulator that > might decide to terminate the simulation) with the actual halting > behavior of the actual machine. > > If a sort-of simulator decides to stop simulating a machine, that > doesn't mean the actual machine halted. It actually doesn't tell us much > about the acutal machine. > It is called a [simulating halt decider]. 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 | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 11:25 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <v5apI.117953$9L1.50961@fx05.iad> |
| In reply to | #33915 |
On 5/19/21 10:21 AM, olcott wrote: > On 5/19/2021 9:13 AM, Richard Damon wrote: >> On 5/19/21 9:36 AM, olcott wrote: >>> On 5/19/2021 5:58 AM, Richard Damon wrote: >>>> On 5/18/21 10:24 PM, olcott wrote: >>>>> On 5/18/2021 9:03 PM, Richard Damon wrote: >>>>>> On 5/18/21 10:05 AM, olcott wrote: >>>>>>> On 5/18/2021 6:16 AM, Richard Damon wrote: >>>>>>>> On 5/17/21 11:28 PM, olcott wrote: >>>>>>>>> On 5/17/2021 8:49 PM, Richard Damon wrote: >>>>>>>>>> On 5/17/21 9:19 PM, olcott wrote: >>>>>>>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>> >>>>>>>>>>>>> You already agreed that when simulation of an infinite loop is >>>>>>>>>>>>> terminated on the basis that its behavior matches the >>>>>>>>>>>>> [infinite_loop] >>>>>>>>>>>>> behavior pattern that the fact that this infinite loop does >>>>>>>>>>>>> halt >>>>>>>>>>>>> does >>>>>>>>>>>>> not entail that it is a halting computation. >>>>>>>>>>>> >>>>>>>>>>>> No. You don't understand what I said, and your massive >>>>>>>>>>>> arrogance >>>>>>>>>>>> prevents you from trying to understand. >>>>>>>>>>>> >>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>> >>>>>>>>>>>>>>> Truism: >>>>>>>>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>>>>>>>> it at some point specifies infinite execution. >>>>>>>>>>>> >>>>>>>>>>>>> When non-halting behavior patterns are the measure of the >>>>>>>>>>>>> above >>>>>>>>>>>>> Truism >>>>>>>>>>>>> reject state (not_halting) then the remaining inputs are in >>>>>>>>>>>>> the >>>>>>>>>>>>> accept >>>>>>>>>>>>> state (halting). >>>>>>>>>>>>> >>>>>>>>>>>>> Every behavior pattern that correctly measures the Truism >>>>>>>>>>>>> criteria >>>>>>>>>>>>> does decide non-halting correctly. >>>>>>>>>>>> >>>>>>>>>>>> Impossible to tell because this is just hand-waving, but a few >>>>>>>>>>>> facts >>>>>>>>>>>> can >>>>>>>>>>>> be teased from your waffle. The function you are so carefully >>>>>>>>>>>> hiding >>>>>>>>>>>> called Halts is wrong about the halting of at least one >>>>>>>>>>>> computation. >>>>>>>>>>>> Any algorithm that can decide whether a simulation will stop >>>>>>>>>>>> or not >>>>>>>>>>>> is a >>>>>>>>>>>> halt decider (and therefore impossible). To use a halt >>>>>>>>>>>> decider in >>>>>>>>>>>> order >>>>>>>>>>>> to give the wrong answer for the halting of a computation is a >>>>>>>>>>>> delicious >>>>>>>>>>>> kind of ironic madness that can only pop up on Usenet. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>>>>>>> Now Ĥ is a Turing machine, so that it will have some >>>>>>>>>>> description in >>>>>>>>>>> Σ*, >>>>>>>>>>> say ŵ. This string, in addition to being the description of Ĥ >>>>>>>>>>> can >>>>>>>>>>> also >>>>>>>>>>> be used >>>>>>>>>>> as input string. We can therefore legitimately ask what would >>>>>>>>>>> happen if >>>>>>>>>>> Ĥ is >>>>>>>>>>> applied to ŵ. >>>>>>>>>>> >>>>>>>>>>> ** That notation was provided by Ben >>>>>>>>>>> >>>>>>>>>>> Unless the nested simulations specified by <Ĥ> are terminated at >>>>>>>>>>> some >>>>>>>>>>> point they are infinite and Ĥ(<Ĥ>) never halts. >>>>>>>>>>> >>>>>>>>>>> The fact that these nested simulations must be terminated at >>>>>>>>>>> some >>>>>>>>>>> point >>>>>>>>>>> proves that <Ĥ> specifies an infinite computation and can be >>>>>>>>>>> correctly >>>>>>>>>>> decided as non-halting. >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> >>>>>>>>>> And what you miss is that if the algorithm in the copy of H that >>>>>>>>>> is in >>>>>>>>>> H^ doesn't know how to stop this infinite recursion, than neither >>>>>>>>>> does >>>>>>>>>> H, and thus H(H^,H^) will not return and thus H fails to be a >>>>>>>>>> decider. >>>>>>>>> >>>>>>>>>> If the algorithm in the copy of H does know how to stop this, >>>>>>>>>> then H^ >>>>>>>>>> when run as a machine WILL Halt on its own, and be a Halting >>>>>>>>>> Computation. >>>>>>>>>> >>>>>>>>> >>>>>>>>> This is the part that you (and others) continue to fail to >>>>>>>>> understand: >>>>>>>>> >>>>>>>>> The following is referred to as: Ĥ(<Ĥ>) ** >>>>>>>>> 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 by Ĥ. >>>>>>>>> >>>>>>>> >>>>>>>> The point YOU continue to fail to understand is that BECAUSE H DOES >>>>>>>> have >>>>>>>> the logic to abort the otherwise infinite recursion, so does the >>>>>>>> copy of >>>>>>>> H in H^, and because of that H^ will be finite in execution. >>>>>>>> >>>>>>> >>>>>>> All that you have to do to understand is simply pay attention: >>>>>>> >>>>>>> When non-halting is defined as the requirement to abort the >>>>>>> simulation >>>>>>> of an input to prevent its infinite execution then the input [Ĥ] to >>>>>>> Ĥ([Ĥ]) is correctly decided as non-halting. >>>>>>> >>>>>> >>>>>> Except that isn't the right definition of Halting. Now, with proper >>>>>> definitions of the terms, and the proper application of it, that >>>>>> description can be used to make a decision which matches the real >>>>>> definition. But you don't do that, so you get the wrong answer. >>>>>> >>>>> >>>>> My uncoventional definition of halting <is> a correct definition <and> >>>>> overcomes the pathological self-reference error of the halting >>>>> theorem. >>>> >>>> >>>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >>>> in Computation Theory. That is how Logic works. >>>> >>>> The CORRECT definition of Halting is to look at what the machine does >>>> when it is run. For H^(H^) that is to Halt. >>>> >>>> >>> >>> On that basis we would conclude that _Infinite_Loop() is a halting >>> computation: >>> >> >> No, WHEN does Infinite_Loop halt when it is run as an actual machine. >> >> YOU are conflating the simulation of a machine (with a simulator that >> might decide to terminate the simulation) with the actual halting >> behavior of the actual machine. >> >> If a sort-of simulator decides to stop simulating a machine, that >> doesn't mean the actual machine halted. It actually doesn't tell us much >> about the acutal machine. >> > > It is called a [simulating halt decider]. > > 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. > > You call it a [simulating halt decider], but I call it a [sort of simulator] because it is NOT an accurate simulation, in that it will terminate its simulation under some condition. This means you can't just use rules that apply to [True Simulators] that do accurately simulate ALL machines. Because you H isn't a 'True Simulator' but you do logic on it as if it is, you get errors.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 10:16 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ](4) |
| Message-ID | <b59pI.187671$Qf2.25350@fx38.iad> |
| In reply to | #33903 |
On 5/19/21 10:03 AM, olcott wrote: > On 5/19/2021 8:57 AM, Kaz Kylheku wrote: >> On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >>> On 5/19/2021 5:58 AM, Richard Damon wrote: >>>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >>>> in Computation Theory. That is how Logic works. >>>> >>>> The CORRECT definition of Halting is to look at what the machine does >>>> when it is run. For H^(H^) that is to Halt. >>>> >>>> >>> >>> On that basis we would conclude that _Infinite_Loop() is a halting >>> computation: >> >> Just because a simulating decider machine has identified that the >> infinite loop is and discontinued simulating it doesn't mean the loop >> matchine has become halting. >> >> The decider and the infinite loop are not the same machine. >> >> One can terminate even while the other does not. >> >> That's the very basis for halting: can we have machines which terminate, >> and indicate whether other machines do so? And to what extent can we >> have that. >> >> A non-halting computation doesn't become halting any more than the >> integers become finite when you stop counting at 100. And you, the >> counter, are not those integers. >> > > 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. > > 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? > And H^(H^) must not correctly match correct non-halting behavior because it does halt when run. Even YOU admit that. I have shown why it doesn't correctly match, the replacement of a simulation of a simulation with the program that it simulates isn't a valid operation if the simulator might abort the operation. That replacement MUST be marked as being a conditional execution.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 09:41 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ](4) |
| Message-ID | <ns6dnTY6EInrvjj9nZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #33912 |
On 5/19/2021 9:16 AM, Richard Damon wrote: > On 5/19/21 10:03 AM, olcott wrote: >> On 5/19/2021 8:57 AM, Kaz Kylheku wrote: >>> On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/19/2021 5:58 AM, Richard Damon wrote: >>>>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >>>>> in Computation Theory. That is how Logic works. >>>>> >>>>> The CORRECT definition of Halting is to look at what the machine does >>>>> when it is run. For H^(H^) that is to Halt. >>>>> >>>>> >>>> >>>> On that basis we would conclude that _Infinite_Loop() is a halting >>>> computation: >>> >>> Just because a simulating decider machine has identified that the >>> infinite loop is and discontinued simulating it doesn't mean the loop >>> matchine has become halting. >>> >>> The decider and the infinite loop are not the same machine. >>> >>> One can terminate even while the other does not. >>> >>> That's the very basis for halting: can we have machines which terminate, >>> and indicate whether other machines do so? And to what extent can we >>> have that. >>> >>> A non-halting computation doesn't become halting any more than the >>> integers become finite when you stop counting at 100. And you, the >>> counter, are not those integers. >>> >> >> 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. >> >> 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? >> > > And H^(H^) must not correctly match correct non-halting behavior because > it does halt when run. Even YOU admit that. > On the other hand if the simulation of the input [Ĥ] 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, Every simulation of input P that would never halt unless a simulating halt decider H stopped simulating it <is> a non-halting computation. This remains true even after H stops simulating P. _Infinite_Loop does not suddenly become a halting computation just because H stopped simulating it. Likewise for input [Ĥ] to Ĥ([Ĥ]). > I have shown why it doesn't correctly match, the replacement of a > simulation of a simulation with the program that it simulates isn't a > valid operation if the simulator might abort the operation. That > replacement MUST be marked as being a conditional execution. > -- 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:03 -0400 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ](4) |
| Message-ID | <hN9pI.98752$b27.40704@fx03.iad> |
| In reply to | #33924 |
On 5/19/21 10:41 AM, olcott wrote: > On 5/19/2021 9:16 AM, Richard Damon wrote: >> On 5/19/21 10:03 AM, olcott wrote: >>> On 5/19/2021 8:57 AM, Kaz Kylheku wrote: >>>> On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/19/2021 5:58 AM, Richard Damon wrote: >>>>>> No, it is NOT. There is ONE and only ONE CORRECT definition of >>>>>> Halting >>>>>> in Computation Theory. That is how Logic works. >>>>>> >>>>>> The CORRECT definition of Halting is to look at what the machine does >>>>>> when it is run. For H^(H^) that is to Halt. >>>>>> >>>>>> >>>>> >>>>> On that basis we would conclude that _Infinite_Loop() is a halting >>>>> computation: >>>> >>>> Just because a simulating decider machine has identified that the >>>> infinite loop is and discontinued simulating it doesn't mean the loop >>>> matchine has become halting. >>>> >>>> The decider and the infinite loop are not the same machine. >>>> >>>> One can terminate even while the other does not. >>>> >>>> That's the very basis for halting: can we have machines which >>>> terminate, >>>> and indicate whether other machines do so? And to what extent can we >>>> have that. >>>> >>>> A non-halting computation doesn't become halting any more than the >>>> integers become finite when you stop counting at 100. And you, the >>>> counter, are not those integers. >>>> >>> >>> 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. >>> >>> 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? >>> >> >> And H^(H^) must not correctly match correct non-halting behavior because >> it does halt when run. Even YOU admit that. >> > > On the other hand if the simulation of the input [Ĥ] 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, > > Every simulation of input P that would never halt unless a simulating > halt decider H stopped simulating it <is> a non-halting computation. > This remains true even after H stops simulating P. > > _Infinite_Loop does not suddenly become a halting computation just > because H stopped simulating it. Likewise for input [Ĥ] to Ĥ([Ĥ]). > >> I have shown why it doesn't correctly match, the replacement of a >> simulation of a simulation with the program that it simulates isn't a >> valid operation if the simulator might abort the operation. That >> replacement MUST be marked as being a conditional execution. >> > > BAD QUOTE. I said: Only if the claimed Halt Decider doesn't break the recursion, at which 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. So IF the Halt Decider doesn't break the recursion, you get the infinite loop. But then the Halt Decider itself doesn't decide. SInce it DOES break the loop there isn't an infinite recursion. You do seem to like to misquote people, Truth doesn't seem important to you, does it.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 09:03 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ](4) |
| Message-ID | <dv-dnUVEfZLjhzj9nZ2dnUU7-VGdnZ2d@giganews.com> |
| In reply to | #33903 |
On 5/19/2021 8:57 AM, Kaz Kylheku wrote: > On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >> On 5/19/2021 5:58 AM, Richard Damon wrote: >>> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting >>> in Computation Theory. That is how Logic works. >>> >>> The CORRECT definition of Halting is to look at what the machine does >>> when it is run. For H^(H^) that is to Halt. >>> >>> >> >> On that basis we would conclude that _Infinite_Loop() is a halting >> computation: > > Just because a simulating decider machine has identified that the > infinite loop is and discontinued simulating it doesn't mean the loop > matchine has become halting. > > The decider and the infinite loop are not the same machine. > > One can terminate even while the other does not. > > That's the very basis for halting: can we have machines which terminate, > and indicate whether other machines do so? And to what extent can we > have that. > > A non-halting computation doesn't become halting any more than the > integers become finite when you stop counting at 100. And you, the > counter, are not those integers. > 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. 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? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 08:36 -0500 |
| Subject | Re: New test program (Succeeds V2)[ fail to understand ] |
| Message-ID | <FMydnQAgOsqgiTj9nZ2dnUU7-SXNnZ2d@giganews.com> |
| In reply to | #33903 |
On 5/19/2021 5:58 AM, Richard Damon wrote:
> On 5/18/21 10:24 PM, olcott wrote:
>> On 5/18/2021 9:03 PM, Richard Damon wrote:
>>> On 5/18/21 10:05 AM, olcott wrote:
>>>> On 5/18/2021 6:16 AM, Richard Damon wrote:
>>>>> On 5/17/21 11:28 PM, olcott wrote:
>>>>>> On 5/17/2021 8:49 PM, Richard Damon wrote:
>>>>>>> On 5/17/21 9:19 PM, olcott wrote:
>>>>>>>> On 5/17/2021 7:56 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> You already agreed that when simulation of an infinite loop is
>>>>>>>>>> terminated on the basis that its behavior matches the
>>>>>>>>>> [infinite_loop]
>>>>>>>>>> behavior pattern that the fact that this infinite loop does halt
>>>>>>>>>> does
>>>>>>>>>> not entail that it is a halting computation.
>>>>>>>>>
>>>>>>>>> No. You don't understand what I said, and your massive arrogance
>>>>>>>>> prevents you from trying to understand.
>>>>>>>>>
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> Truism:
>>>>>>>>>>>> Every simulation that would never stop unless Halts() stops
>>>>>>>>>>>> it at some point specifies infinite execution.
>>>>>>>>>
>>>>>>>>>> When non-halting behavior patterns are the measure of the above
>>>>>>>>>> Truism
>>>>>>>>>> reject state (not_halting) then the remaining inputs are in the
>>>>>>>>>> accept
>>>>>>>>>> state (halting).
>>>>>>>>>>
>>>>>>>>>> Every behavior pattern that correctly measures the Truism criteria
>>>>>>>>>> does decide non-halting correctly.
>>>>>>>>>
>>>>>>>>> Impossible to tell because this is just hand-waving, but a few
>>>>>>>>> facts
>>>>>>>>> can
>>>>>>>>> be teased from your waffle. The function you are so carefully
>>>>>>>>> hiding
>>>>>>>>> called Halts is wrong about the halting of at least one
>>>>>>>>> computation.
>>>>>>>>> Any algorithm that can decide whether a simulation will stop or not
>>>>>>>>> is a
>>>>>>>>> halt decider (and therefore impossible). To use a halt decider in
>>>>>>>>> order
>>>>>>>>> to give the wrong answer for the halting of a computation is a
>>>>>>>>> delicious
>>>>>>>>> kind of ironic madness that can only pop up on Usenet.
>>>>>>>>>
>>>>>>>>
>>>>>>>> The following is referred to as: Ĥ(<Ĥ>) **
>>>>>>>> Now Ĥ is a Turing machine, so that it will have some description in
>>>>>>>> Σ*,
>>>>>>>> say ŵ. This string, in addition to being the description of Ĥ can
>>>>>>>> also
>>>>>>>> be used
>>>>>>>> as input string. We can therefore legitimately ask what would
>>>>>>>> happen if
>>>>>>>> Ĥ is
>>>>>>>> applied to ŵ.
>>>>>>>>
>>>>>>>> ** That notation was provided by Ben
>>>>>>>>
>>>>>>>> Unless the nested simulations specified by <Ĥ> are terminated at
>>>>>>>> some
>>>>>>>> point they are infinite and Ĥ(<Ĥ>) never halts.
>>>>>>>>
>>>>>>>> The fact that these nested simulations must be terminated at some
>>>>>>>> point
>>>>>>>> proves that <Ĥ> specifies an infinite computation and can be
>>>>>>>> correctly
>>>>>>>> decided as non-halting.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> And what you miss is that if the algorithm in the copy of H that
>>>>>>> is in
>>>>>>> H^ doesn't know how to stop this infinite recursion, than neither
>>>>>>> does
>>>>>>> H, and thus H(H^,H^) will not return and thus H fails to be a
>>>>>>> decider.
>>>>>>
>>>>>>> If the algorithm in the copy of H does know how to stop this, then H^
>>>>>>> when run as a machine WILL Halt on its own, and be a Halting
>>>>>>> Computation.
>>>>>>>
>>>>>>
>>>>>> This is the part that you (and others) continue to fail to understand:
>>>>>>
>>>>>> The following is referred to as: Ĥ(<Ĥ>) **
>>>>>> 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 by Ĥ.
>>>>>>
>>>>>
>>>>> The point YOU continue to fail to understand is that BECAUSE H DOES
>>>>> have
>>>>> the logic to abort the otherwise infinite recursion, so does the
>>>>> copy of
>>>>> H in H^, and because of that H^ will be finite in execution.
>>>>>
>>>>
>>>> All that you have to do to understand is simply pay attention:
>>>>
>>>> When non-halting is defined as the requirement to abort the simulation
>>>> of an input to prevent its infinite execution then the input [Ĥ] to
>>>> Ĥ([Ĥ]) is correctly decided as non-halting.
>>>>
>>>
>>> Except that isn't the right definition of Halting. Now, with proper
>>> definitions of the terms, and the proper application of it, that
>>> description can be used to make a decision which matches the real
>>> definition. But you don't do that, so you get the wrong answer.
>>>
>>
>> My uncoventional definition of halting <is> a correct definition <and>
>> overcomes the pathological self-reference error of the halting theorem.
>
>
> No, it is NOT. There is ONE and only ONE CORRECT definition of Halting
> in Computation Theory. That is how Logic works.
>
> The CORRECT definition of Halting is to look at what the machine does
> when it is run. For H^(H^) that is to Halt.
>
>
On that basis we would conclude that _Infinite_Loop() is a halting
computation:
The following finite string has the property of infinite execution even
after it halts because the halt decider stopped simulating it:
void Infinite_Loop()
{
HERE: goto HERE;
}
_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]
[infinite_loop] non-halting behavior pattern
(a) The instruction is a JMP instruction.
(b) It is jumping upward or to its own address.
(c) There are no conditional branch instructions in-between.
(d) There are no other JMP instructions in-between (André G. Isaak)
When the [infinite_loop] non-halting behavior pattern of the simulation
of _Infinite_Loop() is matched by the behavior of _Infinite_Loop() the
simulating halt decider correctly decides not-halting on this input.
Begin Local Halt Decider Simulation at Machine Address:aaf
...[00000aaf][002115e2][002115e6](01) 55 push ebp
...[00000ab0][002115e2][002115e6](02) 8bec mov ebp,esp
...[00000ab2][002115e2][002115e6](02) ebfe jmp 00000ab2
...[00000ab2][002115e2][002115e6](02) ebfe jmp 00000ab2
Local Halt Decider: Infinite Loop Detected Simulation Stopped
The fact that the only reason the input halted was that its simulation
was aborted by the simulating halt decider proves that it is a
non-halting computation.
>>
>> There are no computations in the universe that <are> [halting
>> computations] <and> [require their simulation to be terminated] to
>> prevent them from never halting.
>>
>
> Except maybe H^(H^)? (by your broken definitions)
>
> Since that top H that is deciding could be replaced with a plain UTM,
> and this finishes, the simulation of H^ does not REALLY need to be
> terminated, but you have defined that the termination clause to be true
> even if another copy of H within H^ simulating a copy of the description
> of H^(H^) stops is simulation, and THAT is an incorrect definition to
> make the statement true.
>
> That definition conflates the operation of the simulator with the
> actions within the simulation.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 17 of 50 — ← Prev page 1 … 15 16 [17] 18 19 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web