Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #28134 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-02-26 13:53 -0600 |
| Last post | 2021-03-09 18:31 -0800 |
| Articles | 20 on this page of 736 — 18 participants |
Back to article view | Back to comp.theory
Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 13:53 -0600
Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-02-26 12:41 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 15:00 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 10:18 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 09:26 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 13:57 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 14:40 -0600
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-27 21:52 +0000
Re: Detecting infinite recursion Jeff Barnett <jbb@notatt.com> - 2021-02-27 15:10 -0700
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 16:12 -0600
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-27 22:42 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 18:37 -0600
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-28 11:46 +0000
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 21:43 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 20:59 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 22:30 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 22:10 -0600
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 14:24 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-28 08:34 -0600
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 16:26 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-28 10:34 -0600
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-28 17:20 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 13:08 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-02-28 20:15 +0000
Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 14:55 -0600
Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-01 02:30 +0000
Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 20:51 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 03:52 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-02-28 22:19 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-01 13:10 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 08:30 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-01 15:20 +0000
Re: Detecting infinite recursion (H_Hat is proved to be halting decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 09:41 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 08:24 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 17:06 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 16:52 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 11:30 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 18:25 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 12:47 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 14:29 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 15:17 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 16:31 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 15:50 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 17:54 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 17:46 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-01 19:54 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-01 19:39 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 14:22 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-01 22:42 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 17:00 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-02 01:00 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 19:31 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-02 02:22 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 21:05 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-01 21:32 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 02:34 -0800
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 08:45 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 10:55 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 09:58 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 12:01 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 11:42 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:05 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-03 14:54 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 12:41 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-03 21:13 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 15:37 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-02 12:02 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 09:29 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 00:53 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:02 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 01:26 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:35 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 01:52 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 20:14 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:49 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 21:31 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 23:12 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 22:30 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 07:49 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 11:44 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 12:08 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:35 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:42 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 16:59 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 18:23 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 17:34 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:36 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-03 18:45 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:40 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) olcott <NoOne@NoWhere.com> - 2021-03-02 19:43 -0600
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:19 -0500
Re: Detecting infinite recursion (H_Hat is proved to be decidable) om@iki.fi (Otto J. Makela) - 2021-03-03 14:52 +0200
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-03 13:52 +0000
Re: Detecting infinite recursion (H_Hat is proved to be decidable) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2021-02-28 21:51 -0800
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 11:30 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 10:43 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 14:38 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 15:30 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 17:33 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 16:40 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 18:08 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 17:37 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-01 19:22 -0500
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 21:19 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 20:36 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-02-27 22:01 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-27 21:30 -0600
Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-02-26 12:48 -0800
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-26 21:37 +0000
Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-02-26 15:26 -0800
Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-26 21:49 -0800
Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-26 21:56 -0800
Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-02-27 01:58 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-02-26 21:24 -0600
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-02-27 03:32 +0000
Re: Detecting infinite recursion Jeff Barnett <jbb@notatt.com> - 2021-02-26 21:32 -0700
Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-01 20:04 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-01 22:18 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 07:03 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 09:33 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:00 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 10:23 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:53 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:37 -0600
Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 09:43 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:57 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:16 -0500
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 12:57 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:12 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:40 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:51 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 16:00 -0500
Re: Detecting infinite recursion om@iki.fi (Otto J. Makela) - 2021-03-02 18:36 +0200
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 11:55 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 11:22 -0600
Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 17:46 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:00 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 14:15 -0500
Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 19:35 +0000
Re: Detecting infinite recursion R Kym Horsell <kym@kymhorsell.com> - 2021-03-02 19:37 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:58 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:50 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:50 -0600
Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 19:57 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:20 -0600
Re: Detecting infinite recursion Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2021-03-02 12:57 -0800
Re: Detecting infinite recursion gazelle@shell.xmission.com (Kenny McCormack) - 2021-03-03 02:17 +0000
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 13:20 -0500
Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-03-02 11:45 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 13:52 -0600
Re: Detecting infinite recursion Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-02 12:01 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:41 -0600
Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-02 21:01 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:11 -0600
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:19 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:15 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 16:38 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:44 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 19:48 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:25 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 20:40 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:57 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:03 -0600
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:05 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 22:29 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:33 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 22:54 -0500
Re: Detecting infinite recursion (halt decider spec) olcott <NoOne@NoWhere.com> - 2021-03-02 21:58 -0600
Re: Detecting infinite recursion (halt decider spec) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 23:24 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-02 22:49 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 08:07 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 09:26 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 12:35 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 12:13 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:27 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 16:34 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:59 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 23:30 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 18:05 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:39 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 18:46 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:19 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:23 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 19:45 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:56 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:15 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 02:32 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:48 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:27 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 21:38 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:58 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:10 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:25 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 16:34 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 11:45 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:31 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:50 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:43 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:01 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:04 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:50 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 09:44 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 12:03 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 09:09 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:36 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:19 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 10:25 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:45 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 21:16 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 15:31 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-06 13:58 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 09:01 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:12 -0500
Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 09:58 -0600
Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:33 -0500
Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 10:59 -0600
Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:10 -0500
Re: Detecting infinite recursion (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-06 14:40 -0600
Re: Detecting infinite recursion (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:28 -0500
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 16:52 -0600
Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 18:34 -0500
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 17:38 -0600
Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:10 -0500
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 18:27 -0600
Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:36 -0500
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 18:50 -0600
Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:34 -0500
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 20:36 -0600
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:05 -0500
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 21:18 -0600
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:53 -0500
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:01 -0600
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 08:35 -0500
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:30 -0800
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:49 -0500
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:37 -0800
Re: Detecting infinite recursion (deciding Simulate) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 12:01 +0000
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-08 18:01 -0800
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:12 -0500
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-08 18:03 -0800
Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 21:01 -0700
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:09 -0600
Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 21:23 -0700
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-06 22:27 -0600
Re: Detecting infinite recursion (deciding Simulate) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 23:56 -0700
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:35 -0800
Re: Detecting infinite recursion (deciding Simulate) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 05:46 +0000
Re: Detecting infinite recursion (deciding Simulate) olcott <NoOne@NoWhere.com> - 2021-03-07 00:17 -0600
Re: Detecting infinite recursion (deciding Simulate) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 08:59 -0500
Re: Detecting infinite recursion (deciding Simulate) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:35 -0800
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 00:57 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:11 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 01:41 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:50 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:53 +0000
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-05 13:39 -0800
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 15:55 -0600
Re: Detecting infinite recursion (halt deciding criteria) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-06 01:41 +0000
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 16:50 -0800
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 21:41 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 15:50 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 00:44 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 19:01 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:46 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:13 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 02:34 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 20:57 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 16:44 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 11:42 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 19:36 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 13:42 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 20:55 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:12 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 17:08 -0500
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:56 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 14:19 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 15:48 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:07 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 17:25 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:44 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 18:26 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:37 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 15:54 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:17 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 16:36 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:46 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 17:46 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:13 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 18:31 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:37 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 21:13 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:29 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 22:08 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 22:57 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 00:07 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-04 23:51 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:25 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 09:23 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 10:27 -0600
Re: Detecting infinite recursion (halt deciding criteria) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 12:26 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 13:47 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 15:20 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 19:07 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 20:48 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 20:01 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:21 -0500
Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-04 15:23 -0800
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 17:35 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 21:05 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 15:15 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 04:17 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:46 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 11:26 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:56 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 15:45 +0000
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 10:00 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:17 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 17:39 +0000
Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 11:47 -0600
Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 15:22 -0500
Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 14:40 -0600
Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 20:55 -0500
Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 00:53 +0000
Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-06 19:01 -0600
Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:36 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-05 12:43 -0800
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 14:59 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-05 13:33 -0800
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:01 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:08 -0700
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:32 -0700
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:41 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 18:47 -0700
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 19:59 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 20:11 -0700
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 21:28 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property André G. Isaak <agisaak@gm.invalid> - 2021-03-05 20:47 -0700
Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 22:12 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 21:39 -0700
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 23:17 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-05 22:31 -0700
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-05 23:35 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 02:36 -0800
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:37 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 08:16 -0700
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:32 -0600
Re: Deciding the [would-not-halt] property (identical functions) olcott <NoOne@NoWhere.com> - 2021-03-06 11:48 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:10 -0500
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:41 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:05 -0500
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:51 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) André G. Isaak <agisaak@gm.invalid> - 2021-03-06 08:09 -0700
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:28 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:05 -0500
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 08:39 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 10:08 -0500
Re: Deciding the [would-not-halt] property (André's ignorance) olcott <NoOne@NoWhere.com> - 2021-03-06 09:53 -0600
Re: Deciding the [would-not-halt] property (André's ignorance) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:16 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 23:52 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:02 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 21:00 -0500
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 23:59 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 18:23 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:17 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:33 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 11:54 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:08 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:14 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 14:44 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:34 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 16:56 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:26 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 18:34 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:56 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 20:10 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:10 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 21:23 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 23:05 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 22:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 20:27 -0800
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 09:11 -0500
Re: Detecting infinite recursion (halt deciding criteria) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-07 06:29 -0800
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 11:58 -0500
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 15:17 -0800
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-07 17:21 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 01:19 +0000
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 19:34 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:51 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:01 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:11 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:19 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:40 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:50 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:28 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:39 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:25 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 10:34 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:51 -0500
Re: Detecting infinite recursion (1931 Gödel) André G. Isaak <agisaak@gm.invalid> - 2021-03-07 20:32 -0700
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:48 -0600
Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 11:44 +0000
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:35 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:44 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:30 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 10:52 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 12:07 -0500
Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 02:24 +0000
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:28 -0600
Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 02:33 +0000
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 20:37 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:14 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:22 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 22:45 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-07 21:52 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 10:01 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:50 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:33 -0500
Re: Detecting infinite recursion (1931 Gödel) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:17 -0800
Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-08 12:34 +0000
Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 04:58 -0800
Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:11 -0800
Re: Detecting infinite recursion (1931 Gödel) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:28 -0800
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 09:26 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:34 -0500
Re: Detecting infinite recursion (1931 Gödel) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 16:54 +0000
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 11:12 -0600
Re: Detecting infinite recursion (1931 Gödel) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:48 +0000
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 12:21 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 13:43 -0500
Re: Detecting infinite recursion (1931 Gödel) olcott <NoOne@NoWhere.com> - 2021-03-08 13:49 -0600
Re: Detecting infinite recursion (1931 Gödel) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 15:19 -0500
Re: Detecting infinite recursion (Haskell Curry) olcott <NoOne@NoWhere.com> - 2021-03-08 20:38 -0600
Re: Detecting infinite recursion (Haskell Curry) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 18:55 -0800
Re: Detecting infinite recursion (1931 Gödel) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 00:30 +0000
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 20:59 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:34 +0000
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 11:30 +0000
Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-07 02:47 -0800
Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 09:27 -0600
Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 09:36 -0600
Re: Detecting infinite recursion (incorrect questions) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 21:04 -0500
Re: Detecting infinite recursion (incorrect questions) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:24 +0000
Re: Detecting infinite recursion (incorrect questions) olcott <NoOne@NoWhere.com> - 2021-03-07 20:32 -0600
Re: Detecting infinite recursion (incorrect questions) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:59 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 23:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:18 +0000
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-05 23:42 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 18:19 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 04:56 +0000
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 06:17 -0500
Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 05:05 -0800
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 08:48 -0600
Re: Detecting infinite recursion (halt deciding criteria) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-06 09:47 -0800
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:52 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 15:19 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 15:00 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 17:59 -0500
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 23:16 +0000
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 16:33 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:45 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 17:02 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 11:15 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 18:07 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:14 -0600
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:25 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 19:06 +0000
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 18:25 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 12:53 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 19:13 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 14:25 -0600
Re: Detecting infinite recursion (halt deciding criteria) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 21:00 +0000
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 15:35 -0600
Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-06 23:07 +0000
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 17:33 -0600
Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 03:34 +0000
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 21:40 -0600
Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-07 17:16 +0000
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-07 17:12 -0600
Re: Detecting infinite recursion (PDF) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:11 +0000
Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 20:17 -0600
Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 02:55 +0000
Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 21:06 -0600
Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 04:43 +0000
Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 22:51 -0600
Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-07 22:39 -0600
Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 04:55 +0000
Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 23:05 -0600
Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-07 23:20 -0600
Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 06:16 +0000
Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 06:13 +0000
Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-08 00:21 -0600
Re: Detecting infinite recursion (PDF) (last step?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 22:30 -0800
Re: Detecting infinite recursion (PDF) (last step?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 07:07 +0000
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 09:23 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:16 +0000
Re: Detecting infinite recursion (PDF) (agreement?) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-08 09:26 -0800
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 11:36 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 09:52 -0800
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 17:59 +0000
Re: Detecting infinite recursion (PDF) (agreement?) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 10:07 -0800
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:31 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 18:41 +0000
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:55 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 19:29 +0000
Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 14:50 -0500
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 14:02 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 20:52 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 15:15 -0600
Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 14:43 -0700
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 00:03 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 18:59 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 20:24 -0500
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 19:54 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 03:14 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:20 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:42 -0500
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:47 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:57 -0500
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:11 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:46 -0500
Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 20:54 -0700
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:09 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:55 -0500
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 04:17 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:28 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 05:52 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 00:03 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 04:12 -0800
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 15:51 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 10:07 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 11:33 -0500
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:00 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 11:08 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:27 -0500
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:28 +0000
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-09 11:37 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:44 -0500
Re: Detecting infinite recursion (PDF) (nitwit) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:59 +0000
Re: Detecting infinite recursion (PDF) (nitwit) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 17:29 +0000
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 07:59 -0500
Re: Detecting infinite recursion (PDF) (nitwit) R Kym Horsell <kym@kymhorsell.com> - 2021-03-09 16:16 +0000
Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 10:26 -0600
Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 16:46 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 10:51 -0600
Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 16:54 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:00 -0600
Re: Refuting the halting problem proofs with fully operational code Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-09 17:04 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:10 -0600
Re: Refuting the halting problem proofs with fully operational code R Kym Horsell <kym@kymhorsell.com> - 2021-03-09 16:57 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:02 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:17 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 11:24 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 17:35 +0000
Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) olcott <NoOne@NoWhere.com> - 2021-03-09 11:54 -0600
Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 18:02 +0000
Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 13:57 -0500
Re: Refuting the halting problem proofs with fully operational code Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-09 10:04 -0800
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 12:12 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 18:37 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 12:57 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:26 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 14:46 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 16:48 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 15:56 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 17:49 -0500
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:26 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 20:47 -0600
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:14 +0000
Re: Refuting the halting problem proofs with fully operational code Jeff Barnett <jbb@notatt.com> - 2021-03-10 11:36 -0700
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-10 12:58 -0600
Re: Refuting the halting problem proofs with fully operational code Jeff Barnett <jbb@notatt.com> - 2021-03-10 15:35 -0700
Re: Refuting the halting problem proofs with fully operational code Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-09 19:28 +0000
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:00 -0500
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 13:03 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 14:25 -0500
Re: Refuting the halting problem proofs with fully operational code Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-09 21:39 +0000
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 15:59 -0600
Re: Refuting the halting problem proofs with fully operational code olcott <NoOne@NoWhere.com> - 2021-03-09 16:52 -0600
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:42 -0500
Re: Refuting the halting problem proofs with fully operational code Richard Damon <Richard@Damon-Family.org> - 2021-03-09 12:36 -0500
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 22:36 -0500
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 21:45 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 23:02 -0500
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:13 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 08:00 -0500
Re: Detecting infinite recursion (PDF) (nitwit) André G. Isaak <agisaak@gm.invalid> - 2021-03-08 21:22 -0700
Re: Detecting infinite recursion (PDF) (nitwit) olcott <NoOne@NoWhere.com> - 2021-03-08 22:35 -0600
Re: Detecting infinite recursion (PDF) (nitwit) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-08 20:42 -0800
Re: Detecting infinite recursion (PDF) (nitwit) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 08:07 -0500
Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 13:32 -0500
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 11:31 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 18:04 +0000
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 12:34 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 19:07 +0000
Re: Detecting infinite recursion (PDF) (agreement?) olcott <NoOne@NoWhere.com> - 2021-03-08 14:01 -0600
Re: Detecting infinite recursion (PDF) (agreement?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 15:34 -0500
Re: Detecting infinite recursion (PDF) (Rice's theorem) olcott <NoOne@NoWhere.com> - 2021-03-08 15:57 -0600
Re: Detecting infinite recursion (PDF) (Rice's theorem) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 17:20 -0500
Re: Detecting infinite recursion (PDF) (last step?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 23:57 -0800
Re: Detecting infinite recursion (PDF) (last step?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 09:37 -0500
Re: Detecting infinite recursion (PDF) (last step?) olcott <NoOne@NoWhere.com> - 2021-03-08 09:28 -0600
Re: Detecting infinite recursion (PDF) (last step?) Richard Damon <Richard@Damon-Family.org> - 2021-03-08 11:37 -0500
Re: Detecting infinite recursion (PDF) (Ignoramus?) olcott <NoOne@NoWhere.com> - 2021-03-08 00:10 -0600
Re: Detecting infinite recursion (PDF) (Ignoramus?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-08 07:04 +0000
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-06 21:10 +0000
Re: Detecting infinite recursion (PDF) olcott <NoOne@NoWhere.com> - 2021-03-06 15:43 -0600
Re: Detecting infinite recursion (PDF) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:24 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 15:51 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 18:26 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 01:07 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 19:14 -0600
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-06 19:16 -0800
Re: Detecting infinite recursion (halt deciding criteria) Jeff Barnett <jbb@notatt.com> - 2021-03-06 11:49 -0700
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-06 10:24 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 22:23 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:42 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:14 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:30 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:46 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 20:05 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:47 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:03 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 11:46 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 08:57 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:48 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:07 +0000
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 21:54 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:07 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 22:35 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:43 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:13 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 23:49 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 09:50 -0500
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 22:20 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 16:31 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:13 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 02:42 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:00 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 12:01 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-05 09:03 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:11 +0000
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 10:20 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 11:41 -0500
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 22:06 +0000
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:41 -0600
Re: Detecting infinite recursion (halt deciding criteria) [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 16:53 -0600
Re: Detecting infinite recursion (halt deciding criteria) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:27 +0000
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 19:43 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 22:04 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 21:17 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 23:00 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-04 22:14 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-05 10:18 -0500
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-04 20:03 -0800
Re: Detecting infinite recursion (halt deciding criteria) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-04 20:46 -0800
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:33 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 21:43 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:08 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:15 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:30 -0500
Re: Detecting infinite recursion (halt deciding criteria) olcott <NoOne@NoWhere.com> - 2021-03-03 22:35 -0600
Re: Detecting infinite recursion (halt deciding criteria) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:56 -0500
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 16:07 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:41 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:20 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 16:29 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:55 -0500
Re: Detecting infinite recursion (exception to the rule) olcott <NoOne@NoWhere.com> - 2021-03-02 16:24 -0600
Re: Detecting infinite recursion (exception to the rule) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:50 -0500
Re: Detecting infinite recursion (exception to the rule) olcott <NoOne@NoWhere.com> - 2021-03-02 16:59 -0600
Re: Detecting infinite recursion (exception to the rule) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 19:20 -0500
Re: Detecting infinite recursion (credit where it is due) olcott <NoOne@NoWhere.com> - 2021-03-02 18:45 -0600
Re: Detecting infinite recursion (credit where it is due) Richard Damon <Richard@Damon-Family.org> - 2021-03-02 20:58 -0500
Re: Detecting infinite recursion Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-02 22:57 +0000
Re: Detecting infinite recursion om@iki.fi (Otto J. Makela) - 2021-03-03 14:46 +0200
Re: Detecting infinite recursion Siri Cruise <chine.bleu@yahoo.com> - 2021-03-02 12:04 -0800
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 14:49 -0600
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-02 15:52 -0500
Re: Detecting infinite recursion is simple olcott <NoOne@NoWhere.com> - 2021-03-02 15:08 -0600
Re: Detecting infinite recursion is simple Richard Damon <Richard@Damon-Family.org> - 2021-03-02 17:33 -0500
Re: Detecting infinite recursion is simple olcott <NoOne@NoWhere.com> - 2021-03-02 17:18 -0600
Re: Detecting infinite recursion is simple Richard Damon <Richard@Damon-Family.org> - 2021-03-02 21:07 -0500
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-02 21:41 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 15:57 -0600
Re: Detecting infinite recursion Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-02 22:32 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-02 16:42 -0600
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 12:52 -0600
Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 19:53 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 14:07 -0600
Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 21:14 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 15:25 -0600
Re: Detecting infinite recursion Alan Mackenzie <acm@muc.de> - 2021-03-03 22:01 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 16:09 -0600
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:59 +0000
Re: Detecting infinite recursion Richard Damon <Richard@Damon-Family.org> - 2021-03-03 17:19 -0500
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-03 22:50 +0000
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 16:56 -0600
Re: Detecting infinite recursion Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-04 01:51 +0000
Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 17:06 -0600
Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 18:17 -0500
Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 17:25 -0600
Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 19:46 -0500
Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 19:09 -0600
Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 22:45 -0500
Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 21:55 -0600
Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:11 -0500
Re: Detecting infinite recursion (rewritten) olcott <NoOne@NoWhere.com> - 2021-03-03 22:22 -0600
Re: Detecting infinite recursion (rewritten) Richard Damon <Richard@Damon-Family.org> - 2021-03-03 23:48 -0500
Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-03 22:59 -0600
Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 07:17 -0500
Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 08:07 -0600
Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 10:11 -0500
Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 09:21 -0600
Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 10:48 -0500
Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 09:55 -0600
Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:31 -0500
Re: Detecting infinite recursion (rewritten) pointless Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-04 07:59 -0800
Re: Detecting infinite recursion (rewritten) pointless olcott <NoOne@NoWhere.com> - 2021-03-04 10:12 -0600
Re: Detecting infinite recursion (rewritten) pointless Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:40 -0500
Re: Detecting infinite recursion olcott <NoOne@NoWhere.com> - 2021-03-03 12:55 -0600
Re: Detecting infinite recursion Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-07 16:38 +0100
Re: Detecting infinite recursion (halting problem) olcott <NoOne@NoWhere.com> - 2021-03-07 09:55 -0600
Re: Detecting infinite recursion (halting problem) Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-07 18:08 +0100
Re: Detecting infinite recursion "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-07 10:54 -0800
Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 19:42 -0600
Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 02:22 +0000
Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 20:30 -0600
Re: Detecting infinite recursion (2021-03-09) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 21:54 -0500
Re: Detecting infinite recursion (2021-03-09) olcott <NoOne@NoWhere.com> - 2021-03-09 21:01 -0600
Re: Detecting infinite recursion (2021-03-09) Richard Damon <Richard@Damon-Family.org> - 2021-03-09 22:29 -0500
Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:31 +0000
Re: Detecting infinite recursion (2021-03-09) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-10 03:15 +0000
Re: Detecting infinite recursion (2021-03-09) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-09 18:31 -0800
Page 5 of 37 — ← Prev page 1 … 3 4 [5] 6 7 … 37 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 12:08 -0600 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <NaWdnbtZt64ITaL9nZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #28326 |
On 3/3/2021 5:44 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 3/2/2021 7:52 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 3/2/2021 7:26 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 3/2/2021 6:53 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> #include <stdint.h>
>>>>>>>> #define u8 uint8_t
>>>>>>>> #define u32 uint32_t
>>>>>>>> #define u16 uint16_t
>>>>>>>
>>>>>>> Curious. I gave you the correct type to use and you changed it back.
>>>>>>> And then you continued to use the wrong cast, despite my correcting it:
>>>>>>>
>>>>>>>> u32 Halts(u32 P, u32 I)
>>>>>>>> {
>>>>>>>> ((void(*)(int))P)(I);
>>>>>>
>>>>>> I just recently verified that it is a correct cast for this function:
>>>>>> void H_Hat(u32 P)
>>>>>
>>>>> You verification method is flawed.
>>>>
>>>> What is the correct syntax?
>>>
>>> For the type you have chosen (which limits the C implementations you can
>>> use, as compared to the one I used) the correct cast is (void (*)(u32)).
>>
>> Oh so I called a u32 an int.
>
> And the correct type to use in C is intptr_t or uintptr_t. But you have
> decided to tie your code to a more narrowly defined version of "x86
> language".
>
>> I also need to invoke it in the same instruction: ((void(*)(u32))P)(I);
>>
>>>>>> u32 is the standard x86utm "tape" element type.
>>>>>
>>>>> There is no TM here, so there is no UTM here either. Whatever /you/
>>>>
>>>> It is named x86utm because it is the computational equivalent of a UTM
>>>> implemented in the von Neumann architecture specified by the x86
>>>> language.
>>>
>>> The x86 is not Turing complete, and "x86 language" is a term you've made
>>> up, but if my guess at what you mean by it is right, it is not Turing
>>> complete either.
>>
>> It turns out that the relative addressing of the abstract model of
>> computation that the x86 language specifies provides for a linked list
>> of an unlimited number of elements of 2GB blocks.
>
> No. It turns out you failed to write the code for something even as
> simple as an unbounded linked list. That's because it's not possible in
> the silly model you have picked.
> To be clear, you can invent a model of computation that looks a lot like
> an x86 implementation where you can have unbounded addresses, but then
> why not work in a simple abstract machine rather than the mess that is
> the x86?
I need to show every single step concretely rather than abstractly
because when these things are examined abstractly crucial details slip
through the cracks of understanding producing undetected gaps in reasoning.
> If you pick the x86, you are stuck with its limitations.
> Even so, it doesn't matter -- it's simply anther thing you are wrong
> about. What you originally claimed to have is just as impossible in a
> non-Turing complete notation as in a complete one. And it is almost
> certain that the trick you are trying to pull off now does not rely on
> the non-Turing completeness of the model.
>
The x86utm operating system has an u32* Allocate(u32 size) function,
making physical memory limits transparent to the application. Whenever
Allocate reaches it limit an error message is output and exit(0) is
executed.
If the x86utm had no actual physical memory limit then it would be
equivalent to a RASP machine which is equivalent to a UTM. All of the
computations where the x86utm operating system would exceed its memory
limit are terminated leaving the remaining computations equivalent to a
the computations of RASP machine which is in turn is equivalent to the
computations of a UTM.
> But the real advantage of using the x86 is the joy you will bring to
> some editor's day if you ever submit a paper on computability that uses
> it!
>
>>> And even if either or both were, UTM is the wrong term
>>> for something that is not a TM.
>>
>> computational equivalent of a UTM
>> computational equivalent of a UTM
>> computational equivalent of a UTM
>> computational equivalent of a UTM
>
> (a) No.
> (b) X being computationally equivalent to X does not make an X a Y.
>
> You did not call it a universal lambda form because it isn't one. You
> did not call it a universal Post system because it isn't one. You did
> not call it a universal Mealy machine because it isn't one. And you
> should not call it a universal Turing machine because it isn't one.
>
>>> You pretend that you want to publish this work, but all serious work in
>>> this subject is done within some formal model of computation.
>>
>> With the utterly ridiculous difficulty that I am having showing that a
>> simple C program can decide that the following code does indeed
>> specify infinite recursion that Halts() can recognize I would almost
>> bet my soul that 10,000-fold more details of the much lower level
>> abstraction actual Turing machines is not going to help.
>
> There are much higher-level models that you could have chosen, but you
> don't know them, and you dare not read a book on this topic. You chose
> "x86 language" because you've come across it, not because it has any
> technical benefits for your task. Anyway, I don't want to rock the
> boat. Keep using "x86 language" as your model. Journal editor's need a
> laugh as much as the next person.
>
All of the halting problem proofs are based on the fact that it is
impossible for Halts() to return a correct halting decision to H_Hat()
because H_Hat() contradicts whatever value that Halts() returns.
All of these same proofs ignore the fact that every halt decider that
bases its halt decision on examining the execution trace of its own
simulation of its input never reaches the point in the execution trace
where it would return a value to H_Hat().
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
That I have shown how a halt decider could examine such an execution
trace to determine that its input would not halt unless the simulation
of this input was terminated proves that these computations are halt
decidable.
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>>> There are
>>> many you could have chosen, or you could have defined your own (I'm
>>> using a generic you here). Choosing "x86 language" (whatever that
>>> really is) is laughable. Obviously I don't want you to change that
>>> decision.
>>
>> You are not very good at restricting your language to objectivity are
>> you?
>
> And objective discussion is not possible because you can't write
> mathematics. You can't even provide code. You can't meet my challenge
> to write a function H that does what you claimed to have done more than
> two years ago. Simply providing the code for such an H would
> unequivocally show that you have been right all along, but you keep
> ducking a diving, making up excuses for why you won't. Here's the
> challenge again, to write an H such that these two programs behave
> correctly:
If we ignore all of the details x86 emulation infrastructure and simply
assume that the x86 emulation of x86 code is equivalent to the direct
execution of this code then simply providing the halt deciding portion
of this system can be done very concisely.
Since the halt deciding code is only going to examine this execution
trace as the entire basis of its decision it can be understood that the
halt decider is correct without having to see its code.
On the other hand if it is not understood that the halt decider would be
correct on the basis of this execution trace, then providing the code
would not help.
EXPLANATION OF THE HALTING DECISION ON THE BASIS OF THE EXECUTION TRACE
Push instructions have already pushed the value shown in their in the
third column. The two push instructions preceding the call to Simulate()
are its second and first parameters respectively.
Columns
(1) Machine address of instruction
(2) Machine address of top of stack
(3) Value of top of stack after instruction executed
(4) Assembly language text
[000008bf][00011208][00000000] push ebp
[000008c0][00011208][00000000] mov ebp,esp
[000008c2][00011204][00000000] push ecx
[000008c3][00011200][0000088f] push 0000088f
[000008c8][000111fc][0000088f] push 0000088f
[000008cd][000111f8][000008d2] call 000004af
[0000088f][000111e8][000111f4] push ebp
[00000890][000111e8][000111f4] mov ebp,esp
[00000892][000111e4][00000000] push ecx
[00000893][000111e4][00000000] mov eax,[ebp+08]
[00000896][000111e0][0000088f] push eax ; 2nd Param
[00000897][000111e0][0000088f] mov ecx,[ebp+08]
[0000089a][000111dc][0000088f] push ecx ; 1st Param
Call Halts(0000088f, 0000088f);
[0000089b][000111d8][000008a0] call 000004af ; Call Halts(88f, 88f);
[0000088f][000111c8][000111d4] push ebp
[00000890][000111c8][000111d4] mov ebp,esp
[00000892][000111c4][0000088f] push ecx
[00000893][000111c4][0000088f] mov eax,[ebp+08]
[00000896][000111c0][0000088f] push eax ; 2nd Param
[00000897][000111c0][0000088f] mov ecx,[ebp+08]
[0000089a][000111bc][0000088f] push ecx ;1st Param
Call Halts(0000088f, 0000088f);
...[0000089b][000111b8][000008a0] call 000004af ;Call Halts(88f, 88f);
Since the execution trace of H_Hat() shows that it calls Halts() two
times in sequence with the same data Halts() can decide that H_Hat() is
calling it in infinite recursion and thus decide halting on H_Hat().
> H.c:
> #include <stdint.h>
>
> int H(intptr_t P, intptr_t I)
> {
> // code as yet unseen
> }
>
> void H_Hat(intptr_t P) { if (H(P, P)) while (1); }
>
> int main(void) { return H((intptr_t)H_Hat, (intptr_t)H_Hat); }
>
> H^.c:
> #include <stdint.h>
>
> int H(intptr_t P, intptr_t I)
> {
> // code as yet unseen
> }
>
> void H_Hat(intptr_t P) { if (H(P, P)) while (1); }
>
> int main(void) { H_Hat((intptr_t)H_Hat); }
>
> Writing that H (and you claimed to have such an H two years ago, though
> you misled everyone at the time by calling it an "actual Turing
> machine") would stop your critics dead (unless you were cheating of
> course -- but then there would still be clear code to talk objectively
> about).
>
> I expect you will dodge this challenge yet again.
>
--
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-03-03 22:35 +0000 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <87ft1brhm2.fsf@bsb.me.uk> |
| In reply to | #28336 |
olcott <NoOne@NoWhere.com> writes:
> On 3/3/2021 5:44 AM, Ben Bacarisse wrote:
>> To be clear, you can invent a model of computation that looks a lot like
>> an x86 implementation where you can have unbounded addresses, but then
>> why not work in a simple abstract machine rather than the mess that is
>> the x86?
>
> I need to show every single step concretely rather than abstractly
> because when these things are examined abstractly crucial details slip
> through the cracks of understanding producing undetected gaps in
> reasoning.
This may be the root of your trouble. The halting problem is an
abstract problem, and you are not treating it as such.
>> If you pick the x86, you are stuck with its limitations.
>> Even so, it doesn't matter -- it's simply anther thing you are wrong
>> about. What you originally claimed to have is just as impossible in a
>> non-Turing complete notation as in a complete one. And it is almost
>> certain that the trick you are trying to pull off now does not rely on
>> the non-Turing completeness of the model.
>
> The x86utm operating system has an u32* Allocate(u32 size) function,
It's not a TM, so it can't be a UTM. Stop using the term just because
you think it sounds all sciencey.
> making physical memory limits transparent to the application. Whenever
> Allocate reaches it limit an error message is output and exit(0) is
> executed.
I challenged you to code an unbounded list in whatever it is you call
"x86 language" and you could not do it.
>>> computational equivalent of a UTM
>>> computational equivalent of a UTM
>>> computational equivalent of a UTM
>>> computational equivalent of a UTM
>> You did not call it a universal lambda form because it isn't one. You
>> did not call it a universal Post system because it isn't one. You did
>> not call it a universal Mealy machine because it isn't one. And you
>> should not call it a universal Turing machine because it isn't one.
You missed the point of this. Why, out of all the wrong terms did you
pick UTM?
> All of the halting problem proofs are based on the fact that it is
> impossible for Halts() to return a correct halting decision to H_Hat()
> because H_Hat() contradicts whatever value that Halts() returns.
You don't know "all of the halting problem proofs" (sic) so you can't
possibly say that with an confidence. Heck, you have not even read the
proper proof that Linz gives, only the one he gives for historical
interest.
> All of these same proofs ignore the fact that every halt decider that
> bases its halt decision on examining the execution trace of its own
> simulation of its input never reaches the point in the execution trace
> where it would return a value to H_Hat().
No, all the good ones take that into account quite explicitly. It's in
the very definition of terms used in the theorem.
>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>> A computation that would not halt if its simulation were not
>>>> halted is indeed a non-halting computation.
>
> That I have shown how a halt decider could examine such an execution
> trace to determine that its input would not halt unless the simulation
> of this input was terminated proves that these computations are halt
> decidable.
No. Sadly you don't understand what I wrote, but it's plain that you
are still using your own re-defined notion of a "halting computation" --
based on what a different computation "would do". That was a silly ruse
to try to pull off last time, so I thought you might have changed your
mind about that, but apparently not.
And you still appear to be flipping between "Halts might not return" and
"it returns but the answer is right because I've changed what haling
means". There is no need to do both. Either one is wrong enough.
>> You can't meet my challenge
>> to write a function H that does what you claimed to have done more than
>> two years ago. Simply providing the code for such an H would
>> unequivocally show that you have been right all along, but you keep
>> ducking a diving, making up excuses for why you won't. Here's the
>> challenge again, to write an H such that these two programs behave
>> correctly:
>
> If we ignore...
Nope. No code, as I thought.
> Since the halt deciding code...
Still no code. I thought as much.
> On the other hand...
Code? You can not be serious!
> Push instructions have already pushed...
Yawn. Where is that code?
> Since the execution trace of H_Hat() shows...
And there you have it. No code, just as I predicted:
>> H.c:
>> #include <stdint.h>
>> int H(intptr_t P, intptr_t I)
>> {
>> // code as yet unseen
>> }
>> void H_Hat(intptr_t P) { if (H(P, P)) while (1); }
>> int main(void) { return H((intptr_t)H_Hat, (intptr_t)H_Hat); }
>>
>> H^.c:
>> #include <stdint.h>
>> int H(intptr_t P, intptr_t I)
>> {
>> // code as yet unseen
>> }
>> void H_Hat(intptr_t P) { if (H(P, P)) while (1); }
>> int main(void) { H_Hat((intptr_t)H_Hat); }
>>
>> Writing that H (and you claimed to have such an H two years ago, though
>> you misled everyone at the time by calling it an "actual Turing
>> machine") would stop your critics dead (unless you were cheating of
>> course -- but then there would still be clear code to talk objectively
>> about).
>>
>> I expect you will dodge this challenge yet again.
Dodged. You lied, didn't you, when you said you had such an H? After
being told off for saying you had an actual Turing machine, you claimed
to have "a snippet of C" as the function H, but that wasn't true either,
was it?
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-03 17:42 -0500 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <4hU%H.134725$wY.103076@fx34.iad> |
| In reply to | #28336 |
On 3/3/21 1:08 PM, olcott wrote: > > Since the execution trace of H_Hat() shows that it calls Halts() two > times in sequence with the same data Halts() can decide that H_Hat() is > calling it in infinite recursion and thus decide halting on H_Hat(). Except that you are ignoring the 'hidden' conditionals in the loop that break this rule. Since this level is deciding the loop is infinite, it can be shown that if it did let the execution continue, the next loop in the layer right below it would have abort its execution and we would have seen the results of halting.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 16:59 -0600 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <hKqdnWGYgNB7id39nZ2dnUU7-efNnZ2d@giganews.com> |
| In reply to | #28357 |
On 3/3/2021 4:42 PM, Richard Damon wrote: > On 3/3/21 1:08 PM, olcott wrote: >> >> Since the execution trace of H_Hat() shows that it calls Halts() two >> times in sequence with the same data Halts() can decide that H_Hat() is >> calling it in infinite recursion and thus decide halting on H_Hat(). > > Except that you are ignoring the 'hidden' conditionals in the loop that > break this rule. Since this level is deciding the loop is infinite, it > can be shown that if it did let the execution continue, the next loop in > the layer right below it would have abort its execution and we would > have seen the results of halting. I thought the same thing too. This is not true. It is simplest to always decide not halting as soon as possible. Halting can be correctly decided as soon as the recursion recurs once or any fixed number of times. If you always wait for the next level to decide recursion remains infinite. -- 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-03-03 18:23 -0500 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <wTU%H.49807$aX.47194@fx44.iad> |
| In reply to | #28362 |
On 3/3/21 5:59 PM, olcott wrote: > On 3/3/2021 4:42 PM, Richard Damon wrote: >> On 3/3/21 1:08 PM, olcott wrote: >>> >>> Since the execution trace of H_Hat() shows that it calls Halts() two >>> times in sequence with the same data Halts() can decide that H_Hat() is >>> calling it in infinite recursion and thus decide halting on H_Hat(). >> >> Except that you are ignoring the 'hidden' conditionals in the loop that >> break this rule. Since this level is deciding the loop is infinite, it >> can be shown that if it did let the execution continue, the next loop in >> the layer right below it would have abort its execution and we would >> have seen the results of halting. > > I thought the same thing too. This is not true. It is simplest to always > decide not halting as soon as possible. > > Halting can be correctly decided as soon as the recursion recurs once or > any fixed number of times. If you always wait for the next level to > decide recursion remains infinite. > So you wn't run my experiment because you know it will prove you wrong. Yes, if you always use the same fixed number of levels you will stay in your current condition, as the top level will always decide first. The key is that you need to let lower levels, at least sometimes, decide first to make obvious the error in your analysis. Please note, since you have been publically pointed out these facts, you will be unable to in the future say you didn't think of them, it will just show how you blindly stuck to error over looking at the truth.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 17:34 -0600 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <JOydnbZ204Zvgd39nZ2dnUU7-K3NnZ2d@giganews.com> |
| In reply to | #28365 |
On 3/3/2021 5:23 PM, Richard Damon wrote: > On 3/3/21 5:59 PM, olcott wrote: >> On 3/3/2021 4:42 PM, Richard Damon wrote: >>> On 3/3/21 1:08 PM, olcott wrote: >>>> >>>> Since the execution trace of H_Hat() shows that it calls Halts() two >>>> times in sequence with the same data Halts() can decide that H_Hat() is >>>> calling it in infinite recursion and thus decide halting on H_Hat(). >>> >>> Except that you are ignoring the 'hidden' conditionals in the loop that >>> break this rule. Since this level is deciding the loop is infinite, it >>> can be shown that if it did let the execution continue, the next loop in >>> the layer right below it would have abort its execution and we would >>> have seen the results of halting. >> >> I thought the same thing too. This is not true. It is simplest to always >> decide not halting as soon as possible. >> >> Halting can be correctly decided as soon as the recursion recurs once or >> any fixed number of times. If you always wait for the next level to >> decide recursion remains infinite. >> > > So you wn't run my experiment because you know it will prove you wrong. I know that every computation that would not halt unless its simulator stopped simulating it <is> a non-halting computation in the exact same logical necessity way that I know that all black cats are black. If you think that you have proof that black cats are not black I know with complete logical certainty that you cannot possibly be correct. Any failure of comprehension on your part never ever derives any error on my part. -- 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-03-03 19:36 -0500 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <EYV%H.1277$_k1.338@fx14.iad> |
| In reply to | #28368 |
On 3/3/21 6:34 PM, olcott wrote: > On 3/3/2021 5:23 PM, Richard Damon wrote: >> On 3/3/21 5:59 PM, olcott wrote: >>> On 3/3/2021 4:42 PM, Richard Damon wrote: >>>> On 3/3/21 1:08 PM, olcott wrote: >>>>> >>>>> Since the execution trace of H_Hat() shows that it calls Halts() two >>>>> times in sequence with the same data Halts() can decide that >>>>> H_Hat() is >>>>> calling it in infinite recursion and thus decide halting on H_Hat(). >>>> >>>> Except that you are ignoring the 'hidden' conditionals in the loop that >>>> break this rule. Since this level is deciding the loop is infinite, it >>>> can be shown that if it did let the execution continue, the next >>>> loop in >>>> the layer right below it would have abort its execution and we would >>>> have seen the results of halting. >>> >>> I thought the same thing too. This is not true. It is simplest to always >>> decide not halting as soon as possible. >>> >>> Halting can be correctly decided as soon as the recursion recurs once or >>> any fixed number of times. If you always wait for the next level to >>> decide recursion remains infinite. >>> >> >> So you wn't run my experiment because you know it will prove you wrong. > > I know that every computation that would not halt unless its simulator > stopped simulating it <is> a non-halting computation in the exact same > logical necessity way that I know that all black cats are black. > > If you think that you have proof that black cats are not black I know > with complete logical certainty that you cannot possibly be correct. > > Any failure of comprehension on your part never ever derives any error > on my part. > I will point out that I agree, that if you can actually PROVE that a given simulation will NEVER terminate, you can call it a non-halting computation. Note, a test for this is to change the simulator (but NOT the computation it is simulating, even if it is referencing that same simulation procedure) to not abort, and see it the computation really does not terminate (your H_Hat/Halt fails this test). Also, you seem to forget that a simulator is a different computation than a Halt Decider, even if it is based on a Simulator, as a Halt Decider is ALWAY a finite computation while a Simulator is only finite if the program it is simulating is finite. The biggest part of your error is that you accept as 'proof' of infinite execution things that actually aren't because you ignore some conditional execution in the execution path.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 18:45 -0600 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <oI6dnfdsmpEasN39nZ2dnUU7-eHNnZ2d@giganews.com> |
| In reply to | #28370 |
On 3/3/2021 6:36 PM, Richard Damon wrote: > On 3/3/21 6:34 PM, olcott wrote: >> On 3/3/2021 5:23 PM, Richard Damon wrote: >>> On 3/3/21 5:59 PM, olcott wrote: >>>> On 3/3/2021 4:42 PM, Richard Damon wrote: >>>>> On 3/3/21 1:08 PM, olcott wrote: >>>>>> >>>>>> Since the execution trace of H_Hat() shows that it calls Halts() two >>>>>> times in sequence with the same data Halts() can decide that >>>>>> H_Hat() is >>>>>> calling it in infinite recursion and thus decide halting on H_Hat(). >>>>> >>>>> Except that you are ignoring the 'hidden' conditionals in the loop that >>>>> break this rule. Since this level is deciding the loop is infinite, it >>>>> can be shown that if it did let the execution continue, the next >>>>> loop in >>>>> the layer right below it would have abort its execution and we would >>>>> have seen the results of halting. >>>> >>>> I thought the same thing too. This is not true. It is simplest to always >>>> decide not halting as soon as possible. >>>> >>>> Halting can be correctly decided as soon as the recursion recurs once or >>>> any fixed number of times. If you always wait for the next level to >>>> decide recursion remains infinite. >>>> >>> >>> So you wn't run my experiment because you know it will prove you wrong. >> >> I know that every computation that would not halt unless its simulator >> stopped simulating it <is> a non-halting computation in the exact same >> logical necessity way that I know that all black cats are black. >> >> If you think that you have proof that black cats are not black I know >> with complete logical certainty that you cannot possibly be correct. >> >> Any failure of comprehension on your part never ever derives any error >> on my part. >> > > I will point out that I agree, that if you can actually PROVE that a > given simulation will NEVER terminate, you can call it a non-halting > computation. > > Note, a test for this is to change the simulator (but NOT the > computation it is simulating, even if it is referencing that same > simulation procedure) to not abort, and see it the computation really > does not terminate (your H_Hat/Halt fails this test). > > Also, you seem to forget that a simulator is a different computation > than a Halt Decider, even if it is based on a Simulator, as a Halt > Decider is ALWAY a finite computation while a Simulator is only finite > if the program it is simulating is finite. > The biggest part of your error is that you accept as 'proof' of infinite > execution things that actually aren't because you ignore some > conditional execution in the execution path. When the halt decider is examining its program under test to see if it must abort the simulation of this program under test to prevent its own infinite execution it is not supposed to look at any of its own code. As soon as the program under test is determined to have infinite execution unless its simulation is stopped, its simulation is stopped and not halting is correctly decided. -- 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-03-02 20:40 -0500 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <NOB%H.3492$rp1.2390@fx12.iad> |
| In reply to | #28297 |
On 3/2/21 8:02 PM, olcott wrote:
> On 3/2/2021 6:53 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> #include <stdint.h>
>>> #define u8 uint8_t
>>> #define u32 uint32_t
>>> #define u16 uint16_t
>>
>> Curious. I gave you the correct type to use and you changed it back.
>> And then you continued to use the wrong cast, despite my correcting it:
>>
>>> u32 Halts(u32 P, u32 I)
>>> {
>>> ((void(*)(int))P)(I);
>
> I just recently verified that it is a correct cast for this function:
> void H_Hat(u32 P)
>
> u32 is the standard x86utm "tape" element type.
As Ben says, an integer type isn't a very good 'tape' type. If these
were 'pointers' (which you use them as) they are only slightly better.
In your earlier proposals, the x86utm was going to take an object file
in as the program definition, that makes a lot more sense, as would
taking a file in as the 'tape'.
As has been pointer out, You Simulator isn't anywhere near being A UTM.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 19:43 -0600 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <nKqdnQc949pYdKP9nZ2dnUU78IGdnZ2d@giganews.com> |
| In reply to | #28300 |
On 3/2/2021 7:40 PM, Richard Damon wrote:
> On 3/2/21 8:02 PM, olcott wrote:
>> On 3/2/2021 6:53 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> #include <stdint.h>
>>>> #define u8 uint8_t
>>>> #define u32 uint32_t
>>>> #define u16 uint16_t
>>>
>>> Curious. I gave you the correct type to use and you changed it back.
>>> And then you continued to use the wrong cast, despite my correcting it:
>>>
>>>> u32 Halts(u32 P, u32 I)
>>>> {
>>>> ((void(*)(int))P)(I);
>>
>> I just recently verified that it is a correct cast for this function:
>> void H_Hat(u32 P)
>>
>> u32 is the standard x86utm "tape" element type.
>
> As Ben says, an integer type isn't a very good 'tape' type. If these
> were 'pointers' (which you use them as) they are only slightly better.
>
> In your earlier proposals, the x86utm was going to take an object file
> in as the program definition, that makes a lot more sense, as would
> taking a file in as the 'tape'.
>
> As has been pointer out, You Simulator isn't anywhere near being A UTM.
>
It is named x86utm because it is the computational equivalent of a UTM
implemented in the von Neumann architecture specified by the x86 language.
--
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-03-02 21:19 -0500 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <LmC%H.29366$mU.3467@fx04.iad> |
| In reply to | #28302 |
On 3/2/21 8:43 PM, olcott wrote:
> On 3/2/2021 7:40 PM, Richard Damon wrote:
>> On 3/2/21 8:02 PM, olcott wrote:
>>> On 3/2/2021 6:53 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> #include <stdint.h>
>>>>> #define u8 uint8_t
>>>>> #define u32 uint32_t
>>>>> #define u16 uint16_t
>>>>
>>>> Curious. I gave you the correct type to use and you changed it back.
>>>> And then you continued to use the wrong cast, despite my correcting it:
>>>>
>>>>> u32 Halts(u32 P, u32 I)
>>>>> {
>>>>> ((void(*)(int))P)(I);
>>>
>>> I just recently verified that it is a correct cast for this function:
>>> void H_Hat(u32 P)
>>>
>>> u32 is the standard x86utm "tape" element type.
>>
>> As Ben says, an integer type isn't a very good 'tape' type. If these
>> were 'pointers' (which you use them as) they are only slightly better.
>>
>> In your earlier proposals, the x86utm was going to take an object file
>> in as the program definition, that makes a lot more sense, as would
>> taking a file in as the 'tape'.
>>
>> As has been pointer out, You Simulator isn't anywhere near being A UTM.
>>
>
> It is named x86utm because it is the computational equivalent of a UTM
> implemented in the von Neumann architecture specified by the x86 language.
>
>
Except that because of its failure to provide a clean environment to run
the provided machine, it isn't anywhere close to a UTM.
The equivalent for a UTM would work more like a virtual machine, not an
in-process code simulator.
I have described the sorts of programs that it is unable to run, and
because of that limitation, it is able to do something that a UTM can't do.
What happens if you write H_Hat by the spec, it begins with mallocing a
buffer the size of the H_Hat function (compiled as position independent
code), and put a copy of the function into the buffer. H_Hat then makes
a second copy of that buffer to a new buffer, and calls Halts with these
two buffers.
THIS is the closer representation of the H_Hat of Linz. Now try to
handle this case.
[toc] | [prev] | [next] | [standalone]
| From | om@iki.fi (Otto J. Makela) |
|---|---|
| Date | 2021-03-03 14:52 +0200 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <871rcwflg4.fsf@tigger.extechop.net> |
| In reply to | #28296 |
Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > C is not your string suit. https://www.google.com/search?tbm=isch&q=string+suit -- /* * * Otto J. Makela <om@iki.fi> * * * * * * * * * */ /* Phone: +358 40 765 5772, ICBM: N 60 10' E 24 55' */ /* Mail: Mechelininkatu 26 B 27, FI-00100 Helsinki */ /* * * Computers Rule 01001111 01001011 * * * * * * */
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-03 13:52 +0000 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <20210303055027.685@kylheku.com> |
| In reply to | #28329 |
On 2021-03-03, Otto J. Makela <om@iki.fi> wrote: > Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: > >> C is not your string suit. > > https://www.google.com/search?tbm=isch&q=string+suit Some of that is lacking so much as null termination. -- TXR Programming Language: http://nongnu.org/txr Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2021-02-28 21:51 -0800 |
| Subject | Re: Detecting infinite recursion (H_Hat is proved to be decidable) |
| Message-ID | <87mtvnjua4.fsf@nosuchdomain.example.com> |
| In reply to | #28177 |
Kaz Kylheku <563-365-8930@kylheku.com> writes:
> On 2021-02-28, olcott <NoOne@NoWhere.com> wrote:
>> This instance of H_Hat() is proved to be decidable and all the code is
>> provided. This H_Hat() calls Simulate() that returns true whenever its
>> input halts.
>
> Your eyes keep slipping off the carrot every once in a short while.
>
> What's not decidable is universal halting, not any one specific program
> and its input.
>
> Any method by which you can decide a specific program and its input will
> also work for some other programs/inputs, but not all of them.
Kaz, did you intend to set followups to comp.lang.c? (I'm posting this
only to comp.theory.)
I know olcott often makes inappropriate cross-posts (or rather I
presume he still does so). I suggest posting any followups *only*
to comp.theory unless there's actually some relevant content, which
there doesn't appear to be in this case.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-01 11:30 -0500 |
| Message-ID | <nE8%H.103091$sW4.71774@fx40.iad> |
| In reply to | #28165 |
On 2/27/21 11:10 PM, olcott wrote:
> On 2/27/2021 9:30 PM, Richard Damon wrote:
>> On 2/27/21 9:59 PM, olcott wrote:
>>>
>>> I don't really give a rat's ass about any doubts because I know what I
>>> have. If you are unwilling or unable to proceed with an objective
>>> analysis on the basis that I provided then there is no sense continuing
>>> this dialogue.
>>
>
> It has proven to be the case that people cannot correctly understand my
> work, thus presenting it without a sufficient explanation would be useless.
I think you are mistaken here. I think a number of people DO understand
what you are saying, they just disagree with your conclusion and have
been pointing out the errors in your logic which YOU do not understand
because you don't undeerstand the fields well enough.
>
>> If you don't care about doubts, why are you asking for the opinions of
>> others. If you know you are right, just publish what you 'know' and see
>> how much of a laughing stock your 'proof' becomes.
>
> I am not asking for opinions of others. I want to be able to build an
> objective informal proof that I am correct so that others will be able
> to understand this too.
For what you seem to want to do, you DON'T want in 'informal' proof.
Informal proof are ways to hide logical fallacies. If you want to make a
bold claim like what you have been trying to do, you need to provide a
VERY FORMAL proof. I think you core problem is that you have used an
informal proof to convince youself, and refuse to see the errors baked
into its assumptions.
>
>> You say you have 'working code' publish it to prove it.
>>
>> YOU seem big about making claims, but also big at avoiding making real
>> proof of what you claim. You inevitably zag when someone gets close to
>> what seems to be a 'sore point'.
>>
>
> People have very consistently evaluated my work incorrectly on the basis
> of assumptions that they were not even aware that they were making. If
> we proceed with an objective analysis that makes no assumptions
> what-so-ever without explicitly stating them then we can get to closure.
>
> The assumption that we made so far can be objectively proven on the
> basis of the working code.
>
> I may have to re-engineer this code on the basis of how the analysis
> proceeds. I am not looking to prove that my code is correct I am looking
> to reverse-engineer the specification of correct code.
People have been evaluating your work based on the criterion of the
fields of formal Mathematics, and the axioms built into them. You seem
to be making claims that you are working within these rules so that you
claims are applicable to those proof, but then you seem to want to
change the ground rules of those fields. You can't do that. You need to
choose, and declare, what rules you are working under. If you want to
change fundamental definitions, fine, but then say your results are
applicable to things based on the definitions you changed from.
>
>> This sub-thread is a good example of this. Ben pointed out that the
>> clearest way to express what you were doing would be to publish your
>> CODE.
>
> By 35 years of software engineering I know that things are much more
> easily understood at very high level abstractions and when you present a
> myriad of details then things become utterly incomprehensible.
Yes. You need to start at the high level, and that high level doesn't
need hundreds of pages of traces to prove, or the editing down of that
hundreds of pages to prove. If you can't describe it in a few paragraphs
of words, you have lost your high level of abstraction.
>
>> Your answer was that people would be unable to understand the
>> voluminous TRACE.
>
> Unless things are presented at very high level abstractions the forest
> will always be utterly obscured by all the trees.
>
> What we have agreed to so far this version of H_Hat() is infinitely
> recursive if Simulate() returns 1 when its input halts and otherwise
> does not return.
>
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Simulate(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
PROBLEM. A 'Simulate' function does not return a 'Halting Status', You
have mixed up you abstractions at this point.
From your previous behavior, it is clear that you are likely at some
point in the future going to change Simulate to Halt_Decider (or some
other name), which is a VERY different sort of program, and then, the
idea that a 'pure simulator' went infinitely recursive, isn't applicable
to a function with a different interface condition.
You may be able to state that H_Hat would be infinitely recursive if the
Halt Decider didn't fullfill its requirements to answer in finite time,
but that answer is not responsive to the question that it is actually
needing to answer if you are in the domain of the Classical Halting Problem.
>
> In other words the x86 simulator is functionally equivalent to the
> following code:
>
>
> int Simulate(u32 P, u32 I)
> {
> ((void(*)(int))P)(I);
> return 1;
> }
>
>
>> That is non-responsive, and tends to point that either
>> the code doesn't exist, is much less developed than you have been
>> claiming, or that it is of such awful quality you don't want to show it.
>>
>> If it is the latter, be advised that any reputable publication will
>> insist that the code be published since you argument is based on its
>> results, so it WILL be revealed.
>>
>
> The other issue besides the code needing some cleanup is that publishing
> the code may be a bar to publishing an academic paper based on the code.
> Academic journals really want to have the first shot at publication.
>
>
Puts you in a bit of a pickle then. You could go straight to the journal
for peer review and be laughed out of the house (if it is a good journal),
I also have been doing a bit of thinking on your previous presentations
and will give you a few comments. Your current implementation of the
simmulator actually fails to be a simple UTM equivalent for the
following reason, for a standard computer program to be seen as a
straight forward model of a Turing Machine, it needs to work under a few
restrictions that your system isn't doing. These include:
1) The Code space needs to be 'Execute Only' (at least effectively)
meaning that the code may not access the instructions in the code stream
via read or write instructions, as this is capability that real Turning
Machines do not have. Code that does this still does have a equivalent
Turing Machine, but that equivalence is much more complicated.
2) The Data space needs to be diviable into two piece (none of which
include the code space as said above), one part represents the 'State'
of the Turing Machine, and the other the 'Tape' of the machine.
Note, that this means that the H_Hat of the proof DOES need to be given
a seperate copy of itself, as it can't just access its own code, and it
does need to give two separate copies to the Halt Decider.
Once you do this, I think you will find that your whole method falls
apart, as you can no longer detect the recursion that your method
depends, because that detection basically requires something akin to
solving the halting problem.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-01 10:43 -0600 |
| Message-ID | <aOOdnR-psbdfhKD9nZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #28190 |
On 3/1/2021 10:30 AM, Richard Damon wrote:
> On 2/27/21 11:10 PM, olcott wrote:
>> On 2/27/2021 9:30 PM, Richard Damon wrote:
>>> On 2/27/21 9:59 PM, olcott wrote:
>>>>
>>>> I don't really give a rat's ass about any doubts because I know what I
>>>> have. If you are unwilling or unable to proceed with an objective
>>>> analysis on the basis that I provided then there is no sense continuing
>>>> this dialogue.
>>>
>>
>> It has proven to be the case that people cannot correctly understand my
>> work, thus presenting it without a sufficient explanation would be useless.
>
> I think you are mistaken here. I think a number of people DO understand
> what you are saying, they just disagree with your conclusion and have
> been pointing out the errors in your logic which YOU do not understand
> because you don't undeerstand the fields well enough.
>>
>>> If you don't care about doubts, why are you asking for the opinions of
>>> others. If you know you are right, just publish what you 'know' and see
>>> how much of a laughing stock your 'proof' becomes.
>>
>> I am not asking for opinions of others. I want to be able to build an
>> objective informal proof that I am correct so that others will be able
>> to understand this too.
>
> For what you seem to want to do, you DON'T want in 'informal' proof.
> Informal proof are ways to hide logical fallacies. If you want to make a
> bold claim like what you have been trying to do, you need to provide a
> VERY FORMAL proof. I think you core problem is that you have used an
> informal proof to convince youself, and refuse to see the errors baked
> into its assumptions.
>>
>>> You say you have 'working code' publish it to prove it.
>>>
>>> YOU seem big about making claims, but also big at avoiding making real
>>> proof of what you claim. You inevitably zag when someone gets close to
>>> what seems to be a 'sore point'.
>>>
>>
>> People have very consistently evaluated my work incorrectly on the basis
>> of assumptions that they were not even aware that they were making. If
>> we proceed with an objective analysis that makes no assumptions
>> what-so-ever without explicitly stating them then we can get to closure.
>>
>> The assumption that we made so far can be objectively proven on the
>> basis of the working code.
>>
>> I may have to re-engineer this code on the basis of how the analysis
>> proceeds. I am not looking to prove that my code is correct I am looking
>> to reverse-engineer the specification of correct code.
>
> People have been evaluating your work based on the criterion of the
> fields of formal Mathematics, and the axioms built into them. You seem
> to be making claims that you are working within these rules so that you
> claims are applicable to those proof, but then you seem to want to
> change the ground rules of those fields. You can't do that. You need to
> choose, and declare, what rules you are working under. If you want to
> change fundamental definitions, fine, but then say your results are
> applicable to things based on the definitions you changed from.
>>
>>> This sub-thread is a good example of this. Ben pointed out that the
>>> clearest way to express what you were doing would be to publish your
>>> CODE.
>>
>> By 35 years of software engineering I know that things are much more
>> easily understood at very high level abstractions and when you present a
>> myriad of details then things become utterly incomprehensible.
>
> Yes. You need to start at the high level, and that high level doesn't
> need hundreds of pages of traces to prove, or the editing down of that
> hundreds of pages to prove. If you can't describe it in a few paragraphs
> of words, you have lost your high level of abstraction.
>>
>>> Your answer was that people would be unable to understand the
>>> voluminous TRACE.
>>
>> Unless things are presented at very high level abstractions the forest
>> will always be utterly obscured by all the trees.
>>
>> What we have agreed to so far this version of H_Hat() is infinitely
>> recursive if Simulate() returns 1 when its input halts and otherwise
>> does not return.
>>
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Simulate(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>
> PROBLEM. A 'Simulate' function does not return a 'Halting Status', You
> have mixed up you abstractions at this point.
>
> From your previous behavior, it is clear that you are likely at some
> point in the future going to change Simulate to Halt_Decider (or some
> other name), which is a VERY different sort of program, and then, the
> idea that a 'pure simulator' went infinitely recursive, isn't applicable
> to a function with a different interface condition.
>
> You may be able to state that H_Hat would be infinitely recursive if the
> Halt Decider didn't fullfill its requirements to answer in finite time,
> but that answer is not responsive to the question that it is actually
> needing to answer if you are in the domain of the Classical Halting Problem.
>>
>> In other words the x86 simulator is functionally equivalent to the
>> following code:
>>
>>
>> int Simulate(u32 P, u32 I)
>> {
>> ((void(*)(int))P)(I);
>> return 1;
>> }
>>
>>
>>> That is non-responsive, and tends to point that either
>>> the code doesn't exist, is much less developed than you have been
>>> claiming, or that it is of such awful quality you don't want to show it.
>>>
>>> If it is the latter, be advised that any reputable publication will
>>> insist that the code be published since you argument is based on its
>>> results, so it WILL be revealed.
>>>
>>
>> The other issue besides the code needing some cleanup is that publishing
>> the code may be a bar to publishing an academic paper based on the code.
>> Academic journals really want to have the first shot at publication.
>>
>>
>
> Puts you in a bit of a pickle then. You could go straight to the journal
> for peer review and be laughed out of the house (if it is a good journal),
>
> I also have been doing a bit of thinking on your previous presentations
> and will give you a few comments. Your current implementation of the
> simmulator actually fails to be a simple UTM equivalent for the
> following reason, for a standard computer program to be seen as a
> straight forward model of a Turing Machine, it needs to work under a few
> restrictions that your system isn't doing. These include:
>
> 1) The Code space needs to be 'Execute Only' (at least effectively)
> meaning that the code may not access the instructions in the code stream
> via read or write instructions, as this is capability that real Turning
> Machines do not have. Code that does this still does have a equivalent
> Turing Machine, but that equivalence is much more complicated.
>
> 2) The Data space needs to be diviable into two piece (none of which
> include the code space as said above), one part represents the 'State'
> of the Turing Machine, and the other the 'Tape' of the machine.
>
> Note, that this means that the H_Hat of the proof DOES need to be given
> a seperate copy of itself, as it can't just access its own code, and it
> does need to give two separate copies to the Halt Decider.
>
> Once you do this, I think you will find that your whole method falls
> apart, as you can no longer detect the recursion that your method
> depends, because that detection basically requires something akin to
> solving the halting problem.
>
If we assume that Simulate is functionally equivalent to the following
code (even if Simulate is an x86 emulator that emulates the x86 machine
code of its input):
int Simulate(u32 P, u32 I)
{
((void(*)(int))P)(I);
return 1;
}
// P has the machine address of H_Hat()
void H_Hat(u32 P)
{
u32 Input_Halts = Simulate(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
Then when the execution trace of H_Hat() shows that it invokes
Simulate() with the same data two times in sequence we can conclude that
H_Hat() is invoked in infinite recursion entirely based on this
execution trace and the assumption that Simulate() does nothing besides
execute or emulate its input.
We cannot proceed to the next step of elaboration until everyone agrees
with the above.
You can jump all around with you comments and analysis and all this will
simply be ignored. I will maintain a single-minded focus on the above
point until we have universal agreement.
--
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-03-01 14:38 -0500 |
| Message-ID | <Sob%H.12794$ZG1.10713@fx01.iad> |
| In reply to | #28191 |
On 3/1/21 11:43 AM, olcott wrote:
> If we assume that Simulate is functionally equivalent to the following
> code (even if Simulate is an x86 emulator that emulates the x86 machine
> code of its input):
>
> int Simulate(u32 P, u32 I)
> {
> ((void(*)(int))P)(I);
> return 1;
> }
>
> // P has the machine address of H_Hat()
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Simulate(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> Then when the execution trace of H_Hat() shows that it invokes
> Simulate() with the same data two times in sequence we can conclude that
> H_Hat() is invoked in infinite recursion entirely based on this
> execution trace and the assumption that Simulate() does nothing besides
> execute or emulate its input.
>
> We cannot proceed to the next step of elaboration until everyone agrees
> with the above.
>
> You can jump all around with you comments and analysis and all this will
> simply be ignored. I will maintain a single-minded focus on the above
> point until we have universal agreement.
>
As I have said, YES, given ALL the restrictions stated, then by
inspection of the code, we can see that it is infinitely recursive.
We don't need the trace, and the trace without a validate production
procedure actually proves nothing.
I will again note as a warning on future directions (which you are
likely going to just label as a diversion) Simulate is NOT suitable to
become a UTM, as it mixes the address space of the source machine and
the input tape, and all these observations are based on Simulate being a
PURE simulator, and not being changed to a Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-01 15:30 -0600 |
| Message-ID | <s_mdnVXO6s2VwKD9nZ2dnUU7-YHNnZ2d@giganews.com> |
| In reply to | #28201 |
On 3/1/2021 1:38 PM, Richard Damon wrote:
> On 3/1/21 11:43 AM, olcott wrote:
>> If we assume that Simulate is functionally equivalent to the following
>> code (even if Simulate is an x86 emulator that emulates the x86 machine
>> code of its input):
>>
>> int Simulate(u32 P, u32 I)
>> {
>> ((void(*)(int))P)(I);
>> return 1;
>> }
>>
>> // P has the machine address of H_Hat()
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Simulate(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> Then when the execution trace of H_Hat() shows that it invokes
>> Simulate() with the same data two times in sequence we can conclude that
>> H_Hat() is invoked in infinite recursion entirely based on this
>> execution trace and the assumption that Simulate() does nothing besides
>> execute or emulate its input.
>>
>> We cannot proceed to the next step of elaboration until everyone agrees
>> with the above.
>>
>> You can jump all around with you comments and analysis and all this will
>> simply be ignored. I will maintain a single-minded focus on the above
>> point until we have universal agreement.
>>
>
> As I have said, YES, given ALL the restrictions stated, then by
> inspection of the code, we can see that it is infinitely recursive.
>
> We don't need the trace, and the trace without a validate production
> procedure actually proves nothing.
When the machine language is understood within the context that it was
derived from a "C" compiler the calling conventions of the "C" program
can be mapped to their corresponding machine language parts, then
another program can examine the execution trace of these machine
instructions and decide infinite recursion.
The advantage of examining these things at the machine language level is
that we are provided with a complete directed graph of all execution
control flow. The "C" source code level does not provide this.
> I will again note as a warning on future directions (which you are
> likely going to just label as a diversion) Simulate is NOT suitable to
> become a UTM, as it mixes the address space of the source machine and
> the input tape, and all these observations are based on Simulate being a
> PURE simulator, and not being changed to a Halt Decider.
>
To the extent that a RASP machine is equivalent to a UTM an x86 emulator
is equivalent to a UTM. The abstract x86 language itself has no actual
upper bound to its memory access.
--
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-03-01 17:33 -0500 |
| Message-ID | <fZd%H.60$un1.16@fx18.iad> |
| In reply to | #28205 |
On 3/1/21 4:30 PM, olcott wrote:
> On 3/1/2021 1:38 PM, Richard Damon wrote:
>> On 3/1/21 11:43 AM, olcott wrote:
>>> If we assume that Simulate is functionally equivalent to the following
>>> code (even if Simulate is an x86 emulator that emulates the x86 machine
>>> code of its input):
>>>
>>> int Simulate(u32 P, u32 I)
>>> {
>>> ((void(*)(int))P)(I);
>>> return 1;
>>> }
>>>
>>> // P has the machine address of H_Hat()
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Simulate(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> Then when the execution trace of H_Hat() shows that it invokes
>>> Simulate() with the same data two times in sequence we can conclude that
>>> H_Hat() is invoked in infinite recursion entirely based on this
>>> execution trace and the assumption that Simulate() does nothing besides
>>> execute or emulate its input.
>>>
>>> We cannot proceed to the next step of elaboration until everyone agrees
>>> with the above.
>>>
>>> You can jump all around with you comments and analysis and all this will
>>> simply be ignored. I will maintain a single-minded focus on the above
>>> point until we have universal agreement.
>>>
>>
>> As I have said, YES, given ALL the restrictions stated, then by
>> inspection of the code, we can see that it is infinitely recursive.
>>
>> We don't need the trace, and the trace without a validate production
>> procedure actually proves nothing.
>
> When the machine language is understood within the context that it was
> derived from a "C" compiler the calling conventions of the "C" program
> can be mapped to their corresponding machine language parts, then
> another program can examine the execution trace of these machine
> instructions and decide infinite recursion.
>
> The advantage of examining these things at the machine language level is
> that we are provided with a complete directed graph of all execution
> control flow. The "C" source code level does not provide this.
>
But, you are missing the point, without access to the code generating
the trace, the trace itself is not proof, but just circumstantial
evidence. You started by talking about the need to work at the high
abstract level, which is correct. The appeal to these sorts of detail,
especially 'unverifiable' details, doesn't really help, but just acts as
a form of 'smoke and mirrors. If you recall, I have provided a number of
illustrative traces without all the need for the volumes of code.
Yes, perhaps you will get to the point where the question does become,
ok, that method makes sense, can it actually be built, and then all the
code might be needed, but so far, that isn't where we are now.
>> I will again note as a warning on future directions (which you are
>> likely going to just label as a diversion) Simulate is NOT suitable to
>> become a UTM, as it mixes the address space of the source machine and
>> the input tape, and all these observations are based on Simulate being a
>> PURE simulator, and not being changed to a Halt Decider.
>>
>
> To the extent that a RASP machine is equivalent to a UTM an x86 emulator
> is equivalent to a UTM. The abstract x86 language itself has no actual
> upper bound to its memory access.
>
Since a RASP machine is nothing like an equivalent to a UTM, that isn't
much to say. A RASP machine is the computational equivalent to a Turing
Machine, not a UTM. If a RASP machine was the equivalent of a UTM, then
I would just need to 'encode' the hardware description of some other
machine, and the software to run on it, and give it to it to run.
I don't have anything like that on any of my current RASP machines. Yes,
it might be possible to write such a thing, but it is not inherent in
the machine.
Note, that if you really look at it, actual Turing Machines actually
embody BOTH the hardware platform and the software emplaced on it. When
we talk about equivalences we do it on two different levels. One is that
a GIVEN program (which includes its implied hardware platform) to be the
computational equivalent to some Turing Machine, meaning that both
systems will eventually output the equivalent meaning results (or not
output results) in finite time. We also talk about equivalence at an
architecture level, where we imply that ALL programs we could create for
one system are the computational for some other program in the other system.
In that sense, there would be a program you could load into your RASP
machine to make it into a REAL UTM equivalent (you feed it the
description of a TM and its input, and it runs it), But then its input
would be an actual TM description, not the description of some equivalent.
What is seems you are trying to get to is to be able to write some x86
programs that meet the right requirements so that you can argue that
certain transformations you want to express in TM space, map to similar
transformations in x86 space. You also seem to have as idea that you
want to create an equivalent for a 'UTM'. One key feature of a UTM is
you can load ANY program into it, which create the requirement that in
your x86 equivalent for a UTM, the input program MUST have its own full
virtual memory space, the code running the UTM can't be reserving
chuncks of that memory space. This also means that this implies that
just because the simulated machine has hit the same address as an
address in the program calling the simulator, we don't have proof of a
recursive loop.
The other thing that I mentioned is that to keep the mapping between the
TM and the x86 program we need to restrict some of the features being
used on the x86 side, to make sure we are able to make the simple
mapping. One of the big restrictions is that Turing Machines have no
access to their own code, so the x86 program isn't allowed to either, so
it needs to run in an execution mode (or at least effectively run in
such a mode) that treats the code space as execute only, not data read
or write cycles, and not other data access methods can overlap that memory.
Yes, programs that do this do still have Turing Machine Equivalents, but
the mapping between them gets more complicated and you can't as easily
argue mapping of transformations.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-01 16:40 -0600 |
| Message-ID | <meKdnfqLZ7HH8KD9nZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #28208 |
On 3/1/2021 4:33 PM, Richard Damon wrote:
> On 3/1/21 4:30 PM, olcott wrote:
>> On 3/1/2021 1:38 PM, Richard Damon wrote:
>>> On 3/1/21 11:43 AM, olcott wrote:
>>>> If we assume that Simulate is functionally equivalent to the following
>>>> code (even if Simulate is an x86 emulator that emulates the x86 machine
>>>> code of its input):
>>>>
>>>> int Simulate(u32 P, u32 I)
>>>> {
>>>> ((void(*)(int))P)(I);
>>>> return 1;
>>>> }
>>>>
>>>> // P has the machine address of H_Hat()
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Simulate(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> Then when the execution trace of H_Hat() shows that it invokes
>>>> Simulate() with the same data two times in sequence we can conclude that
>>>> H_Hat() is invoked in infinite recursion entirely based on this
>>>> execution trace and the assumption that Simulate() does nothing besides
>>>> execute or emulate its input.
>>>>
>>>> We cannot proceed to the next step of elaboration until everyone agrees
>>>> with the above.
>>>>
>>>> You can jump all around with you comments and analysis and all this will
>>>> simply be ignored. I will maintain a single-minded focus on the above
>>>> point until we have universal agreement.
>>>>
>>>
>>> As I have said, YES, given ALL the restrictions stated, then by
>>> inspection of the code, we can see that it is infinitely recursive.
>>>
>>> We don't need the trace, and the trace without a validate production
>>> procedure actually proves nothing.
>>
>> When the machine language is understood within the context that it was
>> derived from a "C" compiler the calling conventions of the "C" program
>> can be mapped to their corresponding machine language parts, then
>> another program can examine the execution trace of these machine
>> instructions and decide infinite recursion.
>>
>> The advantage of examining these things at the machine language level is
>> that we are provided with a complete directed graph of all execution
>> control flow. The "C" source code level does not provide this.
>>
>
> But, you are missing the point, without access to the code generating
> the trace, the trace itself is not proof, but just circumstantial
> evidence. You started by talking about the need to work at the high
> abstract level, which is correct. The appeal to these sorts of detail,
> especially 'unverifiable' details, doesn't really help, but just acts as
> a form of 'smoke and mirrors. If you recall, I have provided a number of
> illustrative traces without all the need for the volumes of code.
>
> Yes, perhaps you will get to the point where the question does become,
> ok, that method makes sense, can it actually be built, and then all the
> code might be needed, but so far, that isn't where we are now.
>
>>> I will again note as a warning on future directions (which you are
>>> likely going to just label as a diversion) Simulate is NOT suitable to
>>> become a UTM, as it mixes the address space of the source machine and
>>> the input tape, and all these observations are based on Simulate being a
>>> PURE simulator, and not being changed to a Halt Decider.
>>>
>>
>> To the extent that a RASP machine is equivalent to a UTM an x86 emulator
>> is equivalent to a UTM. The abstract x86 language itself has no actual
>> upper bound to its memory access.
>>
>
> Since a RASP machine is nothing like an equivalent to a UTM, that isn't
> much to say. A RASP machine is the computational equivalent to a Turing
> Machine, not a UTM.
As before I am stopping at your first big mistake, the "stored program"
aspect of a [Random Access Stored Program] machine makes it equivalent
to a UTM. It is Soft-coded versus hard-coded.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 5 of 37 — ← Prev page 1 … 3 4 [5] 6 7 … 37 Next page →
Back to top | Article view | comp.theory
csiph-web