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 4 of 50 — ← Prev page 1 2 3 [4] 5 6 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 10:06 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <u9KdncD1LJPKjA39nZ2dnUU7-TfNnZ2d@giganews.com> |
| In reply to | #32627 |
On 5/3/2021 9:57 AM, Kaz Kylheku wrote: > On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>>> >>>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>>> >>>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>>> >>>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>>> >>>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>>>>> >>>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>>>>> computation. >>>>>>>>>>> >>>>>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>>> >>>>>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>>> >>>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>>>>> The point is that the invocation of X is not the same TM every time, >>>>>>>> >>>>>>>> The point is that the subsequent "invocations" are not invocations at >>>>>>>> all, they are data being processed by the only actual invocation that >>>>>>>> exists. >>>>>>> >>>>>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>>>>> "conventional proofs" of halting the corresponding entity is a function >>>>>>> of two arguments (and only those arguments), which is subject to actual >>>>>>> invocations. That's a key part of these proofs. >>>>>>> >>>>>> >>>>>> These proofs do not forbid simulating the input, and in fact do require >>>>>> that the inputs are not actual Turing machines they must be finite >>>>>> strings that describe Turing machines. >>>>> >>>>> Your belief here is uninformed and false. >>>> >>>> I stop reading at your first big mistake. >>> >>> Strings that describe Turing machines *are* actual Turing machines, and >>> must be correctly treated as such. >>> >>> Since you willfully ignore portions of responses, your claims >>> that nobody has found a flaw in your work are unfounded. >>> >> >> Since they cannot be directly executed they are not actual machines, > > "Turing machine" refers to the mathematical object and its description, > not to a simulation. > > You are harboring a false belief here. False beliefs read to work flaws. > >> they represent actual machines that can only be simulated in a simulator. > > In the "conventional halting proof" each call to Halts(P, I) is a > Turing machine instance. Executing it requires a fresh instance of > a simulator whose behavior is free from any external influence, like > from other simulations that have previously occurred. > > A given definition of Halts, a given P and a given I, completely > determines the initial tape contents. No content must come from anywhere > else. > > You have not assured this in your apparatus. Halts is not the > invocation of an ordinary function whose behavior depends on its > arguments. >> >> Try and run a C program without a compiler or an interpreter. >> The C program represents a computation it is not the actual computation >> itself. > In other words you are saying that a Turing machine and a Turing machine description are exactly the same thing thus no need for the term "Turing machine description" because it is exactly the same thing as a "Turing machine" thus all the technical papers and textbooks foolishly use the totally redundant term "Turing machine description". > All we ever have is representations, so you are just flailing your > fingers on a keyboard here without saying anything. > > When do we ever do any mathematics or logic with any object without > using representations? > -- 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-03 17:21 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210503100517.74@kylheku.com> |
| In reply to | #32630 |
On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 9:57 AM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>>>> >>>>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>>>> >>>>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>>>>>> >>>>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>>>>>> computation. >>>>>>>>>>>> >>>>>>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>>>> >>>>>>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>>>> >>>>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>>>>>> The point is that the invocation of X is not the same TM every time, >>>>>>>>> >>>>>>>>> The point is that the subsequent "invocations" are not invocations at >>>>>>>>> all, they are data being processed by the only actual invocation that >>>>>>>>> exists. >>>>>>>> >>>>>>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>>>>>> "conventional proofs" of halting the corresponding entity is a function >>>>>>>> of two arguments (and only those arguments), which is subject to actual >>>>>>>> invocations. That's a key part of these proofs. >>>>>>>> >>>>>>> >>>>>>> These proofs do not forbid simulating the input, and in fact do require >>>>>>> that the inputs are not actual Turing machines they must be finite >>>>>>> strings that describe Turing machines. >>>>>> >>>>>> Your belief here is uninformed and false. >>>>> >>>>> I stop reading at your first big mistake. >>>> >>>> Strings that describe Turing machines *are* actual Turing machines, and >>>> must be correctly treated as such. >>>> >>>> Since you willfully ignore portions of responses, your claims >>>> that nobody has found a flaw in your work are unfounded. >>>> >>> >>> Since they cannot be directly executed they are not actual machines, >> >> "Turing machine" refers to the mathematical object and its description, >> not to a simulation. >> >> You are harboring a false belief here. False beliefs read to work flaws. >> >>> they represent actual machines that can only be simulated in a simulator. >> >> In the "conventional halting proof" each call to Halts(P, I) is a >> Turing machine instance. Executing it requires a fresh instance of >> a simulator whose behavior is free from any external influence, like >> from other simulations that have previously occurred. >> >> A given definition of Halts, a given P and a given I, completely >> determines the initial tape contents. No content must come from anywhere >> else. >> >> You have not assured this in your apparatus. Halts is not the >> invocation of an ordinary function whose behavior depends on its >> arguments. >>> >>> Try and run a C program without a compiler or an interpreter. >>> The C program represents a computation it is not the actual computation >>> itself. >> > > In other words you are saying that a Turing machine and a Turing machine > description are exactly the same thing thus no need for the term "Turing > machine description" because it is exactly the same thing as a "Turing > machine" thus all the technical papers and textbooks foolishly use the > totally redundant term "Turing machine description". I'm saying descriptions/representations is all we ever have to work with. For the purpose of working with any concept like "TM", "number", "set", we manipulate representations and descriptions. Philosphically, the representation and description is not the same as the abstraction itself. That nitpicking is important when we focus on what it means to represent and describe; someone has to examine the correspondence between an abstraction and its representation in syntax. We can take representations themselves to be abstractions and subject them to scrutiny. When we do that the 2 + 2 representation of four becomes something different from 4, because it contains three symbols rather than one. That is, if we are working with syntax itself, 2 + 2 and 4 are different syntax. Practically, when we are working in the abstractions themselves, we take their symbolic representations in their place as those object. We just have to be careful that the symbolic manipulation rules do not lead us into some derivation that doesn't map back to the objects. -- 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-04 09:20 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <pZednYLy5u6LxQz9nZ2dnUU7-LfNnZ2d@giganews.com> |
| In reply to | #32648 |
On 5/3/2021 12:21 PM, Kaz Kylheku wrote: > On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 9:57 AM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of halting olcott's >>>>>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, there is an unproven >>>>>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an early halt that occurs >>>>>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he will. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going to provide an >>>>>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion detection criteria is >>>>>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the same machine address >>>>>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump instructions in Y() >>>>>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>>>>> then the function call from Y() to X() is infinitely recursive. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> This is only "right" from the perspective of an objective observation >>>>>>>>>>>>>>>>>>>> that is not involved in the computation, and has no effect on it. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> The function X() cannot itself make this observation. X has access to >>>>>>>>>>>>>>>>>>>> only its parameters, and its parameters do not carry any information >>>>>>>>>>>>>>>>>>>> indicating to X that it has been called twice from the same address >>>>>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are *always the same*. >>>>>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call from the second call >>>>>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> A function having adcess to past execution traces is an imperative >>>>>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I must be wrong on the >>>>>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> You have to concretely prove these dogmatic statements. When you attempt >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a similar structure to the >>>>>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and Y are functions, >>>>>>>>>>>>>>>>>> and not imperative procedures. They have no access to some global, >>>>>>>>>>>>>>>>>> mutating state holding execution traces; such a situation would >>>>>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes the infinite >>>>>>>>>>>>>>>> recursion pattern of its input, stops simulating its input on this >>>>>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot be the function >>>>>>>>>>>>>>> identified as X above. This is the proof you're trying to dislodge. >>>>>>>>>>>>>> >>>>>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that simulates a machine >>>>>>>>>>>>>> that simulates another machine that simulates yet another machine is all >>>>>>>>>>>>>> simply data processed by the UTM, thus (as long as it halts) a single >>>>>>>>>>>>>> computation. >>>>>>>>>>>>> >>>>>>>>>>>>> The issue is not that you do not have a computation. You probably do. >>>>>>>>>>>>> You evidently have repeatable test cases; you can execute your rig >>>>>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>>>>> >>>>>>>>>>>>> The issue is that is simply that the procedure which corresponds to X >>>>>>>>>>>>> is not a function. The application of the imperative procedure X to its >>>>>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> When a UTM M that simulates a TM X that simulates another TM Y that >>>>>>>>>>>> simulates yet another TM Z and the UTM M eventually transations to a >>>>>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>>>>> >>>>>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing the point. >>>>>>>>>>> The point is that the invocation of X is not the same TM every time, >>>>>>>>>> >>>>>>>>>> The point is that the subsequent "invocations" are not invocations at >>>>>>>>>> all, they are data being processed by the only actual invocation that >>>>>>>>>> exists. >>>>>>>>> >>>>>>>>> Right, see? So we are nothing but agreeing. And so, here we go. In the >>>>>>>>> "conventional proofs" of halting the corresponding entity is a function >>>>>>>>> of two arguments (and only those arguments), which is subject to actual >>>>>>>>> invocations. That's a key part of these proofs. >>>>>>>>> >>>>>>>> >>>>>>>> These proofs do not forbid simulating the input, and in fact do require >>>>>>>> that the inputs are not actual Turing machines they must be finite >>>>>>>> strings that describe Turing machines. >>>>>>> >>>>>>> Your belief here is uninformed and false. >>>>>> >>>>>> I stop reading at your first big mistake. >>>>> >>>>> Strings that describe Turing machines *are* actual Turing machines, and >>>>> must be correctly treated as such. >>>>> >>>>> Since you willfully ignore portions of responses, your claims >>>>> that nobody has found a flaw in your work are unfounded. >>>>> >>>> >>>> Since they cannot be directly executed they are not actual machines, >>> >>> "Turing machine" refers to the mathematical object and its description, >>> not to a simulation. >>> >>> You are harboring a false belief here. False beliefs read to work flaws. >>> >>>> they represent actual machines that can only be simulated in a simulator. >>> >>> In the "conventional halting proof" each call to Halts(P, I) is a >>> Turing machine instance. Executing it requires a fresh instance of >>> a simulator whose behavior is free from any external influence, like >>> from other simulations that have previously occurred. >>> >>> A given definition of Halts, a given P and a given I, completely >>> determines the initial tape contents. No content must come from anywhere >>> else. >>> >>> You have not assured this in your apparatus. Halts is not the >>> invocation of an ordinary function whose behavior depends on its >>> arguments. >>>> >>>> Try and run a C program without a compiler or an interpreter. >>>> The C program represents a computation it is not the actual computation >>>> itself. >>> >> >> In other words you are saying that a Turing machine and a Turing machine >> description are exactly the same thing thus no need for the term "Turing >> machine description" because it is exactly the same thing as a "Turing >> machine" thus all the technical papers and textbooks foolishly use the >> totally redundant term "Turing machine description". > > I'm saying descriptions/representations is all we ever have to work > with. > > For the purpose of working with any concept like "TM", "number", "set", > we manipulate representations and descriptions. > > Philosphically, the representation and description is not the same as > the abstraction itself. That nitpicking is important when we focus on > what it means to represent and describe; someone has to examine the > correspondence between an abstraction and its representation in syntax. > We can take representations themselves to be abstractions and subject > them to scrutiny. When we do that the 2 + 2 representation of four > becomes something different from 4, because it contains three symbols > rather than one. That is, if we are working with syntax itself, 2 + 2 > and 4 are different syntax. > > Practically, when we are working in the abstractions themselves, we > take their symbolic representations in their place as those object. > We just have to be careful that the symbolic manipulation rules do not > lead us into some derivation that doesn't map back to the objects. > None-the-less halt deciders always operate on text descriptions of Turing machines, they never operating on Turing machines themselves directly. Also these Turing machine descriptions are never directly executable they must always be simulated by a UTM. Because of this when UTM Halts simulates H_Hat which simulates Halts which simulates H_Hat which simulates Halts all of this whole thing is data being processed by the first instance of Halts, thus the final state that this first instance transitions to is a pure function of its input. That you did not seem to totally grasp the distinction between a TM and a simulated TM description any negative assessment from you of my analysis of the relation of Halts to H_Hat cannot be relied upon as accurate. You area about what a computable function is and what it is not does not seem to be correct. I cited three textbook definitions of this. -- 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-04 10:37 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <M_ckI.39548$7u1.35765@fx12.iad> |
| In reply to | #32662 |
On 5/4/21 10:20 AM, olcott wrote: > On 5/3/2021 12:21 PM, Kaz Kylheku wrote: >> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 9:57 AM, Kaz Kylheku wrote: >>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>> On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble >>>>>>>>>>>>>>>>>>>>>>>> <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of >>>>>>>>>>>>>>>>>>>>>>>>> halting olcott's >>>>>>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, >>>>>>>>>>>>>>>>>>>>>>>> there is an unproven >>>>>>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an >>>>>>>>>>>>>>>>>>>>>>>> early halt that occurs >>>>>>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he >>>>>>>>>>>>>>>>>>>>>>> will. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going >>>>>>>>>>>>>>>>>>>>>> to provide an >>>>>>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion >>>>>>>>>>>>>>>>>>>>>> detection criteria is >>>>>>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the >>>>>>>>>>>>>>>>>>>>>> same machine address >>>>>>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump >>>>>>>>>>>>>>>>>>>>>> instructions in Y() >>>>>>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>>>>>> then the function call from Y() to X() is >>>>>>>>>>>>>>>>>>>>>> infinitely recursive. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> This is only "right" from the perspective of an >>>>>>>>>>>>>>>>>>>>> objective observation >>>>>>>>>>>>>>>>>>>>> that is not involved in the computation, and has no >>>>>>>>>>>>>>>>>>>>> effect on it. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> The function X() cannot itself make this >>>>>>>>>>>>>>>>>>>>> observation. X has access to >>>>>>>>>>>>>>>>>>>>> only its parameters, and its parameters do not >>>>>>>>>>>>>>>>>>>>> carry any information >>>>>>>>>>>>>>>>>>>>> indicating to X that it has been called twice from >>>>>>>>>>>>>>>>>>>>> the same address >>>>>>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are >>>>>>>>>>>>>>>>>>>>> *always the same*. >>>>>>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call >>>>>>>>>>>>>>>>>>>>> from the second call >>>>>>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> A function having adcess to past execution traces >>>>>>>>>>>>>>>>>>>>> is an imperative >>>>>>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I >>>>>>>>>>>>>>>>>>>> must be wrong on the >>>>>>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> You have to concretely prove these dogmatic >>>>>>>>>>>>>>>>>>>> statements. When you attempt >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a >>>>>>>>>>>>>>>>>>> similar structure to the >>>>>>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and >>>>>>>>>>>>>>>>>>> Y are functions, >>>>>>>>>>>>>>>>>>> and not imperative procedures. They have >>>>>>>>>>>>>>>>>>> no access to some global, >>>>>>>>>>>>>>>>>>> mutating state holding execution traces; >>>>>>>>>>>>>>>>>>> such a situation would >>>>>>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes >>>>>>>>>>>>>>>>> the infinite >>>>>>>>>>>>>>>>> recursion pattern of its input, stops simulating its >>>>>>>>>>>>>>>>> input on this >>>>>>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot >>>>>>>>>>>>>>>> be the function >>>>>>>>>>>>>>>> identified as X above. This is the proof >>>>>>>>>>>>>>>> you're trying to dislodge. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that >>>>>>>>>>>>>>> simulates a machine >>>>>>>>>>>>>>> that simulates another machine that simulates yet another >>>>>>>>>>>>>>> machine is all >>>>>>>>>>>>>>> simply data processed by the UTM, thus (as long as it >>>>>>>>>>>>>>> halts) a single >>>>>>>>>>>>>>> computation. >>>>>>>>>>>>>> >>>>>>>>>>>>>> The issue is not that you do not have a computation. You >>>>>>>>>>>>>> probably do. >>>>>>>>>>>>>> You evidently have repeatable test cases; you can execute >>>>>>>>>>>>>> your rig >>>>>>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>>>>>> >>>>>>>>>>>>>> The issue is that is simply that the procedure which >>>>>>>>>>>>>> corresponds to X >>>>>>>>>>>>>> is not a function. The application of the imperative >>>>>>>>>>>>>> procedure X to its >>>>>>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> When a UTM M that simulates a TM X that simulates another >>>>>>>>>>>>> TM Y that >>>>>>>>>>>>> simulates yet another TM Z and the UTM M eventually >>>>>>>>>>>>> transations to a >>>>>>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>>>>>> >>>>>>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing >>>>>>>>>>>> the point. >>>>>>>>>>>> The point is that the invocation of X is not the same TM >>>>>>>>>>>> every time, >>>>>>>>>>> >>>>>>>>>>> The point is that the subsequent "invocations" are not >>>>>>>>>>> invocations at >>>>>>>>>>> all, they are data being processed by the only actual >>>>>>>>>>> invocation that >>>>>>>>>>> exists. >>>>>>>>>> >>>>>>>>>> Right, see? So we are nothing but agreeing. And so, here we >>>>>>>>>> go. In the >>>>>>>>>> "conventional proofs" of halting the corresponding entity is a >>>>>>>>>> function >>>>>>>>>> of two arguments (and only those arguments), which is subject >>>>>>>>>> to actual >>>>>>>>>> invocations. That's a key part of these proofs. >>>>>>>>>> >>>>>>>>> >>>>>>>>> These proofs do not forbid simulating the input, and in fact do >>>>>>>>> require >>>>>>>>> that the inputs are not actual Turing machines they must be finite >>>>>>>>> strings that describe Turing machines. >>>>>>>> >>>>>>>> Your belief here is uninformed and false. >>>>>>> >>>>>>> I stop reading at your first big mistake. >>>>>> >>>>>> Strings that describe Turing machines *are* actual Turing >>>>>> machines, and >>>>>> must be correctly treated as such. >>>>>> >>>>>> Since you willfully ignore portions of responses, your claims >>>>>> that nobody has found a flaw in your work are unfounded. >>>>>> >>>>> >>>>> Since they cannot be directly executed they are not actual machines, >>>> >>>> "Turing machine" refers to the mathematical object and its description, >>>> not to a simulation. >>>> >>>> You are harboring a false belief here. False beliefs read to work >>>> flaws. >>>> >>>>> they represent actual machines that can only be simulated in a >>>>> simulator. >>>> >>>> In the "conventional halting proof" each call to Halts(P, I) is a >>>> Turing machine instance. Executing it requires a fresh instance of >>>> a simulator whose behavior is free from any external influence, like >>>> from other simulations that have previously occurred. >>>> >>>> A given definition of Halts, a given P and a given I, completely >>>> determines the initial tape contents. No content must come from >>>> anywhere >>>> else. >>>> >>>> You have not assured this in your apparatus. Halts is not the >>>> invocation of an ordinary function whose behavior depends on its >>>> arguments. >>>>> >>>>> Try and run a C program without a compiler or an interpreter. >>>>> The C program represents a computation it is not the actual >>>>> computation >>>>> itself. >>>> >>> >>> In other words you are saying that a Turing machine and a Turing machine >>> description are exactly the same thing thus no need for the term "Turing >>> machine description" because it is exactly the same thing as a "Turing >>> machine" thus all the technical papers and textbooks foolishly use the >>> totally redundant term "Turing machine description". >> >> I'm saying descriptions/representations is all we ever have to work >> with. >> >> For the purpose of working with any concept like "TM", "number", "set", >> we manipulate representations and descriptions. >> >> Philosphically, the representation and description is not the same as >> the abstraction itself. That nitpicking is important when we focus on >> what it means to represent and describe; someone has to examine the >> correspondence between an abstraction and its representation in syntax. >> We can take representations themselves to be abstractions and subject >> them to scrutiny. When we do that the 2 + 2 representation of four >> becomes something different from 4, because it contains three symbols >> rather than one. That is, if we are working with syntax itself, 2 + 2 >> and 4 are different syntax. >> >> Practically, when we are working in the abstractions themselves, we >> take their symbolic representations in their place as those object. >> We just have to be careful that the symbolic manipulation rules do not >> lead us into some derivation that doesn't map back to the objects. >> > > None-the-less halt deciders always operate on text descriptions of > Turing machines, they never operating on Turing machines themselves > directly. Also these Turing machine descriptions are never directly > executable they must always be simulated by a UTM. > > Because of this when UTM Halts simulates H_Hat which simulates Halts > which simulates H_Hat which simulates Halts all of this whole thing is > data being processed by the first instance of Halts, thus the final > state that this first instance transitions to is a pure function of its > input. > > That you did not seem to totally grasp the distinction between a TM and > a simulated TM description any negative assessment from you of my > analysis of the relation of Halts to H_Hat cannot be relied upon as > accurate. You area about what a computable function is and what it is > not does not seem to be correct. I cited three textbook definitions of > this. > And what you seem to fail to grasp is that Halting is really a property of the actual Machine, not of the description. Description don't 'run' or 'halt'. They are inputs to other machines. If you have a REAL UTM, then by definition, its actions on the description of a Turing Machine will match the behavior of the actual machine, but once the simulating machine is no longer a UTM, that equivalence does not hold. The key point to note, is that when we run the ACTUAL Turing Machine that the description of H_Hat represents, we see that it will halt, as long as Halts(H_Hat, H_Hat) returns the non-halting answer, so Halts will be, by definition wrong. Your only argument seems to be to try to redefine what is the actual definition of Halting, confusing the definition of Halting with the algorithm used by Halts to make its decision. As it turns out, based on the numerous proofs you are trying to over-turn, the existence of an algorithm to always correctly predict halting doesn't exist, any argument that the halting decision is correct based on the assumption that it does exist is flawed. The Halting problem is like the challenge to create a strategy to always win at Tic-Tac-Toe, there IS NO algorithm to do it. Which is an acceptable answer, There is nothing in mathematics that requires that we are always able to determine if a given Turing Machine (or algorithm) is finite in execution for a given input. A side effect of this is that this means that while we know that all Turing Machine/Input combinations will either Halt or be non-Halting, there are some combinations that we can never know for sure which they are. This is a fundamental limit to knowledge. If your mind can't handle the fact that some True Facts are Unprovable, you need to stay out of Theories and their Systems that are complicated enough to fall under this property. It IS a fact of life. This is why many Philosophers stay away from Mathematics, as it easily gets this complicated, and nice simple rule system sthat insist that all Truth is Provable fall apart in them.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-04 10:24 -0500 |
| Subject | Re: Solution To The Halting Problem [ Chomsky hierarchy ] |
| Message-ID | <uLOdnTWt6oK3-gz9nZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #32664 |
On 5/4/2021 9:37 AM, Richard Damon wrote: > On 5/4/21 10:20 AM, olcott wrote: >> On 5/3/2021 12:21 PM, Kaz Kylheku wrote: >>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>> On 5/3/2021 9:57 AM, Kaz Kylheku wrote: >>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 5/3/2021 9:42 AM, Kaz Kylheku wrote: >>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> On 5/3/2021 9:27 AM, Kaz Kylheku wrote: >>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> On 5/2/2021 11:12 PM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> On 5/2/2021 9:45 PM, Kaz Kylheku wrote: >>>>>>>>>>>>> On 2021-05-03, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>> On 5/2/2021 9:12 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>> On 5/2/2021 2:57 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>> On 5/2/2021 12:50 PM, olcott wrote: >>>>>>>>>>>>>>>>>>> On 5/2/2021 12:39 PM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>>>>>>>>>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2021-05-02, Mr Flibble >>>>>>>>>>>>>>>>>>>>>>>>> <flibble@i42.REMOVETHISBIT.co.uk> wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> Does anyone know the solution to the problem of >>>>>>>>>>>>>>>>>>>>>>>>>> halting olcott's >>>>>>>>>>>>>>>>>>>>>>>>>> Usenet posts? >>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>> Everyone halts. For this case, specifically, >>>>>>>>>>>>>>>>>>>>>>>>> there is an unproven >>>>>>>>>>>>>>>>>>>>>>>>> and empirically untested hypothesis about an >>>>>>>>>>>>>>>>>>>>>>>>> early halt that occurs >>>>>>>>>>>>>>>>>>>>>>>>> if everyone stops responding. >>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>> We can ask him to stop. We can't prove that he >>>>>>>>>>>>>>>>>>>>>>>> will. >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> The bigger question is when are my reviewers going >>>>>>>>>>>>>>>>>>>>>>> to provide an >>>>>>>>>>>>>>>>>>>>>>> accurate review? >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> It is a fact that this infinite recursion >>>>>>>>>>>>>>>>>>>>>>> detection criteria is >>>>>>>>>>>>>>>>>>>>>>> correct: >>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>> If the execution trace of function Y() shows: >>>>>>>>>>>>>>>>>>>>>>> function X() is called twice in sequence from the >>>>>>>>>>>>>>>>>>>>>>> same machine address >>>>>>>>>>>>>>>>>>>>>>> of Y() >>>>>>>>>>>>>>>>>>>>>>> with the same parameters to X() >>>>>>>>>>>>>>>>>>>>>>> with no conditional branch or indexed jump >>>>>>>>>>>>>>>>>>>>>>> instructions in Y() >>>>>>>>>>>>>>>>>>>>>>> with no function call returns from X() >>>>>>>>>>>>>>>>>>>>>>> then the function call from Y() to X() is >>>>>>>>>>>>>>>>>>>>>>> infinitely recursive. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> This is only "right" from the perspective of an >>>>>>>>>>>>>>>>>>>>>> objective observation >>>>>>>>>>>>>>>>>>>>>> that is not involved in the computation, and has no >>>>>>>>>>>>>>>>>>>>>> effect on it. >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> The function X() cannot itself make this >>>>>>>>>>>>>>>>>>>>>> observation. X has access to >>>>>>>>>>>>>>>>>>>>>> only its parameters, and its parameters do not >>>>>>>>>>>>>>>>>>>>>> carry any information >>>>>>>>>>>>>>>>>>>>>> indicating to X that it has been called twice from >>>>>>>>>>>>>>>>>>>>>> the same address >>>>>>>>>>>>>>>>>>>>>> or any such thing. How can they; the parameters are >>>>>>>>>>>>>>>>>>>>>> *always the same*. >>>>>>>>>>>>>>>>>>>>>> Therefore they cannot distinguish the first call >>>>>>>>>>>>>>>>>>>>>> from the second call >>>>>>>>>>>>>>>>>>>>>> from the third call ... >>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>> A function having adcess to past execution traces >>>>>>>>>>>>>>>>>>>>>> is an imperative >>>>>>>>>>>>>>>>>>>>>> procedure, which is completely invalid. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> This is ridiculous, it is just like saying that I >>>>>>>>>>>>>>>>>>>>> must be wrong on the >>>>>>>>>>>>>>>>>>>>> basis that you really believe that I am wrong. >>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>> You have to concretely prove these dogmatic >>>>>>>>>>>>>>>>>>>>> statements. When you attempt >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> 1. You're trying to refute a proof which has a >>>>>>>>>>>>>>>>>>>> similar structure to the >>>>>>>>>>>>>>>>>>>> X and Y arrangement above. >>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>> 2. In that proof, the entities corresponding to X and >>>>>>>>>>>>>>>>>>>> Y are functions, >>>>>>>>>>>>>>>>>>>> and not imperative procedures. They have >>>>>>>>>>>>>>>>>>>> no access to some global, >>>>>>>>>>>>>>>>>>>> mutating state holding execution traces; >>>>>>>>>>>>>>>>>>>> such a situation would >>>>>>>>>>>>>>>>>>>> violate the conditions of the proof. >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> So you are saying that an adapted UTM that recognizes >>>>>>>>>>>>>>>>>> the infinite >>>>>>>>>>>>>>>>>> recursion pattern of its input, stops simulating its >>>>>>>>>>>>>>>>>> input on this >>>>>>>>>>>>>>>>>> basis, and decides not halting on this input, >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> IS SIMPLY NOT ALLOWED ? >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> To clarify, that is false. Rather: >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> 1) There is a proof that this recognizing machine cannot >>>>>>>>>>>>>>>>> be the function >>>>>>>>>>>>>>>>> identified as X above. This is the proof >>>>>>>>>>>>>>>>> you're trying to dislodge. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> You stubbornly refuse to acknowledge that a UTM that >>>>>>>>>>>>>>>> simulates a machine >>>>>>>>>>>>>>>> that simulates another machine that simulates yet another >>>>>>>>>>>>>>>> machine is all >>>>>>>>>>>>>>>> simply data processed by the UTM, thus (as long as it >>>>>>>>>>>>>>>> halts) a single >>>>>>>>>>>>>>>> computation. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> The issue is not that you do not have a computation. You >>>>>>>>>>>>>>> probably do. >>>>>>>>>>>>>>> You evidently have repeatable test cases; you can execute >>>>>>>>>>>>>>> your rig >>>>>>>>>>>>>>> repeatedly and obtain the same traces. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> The issue is that is simply that the procedure which >>>>>>>>>>>>>>> corresponds to X >>>>>>>>>>>>>>> is not a function. The application of the imperative >>>>>>>>>>>>>>> procedure X to its >>>>>>>>>>>>>>> arguments is not a TM, as required. >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>> When a UTM M that simulates a TM X that simulates another >>>>>>>>>>>>>> TM Y that >>>>>>>>>>>>>> simulates yet another TM Z and the UTM M eventually >>>>>>>>>>>>>> transations to a >>>>>>>>>>>>>> final state it is doing so as a pure function of its input X. >>>>>>>>>>>>> >>>>>>>>>>>>> Yes, thanks for the lecture, Dr. Von Neumann. You're missing >>>>>>>>>>>>> the point. >>>>>>>>>>>>> The point is that the invocation of X is not the same TM >>>>>>>>>>>>> every time, >>>>>>>>>>>> >>>>>>>>>>>> The point is that the subsequent "invocations" are not >>>>>>>>>>>> invocations at >>>>>>>>>>>> all, they are data being processed by the only actual >>>>>>>>>>>> invocation that >>>>>>>>>>>> exists. >>>>>>>>>>> >>>>>>>>>>> Right, see? So we are nothing but agreeing. And so, here we >>>>>>>>>>> go. In the >>>>>>>>>>> "conventional proofs" of halting the corresponding entity is a >>>>>>>>>>> function >>>>>>>>>>> of two arguments (and only those arguments), which is subject >>>>>>>>>>> to actual >>>>>>>>>>> invocations. That's a key part of these proofs. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> These proofs do not forbid simulating the input, and in fact do >>>>>>>>>> require >>>>>>>>>> that the inputs are not actual Turing machines they must be finite >>>>>>>>>> strings that describe Turing machines. >>>>>>>>> >>>>>>>>> Your belief here is uninformed and false. >>>>>>>> >>>>>>>> I stop reading at your first big mistake. >>>>>>> >>>>>>> Strings that describe Turing machines *are* actual Turing >>>>>>> machines, and >>>>>>> must be correctly treated as such. >>>>>>> >>>>>>> Since you willfully ignore portions of responses, your claims >>>>>>> that nobody has found a flaw in your work are unfounded. >>>>>>> >>>>>> >>>>>> Since they cannot be directly executed they are not actual machines, >>>>> >>>>> "Turing machine" refers to the mathematical object and its description, >>>>> not to a simulation. >>>>> >>>>> You are harboring a false belief here. False beliefs read to work >>>>> flaws. >>>>> >>>>>> they represent actual machines that can only be simulated in a >>>>>> simulator. >>>>> >>>>> In the "conventional halting proof" each call to Halts(P, I) is a >>>>> Turing machine instance. Executing it requires a fresh instance of >>>>> a simulator whose behavior is free from any external influence, like >>>>> from other simulations that have previously occurred. >>>>> >>>>> A given definition of Halts, a given P and a given I, completely >>>>> determines the initial tape contents. No content must come from >>>>> anywhere >>>>> else. >>>>> >>>>> You have not assured this in your apparatus. Halts is not the >>>>> invocation of an ordinary function whose behavior depends on its >>>>> arguments. >>>>>> >>>>>> Try and run a C program without a compiler or an interpreter. >>>>>> The C program represents a computation it is not the actual >>>>>> computation >>>>>> itself. >>>>> >>>> >>>> In other words you are saying that a Turing machine and a Turing machine >>>> description are exactly the same thing thus no need for the term "Turing >>>> machine description" because it is exactly the same thing as a "Turing >>>> machine" thus all the technical papers and textbooks foolishly use the >>>> totally redundant term "Turing machine description". >>> >>> I'm saying descriptions/representations is all we ever have to work >>> with. >>> >>> For the purpose of working with any concept like "TM", "number", "set", >>> we manipulate representations and descriptions. >>> >>> Philosphically, the representation and description is not the same as >>> the abstraction itself. That nitpicking is important when we focus on >>> what it means to represent and describe; someone has to examine the >>> correspondence between an abstraction and its representation in syntax. >>> We can take representations themselves to be abstractions and subject >>> them to scrutiny. When we do that the 2 + 2 representation of four >>> becomes something different from 4, because it contains three symbols >>> rather than one. That is, if we are working with syntax itself, 2 + 2 >>> and 4 are different syntax. >>> >>> Practically, when we are working in the abstractions themselves, we >>> take their symbolic representations in their place as those object. >>> We just have to be careful that the symbolic manipulation rules do not >>> lead us into some derivation that doesn't map back to the objects. >>> >> >> None-the-less halt deciders always operate on text descriptions of >> Turing machines, they never operating on Turing machines themselves >> directly. Also these Turing machine descriptions are never directly >> executable they must always be simulated by a UTM. >> >> Because of this when UTM Halts simulates H_Hat which simulates Halts >> which simulates H_Hat which simulates Halts all of this whole thing is >> data being processed by the first instance of Halts, thus the final >> state that this first instance transitions to is a pure function of its >> input. >> >> That you did not seem to totally grasp the distinction between a TM and >> a simulated TM description any negative assessment from you of my >> analysis of the relation of Halts to H_Hat cannot be relied upon as >> accurate. You area about what a computable function is and what it is >> not does not seem to be correct. I cited three textbook definitions of >> this. >> > > And what you seem to fail to grasp is that Halting is really a property > of the actual Machine, not of the description. Description don't 'run' > or 'halt'. They are inputs to other machines. It seems to me that the conventional way that this works is according to the Chomsky hierarchy. It is a matter of whether or not there exists some Turing machine H that accepts the set of finite strings representing Turing machines that halt on their input and then H halts. I am actually working the converse of this I am defining a partial halt decider H that accepts the set of Turing machines descriptions that do not halt on their input and then H halts. This partial halt decider ignores complex non-halting behavior and all halting behavior. -- 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-04 11:55 -0400 |
| Subject | Re: Solution To The Halting Problem [ Chomsky hierarchy ] |
| Message-ID | <O7ekI.260129$2A5.147697@fx45.iad> |
| In reply to | #32674 |
On 5/4/21 11:24 AM, olcott wrote: > On 5/4/2021 9:37 AM, Richard Damon wrote: >> And what you seem to fail to grasp is that Halting is really a property >> of the actual Machine, not of the description. Description don't 'run' >> or 'halt'. They are inputs to other machines. > > It seems to me that the conventional way that this works is according to > the Chomsky hierarchy. It is a matter of whether or not there exists > some Turing machine H that accepts the set of finite strings > representing Turing machines that halt on their input and then H halts. > > I am actually working the converse of this I am defining a partial halt > decider H that accepts the set of Turing machines descriptions that do > not halt on their input and then H halts. > > This partial halt decider ignores complex non-halting behavior and all > halting behavior. > > And it still will be a fact that you need to TEST your assertion be checking the actual behavior of the Turing Machine in question. Yes, some non-Halting Machines may be hard to prove that you got it right, because we really can't make a proof by observing their actual behavior that they will be non-halting. But any machine that we can run, and see that it Halts, is proved to be Halting, no matter what you 'decider' came up with. Most machines that Halt are easy to prove, by just running it till it halts. Your problem is that you have a bad rule for a simple non-halting behavior that calls a halting behavior as non-halting. You really need to accept that and fix it. I hope you DO realize you are tilting at windmills, as universal halt deciding HAS been proved to be impossible. You need to find a flaw in the arguments, not just show a counter, or all you have done is shown that you have made the logic system inconsistant with your work.
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-05-04 15:37 +0100 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <s6rm7h$1ea6$1@gioia.aioe.org> |
| In reply to | #32662 |
On 04/05/2021 15:20, olcott wrote:
> None-the-less halt deciders always operate on text descriptions of
> Turing machines, they never operating on Turing machines themselves
> directly. Also these Turing machine descriptions are never directly
> executable they must always be simulated by a UTM.
You mean that you're incapable of looking at the description
of a TM and saying "Aha! This one loops, but that one doesn't!"?
Are you equally incapable of looking at C code and spotting that
program P will run through to completion while Q has a loop that
doesn't terminate? Of course, /some/ TMs and /some/ C programs
are too complicated to analyse directly from source [inc the
input which will be supplied], but every experienced teacher of
programming will be familiar with students who expect you to be
able to spot bugs in their programs from the listing.
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Coleridge-Taylor
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-04 16:42 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210504093215.958@kylheku.com> |
| In reply to | #32662 |
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 12:21 PM, Kaz Kylheku wrote: >> Practically, when we are working in the abstractions themselves, we >> take their symbolic representations in their place as those object. >> We just have to be careful that the symbolic manipulation rules do not >> lead us into some derivation that doesn't map back to the objects. >> > > None-the-less halt deciders always operate on text descriptions of > Turing machines, they never operating on Turing machines themselves > directly. Also these Turing machine descriptions are never directly > executable they must always be simulated by a UTM. This is all false. Turing Machines do not require UTMs. UTMs are special objects that can be programmed to provide, with extra symbols on a tape, the rules which interpret the rest of the tape. This is not required for a given TM; the symbols can just be interpreted according to the usual description of the rules, rather than a programmed one. > Because of this when UTM Halts simulates H_Hat which simulates Halts > which simulates H_Hat which simulates Halts all of this whole thing is > data being processed by the first instance of Halts, thus the final > state that this first instance transitions to is a pure function of its > input. > > That you did not seem to totally grasp the distinction between a TM and > a simulated TM description any negative assessment from you of my There isn't any. > analysis of the relation of Halts to H_Hat cannot be relied upon as > accurate. My assessment that your work does not meet the conditions of the proof it is intended to refute is unassailably correct. -- 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-04 12:13 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <MN6dnV0kYsk1HQz9nZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #32687 |
On 5/4/2021 11:42 AM, Kaz Kylheku wrote: > On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 12:21 PM, Kaz Kylheku wrote: >>> Practically, when we are working in the abstractions themselves, we >>> take their symbolic representations in their place as those object. >>> We just have to be careful that the symbolic manipulation rules do not >>> lead us into some derivation that doesn't map back to the objects. >>> >> >> None-the-less halt deciders always operate on text descriptions of >> Turing machines, they never operating on Turing machines themselves >> directly. Also these Turing machine descriptions are never directly >> executable they must always be simulated by a UTM. > > This is all false. Turing Machines do not require UTMs. That is <not> what I said, when you mangle what I said and respond to this mangling that is the Strawman fallacy. > UTMs are > special objects that can be programmed to provide, with extra > symbols on a tape, the rules which interpret the rest of the tape. > > This is not required for a given TM; the symbols can just be interpreted > according to the usual description of the rules, rather than a > programmed one. > >> Because of this when UTM Halts simulates H_Hat which simulates Halts >> which simulates H_Hat which simulates Halts all of this whole thing is >> data being processed by the first instance of Halts, thus the final >> state that this first instance transitions to is a pure function of its >> input. >> >> That you did not seem to totally grasp the distinction between a TM and >> a simulated TM description any negative assessment from you of my > > There isn't any. > There is a huge distinction. Although the execution of a TM and the simulation of its TM description by a UTM are computationally equivalent they are not identical. What are are saying is that source code and machine executable object code are exactly the same thing and you know that this is not true so I have no idea why you insist on saying it. >> analysis of the relation of Halts to H_Hat cannot be relied upon as >> accurate. > > My assessment that your work does not meet the conditions of the proof > it is intended to refute is unassailably correct. > You are pretending to not even know the difference between source-code and executable machine code. This utterly ruins your credibility. -- 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-04 19:05 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210504115608.628@kylheku.com> |
| In reply to | #32693 |
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/4/2021 11:42 AM, Kaz Kylheku wrote: >> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 12:21 PM, Kaz Kylheku wrote: >>>> Practically, when we are working in the abstractions themselves, we >>>> take their symbolic representations in their place as those object. >>>> We just have to be careful that the symbolic manipulation rules do not >>>> lead us into some derivation that doesn't map back to the objects. >>>> >>> >>> None-the-less halt deciders always operate on text descriptions of >>> Turing machines, they never operating on Turing machines themselves >>> directly. Also these Turing machine descriptions are never directly >>> executable they must always be simulated by a UTM. >> >> This is all false. Turing Machines do not require UTMs. > > That is <not> what I said, when you mangle what I said and respond to > this mangling that is the Strawman fallacy. There is no requirement that Turing machines must be simulated by a UTM. > > >> UTMs are >> special objects that can be programmed to provide, with extra >> symbols on a tape, the rules which interpret the rest of the tape. >> >> This is not required for a given TM; the symbols can just be interpreted >> according to the usual description of the rules, rather than a >> programmed one. >> >>> Because of this when UTM Halts simulates H_Hat which simulates Halts >>> which simulates H_Hat which simulates Halts all of this whole thing is >>> data being processed by the first instance of Halts, thus the final >>> state that this first instance transitions to is a pure function of its >>> input. >>> >>> That you did not seem to totally grasp the distinction between a TM and >>> a simulated TM description any negative assessment from you of my >> >> There isn't any. >> > > There is a huge distinction. Although the execution of a TM and the > simulation of its TM description by a UTM are computationally equivalent > they are not identical. "Computationally equivalent" is all that is relevant here. Anything else is a debate over syntax, rather than semantics. > What are are saying is that source code and machine executable object > code are exactly the same thing and you know that this is not true so I > have no idea why you insist on saying it. Source code and machine code are the same thing if we are concerned with the meaning of the computation, rather than how it is spelled in a particular representation. You will not defeat the halting proof using some matter of difference between source code and machine code. > >>> analysis of the relation of Halts to H_Hat cannot be relied upon as >>> accurate. >> >> My assessment that your work does not meet the conditions of the proof >> it is intended to refute is unassailably correct. >> > > You are pretending to not even know the difference between source-code > and executable machine code. This utterly ruins your credibility. I'm saying that your work is barking up the wrong tree if it depends on such differences. It's like saying that some established result in number theory is wrong, because if you switch to Roman numerals and pull some idiotic trick which only works in that representation and is mathematically invalid, you end up with a contradiction. And, oh, what do you mean IV and 4 are the same thing; you are just ruining your credibility! -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-03 16:46 +0100 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <874kfj7rcu.fsf@bsb.me.uk> |
| In reply to | #32617 |
Kaz Kylheku <563-365-8930@kylheku.com> writes: > Entities which are supposed to be functions in the proof are edoing > dynamic analysis, using state which is external to them and not > appearing as input. Some care is needed here because the issue is not external state per se but whether the code is a function in the mathematical sense. A subroutine can use external state provided its result is entirely determined by its arguments. It can do logging, tracing and modify and read all sorts of non-local data provided identical calls produce identical results. My view is that's it easier to keep someone on the straight an narrow with that sort of high-level requirement rather than getting into what is or is not a permitted side effect and what data can and can't be used. Of course, PO, being who he is, has chosen x86 and C where even the notion of what constitutes the data passed to a function is vague. However, in his C sketches he is using function pointers, so provided he sticks with standard C, he can't get into too much trouble. In x86 code, though, he could even try to overwrite the code at some address. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 11:01 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <o_KdnQf_ddyogw39nZ2dnUU78IvNnZ2d@giganews.com> |
| In reply to | #32636 |
On 5/3/2021 10:46 AM, Ben Bacarisse wrote: > Kaz Kylheku <563-365-8930@kylheku.com> writes: > >> Entities which are supposed to be functions in the proof are edoing >> dynamic analysis, using state which is external to them and not >> appearing as input. > > Some care is needed here because the issue is not external state per se > but whether the code is a function in the mathematical sense. A > subroutine can use external state provided its result is entirely > determined by its arguments. It can do logging, tracing and modify and > read all sorts of non-local data provided identical calls produce > identical results. My view is that's it easier to keep someone on the > straight an narrow with that sort of high-level requirement rather than > getting into what is or is not a permitted side effect and what data can > and can't be used. > > Of course, PO, being who he is, has chosen x86 and C where even the > notion of what constitutes the data passed to a function is vague. Yes of course when the x86 machine address of the x86 machine code of H_Hat is passed to Halts() for all we know it might actually be a pink elephant. Although we can directly see that the actual machine address of H_Hat() is pushed onto the stack prior to the call to Halts() for all we know Halts() might actually receive a pink elephant because the code for Halts() is not shown. > However, in his C sketches he is using function pointers, so provided he > sticks with standard C, he can't get into too much trouble. In x86 > code, though, he could even try to overwrite the code at some address. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-03 12:15 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <ekVjI.203804$J_5.160853@fx46.iad> |
| In reply to | #32640 |
On 5/3/21 12:01 PM, olcott wrote: > On 5/3/2021 10:46 AM, Ben Bacarisse wrote: >> Kaz Kylheku <563-365-8930@kylheku.com> writes: >> >>> Entities which are supposed to be functions in the proof are edoing >>> dynamic analysis, using state which is external to them and not >>> appearing as input. >> >> Some care is needed here because the issue is not external state per se >> but whether the code is a function in the mathematical sense. A >> subroutine can use external state provided its result is entirely >> determined by its arguments. It can do logging, tracing and modify and >> read all sorts of non-local data provided identical calls produce >> identical results. My view is that's it easier to keep someone on the >> straight an narrow with that sort of high-level requirement rather than >> getting into what is or is not a permitted side effect and what data can >> and can't be used. >> >> Of course, PO, being who he is, has chosen x86 and C where even the >> notion of what constitutes the data passed to a function is vague. > > Yes of course when the x86 machine address of the x86 machine code of > H_Hat is passed to Halts() for all we know it might actually be a pink > elephant. Although we can directly see that the actual machine address > of H_Hat() is pushed onto the stack prior to the call to Halts() for all > we know Halts() might actually receive a pink elephant because the code > for Halts() is not shown. > We know it is code, but does that code meet the requirements that it claims to meet, namely being a true Computation. We only have your claims for that, and then you sometimes make claims that could not be meet if it WAS a Computation, so obviously something is wrong with some of the claims.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-03 11:22 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <AoCdnabLvdG5vg39nZ2dnUU7-LXNnZ2d@giganews.com> |
| In reply to | #32641 |
On 5/3/2021 11:15 AM, Richard Damon wrote: > On 5/3/21 12:01 PM, olcott wrote: >> On 5/3/2021 10:46 AM, Ben Bacarisse wrote: >>> Kaz Kylheku <563-365-8930@kylheku.com> writes: >>> >>>> Entities which are supposed to be functions in the proof are edoing >>>> dynamic analysis, using state which is external to them and not >>>> appearing as input. >>> >>> Some care is needed here because the issue is not external state per se >>> but whether the code is a function in the mathematical sense. A >>> subroutine can use external state provided its result is entirely >>> determined by its arguments. It can do logging, tracing and modify and >>> read all sorts of non-local data provided identical calls produce >>> identical results. My view is that's it easier to keep someone on the >>> straight an narrow with that sort of high-level requirement rather than >>> getting into what is or is not a permitted side effect and what data can >>> and can't be used. >>> >>> Of course, PO, being who he is, has chosen x86 and C where even the >>> notion of what constitutes the data passed to a function is vague. >> >> Yes of course when the x86 machine address of the x86 machine code of >> H_Hat is passed to Halts() for all we know it might actually be a pink >> elephant. Although we can directly see that the actual machine address >> of H_Hat() is pushed onto the stack prior to the call to Halts() for all >> we know Halts() might actually receive a pink elephant because the code >> for Halts() is not shown. >> > > We know it is code, but does that code meet the requirements that it > claims to meet, namely being a true Computation. > > We only have your claims for that, and then you sometimes make claims > that could not be meet if it WAS a Computation, so obviously something > is wrong with some of the claims. > A halt decider derived from adapting a UTM that simulates its input as its basis for making a non-halting decision <is> a pure function of this 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-03 12:38 -0400 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <bGVjI.420289$nn2.223167@fx48.iad> |
| In reply to | #32643 |
On 5/3/21 12:22 PM, olcott wrote: > On 5/3/2021 11:15 AM, Richard Damon wrote: >> On 5/3/21 12:01 PM, olcott wrote: >>> On 5/3/2021 10:46 AM, Ben Bacarisse wrote: >>>> Kaz Kylheku <563-365-8930@kylheku.com> writes: >>>> >>>>> Entities which are supposed to be functions in the proof are edoing >>>>> dynamic analysis, using state which is external to them and not >>>>> appearing as input. >>>> >>>> Some care is needed here because the issue is not external state per se >>>> but whether the code is a function in the mathematical sense. A >>>> subroutine can use external state provided its result is entirely >>>> determined by its arguments. It can do logging, tracing and modify and >>>> read all sorts of non-local data provided identical calls produce >>>> identical results. My view is that's it easier to keep someone on the >>>> straight an narrow with that sort of high-level requirement rather than >>>> getting into what is or is not a permitted side effect and what data >>>> can >>>> and can't be used. >>>> >>>> Of course, PO, being who he is, has chosen x86 and C where even the >>>> notion of what constitutes the data passed to a function is vague. >>> >>> Yes of course when the x86 machine address of the x86 machine code of >>> H_Hat is passed to Halts() for all we know it might actually be a pink >>> elephant. Although we can directly see that the actual machine address >>> of H_Hat() is pushed onto the stack prior to the call to Halts() for all >>> we know Halts() might actually receive a pink elephant because the code >>> for Halts() is not shown. >>> >> >> We know it is code, but does that code meet the requirements that it >> claims to meet, namely being a true Computation. >> >> We only have your claims for that, and then you sometimes make claims >> that could not be meet if it WAS a Computation, so obviously something >> is wrong with some of the claims. >> > > A halt decider derived from adapting a UTM that simulates its input as > its basis for making a non-halting decision <is> a pure function of this > input. > But you define your 'Halt Decider' got its input from a COFF file, Halts does NOT get a COFF file as its formal parameters, so if it depends on it, it is NOT a Computation. Your logic is off.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-04 00:27 +0100 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <87a6pb5rfd.fsf@bsb.me.uk> |
| In reply to | #32640 |
olcott <NoOne@NoWhere.com> writes: > On 5/3/2021 10:46 AM, Ben Bacarisse wrote: >> Kaz Kylheku <563-365-8930@kylheku.com> writes: >> >>> Entities which are supposed to be functions in the proof are edoing >>> dynamic analysis, using state which is external to them and not >>> appearing as input. >> >> Some care is needed here because the issue is not external state per se >> but whether the code is a function in the mathematical sense. A >> subroutine can use external state provided its result is entirely >> determined by its arguments. It can do logging, tracing and modify and >> read all sorts of non-local data provided identical calls produce >> identical results. My view is that's it easier to keep someone on the >> straight an narrow with that sort of high-level requirement rather than >> getting into what is or is not a permitted side effect and what data can >> and can't be used. >> >> Of course, PO, being who he is, has chosen x86 and C where even the >> notion of what constitutes the data passed to a function is vague. > > Yes of course when the x86 machine address of the x86 machine code of > H_Hat is passed to Halts() for all we know it might actually be a pink > elephant. Although we can directly see that the actual machine address > of H_Hat() is pushed onto the stack prior to the call to Halts() for > all we know Halts() might actually receive a pink elephant because the > code for Halts() is not shown. Did you have a question about what I wrote? You seem to be having trouble understanding it. >> However, in his C sketches he is using function pointers, so provided he >> sticks with standard C, he can't get into too much trouble. In x86 >> code, though, he could even try to overwrite the code at some address. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-04 09:59 -0500 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <Ec6dnW0C1Jba_Az9nZ2dnUU7-X2dnZ2d@giganews.com> |
| In reply to | #32658 |
On 5/3/2021 6:27 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/3/2021 10:46 AM, Ben Bacarisse wrote: >>> Kaz Kylheku <563-365-8930@kylheku.com> writes: >>> >>>> Entities which are supposed to be functions in the proof are edoing >>>> dynamic analysis, using state which is external to them and not >>>> appearing as input. >>> >>> Some care is needed here because the issue is not external state per se >>> but whether the code is a function in the mathematical sense. A >>> subroutine can use external state provided its result is entirely >>> determined by its arguments. It can do logging, tracing and modify and >>> read all sorts of non-local data provided identical calls produce >>> identical results. My view is that's it easier to keep someone on the >>> straight an narrow with that sort of high-level requirement rather than >>> getting into what is or is not a permitted side effect and what data can >>> and can't be used. >>> >>> Of course, PO, being who he is, has chosen x86 and C where even the >>> notion of what constitutes the data passed to a function is vague. >> >> Yes of course when the x86 machine address of the x86 machine code of >> H_Hat is passed to Halts() for all we know it might actually be a pink >> elephant. Although we can directly see that the actual machine address >> of H_Hat() is pushed onto the stack prior to the call to Halts() for >> all we know Halts() might actually receive a pink elephant because the >> code for Halts() is not shown. > > Did you have a question about what I wrote? You seem to be having > trouble understanding it. > The notion of data passed to a function in the x86 architecture has zero vagueness. It is always a case of a sequence of "push" operations preceding the "call" operation. >>> However, in his C sketches he is using function pointers, so provided he >>> sticks with standard C, he can't get into too much trouble. In x86 >>> code, though, he could even try to overwrite the code at some address. > -- 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-04 17:06 +0000 |
| Subject | Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] |
| Message-ID | <20210504100209.499@kylheku.com> |
| In reply to | #32668 |
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/3/2021 6:27 PM, Ben Bacarisse wrote: >> Did you have a question about what I wrote? You seem to be having >> trouble understanding it. >> > > The notion of data passed to a function in the x86 architecture has zero There is no "function" in x86. Some assemblers for x86 in fact have pseudo-ops for delimiting a procedure using syntax like "PROC FAR" and "ENDP". > vagueness. It is always a case of a sequence of "push" operations > preceding the "call" operation. That is false. x86 subroutines can access global variables. Moreover, the push instructions can pass pointers. The same pointer value 0xBF30D9A0 can point to completely different objects at different times; therefore that value *per se* does not completely specify the input. > -- 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-04 13:45 -0500 |
| Subject | Re: Solution To The Halting Problem [ C/x86 defines computable functions ] |
| Message-ID | <psudna66etagCwz9nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #32692 |
On 5/4/2021 12:06 PM, Kaz Kylheku wrote: > On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >> On 5/3/2021 6:27 PM, Ben Bacarisse wrote: >>> Did you have a question about what I wrote? You seem to be having >>> trouble understanding it. >>> >> >> The notion of data passed to a function in the x86 architecture has zero > > There is no "function" in x86. Some assemblers for x86 in fact have > pseudo-ops for delimiting a procedure using syntax like "PROC FAR" and > "ENDP". > Computable Functions A Turing machine computes a function by starting with the input to the function on the tape and halting with the output of the function on the tape. (Sipser:1997:190) Definition 5.12 A function f: Σ* → Σ* is a computable function if some Turing machine M, on every input w, halts with just f(w) on its tape. (Sipser:1997:190) A partial function σ: Σ* → Σ* is said to be a computable function if σ(x) = M(x) for some Turing machine M. (Kozen:1997:347) Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: PWS Publishing Company Kozen, Dexter 1997. Automata and Computability. New York: Springer-Verlag. When we unify on the Sipser and Kozen definitions of "computable function" we have the mapping from one possibly empty finite string to another possibly empty finite string. It seems that we can define this in terms of a generic model of computation as a machine that computes the mapping from one possibly empty finite string input to another possibly empty finite string output and and then halts. A C function that returns a 0 or 1 value on the basis of an input finite string pair would meet the above definition of computable function. When this C function is mapped to its corresponding x86 code the x86 function finds its input on the stack and returns its value in the EAX register. >> vagueness. It is always a case of a sequence of "push" operations >> preceding the "call" operation. > > That is false. x86 subroutines can access global variables. > > Moreover, the push instructions can pass pointers. The same pointer > value 0xBF30D9A0 can point to completely different objects at different > times; therefore that value *per se* does not completely specify the input. >> -- 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-04 19:24 +0000 |
| Subject | Re: Solution To The Halting Problem [ C/x86 defines computable functions ] |
| Message-ID | <20210504121725.713@kylheku.com> |
| In reply to | #32698 |
["Followup-To:" header set to comp.theory.] On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: > On 5/4/2021 12:06 PM, Kaz Kylheku wrote: >> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote: >>> On 5/3/2021 6:27 PM, Ben Bacarisse wrote: >>>> Did you have a question about what I wrote? You seem to be having >>>> trouble understanding it. >>>> >>> >>> The notion of data passed to a function in the x86 architecture has zero >> >> There is no "function" in x86. Some assemblers for x86 in fact have >> pseudo-ops for delimiting a procedure using syntax like "PROC FAR" and >> "ENDP". >> > > Computable Functions > A Turing machine computes a function by starting with the input to the > function on the tape and halting with the output of the function on the > tape. (Sipser:1997:190) And nothing but the tape, so help you god. Each call Halts(P, P) is a new Turing machine, where the tape contents depend only on Halts and P, and not any global execution traces gathered by a larger surrouding machine. > When we unify on the Sipser and Kozen definitions of "computable > function" we have the mapping from one possibly empty finite string to > another possibly empty finite string. Sure, and when Halts is invoked in you apparatus with apparently the same formal arguments, it does not represent the same mapping each time, as required. The tape is different each time. Since the arguments are not, and the function is the same, it means that the tape contains something not coming from the arguments. That arrangement cannot refute a proof in which it is critically important that the corresponding computations are one and the same. > It seems that we can define this in terms of a generic model of Well, things are not as they seem. If you were confident, you wouldn't use weasel words like "seem", would you. > computation as a machine that computes the mapping from one possibly > empty finite string input to another possibly empty finite string output > and and then halts. > > A C function that returns a 0 or 1 value on the basis of an input finite > string pair would meet the above definition of computable function. It could, but not necessarily so. To write a C function that behaves like function, in particular a function of the arguments given to its formal parameters, we have to follow certain coding rules. Your apparatus does not follow those rules. (By your own admission, Halts is not even an ordinary C function in the first place, but a special operator of the "x86 UTM".) -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
Page 4 of 50 — ← Prev page 1 2 3 [4] 5 6 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web