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 41 of 50 — ← Prev page 1 … 39 40 [41] 42 43 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-20 20:43 -0500 |
| Subject | Re: Refuting the halting theorem( key halt deciding principle )( intentionally dishonest? ) |
| Message-ID | <386dndDGi_K0jTr9nZ2dnUU78eHNnZ2d@giganews.com> |
| In reply to | #34051 |
On 5/20/2021 8:29 PM, Kaz Kylheku wrote: > On 2021-05-21, olcott <NoOne@NoWhere.com> wrote: >> On 5/20/2021 6:52 PM, Kaz Kylheku wrote: >>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/20/2021 11:54 AM, Kaz Kylheku wrote: >>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/20/2021 7:13 AM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> You do seem to know the computer science of this the best and can >>>>>>>> greatly improve the quality of my wording. (see 1b). >>>>>>>> >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>> >>>>>>>> Truism(1a) >>>>>>>> The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx >>>>>>>> would never halt unless Ĥ.qx aborts this simulation. >>>>>>>> >>>>>>>> Truism(1b) >>>>>>>> (1a) is another way of saying that simulation of: ([Ĥ][Ĥ]) by a UTM @ >>>>>>>> Ĥ.qx would never halt. >>>>>>>> >>>>>>>> Unless and until people understand that (1a) is a paraphrase of (1b) >>>>>>>> we cannot move to truism(2). >>>>>>> >>>>>>> You are abusing names and language. Use different names for different >>>>>>> machines and you can be quite clear. Stop saying what would happen >>>>>>> unless. TM's are what they are. I am inclined to stop future replies >>>>>>> at the first "would .. unless". >>>>>>> >>>>>> >>>>>> "Unless" of (1a) is merely the English word for a conditional statement >>>>>> in a program. >>>>>> >>>>>> The above does not specify two machines. In the purely hypothetical case >>>>>> where Ĥ.qx did not stop simulating its input then in this purely >>>>>> hypothetical case the behavior of its input would be the same as if the >>>>>> partial halt decider @ Ĥ.qx was replaced by a UTM. >>>>> >>>>> You must not replace anything but anything, unless you can prove they >>>>> are absolutely equivalent. >>>>> >>>>> If you replace any component C of some entity E with something not >>>>> equivalent to C, then you no longer have E. You have E2 or E'. >>>>> >>>>> If you use the same name for both objects, you're equivocating; >>>>> you wrongly make arguments which say that properties that can be deduced >>>>> about E2 are those of E. >>>>>> >>>>>> Any high school student would be able to analyze the basic logic of the >>>>>> above and know that it is correct very easily. >>>>>> >>>>>> If X is the only cause of Y and not X then not Y. >>>>> >>>>> The probelm is that X does not happen. >>>> >>>> In other words you are disingenuously denying a tautology that is >>>> obviously correct to any high school student by dancing around it with >>>> with irrelevancies. >>> >>> No, you're too daft to understand that I'm mot deying it at all. >>> I'm saying that it contains a vacuous truth that can just be >>> removed. Since X does not happen for the given H, then "unless X" can >>> (and should!) be exised from your tautology. >>> >>>> It is as if you are saying that it is utterly impossible to determine >>>> the execution trace of any segment of code without actually running this >>>> code. >>>> >>>>> If X is "detecting nested >>>>> simulation" and Y is "discontinuing simulation", then this is >>>>> is a vacuous truth, in the context of a decider which doesn't do any >>>>> such detection. >>>>> >>>>> That's the problem; not that the logic is wrong, but that it's a >>>>> useless, vacuous truth. >>>>> >>>> >>>> If X is the only cause of Y and not X then not Y. >>> >>> Since we know what the value is of X, we can just substitute that >>> value into the tautology, which then no longer mentions X. >>> >> >> I have improved the wording of this since my prior reply to you. >> >> >> >> This halt deciding principle overcomes the pathological self-reference >> error of the halting theorem: >> >> (A) Every simulation of input P that never halts unless simulating halt >> decider H stops simulating it <is> a non-halting computation. This >> remains true even after H stops simulating P. > > This is not an improvement. That is because you simply ignore rather than evaluate the rest of what I say. Can I take this to mean that you are now being intentionally dishonest? If you are not being intentionally dishonest then go back to my prior reply and evaluate each point one at a time. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-21 03:21 +0000 |
| Subject | Re: Refuting the halting theorem( key halt deciding principle )( intentionally dishonest? ) |
| Message-ID | <20210520200735.34@kylheku.com> |
| In reply to | #34052 |
On 2021-05-21, olcott <NoOne@NoWhere.com> wrote:
> On 5/20/2021 8:29 PM, Kaz Kylheku wrote:
>> On 2021-05-21, olcott <NoOne@NoWhere.com> wrote:
>>> On 5/20/2021 6:52 PM, Kaz Kylheku wrote:
>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 5/20/2021 11:54 AM, Kaz Kylheku wrote:
>>>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 5/20/2021 7:13 AM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> You do seem to know the computer science of this the best and can
>>>>>>>>> greatly improve the quality of my wording. (see 1b).
>>>>>>>>>
>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>>>>>>>>>
>>>>>>>>> Truism(1a)
>>>>>>>>> The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx
>>>>>>>>> would never halt unless Ĥ.qx aborts this simulation.
>>>>>>>>>
>>>>>>>>> Truism(1b)
>>>>>>>>> (1a) is another way of saying that simulation of: ([Ĥ][Ĥ]) by a UTM @
>>>>>>>>> Ĥ.qx would never halt.
>>>>>>>>>
>>>>>>>>> Unless and until people understand that (1a) is a paraphrase of (1b)
>>>>>>>>> we cannot move to truism(2).
>>>>>>>>
>>>>>>>> You are abusing names and language. Use different names for different
>>>>>>>> machines and you can be quite clear. Stop saying what would happen
>>>>>>>> unless. TM's are what they are. I am inclined to stop future replies
>>>>>>>> at the first "would .. unless".
>>>>>>>>
>>>>>>>
>>>>>>> "Unless" of (1a) is merely the English word for a conditional statement
>>>>>>> in a program.
>>>>>>>
>>>>>>> The above does not specify two machines. In the purely hypothetical case
>>>>>>> where Ĥ.qx did not stop simulating its input then in this purely
>>>>>>> hypothetical case the behavior of its input would be the same as if the
>>>>>>> partial halt decider @ Ĥ.qx was replaced by a UTM.
>>>>>>
>>>>>> You must not replace anything but anything, unless you can prove they
>>>>>> are absolutely equivalent.
>>>>>>
>>>>>> If you replace any component C of some entity E with something not
>>>>>> equivalent to C, then you no longer have E. You have E2 or E'.
>>>>>>
>>>>>> If you use the same name for both objects, you're equivocating;
>>>>>> you wrongly make arguments which say that properties that can be deduced
>>>>>> about E2 are those of E.
>>>>>>>
>>>>>>> Any high school student would be able to analyze the basic logic of the
>>>>>>> above and know that it is correct very easily.
>>>>>>>
>>>>>>> If X is the only cause of Y and not X then not Y.
>>>>>>
>>>>>> The probelm is that X does not happen.
>>>>>
>>>>> In other words you are disingenuously denying a tautology that is
>>>>> obviously correct to any high school student by dancing around it with
>>>>> with irrelevancies.
>>>>
>>>> No, you're too daft to understand that I'm mot deying it at all.
>>>> I'm saying that it contains a vacuous truth that can just be
>>>> removed. Since X does not happen for the given H, then "unless X" can
>>>> (and should!) be exised from your tautology.
>>>>
>>>>> It is as if you are saying that it is utterly impossible to determine
>>>>> the execution trace of any segment of code without actually running this
>>>>> code.
>>>>>
>>>>>> If X is "detecting nested
>>>>>> simulation" and Y is "discontinuing simulation", then this is
>>>>>> is a vacuous truth, in the context of a decider which doesn't do any
>>>>>> such detection.
>>>>>>
>>>>>> That's the problem; not that the logic is wrong, but that it's a
>>>>>> useless, vacuous truth.
>>>>>>
>>>>>
>>>>> If X is the only cause of Y and not X then not Y.
>>>>
>>>> Since we know what the value is of X, we can just substitute that
>>>> value into the tautology, which then no longer mentions X.
>>>>
>>>
>>> I have improved the wording of this since my prior reply to you.
>>>
>>>
>>>
>>> This halt deciding principle overcomes the pathological self-reference
>>> error of the halting theorem:
>>>
>>> (A) Every simulation of input P that never halts unless simulating halt
>>> decider H stops simulating it <is> a non-halting computation. This
>>> remains true even after H stops simulating P.
>>
>> This is not an improvement.
>
> That is because you simply ignore rather than evaluate the rest of what
> I say.
Pardon me, let's look at it:
>> Any high school student would be able to analyze the basic logic of the
>> above and know that it is correct very easily.
Insult attempt; next.
> *Basic logic of the above*
> If X is the only cause of Y and not X then not Y.
I basically acknowleged the truth of the tautology.
> X = H stops simulating P
> Y = The simulation of P stops
I reiterate that H does not abort anything (but some other decider
H2 potentially does).
Now that does not prevent the definition of X.
Just that since H does not abort, X == False.
> ~X = H never stops simulating P
~X == True.
Indeed H never stops simulating P. (Except when P happens to halt,
of course; we mean "aborts" in this context).
> ~Y = The simulation of P never stops
OK, so let's re-examine:
If X is the only cause of Y and not X then not Y.
This means
If X is the only cause of Y, and not X, then not Y. (from you)
X is false (definition of H as non-aborting decider)
---
∴ If X is the only cause of Y, then not Y.
We can remove the "and not X", because it's given.
Since H doesn't abort, then if the input has no other
reason for its simulation to be halted, the simulation
keeps going.
The only other reason the simulation would stop is that
the input is a halting computation.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-20 22:38 -0500 |
| Subject | Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) |
| Message-ID | <lpmdnZIjP6uUtjr9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #34054 |
On 5/20/2021 10:21 PM, Kaz Kylheku wrote: > On 2021-05-21, olcott <NoOne@NoWhere.com> wrote: >> On 5/20/2021 8:29 PM, Kaz Kylheku wrote: >>> On 2021-05-21, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/20/2021 6:52 PM, Kaz Kylheku wrote: >>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/20/2021 11:54 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/20/2021 7:13 AM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> You do seem to know the computer science of this the best and can >>>>>>>>>> greatly improve the quality of my wording. (see 1b). >>>>>>>>>> >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>> >>>>>>>>>> Truism(1a) >>>>>>>>>> The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx >>>>>>>>>> would never halt unless Ĥ.qx aborts this simulation. >>>>>>>>>> >>>>>>>>>> Truism(1b) >>>>>>>>>> (1a) is another way of saying that simulation of: ([Ĥ][Ĥ]) by a UTM @ >>>>>>>>>> Ĥ.qx would never halt. >>>>>>>>>> >>>>>>>>>> Unless and until people understand that (1a) is a paraphrase of (1b) >>>>>>>>>> we cannot move to truism(2). >>>>>>>>> >>>>>>>>> You are abusing names and language. Use different names for different >>>>>>>>> machines and you can be quite clear. Stop saying what would happen >>>>>>>>> unless. TM's are what they are. I am inclined to stop future replies >>>>>>>>> at the first "would .. unless". >>>>>>>>> >>>>>>>> >>>>>>>> "Unless" of (1a) is merely the English word for a conditional statement >>>>>>>> in a program. >>>>>>>> >>>>>>>> The above does not specify two machines. In the purely hypothetical case >>>>>>>> where Ĥ.qx did not stop simulating its input then in this purely >>>>>>>> hypothetical case the behavior of its input would be the same as if the >>>>>>>> partial halt decider @ Ĥ.qx was replaced by a UTM. >>>>>>> >>>>>>> You must not replace anything but anything, unless you can prove they >>>>>>> are absolutely equivalent. >>>>>>> >>>>>>> If you replace any component C of some entity E with something not >>>>>>> equivalent to C, then you no longer have E. You have E2 or E'. >>>>>>> >>>>>>> If you use the same name for both objects, you're equivocating; >>>>>>> you wrongly make arguments which say that properties that can be deduced >>>>>>> about E2 are those of E. >>>>>>>> >>>>>>>> Any high school student would be able to analyze the basic logic of the >>>>>>>> above and know that it is correct very easily. >>>>>>>> >>>>>>>> If X is the only cause of Y and not X then not Y. >>>>>>> >>>>>>> The probelm is that X does not happen. >>>>>> >>>>>> In other words you are disingenuously denying a tautology that is >>>>>> obviously correct to any high school student by dancing around it with >>>>>> with irrelevancies. >>>>> >>>>> No, you're too daft to understand that I'm mot deying it at all. >>>>> I'm saying that it contains a vacuous truth that can just be >>>>> removed. Since X does not happen for the given H, then "unless X" can >>>>> (and should!) be exised from your tautology. >>>>> >>>>>> It is as if you are saying that it is utterly impossible to determine >>>>>> the execution trace of any segment of code without actually running this >>>>>> code. >>>>>> >>>>>>> If X is "detecting nested >>>>>>> simulation" and Y is "discontinuing simulation", then this is >>>>>>> is a vacuous truth, in the context of a decider which doesn't do any >>>>>>> such detection. >>>>>>> >>>>>>> That's the problem; not that the logic is wrong, but that it's a >>>>>>> useless, vacuous truth. >>>>>>> >>>>>> >>>>>> If X is the only cause of Y and not X then not Y. >>>>> >>>>> Since we know what the value is of X, we can just substitute that >>>>> value into the tautology, which then no longer mentions X. >>>>> >>>> >>>> I have improved the wording of this since my prior reply to you. >>>> >>>> >>>> >>>> This halt deciding principle overcomes the pathological self-reference >>>> error of the halting theorem: >>>> >>>> (A) Every simulation of input P that never halts unless simulating halt >>>> decider H stops simulating it <is> a non-halting computation. This >>>> remains true even after H stops simulating P. >>> >>> This is not an improvement. >> >> That is because you simply ignore rather than evaluate the rest of what >> I say. > > Pardon me, let's look at it: > >>> Any high school student would be able to analyze the basic logic of the >>> above and know that it is correct very easily. > > Insult attempt; next. > >> *Basic logic of the above* >> If X is the only cause of Y and not X then not Y. > > I basically acknowleged the truth of the tautology. I explained this better in my second reply to your post. The second reply may wrap this part up. I want to give Ben's example of clearer wording some credit for my second reply to you. I went back and studied all of what you said and found it to be quite helpful after all. -- 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-20 22:25 -0500 |
| Subject | Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) |
| Message-ID | <RMmdnS1M3e-dtTr9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #34051 |
On 5/20/2021 8:29 PM, Kaz Kylheku wrote: > On 2021-05-21, olcott <NoOne@NoWhere.com> wrote: >> On 5/20/2021 6:52 PM, Kaz Kylheku wrote: >>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/20/2021 11:54 AM, Kaz Kylheku wrote: >>>>> On 2021-05-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/20/2021 7:13 AM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> You do seem to know the computer science of this the best and can >>>>>>>> greatly improve the quality of my wording. (see 1b). >>>>>>>> >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>> >>>>>>>> Truism(1a) >>>>>>>> The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx >>>>>>>> would never halt unless Ĥ.qx aborts this simulation. >>>>>>>> >>>>>>>> Truism(1b) >>>>>>>> (1a) is another way of saying that simulation of: ([Ĥ][Ĥ]) by a UTM @ >>>>>>>> Ĥ.qx would never halt. >>>>>>>> >>>>>>>> Unless and until people understand that (1a) is a paraphrase of (1b) >>>>>>>> we cannot move to truism(2). >>>>>>> >>>>>>> You are abusing names and language. Use different names for different >>>>>>> machines and you can be quite clear. Stop saying what would happen >>>>>>> unless. TM's are what they are. I am inclined to stop future replies >>>>>>> at the first "would .. unless". >>>>>>> >>>>>> >>>>>> "Unless" of (1a) is merely the English word for a conditional statement >>>>>> in a program. >>>>>> >>>>>> The above does not specify two machines. In the purely hypothetical case >>>>>> where Ĥ.qx did not stop simulating its input then in this purely >>>>>> hypothetical case the behavior of its input would be the same as if the >>>>>> partial halt decider @ Ĥ.qx was replaced by a UTM. >>>>> >>>>> You must not replace anything but anything, unless you can prove they >>>>> are absolutely equivalent. >>>>> >>>>> If you replace any component C of some entity E with something not >>>>> equivalent to C, then you no longer have E. You have E2 or E'. >>>>> >>>>> If you use the same name for both objects, you're equivocating; >>>>> you wrongly make arguments which say that properties that can be deduced >>>>> about E2 are those of E. >>>>>> >>>>>> Any high school student would be able to analyze the basic logic of the >>>>>> above and know that it is correct very easily. >>>>>> >>>>>> If X is the only cause of Y and not X then not Y. >>>>> >>>>> The probelm is that X does not happen. >>>> >>>> In other words you are disingenuously denying a tautology that is >>>> obviously correct to any high school student by dancing around it with >>>> with irrelevancies. >>> >>> No, you're too daft to understand that I'm mot deying it at all. >>> I'm saying that it contains a vacuous truth that can just be >>> removed. Since X does not happen for the given H, then "unless X" can >>> (and should!) be exised from your tautology. >>> >>>> It is as if you are saying that it is utterly impossible to determine >>>> the execution trace of any segment of code without actually running this >>>> code. >>>> >>>>> If X is "detecting nested >>>>> simulation" and Y is "discontinuing simulation", then this is >>>>> is a vacuous truth, in the context of a decider which doesn't do any >>>>> such detection. >>>>> >>>>> That's the problem; not that the logic is wrong, but that it's a >>>>> useless, vacuous truth. >>>>> >>>> >>>> If X is the only cause of Y and not X then not Y. >>> >>> Since we know what the value is of X, we can just substitute that >>> value into the tautology, which then no longer mentions X. >>> >> >> I have improved the wording of this since my prior reply to you. >> >> >> >> This halt deciding principle overcomes the pathological self-reference >> error of the halting theorem: >> >> (A) Every simulation of input P that never halts unless simulating halt >> decider H stops simulating it <is> a non-halting computation. This >> remains true even after H stops simulating P. > > This is not an improvement. The specific decider H from the Linz > context is one that /does not/ stop simulations (unless they terminate > spontaneously). > > "unless H stops simulating, Y" is the same as "unless False, Y", > which is just "Y". > > I think what you want is something like: > > for every possibl simulating decider D: > for every machine I: > - if the simulation of I will not stop unless D aborts it; and > - if D's abort decision is correctly made; > then: > - I specifies a non-halting computation > ∃H ∈ Simulating_Halt_Deciders ∀P ∈ Turing_Machine_Descriptions ∀I ∈ Finite_Strings (UTM(P,I) = ∞) ⊢ (H(P,I) = 0) > Now we need that "unless" part because we're generalizing over deciders, > many of which can potentially identify various execution patterns and > make abort decisions. > > In the specific case of H, this generalization is still true; however H > does not recognize any execution patterns and does not abort anything; > it just simulates. Therefore under H, a non-halting I is never > identified as such. > > H cannot be altered in any way. Any decider decider that is not H is not > called H. > > Ĥ embeds H, and also cannot be altered. > > In accordance with the above general "truism" that is universally > quantified over deciders using the variable D, you can find another > decider different from H, call it H2 such that H2(Ĥ, Ĥ) denotes a > simulation which stops, and reports that Ĥ is non-halting. > > That doesn't refute any halting proof, though. The proof relies on the > fact that H cannot do what H2 can do. > -- 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-21 00:45 +0100 |
| Subject | Re: Refuting the halting theorem(paraphrase (1a)(1b))( disingenuous ) |
| Message-ID | <875yzdrmtr.fsf@bsb.me.uk> |
| In reply to | #34021 |
olcott <NoOne@NoWhere.com> writes: > On 5/20/2021 7:13 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> You do seem to know the computer science of this the best and can >>> greatly improve the quality of my wording. (see 1b). >>> >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>> >>> Truism(1a) >>> The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx >>> would never halt unless Ĥ.qx aborts this simulation. >>> >>> Truism(1b) >>> (1a) is another way of saying that simulation of: ([Ĥ][Ĥ]) by a UTM @ >>> Ĥ.qx would never halt. >>> >>> Unless and until people understand that (1a) is a paraphrase of (1b) >>> we cannot move to truism(2). >> >> You are abusing names and language. Use different names for different >> machines and you can be quite clear. Stop saying what would happen >> unless. TM's are what they are. I am inclined to stop future replies >> at the first "would .. unless". > > "Unless" of (1a) is merely the English word for a conditional > statement in a program. I'm going to try to concentrate on one significant reply a day, so see Message-ID: <87h7ixrn18.fsf@bsb.me.uk> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 23:37 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) |
| Message-ID | <0QkpI.77581$RC2.15882@fx27.iad> |
| In reply to | #33985 |
On 5/19/21 8:48 PM, olcott wrote: > On 5/19/2021 7:35 PM, André G. Isaak wrote: >> On 2021-05-19 18:31, olcott wrote: >>> On 5/19/2021 7:19 PM, André G. Isaak wrote: >>>> On 2021-05-19 18:04, olcott wrote: >>>>> On 5/19/2021 6:50 PM, André G. Isaak wrote: >>>>>> On 2021-05-19 17:12, olcott wrote: >>>>>>> On 5/19/2021 6:04 PM, André G. Isaak wrote: >>>>>>>> On 2021-05-19 16:28, olcott wrote: >>>>>>>>> On 5/19/2021 5:16 PM, André G. Isaak wrote: >>>>>>>>>> On 2021-05-19 13:53, olcott wrote: >>>>>>>>>>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-19 11:29, olcott wrote: >>>>>>>>>> >>>>>>>>>>>>> Truism(1) >>>>>>>>>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation >>>>>>>>>>>>> is aborted. >>>>>>>>>>>> >>>>>>>>>>>> How is that a 'truism'? >>>>>>>>>>>> >>>>>>>>>>>> Since we know that H_Hat(H_Hat) does in fact halt as >>>>>>>>>>>> evidenced by how it behaves when *not* run in a modified >>>>>>>>>>>> simulator, this would better be described as a 'falsism'. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Stopping at first big mistake. >>>>>>>>>> >>>>>>>>>> That wasn't a mistake. >>>>>>>>>> >>>>>>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>>>> >>>>>>>>>> Yes. I agree with the Linz definition. >>>>>>>>>> >>>>>>>>>>> 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? >>>>>>>>>> >>>>>>>>>> No, I don't agree with the above because it makes no sense. >>>>>>>>>> Please rephrase it without using the word 'would'. >>>>>>>>>> >>>>>>>>>> André >>>>>>>>>> >>>>>>>>> >>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>> >>>>>>>>> There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts >>>>>>>>> besides the condition that the internal halt decider @ Ĥ.qx >>>>>>>>> terminates its simulation of [Ĥ]. >>>>>>>> >>>>>>>> And so what? >>>>>>>> >>>>>>> >>>>>>> Agreement or not? >>>>>> >>>>>> Why didn't you just read the remainder of my post where I >>>>>> explained my position. I said that if H_Hat(H_Hat) didn't >>>>>> terminate the simulation of its input, then it would be an >>>>>> _entirely different_ computation >>>>> >>>>> In the freaking hypothetical instance where the embedded copy of H >>>>> @ Ĥ.qx never terminates the simulation of its input [Ĥ] would this >>>>> simulation ever terminate? >>>>> >>>>> We can go at the 1,000 times if that what it takes. >>>>> We do not move forward until we have mutual agreement. >>>> >>>> I can't agree to something which is wrong. >>>> >>>> That 'hypothetical instance' doesn't exist unless we change H to an >>>> entirely different computation. It's no different from asking about >>>> the hypothetical instance where sqrt(9) returns 4. >>>> >>>> André >>>> >>> >>> It is not like this at all. It is mathematically projecting execution >>> trace of different encodings of an algorithm on the same input. >> >> What does 'different encodings of an algorithm' mean in this context? > > The exact same algorithm, except non-halting inputs are not aborted, > that line-of-code is commented out. Exact same but is different. Sounds like a new Olcott tautology You don't make decision based on things that aren't. > > Software engineers would never change the name to test a hypothetical > possibility that would be terrible software engineering because it is > very error prone. > >> And what is a 'mathematical projection of an execution trace'? > > Predicting the exact steps of different encodings of an algorithm on the > basis of the semantic meaning of these programming steps. It is a formal > proof and the formal language is the programming language. Turing Machines Halting is NOT based on anything like this. It is does that machine ACTUALLY Halt or not. > >> >> Do you just like randomly combining words? >> >> André >> >> > > Perhaps you know nothing about software engineering? > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 22:43 -0500 |
| Subject | Refutation of halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) |
| Message-ID | <0LidndY0vbssRzj9nZ2dnUU7-enNnZ2d@giganews.com> |
| In reply to | #33997 |
On 5/19/2021 10:37 PM, Richard Damon wrote: > On 5/19/21 8:48 PM, olcott wrote: >> On 5/19/2021 7:35 PM, André G. Isaak wrote: >>> On 2021-05-19 18:31, olcott wrote: >>>> On 5/19/2021 7:19 PM, André G. Isaak wrote: >>>>> On 2021-05-19 18:04, olcott wrote: >>>>>> On 5/19/2021 6:50 PM, André G. Isaak wrote: >>>>>>> On 2021-05-19 17:12, olcott wrote: >>>>>>>> On 5/19/2021 6:04 PM, André G. Isaak wrote: >>>>>>>>> On 2021-05-19 16:28, olcott wrote: >>>>>>>>>> On 5/19/2021 5:16 PM, André G. Isaak wrote: >>>>>>>>>>> On 2021-05-19 13:53, olcott wrote: >>>>>>>>>>>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>>>>>>>>>>> On 2021-05-19 11:29, olcott wrote: >>>>>>>>>>> >>>>>>>>>>>>>> Truism(1) >>>>>>>>>>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation >>>>>>>>>>>>>> is aborted. >>>>>>>>>>>>> >>>>>>>>>>>>> How is that a 'truism'? >>>>>>>>>>>>> >>>>>>>>>>>>> Since we know that H_Hat(H_Hat) does in fact halt as >>>>>>>>>>>>> evidenced by how it behaves when *not* run in a modified >>>>>>>>>>>>> simulator, this would better be described as a 'falsism'. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Stopping at first big mistake. >>>>>>>>>>> >>>>>>>>>>> That wasn't a mistake. >>>>>>>>>>> >>>>>>>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>>>>> >>>>>>>>>>> Yes. I agree with the Linz definition. >>>>>>>>>>> >>>>>>>>>>>> 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? >>>>>>>>>>> >>>>>>>>>>> No, I don't agree with the above because it makes no sense. >>>>>>>>>>> Please rephrase it without using the word 'would'. >>>>>>>>>>> >>>>>>>>>>> André >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>> >>>>>>>>>> There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts >>>>>>>>>> besides the condition that the internal halt decider @ Ĥ.qx >>>>>>>>>> terminates its simulation of [Ĥ]. >>>>>>>>> >>>>>>>>> And so what? >>>>>>>>> >>>>>>>> >>>>>>>> Agreement or not? >>>>>>> >>>>>>> Why didn't you just read the remainder of my post where I >>>>>>> explained my position. I said that if H_Hat(H_Hat) didn't >>>>>>> terminate the simulation of its input, then it would be an >>>>>>> _entirely different_ computation >>>>>> >>>>>> In the freaking hypothetical instance where the embedded copy of H >>>>>> @ Ĥ.qx never terminates the simulation of its input [Ĥ] would this >>>>>> simulation ever terminate? >>>>>> >>>>>> We can go at the 1,000 times if that what it takes. >>>>>> We do not move forward until we have mutual agreement. >>>>> >>>>> I can't agree to something which is wrong. >>>>> >>>>> That 'hypothetical instance' doesn't exist unless we change H to an >>>>> entirely different computation. It's no different from asking about >>>>> the hypothetical instance where sqrt(9) returns 4. >>>>> >>>>> André >>>>> >>>> >>>> It is not like this at all. It is mathematically projecting execution >>>> trace of different encodings of an algorithm on the same input. >>> >>> What does 'different encodings of an algorithm' mean in this context? >> >> The exact same algorithm, except non-halting inputs are not aborted, >> that line-of-code is commented out. > > Exact same but is different. Sounds like a new Olcott tautology > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn Truism(1a) The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx would never halt unless Ĥ.qx aborts this simulation. Truism(1b) (1a) is another way of saying that the simulation of: ([Ĥ][Ĥ]) by a UTM @ Ĥ.qx would never halt. Unless and until people understand that (1a) is a paraphrase of (1b) we cannot move to truism(2). -- 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-20 07:34 -0400 |
| Subject | Re: Refutation of halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) |
| Message-ID | <IOrpI.391947$J_5.25017@fx46.iad> |
| In reply to | #33998 |
On 5/19/21 11:43 PM, olcott wrote: > On 5/19/2021 10:37 PM, Richard Damon wrote: >> On 5/19/21 8:48 PM, olcott wrote: >>> On 5/19/2021 7:35 PM, André G. Isaak wrote: >>>> On 2021-05-19 18:31, olcott wrote: >>>>> On 5/19/2021 7:19 PM, André G. Isaak wrote: >>>>>> On 2021-05-19 18:04, olcott wrote: >>>>>>> On 5/19/2021 6:50 PM, André G. Isaak wrote: >>>>>>>> On 2021-05-19 17:12, olcott wrote: >>>>>>>>> On 5/19/2021 6:04 PM, André G. Isaak wrote: >>>>>>>>>> On 2021-05-19 16:28, olcott wrote: >>>>>>>>>>> On 5/19/2021 5:16 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-19 13:53, olcott wrote: >>>>>>>>>>>>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>>>>>>>>>>>> On 2021-05-19 11:29, olcott wrote: >>>>>>>>>>>> >>>>>>>>>>>>>>> Truism(1) >>>>>>>>>>>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation >>>>>>>>>>>>>>> is aborted. >>>>>>>>>>>>>> >>>>>>>>>>>>>> How is that a 'truism'? >>>>>>>>>>>>>> >>>>>>>>>>>>>> Since we know that H_Hat(H_Hat) does in fact halt as >>>>>>>>>>>>>> evidenced by how it behaves when *not* run in a modified >>>>>>>>>>>>>> simulator, this would better be described as a 'falsism'. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Stopping at first big mistake. >>>>>>>>>>>> >>>>>>>>>>>> That wasn't a mistake. >>>>>>>>>>>> >>>>>>>>>>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>>>>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>>>>>>>>>> >>>>>>>>>>>> Yes. I agree with the Linz definition. >>>>>>>>>>>> >>>>>>>>>>>>> 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? >>>>>>>>>>>> >>>>>>>>>>>> No, I don't agree with the above because it makes no sense. >>>>>>>>>>>> Please rephrase it without using the word 'would'. >>>>>>>>>>>> >>>>>>>>>>>> André >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>> >>>>>>>>>>> There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts >>>>>>>>>>> besides the condition that the internal halt decider @ Ĥ.qx >>>>>>>>>>> terminates its simulation of [Ĥ]. >>>>>>>>>> >>>>>>>>>> And so what? >>>>>>>>>> >>>>>>>>> >>>>>>>>> Agreement or not? >>>>>>>> >>>>>>>> Why didn't you just read the remainder of my post where I >>>>>>>> explained my position. I said that if H_Hat(H_Hat) didn't >>>>>>>> terminate the simulation of its input, then it would be an >>>>>>>> _entirely different_ computation >>>>>>> >>>>>>> In the freaking hypothetical instance where the embedded copy of H >>>>>>> @ Ĥ.qx never terminates the simulation of its input [Ĥ] would this >>>>>>> simulation ever terminate? >>>>>>> >>>>>>> We can go at the 1,000 times if that what it takes. >>>>>>> We do not move forward until we have mutual agreement. >>>>>> >>>>>> I can't agree to something which is wrong. >>>>>> >>>>>> That 'hypothetical instance' doesn't exist unless we change H to an >>>>>> entirely different computation. It's no different from asking about >>>>>> the hypothetical instance where sqrt(9) returns 4. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> It is not like this at all. It is mathematically projecting execution >>>>> trace of different encodings of an algorithm on the same input. >>>> >>>> What does 'different encodings of an algorithm' mean in this context? >>> >>> The exact same algorithm, except non-halting inputs are not aborted, >>> that line-of-code is commented out. >> >> Exact same but is different. Sounds like a new Olcott tautology >> > > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn > > Truism(1a) > The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx would > never halt unless Ĥ.qx aborts this simulation. > > Truism(1b) > (1a) is another way of saying that the simulation of: ([Ĥ][Ĥ]) by a UTM > @ Ĥ.qx would never halt. > > Unless and until people understand that (1a) is a paraphrase of (1b) we > cannot move to truism(2). > WRONGHOOD. Not Truisms but assertions, and unproven at that. The fact is that H^(H^) will come to a halt because H(H^,H^) does stop its simulation (at that is what it is programmed to do) and returns non-halting, even though that is the wrong decision to make. It is NOT valid to presume that you have a decider that will always make the right answer in finite time, which is what you are trying to do but hiding it. WHen looking at the behavior of H^, you need to include the behavior of what your ACTUAL H actually does, not some hypothetical H that gets the answer right. Since a hypothetical H that always gets the answer right does not exist, assuming it breaks your proof.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 19:11 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) |
| Message-ID | <_WgpI.138836$Y87.127681@fx08.iad> |
| In reply to | #33958 |
On 5/19/21 6:28 PM, olcott wrote: > On 5/19/2021 5:16 PM, André G. Isaak wrote: >> On 2021-05-19 13:53, olcott wrote: >>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>> On 2021-05-19 11:29, olcott wrote: >> >>>>> Truism(1) >>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >>>> >>>> How is that a 'truism'? >>>> >>>> Since we know that H_Hat(H_Hat) does in fact halt as evidenced by >>>> how it behaves when *not* run in a modified simulator, this would >>>> better be described as a 'falsism'. >>>> >>> >>> Stopping at first big mistake. >> >> That wasn't a mistake. >> >>> Do you agree that the definition of the Linz Ĥ on page 319 >>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >> >> Yes. I agree with the Linz definition. >> >>> 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? >> >> No, I don't agree with the above because it makes no sense. Please >> rephrase it without using the word 'would'. >> >> André >> > > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn > > There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts besides > the condition that the internal halt decider @ Ĥ.qx terminates its > simulation of [Ĥ]. > The the quesiton being asked isn't did the simulation of [P] halt, but does the actual machine P(I) halt when run. Your confounding of the simulation of the machine with the actual machine is the root of your problem. H as descriptions and works with them, but the answer pertains to the actual machine, not the description.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 18:19 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) |
| Message-ID | <C6qdnW8BmKMnATj9nZ2dnUU7-RWdnZ2d@giganews.com> |
| In reply to | #33964 |
On 5/19/2021 6:11 PM, Richard Damon wrote: > On 5/19/21 6:28 PM, olcott wrote: >> On 5/19/2021 5:16 PM, André G. Isaak wrote: >>> On 2021-05-19 13:53, olcott wrote: >>>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>>> On 2021-05-19 11:29, olcott wrote: >>> >>>>>> Truism(1) >>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >>>>> >>>>> How is that a 'truism'? >>>>> >>>>> Since we know that H_Hat(H_Hat) does in fact halt as evidenced by >>>>> how it behaves when *not* run in a modified simulator, this would >>>>> better be described as a 'falsism'. >>>>> >>>> >>>> Stopping at first big mistake. >>> >>> That wasn't a mistake. >>> >>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>> >>> Yes. I agree with the Linz definition. >>> >>>> 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? >>> >>> No, I don't agree with the above because it makes no sense. Please >>> rephrase it without using the word 'would'. >>> >>> André >>> >> >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >> >> There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts besides >> the condition that the internal halt decider @ Ĥ.qx terminates its >> simulation of [Ĥ]. >> > > The the quesiton being asked isn't did the simulation of [P] halt, but > does the actual machine P(I) halt when run. You are trying to tell me what my own question is? -- 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 19:31 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) |
| Message-ID | <ldhpI.363829$ST2.276995@fx47.iad> |
| In reply to | #33967 |
On 5/19/21 7:19 PM, olcott wrote: > On 5/19/2021 6:11 PM, Richard Damon wrote: >> On 5/19/21 6:28 PM, olcott wrote: >>> On 5/19/2021 5:16 PM, André G. Isaak wrote: >>>> On 2021-05-19 13:53, olcott wrote: >>>>> On 5/19/2021 2:47 PM, André G. Isaak wrote: >>>>>> On 2021-05-19 11:29, olcott wrote: >>>> >>>>>>> Truism(1) >>>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is >>>>>>> aborted. >>>>>> >>>>>> How is that a 'truism'? >>>>>> >>>>>> Since we know that H_Hat(H_Hat) does in fact halt as evidenced by >>>>>> how it behaves when *not* run in a modified simulator, this would >>>>>> better be described as a 'falsism'. >>>>>> >>>>> >>>>> Stopping at first big mistake. >>>> >>>> That wasn't a mistake. >>>> >>>>> Do you agree that the definition of the Linz Ĥ on page 319 >>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf >>>> >>>> Yes. I agree with the Linz definition. >>>> >>>>> 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? >>>> >>>> No, I don't agree with the above because it makes no sense. Please >>>> rephrase it without using the word 'would'. >>>> >>>> André >>>> >>> >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>> >>> There are no conditions such that the input [Ĥ] to Ĥ([Ĥ]) halts besides >>> the condition that the internal halt decider @ Ĥ.qx terminates its >>> simulation of [Ĥ]. >>> >> >> The the quesiton being asked isn't did the simulation of [P] halt, but >> does the actual machine P(I) halt when run. > > You are trying to tell me what my own question is? > Well, since you claim to be working on the Halting Problem, YES. You don't seem to have the right question posed by the problem you claim to be working on. A Right answer to the wrong question is often the wrong answer to the right question. Your Halts gets the WRONG answer to the real halting problem, and thus is NOT a counter to the proof they a universally correct halt decider can't exist.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 16:20 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( three irrefutable truisms lead to one conclusion ) |
| Message-ID | <VpepI.28756$XW6.16537@fx11.iad> |
| In reply to | #33933 |
On 5/19/21 1:29 PM, olcott wrote: > On 5/19/2021 9:37 AM, Richard Damon wrote: >> On 5/19/21 9:58 AM, olcott wrote: >>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>> On 5/18/21 10:35 PM, olcott wrote: >>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>> >>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior pattern >>>>>>>>>>>>> has >>>>>>>>>>>>> been very persistently ignored because it does prove that I am >>>>>>>>>>>>> correct: >>>>>>>>>>>>> >>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>> >>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>> >>>>>>>>>>>> But what value is H then supposed to return? According to the >>>>>>>>>>>> very >>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final state >>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also reach the >>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>> >>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>> >>>>>>>>>>>> André >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>> simulated by simulating halt decider H never needing to have its >>>>>>>>>>> simulation aborted to prevent its infinite execution then the >>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>> >>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>> doesn't >>>>>>>>>> halt. >>>>>>>>>> >>>>>>>>>> But that's not how halting it is defined. >>>>>>>>> >>>>>>>>> None-the less it a one correct way that halting can be defined. >>>>>>>> >>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>> definition >>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>> halting. >>>>>>> >>>>>>> In other words you are saying that when the a simulating halt >>>>>>> decider H >>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>> this >>>>>>> not halting tautology is not true? >>>>>>> >>>>>>> I am stopping at the first big mistake. >>>>>> >>>>>> The criteria you parrot can be used in the right way to show >>>>>> non-halting >>>>>> behavior. You unfortunately don't do it the right way and make MANY >>>>>> mistakes. >>>>>> >>>>> >>>>> Can you come up with a counter-example input P to any simulating halt >>>>> decider H such that the input P must have its simulation terminated to >>>>> prevent its infinite execution <and> input P is a halting computation? >>>> >>>> >>>> H^(H^), it Halts, as you have admitted. >>>> >>>> You also claim that it needs to have its simulation terminated. >>>> >>>> Thus it is a counter. >>>> >>> >>> I will paraphrase my request for counter-example >>> Can you come up with a counter-example input P to any simulating halt >>> decider H such that the input P: >>> >>> (a) Must have its simulation terminated to prevent its infinite >>> execution (non-halting computation) >>> >>> <and> >>> >>> (b) Need not have its simulation terminated to prevent its infinite >>> execution (halting computation) ? >>> >>> Can you show me a picture of a black cat that is only white and not >>> black at all? (It must be a black cat or it doesn't count). >> >> >> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >> >> Can YOU show me a counter example of Computation that Halts when >> directly run but doesn't halt when properly simulated? >> >> Your claim is A -> B, where A is the P needs to have its simulation >> terminated to prevent an infinite simulation, and B is that P is a >> non-Halting Behavior. >> >> That Statement actual WOULD be right with the proper definitions, but >> you include at any level of the execution tree. >> >> A counter to that would be to show a case where A is true and B is false >> (i.e. P is Halting) >> >> H^ IS that example since you claim A is true for H^(H^) since it only >> stops because the H inside H^ terminated its simulation of the copy of >> H^,H^ it was given. It has been shown that H^(H^) will halt when run on >> its own, and thus is a Halting Computation. > > > Truism(1) > Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. Error in classification. Descriptions don't halt or not. Machines do. H^([H^]) is a Halting Compuation, so [H^]) is the description of a Halting computation, and putting [H^] into a pure simulator would finish simulation in finite time without the need to abort the simulation. Yes, it gets there because the definition of H includes an incorrect aborting of the simulation, but that just makes H wrong, not H^ non-halting. > > Truism(2) > Every simulation of input P that would never halt unless simulating halt > decider H stopped simulating it <is> a non-halting computation. This > remains true even after H stops simulating P. > Probem in definition. As pointed above, with P=H^, simulation([P],[P]) wlll come to a halt, so the decider that says otherwise is wrong. The fact that internal to H^ is a simulation with H that makes this erroneous decision to abort the simulation has NO affect of the definiton of whether H^ is a Halting compuation or not, or if the simulation of [H^] will finish. > Truism(3) > Ĥ([Ĥ]) Halts because it aborted simulation of its input. Very badly stated. H^([H^]) Halts because the copy of H that is part of its algorithm decides to stop its simulation of the description of H^ given to it, and returns the (incorrect) non-Halting decision. H^ Halts COMPLETELY based on its own logic and is thus a Halting Computation (which you seem to accept) > > Conclusion: > Ĥ is a halting computation and its input is not a halting computation > therefore Ĥ decides its input [Ĥ] as non-halting correctly. Error in classification. 'Inputs' aren't Halting or Non-Halting. That is an attribute of Computation. H make an ERROR in deciding to Halt the simulation and calling H^ to be non-halting, because if it didn't halt the simulation, the version of H^ it is simulating WOULD STILL HALT as it is based on this same broken H. Note, if you change the H that we built the H^ on, we have a NEW H^, and you need to make sure that H(H^,H^) still returns. You make this error when you do your analysis. Since H^ does Halt, [H^] is the description of a Halting Computation, so H needs to return Halting when it analyses it. > > So far every attempt at rebuttal has been absolutely nothing more than: > "I really really don't believe the truisms." No, First, these are NOT 'Truisms' these are just your own assertions that you don't wish to try to prove. Truism are statements SO true that they don't really provide any useful information and no one will object to them. You are SO bad with your use of definitions that it is pathetic. Please review Theory of Logic 101 so you understand what it actually means to prove something. > >> Thus you rule, with your >> definitions and application is invalid. We can argue if it is the rule >> that is wrong or your method of matching, but the combination is wrong, >> so you get the wrong answer. >> >> ANYTHING that wants to define H^(H^) (with our current definition of H) >> to be non-Halting MUST be wrong, since we have the proof that it does >> halt when run. You can choose HOW you want to be wrong. >> >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 15:45 -0500 |
| Subject | Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) |
| Message-ID | <ouSdnUKwX-Ej5Tj9nZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #33944 |
On 5/19/2021 3:20 PM, Richard Damon wrote: > On 5/19/21 1:29 PM, olcott wrote: >> On 5/19/2021 9:37 AM, Richard Damon wrote: >>> On 5/19/21 9:58 AM, olcott wrote: >>>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>>> On 5/18/21 10:35 PM, olcott wrote: >>>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>>> >>>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior pattern >>>>>>>>>>>>>> has >>>>>>>>>>>>>> been very persistently ignored because it does prove that I am >>>>>>>>>>>>>> correct: >>>>>>>>>>>>>> >>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>>> >>>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>>> >>>>>>>>>>>>> But what value is H then supposed to return? According to the >>>>>>>>>>>>> very >>>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final state >>>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also reach the >>>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>>> >>>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>>> >>>>>>>>>>>>> André >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>>> simulated by simulating halt decider H never needing to have its >>>>>>>>>>>> simulation aborted to prevent its infinite execution then the >>>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>>> >>>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>>> doesn't >>>>>>>>>>> halt. >>>>>>>>>>> >>>>>>>>>>> But that's not how halting it is defined. >>>>>>>>>> >>>>>>>>>> None-the less it a one correct way that halting can be defined. >>>>>>>>> >>>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>>> definition >>>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>>> halting. >>>>>>>> >>>>>>>> In other words you are saying that when the a simulating halt >>>>>>>> decider H >>>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>>> this >>>>>>>> not halting tautology is not true? >>>>>>>> >>>>>>>> I am stopping at the first big mistake. >>>>>>> >>>>>>> The criteria you parrot can be used in the right way to show >>>>>>> non-halting >>>>>>> behavior. You unfortunately don't do it the right way and make MANY >>>>>>> mistakes. >>>>>>> >>>>>> >>>>>> Can you come up with a counter-example input P to any simulating halt >>>>>> decider H such that the input P must have its simulation terminated to >>>>>> prevent its infinite execution <and> input P is a halting computation? >>>>> >>>>> >>>>> H^(H^), it Halts, as you have admitted. >>>>> >>>>> You also claim that it needs to have its simulation terminated. >>>>> >>>>> Thus it is a counter. >>>>> >>>> >>>> I will paraphrase my request for counter-example >>>> Can you come up with a counter-example input P to any simulating halt >>>> decider H such that the input P: >>>> >>>> (a) Must have its simulation terminated to prevent its infinite >>>> execution (non-halting computation) >>>> >>>> <and> >>>> >>>> (b) Need not have its simulation terminated to prevent its infinite >>>> execution (halting computation) ? >>>> >>>> Can you show me a picture of a black cat that is only white and not >>>> black at all? (It must be a black cat or it doesn't count). >>> >>> >>> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >>> >>> Can YOU show me a counter example of Computation that Halts when >>> directly run but doesn't halt when properly simulated? >>> >>> Your claim is A -> B, where A is the P needs to have its simulation >>> terminated to prevent an infinite simulation, and B is that P is a >>> non-Halting Behavior. >>> >>> That Statement actual WOULD be right with the proper definitions, but >>> you include at any level of the execution tree. >>> >>> A counter to that would be to show a case where A is true and B is false >>> (i.e. P is Halting) >>> >>> H^ IS that example since you claim A is true for H^(H^) since it only >>> stops because the H inside H^ terminated its simulation of the copy of >>> H^,H^ it was given. It has been shown that H^(H^) will halt when run on >>> its own, and thus is a Halting Computation. >> >> >> Truism(1) >> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. > > Error in classification. Descriptions don't halt or not. Machines do. Truism(1) (reworded) The simulation of [Ĥ] by its simulating halt decider Ĥ would never halt unless this simulation is aborted. > H^([H^]) is a Halting Compuation, so [H^]) is the description of a > Halting computation, and putting [H^] into a pure simulator would finish > simulation in finite time without the need to abort the simulation. > > Yes, it gets there because the definition of H includes an incorrect > aborting of the simulation, but that just makes H wrong, not H^ non-halting. You already agreed that it is <not> wrong: 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, We have to stay focused on the single point until you agree with yourself. -- 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 17:16 -0400 |
| Subject | Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) |
| Message-ID | <WefpI.147849$lyv9.104436@fx35.iad> |
| In reply to | #33946 |
On 5/19/21 4:45 PM, olcott wrote: > On 5/19/2021 3:20 PM, Richard Damon wrote: >> On 5/19/21 1:29 PM, olcott wrote: >>> On 5/19/2021 9:37 AM, Richard Damon wrote: >>>> On 5/19/21 9:58 AM, olcott wrote: >>>>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>>>> On 5/18/21 10:35 PM, olcott wrote: >>>>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>>>> >>>>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior pattern >>>>>>>>>>>>>>> has >>>>>>>>>>>>>>> been very persistently ignored because it does prove that >>>>>>>>>>>>>>> I am >>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>>>> >>>>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>>>> >>>>>>>>>>>>>> But what value is H then supposed to return? According to the >>>>>>>>>>>>>> very >>>>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final >>>>>>>>>>>>>> state >>>>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also >>>>>>>>>>>>>> reach the >>>>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>>>> >>>>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>>>> >>>>>>>>>>>>>> André >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>>>> simulated by simulating halt decider H never needing to >>>>>>>>>>>>> have its >>>>>>>>>>>>> simulation aborted to prevent its infinite execution then the >>>>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>>>> >>>>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>>>> doesn't >>>>>>>>>>>> halt. >>>>>>>>>>>> >>>>>>>>>>>> But that's not how halting it is defined. >>>>>>>>>>> >>>>>>>>>>> None-the less it a one correct way that halting can be defined. >>>>>>>>>> >>>>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>>>> definition >>>>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>>>> halting. >>>>>>>>> >>>>>>>>> In other words you are saying that when the a simulating halt >>>>>>>>> decider H >>>>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>>>> this >>>>>>>>> not halting tautology is not true? >>>>>>>>> >>>>>>>>> I am stopping at the first big mistake. >>>>>>>> >>>>>>>> The criteria you parrot can be used in the right way to show >>>>>>>> non-halting >>>>>>>> behavior. You unfortunately don't do it the right way and make MANY >>>>>>>> mistakes. >>>>>>>> >>>>>>> >>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>> halt >>>>>>> decider H such that the input P must have its simulation >>>>>>> terminated to >>>>>>> prevent its infinite execution <and> input P is a halting >>>>>>> computation? >>>>>> >>>>>> >>>>>> H^(H^), it Halts, as you have admitted. >>>>>> >>>>>> You also claim that it needs to have its simulation terminated. >>>>>> >>>>>> Thus it is a counter. >>>>>> >>>>> >>>>> I will paraphrase my request for counter-example >>>>> Can you come up with a counter-example input P to any simulating halt >>>>> decider H such that the input P: >>>>> >>>>> (a) Must have its simulation terminated to prevent its infinite >>>>> execution (non-halting computation) >>>>> >>>>> <and> >>>>> >>>>> (b) Need not have its simulation terminated to prevent its infinite >>>>> execution (halting computation) ? >>>>> >>>>> Can you show me a picture of a black cat that is only white and not >>>>> black at all? (It must be a black cat or it doesn't count). >>>> >>>> >>>> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >>>> >>>> Can YOU show me a counter example of Computation that Halts when >>>> directly run but doesn't halt when properly simulated? >>>> >>>> Your claim is A -> B, where A is the P needs to have its simulation >>>> terminated to prevent an infinite simulation, and B is that P is a >>>> non-Halting Behavior. >>>> >>>> That Statement actual WOULD be right with the proper definitions, but >>>> you include at any level of the execution tree. >>>> >>>> A counter to that would be to show a case where A is true and B is >>>> false >>>> (i.e. P is Halting) >>>> >>>> H^ IS that example since you claim A is true for H^(H^) since it only >>>> stops because the H inside H^ terminated its simulation of the copy of >>>> H^,H^ it was given. It has been shown that H^(H^) will halt when run on >>>> its own, and thus is a Halting Computation. >>> >>> >>> Truism(1) >>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >> >> Error in classification. Descriptions don't halt or not. Machines do. > > Truism(1) (reworded) > The simulation of [Ĥ] by its simulating halt decider Ĥ would never halt > unless this simulation is aborted. > >> H^([H^]) is a Halting Compuation, so [H^]) is the description of a >> Halting computation, and putting [H^] into a pure simulator would finish >> simulation in finite time without the need to abort the simulation. >> >> Yes, it gets there because the definition of H includes an incorrect >> aborting of the simulation, but that just makes H wrong, not H^ >> non-halting. > > You already agreed that it is <not> wrong: > > 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, > > We have to stay focused on the single point until you agree with yourself. > LIAR. YOU INTENTIONALLY MISQUOTE AGAIN. I Said that *IF* (do you know what that word means) H did not have code to terminate the otherwise infinite recursion, than yes, you get infinite recursion. BUT (Do you know what that means) it is a fact that H DOES have the code to stop the otherwise potentially infinite recursion, and thus H^ does NOT specify infinite recuring. NOT SPECIFYING INFINITE RECURSION is NOT SPECIFYING INFINITE RECURSION. You can't claim that H was right because H^ specified infinite recursion, because it doesn't. If H didn't have the code, then the H^ based on that H would have an infinite simulation recursion, but it doesn't matter as that H fails to be a valid Halt Decider because it doesn't give the answer. YOU CAN'T HAVE IT BOTH WAYS. Either H HAS the code, so H^ doesn' specify an infinite recursion, or it doesn't have the code and H doesn't answer and fails there. Either way, H fails. It is only by LYING about H not having code to terminate the loop that you can argue that the code in non-halting, but once H will stop it, so does the copy inside H^, and thus H is still wrong, just in a different way.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 16:48 -0500 |
| Subject | Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) |
| Message-ID | <6didnZP8tsD1Gjj9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #33948 |
On 5/19/2021 4:16 PM, Richard Damon wrote: > On 5/19/21 4:45 PM, olcott wrote: >> On 5/19/2021 3:20 PM, Richard Damon wrote: >>> On 5/19/21 1:29 PM, olcott wrote: >>>> On 5/19/2021 9:37 AM, Richard Damon wrote: >>>>> On 5/19/21 9:58 AM, olcott wrote: >>>>>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>>>>> On 5/18/21 10:35 PM, olcott wrote: >>>>>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior pattern >>>>>>>>>>>>>>>> has >>>>>>>>>>>>>>>> been very persistently ignored because it does prove that >>>>>>>>>>>>>>>> I am >>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> But what value is H then supposed to return? According to the >>>>>>>>>>>>>>> very >>>>>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final >>>>>>>>>>>>>>> state >>>>>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also >>>>>>>>>>>>>>> reach the >>>>>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> André >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>>>>> simulated by simulating halt decider H never needing to >>>>>>>>>>>>>> have its >>>>>>>>>>>>>> simulation aborted to prevent its infinite execution then the >>>>>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>>>>> >>>>>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>>>>> doesn't >>>>>>>>>>>>> halt. >>>>>>>>>>>>> >>>>>>>>>>>>> But that's not how halting it is defined. >>>>>>>>>>>> >>>>>>>>>>>> None-the less it a one correct way that halting can be defined. >>>>>>>>>>> >>>>>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>>>>> definition >>>>>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>>>>> halting. >>>>>>>>>> >>>>>>>>>> In other words you are saying that when the a simulating halt >>>>>>>>>> decider H >>>>>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>>>>> this >>>>>>>>>> not halting tautology is not true? >>>>>>>>>> >>>>>>>>>> I am stopping at the first big mistake. >>>>>>>>> >>>>>>>>> The criteria you parrot can be used in the right way to show >>>>>>>>> non-halting >>>>>>>>> behavior. You unfortunately don't do it the right way and make MANY >>>>>>>>> mistakes. >>>>>>>>> >>>>>>>> >>>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>>> halt >>>>>>>> decider H such that the input P must have its simulation >>>>>>>> terminated to >>>>>>>> prevent its infinite execution <and> input P is a halting >>>>>>>> computation? >>>>>>> >>>>>>> >>>>>>> H^(H^), it Halts, as you have admitted. >>>>>>> >>>>>>> You also claim that it needs to have its simulation terminated. >>>>>>> >>>>>>> Thus it is a counter. >>>>>>> >>>>>> >>>>>> I will paraphrase my request for counter-example >>>>>> Can you come up with a counter-example input P to any simulating halt >>>>>> decider H such that the input P: >>>>>> >>>>>> (a) Must have its simulation terminated to prevent its infinite >>>>>> execution (non-halting computation) >>>>>> >>>>>> <and> >>>>>> >>>>>> (b) Need not have its simulation terminated to prevent its infinite >>>>>> execution (halting computation) ? >>>>>> >>>>>> Can you show me a picture of a black cat that is only white and not >>>>>> black at all? (It must be a black cat or it doesn't count). >>>>> >>>>> >>>>> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >>>>> >>>>> Can YOU show me a counter example of Computation that Halts when >>>>> directly run but doesn't halt when properly simulated? >>>>> >>>>> Your claim is A -> B, where A is the P needs to have its simulation >>>>> terminated to prevent an infinite simulation, and B is that P is a >>>>> non-Halting Behavior. >>>>> >>>>> That Statement actual WOULD be right with the proper definitions, but >>>>> you include at any level of the execution tree. >>>>> >>>>> A counter to that would be to show a case where A is true and B is >>>>> false >>>>> (i.e. P is Halting) >>>>> >>>>> H^ IS that example since you claim A is true for H^(H^) since it only >>>>> stops because the H inside H^ terminated its simulation of the copy of >>>>> H^,H^ it was given. It has been shown that H^(H^) will halt when run on >>>>> its own, and thus is a Halting Computation. >>>> >>>> >>>> Truism(1) >>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >>> >>> Error in classification. Descriptions don't halt or not. Machines do. >> >> Truism(1) (reworded) >> The simulation of [Ĥ] by its simulating halt decider Ĥ would never halt >> unless this simulation is aborted. >> >>> H^([H^]) is a Halting Compuation, so [H^]) is the description of a >>> Halting computation, and putting [H^] into a pure simulator would finish >>> simulation in finite time without the need to abort the simulation. >>> >>> Yes, it gets there because the definition of H includes an incorrect >>> aborting of the simulation, but that just makes H wrong, not H^ >>> non-halting. >> >> You already agreed that it is <not> wrong: >> >> 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, >> >> We have to stay focused on the single point until you agree with yourself. >> > > LIAR. YOU INTENTIONALLY MISQUOTE AGAIN. > I always use cut-and-paste and I always include the time-date-stamp. "if the claimed Halt Decider doesn't break the recursion," then the simulation of [Ĥ] never halts. Thus matching this truism: >> Truism(1) (reworded) >> The simulation of [Ĥ] by its simulating halt decider Ĥ would >> never halt unless this simulation is aborted. -- 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 19:21 -0400 |
| Subject | Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) |
| Message-ID | <A3hpI.363823$ST2.94055@fx47.iad> |
| In reply to | #33951 |
On 5/19/21 5:48 PM, olcott wrote: > On 5/19/2021 4:16 PM, Richard Damon wrote: >> On 5/19/21 4:45 PM, olcott wrote: >>> On 5/19/2021 3:20 PM, Richard Damon wrote: >>>> On 5/19/21 1:29 PM, olcott wrote: >>>>> On 5/19/2021 9:37 AM, Richard Damon wrote: >>>>>> On 5/19/21 9:58 AM, olcott wrote: >>>>>>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>>>>>> On 5/18/21 10:35 PM, olcott wrote: >>>>>>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior >>>>>>>>>>>>>>>>> pattern >>>>>>>>>>>>>>>>> has >>>>>>>>>>>>>>>>> been very persistently ignored because it does prove that >>>>>>>>>>>>>>>>> I am >>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> But what value is H then supposed to return? According >>>>>>>>>>>>>>>> to the >>>>>>>>>>>>>>>> very >>>>>>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final >>>>>>>>>>>>>>>> state >>>>>>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also >>>>>>>>>>>>>>>> reach the >>>>>>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> André >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>>>>>> simulated by simulating halt decider H never needing to >>>>>>>>>>>>>>> have its >>>>>>>>>>>>>>> simulation aborted to prevent its infinite execution then >>>>>>>>>>>>>>> the >>>>>>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>>>>>> >>>>>>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>>>>>> doesn't >>>>>>>>>>>>>> halt. >>>>>>>>>>>>>> >>>>>>>>>>>>>> But that's not how halting it is defined. >>>>>>>>>>>>> >>>>>>>>>>>>> None-the less it a one correct way that halting can be >>>>>>>>>>>>> defined. >>>>>>>>>>>> >>>>>>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>>>>>> definition >>>>>>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>>>>>> halting. >>>>>>>>>>> >>>>>>>>>>> In other words you are saying that when the a simulating halt >>>>>>>>>>> decider H >>>>>>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>>>>>> this >>>>>>>>>>> not halting tautology is not true? >>>>>>>>>>> >>>>>>>>>>> I am stopping at the first big mistake. >>>>>>>>>> >>>>>>>>>> The criteria you parrot can be used in the right way to show >>>>>>>>>> non-halting >>>>>>>>>> behavior. You unfortunately don't do it the right way and make >>>>>>>>>> MANY >>>>>>>>>> mistakes. >>>>>>>>>> >>>>>>>>> >>>>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>>>> halt >>>>>>>>> decider H such that the input P must have its simulation >>>>>>>>> terminated to >>>>>>>>> prevent its infinite execution <and> input P is a halting >>>>>>>>> computation? >>>>>>>> >>>>>>>> >>>>>>>> H^(H^), it Halts, as you have admitted. >>>>>>>> >>>>>>>> You also claim that it needs to have its simulation terminated. >>>>>>>> >>>>>>>> Thus it is a counter. >>>>>>>> >>>>>>> >>>>>>> I will paraphrase my request for counter-example >>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>> halt >>>>>>> decider H such that the input P: >>>>>>> >>>>>>> (a) Must have its simulation terminated to prevent its infinite >>>>>>> execution (non-halting computation) >>>>>>> >>>>>>> <and> >>>>>>> >>>>>>> (b) Need not have its simulation terminated to prevent its infinite >>>>>>> execution (halting computation) ? >>>>>>> >>>>>>> Can you show me a picture of a black cat that is only white and not >>>>>>> black at all? (It must be a black cat or it doesn't count). >>>>>> >>>>>> >>>>>> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >>>>>> >>>>>> Can YOU show me a counter example of Computation that Halts when >>>>>> directly run but doesn't halt when properly simulated? >>>>>> >>>>>> Your claim is A -> B, where A is the P needs to have its simulation >>>>>> terminated to prevent an infinite simulation, and B is that P is a >>>>>> non-Halting Behavior. >>>>>> >>>>>> That Statement actual WOULD be right with the proper definitions, but >>>>>> you include at any level of the execution tree. >>>>>> >>>>>> A counter to that would be to show a case where A is true and B is >>>>>> false >>>>>> (i.e. P is Halting) >>>>>> >>>>>> H^ IS that example since you claim A is true for H^(H^) since it only >>>>>> stops because the H inside H^ terminated its simulation of the >>>>>> copy of >>>>>> H^,H^ it was given. It has been shown that H^(H^) will halt when >>>>>> run on >>>>>> its own, and thus is a Halting Computation. >>>>> >>>>> >>>>> Truism(1) >>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >>>> >>>> Error in classification. Descriptions don't halt or not. Machines do. >>> >>> Truism(1) (reworded) >>> The simulation of [Ĥ] by its simulating halt decider Ĥ would never halt >>> unless this simulation is aborted. >>> >>>> H^([H^]) is a Halting Compuation, so [H^]) is the description of a >>>> Halting computation, and putting [H^] into a pure simulator would >>>> finish >>>> simulation in finite time without the need to abort the simulation. >>>> >>>> Yes, it gets there because the definition of H includes an incorrect >>>> aborting of the simulation, but that just makes H wrong, not H^ >>>> non-halting. >>> >>> You already agreed that it is <not> wrong: >>> >>> 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, >>> >>> We have to stay focused on the single point until you agree with >>> yourself. >>> >> >> LIAR. YOU INTENTIONALLY MISQUOTE AGAIN. >> > > I always use cut-and-paste and I always include the time-date-stamp. > > "if the claimed Halt Decider doesn't break the recursion," > then the simulation of [Ĥ] never halts. > > Thus matching this truism: >>> Truism(1) (reworded) >>> The simulation of [Ĥ] by its simulating halt decider Ĥ would >>> never halt unless this simulation is aborted. > And you can lie by triming what you quoted. My ACCTUAL FULL QUOTE: > > 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 have logic to break the recursion, then you get the infinite recursion, but also H doesn't answer H(H^,H^) so is incorrecct. IF the Halt Decider DOES have the logic and break the recursion, then there is not infinite recursion. The is a BIG difference between "doesn't and "if it didn't". Once H does decide to break the recursion, ALL logic based on it not breaking it MUST be thrown out. There is no such thing in the definition for things like 'if it didn't but it will anyway' YOU LIE with you language, which I suppose is a good counter for your claim that that natuarl language semantic are a good way to convey Truth. Maybe you should go and attach the UUID of the meaning of all your words and see how you keep changing the meaning to try and show that some things should be obvious but also can carry your lies, by just a subtle shift of meaning.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 23:20 -0500 |
| Subject | Re: Halting theorem refutation ( three irrefutable truisms lead to one conclusion )(repeat until agreement) |
| Message-ID | <W_Cdna57CI_3fjj9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #33968 |
On 5/19/2021 6:21 PM, Richard Damon wrote: > On 5/19/21 5:48 PM, olcott wrote: >> On 5/19/2021 4:16 PM, Richard Damon wrote: >>> On 5/19/21 4:45 PM, olcott wrote: >>>> On 5/19/2021 3:20 PM, Richard Damon wrote: >>>>> On 5/19/21 1:29 PM, olcott wrote: >>>>>> On 5/19/2021 9:37 AM, Richard Damon wrote: >>>>>>> On 5/19/21 9:58 AM, olcott wrote: >>>>>>>> On 5/19/2021 6:43 AM, Richard Damon wrote: >>>>>>>>> On 5/18/21 10:35 PM, olcott wrote: >>>>>>>>>> On 5/18/2021 9:22 PM, Richard Damon wrote: >>>>>>>>>>> On 5/18/21 9:19 PM, olcott wrote: >>>>>>>>>>>> On 5/18/2021 7:40 PM, André G. Isaak wrote: >>>>>>>>>>>>> On 2021-05-18 18:05, olcott wrote: >>>>>>>>>>>>>> On 5/18/2021 6:41 PM, André G. Isaak wrote: >>>>>>>>>>>>>>> On 2021-05-18 17:09, olcott wrote: >>>>>>>>>>>>>>>> On 5/18/2021 5:50 PM, André G. Isaak wrote: >>>>>>>>>>>>>>>>> On 2021-05-18 15:50, olcott wrote: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> In the mean time the fact that Ĥ([Ĥ]) matches the >>>>>>>>>>>>>>>>>> [infinitely_nested_simulation] non-halting behavior >>>>>>>>>>>>>>>>>> pattern >>>>>>>>>>>>>>>>>> has >>>>>>>>>>>>>>>>>> been very persistently ignored because it does prove that >>>>>>>>>>>>>>>>>> I am >>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>>>>>>>>>>>>>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> Above you state that Ĥ(Ĥ) matches a non-halting pattern. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> But what value is H then supposed to return? According >>>>>>>>>>>>>>>>> to the >>>>>>>>>>>>>>>>> very >>>>>>>>>>>>>>>>> description you give above, if H(Ĥ, Ĥ) reaches the final >>>>>>>>>>>>>>>>> state >>>>>>>>>>>>>>>>> H.qn (i.e returns non-halting), then Ĥ(Ĥ) *must* also >>>>>>>>>>>>>>>>> reach the >>>>>>>>>>>>>>>>> final state Ĥ.qn. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> If it were really true that Ĥ(Ĥ) is non-halting, then it >>>>>>>>>>>>>>>>> *wouldn't* reach a final state. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> André >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> When halting(P) is defined as any sequence of instructions P >>>>>>>>>>>>>>>> simulated by simulating halt decider H never needing to >>>>>>>>>>>>>>>> have its >>>>>>>>>>>>>>>> simulation aborted to prevent its infinite execution then >>>>>>>>>>>>>>>> the >>>>>>>>>>>>>>>> pathological self-reference error of the halting theorem is >>>>>>>>>>>>>>>> circumvented and halting becomes decidable. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> And when halting(P) is defined as 'returns 5', then (3 + 6) >>>>>>>>>>>>>>> doesn't >>>>>>>>>>>>>>> halt. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> But that's not how halting it is defined. >>>>>>>>>>>>>> >>>>>>>>>>>>>> None-the less it a one correct way that halting can be >>>>>>>>>>>>>> defined. >>>>>>>>>>>>> >>>>>>>>>>>>> No, it isn't. 'Halting' is already precisely defined. Any >>>>>>>>>>>>> definition >>>>>>>>>>>>> which makes different claims is not a 'correct' way of defining >>>>>>>>>>>>> halting. >>>>>>>>>>>> >>>>>>>>>>>> In other words you are saying that when the a simulating halt >>>>>>>>>>>> decider H >>>>>>>>>>>> stops simulating an input P that would never otherwise halt that >>>>>>>>>>>> this >>>>>>>>>>>> not halting tautology is not true? >>>>>>>>>>>> >>>>>>>>>>>> I am stopping at the first big mistake. >>>>>>>>>>> >>>>>>>>>>> The criteria you parrot can be used in the right way to show >>>>>>>>>>> non-halting >>>>>>>>>>> behavior. You unfortunately don't do it the right way and make >>>>>>>>>>> MANY >>>>>>>>>>> mistakes. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>>>>> halt >>>>>>>>>> decider H such that the input P must have its simulation >>>>>>>>>> terminated to >>>>>>>>>> prevent its infinite execution <and> input P is a halting >>>>>>>>>> computation? >>>>>>>>> >>>>>>>>> >>>>>>>>> H^(H^), it Halts, as you have admitted. >>>>>>>>> >>>>>>>>> You also claim that it needs to have its simulation terminated. >>>>>>>>> >>>>>>>>> Thus it is a counter. >>>>>>>>> >>>>>>>> >>>>>>>> I will paraphrase my request for counter-example >>>>>>>> Can you come up with a counter-example input P to any simulating >>>>>>>> halt >>>>>>>> decider H such that the input P: >>>>>>>> >>>>>>>> (a) Must have its simulation terminated to prevent its infinite >>>>>>>> execution (non-halting computation) >>>>>>>> >>>>>>>> <and> >>>>>>>> >>>>>>>> (b) Need not have its simulation terminated to prevent its infinite >>>>>>>> execution (halting computation) ? >>>>>>>> >>>>>>>> Can you show me a picture of a black cat that is only white and not >>>>>>>> black at all? (It must be a black cat or it doesn't count). >>>>>>> >>>>>>> >>>>>>> LOGICAL FALICY. BAD DEFINITION. WRONG REQUIREMENTS. >>>>>>> >>>>>>> Can YOU show me a counter example of Computation that Halts when >>>>>>> directly run but doesn't halt when properly simulated? >>>>>>> >>>>>>> Your claim is A -> B, where A is the P needs to have its simulation >>>>>>> terminated to prevent an infinite simulation, and B is that P is a >>>>>>> non-Halting Behavior. >>>>>>> >>>>>>> That Statement actual WOULD be right with the proper definitions, but >>>>>>> you include at any level of the execution tree. >>>>>>> >>>>>>> A counter to that would be to show a case where A is true and B is >>>>>>> false >>>>>>> (i.e. P is Halting) >>>>>>> >>>>>>> H^ IS that example since you claim A is true for H^(H^) since it only >>>>>>> stops because the H inside H^ terminated its simulation of the >>>>>>> copy of >>>>>>> H^,H^ it was given. It has been shown that H^(H^) will halt when >>>>>>> run on >>>>>>> its own, and thus is a Halting Computation. >>>>>> >>>>>> >>>>>> Truism(1) >>>>>> Input: [Ĥ] to Ĥ([Ĥ]) would never halt unless is simulation is aborted. >>>>> >>>>> Error in classification. Descriptions don't halt or not. Machines do. >>>> >>>> Truism(1) (reworded) >>>> The simulation of [Ĥ] by its simulating halt decider Ĥ would never halt >>>> unless this simulation is aborted. >>>> >>>>> H^([H^]) is a Halting Compuation, so [H^]) is the description of a >>>>> Halting computation, and putting [H^] into a pure simulator would >>>>> finish >>>>> simulation in finite time without the need to abort the simulation. >>>>> >>>>> Yes, it gets there because the definition of H includes an incorrect >>>>> aborting of the simulation, but that just makes H wrong, not H^ >>>>> non-halting. >>>> >>>> You already agreed that it is <not> wrong: >>>> >>>> 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, >>>> >>>> We have to stay focused on the single point until you agree with >>>> yourself. >>>> >>> >>> LIAR. YOU INTENTIONALLY MISQUOTE AGAIN. >>> >> >> I always use cut-and-paste and I always include the time-date-stamp. >> >> "if the claimed Halt Decider doesn't break the recursion," >> then the simulation of [Ĥ] never halts. >> >> Thus matching this truism: >>>> Truism(1) (reworded) >>>> The simulation of [Ĥ] by its simulating halt decider Ĥ would >>>> never halt unless this simulation is aborted. >> > > And you can lie by triming what you quoted. > > My ACCTUAL FULL QUOTE: > >> >> 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 have logic to break the recursion, then > you get the infinite recursion, but also H doesn't answer H(H^,H^) so is > incorrecct. > > IF the Halt Decider DOES have the logic and break the recursion, then > there is not infinite recursion. > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn Truism(1a) The simulation of: ([Ĥ][Ĥ]) by the simulating halt decider @ Ĥ.qx would never halt unless Ĥ.qx aborts this simulation. Truism(1b) (1a) is another way of saying that the simulation of: ([Ĥ][Ĥ]) by a UTM @ Ĥ.qx would never halt. Unless and until people understand that (1a) is a paraphrase of (1b) we cannot move to truism(2). > The is a BIG difference between "doesn't and "if it didn't". > > Once H does decide to break the recursion, ALL logic based on it not > breaking it MUST be thrown out. > There is no such thing in the definition > for things like 'if it didn't but it will anyway' > > YOU LIE with you language, which I suppose is a good counter for your > claim that that natuarl language semantic are a good way to convey Truth. > > Maybe you should go and attach the UUID of the meaning of all your words > and see how you keep changing the meaning to try and show that some > things should be obvious but also can carry your lies, by just a subtle > shift of meaning. > > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-19 06:11 +0000 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( truism / updated criteria ) |
| Message-ID | <20210518230549.964@kylheku.com> |
| In reply to | #33872 |
On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: > A full halt decider could be build on the basis of this definition of > halting: > > When halting(P) is defined as any sequence of instructions P simulated > by simulating halt decider H never needing to have its simulation > aborted to prevent its infinite execution then the pathological > self-reference error of the halting theorem is circumvented and halting > becomes decidable. No new result can follow from a reformulation of the halting definition, if it is equivalent to the standard definitions. Here, either you are redefining what halting means, or you not. If you're not redefining what halting means, then you cannot presume that any new properties follow from the definition you're giving, like "circumventing the halting theorem". Why would the theorem apply to one definition of halting, but another, *equivalent* definition would evade it? It makes no sense. If you /are/ redefining halting, then what you're doing doesn't speak to standard halting. Which is it?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-19 09:00 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus )(3) |
| Message-ID | <dv-dnUpEfZJHhDj9nZ2dnUU7-VGdnZ2d@giganews.com> |
| In reply to | #33901 |
On 5/19/2021 8:51 AM, Kaz Kylheku wrote: > On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >> On 5/19/2021 1:11 AM, Kaz Kylheku wrote: >>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>> A full halt decider could be build on the basis of this definition of >>>> halting: >>>> >>>> When halting(P) is defined as any sequence of instructions P simulated >>>> by simulating halt decider H never needing to have its simulation >>>> aborted to prevent its infinite execution then the pathological >>>> self-reference error of the halting theorem is circumvented and halting >>>> becomes decidable. >>> >>> No new result can follow from a reformulation of the halting definition, >>> if it is equivalent to the standard definitions. >> >> I am not allowing any change of subject until we have mutual agreement >> on each of the key steps of my proof. > > But it's kind of important: is your so-called proof about standard halting > or crackpot halting? > 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 | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-19 11:22 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Honest Dialogue? ]( single-minded focus )(3) |
| Message-ID | <s2apI.117952$9L1.116775@fx05.iad> |
| In reply to | #33911 |
On 5/19/21 10:00 AM, olcott wrote: > On 5/19/2021 8:51 AM, Kaz Kylheku wrote: >> On 2021-05-19, olcott <NoOne@NoWhere.com> wrote: >>> On 5/19/2021 1:11 AM, Kaz Kylheku wrote: >>>> On 2021-05-18, olcott <NoOne@NoWhere.com> wrote: >>>>> A full halt decider could be build on the basis of this definition of >>>>> halting: >>>>> >>>>> When halting(P) is defined as any sequence of instructions P simulated >>>>> by simulating halt decider H never needing to have its simulation >>>>> aborted to prevent its infinite execution then the pathological >>>>> self-reference error of the halting theorem is circumvented and >>>>> halting >>>>> becomes decidable. >>>> >>>> No new result can follow from a reformulation of the halting >>>> definition, >>>> if it is equivalent to the standard definitions. >>> >>> I am not allowing any change of subject until we have mutual agreement >>> on each of the key steps of my proof. >> >> But it's kind of important: is your so-called proof about standard >> halting >> or crackpot halting? >> > > 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? > AS I have pointed out several time. NO, not if H knows how to break the cycle so as to be able to call the loop (possibly incorrectly) non-Halting.
[toc] | [prev] | [next] | [standalone]
Page 41 of 50 — ← Prev page 1 … 39 40 [41] 42 43 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web