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 24 of 37 — ← Prev page 1 … 22 23 [24] 25 26 … 37 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 16:33 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306081935.324@kylheku.com> |
| In reply to | #28600 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/5/2021 5:42 PM, Kaz Kylheku wrote:
>> On 2021-03-05, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
>>>> The question is perfectly answerable to someone who has been beating
>>>> his wife.
>>>>
>>>> It isn't incorrect; rather, it presupposes the context that the subject
>>>> is a wife-beater, or that he even has a wife.
>>>
>>> I created the brand new idea of an incorrect question as any question
>>
>> You've not done a shred of philosophical research to validate your
>> claim that this idea is original.
>>
>
> Peter Olcott sci.lang Jan 31, 2015,
> Is the concept of [incorrect question] new?
> https://groups.google.com/g/sci.lang/c/lSdYexJ0ozo/m/aDN9-TYLHwIJ
>
> Peter Olcott sci.lang Feb 20, 2015
> The logical law of polar questions
> https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ
>
>> Like, how are yousure that some ancient Sumerian thinker did not hit
>> upon this obvious idea and carve it in cuneiform on a clay tablet?
>
> That is immaterial to my point.
>
> My point is that the concept of incorrect questions can be applied to
> decision problems such that decision problems are only undecidable
> because they are incorrect.
>
>>
>>>> That has nothing to do with the halting proof, though; it contains
>>>> no runaway feedback loop whereby a proposition negates itself.
>>>
>>> The original halting problem is defined as an incorrect decision problem
>>> (analogous to an incorrect question) in that neither Boolean value that
>>> Halts() can return to H_Hat() is correct.
>>
>> That is false. Halts can only return one Boolean value, which is wrong.
>
> If Halts() returns true to H_Hat() it is the wrong answer.
> If Halts() returns false to H_Hat() it is the wrong answer.
>
> Thus proving that the decision problem is incorrect because neither
> value of true or false is correct.
>
>> If it could return either value, it would not be a function.
>
> When a TM has two final states indicating ACCEPT (halts) or REJECT (does
> not halt) its input and neither final state is correct then the decision
> problem is incorrect.
>
>> If we modify Halts to return a different value, it becomes a different
>> function, Halts2. Since H_Hat is built on Hals, it becomes a different
>> function, H_Hat2.
>>
>> To avoid making mistakes, we must use different names for different
>> functions!
>>
>
> The is not the way it is done in software engineering.
> From a software engineering point of view that is screwy nonsense.
From a software engineering point of view, you cannot have two
funcions of the same name in the same C file.
Why don't you show how Halts can return a different answer to H_Hat?
Without editing Halts and re-compiling it, and in the same source file.
The only way you can do it is by doing the honest thing and writing
different versions of Halts under different names, such as:
uint32 Halts_0(uint32 P, uint32 I)
{
return 0;
}
uint32 Halts_1(uint32 P, uint32 I)
{
return 1;
}
But H_Hat can only call one Halts. You need different H_Hat functions:
void H_Hat_0(uint32 P)
{
if (Halts_0(P, P))
for (;;);
}
void H_Hat_1(uint32 P)
{
if (Halts_1(P, P))
for (;;);
}
From this it is clear that there are two wrong answers (type casts
elided for clarity/brevity):
Halts_0(H_Hat_0, H_Hat_0) -> 0 // wrong! H_Hat_0(H_Hat_0) halts
Halts_1(H_Hat_1, H_Hat_1) -> 1 // wrong! H_Hat_1(H_Hat_1) doesn't halt
Both decideders are wrong about completely different test cases.
Halts_0 is wrong about H_Hat_0(H_Hat_0).
Halts_1 is wrong about H_Hat_1(H_Hat_0).
But, these are right:
Halts_0(H_Hat_1, H_Hat_1)
Halts_1(H_Hat_0, H_Hat_0)
You see that? Halts_0 is wrong about H_Hat_0. But the modified Halts_1
is right about the same test case, H_Hat_0:
Halts_0(H_Hat_0, H_Hat_0) -> 0 // wrong, H_Hat_0(H_Hat_0) halts!
Halts_1(H_Hat_0, H_Hat_0) -> 1 // right!
You see? The modified new version of Halts_0, named Halts_1, gets
the right answer about the original H_Hat_0 that Halts_0 is wrong
about.
This refutes your claim that Halts cannot be altered to return the
correct answer. Obviously, it can.
Using "software engineering" and all.
You've confused yourself using software engineering, by editing the
file in place, and believing that when you change Halts, the test
case is still the same one. This is not so, because Halts is integrated
into H_Hat. Change Halts, and you change H_Hat.
Putting it all into one program that compiles can point the way
toward clearer thinking.
When you change Halts to get the right answer, you must judge that
excution **on the exact same test case**: the same two inputs!
Don't you think that is something a proper software engineer would know?
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 10:45 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <AeadnXEkAvI5LN79nZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #28655 |
On 3/6/2021 10:33 AM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/5/2021 5:42 PM, Kaz Kylheku wrote:
>>> On 2021-03-05, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
>>>>> The question is perfectly answerable to someone who has been beating
>>>>> his wife.
>>>>>
>>>>> It isn't incorrect; rather, it presupposes the context that the subject
>>>>> is a wife-beater, or that he even has a wife.
>>>>
>>>> I created the brand new idea of an incorrect question as any question
>>>
>>> You've not done a shred of philosophical research to validate your
>>> claim that this idea is original.
>>>
>>
>> Peter Olcott sci.lang Jan 31, 2015,
>> Is the concept of [incorrect question] new?
>> https://groups.google.com/g/sci.lang/c/lSdYexJ0ozo/m/aDN9-TYLHwIJ
>>
>> Peter Olcott sci.lang Feb 20, 2015
>> The logical law of polar questions
>> https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ
>>
>>> Like, how are yousure that some ancient Sumerian thinker did not hit
>>> upon this obvious idea and carve it in cuneiform on a clay tablet?
>>
>> That is immaterial to my point.
>>
>> My point is that the concept of incorrect questions can be applied to
>> decision problems such that decision problems are only undecidable
>> because they are incorrect.
>>
>>>
>>>>> That has nothing to do with the halting proof, though; it contains
>>>>> no runaway feedback loop whereby a proposition negates itself.
>>>>
>>>> The original halting problem is defined as an incorrect decision problem
>>>> (analogous to an incorrect question) in that neither Boolean value that
>>>> Halts() can return to H_Hat() is correct.
>>>
>>> That is false. Halts can only return one Boolean value, which is wrong.
>>
>> If Halts() returns true to H_Hat() it is the wrong answer.
>> If Halts() returns false to H_Hat() it is the wrong answer.
>>
>> Thus proving that the decision problem is incorrect because neither
>> value of true or false is correct.
>>
>>> If it could return either value, it would not be a function.
>>
>> When a TM has two final states indicating ACCEPT (halts) or REJECT (does
>> not halt) its input and neither final state is correct then the decision
>> problem is incorrect.
>>
>>> If we modify Halts to return a different value, it becomes a different
>>> function, Halts2. Since H_Hat is built on Hals, it becomes a different
>>> function, H_Hat2.
>>>
>>> To avoid making mistakes, we must use different names for different
>>> functions!
>>>
>>
>> The is not the way it is done in software engineering.
>> From a software engineering point of view that is screwy nonsense.
>
> From a software engineering point of view, you cannot have two
> funcions of the same name in the same C file.
>
In software engineering a function has the same name regardless of its
differing inputs or differing return values based on these differing
inputs.
> Why don't you show how Halts can return a different answer to H_Hat?
I stop at the first mistake. Every halt decider that bases its halting
decision on examining the execution trace of its simulation of its input
would be invoked in infinite recursion for this input:
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
An adapted UTM can decide whether or not an input finite string
represents a Turing Machine that would halt on its input without having
its simulation stopped by this adapted UTM.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 17:02 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306085408.944@kylheku.com> |
| In reply to | #28656 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 10:33 AM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/5/2021 5:42 PM, Kaz Kylheku wrote:
>>>> On 2021-03-05, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
>>>>>> The question is perfectly answerable to someone who has been beating
>>>>>> his wife.
>>>>>>
>>>>>> It isn't incorrect; rather, it presupposes the context that the subject
>>>>>> is a wife-beater, or that he even has a wife.
>>>>>
>>>>> I created the brand new idea of an incorrect question as any question
>>>>
>>>> You've not done a shred of philosophical research to validate your
>>>> claim that this idea is original.
>>>>
>>>
>>> Peter Olcott sci.lang Jan 31, 2015,
>>> Is the concept of [incorrect question] new?
>>> https://groups.google.com/g/sci.lang/c/lSdYexJ0ozo/m/aDN9-TYLHwIJ
>>>
>>> Peter Olcott sci.lang Feb 20, 2015
>>> The logical law of polar questions
>>> https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ
>>>
>>>> Like, how are yousure that some ancient Sumerian thinker did not hit
>>>> upon this obvious idea and carve it in cuneiform on a clay tablet?
>>>
>>> That is immaterial to my point.
>>>
>>> My point is that the concept of incorrect questions can be applied to
>>> decision problems such that decision problems are only undecidable
>>> because they are incorrect.
>>>
>>>>
>>>>>> That has nothing to do with the halting proof, though; it contains
>>>>>> no runaway feedback loop whereby a proposition negates itself.
>>>>>
>>>>> The original halting problem is defined as an incorrect decision problem
>>>>> (analogous to an incorrect question) in that neither Boolean value that
>>>>> Halts() can return to H_Hat() is correct.
>>>>
>>>> That is false. Halts can only return one Boolean value, which is wrong.
>>>
>>> If Halts() returns true to H_Hat() it is the wrong answer.
>>> If Halts() returns false to H_Hat() it is the wrong answer.
>>>
>>> Thus proving that the decision problem is incorrect because neither
>>> value of true or false is correct.
>>>
>>>> If it could return either value, it would not be a function.
>>>
>>> When a TM has two final states indicating ACCEPT (halts) or REJECT (does
>>> not halt) its input and neither final state is correct then the decision
>>> problem is incorrect.
>>>
>>>> If we modify Halts to return a different value, it becomes a different
>>>> function, Halts2. Since H_Hat is built on Hals, it becomes a different
>>>> function, H_Hat2.
>>>>
>>>> To avoid making mistakes, we must use different names for different
>>>> functions!
>>>>
>>>
>>> The is not the way it is done in software engineering.
>>> From a software engineering point of view that is screwy nonsense.
>>
>> From a software engineering point of view, you cannot have two
>> funcions of the same name in the same C file.
>>
>
> In software engineering a function has the same name regardless of its
> differing inputs or differing return values based on these differing
> inputs.
Completely tangential to my point.
>
>> Why don't you show how Halts can return a different answer to H_Hat?
>
> I stop at the first mistake.
Yes you do, only then you re-post it thousands of times to Usenet.
> Every halt decider that bases its halting
> decision on examining the execution trace of its simulation of its input
> would be invoked in infinite recursion for this input:
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
There is no "every halt decider here", only one the function Halts.
The above function H_Hat and Halts are what they are.
They are involved in a failing test case:
Halts(H_Hat, H_Hat); // fails.
If you want to try another decider, you have to write a different
function Halts2, and try it *on the same test case*:
Halts2(H_Hat, H_Hat); // different decider, SAME TEST CASE
Halts2 can easily be developed such that it gets the test
case right.
If Halts2 is based on Halts, then, informally, we can say that Halts
has been fixed to give the right answer.
Halts2 is wrong about a different test case.
Halts2(H_Hat2, H_Hat2); // different decider, different test case
H_Hat2 is a new function, similar to but different from H_Hat. It
differs in that it calls Halts2 instead of Halts.
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 11:15 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <8Kydnf9KcsUPJd79nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #28659 |
On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 10:33 AM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/5/2021 5:42 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-05, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 3/4/2021 3:05 PM, Kaz Kylheku wrote:
>>>>>>> The question is perfectly answerable to someone who has been beating
>>>>>>> his wife.
>>>>>>>
>>>>>>> It isn't incorrect; rather, it presupposes the context that the subject
>>>>>>> is a wife-beater, or that he even has a wife.
>>>>>>
>>>>>> I created the brand new idea of an incorrect question as any question
>>>>>
>>>>> You've not done a shred of philosophical research to validate your
>>>>> claim that this idea is original.
>>>>>
>>>>
>>>> Peter Olcott sci.lang Jan 31, 2015,
>>>> Is the concept of [incorrect question] new?
>>>> https://groups.google.com/g/sci.lang/c/lSdYexJ0ozo/m/aDN9-TYLHwIJ
>>>>
>>>> Peter Olcott sci.lang Feb 20, 2015
>>>> The logical law of polar questions
>>>> https://groups.google.com/g/sci.lang/c/AO5Vlupeelo/m/nxJy7N2vULwJ
>>>>
>>>>> Like, how are yousure that some ancient Sumerian thinker did not hit
>>>>> upon this obvious idea and carve it in cuneiform on a clay tablet?
>>>>
>>>> That is immaterial to my point.
>>>>
>>>> My point is that the concept of incorrect questions can be applied to
>>>> decision problems such that decision problems are only undecidable
>>>> because they are incorrect.
>>>>
>>>>>
>>>>>>> That has nothing to do with the halting proof, though; it contains
>>>>>>> no runaway feedback loop whereby a proposition negates itself.
>>>>>>
>>>>>> The original halting problem is defined as an incorrect decision problem
>>>>>> (analogous to an incorrect question) in that neither Boolean value that
>>>>>> Halts() can return to H_Hat() is correct.
>>>>>
>>>>> That is false. Halts can only return one Boolean value, which is wrong.
>>>>
>>>> If Halts() returns true to H_Hat() it is the wrong answer.
>>>> If Halts() returns false to H_Hat() it is the wrong answer.
>>>>
>>>> Thus proving that the decision problem is incorrect because neither
>>>> value of true or false is correct.
>>>>
>>>>> If it could return either value, it would not be a function.
>>>>
>>>> When a TM has two final states indicating ACCEPT (halts) or REJECT (does
>>>> not halt) its input and neither final state is correct then the decision
>>>> problem is incorrect.
>>>>
>>>>> If we modify Halts to return a different value, it becomes a different
>>>>> function, Halts2. Since H_Hat is built on Hals, it becomes a different
>>>>> function, H_Hat2.
>>>>>
>>>>> To avoid making mistakes, we must use different names for different
>>>>> functions!
>>>>>
>>>>
>>>> The is not the way it is done in software engineering.
>>>> From a software engineering point of view that is screwy nonsense.
>>>
>>> From a software engineering point of view, you cannot have two
>>> funcions of the same name in the same C file.
>>>
>>
>> In software engineering a function has the same name regardless of its
>> differing inputs or differing return values based on these differing
>> inputs.
>
> Completely tangential to my point.
>>
>>> Why don't you show how Halts can return a different answer to H_Hat?
>>
>> I stop at the first mistake.
>
> Yes you do, only then you re-post it thousands of times to Usenet.
>
>> Every halt decider that bases its halting
>> decision on examining the execution trace of its simulation of its input
>> would be invoked in infinite recursion for this input:
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>
> There is no "every halt decider here", only one the function Halts.
Since the body of Halts() is unspecified in the exact same way that the
body of the Linz H is unspecified, Halts() defines in infinite set of
halt deciders that has been stipulating to only include the set of halt
deciders that base their halting decision on examining their own
execution trace of their simulation of their input.
> The above function H_Hat and Halts are what they are.
>
> They are involved in a failing test case:
>
> Halts(H_Hat, H_Hat); // fails.
No not at all. This merely shows that you are ignoring what I am saying
and replying on the basis of boiler-plate conventional answers.
Unlike every examination of the halting problem besides mine, H_Hat()
calls Halts() in infinite recursion.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 18:07 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306100249.969@kylheku.com> |
| In reply to | #28661 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>> Every halt decider that bases its halting
>>> decision on examining the execution trace of its simulation of its input
>>> would be invoked in infinite recursion for this input:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>
>> There is no "every halt decider here", only one the function Halts.
>
> Since the body of Halts() is unspecified in the exact same way that the
The body of Halts is completely specified. The QA engineer who developts
H_Hat waits for a Halts implementation from the halting engineer, and
then writes H_Hat around it. That is then fixed in stone.
The question of whether H_Hat(H_Hat) halts depends on that exact Halts
implementation. Any other function similar to H_Hat based on a different
Halts implementation is a different function.
> body of the Linz H is unspecified, Halts() defines in infinite set of
Don't confuse Linz Schminz into it. I'm talking purely about software
engineering. :)
> halt deciders that has been stipulating to only include the set of halt
> deciders that base their halting decision on examining their own
> execution trace of their simulation of their input.
>
>> The above function H_Hat and Halts are what they are.
>>
>> They are involved in a failing test case:
>>
>> Halts(H_Hat, H_Hat); // fails.
>
> No not at all. This merely shows that you are ignoring what I am saying
Well, yes; what you are saying is simple-minded nonsense that needs
to be countered with sense.
> and replying on the basis of boiler-plate conventional answers.
>
> Unlike every examination of the halting problem besides mine, H_Hat()
> calls Halts() in infinite recursion.
That's only true for a particular kind of Halts which simply calls its
input, or simulates it.
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 12:14 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <f4edndXDNI3HW979nZ2dnUU7-K3NnZ2d@giganews.com> |
| In reply to | #28665 |
On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>> Every halt decider that bases its halting
>>>> decision on examining the execution trace of its simulation of its input
>>>> would be invoked in infinite recursion for this input:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> }
>>>
>>> There is no "every halt decider here", only one the function Halts.
>>
>> Since the body of Halts() is unspecified in the exact same way that the
>
> The body of Halts is completely specified. The QA engineer who developts
> H_Hat waits for a Halts implementation from the halting engineer, and
> then writes H_Hat around it. That is then fixed in stone.
I stop of the first mistake:
OK since the body of Halts() is fully specified by my post please
cut-and-paste the complete body of the Halts() source-code from my post
to this point right here:
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 12:25 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <0tSdneJe--aMVN79nZ2dnUU7-SXNnZ2d@giganews.com> |
| In reply to | #28666 |
On 3/6/2021 12:14 PM, olcott wrote:
> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>> Every halt decider that bases its halting
>>>>> decision on examining the execution trace of its simulation of its
>>>>> input
>>>>> would be invoked in infinite recursion for this input:
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> }
>>>>
>>>> There is no "every halt decider here", only one the function Halts.
>>>
>>> Since the body of Halts() is unspecified in the exact same way that the
>>
>> The body of Halts is completely specified. The QA engineer who developts
>> H_Hat waits for a Halts implementation from the halting engineer, and
>> then writes H_Hat around it. That is then fixed in stone.
>
> I stop of the first mistake:
>
> OK since the body of Halts() is fully specified by my post please
> cut-and-paste the complete body of the Halts() source-code from my post
> to this point right here:
Your double-talk is preventing you from acknowledging the the truth of
what I say. https://www.merriam-webster.com/dictionary/double-talk
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 19:06 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306110353.301@kylheku.com> |
| In reply to | #28667 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 12:14 PM, olcott wrote:
>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>> Every halt decider that bases its halting
>>>>>> decision on examining the execution trace of its simulation of its
>>>>>> input
>>>>>> would be invoked in infinite recursion for this input:
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>
>>>>> There is no "every halt decider here", only one the function Halts.
>>>>
>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>
>>> The body of Halts is completely specified. The QA engineer who developts
>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>> then writes H_Hat around it. That is then fixed in stone.
>>
>> I stop of the first mistake:
>>
>> OK since the body of Halts() is fully specified by my post please
>> cut-and-paste the complete body of the Halts() source-code from my post
>> to this point right here:
>
> Your double-talk is preventing you from acknowledging the the truth of
> what I say. https://www.merriam-webster.com/dictionary/double-talk
The truth is that without a definition of Halts, we don't have a
complete program. Trying to compile and link the program will result in
diagnostics, and no executable. An incomplete program is a one-handed
clap.
In a complete program, Halts is pinned down.
If we change Halts in any way, we have a different program.
Since the key test case in the program involves feeding a piece of the
program to itself, if we have a different program, we have a different
test case.
The correct view is to include both test cases in the same program,
which requires different names to be used for the entities.
That clarifies the thinking.
You clearly would prefer to remain in the dark.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 18:25 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306102404.761@kylheku.com> |
| In reply to | #28666 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>> Every halt decider that bases its halting
>>>>> decision on examining the execution trace of its simulation of its input
>>>>> would be invoked in infinite recursion for this input:
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> }
>>>>
>>>> There is no "every halt decider here", only one the function Halts.
>>>
>>> Since the body of Halts() is unspecified in the exact same way that the
>>
>> The body of Halts is completely specified. The QA engineer who developts
>> H_Hat waits for a Halts implementation from the halting engineer, and
>> then writes H_Hat around it. That is then fixed in stone.
>
> I stop of the first mistake:
If that were actually true, you would never reach the point of
hitting the post button.
> OK since the body of Halts() is fully specified by my post please
> cut-and-paste the complete body of the Halts() source-code from my post
> to this point right here:
Please supply a program that compiles and links first,
Mr. Software Engineer.
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 12:53 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <yaydnd9ObtjlUt79nZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #28668 |
On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>> Every halt decider that bases its halting
>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>> would be invoked in infinite recursion for this input:
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>
>>>>> There is no "every halt decider here", only one the function Halts.
>>>>
>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>
>>> The body of Halts is completely specified. The QA engineer who developts
>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>> then writes H_Hat around it. That is then fixed in stone.
>>
>> I stop of the first mistake:
>
> If that were actually true, you would never reach the point of
> hitting the post button.
>
>> OK since the body of Halts() is fully specified by my post please
>> cut-and-paste the complete body of the Halts() source-code from my post
>> to this point right here:
>
> Please supply a program that compiles and links first,
> Mr. Software Engineer.
I can't supply this program because academic journals greatly prefer to
only publish previously unpublished material.
I have published 100% of all of the details of the input data that the
halt decider uses as the basis for its halting decision. Anyone
understanding the mapping between C and the x86 language could totally
reverse-engineer the halt decider code on the basis of this x86 machine
language execution trace.
An adapted UTM can decide whether or not an input finite string
represents a Turing Machine that would halt on its input without having
its simulation stopped by this adapted UTM.
None of the conventional HP proofs show that this is impossible.
Once the pathological self-reference error is removed from the halting
decision problem this corrected decision problem becomes decidable.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 19:13 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306110618.532@kylheku.com> |
| In reply to | #28670 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>> Every halt decider that bases its halting
>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>
>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>
>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>
>>>> The body of Halts is completely specified. The QA engineer who developts
>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>> then writes H_Hat around it. That is then fixed in stone.
>>>
>>> I stop of the first mistake:
>>
>> If that were actually true, you would never reach the point of
>> hitting the post button.
>>
>>> OK since the body of Halts() is fully specified by my post please
>>> cut-and-paste the complete body of the Halts() source-code from my post
>>> to this point right here:
>>
>> Please supply a program that compiles and links first,
>> Mr. Software Engineer.
>
> I can't supply this program because academic journals greatly prefer to
> only publish previously unpublished material.
That's not what I'm saying. Supply *any* program at all that is
complete, with a definition of Halts. How about this definition of
Halts:
uint32_t Halts(uint32_t P, uint32_t I)
{
return 0;
}
OK, now we have a complete program we can talk about. It has
a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
But H_Hat(H_Hat) halts, so that is wrong.
Halts doesn't return any other value than 0; the idea whether it "can"
the correct value is meaningless. Halts cannot be anything other than the
above. A function that returns other than zero is not the above Halts.
If we want a different decider, we have to add a new function under
a different name:
Halts2(uint32 P, uin32_t I)
{
return 1;
}
H_Hat doesn't call that function; it continues to call Halts. So now
we can try the same test case with Halts2.
Halts2(H_Hat, Hat);
this returns 1, correct.
So, we were able to take the Halts function, and use it as the
basis for creating a modified Halts2 function which correctly decides
the exact same test case which Halts got wrong.
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 14:25 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <0JednRTDudSWeN79nZ2dnUU7-dPNnZ2d@giganews.com> |
| In reply to | #28672 |
On 3/6/2021 1:13 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>>> Every halt decider that bases its halting
>>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>>
>>>>>>>> void H_Hat(u32 P)
>>>>>>>> {
>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>> if (Input_Halts)
>>>>>>>> HERE: goto HERE;
>>>>>>>> }
>>>>>>>
>>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>>
>>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>>
>>>>> The body of Halts is completely specified. The QA engineer who developts
>>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>>> then writes H_Hat around it. That is then fixed in stone.
>>>>
>>>> I stop of the first mistake:
>>>
>>> If that were actually true, you would never reach the point of
>>> hitting the post button.
>>>
>>>> OK since the body of Halts() is fully specified by my post please
>>>> cut-and-paste the complete body of the Halts() source-code from my post
>>>> to this point right here:
>>>
>>> Please supply a program that compiles and links first,
>>> Mr. Software Engineer.
>>
>> I can't supply this program because academic journals greatly prefer to
>> only publish previously unpublished material.
>
> That's not what I'm saying. Supply *any* program at all that is
> complete, with a definition of Halts. How about this definition of
> Halts:
>
> uint32_t Halts(uint32_t P, uint32_t I)
> {
> return 0;
> }
>
> OK, now we have a complete program we can talk about. It has
> a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
> But H_Hat(H_Hat) halts, so that is wrong.
>
> Halts doesn't return any other value than 0; the idea whether it "can"
> the correct value is meaningless. Halts cannot be anything other than the
> above. A function that returns other than zero is not the above Halts.
>
> If we want a different decider, we have to add a new function under
> a different name:
>
> Halts2(uint32 P, uin32_t I)
> {
> return 1;
> }
>
> H_Hat doesn't call that function; it continues to call Halts. So now
> we can try the same test case with Halts2.
>
> Halts2(H_Hat, Hat);
>
> this returns 1, correct.
>
> So, we were able to take the Halts function, and use it as the
> basis for creating a modified Halts2 function which correctly decides
> the exact same test case which Halts got wrong.
>
An adapted UTM can decide whether or not an input finite string
represents a Turing Machine that would halt on its input without having
its simulation stopped by this adapted UTM.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 21:00 +0000 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <20210306125931.558@kylheku.com> |
| In reply to | #28676 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 1:13 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>>>> Every halt decider that bases its halting
>>>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>>>
>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>> {
>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>> if (Input_Halts)
>>>>>>>>> HERE: goto HERE;
>>>>>>>>> }
>>>>>>>>
>>>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>>>
>>>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>>>
>>>>>> The body of Halts is completely specified. The QA engineer who developts
>>>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>>>> then writes H_Hat around it. That is then fixed in stone.
>>>>>
>>>>> I stop of the first mistake:
>>>>
>>>> If that were actually true, you would never reach the point of
>>>> hitting the post button.
>>>>
>>>>> OK since the body of Halts() is fully specified by my post please
>>>>> cut-and-paste the complete body of the Halts() source-code from my post
>>>>> to this point right here:
>>>>
>>>> Please supply a program that compiles and links first,
>>>> Mr. Software Engineer.
>>>
>>> I can't supply this program because academic journals greatly prefer to
>>> only publish previously unpublished material.
>>
>> That's not what I'm saying. Supply *any* program at all that is
>> complete, with a definition of Halts. How about this definition of
>> Halts:
>>
>> uint32_t Halts(uint32_t P, uint32_t I)
>> {
>> return 0;
>> }
>>
>> OK, now we have a complete program we can talk about. It has
>> a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
>> But H_Hat(H_Hat) halts, so that is wrong.
>>
>> Halts doesn't return any other value than 0; the idea whether it "can"
>> the correct value is meaningless. Halts cannot be anything other than the
>> above. A function that returns other than zero is not the above Halts.
>>
>> If we want a different decider, we have to add a new function under
>> a different name:
>>
>> Halts2(uint32 P, uin32_t I)
>> {
>> return 1;
>> }
>>
>> H_Hat doesn't call that function; it continues to call Halts. So now
>> we can try the same test case with Halts2.
>>
>> Halts2(H_Hat, Hat);
>>
>> this returns 1, correct.
>>
>> So, we were able to take the Halts function, and use it as the
>> basis for creating a modified Halts2 function which correctly decides
>> the exact same test case which Halts got wrong.
>>
>
> An adapted UTM can decide whether or not an input finite string
> represents a Turing Machine that would halt on its input without having
> its simulation stopped by this adapted UTM.
Uh, knock it off the math blather and stick to the software engineering?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 15:35 -0600 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <UsKdnXQi5fo5aN79nZ2dnUU7-I3NnZ2d@giganews.com> |
| In reply to | #28679 |
On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 1:13 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>>>>> Every halt decider that bases its halting
>>>>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>>>>
>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>> {
>>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>>> if (Input_Halts)
>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>>>>
>>>>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>>>>
>>>>>>> The body of Halts is completely specified. The QA engineer who developts
>>>>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>>>>> then writes H_Hat around it. That is then fixed in stone.
>>>>>>
>>>>>> I stop of the first mistake:
>>>>>
>>>>> If that were actually true, you would never reach the point of
>>>>> hitting the post button.
>>>>>
>>>>>> OK since the body of Halts() is fully specified by my post please
>>>>>> cut-and-paste the complete body of the Halts() source-code from my post
>>>>>> to this point right here:
>>>>>
>>>>> Please supply a program that compiles and links first,
>>>>> Mr. Software Engineer.
>>>>
>>>> I can't supply this program because academic journals greatly prefer to
>>>> only publish previously unpublished material.
>>>
>>> That's not what I'm saying. Supply *any* program at all that is
>>> complete, with a definition of Halts. How about this definition of
>>> Halts:
>>>
>>> uint32_t Halts(uint32_t P, uint32_t I)
>>> {
>>> return 0;
>>> }
>>>
>>> OK, now we have a complete program we can talk about. It has
>>> a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
>>> But H_Hat(H_Hat) halts, so that is wrong.
>>>
>>> Halts doesn't return any other value than 0; the idea whether it "can"
>>> the correct value is meaningless. Halts cannot be anything other than the
>>> above. A function that returns other than zero is not the above Halts.
>>>
>>> If we want a different decider, we have to add a new function under
>>> a different name:
>>>
>>> Halts2(uint32 P, uin32_t I)
>>> {
>>> return 1;
>>> }
>>>
>>> H_Hat doesn't call that function; it continues to call Halts. So now
>>> we can try the same test case with Halts2.
>>>
>>> Halts2(H_Hat, Hat);
>>>
>>> this returns 1, correct.
>>>
>>> So, we were able to take the Halts function, and use it as the
>>> basis for creating a modified Halts2 function which correctly decides
>>> the exact same test case which Halts got wrong.
>>>
>>
>> An adapted UTM can decide whether or not an input finite string
>> represents a Turing Machine that would halt on its input without having
>> its simulation stopped by this adapted UTM.
>
> Uh, knock it off the math blather and stick to the software engineering?
>
http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-06 23:07 +0000 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <20210306150545.584@kylheku.com> |
| In reply to | #28682 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 1:13 PM, Kaz Kylheku wrote:
>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>>>>>> Every halt decider that bases its halting
>>>>>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>>>>>
>>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>>> {
>>>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>>>> if (Input_Halts)
>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>>>>>
>>>>>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>>>>>
>>>>>>>> The body of Halts is completely specified. The QA engineer who developts
>>>>>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>>>>>> then writes H_Hat around it. That is then fixed in stone.
>>>>>>>
>>>>>>> I stop of the first mistake:
>>>>>>
>>>>>> If that were actually true, you would never reach the point of
>>>>>> hitting the post button.
>>>>>>
>>>>>>> OK since the body of Halts() is fully specified by my post please
>>>>>>> cut-and-paste the complete body of the Halts() source-code from my post
>>>>>>> to this point right here:
>>>>>>
>>>>>> Please supply a program that compiles and links first,
>>>>>> Mr. Software Engineer.
>>>>>
>>>>> I can't supply this program because academic journals greatly prefer to
>>>>> only publish previously unpublished material.
>>>>
>>>> That's not what I'm saying. Supply *any* program at all that is
>>>> complete, with a definition of Halts. How about this definition of
>>>> Halts:
>>>>
>>>> uint32_t Halts(uint32_t P, uint32_t I)
>>>> {
>>>> return 0;
>>>> }
>>>>
>>>> OK, now we have a complete program we can talk about. It has
>>>> a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
>>>> But H_Hat(H_Hat) halts, so that is wrong.
>>>>
>>>> Halts doesn't return any other value than 0; the idea whether it "can"
>>>> the correct value is meaningless. Halts cannot be anything other than the
>>>> above. A function that returns other than zero is not the above Halts.
>>>>
>>>> If we want a different decider, we have to add a new function under
>>>> a different name:
>>>>
>>>> Halts2(uint32 P, uin32_t I)
>>>> {
>>>> return 1;
>>>> }
>>>>
>>>> H_Hat doesn't call that function; it continues to call Halts. So now
>>>> we can try the same test case with Halts2.
>>>>
>>>> Halts2(H_Hat, Hat);
>>>>
>>>> this returns 1, correct.
>>>>
>>>> So, we were able to take the Halts function, and use it as the
>>>> basis for creating a modified Halts2 function which correctly decides
>>>> the exact same test case which Halts got wrong.
>>>>
>>>
>>> An adapted UTM can decide whether or not an input finite string
>>> represents a Turing Machine that would halt on its input without having
>>> its simulation stopped by this adapted UTM.
>>
>> Uh, knock it off the math blather and stick to the software engineering?
>>
>
> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
That puerile hogwash has nothing to do with the code, which contains
no paradox or self-reference.
Everything compiles. The type of every expression in the program is
checked by the compiler, and has a stable value at run-time.
>
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 17:33 -0600 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <8sidnWg-eL_WjNn9nZ2dnUU7-YXNnZ2d@giganews.com> |
| In reply to | #28690 |
On 3/6/2021 5:07 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 1:13 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>> On 3/6/2021 12:25 PM, Kaz Kylheku wrote:
>>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>> On 3/6/2021 12:07 PM, Kaz Kylheku wrote:
>>>>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>>>>> On 3/6/2021 11:02 AM, Kaz Kylheku wrote:
>>>>>>>>>>>> Every halt decider that bases its halting
>>>>>>>>>>>> decision on examining the execution trace of its simulation of its input
>>>>>>>>>>>> would be invoked in infinite recursion for this input:
>>>>>>>>>>>>
>>>>>>>>>>>> void H_Hat(u32 P)
>>>>>>>>>>>> {
>>>>>>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>>>>>>> if (Input_Halts)
>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> There is no "every halt decider here", only one the function Halts.
>>>>>>>>>>
>>>>>>>>>> Since the body of Halts() is unspecified in the exact same way that the
>>>>>>>>>
>>>>>>>>> The body of Halts is completely specified. The QA engineer who developts
>>>>>>>>> H_Hat waits for a Halts implementation from the halting engineer, and
>>>>>>>>> then writes H_Hat around it. That is then fixed in stone.
>>>>>>>>
>>>>>>>> I stop of the first mistake:
>>>>>>>
>>>>>>> If that were actually true, you would never reach the point of
>>>>>>> hitting the post button.
>>>>>>>
>>>>>>>> OK since the body of Halts() is fully specified by my post please
>>>>>>>> cut-and-paste the complete body of the Halts() source-code from my post
>>>>>>>> to this point right here:
>>>>>>>
>>>>>>> Please supply a program that compiles and links first,
>>>>>>> Mr. Software Engineer.
>>>>>>
>>>>>> I can't supply this program because academic journals greatly prefer to
>>>>>> only publish previously unpublished material.
>>>>>
>>>>> That's not what I'm saying. Supply *any* program at all that is
>>>>> complete, with a definition of Halts. How about this definition of
>>>>> Halts:
>>>>>
>>>>> uint32_t Halts(uint32_t P, uint32_t I)
>>>>> {
>>>>> return 0;
>>>>> }
>>>>>
>>>>> OK, now we have a complete program we can talk about. It has
>>>>> a test case: Halts(H_Hat, H_Hat) which returns 0 ("does not halt").
>>>>> But H_Hat(H_Hat) halts, so that is wrong.
>>>>>
>>>>> Halts doesn't return any other value than 0; the idea whether it "can"
>>>>> the correct value is meaningless. Halts cannot be anything other than the
>>>>> above. A function that returns other than zero is not the above Halts.
>>>>>
>>>>> If we want a different decider, we have to add a new function under
>>>>> a different name:
>>>>>
>>>>> Halts2(uint32 P, uin32_t I)
>>>>> {
>>>>> return 1;
>>>>> }
>>>>>
>>>>> H_Hat doesn't call that function; it continues to call Halts. So now
>>>>> we can try the same test case with Halts2.
>>>>>
>>>>> Halts2(H_Hat, Hat);
>>>>>
>>>>> this returns 1, correct.
>>>>>
>>>>> So, we were able to take the Halts function, and use it as the
>>>>> basis for creating a modified Halts2 function which correctly decides
>>>>> the exact same test case which Halts got wrong.
>>>>>
>>>>
>>>> An adapted UTM can decide whether or not an input finite string
>>>> represents a Turing Machine that would halt on its input without having
>>>> its simulation stopped by this adapted UTM.
>>>
>>> Uh, knock it off the math blather and stick to the software engineering?
>>>
>>
>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>
> That puerile hogwash has nothing to do with the code, which contains
> no paradox or self-reference.
>
> Everything compiles. The type of every expression in the program is
> checked by the compiler, and has a stable value at run-time.
When you don't have any actual valid critique you and Ben resort to
empty rhetoric entirely bereft of any supporting reasoning. Mindless
idiots may construe this as a valid critique.
Even a bot no smarter than the first bot: "Eliza" could do as well.
https://en.wikipedia.org/wiki/ELIZA
The fact is that I did show 100% of every single detail of exactly how
Halts() correctly decides not halting on H_Hat().
Of course you would make sure to ignore this if you don't give a rat's
ass for truth.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-07 03:34 +0000 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <20210306191718.837@kylheku.com> |
| In reply to | #28693 |
On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 5:07 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>> An adapted UTM can decide whether or not an input finite string
>>>>> represents a Turing Machine that would halt on its input without having
>>>>> its simulation stopped by this adapted UTM.
>>>>
>>>> Uh, knock it off the math blather and stick to the software engineering?
>>>>
>>>
>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>
>> That puerile hogwash has nothing to do with the code, which contains
>> no paradox or self-reference.
>>
>> Everything compiles. The type of every expression in the program is
>> checked by the compiler, and has a stable value at run-time.
>
> When you don't have any actual valid critique you and Ben resort to
> empty rhetoric entirely bereft of any supporting reasoning. Mindless
> idiots may construe this as a valid critique.
I have shown it with code that a new function can be derived
from Halts which changes its return value and decides H_Hat(H_Hat)
correctly.
Wanna see it again?
void H_Hat(uint32_t P)
{
if (Halts(P, P))
for(;;);
}
bool Halts(uint32_t P, uint32_t I)
{
return false;
}
Halts(H_Hat, H_Hat) is wrong. Can a decider be written, based on Halts, which
fixes that? Yes:
bool Halts2(uint32_t P, uint32_t I)
{
return true;
}
Halts2(H_Hat, H_Hat) is correct. It is a very similar function to Halts,
except that it returns true instead of false.
This disproves your claim that no matter what a decider returns, it is
incorrect.
Every halting test case has a correct answer. For every program P and
input I pair, P(I) either halts or does not halt.
When a halt decider gets a test case wrong, we can easily fix it for
that test case by flipping its return value (either for that test
case or for all test cases).
However, we have to pin down that exact test case. If the test case is built on
the decider, we have to make sure we don't mistakenly get fooled into analyzing
a different test case that is built on our modified decider.
> Even a bot no smarter than the first bot: "Eliza" could do as well.
> https://en.wikipedia.org/wiki/ELIZA
More relevant to you is this one:
https://en.wikipedia.org/wiki/ELIZA_effect
All your rhetoric is tinged with this effect: "The ELIZA effect, in
computer science, is the tendency to unconsciously assume computer
behaviors are analogous to human behaviors; that is,
anthropomorphisation."
That's what's going on when you say rubbish like what Halts "can" return
to H_Hat, and incorrect questions and whatever.
> The fact is that I did show 100% of every single detail of exactly how
> Halts() correctly decides not halting on H_Hat().
Umm, no; you were shown not to understand the output of your own
program.
I distinctly remember that the main() function pronounced that H_Hat
doesn't halt, when in fact that's exactly what happens.
When you were confronted with this, you went on some rant about
incorrect polar questions; the issue was never resolved.
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-06 21:40 -0600 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <qrWdnQWjetmr1tn9nZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #28734 |
On 3/6/2021 9:34 PM, Kaz Kylheku wrote:
> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>> On 3/6/2021 5:07 PM, Kaz Kylheku wrote:
>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>> An adapted UTM can decide whether or not an input finite string
>>>>>> represents a Turing Machine that would halt on its input without having
>>>>>> its simulation stopped by this adapted UTM.
>>>>>
>>>>> Uh, knock it off the math blather and stick to the software engineering?
>>>>>
>>>>
>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>
>>> That puerile hogwash has nothing to do with the code, which contains
>>> no paradox or self-reference.
>>>
>>> Everything compiles. The type of every expression in the program is
>>> checked by the compiler, and has a stable value at run-time.
>>
>> When you don't have any actual valid critique you and Ben resort to
>> empty rhetoric entirely bereft of any supporting reasoning. Mindless
>> idiots may construe this as a valid critique.
>
> I have shown it with code that a new function can be derived
> from Halts which changes its return value and decides H_Hat(H_Hat)
> correctly.
>
> Wanna see it again?
>
> void H_Hat(uint32_t P)
> {
> if (Halts(P, P))
> for(;;);
> }
>
> bool Halts(uint32_t P, uint32_t I)
> {
> return false;
> }
>
I will take this to mean that you don't understand the x86 langauge well
enough to evaluate my work and you are masking your ignorance with:
Disingenuous bullshit.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-07 17:16 +0000 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <20210307090632.136@kylheku.com> |
| In reply to | #28735 |
On 2021-03-07, olcott <NoOne@NoWhere.com> wrote:
> On 3/6/2021 9:34 PM, Kaz Kylheku wrote:
>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>> On 3/6/2021 5:07 PM, Kaz Kylheku wrote:
>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 3/6/2021 3:00 PM, Kaz Kylheku wrote:
>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote:
>>>>>>> An adapted UTM can decide whether or not an input finite string
>>>>>>> represents a Turing Machine that would halt on its input without having
>>>>>>> its simulation stopped by this adapted UTM.
>>>>>>
>>>>>> Uh, knock it off the math blather and stick to the software engineering?
>>>>>>
>>>>>
>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
>>>>
>>>> That puerile hogwash has nothing to do with the code, which contains
>>>> no paradox or self-reference.
>>>>
>>>> Everything compiles. The type of every expression in the program is
>>>> checked by the compiler, and has a stable value at run-time.
>>>
>>> When you don't have any actual valid critique you and Ben resort to
>>> empty rhetoric entirely bereft of any supporting reasoning. Mindless
>>> idiots may construe this as a valid critique.
>>
>> I have shown it with code that a new function can be derived
>> from Halts which changes its return value and decides H_Hat(H_Hat)
>> correctly.
>>
>> Wanna see it again?
>>
>> void H_Hat(uint32_t P)
>> {
>> if (Halts(P, P))
>> for(;;);
>> }
>>
>> bool Halts(uint32_t P, uint32_t I)
>> {
>> return false;
>> }
>>
> I will take this to mean that you don't understand the x86 langauge well
> enough to evaluate my work and you are masking your ignorance with:
>
> Disingenuous bullshit.
Working code (modulo some missing type casts, #includes andand a main
program) is disingenuous?
The code shows that a modified version of Halts can decide H_Hat(H_Hat).
When we introduce the modified Halts, we call it Halts2. The original
function remains unmodified. H_Hat also therefore remains the same;
it calls the original Halts.
Anyone who understands software engineering must see that this is
absolutely necessary, in order to pin down the test case: in order
for Halts and Halts2 to receive exactly the same pair of inputs,
so that we know they are attempting to decide the same thing.
Do you have any technical remarks about any of this this, or just more
weak attempts at insults?
--
TXR Programming Language: http://nongnu.org/txr
Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-07 17:12 -0600 |
| Subject | Re: Detecting infinite recursion (PDF) |
| Message-ID | <Of6dnexUJLImwNj9nZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #28767 |
On 3/7/2021 11:16 AM, Kaz Kylheku wrote: > On 2021-03-07, olcott <NoOne@NoWhere.com> wrote: >> On 3/6/2021 9:34 PM, Kaz Kylheku wrote: >>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote: >>>> On 3/6/2021 5:07 PM, Kaz Kylheku wrote: >>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 3/6/2021 3:00 PM, Kaz Kylheku wrote: >>>>>>> On 2021-03-06, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> An adapted UTM can decide whether or not an input finite string >>>>>>>> represents a Turing Machine that would halt on its input without having >>>>>>>> its simulation stopped by this adapted UTM. >>>>>>> >>>>>>> Uh, knock it off the math blather and stick to the software engineering? >>>>>>> >>>>>> >>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>> >>>>> That puerile hogwash has nothing to do with the code, which contains >>>>> no paradox or self-reference. If you want to have an actual dialogue then you must base your critique of my work on my actual work. The above file shows every single detail of exactly how the actual Halts() correctly decides that H_Hat() must have its simulation aborted to prevent its infinite execution. Once you understand and agree to this then we can move on to the next and possibly final step. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 24 of 37 — ← Prev page 1 … 22 23 [24] 25 26 … 37 Next page →
Back to top | Article view | comp.theory
csiph-web