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 28 of 50 — ← Prev page 1 … 26 27 [28] 29 30 … 50 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-13 17:40 -0500 |
| Subject | Re: New test program (Succeeds V2)[ counter-example in C ? ] |
| Message-ID | <ap-dnZ9IVvI-NwD9nZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #33530 |
On 5/13/2021 4:49 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> I am stipulating a simulating halt decider that behaves exactly like a >> simulator until it decides not halting. > > And the code in the "halt decider" that makes that assessment, in the > general case, is itself a halt decider. You keep quoting me, so I > assume you agree that must abandon any attempt to implement your > "truism". You must reign in your claims to one input (or at least to > some very limited set of inputs). > I have reigned in my claims to a very limited set of inputs. I did this after the very excellent review by Kaz and André that indicated my infinite recursion criteria were insufficient and could not be easily corrected. André pointed out a short-coming with my infinite loop criteria that could be easily fixed so I fixed it and gave him explicit credit on that element of the criteria. >> Every partial halt decider H that that bases its halting decision >> on simulating its input P until criteria (1)(2)(3) are met by the >> execution trace of P correctly decides not halting on input P. > > That depends, of course, on whether the criteria are correct. They > obviously are not correct since you use these criteria to calculate > Halts(H_Hat, H_Hat) == 0. > It would be [infinitely recursive emulation] if it was not stopped is the truism that I am matching. >> If a code sample CS that matches the (1)(2)(3) criteria and >> WOULD HALT without its simulation being terminated by the >> halt decider does not exist, this proves that Halts(H_Hat, H_Hat) == 0 >> is correct. > > Halts(H_Hat, H_Hat) == 0 is the wrong answer. You will have to confront > this fact eventually. > > I see elsewhere you are trying another evasion: > > Me: Halts(H_Hat, H_Hat) == 0 is correct if and only if H_Hat(H_Hat) does > not halt. > > You: When H_Hat(H_Hat) is called directly it is not an input to halts > that Halts decides incorrectly. > > You say the daftest things! > We cannot find the length of one's car by measuring the height of one's house. We cannot determine whether or not a partial halt decider decides its input correctly on any other basis than its actual input. This is true no matter how intuitively certain it seems that other different computations are a valid proxy. If you say that Halts(H_Hat, H_Hat) == 0 must be a mistake because H_Hat(H_Hat) halts then you must find the exact location of this mistake in the analysis. (A) If the non-halting criteria is correct. (B) The execution trace of H_Hat matches this criteria Then Halts(H_Hat, H_Hat) == 0 is necessarily correct. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-14 00:55 +0100 |
| Subject | Re: New test program (Succeeds V2)[ counter-example in C ? ] |
| Message-ID | <87bl9eur2x.fsf@bsb.me.uk> |
| In reply to | #33532 |
olcott <NoOne@NoWhere.com> writes: > On 5/13/2021 4:49 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >>> Every partial halt decider H that that bases its halting decision >>> on simulating its input P until criteria (1)(2)(3) are met by the >>> execution trace of P correctly decides not halting on input P. >> >> That depends, of course, on whether the criteria are correct. They >> obviously are not correct since you use these criteria to calculate >> Halts(H_Hat, H_Hat) == 0. > > It would be [infinitely recursive emulation] if it was not stopped is > the truism that I am matching We all know that, ever since the "comment out line 15 days" made it gruesomely clear. But full marks for coming clean in another post that you are not talking about the halting problem but about another still slightly vague one. >> Halts(H_Hat, H_Hat) == 0 is the wrong answer. You will have to confront >> this fact eventually. >> >> I see elsewhere you are trying another evasion: >> >> Me: Halts(H_Hat, H_Hat) == 0 is correct if and only if H_Hat(H_Hat) does >> not halt. >> >> You: When H_Hat(H_Hat) is called directly it is not an input to halts >> that Halts decides incorrectly. >> >> You say the daftest things! > > We cannot find the length of one's car by measuring the height of > one's house. The halting problem (which you admit is not the problem you are addressing) requires that Halts(H_Hat, H_Hat) == 0 only if H_Hat(H_Hat) is non-halting. But you are free from all such criticism because you have stopped worrying about the halting problem. You don't accept it's definition, so you are free to declare any answer you like correct. -- Ben. "the fact that a computation halts does not entail that it is a halting computation" Peter Olcott, May 2021.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-13 07:17 -0400 |
| Subject | Re: New test program (Succeeds V2)[ counter-example in C ? ] |
| Message-ID | <MU7nI.592015$%W6.301252@fx44.iad> |
| In reply to | #33450 |
On 5/12/21 4:45 PM, olcott wrote: > On 5/12/2021 6:46 AM, Richard Damon wrote: >> On 5/11/21 11:27 PM, olcott wrote: >>> >>> There is no code in my entire system that is not simulated so how else >>> can I address a statement that is very simply factually incorrect? >>> >>> I don't want to get into any of the underlying technical details so that >>> the current implemenation can be endlessly nit picked to death. I only >>> want to verify that my architectural design is correct. >> >> And this is part of your issue. Either you are claiming that any 'x86' >> is just a Turing Equivalent, so top level code running as x86 code is >> the equivalent to the actual Turing Machines, or you are defining that >> you have some program that creates a 'Turing Complete' environment >> taking inputs of Machine Equivalents, and runs them as their Turing >> Equivalent. > > Right now I am only evaluating the software engineering of a partial > halt decider written in C that examines x86 machine language execution > traces of a simulation of its input on the following basis: Except you CLAIM that this applies to the area of Computation Theory. For it to actually be applicable, it means that the question being asked needs to use the definitions of the space, namely that the real definition of a Halting Computation is does the computation when run finish in finite time (Halt) or not. > > Every partial halt decider H that that bases its halting decision > on simulating its input P until criteria (1)(2)(3) are met by the > execution trace of P correctly decides not halting on input P. > > If the execution trace of function P() [i.e. the input to H] shows: > (1) Partial halt decider H is called twice in sequence from the same > machine address of P. > (2) with the same machine address parameters to H > (3) with no conditional branch or indexed jump instructions in P > then H correctly decides not halting on P. > > The proof that I am correct is the impossibility of creating a > counter-example written in C that meets the (1)(2)(3) criteria, halts, > and H never stops simulating P. > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > > First, this 'claim' is not a proof. Proofs do not begin with 'I claim this idea to be true, someone find a counter example'. Proofs SHOW that the idea is true and can be derived from know truths. If a new axiom/principle needs to be assumed, it makes it clear, and that new axiom. Simple proof that your challenge is bad, by your definition, H WILL abort any machine that meets (1)(2)(3), therefore to create a machine with (1)(2)(3) where H does stop it is illogical. It is like claiming you have the fastest car, and to prove it you will race against any car that can be shown to be slower than you. Doesn't prove anything. H_Hat is the proper rebuttal to your machine being correct. H_Hat IS a halting computation, even by your own admission, so this a simple truth. H says it is a non-halting computation, which is clearly the wrong answer. You WHOLE argument is basically that IF you redefine what halting is, to be what Halts decides, then its answer will be correct. DUH. Problem is you don't get to redefine what Halting means. Halting means Halting. H_Hat Halts, so it is Halting. Halts(H_Hat, H_Hat) is wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-13 08:26 -0500 |
| Subject | Re: New test program (Succeeds V2)[ counter-example in C ? ] |
| Message-ID | <wq6dnatT4uBZtQD9nZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #33502 |
On 5/13/2021 6:17 AM, Richard Damon wrote: > On 5/12/21 4:45 PM, olcott wrote: >> On 5/12/2021 6:46 AM, Richard Damon wrote: >>> On 5/11/21 11:27 PM, olcott wrote: >>>> >>>> There is no code in my entire system that is not simulated so how else >>>> can I address a statement that is very simply factually incorrect? >>>> >>>> I don't want to get into any of the underlying technical details so that >>>> the current implemenation can be endlessly nit picked to death. I only >>>> want to verify that my architectural design is correct. >>> >>> And this is part of your issue. Either you are claiming that any 'x86' >>> is just a Turing Equivalent, so top level code running as x86 code is >>> the equivalent to the actual Turing Machines, or you are defining that >>> you have some program that creates a 'Turing Complete' environment >>> taking inputs of Machine Equivalents, and runs them as their Turing >>> Equivalent. >> >> Right now I am only evaluating the software engineering of a partial >> halt decider written in C that examines x86 machine language execution >> traces of a simulation of its input on the following basis: > > Except you CLAIM that this applies to the area of Computation Theory. > For it to actually be applicable, it means that the question being asked > needs to use the definitions of the space, namely that the real > definition of a Halting Computation is does the computation when run > finish in finite time (Halt) or not. > >> >> Every partial halt decider H that that bases its halting decision >> on simulating its input P until criteria (1)(2)(3) are met by the >> execution trace of P correctly decides not halting on input P. >> >> If the execution trace of function P() [i.e. the input to H] shows: >> (1) Partial halt decider H is called twice in sequence from the same >> machine address of P. >> (2) with the same machine address parameters to H >> (3) with no conditional branch or indexed jump instructions in P >> then H correctly decides not halting on P. >> >> The proof that I am correct is the impossibility of creating a >> counter-example written in C that meets the (1)(2)(3) criteria, halts, >> and H never stops simulating P. >> >> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >> >> > > First, this 'claim' is not a proof. Proofs do not begin with 'I claim > this idea to be true, someone find a counter example'. Proofs SHOW that > the idea is true and can be derived from know truths. If a new > axiom/principle needs to be assumed, it makes it clear, and that new axiom. > > Simple proof that your challenge is bad, by your definition, H WILL > abort any machine that meets (1)(2)(3), therefore to create a machine > with (1)(2)(3) where H does stop it is illogical. It is like claiming > you have the fastest car, and to prove it you will race against any car > that can be shown to be slower than you. Doesn't prove anything. > On 5/11/2021 11:10 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Truism: >> Every simulation that would never stop unless Halts() stops >> it at some point specifies infinite execution. > > Any algorithm that implements this truism is, of course, a halting > decider. There can be no point in using it to get Halts to stop > simulating, you could just use it directly. You have to reign in your > goal and limit the code to finding a pattern that is present in > the one case you care about. That was a bug in the criteria, that Kaz caught here is the corrected version: If a code sample CS that matches the (1)(2)(3) criteria and WOULD HALT without its simulation being terminated by the halt decider does not exist, this proves that Halts(H_Hat, H_Hat) == 0 is correct. > H_Hat is the proper rebuttal to your machine being correct. H_Hat IS a > halting computation, even by your own admission, so this a simple truth. > H says it is a non-halting computation, which is clearly the wrong answer. > Halts(H_Hat, H_Hat) Fails the updated counter-example criteria it would not halt if its simulation was not terminated. > You WHOLE argument is basically that IF you redefine what halting is, to > be what Halts decides, then its answer will be correct. DUH. Problem is > you don't get to redefine what Halting means. Halting means Halting. > H_Hat Halts, so it is Halting. Halts(H_Hat, H_Hat) is wrong. > -- 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-13 19:18 -0400 |
| Subject | Re: New test program (Succeeds V2)[ counter-example in C ? ] |
| Message-ID | <AtinI.113230$1%.44659@fx37.iad> |
| In reply to | #33505 |
On 5/13/21 9:26 AM, olcott wrote: > On 5/13/2021 6:17 AM, Richard Damon wrote: >> On 5/12/21 4:45 PM, olcott wrote: >>> On 5/12/2021 6:46 AM, Richard Damon wrote: >>>> On 5/11/21 11:27 PM, olcott wrote: >>>>> >>>>> There is no code in my entire system that is not simulated so how else >>>>> can I address a statement that is very simply factually incorrect? >>>>> >>>>> I don't want to get into any of the underlying technical details so >>>>> that >>>>> the current implemenation can be endlessly nit picked to death. I only >>>>> want to verify that my architectural design is correct. >>>> >>>> And this is part of your issue. Either you are claiming that any 'x86' >>>> is just a Turing Equivalent, so top level code running as x86 code is >>>> the equivalent to the actual Turing Machines, or you are defining that >>>> you have some program that creates a 'Turing Complete' environment >>>> taking inputs of Machine Equivalents, and runs them as their Turing >>>> Equivalent. >>> >>> Right now I am only evaluating the software engineering of a partial >>> halt decider written in C that examines x86 machine language execution >>> traces of a simulation of its input on the following basis: >> >> Except you CLAIM that this applies to the area of Computation Theory. >> For it to actually be applicable, it means that the question being asked >> needs to use the definitions of the space, namely that the real >> definition of a Halting Computation is does the computation when run >> finish in finite time (Halt) or not. >> >>> >>> Every partial halt decider H that that bases its halting decision >>> on simulating its input P until criteria (1)(2)(3) are met by the >>> execution trace of P correctly decides not halting on input P. >>> >>> If the execution trace of function P() [i.e. the input to H] shows: >>> (1) Partial halt decider H is called twice in sequence from the same >>> machine address of P. >>> (2) with the same machine address parameters to H >>> (3) with no conditional branch or indexed jump instructions in P >>> then H correctly decides not halting on P. >>> >>> The proof that I am correct is the impossibility of creating a >>> counter-example written in C that meets the (1)(2)(3) criteria, halts, >>> and H never stops simulating P. >>> >>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf >>> >>> >>> >> >> First, this 'claim' is not a proof. Proofs do not begin with 'I claim >> this idea to be true, someone find a counter example'. Proofs SHOW that >> the idea is true and can be derived from know truths. If a new >> axiom/principle needs to be assumed, it makes it clear, and that new >> axiom. >> >> Simple proof that your challenge is bad, by your definition, H WILL >> abort any machine that meets (1)(2)(3), therefore to create a machine >> with (1)(2)(3) where H does stop it is illogical. It is like claiming >> you have the fastest car, and to prove it you will race against any car >> that can be shown to be slower than you. Doesn't prove anything. >> > > On 5/11/2021 11:10 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Truism: >>> Every simulation that would never stop unless Halts() stops >>> it at some point specifies infinite execution. >> >> Any algorithm that implements this truism is, of course, a halting >> decider. There can be no point in using it to get Halts to stop >> simulating, you could just use it directly. You have to reign in your >> goal and limit the code to finding a pattern that is present in >> the one case you care about. > > That was a bug in the criteria, that Kaz caught here is the corrected > version: > If a code sample CS that matches the (1)(2)(3) criteria and > WOULD HALT without its simulation being terminated by the > halt decider does not exist, this proves that Halts(H_Hat, H_Hat) == 0 > is correct. First point, anything complicated enough to have that sort of bug, ISN'T a Truism! A Truism is something like a Computation that Halts is a Halting Computatation, or the Right Answer for a Halt Decider making a decision about a Computation that Halts, is to say it Halts. THOSE are Truism. Second, you seem to be > >> H_Hat is the proper rebuttal to your machine being correct. H_Hat IS a >> halting computation, even by your own admission, so this a simple truth. >> H says it is a non-halting computation, which is clearly the wrong >> answer. >> > > Halts(H_Hat, H_Hat) > Fails the updated counter-example criteria it would not halt if its > simulation was not terminated. Then the simulator is broken, because it does halt when actually run, at least when using the Decider that says it is non-halting. Note, a Halt Decider is NOT 'just a simulator', the extra is important. Its YOUR fault you can't get your decider to be consistent. > >> You WHOLE argument is basically that IF you redefine what halting is, to >> be what Halts decides, then its answer will be correct. DUH. Problem is >> you don't get to redefine what Halting means. Halting means Halting. >> H_Hat Halts, so it is Halting. Halts(H_Hat, H_Hat) is wrong. >> > >
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-11 22:35 -0400 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <u9HmI.108961$Ms7.87136@fx34.iad> |
| In reply to | #33343 |
On 5/11/21 10:02 PM, olcott wrote: > On 5/11/2021 8:46 PM, André G. Isaak wrote: >> On 2021-05-11 19:25, olcott wrote: >>> On 5/11/2021 8:01 PM, André G. Isaak wrote: >>>> On 2021-05-11 18:13, olcott wrote: >>>>> On 5/11/2021 6:36 PM, André G. Isaak wrote: >>>>>> On 2021-05-11 16:37, olcott wrote: >>>>>>> On 5/11/2021 5:27 PM, André G. Isaak wrote: >>>>>>>> On 2021-05-11 14:15, olcott wrote: >>>>>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote: >>>>>>> >>>>>>>>> If we make sure to force halts to behave like a simulator then >>>>>>>>> we are forbidding halts to be a decider. >>>>>>>> >>>>>>>> A program cannot be two different programs at once. Either your >>>>>>>> program is a simulator or it is a decider. >>>>>>>> >>>>>>>>> Halts() is exactly a simulator until is has proof that its >>>>>>>>> input would never stop unless Halts() stopped it. >>>>>>>> >>>>>>>> No. It isn't exactly a simulator, because for the above to make >>>>>>>> any sort of sense it must be doing at least one thing which a >>>>>>>> simulator does *not* do: it must be looking for that 'proof' >>>>>>>> that its input would never stop. That involves tests. Tests >>>>>>>> entail conditional branches. >>>>>>>> >>>>>>>> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which >>>>>>>> in turn runs makes a call to Halts() as part of its simulation >>>>>>>> (call it 'simulated halts' to distinguish it from the outermost >>>>>>>> call), your 'halt detection logic' must look inside this >>>>>>>> simulated halts, and inside the new simulation of H_Hat(H_Hat) >>>>>>>> triggered by simulated halts. All of those conditional branches >>>>>>>> associated with your tests count as conditional branches >>>>>>>> intervening between two calls to the same address. >>>>>>>> >>>>>>>>> Truism: >>>>>>>>> Every simulation that would never stop unless Halts() stops it >>>>>>>>> at some >>>>>>>>> point specifies infinite execution. >>>>>>>>> >>>>>>>>>>> The first three criteria are the exactly same criteria that I >>>>>>>>>>> have been referring to for many months (3 has been augmented) >>>>>>>>>>> If the execution trace of function H_Hat() shows: >>>>>>>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>>>>>>> address of H_Hat() >>>>>>>>>>> (2) with the same parameters to Halts() >>>>>>>>>>> (3) with no conditional branch or indexed jump instructions >>>>>>>>>>> in H_Hat() >>>>>>>>>> >>>>>>>>>> You can't mention H_Hat in your criteria. Halts() isn't >>>>>>>>>> restricted to running on just one input. >>>>>>>>>> >>>>>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non >>>>>>>>>>> halting criteria: >>>>>>>>>> >>>>>>>>>>> Truism: >>>>>>>>>>> Every simulation that would never stop unless Halts() stops >>>>>>>>>>> it at some >>>>>>>>>>> point specifies infinite execution. >>>>>>>>>> >>>>>>>>>> That is an entirely vacuous statement. Unless you can provide >>>>>>>>>> a foolproof mechanism for correctly identifying such cases, >>>>>>>>>> the above doesn't help you in the slightest. >>>>>>>>>> >>>>>>>>>> André >>>>>>>>>> >>>>>>>>>> >>>>>>>>> >>>>>>>>> If the execution trace of function H_Hat() shows: >>>>>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>>>>> address of H_Hat() >>>>>>>>> (2) with the same parameters to Halts() >>>>>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>>>>> H_Hat() >>>>>>>> >>>>>>>> You've already been given numerous examples which show that the >>>>>>>> above criteria don't work, at least not as you are applying them. >>>>>>>> >>>>>>>>> This is proof that Halts() must stop simulating H_Hat() thus >>>>>>>>> matching the truism. >>>>>>>> >>>>>>>> Have you ever actually read a real proof? Even a really simple one? >>>>>>>> >>>>>>>> The above doesn't even remotely constitute a proof. Proofs have >>>>>>>> premises along with arguments which show how those premises lead >>>>>>>> to a conclusion. All you have above is claim that you can use >>>>>>>> the three criteria above to somehow identify runaway recursion. >>>>>>>> You have no argumentation to support that these criteria >>>>>>>> actually work, and counterexamples have already been provided >>>>>>>> which demonstrate that they do not. >>>>>>>> >>>>>>>> Argumentum ad repetitione does not constitute valid logic. >>>>>>>> >>>>>>>> André >>>>>>>> >>>>>>> >>>>>>> Try and form a counter-example where the input to Halts() would >>>>>>> halt if Halts() did not stop simulating it and the input does >>>>>>> match (1)(2)(3). >>>>>>> >>>>>>> If the execution trace of function H_Hat() shows: >>>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>>> address of H_Hat() >>>>>>> (2) with the same parameters to Halts() >>>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>>> H_Hat() >>>>>> >>>>>> >>>>>> First, why are your criteria suddenly talking about Halts() and >>>>>> H_Hat rather than variables? Your criteria need to be generic, not >>>>>> tied to specific inputs. >>>>>> >>>>> >>>>> I could say for every partial halt decider X() that >>>>> that bases its halting decision on simulating its input Y() >>>>> until criteria (1)(2)(3) are met by its input Y()... >>>> >>>> Not only could you do this, you should do this. >>>> >>>>>> Second, why don't you rewrite the above so it is actually clear >>>>>> what they mean. I'll briefly outline some of the vagueness >>>>>> inherent in the above. >>>>>> >>>>>> If the execution trace of function P() [i.e. the input to halts] >>>>>> shows: >>>>>> >>>>>> 1) some function X is called twice in sequence from the same >>>>>> machine address of P. >>>>>> >>>>>> To make sense of the above, we need to know what 'in sequence' >>>>>> actually means. We also need to know how the address space used in >>>>>> your nested simulations actually works. >>>>> >>>>> The execution trace of N instructions of P repeats over and over >>>>> with nothing inbetween. >>>> >>>> That's even less clear than the original. And it doesn't even >>>> mention the function X which is supposedly being called 'in sequence'. >>>> >>> >>> In sequence always refers to an execution trace of one instruction >>> after another >>> >>> The following 16 instructions are a single contiguous execution trace >>> of H_Hat() where 8 instructions are repeated until Halts stop >>> simulating H_Hat(). >>> >>> Begin Local Halt Decider Simulation at Machine Address:b1f >>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp >>> ...[00000b20][002115e2][002115e6](02) 8bec mov ebp,esp >>> ...[00000b22][002115de][002015b2](01) 51 push ecx >>> ...[00000b23][002115de][002015b2](03) 8b4508 mov eax,[ebp+08] >>> ...[00000b26][002115da][00000b1f](01) 50 push eax >>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov ecx,[ebp+08] >>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx >>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call 0000095f >> >> But you've skipped over absolutely all of the instructions which are >> executed at this point. Why? There could be any number of conditional >> branches or other flow-control instruction in the code you've skipped. >> > > It turns out that it does not make any difference. > If it does make a difference then this counter-example would show the > difference that it makes: > > The counter-example that I am asking for would directly prove that my > current design is incorrect. The lack of any possible counter-example > would prove that my current design is correct. > > Someone with knowledge of software engineering could derive a > counter-example of a case where: > (A) The execution trace of the input matches the (1)(2)(3) criteria. > (B) Halts() never stops simulating this input. > (C) The input halts on its own. > > The non-existence of such a counter-example proves > Halts(H_Hat, H_Hat) == 0 is correct. > > >>> ...[00000b1f][002115e2][002115e6](01) 55 push ebp >>> ...[00000b20][002115e2][002115e6](02) 8bec mov ebp,esp >>> ...[00000b22][002115de][002015b2](01) 51 push ecx >>> ...[00000b23][002115de][002015b2](03) 8b4508 mov eax,[ebp+08] >>> ...[00000b26][002115da][00000b1f](01) 50 push eax >>> ...[00000b27][002115da][00000b1f](03) 8b4d08 mov ecx,[ebp+08] >>> ...[00000b2a][002115d6][00000b1f](01) 51 push ecx >>> ...[00000b2b][002115d2][00000b30](05) e82ffeffff call 0000095f >>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped >>> >>>>>> When X simulates Y which in turn simulates X which in turn >>>>>> simulates Y, how does your simulator actually distinguish between >>>>>> these various levels of simulation if not by assigning them to >>>>>> entirely separate virtual address spaces? >>>>> >>>>> The internals are irrelevant we are only examining the >>>>> architectural design. >>>> >>>> Of course the internals are relevant. >>>> >>> >>> Whatever internals encode the architectural design. >>> >>>> You claim that Halts doesn't actually run H_Hat, it *simulates* >>>> H_Hat. That means that when H_Hat makes a call to Halts() it isn't >>>> actually calling the same function as the main Halts(); rather it >>>> calls a *simulated* version of this function. A call to a function >>>> is different from a simulation of that function, so how on earth are >>>> they going to end up having the same address? And the next call to >>>> Halts() will be a simulation of a simulation, so it will be distinct >>>> from either of the first two calls. >>>> >>> >>> In a networking environment whenever code is shared with multiple >>> concurrent users there is only one copy of the actual code. >> >> But that's not what we're talking about here. >> >>>> Until you clarify how your 'simulator' actually works, I can't see >>>> how you can possibly claim that the same function is *ever* called >>>> from the same machine address in Halts(H_Hat, H_Hat). >>>> >>> >>> It might have been back in the original CGI protocol days that >>> multiple instances of code were loaded, not since then s far as I know. >> >> We're not talking about about running multiple instances of a program >> here, or a program being shared by multiple users. We're talking about >> the difference between a program which is *actually* being executed >> and one which is being simulated based on a description read in from a >> COFF file (or at least that's what you've claimed). >> > > It does the same thing as a multi-user environment, it reuses the same > code in the same location of memory. > >>>>>> >>>>>> (2) with the same parameters to some function X() >>>>>> >>>>>> What does 'same parameters' mean exactly? Since your Halts and >>>>>> H_Hat both take pointers as parameters does this mean that the >>>>>> same addresses are being passed each time, >>>>> >>>>> Yes >>>> > >>>>>> or does it mean that the actual data pointed to is identical in >>>>>> both instances? >>>>>> >>>>>> (3) with no conditional branch or indexed instructions in P() >>>>>> >>>>>> What does this mean? Do you really mean 'in P()' or do you mean >>>>>> 'between the two calls to some function X'?. >>>>> >>>>> The entire sequence of N instructions of P that repeats over and >>>>> over has no conditional branch instructions. >>>> >>>> And what does 'sequence' mean? Does this refer to the sequence in >>>> which instructions occur in memory, or the sequence in which >>>> instructions are actually executed? >>> >>> I have always been talking about an execution trace of one >>> instruction after another. >> >> So why do you skip over a chunk of instructions in the above trace? >> What possible justification can there be for that? >> >> André >> >> > > That these instructions don't make any difference. If they did make a > difference then the requested counter-example would show this difference. > > The non-existence of such a counter-example proves > Halts(H_Hat, H_Hat) == 0 is correct. > > As I said, H_Hat prove you incorrect because een YOU have posted proof that H_Hat(H_Hat) is a halting computation. A Halting Computation is NOT a non-Halting Computation, so Halts(H_Hat, H_Hat) == 0 is wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 08:18 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <v6udnbNW7ZOaGQf9nZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #33335 |
On 5/10/2021 11:33 PM, André G. Isaak wrote:
> On 2021-05-10 22:20, olcott wrote:
>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>> On 2021-05-10 21:36, olcott wrote:
>>>> On 5/10/2021 10:06 PM, André G. Isaak wrote:
>>>>> On 2021-05-10 20:56, olcott wrote:
>>>>>> On 5/10/2021 9:39 PM, André G. Isaak wrote:
>>>>>>> On 2021-05-10 20:13, olcott wrote:
>>>>>>>> On 5/10/2021 8:45 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-05-10 17:42, olcott wrote:
>>>>>>>>>> On 5/10/2021 6:10 PM, André G. Isaak wrote:
>>>>>>>>>>> On 2021-05-10 15:34, olcott wrote:
>>>>>>>>>
>>>>>>>>> <snippage>
>>>>>>>>>
>>>>>>>>>>> How can things be 'obviously computationally equivalent' when
>>>>>>>>>>> you haven't actually provide any code other than a wrapper?
>>>>>>>>>>
>>>>>>>>>> Both versions of H_Hat() can be seen to be are computationally
>>>>>>>>>> equivalent. Both versions if Halts() are "given" to simulate
>>>>>>>>>> their input. Even though the one that Mike agreed to is called
>>>>>>>>>> Halts() and Mike agreed that H_Hat() the behavior of H_Hat() is:
>>>>>>>>>>
>>>>>>>>>> On 11/20/2020 9:30 PM, Mike Terry wrote:
>>>>>>>>>> > [So the correct halting decision for the input is
>>>>>>>>>> non-halting].
>>>>>>>>>>
>>>>>>>>>> We did not actually get to the step where Halts:
>>>>>>>>>> (1) Aborted the simulation of its input on the basis of the
>>>>>>>>>> behavior of H_Hat() matched a correct non-halting behavior
>>>>>>>>>> pattern.
>>>>>>>>>> (2) Reported non-halting,
>>>>>>>>>>
>>>>>>>>>>> No one has ever seen the code which goes inside your Halts()?
>>>>>>>>>>>
>>>>>>>>>>> That aside, though, your Halts() and a UTM are clearly *not*
>>>>>>>>>>> computationally equivalent. Your halts, when given the
>>>>>>>>>>> description of a non-finite computation reports (allegedly)
>>>>>>>>>>> that it is a non-finite computation. A UTM, on the other
>>>>>>>>>>> hand, doesn't report this. It simply runs forever when given
>>>>>>>>>>> a non-finite input.
>>>>>>>>>>>
>>>>>>>>>>> All this confusion could easily be avoided is you would
>>>>>>>>>>> simply stop using terms incorrectly. Your Halts() is not a
>>>>>>>>>>> UTM and should never be described as one.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> An x86 emulator is suffciently computationally equivalent to a
>>>>>>>>>> UTM.
>>>>>>>>>
>>>>>>>>> 'Sufficiently computationally equivalent' is meaningless.
>>>>>>>>> Things are either computationally equivalent or they aren't.
>>>>>>>>>
>>>>>>>>> And a (purported) Halt Decider is not computationally
>>>>>>>>> equivalent to a UTM. A UTM and a Halt Decider perform different
>>>>>>>>> computations. You can view your Simulate() as equivalent to a
>>>>>>>>> UTM, but not your Halts().
>>>>>>>
>>>>>>> You're not even going to acknowledge your error here?
>>>>>>>
>>>>>>
>>>>>> It is a matter of opinion and I disagree.
>>>>>
>>>>> No. It's a matter of definition.
>>>>
>>>> For every x86 emulation of x86 code there is a corresponding UTM /
>>>> Turing machine description pair.
>>>
>>> But a Halt Decider is different from an emulator or a UTM.
>>
>> For every x86 based partial halt decider that is based on emulating
>> its x86 input there exists a partial halt decider based on adapting a
>> UTM.
>
> You seem to be entirely missing my point. I am not arguing that your
> 'Halt Decider' isn't a UTM because it isn't a Turing Machine. I gave up
> on that long ago. I am pointing out that once you change your
> simulator/UTM to a Halt Decider, you need to stop referring to it as a
> simulator/UTM because it is now doing something else. And all your talk
> of 'infinitely nested simulations' no longer applies because you are no
> longer dealing with a simulator, but rather with something which
> includes code that can *stop* simulating, which a simulator cannot do.
>
A halt decider that bases it halting decision on simulating its input
must stop simualting inputs that do not halt. Forbidding this as the
basis for saying that no halt decider can exist is like saying that no
halt decider that is not allowed to return a value exists therefore halt
deciders do not exist.
>>>>>>>>>>>> On 11/20/2020 9:30 PM, Mike Terry wrote:
>>>>>>>>>>>> > [So the correct halting decision for the input is
>>>>>>>>>>>> non-halting].
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> In the mean time (with the help of others) I derived this
>>>>>>>>>>>> infinitely nested simulation criteria.
>>>>>>>>>>>>
>>>>>>>>>>>> When an execution trace matches the following criteria we
>>>>>>>>>>>> know that the non-halting behavior of infinite recursion or
>>>>>>>>>>>> infinitely nested simulation has been matched:
>>>>>>>>>>>>
>>>>>>>>>>>> If the execution trace of function Y() shows:
>>>>>>>>>>>> (1) function X() is called twice in sequence from the
>>>>>>>>>>>> same machine address of Y()
>>>>>>>>>>>> (2) with the same parameters to X()
>>>>>>>>>>>> (3) with no conditional branch or indexed jump
>>>>>>>>>>>> instructions in Y()
>>>>>>>>>>>
>>>>>>>>>>> Except you entirely fail to show (3) holds for H_Hat since
>>>>>>>>>>> you ignore all conditional branches within Halts().
>>>>>>>>>>
>>>>>>>>>> I acknowledge that you, Mike and Kaz are in the top three most
>>>>>>>>>> qualified technical reviewers of my work in recent years.
>>>>>>>>>>
>>>>>>>>>> I explain the criteria below substituting in Halts() and
>>>>>>>>>> H_Hat() for X() and Y().
>>>>>>>>>
>>>>>>>>> Again, nothing below addresses my point, which is that without
>>>>>>>>> knowledge of what happens inside Halts, we cannot see whether
>>>>>>>>> it matches these criteria or not.
>>>>>>>>
>>>>>>>> We need no knowledge of Halts() what-so-ever besides the fact
>>>>>>>> that Halts() simulates its input until one of two non-halting
>>>>>>>> behavior patterns is met.
>>>>>>>
>>>>>>> Of course we need knowledge of Halts() because H_Hat *calls* Halts.
>>>>>>>
>>>>>>> Just as you can't determine whether
>>>>>>>
>>>>>>> void foo(void) {
>>>>>>> foo2();
>>>>>>> foo();
>>>>>>> }
>>>>>>>
>>>>>>> is infinitely recursive without knowing what happens inside
>>>>>>> foo2(), you similarly can't make a determination of whether H_Hat
>>>>>>> is infinitely recursive without knowing what happens inside any
>>>>>>> function which it calls, including Halts().
>>>>>>>
>>>>>>
>>>>>> As long as foo2() compiles it does not matter what it does as long
>>>>>> as the caller matches the (1)(2)(3) behavior pattern.
>>>>>
>>>>> So, according to you, does it match that pattern or not?
>>>>>
>>>>
>>>> No matter what is inside foo() besides a return to it caller and the
>>>> caller matches patterns (1)(2)(3) then we know it is a case of
>>>> infinite recursion. Do you understand that to be a yes?
>>>>
>>>> Try and find a counter-example if you can.
>>>
>>> I already provided one. If foo2() throws a signal, then foo() will
>>> *not* be infinitely recursive, despite the fact that it matches your
>>> so-called pattern.
>>>
>>
>> There is no signals in the x86utm operating system.
>
> And how exactly does your x86utm prevent a program from throwing
> exceptions? You don't need support from the OS to implement throw and
> catch instructions.
>
Exceptions do not physically exist. The x86utm OS is the whole universe
for the code that it simulates.
>>> You can't just ignore function calls inside foo() anymore than you
>>> can ignore the call to Halts() inside H_Hat. Your pattern matcher
>>> needs to consider *all* of the code that is executed including code
>>> in any function call.
>>>
>>
>> Try and find another counter-example. That was a good one.
>
> foo2() could also simply change the value of the stack pointer so that
> the return from foo2() actually returns to foo()'s caller rather than to
> foo() itself. The point is that you can't simply ignore what goes on
> inside a function call. You can't evalute foo() without knowing what
> foo2() does. Similarly, you can't evaluate H_Hat without knowing what
> Halts() does.
>
This would be a convoluted example of returning to the caller.
It is given that Halts does not do this.
>>>>> André
>>>>>
>>>>>>> André
>>>>>>>
>>>>>>>> As long as H_Hat() matches the behavior pattern of (1)(2)(3)
>>>>>>>> then Halts(H_Hat,H_Hat) == 0 is correct.
>>>>>>>>
>>>>>>>>>> If the execution trace of function H_Hat() shows:
>>>>>>>>>> (1) function Halts() is called twice in sequence from the same
>>>>>>>>>> machine address of H_Hat()
>>>>>>>>>> (2) with the same parameters to Halts()
>>>>>>>>>> (3) with no conditional branch or indexed jump instructions in
>>>>>>>>>> H_Hat()
>>>>>>>>>> (4) with no function call returns from Halts() to the
>>>>>>>>>> simulated H_Hat()
>>>>>>>>>> then the function call from H_Hat() to Halts() specifies
>>>>>>>>>> infinitely nested simulation.
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>>> You skip over this in your traces. So whatever it is that
>>>>>>>>>>> you're doing, it isn't actually looking for the pattern you
>>>>>>>>>>> describe.
>>>>>>>>>>>
>>>>>>>>>>>> (4) with no function call returns from X() to Y()
>>>>>>>>>>>> then the function call from Y() to X() specifies infinite
>>>>>>>>>>>> recursion or infinitely nested simulation.
>>>>>>>>>>>> (4) is always met with infinitely nested simulation. No
>>>>>>>>>>>> simulator ever returns to its input.
>>>>>>>>>>>
>>>>>>>>>>> The above statement is gibberish. What does your (4) have to
>>>>>>>>>>> do with a simulator 'returning to its input'? (whatever
>>>>>>>>>>> that's supposed to mean).
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> It is infinite recursion as long as X() never returns to Y()
>>>>>>>>>
>>>>>>>>> Which is entirely different from the nonsensical claim about a
>>>>>>>>> simulator returning to its input.
>>>>>>>>
>>>>>>>> The [infinite recursion] non-halting behavior pattern matches
>>>>>>>> both [infinite recursion] and [infinitely nested simulation].
>>>>>>>
>>>>>>> But H_Hat(H_Hat) is *neither* of these things.
>>>>>>
>>>>>> When I have proven that Halts(H_Hat,H_Hat) == 0 is correct then
>>>>>> the behavior of H_Hat(H_Hat) will lead to a WTF? moment.
>>>>>>
>>>>>> Until I have proven that Halts(H_Hat,H_Hat) == 0 is correct the
>>>>>> behavior of H_Hat(H_Hat) is simply a distraction.
>>>>>>
>>>>>>> And this goes back to your error which I pointed out above of
>>>>>>> insisting on calling your Halts() a 'UTM' or a simulator. It
>>>>>>> isn't either of these things. It is supposedly a halt decider. A
>>>>>>> simulator/UTM and a Halt Decider perform *different* computations.
>>>>>>>
>>>>>>
>>>>>> Halts() is a simulating partial halt decider.
>>>>>> It has an adapted UTM / partial halt decider equivalent.
>>>>>
>>>>> But it isn't an actual simulator/UTM. A Simulator/UTM faithfully
>>>>> executes whatever computation it is given as an input.
>>>>
>>>> void foo(void)
>>>> {
>>>> foo();
>>>> }
>>>>
>>>> When Halts matches the [infinite recursion] pattern on the partial
>>>> simulation of above finite string it <is> a correct match.
>>>>
>>>> This case much more obviously shows the the conditional branch
>>>> instructions inside Halts() do not make the above finite string a
>>>> halting computation.
>>>
>>> Of course conditional branches inside Halts() don't matter to the
>>> above example because the above foo() *doesn't* call Halts. H_Hat
>>> *does* call Halts.
>>>
>>
>> If they don't matter for infinite recursion then they don't matter for
>> infinitely nested simulation. Try and find another counter-example.
>
> They *do* matter for both of the above.
>
> André
Not in any of the scenarios that you have proposed.
>
>> You are doing a very good job. You are one of my three most
>> technically qualified reviewers. Kaz and Mike are the other two.
>>
>>> André
>>>
>>>> What is less obvious is that we never need to know anything about
>>>> the internals of the called function except that the called function
>>>> does not return to the caller.
>>>>
>>>> The only way that I currently know that this can be proved is that
>>>> every challenge to find a counter-example has failed.
>>>>
>>>> So what we do its hypothesize that the criteria are correct and then
>>>> realize that this forces Halts(H_Hat,H_Hat) == 0 to be correct:
>>>>
>>>> When the execution trace of H_Hat() correctly matches a correct
>>>> non-halting behavior pattern then the decision of non-halting is
>>>> necessarily correct.
>>>>
>>>> It is very easy to see that the [infinite recursion] pattern is
>>>> matched by the behavior of H_Hat.
>>>>
>>>> Pages 2 and 3 show that the behavior pattern is matched.
>>>>
>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>
>>>>
>>>>
>>>>> Your Halts() steps through the input one step at a time and after
>>>>> each step decides whether to continue with the simulation or not.
>>>>> That decision involves a conditional branch. That decision also
>>>>> means that an input which might involve infinitely nested
>>>>> simulations WHEN RUN IN AN ACTUAL SIMULATOR might not inolved
>>>>> infinitely nested simulations when given as an input to Halts()
>>>>>
>>>>>>> André
>>>>>>>
>>>>>>>> For [infinite recursion] we need to know that the called
>>>>>>>> function never returns to its caller. That is the only thing
>>>>>>>> that we need to know about the called function.
>>>>>>>>
>>>>>>>> For [infinitely nested simulation] we can skip step(4) completely.
>>>>>>>> As long as the called function is simulating the caller, that is
>>>>>>>> all that we need to know about the called function.
>>>>>>>>
>>>>>>>> It might be easier to first examine whether or not the above
>>>>>>>> criteria (1)(2)(3)(4) correctly decides infinite recursion.
>>>>>>>>
>>>>>>>> Once this is understood then the this understanding can be
>>>>>>>> applied to infinitely nested simulation because it is the exact
>>>>>>>> same kind of thing.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>
>>>>>>
>>>>>
>>>>>
>>>>
>>>>
>>>
>>>
>>
>>
>
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 08:53 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7e5pt$4r7$1@dont-email.me> |
| In reply to | #33341 |
On 2021-05-11 07:18, olcott wrote:
> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>> On 2021-05-10 22:20, olcott wrote:
>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
<snip>
>> You seem to be entirely missing my point. I am not arguing that your
>> 'Halt Decider' isn't a UTM because it isn't a Turing Machine. I gave
>> up on that long ago. I am pointing out that once you change your
>> simulator/UTM to a Halt Decider, you need to stop referring to it as a
>> simulator/UTM because it is now doing something else. And all your
>> talk of 'infinitely nested simulations' no longer applies because you
>> are no longer dealing with a simulator, but rather with something
>> which includes code that can *stop* simulating, which a simulator
>> cannot do.
>>
>
> A halt decider that bases it halting decision on simulating its input
> must stop simualting inputs that do not halt. Forbidding this as the
> basis for saying that no halt decider can exist is like saying that no
> halt decider that is not allowed to return a value exists therefore halt
> deciders do not exist.
What does any of the above have to do with my statement? I am not
'forbidding' anything. I am simply stating that a Halt Decider is not
the same thing as a simulator even if it makes use of simulation, and
that you need to keep your terminology straight.
<snip>
>>> There is no signals in the x86utm operating system.
>>
>> And how exactly does your x86utm prevent a program from throwing
>> exceptions? You don't need support from the OS to implement throw and
>> catch instructions.
>>
>
> Exceptions do not physically exist. The x86utm OS is the whole universe
> for the code that it simulates.
I have no idea what this is supposed to mean. Exceptions exist in the
same sense that for-loops or if-then-else statements exist. The OS
doesn't get to decide which types of constructions a program uses.
>>>> You can't just ignore function calls inside foo() anymore than you
>>>> can ignore the call to Halts() inside H_Hat. Your pattern matcher
>>>> needs to consider *all* of the code that is executed including code
>>>> in any function call.
>>>>
>>>
>>> Try and find another counter-example. That was a good one.
>>
>> foo2() could also simply change the value of the stack pointer so that
>> the return from foo2() actually returns to foo()'s caller rather than
>> to foo() itself. The point is that you can't simply ignore what goes
>> on inside a function call. You can't evalute foo() without knowing
>> what foo2() does. Similarly, you can't evaluate H_Hat without knowing
>> what Halts() does.
>>
>
> This would be a convoluted example of returning to the caller.
Yes, but one that demonstrates that to match your 'infinite recursion'
pattern you have to actually look inside all functions being called.
<snip>
>>>> Of course conditional branches inside Halts() don't matter to the
>>>> above example because the above foo() *doesn't* call Halts. H_Hat
>>>> *does* call Halts.
>>>>
>>>
>>> If they don't matter for infinite recursion then they don't matter
>>> for infinitely nested simulation. Try and find another counter-example.
>>
>> They *do* matter for both of the above.
>>
>> André
>
> Not in any of the scenarios that you have proposed.
Then you really aren't paying attention to what I wrote.
Given that you can't figure out whether the following matches your
'pattern' without actually looking to see what foo2()...foon() do:
void foo(void) {
foo2();
foo3();
foon();
foo();
}
You also can't figure out whether your H_Hat() matches a particular
pattern without also looking at what every function called by H_Hat
does. That includes Halts(). You can't skip over it in your traces.
Which means you can't ignore the conditional branches where Halts()
decides whether to continue with its simulation or not.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 10:07 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <RdOdnVxnDc8LAAf9nZ2dnUU78SfNnZ2d@giganews.com> |
| In reply to | #33353 |
On 5/11/2021 9:53 AM, André G. Isaak wrote:
> On 2021-05-11 07:18, olcott wrote:
>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>> On 2021-05-10 22:20, olcott wrote:
>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>
> <snip>
>
>>> You seem to be entirely missing my point. I am not arguing that your
>>> 'Halt Decider' isn't a UTM because it isn't a Turing Machine. I gave
>>> up on that long ago. I am pointing out that once you change your
>>> simulator/UTM to a Halt Decider, you need to stop referring to it as
>>> a simulator/UTM because it is now doing something else. And all your
>>> talk of 'infinitely nested simulations' no longer applies because you
>>> are no longer dealing with a simulator, but rather with something
>>> which includes code that can *stop* simulating, which a simulator
>>> cannot do.
>>>
>>
>> A halt decider that bases it halting decision on simulating its input
>> must stop simualting inputs that do not halt. Forbidding this as the
>> basis for saying that no halt decider can exist is like saying that no
>> halt decider that is not allowed to return a value exists therefore
>> halt deciders do not exist.
>
> What does any of the above have to do with my statement? I am not
> 'forbidding' anything. I am simply stating that a Halt Decider is not
> the same thing as a simulator even if it makes use of simulation, and
> that you need to keep your terminology straight.
>
OK.
> <snip>
>
>>>> There is no signals in the x86utm operating system.
>>>
>>> And how exactly does your x86utm prevent a program from throwing
>>> exceptions? You don't need support from the OS to implement throw and
>>> catch instructions.
>>>
>>
>> Exceptions do not physically exist. The x86utm OS is the whole
>> universe for the code that it simulates.
>
> I have no idea what this is supposed to mean. Exceptions exist in the
> same sense that for-loops or if-then-else statements exist. The OS
> doesn't get to decide which types of constructions a program uses.
>
The C++ exception is not implemented.
The only calls to an OS that are permitted are calls to x86utm.
>>>>> You can't just ignore function calls inside foo() anymore than you
>>>>> can ignore the call to Halts() inside H_Hat. Your pattern matcher
>>>>> needs to consider *all* of the code that is executed including code
>>>>> in any function call.
>>>>>
>>>>
>>>> Try and find another counter-example. That was a good one.
>>>
>>> foo2() could also simply change the value of the stack pointer so
>>> that the return from foo2() actually returns to foo()'s caller rather
>>> than to foo() itself. The point is that you can't simply ignore what
>>> goes on inside a function call. You can't evalute foo() without
>>> knowing what foo2() does. Similarly, you can't evaluate H_Hat without
>>> knowing what Halts() does.
>>>
>>
>> This would be a convoluted example of returning to the caller.
>
> Yes, but one that demonstrates that to match your 'infinite recursion'
> pattern you have to actually look inside all functions being called.
>
To meet your challenge and the more difficult challenge of Kaz I
reverted back to earlier non-halting criteria
Every simulation that would never stop unless Halts() stops it at some
point specifies infinite execution.
and then adapted by current criteria to recognize this cases of this
earlier criteria.
As long as Halts() behaves exactly like a simulator until criteria
(1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
meets the updated criteria.
> <snip>
>
>>>>> Of course conditional branches inside Halts() don't matter to the
>>>>> above example because the above foo() *doesn't* call Halts. H_Hat
>>>>> *does* call Halts.
>>>>>
>>>>
>>>> If they don't matter for infinite recursion then they don't matter
>>>> for infinitely nested simulation. Try and find another counter-example.
>>>
>>> They *do* matter for both of the above.
>>>
>>> André
>>
>> Not in any of the scenarios that you have proposed.
>
> Then you really aren't paying attention to what I wrote.
>
> Given that you can't figure out whether the following matches your
> 'pattern' without actually looking to see what foo2()...foon() do:
>
> void foo(void) {
> foo2();
> foo3();
> foon();
> foo();
> }
>
The updated X() criteria handles this:
As long as Halts() behaves exactly like a simulator until criteria
(1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
meets the updated criteria.
> You also can't figure out whether your H_Hat() matches a particular
> pattern without also looking at what every function called by H_Hat
> does. That includes Halts(). You can't skip over it in your traces.
> Which means you can't ignore the conditional branches where Halts()
> decides whether to continue with its simulation or not.
>
> André
>
>
We just had to tighten the X() criteria.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 20:25 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <OZidnXh-lPDfswb9nZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #33356 |
On 5/11/2021 8:01 PM, André G. Isaak wrote: > On 2021-05-11 18:13, olcott wrote: >> On 5/11/2021 6:36 PM, André G. Isaak wrote: >>> On 2021-05-11 16:37, olcott wrote: >>>> On 5/11/2021 5:27 PM, André G. Isaak wrote: >>>>> On 2021-05-11 14:15, olcott wrote: >>>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote: >>>> >>>>>> If we make sure to force halts to behave like a simulator then we >>>>>> are forbidding halts to be a decider. >>>>> >>>>> A program cannot be two different programs at once. Either your >>>>> program is a simulator or it is a decider. >>>>> >>>>>> Halts() is exactly a simulator until is has proof that its input >>>>>> would never stop unless Halts() stopped it. >>>>> >>>>> No. It isn't exactly a simulator, because for the above to make any >>>>> sort of sense it must be doing at least one thing which a simulator >>>>> does *not* do: it must be looking for that 'proof' that its input >>>>> would never stop. That involves tests. Tests entail conditional >>>>> branches. >>>>> >>>>> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in >>>>> turn runs makes a call to Halts() as part of its simulation (call >>>>> it 'simulated halts' to distinguish it from the outermost call), >>>>> your 'halt detection logic' must look inside this simulated halts, >>>>> and inside the new simulation of H_Hat(H_Hat) triggered by >>>>> simulated halts. All of those conditional branches associated with >>>>> your tests count as conditional branches intervening between two >>>>> calls to the same address. >>>>> >>>>>> Truism: >>>>>> Every simulation that would never stop unless Halts() stops it at >>>>>> some >>>>>> point specifies infinite execution. >>>>>> >>>>>>>> The first three criteria are the exactly same criteria that I >>>>>>>> have been referring to for many months (3 has been augmented) >>>>>>>> If the execution trace of function H_Hat() shows: >>>>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>>>> address of H_Hat() >>>>>>>> (2) with the same parameters to Halts() >>>>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>>>> H_Hat() >>>>>>> >>>>>>> You can't mention H_Hat in your criteria. Halts() isn't >>>>>>> restricted to running on just one input. >>>>>>> >>>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non >>>>>>>> halting criteria: >>>>>>> >>>>>>>> Truism: >>>>>>>> Every simulation that would never stop unless Halts() stops it >>>>>>>> at some >>>>>>>> point specifies infinite execution. >>>>>>> >>>>>>> That is an entirely vacuous statement. Unless you can provide a >>>>>>> foolproof mechanism for correctly identifying such cases, the >>>>>>> above doesn't help you in the slightest. >>>>>>> >>>>>>> André >>>>>>> >>>>>>> >>>>>> >>>>>> If the execution trace of function H_Hat() shows: >>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>> address of H_Hat() >>>>>> (2) with the same parameters to Halts() >>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>> H_Hat() >>>>> >>>>> You've already been given numerous examples which show that the >>>>> above criteria don't work, at least not as you are applying them. >>>>> >>>>>> This is proof that Halts() must stop simulating H_Hat() thus >>>>>> matching the truism. >>>>> >>>>> Have you ever actually read a real proof? Even a really simple one? >>>>> >>>>> The above doesn't even remotely constitute a proof. Proofs have >>>>> premises along with arguments which show how those premises lead to >>>>> a conclusion. All you have above is claim that you can use the >>>>> three criteria above to somehow identify runaway recursion. You >>>>> have no argumentation to support that these criteria actually work, >>>>> and counterexamples have already been provided which demonstrate >>>>> that they do not. >>>>> >>>>> Argumentum ad repetitione does not constitute valid logic. >>>>> >>>>> André >>>>> >>>> >>>> Try and form a counter-example where the input to Halts() would halt >>>> if Halts() did not stop simulating it and the input does match >>>> (1)(2)(3). >>>> >>>> If the execution trace of function H_Hat() shows: >>>> (1) Halts() is called twice in sequence from the same machine >>>> address of H_Hat() >>>> (2) with the same parameters to Halts() >>>> (3) with no conditional branch or indexed jump instructions in H_Hat() >>> >>> >>> First, why are your criteria suddenly talking about Halts() and H_Hat >>> rather than variables? Your criteria need to be generic, not tied to >>> specific inputs. >>> >> >> I could say for every partial halt decider X() that >> that bases its halting decision on simulating its input Y() >> until criteria (1)(2)(3) are met by its input Y()... > > Not only could you do this, you should do this. > >>> Second, why don't you rewrite the above so it is actually clear what >>> they mean. I'll briefly outline some of the vagueness inherent in the >>> above. >>> >>> If the execution trace of function P() [i.e. the input to halts] shows: >>> >>> 1) some function X is called twice in sequence from the same machine >>> address of P. >>> >>> To make sense of the above, we need to know what 'in sequence' >>> actually means. We also need to know how the address space used in >>> your nested simulations actually works. >> >> The execution trace of N instructions of P repeats over and over >> with nothing inbetween. > > That's even less clear than the original. And it doesn't even mention > the function X which is supposedly being called 'in sequence'. > In sequence always refers to an execution trace of one instruction after another The following 16 instructions are a single contiguous execution trace of H_Hat() where 8 instructions are repeated until Halts stop simulating H_Hat(). Begin Local Halt Decider Simulation at Machine Address:b1f ...[00000b1f][002115e2][002115e6](01) 55 push ebp ...[00000b20][002115e2][002115e6](02) 8bec mov ebp,esp ...[00000b22][002115de][002015b2](01) 51 push ecx ...[00000b23][002115de][002015b2](03) 8b4508 mov eax,[ebp+08] ...[00000b26][002115da][00000b1f](01) 50 push eax ...[00000b27][002115da][00000b1f](03) 8b4d08 mov ecx,[ebp+08] ...[00000b2a][002115d6][00000b1f](01) 51 push ecx ...[00000b2b][002115d2][00000b30](05) e82ffeffff call 0000095f ...[00000b1f][002115e2][002115e6](01) 55 push ebp ...[00000b20][002115e2][002115e6](02) 8bec mov ebp,esp ...[00000b22][002115de][002015b2](01) 51 push ecx ...[00000b23][002115de][002015b2](03) 8b4508 mov eax,[ebp+08] ...[00000b26][002115da][00000b1f](01) 50 push eax ...[00000b27][002115da][00000b1f](03) 8b4d08 mov ecx,[ebp+08] ...[00000b2a][002115d6][00000b1f](01) 51 push ecx ...[00000b2b][002115d2][00000b30](05) e82ffeffff call 0000095f Local Halt Decider: Infinite Recursion Detected Simulation Stopped >>> When X simulates Y which in turn simulates X which in turn simulates >>> Y, how does your simulator actually distinguish between these various >>> levels of simulation if not by assigning them to entirely separate >>> virtual address spaces? >> >> The internals are irrelevant we are only examining the architectural >> design. > > Of course the internals are relevant. > Whatever internals encode the architectural design. > You claim that Halts doesn't actually run H_Hat, it *simulates* H_Hat. > That means that when H_Hat makes a call to Halts() it isn't actually > calling the same function as the main Halts(); rather it calls a > *simulated* version of this function. A call to a function is different > from a simulation of that function, so how on earth are they going to > end up having the same address? And the next call to Halts() will be a > simulation of a simulation, so it will be distinct from either of the > first two calls. > In a networking environment whenever code is shared with multiple concurrent users there is only one copy of the actual code. > Until you clarify how your 'simulator' actually works, I can't see how > you can possibly claim that the same function is *ever* called from the > same machine address in Halts(H_Hat, H_Hat). > It might have been back in the original CGI protocol days that multiple instances of code were loaded, not since then s far as I know. >>> >>> (2) with the same parameters to some function X() >>> >>> What does 'same parameters' mean exactly? Since your Halts and H_Hat >>> both take pointers as parameters does this mean that the same >>> addresses are being passed each time, >> >> Yes > > >>> or does it mean that the actual data pointed to is identical in both >>> instances? >>> >>> (3) with no conditional branch or indexed instructions in P() >>> >>> What does this mean? Do you really mean 'in P()' or do you mean >>> 'between the two calls to some function X'?. >> >> The entire sequence of N instructions of P that repeats over and over >> has no conditional branch instructions. > > And what does 'sequence' mean? Does this refer to the sequence in which > instructions occur in memory, or the sequence in which instructions are > actually executed? I have always been talking about an execution trace of one instruction after another. > > André > >>> >>> We can't meaningfully talk about these until you turn them into >>> something unambiguous. In all your past attempts, the description of >>> what you claim to be doing don't match your actual traces. >>> >>> André >>> >> >> Sure. >> > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 13:09 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7ekoo$eel$1@dont-email.me> |
| In reply to | #33356 |
On 2021-05-11 09:07, olcott wrote:
> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>> On 2021-05-11 07:18, olcott wrote:
>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>> On 2021-05-10 22:20, olcott wrote:
>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>
>> <snip>
>>
>>>> You seem to be entirely missing my point. I am not arguing that your
>>>> 'Halt Decider' isn't a UTM because it isn't a Turing Machine. I gave
>>>> up on that long ago. I am pointing out that once you change your
>>>> simulator/UTM to a Halt Decider, you need to stop referring to it as
>>>> a simulator/UTM because it is now doing something else. And all your
>>>> talk of 'infinitely nested simulations' no longer applies because
>>>> you are no longer dealing with a simulator, but rather with
>>>> something which includes code that can *stop* simulating, which a
>>>> simulator cannot do.
>>>>
>>>
>>> A halt decider that bases it halting decision on simulating its input
>>> must stop simualting inputs that do not halt. Forbidding this as the
>>> basis for saying that no halt decider can exist is like saying that
>>> no halt decider that is not allowed to return a value exists
>>> therefore halt deciders do not exist.
>>
>> What does any of the above have to do with my statement? I am not
>> 'forbidding' anything. I am simply stating that a Halt Decider is not
>> the same thing as a simulator even if it makes use of simulation, and
>> that you need to keep your terminology straight.
>>
>
> OK.
>
>> <snip>
>>
>>>>> There is no signals in the x86utm operating system.
>>>>
>>>> And how exactly does your x86utm prevent a program from throwing
>>>> exceptions? You don't need support from the OS to implement throw
>>>> and catch instructions.
>>>>
>>>
>>> Exceptions do not physically exist. The x86utm OS is the whole
>>> universe for the code that it simulates.
>>
>> I have no idea what this is supposed to mean. Exceptions exist in the
>> same sense that for-loops or if-then-else statements exist. The OS
>> doesn't get to decide which types of constructions a program uses.
>>
>
> The C++ exception is not implemented.
What do you mean by this? Not implemented by whom? Are you claiming that
you are only allowing your decider to accept programs which were written
with a defective version of C++?
> The only calls to an OS that are permitted are calls to x86utm.
C++ exceptions don't involve calls to an OS.
And note that I didn't specify anything about C++. Simple exception
handling can be implemented using setjmp and longjmp. And if you're now
going to claim that the standard C libraries 'are not implemented', both
setjmp and longjmp are trivial functions. Anyone can 'roll there own' in
absence of predefined library functions.
>>>>>> You can't just ignore function calls inside foo() anymore than you
>>>>>> can ignore the call to Halts() inside H_Hat. Your pattern matcher
>>>>>> needs to consider *all* of the code that is executed including
>>>>>> code in any function call.
>>>>>>
>>>>>
>>>>> Try and find another counter-example. That was a good one.
>>>>
>>>> foo2() could also simply change the value of the stack pointer so
>>>> that the return from foo2() actually returns to foo()'s caller
>>>> rather than to foo() itself. The point is that you can't simply
>>>> ignore what goes on inside a function call. You can't evalute foo()
>>>> without knowing what foo2() does. Similarly, you can't evaluate
>>>> H_Hat without knowing what Halts() does.
>>>>
>>>
>>> This would be a convoluted example of returning to the caller.
>>
>> Yes, but one that demonstrates that to match your 'infinite recursion'
>> pattern you have to actually look inside all functions being called.
>>
>
> To meet your challenge and the more difficult challenge of Kaz I
> reverted back to earlier non-halting criteria
>
> Every simulation that would never stop unless Halts() stops it at some
> point specifies infinite execution.
That's not a criterion. That's a statement of what it was that your
earlier criteria allegedly were supposed to identify. Now your left with
a desideratum in need of an actual criterion,
> and then adapted by current criteria to recognize this cases of this
> earlier criteria.
>
> As long as Halts() behaves exactly like a simulator until criteria
> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
> meets the updated criteria.
But Halts() doesn't behave exactly like a simulator. Not before these
criteria are met (it contains tests and conditional branches which a
simulator would lack), and certainly not afterwards (it stops
simulating, whereas an actual simulator cannot do this).
>> <snip>
>>
>>>>>> Of course conditional branches inside Halts() don't matter to the
>>>>>> above example because the above foo() *doesn't* call Halts. H_Hat
>>>>>> *does* call Halts.
>>>>>>
>>>>>
>>>>> If they don't matter for infinite recursion then they don't matter
>>>>> for infinitely nested simulation. Try and find another
>>>>> counter-example.
>>>>
>>>> They *do* matter for both of the above.
>>>>
>>>> André
>>>
>>> Not in any of the scenarios that you have proposed.
>>
>> Then you really aren't paying attention to what I wrote.
>>
>> Given that you can't figure out whether the following matches your
>> 'pattern' without actually looking to see what foo2()...foon() do:
>>
>> void foo(void) {
>> foo2();
>> foo3();
>> foon();
>> foo();
>> }
>>
>
> The updated X() criteria handles this:
>
> As long as Halts() behaves exactly like a simulator until criteria
> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
> meets the updated criteria.
How? And what relevance does H_Hat() have to determining whether foo()
meets this criterion?
André
>> You also can't figure out whether your H_Hat() matches a particular
>> pattern without also looking at what every function called by H_Hat
>> does. That includes Halts(). You can't skip over it in your traces.
>> Which means you can't ignore the conditional branches where Halts()
>> decides whether to continue with its simulation or not.
>>
>> André
>>
>>
>
> We just had to tighten the X() criteria.
>
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 14:36 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <iLmdnd_OYfAXQQf9nZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #33389 |
On 5/11/2021 2:09 PM, André G. Isaak wrote:
> On 2021-05-11 09:07, olcott wrote:
>> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>>> On 2021-05-11 07:18, olcott wrote:
>>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>>> On 2021-05-10 22:20, olcott wrote:
>>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>>
>>> <snip>
>>>
>>>>> You seem to be entirely missing my point. I am not arguing that
>>>>> your 'Halt Decider' isn't a UTM because it isn't a Turing Machine.
>>>>> I gave up on that long ago. I am pointing out that once you change
>>>>> your simulator/UTM to a Halt Decider, you need to stop referring to
>>>>> it as a simulator/UTM because it is now doing something else. And
>>>>> all your talk of 'infinitely nested simulations' no longer applies
>>>>> because you are no longer dealing with a simulator, but rather with
>>>>> something which includes code that can *stop* simulating, which a
>>>>> simulator cannot do.
>>>>>
>>>>
>>>> A halt decider that bases it halting decision on simulating its
>>>> input must stop simualting inputs that do not halt. Forbidding this
>>>> as the basis for saying that no halt decider can exist is like
>>>> saying that no halt decider that is not allowed to return a value
>>>> exists therefore halt deciders do not exist.
>>>
>>> What does any of the above have to do with my statement? I am not
>>> 'forbidding' anything. I am simply stating that a Halt Decider is not
>>> the same thing as a simulator even if it makes use of simulation, and
>>> that you need to keep your terminology straight.
>>>
>>
>> OK.
>>
>>> <snip>
>>>
>>>>>> There is no signals in the x86utm operating system.
>>>>>
>>>>> And how exactly does your x86utm prevent a program from throwing
>>>>> exceptions? You don't need support from the OS to implement throw
>>>>> and catch instructions.
>>>>>
>>>>
>>>> Exceptions do not physically exist. The x86utm OS is the whole
>>>> universe for the code that it simulates.
>>>
>>> I have no idea what this is supposed to mean. Exceptions exist in the
>>> same sense that for-loops or if-then-else statements exist. The OS
>>> doesn't get to decide which types of constructions a program uses.
>>>
>>
>> The C++ exception is not implemented.
>
> What do you mean by this? Not implemented by whom? Are you claiming that
> you are only allowing your decider to accept programs which were written
> with a defective version of C++?
>
No much worse than that the programs must be written in C.
>> The only calls to an OS that are permitted are calls to x86utm.
> C++ exceptions don't involve calls to an OS.
>
> And note that I didn't specify anything about C++. Simple exception
> handling can be implemented using setjmp and longjmp. And if you're now
> going to claim that the standard C libraries 'are not implemented', both
> setjmp and longjmp are trivial functions. Anyone can 'roll there own' in
> absence of predefined library functions.
>
>>>>>>> You can't just ignore function calls inside foo() anymore than
>>>>>>> you can ignore the call to Halts() inside H_Hat. Your pattern
>>>>>>> matcher needs to consider *all* of the code that is executed
>>>>>>> including code in any function call.
>>>>>>>
>>>>>>
>>>>>> Try and find another counter-example. That was a good one.
>>>>>
>>>>> foo2() could also simply change the value of the stack pointer so
>>>>> that the return from foo2() actually returns to foo()'s caller
>>>>> rather than to foo() itself. The point is that you can't simply
>>>>> ignore what goes on inside a function call. You can't evalute foo()
>>>>> without knowing what foo2() does. Similarly, you can't evaluate
>>>>> H_Hat without knowing what Halts() does.
>>>>>
>>>>
>>>> This would be a convoluted example of returning to the caller.
>>>
>>> Yes, but one that demonstrates that to match your 'infinite
>>> recursion' pattern you have to actually look inside all functions
>>> being called.
>>>
>>
>> To meet your challenge and the more difficult challenge of Kaz I
>> reverted back to earlier non-halting criteria
>>
>> Every simulation that would never stop unless Halts() stops it at some
>> point specifies infinite execution.
>
> That's not a criterion. That's a statement of what it was that your
> earlier criteria allegedly were supposed to identify. Now your left with
> a desideratum in need of an actual criterion,
>
>> and then adapted by current criteria to recognize this cases of this
>> earlier criteria.
>>
>> As long as Halts() behaves exactly like a simulator until criteria
>> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
>> meets the updated criteria.
>
> But Halts() doesn't behave exactly like a simulator. Not before these
> criteria are met (it contains tests and conditional branches which a
> simulator would lack), and certainly not afterwards (it stops
> simulating, whereas an actual simulator cannot do this).
>
>>> <snip>
>>>
>>>>>>> Of course conditional branches inside Halts() don't matter to the
>>>>>>> above example because the above foo() *doesn't* call Halts. H_Hat
>>>>>>> *does* call Halts.
>>>>>>>
>>>>>>
>>>>>> If they don't matter for infinite recursion then they don't matter
>>>>>> for infinitely nested simulation. Try and find another
>>>>>> counter-example.
>>>>>
>>>>> They *do* matter for both of the above.
>>>>>
>>>>> André
>>>>
>>>> Not in any of the scenarios that you have proposed.
>>>
>>> Then you really aren't paying attention to what I wrote.
>>>
>>> Given that you can't figure out whether the following matches your
>>> 'pattern' without actually looking to see what foo2()...foon() do:
>>>
>>> void foo(void) {
>>> foo2();
>>> foo3();
>>> foon();
>>> foo();
>>> }
>>>
>>
>> The updated X() criteria handles this:
>>
>> As long as Halts() behaves exactly like a simulator until criteria
>> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
>> meets the updated criteria.
>
> How? And what relevance does H_Hat() have to determining whether foo()
> meets this criterion?
>
foo() is no longer allowed only Halts() is allowed and Halts() is
defined to meet the above criteria.
We are no longer looking for infinite recursion we are only looking for
infinitely nested simulation by an input to Halts().
(New criteria 4) As long as Halts() behaves exactly like a simulator
until criteria (1)(2)(3) are met by H_Hat()
The first three criteria are the exactly same criteria that I have been
referring to for many months (3 has been augmented)
If the execution trace of function H_Hat() shows:
(1) Halts() is called twice in sequence from the same machine address of
H_Hat()
(2) with the same parameters to Halts()
(3) with no conditional branch or indexed jump instructions in H_Hat()
Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting
criteria:
Truism:
Every simulation that would never stop unless Halts() stops it at some
point specifies infinite execution.
> André
>
>>> You also can't figure out whether your H_Hat() matches a particular
>>> pattern without also looking at what every function called by H_Hat
>>> does. That includes Halts(). You can't skip over it in your traces.
>>> Which means you can't ignore the conditional branches where Halts()
>>> decides whether to continue with its simulation or not.
>>>
>>> André
>>>
>>>
>>
>> We just had to tighten the X() criteria.
>>
>
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 13:56 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7eni3$428$1@dont-email.me> |
| In reply to | #33394 |
On 2021-05-11 13:36, olcott wrote:
> On 5/11/2021 2:09 PM, André G. Isaak wrote:
>> On 2021-05-11 09:07, olcott wrote:
>>> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>>>> On 2021-05-11 07:18, olcott wrote:
>>>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>>>> On 2021-05-10 22:20, olcott wrote:
>>>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>>>
>>>> <snip>
>>>>
>>>>>> You seem to be entirely missing my point. I am not arguing that
>>>>>> your 'Halt Decider' isn't a UTM because it isn't a Turing Machine.
>>>>>> I gave up on that long ago. I am pointing out that once you change
>>>>>> your simulator/UTM to a Halt Decider, you need to stop referring
>>>>>> to it as a simulator/UTM because it is now doing something else.
>>>>>> And all your talk of 'infinitely nested simulations' no longer
>>>>>> applies because you are no longer dealing with a simulator, but
>>>>>> rather with something which includes code that can *stop*
>>>>>> simulating, which a simulator cannot do.
>>>>>>
>>>>>
>>>>> A halt decider that bases it halting decision on simulating its
>>>>> input must stop simualting inputs that do not halt. Forbidding this
>>>>> as the basis for saying that no halt decider can exist is like
>>>>> saying that no halt decider that is not allowed to return a value
>>>>> exists therefore halt deciders do not exist.
>>>>
>>>> What does any of the above have to do with my statement? I am not
>>>> 'forbidding' anything. I am simply stating that a Halt Decider is
>>>> not the same thing as a simulator even if it makes use of
>>>> simulation, and that you need to keep your terminology straight.
>>>>
>>>
>>> OK.
>>>
>>>> <snip>
>>>>
>>>>>>> There is no signals in the x86utm operating system.
>>>>>>
>>>>>> And how exactly does your x86utm prevent a program from throwing
>>>>>> exceptions? You don't need support from the OS to implement throw
>>>>>> and catch instructions.
>>>>>>
>>>>>
>>>>> Exceptions do not physically exist. The x86utm OS is the whole
>>>>> universe for the code that it simulates.
>>>>
>>>> I have no idea what this is supposed to mean. Exceptions exist in
>>>> the same sense that for-loops or if-then-else statements exist. The
>>>> OS doesn't get to decide which types of constructions a program uses.
>>>>
>>>
>>> The C++ exception is not implemented.
>>
>> What do you mean by this? Not implemented by whom? Are you claiming
>> that you are only allowing your decider to accept programs which were
>> written with a defective version of C++?
>>
>
> No much worse than that the programs must be written in C.
I still have no idea what you are trying to convey. As I pointed out,
the same problematic case could be written in vanilla C, so this
counterexample still shows the need to actually look *inside* every
function called.
>>> The only calls to an OS that are permitted are calls to x86utm.
>> C++ exceptions don't involve calls to an OS.
>>
>> And note that I didn't specify anything about C++. Simple exception
>> handling can be implemented using setjmp and longjmp. And if you're
>> now going to claim that the standard C libraries 'are not
>> implemented', both setjmp and longjmp are trivial functions. Anyone
>> can 'roll there own' in absence of predefined library functions.
>>
>>>>>>>> You can't just ignore function calls inside foo() anymore than
>>>>>>>> you can ignore the call to Halts() inside H_Hat. Your pattern
>>>>>>>> matcher needs to consider *all* of the code that is executed
>>>>>>>> including code in any function call.
>>>>>>>>
>>>>>>>
>>>>>>> Try and find another counter-example. That was a good one.
>>>>>>
>>>>>> foo2() could also simply change the value of the stack pointer so
>>>>>> that the return from foo2() actually returns to foo()'s caller
>>>>>> rather than to foo() itself. The point is that you can't simply
>>>>>> ignore what goes on inside a function call. You can't evalute
>>>>>> foo() without knowing what foo2() does. Similarly, you can't
>>>>>> evaluate H_Hat without knowing what Halts() does.
>>>>>>
>>>>>
>>>>> This would be a convoluted example of returning to the caller.
>>>>
>>>> Yes, but one that demonstrates that to match your 'infinite
>>>> recursion' pattern you have to actually look inside all functions
>>>> being called.
>>>>
>>>
>>> To meet your challenge and the more difficult challenge of Kaz I
>>> reverted back to earlier non-halting criteria
>>>
>>> Every simulation that would never stop unless Halts() stops it at some
>>> point specifies infinite execution.
>>
>> That's not a criterion. That's a statement of what it was that your
>> earlier criteria allegedly were supposed to identify. Now your left
>> with a desideratum in need of an actual criterion,
>>
>>> and then adapted by current criteria to recognize this cases of this
>>> earlier criteria.
>>>
>>> As long as Halts() behaves exactly like a simulator until criteria
>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
>>> meets the updated criteria.
>>
>> But Halts() doesn't behave exactly like a simulator. Not before these
>> criteria are met (it contains tests and conditional branches which a
>> simulator would lack), and certainly not afterwards (it stops
>> simulating, whereas an actual simulator cannot do this).
>>
>>>> <snip>
>>>>
>>>>>>>> Of course conditional branches inside Halts() don't matter to
>>>>>>>> the above example because the above foo() *doesn't* call Halts.
>>>>>>>> H_Hat *does* call Halts.
>>>>>>>>
>>>>>>>
>>>>>>> If they don't matter for infinite recursion then they don't
>>>>>>> matter for infinitely nested simulation. Try and find another
>>>>>>> counter-example.
>>>>>>
>>>>>> They *do* matter for both of the above.
>>>>>>
>>>>>> André
>>>>>
>>>>> Not in any of the scenarios that you have proposed.
>>>>
>>>> Then you really aren't paying attention to what I wrote.
>>>>
>>>> Given that you can't figure out whether the following matches your
>>>> 'pattern' without actually looking to see what foo2()...foon() do:
>>>>
>>>> void foo(void) {
>>>> foo2();
>>>> foo3();
>>>> foon();
>>>> foo();
>>>> }
>>>>
>>>
>>> The updated X() criteria handles this:
>>>
>>> As long as Halts() behaves exactly like a simulator until criteria
>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by Halts()
>>> meets the updated criteria.
>>
>> How? And what relevance does H_Hat() have to determining whether foo()
>> meets this criterion?
>>
>
> foo() is no longer allowed only Halts() is allowed and Halts() is
> defined to meet the above criteria.
You can't "disallow" a program.
I'm proposing foo() as a possible test case for Halts. If you run
Halts(foo, NIL), Halts can't determine whether this is actually
infinitely recursive (or being simulated in infinite recursion, if you
prefer) without actually looking *inside* each of the functions given above.
> We are no longer looking for infinite recursion we are only looking for
> infinitely nested simulation by an input to Halts().
>
>
> (New criteria 4) As long as Halts() behaves exactly like a simulator
> until criteria (1)(2)(3) are met by H_Hat()
And as I just pointed out in the the post you are replying to (the part
which you dishonestly snipped), Halts *doesn't* behave exactly like a
simulator, so the above is useless.
> The first three criteria are the exactly same criteria that I have been
> referring to for many months (3 has been augmented)
> If the execution trace of function H_Hat() shows:
> (1) Halts() is called twice in sequence from the same machine address of
> H_Hat()
> (2) with the same parameters to Halts()
> (3) with no conditional branch or indexed jump instructions in H_Hat()
You can't mention H_Hat in your criteria. Halts() isn't restricted to
running on just one input.
> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting
> criteria:
> Truism:
> Every simulation that would never stop unless Halts() stops it at some
> point specifies infinite execution.
That is an entirely vacuous statement. Unless you can provide a
foolproof mechanism for correctly identifying such cases, the above
doesn't help you in the slightest.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 15:15 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <CP6dnfoAcLE6eAf9nZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #33396 |
On 5/11/2021 2:56 PM, André G. Isaak wrote:
> On 2021-05-11 13:36, olcott wrote:
>> On 5/11/2021 2:09 PM, André G. Isaak wrote:
>>> On 2021-05-11 09:07, olcott wrote:
>>>> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>>>>> On 2021-05-11 07:18, olcott wrote:
>>>>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>>>>> On 2021-05-10 22:20, olcott wrote:
>>>>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>>>>
>>>>> <snip>
>>>>>
>>>>>>> You seem to be entirely missing my point. I am not arguing that
>>>>>>> your 'Halt Decider' isn't a UTM because it isn't a Turing
>>>>>>> Machine. I gave up on that long ago. I am pointing out that once
>>>>>>> you change your simulator/UTM to a Halt Decider, you need to stop
>>>>>>> referring to it as a simulator/UTM because it is now doing
>>>>>>> something else. And all your talk of 'infinitely nested
>>>>>>> simulations' no longer applies because you are no longer dealing
>>>>>>> with a simulator, but rather with something which includes code
>>>>>>> that can *stop* simulating, which a simulator cannot do.
>>>>>>>
>>>>>>
>>>>>> A halt decider that bases it halting decision on simulating its
>>>>>> input must stop simualting inputs that do not halt. Forbidding
>>>>>> this as the basis for saying that no halt decider can exist is
>>>>>> like saying that no halt decider that is not allowed to return a
>>>>>> value exists therefore halt deciders do not exist.
>>>>>
>>>>> What does any of the above have to do with my statement? I am not
>>>>> 'forbidding' anything. I am simply stating that a Halt Decider is
>>>>> not the same thing as a simulator even if it makes use of
>>>>> simulation, and that you need to keep your terminology straight.
>>>>>
>>>>
>>>> OK.
>>>>
>>>>> <snip>
>>>>>
>>>>>>>> There is no signals in the x86utm operating system.
>>>>>>>
>>>>>>> And how exactly does your x86utm prevent a program from throwing
>>>>>>> exceptions? You don't need support from the OS to implement throw
>>>>>>> and catch instructions.
>>>>>>>
>>>>>>
>>>>>> Exceptions do not physically exist. The x86utm OS is the whole
>>>>>> universe for the code that it simulates.
>>>>>
>>>>> I have no idea what this is supposed to mean. Exceptions exist in
>>>>> the same sense that for-loops or if-then-else statements exist. The
>>>>> OS doesn't get to decide which types of constructions a program uses.
>>>>>
>>>>
>>>> The C++ exception is not implemented.
>>>
>>> What do you mean by this? Not implemented by whom? Are you claiming
>>> that you are only allowing your decider to accept programs which were
>>> written with a defective version of C++?
>>>
>>
>> No much worse than that the programs must be written in C.
>
> I still have no idea what you are trying to convey. As I pointed out,
> the same problematic case could be written in vanilla C, so this
> counterexample still shows the need to actually look *inside* every
> function called.
>
>>>> The only calls to an OS that are permitted are calls to x86utm.
>>> C++ exceptions don't involve calls to an OS.
>>>
>>> And note that I didn't specify anything about C++. Simple exception
>>> handling can be implemented using setjmp and longjmp. And if you're
>>> now going to claim that the standard C libraries 'are not
>>> implemented', both setjmp and longjmp are trivial functions. Anyone
>>> can 'roll there own' in absence of predefined library functions.
>>>
>>>>>>>>> You can't just ignore function calls inside foo() anymore than
>>>>>>>>> you can ignore the call to Halts() inside H_Hat. Your pattern
>>>>>>>>> matcher needs to consider *all* of the code that is executed
>>>>>>>>> including code in any function call.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Try and find another counter-example. That was a good one.
>>>>>>>
>>>>>>> foo2() could also simply change the value of the stack pointer so
>>>>>>> that the return from foo2() actually returns to foo()'s caller
>>>>>>> rather than to foo() itself. The point is that you can't simply
>>>>>>> ignore what goes on inside a function call. You can't evalute
>>>>>>> foo() without knowing what foo2() does. Similarly, you can't
>>>>>>> evaluate H_Hat without knowing what Halts() does.
>>>>>>>
>>>>>>
>>>>>> This would be a convoluted example of returning to the caller.
>>>>>
>>>>> Yes, but one that demonstrates that to match your 'infinite
>>>>> recursion' pattern you have to actually look inside all functions
>>>>> being called.
>>>>>
>>>>
>>>> To meet your challenge and the more difficult challenge of Kaz I
>>>> reverted back to earlier non-halting criteria
>>>>
>>>> Every simulation that would never stop unless Halts() stops it at some
>>>> point specifies infinite execution.
>>>
>>> That's not a criterion. That's a statement of what it was that your
>>> earlier criteria allegedly were supposed to identify. Now your left
>>> with a desideratum in need of an actual criterion,
>>>
>>>> and then adapted by current criteria to recognize this cases of this
>>>> earlier criteria.
>>>>
>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>> Halts() meets the updated criteria.
>>>
>>> But Halts() doesn't behave exactly like a simulator. Not before these
>>> criteria are met (it contains tests and conditional branches which a
>>> simulator would lack), and certainly not afterwards (it stops
>>> simulating, whereas an actual simulator cannot do this).
>>>
>>>>> <snip>
>>>>>
>>>>>>>>> Of course conditional branches inside Halts() don't matter to
>>>>>>>>> the above example because the above foo() *doesn't* call Halts.
>>>>>>>>> H_Hat *does* call Halts.
>>>>>>>>>
>>>>>>>>
>>>>>>>> If they don't matter for infinite recursion then they don't
>>>>>>>> matter for infinitely nested simulation. Try and find another
>>>>>>>> counter-example.
>>>>>>>
>>>>>>> They *do* matter for both of the above.
>>>>>>>
>>>>>>> André
>>>>>>
>>>>>> Not in any of the scenarios that you have proposed.
>>>>>
>>>>> Then you really aren't paying attention to what I wrote.
>>>>>
>>>>> Given that you can't figure out whether the following matches your
>>>>> 'pattern' without actually looking to see what foo2()...foon() do:
>>>>>
>>>>> void foo(void) {
>>>>> foo2();
>>>>> foo3();
>>>>> foon();
>>>>> foo();
>>>>> }
>>>>>
>>>>
>>>> The updated X() criteria handles this:
>>>>
>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>> Halts() meets the updated criteria.
>>>
>>> How? And what relevance does H_Hat() have to determining whether
>>> foo() meets this criterion?
>>>
>>
>> foo() is no longer allowed only Halts() is allowed and Halts() is
>> defined to meet the above criteria.
>
> You can't "disallow" a program.
>
> I'm proposing foo() as a possible test case for Halts. If you run
> Halts(foo, NIL), Halts can't determine whether this is actually
> infinitely recursive (or being simulated in infinite recursion, if you
> prefer) without actually looking *inside* each of the functions given
> above.
>
>> We are no longer looking for infinite recursion we are only looking
>> for infinitely nested simulation by an input to Halts().
>>
>>
>> (New criteria 4) As long as Halts() behaves exactly like a simulator
>> until criteria (1)(2)(3) are met by H_Hat()
>
> And as I just pointed out in the the post you are replying to (the part
> which you dishonestly snipped), Halts *doesn't* behave exactly like a
> simulator, so the above is useless.
>
If we make sure to force halts to behave like a simulator then we are
forbidding halts to be a decider.
Halts() is exactly a simulator until is has proof that its input would
never stop unless Halts() stopped it.
Truism:
Every simulation that would never stop unless Halts() stops it at some
point specifies infinite execution.
>> The first three criteria are the exactly same criteria that I have
>> been referring to for many months (3 has been augmented)
>> If the execution trace of function H_Hat() shows:
>> (1) Halts() is called twice in sequence from the same machine address
>> of H_Hat()
>> (2) with the same parameters to Halts()
>> (3) with no conditional branch or indexed jump instructions in H_Hat()
>
> You can't mention H_Hat in your criteria. Halts() isn't restricted to
> running on just one input.
>
>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting
>> criteria:
>
>> Truism:
>> Every simulation that would never stop unless Halts() stops it at some
>> point specifies infinite execution.
>
> That is an entirely vacuous statement. Unless you can provide a
> foolproof mechanism for correctly identifying such cases, the above
> doesn't help you in the slightest.
>
> André
>
>
If the execution trace of function H_Hat() shows:
(1) Halts() is called twice in sequence from the same machine address of
H_Hat()
(2) with the same parameters to Halts()
(3) with no conditional branch or indexed jump instructions in H_Hat()
This is proof that Halts() must stop simulating H_Hat() thus matching
the truism.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-05-11 13:32 -0700 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7epl8$i97$1@gioia.aioe.org> |
| In reply to | #33399 |
On 5/11/2021 1:15 PM, olcott wrote:
> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>> On 2021-05-11 13:36, olcott wrote:
>>> On 5/11/2021 2:09 PM, André G. Isaak wrote:
>>>> On 2021-05-11 09:07, olcott wrote:
>>>>> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>>>>>> On 2021-05-11 07:18, olcott wrote:
>>>>>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>>>>>> On 2021-05-10 22:20, olcott wrote:
>>>>>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>> You seem to be entirely missing my point. I am not arguing that
>>>>>>>> your 'Halt Decider' isn't a UTM because it isn't a Turing
>>>>>>>> Machine. I gave up on that long ago. I am pointing out that once
>>>>>>>> you change your simulator/UTM to a Halt Decider, you need to
>>>>>>>> stop referring to it as a simulator/UTM because it is now doing
>>>>>>>> something else. And all your talk of 'infinitely nested
>>>>>>>> simulations' no longer applies because you are no longer dealing
>>>>>>>> with a simulator, but rather with something which includes code
>>>>>>>> that can *stop* simulating, which a simulator cannot do.
>>>>>>>>
>>>>>>>
>>>>>>> A halt decider that bases it halting decision on simulating its
>>>>>>> input must stop simualting inputs that do not halt. Forbidding
>>>>>>> this as the basis for saying that no halt decider can exist is
>>>>>>> like saying that no halt decider that is not allowed to return a
>>>>>>> value exists therefore halt deciders do not exist.
>>>>>>
>>>>>> What does any of the above have to do with my statement? I am not
>>>>>> 'forbidding' anything. I am simply stating that a Halt Decider is
>>>>>> not the same thing as a simulator even if it makes use of
>>>>>> simulation, and that you need to keep your terminology straight.
>>>>>>
>>>>>
>>>>> OK.
>>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>>> There is no signals in the x86utm operating system.
>>>>>>>>
>>>>>>>> And how exactly does your x86utm prevent a program from throwing
>>>>>>>> exceptions? You don't need support from the OS to implement
>>>>>>>> throw and catch instructions.
>>>>>>>>
>>>>>>>
>>>>>>> Exceptions do not physically exist. The x86utm OS is the whole
>>>>>>> universe for the code that it simulates.
>>>>>>
>>>>>> I have no idea what this is supposed to mean. Exceptions exist in
>>>>>> the same sense that for-loops or if-then-else statements exist.
>>>>>> The OS doesn't get to decide which types of constructions a
>>>>>> program uses.
>>>>>>
>>>>>
>>>>> The C++ exception is not implemented.
>>>>
>>>> What do you mean by this? Not implemented by whom? Are you claiming
>>>> that you are only allowing your decider to accept programs which
>>>> were written with a defective version of C++?
>>>>
>>>
>>> No much worse than that the programs must be written in C.
>>
>> I still have no idea what you are trying to convey. As I pointed out,
>> the same problematic case could be written in vanilla C, so this
>> counterexample still shows the need to actually look *inside* every
>> function called.
>>
>>>>> The only calls to an OS that are permitted are calls to x86utm.
>>>> C++ exceptions don't involve calls to an OS.
>>>>
>>>> And note that I didn't specify anything about C++. Simple exception
>>>> handling can be implemented using setjmp and longjmp. And if you're
>>>> now going to claim that the standard C libraries 'are not
>>>> implemented', both setjmp and longjmp are trivial functions. Anyone
>>>> can 'roll there own' in absence of predefined library functions.
>>>>
>>>>>>>>>> You can't just ignore function calls inside foo() anymore than
>>>>>>>>>> you can ignore the call to Halts() inside H_Hat. Your pattern
>>>>>>>>>> matcher needs to consider *all* of the code that is executed
>>>>>>>>>> including code in any function call.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Try and find another counter-example. That was a good one.
>>>>>>>>
>>>>>>>> foo2() could also simply change the value of the stack pointer
>>>>>>>> so that the return from foo2() actually returns to foo()'s
>>>>>>>> caller rather than to foo() itself. The point is that you can't
>>>>>>>> simply ignore what goes on inside a function call. You can't
>>>>>>>> evalute foo() without knowing what foo2() does. Similarly, you
>>>>>>>> can't evaluate H_Hat without knowing what Halts() does.
>>>>>>>>
>>>>>>>
>>>>>>> This would be a convoluted example of returning to the caller.
>>>>>>
>>>>>> Yes, but one that demonstrates that to match your 'infinite
>>>>>> recursion' pattern you have to actually look inside all functions
>>>>>> being called.
>>>>>>
>>>>>
>>>>> To meet your challenge and the more difficult challenge of Kaz I
>>>>> reverted back to earlier non-halting criteria
>>>>>
>>>>> Every simulation that would never stop unless Halts() stops it at some
>>>>> point specifies infinite execution.
>>>>
>>>> That's not a criterion. That's a statement of what it was that your
>>>> earlier criteria allegedly were supposed to identify. Now your left
>>>> with a desideratum in need of an actual criterion,
>>>>
>>>>> and then adapted by current criteria to recognize this cases of
>>>>> this earlier criteria.
>>>>>
>>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>>> Halts() meets the updated criteria.
>>>>
>>>> But Halts() doesn't behave exactly like a simulator. Not before
>>>> these criteria are met (it contains tests and conditional branches
>>>> which a simulator would lack), and certainly not afterwards (it
>>>> stops simulating, whereas an actual simulator cannot do this).
>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>>>> Of course conditional branches inside Halts() don't matter to
>>>>>>>>>> the above example because the above foo() *doesn't* call
>>>>>>>>>> Halts. H_Hat *does* call Halts.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> If they don't matter for infinite recursion then they don't
>>>>>>>>> matter for infinitely nested simulation. Try and find another
>>>>>>>>> counter-example.
>>>>>>>>
>>>>>>>> They *do* matter for both of the above.
>>>>>>>>
>>>>>>>> André
>>>>>>>
>>>>>>> Not in any of the scenarios that you have proposed.
>>>>>>
>>>>>> Then you really aren't paying attention to what I wrote.
>>>>>>
>>>>>> Given that you can't figure out whether the following matches your
>>>>>> 'pattern' without actually looking to see what foo2()...foon() do:
>>>>>>
>>>>>> void foo(void) {
>>>>>> foo2();
>>>>>> foo3();
>>>>>> foon();
>>>>>> foo();
>>>>>> }
>>>>>>
>>>>>
>>>>> The updated X() criteria handles this:
>>>>>
>>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>>> Halts() meets the updated criteria.
>>>>
>>>> How? And what relevance does H_Hat() have to determining whether
>>>> foo() meets this criterion?
>>>>
>>>
>>> foo() is no longer allowed only Halts() is allowed and Halts() is
>>> defined to meet the above criteria.
>>
>> You can't "disallow" a program.
>>
>> I'm proposing foo() as a possible test case for Halts. If you run
>> Halts(foo, NIL), Halts can't determine whether this is actually
>> infinitely recursive (or being simulated in infinite recursion, if you
>> prefer) without actually looking *inside* each of the functions given
>> above.
>>
>>> We are no longer looking for infinite recursion we are only looking
>>> for infinitely nested simulation by an input to Halts().
>>>
>>>
>>> (New criteria 4) As long as Halts() behaves exactly like a simulator
>>> until criteria (1)(2)(3) are met by H_Hat()
>>
>> And as I just pointed out in the the post you are replying to (the
>> part which you dishonestly snipped), Halts *doesn't* behave exactly
>> like a simulator, so the above is useless.
>>
>
> If we make sure to force halts to behave like a simulator then we are
> forbidding halts to be a decider.
>
> Halts() is exactly a simulator until is has proof that its input would
> never stop unless Halts() stopped it.
>
> Truism:
> Every simulation that would never stop unless Halts() stops it at some
> point specifies infinite execution.
>
>>> The first three criteria are the exactly same criteria that I have
>>> been referring to for many months (3 has been augmented)
>>> If the execution trace of function H_Hat() shows:
>>> (1) Halts() is called twice in sequence from the same machine address
>>> of H_Hat()
>>> (2) with the same parameters to Halts()
>>> (3) with no conditional branch or indexed jump instructions in H_Hat()
>>
>> You can't mention H_Hat in your criteria. Halts() isn't restricted to
>> running on just one input.
>>
>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting
>>> criteria:
>>
>>> Truism:
>>> Every simulation that would never stop unless Halts() stops it at some
>>> point specifies infinite execution.
>>
>> That is an entirely vacuous statement. Unless you can provide a
>> foolproof mechanism for correctly identifying such cases, the above
>> doesn't help you in the slightest.
>>
>> André
>>
>>
>
> If the execution trace of function H_Hat() shows:
> (1) Halts() is called twice in sequence from the same machine address of
> H_Hat()
> (2) with the same parameters to Halts()
> (3) with no conditional branch or indexed jump instructions in H_Hat()
>
> This is proof that Halts() must stop simulating H_Hat() thus matching
> the truism.
>
Are you some sort of Bot? Tell the truth now. Is okay.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 16:27 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7f0cg$erp$1@dont-email.me> |
| In reply to | #33399 |
On 2021-05-11 14:15, olcott wrote:
> On 5/11/2021 2:56 PM, André G. Isaak wrote:
>> On 2021-05-11 13:36, olcott wrote:
>>> On 5/11/2021 2:09 PM, André G. Isaak wrote:
>>>> On 2021-05-11 09:07, olcott wrote:
>>>>> On 5/11/2021 9:53 AM, André G. Isaak wrote:
>>>>>> On 2021-05-11 07:18, olcott wrote:
>>>>>>> On 5/10/2021 11:33 PM, André G. Isaak wrote:
>>>>>>>> On 2021-05-10 22:20, olcott wrote:
>>>>>>>>> On 5/10/2021 10:53 PM, André G. Isaak wrote:
>>>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>> You seem to be entirely missing my point. I am not arguing that
>>>>>>>> your 'Halt Decider' isn't a UTM because it isn't a Turing
>>>>>>>> Machine. I gave up on that long ago. I am pointing out that once
>>>>>>>> you change your simulator/UTM to a Halt Decider, you need to
>>>>>>>> stop referring to it as a simulator/UTM because it is now doing
>>>>>>>> something else. And all your talk of 'infinitely nested
>>>>>>>> simulations' no longer applies because you are no longer dealing
>>>>>>>> with a simulator, but rather with something which includes code
>>>>>>>> that can *stop* simulating, which a simulator cannot do.
>>>>>>>>
>>>>>>>
>>>>>>> A halt decider that bases it halting decision on simulating its
>>>>>>> input must stop simualting inputs that do not halt. Forbidding
>>>>>>> this as the basis for saying that no halt decider can exist is
>>>>>>> like saying that no halt decider that is not allowed to return a
>>>>>>> value exists therefore halt deciders do not exist.
>>>>>>
>>>>>> What does any of the above have to do with my statement? I am not
>>>>>> 'forbidding' anything. I am simply stating that a Halt Decider is
>>>>>> not the same thing as a simulator even if it makes use of
>>>>>> simulation, and that you need to keep your terminology straight.
>>>>>>
>>>>>
>>>>> OK.
>>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>>> There is no signals in the x86utm operating system.
>>>>>>>>
>>>>>>>> And how exactly does your x86utm prevent a program from throwing
>>>>>>>> exceptions? You don't need support from the OS to implement
>>>>>>>> throw and catch instructions.
>>>>>>>>
>>>>>>>
>>>>>>> Exceptions do not physically exist. The x86utm OS is the whole
>>>>>>> universe for the code that it simulates.
>>>>>>
>>>>>> I have no idea what this is supposed to mean. Exceptions exist in
>>>>>> the same sense that for-loops or if-then-else statements exist.
>>>>>> The OS doesn't get to decide which types of constructions a
>>>>>> program uses.
>>>>>>
>>>>>
>>>>> The C++ exception is not implemented.
>>>>
>>>> What do you mean by this? Not implemented by whom? Are you claiming
>>>> that you are only allowing your decider to accept programs which
>>>> were written with a defective version of C++?
>>>>
>>>
>>> No much worse than that the programs must be written in C.
>>
>> I still have no idea what you are trying to convey. As I pointed out,
>> the same problematic case could be written in vanilla C, so this
>> counterexample still shows the need to actually look *inside* every
>> function called.
You glossed over the above. Are you now in agreement that the example I
gave was legitimate?
>>>>> The only calls to an OS that are permitted are calls to x86utm.
>>>> C++ exceptions don't involve calls to an OS.
>>>>
>>>> And note that I didn't specify anything about C++. Simple exception
>>>> handling can be implemented using setjmp and longjmp. And if you're
>>>> now going to claim that the standard C libraries 'are not
>>>> implemented', both setjmp and longjmp are trivial functions. Anyone
>>>> can 'roll there own' in absence of predefined library functions.
>>>>
>>>>>>>>>> You can't just ignore function calls inside foo() anymore than
>>>>>>>>>> you can ignore the call to Halts() inside H_Hat. Your pattern
>>>>>>>>>> matcher needs to consider *all* of the code that is executed
>>>>>>>>>> including code in any function call.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Try and find another counter-example. That was a good one.
>>>>>>>>
>>>>>>>> foo2() could also simply change the value of the stack pointer
>>>>>>>> so that the return from foo2() actually returns to foo()'s
>>>>>>>> caller rather than to foo() itself. The point is that you can't
>>>>>>>> simply ignore what goes on inside a function call. You can't
>>>>>>>> evalute foo() without knowing what foo2() does. Similarly, you
>>>>>>>> can't evaluate H_Hat without knowing what Halts() does.
>>>>>>>>
>>>>>>>
>>>>>>> This would be a convoluted example of returning to the caller.
>>>>>>
>>>>>> Yes, but one that demonstrates that to match your 'infinite
>>>>>> recursion' pattern you have to actually look inside all functions
>>>>>> being called.
>>>>>>
>>>>>
>>>>> To meet your challenge and the more difficult challenge of Kaz I
>>>>> reverted back to earlier non-halting criteria
>>>>>
>>>>> Every simulation that would never stop unless Halts() stops it at some
>>>>> point specifies infinite execution.
>>>>
>>>> That's not a criterion. That's a statement of what it was that your
>>>> earlier criteria allegedly were supposed to identify. Now your left
>>>> with a desideratum in need of an actual criterion,
>>>>
>>>>> and then adapted by current criteria to recognize this cases of
>>>>> this earlier criteria.
>>>>>
>>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>>> Halts() meets the updated criteria.
>>>>
>>>> But Halts() doesn't behave exactly like a simulator. Not before
>>>> these criteria are met (it contains tests and conditional branches
>>>> which a simulator would lack), and certainly not afterwards (it
>>>> stops simulating, whereas an actual simulator cannot do this).
>>>>
>>>>>> <snip>
>>>>>>
>>>>>>>>>> Of course conditional branches inside Halts() don't matter to
>>>>>>>>>> the above example because the above foo() *doesn't* call
>>>>>>>>>> Halts. H_Hat *does* call Halts.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> If they don't matter for infinite recursion then they don't
>>>>>>>>> matter for infinitely nested simulation. Try and find another
>>>>>>>>> counter-example.
>>>>>>>>
>>>>>>>> They *do* matter for both of the above.
>>>>>>>>
>>>>>>>> André
>>>>>>>
>>>>>>> Not in any of the scenarios that you have proposed.
>>>>>>
>>>>>> Then you really aren't paying attention to what I wrote.
>>>>>>
>>>>>> Given that you can't figure out whether the following matches your
>>>>>> 'pattern' without actually looking to see what foo2()...foon() do:
>>>>>>
>>>>>> void foo(void) {
>>>>>> foo2();
>>>>>> foo3();
>>>>>> foon();
>>>>>> foo();
>>>>>> }
>>>>>>
>>>>>
>>>>> The updated X() criteria handles this:
>>>>>
>>>>> As long as Halts() behaves exactly like a simulator until criteria
>>>>> (1)(2)(3) are met by H_Hat() then the non-halting decision by
>>>>> Halts() meets the updated criteria.
>>>>
>>>> How? And what relevance does H_Hat() have to determining whether
>>>> foo() meets this criterion?
>>>>
>>>
>>> foo() is no longer allowed only Halts() is allowed and Halts() is
>>> defined to meet the above criteria.
>>
>> You can't "disallow" a program.
>>
>> I'm proposing foo() as a possible test case for Halts. If you run
>> Halts(foo, NIL), Halts can't determine whether this is actually
>> infinitely recursive (or being simulated in infinite recursion, if you
>> prefer) without actually looking *inside* each of the functions given
>> above.
>>
>>> We are no longer looking for infinite recursion we are only looking
>>> for infinitely nested simulation by an input to Halts().
>>>
>>>
>>> (New criteria 4) As long as Halts() behaves exactly like a simulator
>>> until criteria (1)(2)(3) are met by H_Hat()
>>
>> And as I just pointed out in the the post you are replying to (the
>> part which you dishonestly snipped), Halts *doesn't* behave exactly
>> like a simulator, so the above is useless.
>>
>
> If we make sure to force halts to behave like a simulator then we are
> forbidding halts to be a decider.
A program cannot be two different programs at once. Either your program
is a simulator or it is a decider.
> Halts() is exactly a simulator until is has proof that its input would
> never stop unless Halts() stopped it.
No. It isn't exactly a simulator, because for the above to make any sort
of sense it must be doing at least one thing which a simulator does
*not* do: it must be looking for that 'proof' that its input would never
stop. That involves tests. Tests entail conditional branches.
Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in turn
runs makes a call to Halts() as part of its simulation (call it
'simulated halts' to distinguish it from the outermost call), your 'halt
detection logic' must look inside this simulated halts, and inside the
new simulation of H_Hat(H_Hat) triggered by simulated halts. All of
those conditional branches associated with your tests count as
conditional branches intervening between two calls to the same address.
> Truism:
> Every simulation that would never stop unless Halts() stops it at some
> point specifies infinite execution.
>
>>> The first three criteria are the exactly same criteria that I have
>>> been referring to for many months (3 has been augmented)
>>> If the execution trace of function H_Hat() shows:
>>> (1) Halts() is called twice in sequence from the same machine address
>>> of H_Hat()
>>> (2) with the same parameters to Halts()
>>> (3) with no conditional branch or indexed jump instructions in H_Hat()
>>
>> You can't mention H_Hat in your criteria. Halts() isn't restricted to
>> running on just one input.
>>
>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting
>>> criteria:
>>
>>> Truism:
>>> Every simulation that would never stop unless Halts() stops it at some
>>> point specifies infinite execution.
>>
>> That is an entirely vacuous statement. Unless you can provide a
>> foolproof mechanism for correctly identifying such cases, the above
>> doesn't help you in the slightest.
>>
>> André
>>
>>
>
> If the execution trace of function H_Hat() shows:
> (1) Halts() is called twice in sequence from the same machine address of
> H_Hat()
> (2) with the same parameters to Halts()
> (3) with no conditional branch or indexed jump instructions in H_Hat()
You've already been given numerous examples which show that the above
criteria don't work, at least not as you are applying them.
> This is proof that Halts() must stop simulating H_Hat() thus matching
> the truism.
Have you ever actually read a real proof? Even a really simple one?
The above doesn't even remotely constitute a proof. Proofs have premises
along with arguments which show how those premises lead to a conclusion.
All you have above is claim that you can use the three criteria above to
somehow identify runaway recursion. You have no argumentation to support
that these criteria actually work, and counterexamples have already been
provided which demonstrate that they do not.
Argumentum ad repetitione does not constitute valid logic.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 17:37 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <RpKdnSlAoNyQmgb9nZ2dnUU78LXNnZ2d@giganews.com> |
| In reply to | #33406 |
On 5/11/2021 5:27 PM, André G. Isaak wrote: > On 2021-05-11 14:15, olcott wrote: >> On 5/11/2021 2:56 PM, André G. Isaak wrote: >> If we make sure to force halts to behave like a simulator then we are >> forbidding halts to be a decider. > > A program cannot be two different programs at once. Either your program > is a simulator or it is a decider. > >> Halts() is exactly a simulator until is has proof that its input would >> never stop unless Halts() stopped it. > > No. It isn't exactly a simulator, because for the above to make any sort > of sense it must be doing at least one thing which a simulator does > *not* do: it must be looking for that 'proof' that its input would never > stop. That involves tests. Tests entail conditional branches. > > Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in turn > runs makes a call to Halts() as part of its simulation (call it > 'simulated halts' to distinguish it from the outermost call), your 'halt > detection logic' must look inside this simulated halts, and inside the > new simulation of H_Hat(H_Hat) triggered by simulated halts. All of > those conditional branches associated with your tests count as > conditional branches intervening between two calls to the same address. > >> Truism: >> Every simulation that would never stop unless Halts() stops it at some >> point specifies infinite execution. >> >>>> The first three criteria are the exactly same criteria that I have >>>> been referring to for many months (3 has been augmented) >>>> If the execution trace of function H_Hat() shows: >>>> (1) Halts() is called twice in sequence from the same machine >>>> address of H_Hat() >>>> (2) with the same parameters to Halts() >>>> (3) with no conditional branch or indexed jump instructions in H_Hat() >>> >>> You can't mention H_Hat in your criteria. Halts() isn't restricted to >>> running on just one input. >>> >>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non halting >>>> criteria: >>> >>>> Truism: >>>> Every simulation that would never stop unless Halts() stops it at some >>>> point specifies infinite execution. >>> >>> That is an entirely vacuous statement. Unless you can provide a >>> foolproof mechanism for correctly identifying such cases, the above >>> doesn't help you in the slightest. >>> >>> André >>> >>> >> >> If the execution trace of function H_Hat() shows: >> (1) Halts() is called twice in sequence from the same machine address >> of H_Hat() >> (2) with the same parameters to Halts() >> (3) with no conditional branch or indexed jump instructions in H_Hat() > > You've already been given numerous examples which show that the above > criteria don't work, at least not as you are applying them. > >> This is proof that Halts() must stop simulating H_Hat() thus matching >> the truism. > > Have you ever actually read a real proof? Even a really simple one? > > The above doesn't even remotely constitute a proof. Proofs have premises > along with arguments which show how those premises lead to a conclusion. > All you have above is claim that you can use the three criteria above to > somehow identify runaway recursion. You have no argumentation to support > that these criteria actually work, and counterexamples have already been > provided which demonstrate that they do not. > > Argumentum ad repetitione does not constitute valid logic. > > André > Try and form a counter-example where the input to Halts() would halt if Halts() did not stop simulating it and the input does match (1)(2)(3). If the execution trace of function H_Hat() shows: (1) Halts() is called twice in sequence from the same machine address of H_Hat() (2) with the same parameters to Halts() (3) with no conditional branch or indexed jump instructions in H_Hat() -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 17:36 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7f4ds$slr$1@dont-email.me> |
| In reply to | #33407 |
On 2021-05-11 16:37, olcott wrote: > On 5/11/2021 5:27 PM, André G. Isaak wrote: >> On 2021-05-11 14:15, olcott wrote: >>> On 5/11/2021 2:56 PM, André G. Isaak wrote: > >>> If we make sure to force halts to behave like a simulator then we are >>> forbidding halts to be a decider. >> >> A program cannot be two different programs at once. Either your >> program is a simulator or it is a decider. >> >>> Halts() is exactly a simulator until is has proof that its input >>> would never stop unless Halts() stopped it. >> >> No. It isn't exactly a simulator, because for the above to make any >> sort of sense it must be doing at least one thing which a simulator >> does *not* do: it must be looking for that 'proof' that its input >> would never stop. That involves tests. Tests entail conditional branches. >> >> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in >> turn runs makes a call to Halts() as part of its simulation (call it >> 'simulated halts' to distinguish it from the outermost call), your >> 'halt detection logic' must look inside this simulated halts, and >> inside the new simulation of H_Hat(H_Hat) triggered by simulated >> halts. All of those conditional branches associated with your tests >> count as conditional branches intervening between two calls to the >> same address. >> >>> Truism: >>> Every simulation that would never stop unless Halts() stops it at some >>> point specifies infinite execution. >>> >>>>> The first three criteria are the exactly same criteria that I have >>>>> been referring to for many months (3 has been augmented) >>>>> If the execution trace of function H_Hat() shows: >>>>> (1) Halts() is called twice in sequence from the same machine >>>>> address of H_Hat() >>>>> (2) with the same parameters to Halts() >>>>> (3) with no conditional branch or indexed jump instructions in H_Hat() >>>> >>>> You can't mention H_Hat in your criteria. Halts() isn't restricted >>>> to running on just one input. >>>> >>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non >>>>> halting criteria: >>>> >>>>> Truism: >>>>> Every simulation that would never stop unless Halts() stops it at some >>>>> point specifies infinite execution. >>>> >>>> That is an entirely vacuous statement. Unless you can provide a >>>> foolproof mechanism for correctly identifying such cases, the above >>>> doesn't help you in the slightest. >>>> >>>> André >>>> >>>> >>> >>> If the execution trace of function H_Hat() shows: >>> (1) Halts() is called twice in sequence from the same machine address >>> of H_Hat() >>> (2) with the same parameters to Halts() >>> (3) with no conditional branch or indexed jump instructions in H_Hat() >> >> You've already been given numerous examples which show that the above >> criteria don't work, at least not as you are applying them. >> >>> This is proof that Halts() must stop simulating H_Hat() thus matching >>> the truism. >> >> Have you ever actually read a real proof? Even a really simple one? >> >> The above doesn't even remotely constitute a proof. Proofs have >> premises along with arguments which show how those premises lead to a >> conclusion. All you have above is claim that you can use the three >> criteria above to somehow identify runaway recursion. You have no >> argumentation to support that these criteria actually work, and >> counterexamples have already been provided which demonstrate that they >> do not. >> >> Argumentum ad repetitione does not constitute valid logic. >> >> André >> > > Try and form a counter-example where the input to Halts() would halt if > Halts() did not stop simulating it and the input does match (1)(2)(3). > > If the execution trace of function H_Hat() shows: > (1) Halts() is called twice in sequence from the same machine address of > H_Hat() > (2) with the same parameters to Halts() > (3) with no conditional branch or indexed jump instructions in H_Hat() First, why are your criteria suddenly talking about Halts() and H_Hat rather than variables? Your criteria need to be generic, not tied to specific inputs. Second, why don't you rewrite the above so it is actually clear what they mean. I'll briefly outline some of the vagueness inherent in the above. If the execution trace of function P() [i.e. the input to halts] shows: 1) some function X is called twice in sequence from the same machine address of P. To make sense of the above, we need to know what 'in sequence' actually means. We also need to know how the address space used in your nested simulations actually works. When X simulates Y which in turn simulates X which in turn simulates Y, how does your simulator actually distinguish between these various levels of simulation if not by assigning them to entirely separate virtual address spaces? (2) with the same parameters to some function X() What does 'same parameters' mean exactly? Since your Halts and H_Hat both take pointers as parameters does this mean that the same addresses are being passed each time, or does it mean that the actual data pointed to is identical in both instances? (3) with no conditional branch or indexed instructions in P() What does this mean? Do you really mean 'in P()' or do you mean 'between the two calls to some function X'?. We can't meaningfully talk about these until you turn them into something unambiguous. In all your past attempts, the description of what you claim to be doing don't match your actual traces. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-11 19:13 -0500 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <ecGdna-QhPrygAb9nZ2dnUU7-QXNnZ2d@giganews.com> |
| In reply to | #33411 |
On 5/11/2021 6:36 PM, André G. Isaak wrote: > On 2021-05-11 16:37, olcott wrote: >> On 5/11/2021 5:27 PM, André G. Isaak wrote: >>> On 2021-05-11 14:15, olcott wrote: >>>> On 5/11/2021 2:56 PM, André G. Isaak wrote: >> >>>> If we make sure to force halts to behave like a simulator then we >>>> are forbidding halts to be a decider. >>> >>> A program cannot be two different programs at once. Either your >>> program is a simulator or it is a decider. >>> >>>> Halts() is exactly a simulator until is has proof that its input >>>> would never stop unless Halts() stopped it. >>> >>> No. It isn't exactly a simulator, because for the above to make any >>> sort of sense it must be doing at least one thing which a simulator >>> does *not* do: it must be looking for that 'proof' that its input >>> would never stop. That involves tests. Tests entail conditional >>> branches. >>> >>> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in >>> turn runs makes a call to Halts() as part of its simulation (call it >>> 'simulated halts' to distinguish it from the outermost call), your >>> 'halt detection logic' must look inside this simulated halts, and >>> inside the new simulation of H_Hat(H_Hat) triggered by simulated >>> halts. All of those conditional branches associated with your tests >>> count as conditional branches intervening between two calls to the >>> same address. >>> >>>> Truism: >>>> Every simulation that would never stop unless Halts() stops it at some >>>> point specifies infinite execution. >>>> >>>>>> The first three criteria are the exactly same criteria that I have >>>>>> been referring to for many months (3 has been augmented) >>>>>> If the execution trace of function H_Hat() shows: >>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>> address of H_Hat() >>>>>> (2) with the same parameters to Halts() >>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>> H_Hat() >>>>> >>>>> You can't mention H_Hat in your criteria. Halts() isn't restricted >>>>> to running on just one input. >>>>> >>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non >>>>>> halting criteria: >>>>> >>>>>> Truism: >>>>>> Every simulation that would never stop unless Halts() stops it at >>>>>> some >>>>>> point specifies infinite execution. >>>>> >>>>> That is an entirely vacuous statement. Unless you can provide a >>>>> foolproof mechanism for correctly identifying such cases, the above >>>>> doesn't help you in the slightest. >>>>> >>>>> André >>>>> >>>>> >>>> >>>> If the execution trace of function H_Hat() shows: >>>> (1) Halts() is called twice in sequence from the same machine >>>> address of H_Hat() >>>> (2) with the same parameters to Halts() >>>> (3) with no conditional branch or indexed jump instructions in H_Hat() >>> >>> You've already been given numerous examples which show that the above >>> criteria don't work, at least not as you are applying them. >>> >>>> This is proof that Halts() must stop simulating H_Hat() thus >>>> matching the truism. >>> >>> Have you ever actually read a real proof? Even a really simple one? >>> >>> The above doesn't even remotely constitute a proof. Proofs have >>> premises along with arguments which show how those premises lead to a >>> conclusion. All you have above is claim that you can use the three >>> criteria above to somehow identify runaway recursion. You have no >>> argumentation to support that these criteria actually work, and >>> counterexamples have already been provided which demonstrate that >>> they do not. >>> >>> Argumentum ad repetitione does not constitute valid logic. >>> >>> André >>> >> >> Try and form a counter-example where the input to Halts() would halt >> if Halts() did not stop simulating it and the input does match (1)(2)(3). >> >> If the execution trace of function H_Hat() shows: >> (1) Halts() is called twice in sequence from the same machine address >> of H_Hat() >> (2) with the same parameters to Halts() >> (3) with no conditional branch or indexed jump instructions in H_Hat() > > > First, why are your criteria suddenly talking about Halts() and H_Hat > rather than variables? Your criteria need to be generic, not tied to > specific inputs. > I could say for every partial halt decider X() that that bases its halting decision on simulating its input Y() until criteria (1)(2)(3) are met by its input Y()... > Second, why don't you rewrite the above so it is actually clear what > they mean. I'll briefly outline some of the vagueness inherent in the > above. > > If the execution trace of function P() [i.e. the input to halts] shows: > > 1) some function X is called twice in sequence from the same machine > address of P. > > To make sense of the above, we need to know what 'in sequence' actually > means. We also need to know how the address space used in your nested > simulations actually works. The execution trace of N instructions of P repeats over and over with nothing inbetween. > When X simulates Y which in turn simulates X which in turn simulates Y, > how does your simulator actually distinguish between these various > levels of simulation if not by assigning them to entirely separate > virtual address spaces? The internals are irrelevant we are only examining the architectural design. > > (2) with the same parameters to some function X() > > What does 'same parameters' mean exactly? Since your Halts and H_Hat > both take pointers as parameters does this mean that the same addresses > are being passed each time, Yes > or does it mean that the actual data pointed > to is identical in both instances? > > (3) with no conditional branch or indexed instructions in P() > > What does this mean? Do you really mean 'in P()' or do you mean 'between > the two calls to some function X'?. The entire sequence of N instructions of P that repeats over and over has no conditional branch instructions. > > We can't meaningfully talk about these until you turn them into > something unambiguous. In all your past attempts, the description of > what you claim to be doing don't match your actual traces. > > André > Sure. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-05-11 19:01 -0600 |
| Subject | Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] |
| Message-ID | <s7f9dp$n24$1@dont-email.me> |
| In reply to | #33416 |
On 2021-05-11 18:13, olcott wrote: > On 5/11/2021 6:36 PM, André G. Isaak wrote: >> On 2021-05-11 16:37, olcott wrote: >>> On 5/11/2021 5:27 PM, André G. Isaak wrote: >>>> On 2021-05-11 14:15, olcott wrote: >>>>> On 5/11/2021 2:56 PM, André G. Isaak wrote: >>> >>>>> If we make sure to force halts to behave like a simulator then we >>>>> are forbidding halts to be a decider. >>>> >>>> A program cannot be two different programs at once. Either your >>>> program is a simulator or it is a decider. >>>> >>>>> Halts() is exactly a simulator until is has proof that its input >>>>> would never stop unless Halts() stopped it. >>>> >>>> No. It isn't exactly a simulator, because for the above to make any >>>> sort of sense it must be doing at least one thing which a simulator >>>> does *not* do: it must be looking for that 'proof' that its input >>>> would never stop. That involves tests. Tests entail conditional >>>> branches. >>>> >>>> Therefore, when Halts(H_Hat, H_Hat) simulates H_Hat(H_Hat) which in >>>> turn runs makes a call to Halts() as part of its simulation (call it >>>> 'simulated halts' to distinguish it from the outermost call), your >>>> 'halt detection logic' must look inside this simulated halts, and >>>> inside the new simulation of H_Hat(H_Hat) triggered by simulated >>>> halts. All of those conditional branches associated with your tests >>>> count as conditional branches intervening between two calls to the >>>> same address. >>>> >>>>> Truism: >>>>> Every simulation that would never stop unless Halts() stops it at some >>>>> point specifies infinite execution. >>>>> >>>>>>> The first three criteria are the exactly same criteria that I >>>>>>> have been referring to for many months (3 has been augmented) >>>>>>> If the execution trace of function H_Hat() shows: >>>>>>> (1) Halts() is called twice in sequence from the same machine >>>>>>> address of H_Hat() >>>>>>> (2) with the same parameters to Halts() >>>>>>> (3) with no conditional branch or indexed jump instructions in >>>>>>> H_Hat() >>>>>> >>>>>> You can't mention H_Hat in your criteria. Halts() isn't restricted >>>>>> to running on just one input. >>>>>> >>>>>>> Then Halts(H_Hat, H_Hat) == 0 meets the updated [Truism] non >>>>>>> halting criteria: >>>>>> >>>>>>> Truism: >>>>>>> Every simulation that would never stop unless Halts() stops it at >>>>>>> some >>>>>>> point specifies infinite execution. >>>>>> >>>>>> That is an entirely vacuous statement. Unless you can provide a >>>>>> foolproof mechanism for correctly identifying such cases, the >>>>>> above doesn't help you in the slightest. >>>>>> >>>>>> André >>>>>> >>>>>> >>>>> >>>>> If the execution trace of function H_Hat() shows: >>>>> (1) Halts() is called twice in sequence from the same machine >>>>> address of H_Hat() >>>>> (2) with the same parameters to Halts() >>>>> (3) with no conditional branch or indexed jump instructions in H_Hat() >>>> >>>> You've already been given numerous examples which show that the >>>> above criteria don't work, at least not as you are applying them. >>>> >>>>> This is proof that Halts() must stop simulating H_Hat() thus >>>>> matching the truism. >>>> >>>> Have you ever actually read a real proof? Even a really simple one? >>>> >>>> The above doesn't even remotely constitute a proof. Proofs have >>>> premises along with arguments which show how those premises lead to >>>> a conclusion. All you have above is claim that you can use the three >>>> criteria above to somehow identify runaway recursion. You have no >>>> argumentation to support that these criteria actually work, and >>>> counterexamples have already been provided which demonstrate that >>>> they do not. >>>> >>>> Argumentum ad repetitione does not constitute valid logic. >>>> >>>> André >>>> >>> >>> Try and form a counter-example where the input to Halts() would halt >>> if Halts() did not stop simulating it and the input does match >>> (1)(2)(3). >>> >>> If the execution trace of function H_Hat() shows: >>> (1) Halts() is called twice in sequence from the same machine address >>> of H_Hat() >>> (2) with the same parameters to Halts() >>> (3) with no conditional branch or indexed jump instructions in H_Hat() >> >> >> First, why are your criteria suddenly talking about Halts() and H_Hat >> rather than variables? Your criteria need to be generic, not tied to >> specific inputs. >> > > I could say for every partial halt decider X() that > that bases its halting decision on simulating its input Y() > until criteria (1)(2)(3) are met by its input Y()... Not only could you do this, you should do this. >> Second, why don't you rewrite the above so it is actually clear what >> they mean. I'll briefly outline some of the vagueness inherent in the >> above. >> >> If the execution trace of function P() [i.e. the input to halts] shows: >> >> 1) some function X is called twice in sequence from the same machine >> address of P. >> >> To make sense of the above, we need to know what 'in sequence' >> actually means. We also need to know how the address space used in >> your nested simulations actually works. > > The execution trace of N instructions of P repeats over and over > with nothing inbetween. That's even less clear than the original. And it doesn't even mention the function X which is supposedly being called 'in sequence'. >> When X simulates Y which in turn simulates X which in turn simulates >> Y, how does your simulator actually distinguish between these various >> levels of simulation if not by assigning them to entirely separate >> virtual address spaces? > > The internals are irrelevant we are only examining the architectural > design. Of course the internals are relevant. You claim that Halts doesn't actually run H_Hat, it *simulates* H_Hat. That means that when H_Hat makes a call to Halts() it isn't actually calling the same function as the main Halts(); rather it calls a *simulated* version of this function. A call to a function is different from a simulation of that function, so how on earth are they going to end up having the same address? And the next call to Halts() will be a simulation of a simulation, so it will be distinct from either of the first two calls. Until you clarify how your 'simulator' actually works, I can't see how you can possibly claim that the same function is *ever* called from the same machine address in Halts(H_Hat, H_Hat). >> >> (2) with the same parameters to some function X() >> >> What does 'same parameters' mean exactly? Since your Halts and H_Hat >> both take pointers as parameters does this mean that the same >> addresses are being passed each time, > > Yes > >> or does it mean that the actual data pointed to is identical in both >> instances? >> >> (3) with no conditional branch or indexed instructions in P() >> >> What does this mean? Do you really mean 'in P()' or do you mean >> 'between the two calls to some function X'?. > > The entire sequence of N instructions of P that repeats over and over > has no conditional branch instructions. And what does 'sequence' mean? Does this refer to the sequence in which instructions occur in memory, or the sequence in which instructions are actually executed? André >> >> We can't meaningfully talk about these until you turn them into >> something unambiguous. In all your past attempts, the description of >> what you claim to be doing don't match your actual traces. >> >> André >> > > Sure. > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
Page 28 of 50 — ← Prev page 1 … 26 27 [28] 29 30 … 50 Next page →
Back to top | Article view | comp.theory
csiph-web