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 28 of 37 — ← Prev page 1 … 26 27 [28] 29 30 … 37 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-03-09 17:29 +0000 |
| Subject | Re: Detecting infinite recursion (PDF) (nitwit) |
| Message-ID | <87a6rc6xs9.fsf@bsb.me.uk> |
| In reply to | #28912 |
Kaz Kylheku <563-365-8930@kylheku.com> writes: > On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >> On 3/8/2021 11:52 PM, Kaz Kylheku wrote: >>>> I will respond to you to the extent that you critique how this: >>>> >>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>> >>> That document refers to a local decider which, you have informed the >>> newsgroup, no longer exists; therefore, the document is obsolescent. >>>> >>>> is computationally equivalent to this: >>>> >>>> A halt decider UTM that simply simulates its input >>>> until its input halts on its own or the halt decider >>>> determines that its input would never halt on its own >>>> thus stops simulating it. >>>> >>>> And how that refutes the halting problem proofs. >>> >>> Your contraption may be able to stop on that troublesome test case, but >>> I don't believe it can return the correct value. >> >> It is returning a correct value. > > 1. Your Halts(H_Hat, H_Hat) returns 0. > 2. H_Hat(H_Hat) calls Halts(H_Hat, H_Hat). > 3. If H_Hat(H_Hat) receives 0, it halts. > -- > 4. Therefore, 0 is incorrect. I admire your persistence, but I can't really see the point. PO has declared this to what non halting should mean. He's been clear about that (off and on) for quite some time. He's not going to suddenly decide that halting is... well, halting, he's just going to try to find words to make PO-halting sound less daft: "it wouldn't halt if weren't halted so it's non-halting" won't really do it, so he's working on that. There has been considerable evolution about how this conclusion is arrived at in the specific case he obsesses about. There was the explicit idea that non-halting is the right answer because of what happens when the famous "line 15" in the "decider" was commented out. Then there was the "two programs" malarkey and there have been nested simulation and multiple "modes". None of it really matters except to keep people paying attention to him. Amazingly, even PO-halting is undecidable. He was quite clear about that too, back in November. In order to know when to stop a computation (and declare it PO-non-halting!) he needs a decider that: "accepts any and all non-halting inputs and rejects any and all halting inputs" clearly, just a conventional halt decider. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-09 07:59 -0500 |
| Subject | Re: Detecting infinite recursion (PDF) (nitwit) |
| Message-ID | <PiK1I.195794$OY.117987@fx38.iad> |
| In reply to | #28901 |
On 3/8/21 11:28 PM, olcott wrote: > I will respond to you to the extent that you critique how this: > > http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > > > is computationally equivalent to this: > > A halt decider UTM that simply simulates its input > until its input halts on its own or the halt decider > determines that its input would never halt on its own > thus stops simulating it. > > And how that refutes the halting problem proofs. > > Everyting else will be construed as a dishonest dodge. > I think that Ben masters the dishonest dodge in an attempt > to mask his ignorance of the subject matter. > It claims to refute the proofs by building a strawman with a different Halting Problem. The decision to detect 'would never halt' is flawed in that it doesn't take into account the conditional execution of the simulated halt decider itself. You have made the mistake of assuming the conclusion.
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2021-03-09 16:16 +0000 |
| Subject | Re: Detecting infinite recursion (PDF) (nitwit) |
| Message-ID | <s2870r$vq6$1@gioia.aioe.org> |
| In reply to | #28909 |
Richard Damon <Richard@damon-family.org> wrote: > On 3/8/21 11:28 PM, olcott wrote: >> I will respond to you to the extent that you critique how this: >> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >> is computationally equivalent to this: >> A halt decider UTM that simply simulates its input >> until its input halts on its own or the halt decider >> determines that its input would never halt on its own >> thus stops simulating it. >> And how that refutes the halting problem proofs. >> Everyting else will be construed as a dishonest dodge. >> I think that Ben masters the dishonest dodge in an attempt >> to mask his ignorance of the subject matter. > It claims to refute the proofs by building a strawman with a different > Halting Problem. > The decision to detect 'would never halt' is flawed in that it doesn't > take into account the conditional execution of the simulated halt > decider itself. > You have made the mistake of assuming the conclusion. That happened at least when O tried to "solve" the Halting Problem by detecting infinite recursion -- a known equivalent problem. (Whether a program in general reaches any specified point on all inputs -- e.g. on the inside of an "if" condition where a recursive call happens -- is the same as the HP). The joke part was the "halt detection" was carried out by a step-by-step simulator. Whether O has himself been in a loop on this problem the last few years is the same as the HP and a meta joke.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 10:26 -0600 |
| Subject | Refuting the halting problem proofs with fully operational code |
| Message-ID | <BfydnedSjaVdPNr9nZ2dnUU7-R_NnZ2d@giganews.com> |
| In reply to | #28914 |
On 3/9/2021 10:16 AM, R Kym Horsell wrote: > Richard Damon <Richard@damon-family.org> wrote: >> On 3/8/21 11:28 PM, olcott wrote: >>> I will respond to you to the extent that you critique how this: >>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>> is computationally equivalent to this: >>> A halt decider UTM that simply simulates its input >>> until its input halts on its own or the halt decider >>> determines that its input would never halt on its own >>> thus stops simulating it. >>> And how that refutes the halting problem proofs. >>> Everyting else will be construed as a dishonest dodge. >>> I think that Ben masters the dishonest dodge in an attempt >>> to mask his ignorance of the subject matter. >> It claims to refute the proofs by building a strawman with a different >> Halting Problem. >> The decision to detect 'would never halt' is flawed in that it doesn't >> take into account the conditional execution of the simulated halt >> decider itself. >> You have made the mistake of assuming the conclusion. > > That happened at least when O tried to "solve" the Halting Problem > by detecting infinite recursion -- a known equivalent problem. > (Whether a program in general reaches any specified point on all > inputs -- e.g. on the inside of an "if" condition where a recursive call > happens -- is the same as the HP). > > The joke part was the "halt detection" was carried out by a step-by-step > simulator. > > Whether O has himself been in a loop on this problem the last few years > is the same as the HP and a meta joke. > You can read the updated paper, I just added much more in depth analysis of exactly why the halting problem was previuosly considered unsolvable and why this never actually was the case. I provide an actual execution trace of fully operational code to prove my point. 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 | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-03-09 16:46 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <JDN1I.234359$aRZ2.189717@fx30.ams4> |
| In reply to | #28915 |
On 09/03/2021 16:26, olcott wrote: > On 3/9/2021 10:16 AM, R Kym Horsell wrote: >> Richard Damon <Richard@damon-family.org> wrote: >>> On 3/8/21 11:28 PM, olcott wrote: >>>> I will respond to you to the extent that you critique how this: >>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>> >>>> is computationally equivalent to this: >>>> A halt decider UTM that simply simulates its input >>>> until its input halts on its own or the halt decider >>>> determines that its input would never halt on its own >>>> thus stops simulating it. >>>> And how that refutes the halting problem proofs. >>>> Everyting else will be construed as a dishonest dodge. >>>> I think that Ben masters the dishonest dodge in an attempt >>>> to mask his ignorance of the subject matter. >>> It claims to refute the proofs by building a strawman with a different >>> Halting Problem. >>> The decision to detect 'would never halt' is flawed in that it doesn't >>> take into account the conditional execution of the simulated halt >>> decider itself. >>> You have made the mistake of assuming the conclusion. >> >> That happened at least when O tried to "solve" the Halting Problem >> by detecting infinite recursion -- a known equivalent problem. >> (Whether a program in general reaches any specified point on all >> inputs -- e.g. on the inside of an "if" condition where a recursive call >> happens -- is the same as the HP). >> >> The joke part was the "halt detection" was carried out by a step-by-step >> simulator. >> >> Whether O has himself been in a loop on this problem the last few years >> is the same as the HP and a meta joke. >> > > You can read the updated paper, I just added much more in depth analysis of > exactly why the halting problem was previuosly considered unsolvable and why > this never actually was the case. > > I provide an actual execution trace of fully operational code to prove my point. > > http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf Publishing your nonsense as a .pdf rather then a Usenet post doesn't increase its (or your) credibility, dear. Until you address conditional branching and mutable state you haven't refuted Turing. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 10:51 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <nM2dnYkTIZzqOtr9nZ2dnUU7-e-dnZ2d@giganews.com> |
| In reply to | #28917 |
On 3/9/2021 10:46 AM, Mr Flibble wrote: > On 09/03/2021 16:26, olcott wrote: >> On 3/9/2021 10:16 AM, R Kym Horsell wrote: >>> Richard Damon <Richard@damon-family.org> wrote: >>>> On 3/8/21 11:28 PM, olcott wrote: >>>>> I will respond to you to the extent that you critique how this: >>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>> >>>>> is computationally equivalent to this: >>>>> A halt decider UTM that simply simulates its input >>>>> until its input halts on its own or the halt decider >>>>> determines that its input would never halt on its own >>>>> thus stops simulating it. >>>>> And how that refutes the halting problem proofs. >>>>> Everyting else will be construed as a dishonest dodge. >>>>> I think that Ben masters the dishonest dodge in an attempt >>>>> to mask his ignorance of the subject matter. >>>> It claims to refute the proofs by building a strawman with a different >>>> Halting Problem. >>>> The decision to detect 'would never halt' is flawed in that it doesn't >>>> take into account the conditional execution of the simulated halt >>>> decider itself. >>>> You have made the mistake of assuming the conclusion. >>> >>> That happened at least when O tried to "solve" the Halting Problem >>> by detecting infinite recursion -- a known equivalent problem. >>> (Whether a program in general reaches any specified point on all >>> inputs -- e.g. on the inside of an "if" condition where a recursive call >>> happens -- is the same as the HP). >>> >>> The joke part was the "halt detection" was carried out by a step-by-step >>> simulator. >>> >>> Whether O has himself been in a loop on this problem the last few years >>> is the same as the HP and a meta joke. >>> >> >> You can read the updated paper, I just added much more in depth >> analysis of exactly why the halting problem was previuosly considered >> unsolvable and why this never actually was the case. >> >> I provide an actual execution trace of fully operational code to prove >> my point. >> >> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > > > Publishing your nonsense as a .pdf rather then a Usenet post doesn't > increase its (or your) credibility, dear. > > Until you address conditional branching and mutable state you haven't > refuted Turing. > > /Flibble > I don't know what you mean about mutable state. My code does show that it does correctly decide that unless Halts() stopped its simulation of H_Hat() that H_Hat() would otherwise be infinitely recursive. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-03-09 16:54 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <MKN1I.234360$aRZ2.208418@fx30.ams4> |
| In reply to | #28918 |
On 09/03/2021 16:51, olcott wrote: > On 3/9/2021 10:46 AM, Mr Flibble wrote: >> On 09/03/2021 16:26, olcott wrote: >>> On 3/9/2021 10:16 AM, R Kym Horsell wrote: >>>> Richard Damon <Richard@damon-family.org> wrote: >>>>> On 3/8/21 11:28 PM, olcott wrote: >>>>>> I will respond to you to the extent that you critique how this: >>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>>> >>>>>> is computationally equivalent to this: >>>>>> A halt decider UTM that simply simulates its input >>>>>> until its input halts on its own or the halt decider >>>>>> determines that its input would never halt on its own >>>>>> thus stops simulating it. >>>>>> And how that refutes the halting problem proofs. >>>>>> Everyting else will be construed as a dishonest dodge. >>>>>> I think that Ben masters the dishonest dodge in an attempt >>>>>> to mask his ignorance of the subject matter. >>>>> It claims to refute the proofs by building a strawman with a different >>>>> Halting Problem. >>>>> The decision to detect 'would never halt' is flawed in that it doesn't >>>>> take into account the conditional execution of the simulated halt >>>>> decider itself. >>>>> You have made the mistake of assuming the conclusion. >>>> >>>> That happened at least when O tried to "solve" the Halting Problem >>>> by detecting infinite recursion -- a known equivalent problem. >>>> (Whether a program in general reaches any specified point on all >>>> inputs -- e.g. on the inside of an "if" condition where a recursive call >>>> happens -- is the same as the HP). >>>> >>>> The joke part was the "halt detection" was carried out by a step-by-step >>>> simulator. >>>> >>>> Whether O has himself been in a loop on this problem the last few years >>>> is the same as the HP and a meta joke. >>>> >>> >>> You can read the updated paper, I just added much more in depth analysis of >>> exactly why the halting problem was previuosly considered unsolvable and why >>> this never actually was the case. >>> >>> I provide an actual execution trace of fully operational code to prove my point. >>> >>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >> >> >> >> Publishing your nonsense as a .pdf rather then a Usenet post doesn't increase >> its (or your) credibility, dear. >> >> Until you address conditional branching and mutable state you haven't refuted >> Turing. >> >> /Flibble >> > > I don't know what you mean about mutable state. > > My code does show that it does correctly decide that unless Halts() stopped its > simulation of H_Hat() that H_Hat() would otherwise be infinitely recursive. By mutable state I am referring to variables that have their values changed by an algorithm (or external I/O) and branching logic predicated on the values of those variables. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 11:00 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <dKqdnbhRm-0mNNr9nZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #28919 |
On 3/9/2021 10:54 AM, Mr Flibble wrote: > On 09/03/2021 16:51, olcott wrote: >> On 3/9/2021 10:46 AM, Mr Flibble wrote: >>> On 09/03/2021 16:26, olcott wrote: >>>> On 3/9/2021 10:16 AM, R Kym Horsell wrote: >>>>> Richard Damon <Richard@damon-family.org> wrote: >>>>>> On 3/8/21 11:28 PM, olcott wrote: >>>>>>> I will respond to you to the extent that you critique how this: >>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>>>> >>>>>>> is computationally equivalent to this: >>>>>>> A halt decider UTM that simply simulates its input >>>>>>> until its input halts on its own or the halt decider >>>>>>> determines that its input would never halt on its own >>>>>>> thus stops simulating it. >>>>>>> And how that refutes the halting problem proofs. >>>>>>> Everyting else will be construed as a dishonest dodge. >>>>>>> I think that Ben masters the dishonest dodge in an attempt >>>>>>> to mask his ignorance of the subject matter. >>>>>> It claims to refute the proofs by building a strawman with a >>>>>> different >>>>>> Halting Problem. >>>>>> The decision to detect 'would never halt' is flawed in that it >>>>>> doesn't >>>>>> take into account the conditional execution of the simulated halt >>>>>> decider itself. >>>>>> You have made the mistake of assuming the conclusion. >>>>> >>>>> That happened at least when O tried to "solve" the Halting Problem >>>>> by detecting infinite recursion -- a known equivalent problem. >>>>> (Whether a program in general reaches any specified point on all >>>>> inputs -- e.g. on the inside of an "if" condition where a recursive >>>>> call >>>>> happens -- is the same as the HP). >>>>> >>>>> The joke part was the "halt detection" was carried out by a >>>>> step-by-step >>>>> simulator. >>>>> >>>>> Whether O has himself been in a loop on this problem the last few >>>>> years >>>>> is the same as the HP and a meta joke. >>>>> >>>> >>>> You can read the updated paper, I just added much more in depth >>>> analysis of exactly why the halting problem was previuosly >>>> considered unsolvable and why this never actually was the case. >>>> >>>> I provide an actual execution trace of fully operational code to >>>> prove my point. >>>> >>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>> >>> >>> >>> >>> Publishing your nonsense as a .pdf rather then a Usenet post doesn't >>> increase its (or your) credibility, dear. >>> >>> Until you address conditional branching and mutable state you haven't >>> refuted Turing. >>> >>> /Flibble >>> >> >> I don't know what you mean about mutable state. >> >> My code does show that it does correctly decide that unless Halts() >> stopped its simulation of H_Hat() that H_Hat() would otherwise be >> infinitely recursive. > > By mutable state I am referring to variables that have their values > changed by an algorithm (or external I/O) and branching logic predicated > on the values of those variables. > > /Flibble > Certainly the execution trace of the instructions executed by a simulator would have to be continually updated as each subsequent instruction is executed. This would cause the total number of instructions simulated to be changed after each instruction has been simulated. This mutable state does not in any way effect the correctness of the decider's decision. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| Date | 2021-03-09 17:04 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <9UN1I.305630$eFV2.76139@fx29.ams4> |
| In reply to | #28921 |
On 09/03/2021 17:00, olcott wrote: > On 3/9/2021 10:54 AM, Mr Flibble wrote: >> On 09/03/2021 16:51, olcott wrote: >>> On 3/9/2021 10:46 AM, Mr Flibble wrote: >>>> On 09/03/2021 16:26, olcott wrote: >>>>> On 3/9/2021 10:16 AM, R Kym Horsell wrote: >>>>>> Richard Damon <Richard@damon-family.org> wrote: >>>>>>> On 3/8/21 11:28 PM, olcott wrote: >>>>>>>> I will respond to you to the extent that you critique how this: >>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>>>>> >>>>>>>> is computationally equivalent to this: >>>>>>>> A halt decider UTM that simply simulates its input >>>>>>>> until its input halts on its own or the halt decider >>>>>>>> determines that its input would never halt on its own >>>>>>>> thus stops simulating it. >>>>>>>> And how that refutes the halting problem proofs. >>>>>>>> Everyting else will be construed as a dishonest dodge. >>>>>>>> I think that Ben masters the dishonest dodge in an attempt >>>>>>>> to mask his ignorance of the subject matter. >>>>>>> It claims to refute the proofs by building a strawman with a different >>>>>>> Halting Problem. >>>>>>> The decision to detect 'would never halt' is flawed in that it doesn't >>>>>>> take into account the conditional execution of the simulated halt >>>>>>> decider itself. >>>>>>> You have made the mistake of assuming the conclusion. >>>>>> >>>>>> That happened at least when O tried to "solve" the Halting Problem >>>>>> by detecting infinite recursion -- a known equivalent problem. >>>>>> (Whether a program in general reaches any specified point on all >>>>>> inputs -- e.g. on the inside of an "if" condition where a recursive call >>>>>> happens -- is the same as the HP). >>>>>> >>>>>> The joke part was the "halt detection" was carried out by a step-by-step >>>>>> simulator. >>>>>> >>>>>> Whether O has himself been in a loop on this problem the last few years >>>>>> is the same as the HP and a meta joke. >>>>>> >>>>> >>>>> You can read the updated paper, I just added much more in depth analysis of >>>>> exactly why the halting problem was previuosly considered unsolvable and >>>>> why this never actually was the case. >>>>> >>>>> I provide an actual execution trace of fully operational code to prove my >>>>> point. >>>>> >>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>> >>>> >>>> >>>> >>>> >>>> Publishing your nonsense as a .pdf rather then a Usenet post doesn't >>>> increase its (or your) credibility, dear. >>>> >>>> Until you address conditional branching and mutable state you haven't >>>> refuted Turing. >>>> >>>> /Flibble >>>> >>> >>> I don't know what you mean about mutable state. >>> >>> My code does show that it does correctly decide that unless Halts() stopped >>> its simulation of H_Hat() that H_Hat() would otherwise be infinitely recursive. >> >> By mutable state I am referring to variables that have their values changed by >> an algorithm (or external I/O) and branching logic predicated on the values of >> those variables. >> >> /Flibble >> > > Certainly the execution trace of the instructions executed by a simulator would > have to be continually updated as each subsequent instruction is executed. This > would cause the total number of instructions simulated to be changed after each > instruction has been simulated. This mutable state does not in any way effect > the correctness of the decider's decision. Bullshit. Prove it. You can't. I say again: bullshit. /Flibble -- 😎
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 11:10 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <Ep6dndoF5puPMdr9nZ2dnUU7-RmdnZ2d@giganews.com> |
| In reply to | #28924 |
On 3/9/2021 11:04 AM, Mr Flibble wrote: > On 09/03/2021 17:00, olcott wrote: >> On 3/9/2021 10:54 AM, Mr Flibble wrote: >>> On 09/03/2021 16:51, olcott wrote: >>>> On 3/9/2021 10:46 AM, Mr Flibble wrote: >>>>> On 09/03/2021 16:26, olcott wrote: >>>>>> On 3/9/2021 10:16 AM, R Kym Horsell wrote: >>>>>>> Richard Damon <Richard@damon-family.org> wrote: >>>>>>>> On 3/8/21 11:28 PM, olcott wrote: >>>>>>>>> I will respond to you to the extent that you critique how this: >>>>>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>>>>>> >>>>>>>>> is computationally equivalent to this: >>>>>>>>> A halt decider UTM that simply simulates its input >>>>>>>>> until its input halts on its own or the halt decider >>>>>>>>> determines that its input would never halt on its own >>>>>>>>> thus stops simulating it. >>>>>>>>> And how that refutes the halting problem proofs. >>>>>>>>> Everyting else will be construed as a dishonest dodge. >>>>>>>>> I think that Ben masters the dishonest dodge in an attempt >>>>>>>>> to mask his ignorance of the subject matter. >>>>>>>> It claims to refute the proofs by building a strawman with a >>>>>>>> different >>>>>>>> Halting Problem. >>>>>>>> The decision to detect 'would never halt' is flawed in that it >>>>>>>> doesn't >>>>>>>> take into account the conditional execution of the simulated halt >>>>>>>> decider itself. >>>>>>>> You have made the mistake of assuming the conclusion. >>>>>>> >>>>>>> That happened at least when O tried to "solve" the Halting Problem >>>>>>> by detecting infinite recursion -- a known equivalent problem. >>>>>>> (Whether a program in general reaches any specified point on all >>>>>>> inputs -- e.g. on the inside of an "if" condition where a >>>>>>> recursive call >>>>>>> happens -- is the same as the HP). >>>>>>> >>>>>>> The joke part was the "halt detection" was carried out by a >>>>>>> step-by-step >>>>>>> simulator. >>>>>>> >>>>>>> Whether O has himself been in a loop on this problem the last few >>>>>>> years >>>>>>> is the same as the HP and a meta joke. >>>>>>> >>>>>> >>>>>> You can read the updated paper, I just added much more in depth >>>>>> analysis of exactly why the halting problem was previuosly >>>>>> considered unsolvable and why this never actually was the case. >>>>>> >>>>>> I provide an actual execution trace of fully operational code to >>>>>> prove my point. >>>>>> >>>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> Publishing your nonsense as a .pdf rather then a Usenet post >>>>> doesn't increase its (or your) credibility, dear. >>>>> >>>>> Until you address conditional branching and mutable state you >>>>> haven't refuted Turing. >>>>> >>>>> /Flibble >>>>> >>>> >>>> I don't know what you mean about mutable state. >>>> >>>> My code does show that it does correctly decide that unless Halts() >>>> stopped its simulation of H_Hat() that H_Hat() would otherwise be >>>> infinitely recursive. >>> >>> By mutable state I am referring to variables that have their values >>> changed by an algorithm (or external I/O) and branching logic >>> predicated on the values of those variables. >>> >>> /Flibble >>> >> >> Certainly the execution trace of the instructions executed by a >> simulator would have to be continually updated as each subsequent >> instruction is executed. This would cause the total number of >> instructions simulated to be changed after each instruction has been >> simulated. This mutable state does not in any way effect the >> correctness of the decider's decision. > > Bullshit. Prove it. You can't. I say again: bullshit. > > /Flibble > Any bot could provide such a reply. A human would be able to point out any mistakes only if there are mistakes. My complete execution trace already proves my point. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2021-03-09 16:57 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <s289do$71k$1@gioia.aioe.org> |
| In reply to | #28915 |
In comp.theory olcott <NoOne@nowhere.com> wrote: > On 3/9/2021 10:16 AM, R Kym Horsell wrote: ... >> That happened at least when O tried to "solve" the Halting Problem >> by detecting infinite recursion -- a known equivalent problem. >> (Whether a program in general reaches any specified point on all >> inputs -- e.g. on the inside of an "if" condition where a recursive call >> happens -- is the same as the HP). >> The joke part was the "halt detection" was carried out by a step-by-step >> simulator. >> Whether O has himself been in a loop on this problem the last few years >> is the same as the HP and a meta joke. > You can read the updated paper, I just added much more in depth analysis > of exactly why the halting problem was previuosly considered unsolvable > and why this never actually was the case. > I provide an actual execution trace of fully operational code to prove > my point. Translation: I fully acknowledge my work is fundamentally flawed at the conceptual level. But look at my execution trace anyway. [Buzz click wirr] Pathological self-reference detected! [/Buzz click wirr]
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 11:02 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <dKqdnbtRm-26N9r9nZ2dnUU7-V2dnZ2d@giganews.com> |
| In reply to | #28920 |
On 3/9/2021 10:57 AM, R Kym Horsell wrote: > In comp.theory olcott <NoOne@nowhere.com> wrote: >> On 3/9/2021 10:16 AM, R Kym Horsell wrote: > ... >>> That happened at least when O tried to "solve" the Halting Problem >>> by detecting infinite recursion -- a known equivalent problem. >>> (Whether a program in general reaches any specified point on all >>> inputs -- e.g. on the inside of an "if" condition where a recursive call >>> happens -- is the same as the HP). >>> The joke part was the "halt detection" was carried out by a step-by-step >>> simulator. >>> Whether O has himself been in a loop on this problem the last few years >>> is the same as the HP and a meta joke. >> You can read the updated paper, I just added much more in depth analysis >> of exactly why the halting problem was previuosly considered unsolvable >> and why this never actually was the case. >> I provide an actual execution trace of fully operational code to prove >> my point. > > Translation: I fully acknowledge my work is fundamentally flawed > at the conceptual level. But look at my execution trace anyway. > > [Buzz click wirr] > Pathological self-reference detected! > [/Buzz click wirr] > Things that a bot would say... A human being would be able to actually examine the paper and point out any errors that may exist. -- 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-09 17:17 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <20210309090240.727@kylheku.com> |
| In reply to | #28915 |
On 2021-03-09, olcott <NoOne@NoWhere.com> wrote:
> You can read the updated paper, I just added much more in depth analysis
> of exactly why the halting problem was previuosly considered unsolvable
> and why this never actually was the case.
>
> I provide an actual execution trace of fully operational code to prove
> my point.
>
> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf
Updated? It looks like the same content as two days ago. It still
refers to a local decider which you said no longer exists; there is only
a global decider.
Anyone reading the code can see by inspection that if H_Hat(H_Hat) is
called, it must obtain a zero from Halts, and therefore it will halt.
Halts(H_Hat, H_Hat) stops, because "infinite recursion" is detected.
But the detection is flawed; it is based on incomplete data.
H_Hat is subroutine comprised of a few lines of source code, and a call
to a big helper function called Halts. Halts is not separable from
H_Hat.
You have stupidly removed a whole block fo a function, traced the
remaining instructions and claimed they are recursive.
You cannot do that.
The Halts(P, I) call is only removable from consideration if it has no
effect beyond passing control to P(I).
Your Halts(P, I) is a complicated function that steps a simulator over
code and evaluates terminating conditions. That is not equivalent
to P(I) and therefore not removable from the call graph.
Have you ever written a compiler?
A compiler could remove a basic block from the program's call graph, if
that block has no effect, beyond allowing control to pass through:
|
v
+-------+
| block |
+-------+
|
suppose block has one entry and one exit. Suppose it has no side effects
like I/O. And suppose it doesn't define any variables or registers that
are live on exit from the block. Then we can remove it, replacing it by
just the arrow:
|
|
v
Your Halts(P, I) block is kind of like this only as long as it just
peforms the call P(I): the exit arrow.
Once you stuff complicated simulation stepping and condition evaluation
semantics into it, it is not removable.
It is not removable because we no longer know whether it will behave
like a call to P(I) or whether it will make a decision that causes it
to return a value. It changes the control flow.
You cannot pretend that a control flow device is not there, and
consequently neglect to trace its instructions.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 11:24 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <GIKdnc-LC72mMtr9nZ2dnUU7-XvNnZ2d@giganews.com> |
| In reply to | #28927 |
On 3/9/2021 11:17 AM, Kaz Kylheku wrote: > On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >> You can read the updated paper, I just added much more in depth analysis >> of exactly why the halting problem was previuosly considered unsolvable >> and why this never actually was the case. >> >> I provide an actual execution trace of fully operational code to prove >> my point. >> >> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > > Updated? It looks like the same content as two days ago. It still > refers to a local decider which you said no longer exists; there is only > a global decider. > > Anyone reading the code can see by inspection that if H_Hat(H_Hat) is > called, it must obtain a zero from Halts, and therefore it will halt. > You know that whenever a software function invokes another software function in what would otherwise be infinite recursion if the execution of the first function was not aborted that the second function would never return any value to its caller in every case (aborted or not). Since I know that you know this that makes your above statement deliberately stupid. I don't know what to call deliberately stupid besides deceptive. Why lie? -- 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-09 17:35 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <20210309092942.904@kylheku.com> |
| In reply to | #28928 |
On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: > On 3/9/2021 11:17 AM, Kaz Kylheku wrote: >> On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >>> You can read the updated paper, I just added much more in depth analysis >>> of exactly why the halting problem was previuosly considered unsolvable >>> and why this never actually was the case. >>> >>> I provide an actual execution trace of fully operational code to prove >>> my point. >>> >>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >> >> Updated? It looks like the same content as two days ago. It still >> refers to a local decider which you said no longer exists; there is only >> a global decider. >> >> Anyone reading the code can see by inspection that if H_Hat(H_Hat) is >> called, it must obtain a zero from Halts, and therefore it will halt. >> > > You know that whenever a software function invokes another software > function in what would otherwise be infinite recursion if the execution > of the first function was not aborted that the second function would > never return any value to its caller in every case (aborted or not). I don't understand this subjunctive "would". That is your problem. When we say that a function "would" be something else, that is precisely the same thing as "isn't". "Would otherwise be infinite recursion" means "isn't infinite recursion". There is no "would be" in mathematics. Each object is what it is, and won't be that which it it isn't. Sure, we can make verbal constructions like "three would be an even number if it were one greater than it is", but that's just childish. > Since I know that you know this that makes your above statement > deliberately stupid. I don't know what to call deliberately stupid > besides deceptive. Why lie? The deliberately stupid and deceptive one is you. You have replaced a P(I) "decider" with a complicated machinery that traces instructions, and doesn't behave like P(I), yet you keep pretending that it's still P(I). -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 11:54 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) |
| Message-ID | <i8udnXlgo7HLK9r9nZ2dnUU7-SPNnZ2d@giganews.com> |
| In reply to | #28932 |
On 3/9/2021 11:35 AM, Kaz Kylheku wrote: > On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >> On 3/9/2021 11:17 AM, Kaz Kylheku wrote: >>> On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >>>> You can read the updated paper, I just added much more in depth analysis >>>> of exactly why the halting problem was previuosly considered unsolvable >>>> and why this never actually was the case. >>>> >>>> I provide an actual execution trace of fully operational code to prove >>>> my point. >>>> >>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>> >>> Updated? It looks like the same content as two days ago. It still >>> refers to a local decider which you said no longer exists; there is only >>> a global decider. >>> >>> Anyone reading the code can see by inspection that if H_Hat(H_Hat) is >>> called, it must obtain a zero from Halts, and therefore it will halt. >>> >> >> You know that whenever a software function invokes another software >> function in what would otherwise be infinite recursion if the execution >> of the first function was not aborted that the second function would >> never return any value to its caller in every case (aborted or not). > > I don't understand this subjunctive "would". > > That is your problem. > > When we say that a function "would" be something else, that is > precisely the same thing as "isn't". > If X does not do Y then Z If X does do Y then not Z proving that not Z depends on X doing Y Think of the halt decider as a UTM that simply simulates its input until its input halts on its own or the halt decider determines that its input would never halt on its own thus stops simulating it. It cannot be answering the question: Does the input halt on its input? because both inputs that halt on their own and halt because the halt decider stops simulating them halt. When we remove the pathological self-reference error we correct this question so that it can discern the halting behavior of its inputs then the question becomes: Would the input program have infinite execution if the halt decider did not stop simulating it? -- 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-09 18:02 +0000 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) |
| Message-ID | <20210309100011.342@kylheku.com> |
| In reply to | #28937 |
On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: > On 3/9/2021 11:35 AM, Kaz Kylheku wrote: > Think of the halt decider as a UTM that simply simulates its input until Don't tell others to think, when that is a habit you don't practice yourself. > its input halts on its own or the halt decider determines that its input > would never halt on its own thus stops simulating it. What is the pronoun "its" here? What is "would"? If the input were on its own, then it wouldn't be the same input; it would be a different H_Hat function which doesn't call the simulating decider! There is no such thing in math. We don't say that natural logarithm base e "would be" 3.14, if only it learned how to represent the circumference of a circle, divided by the diameter.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-09 13:57 -0500 |
| Subject | Re: Refuting the halting problem proofs with fully operational code (pathological self-reference error) |
| Message-ID | <PyP1I.210461$TY.76110@fx37.iad> |
| In reply to | #28937 |
On 3/9/21 12:54 PM, olcott wrote: > On 3/9/2021 11:35 AM, Kaz Kylheku wrote: >> On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >>> On 3/9/2021 11:17 AM, Kaz Kylheku wrote: >>>> On 2021-03-09, olcott <NoOne@NoWhere.com> wrote: >>>>> You can read the updated paper, I just added much more in depth >>>>> analysis >>>>> of exactly why the halting problem was previuosly considered >>>>> unsolvable >>>>> and why this never actually was the case. >>>>> >>>>> I provide an actual execution trace of fully operational code to prove >>>>> my point. >>>>> >>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>>> >>>> >>>> Updated? It looks like the same content as two days ago. It still >>>> refers to a local decider which you said no longer exists; there is >>>> only >>>> a global decider. >>>> >>>> Anyone reading the code can see by inspection that if H_Hat(H_Hat) is >>>> called, it must obtain a zero from Halts, and therefore it will halt. >>>> >>> >>> You know that whenever a software function invokes another software >>> function in what would otherwise be infinite recursion if the execution >>> of the first function was not aborted that the second function would >>> never return any value to its caller in every case (aborted or not). >> >> I don't understand this subjunctive "would". >> >> That is your problem. >> >> When we say that a function "would" be something else, that is >> precisely the same thing as "isn't". >> > > If X does not do Y then Z > If X does do Y then not Z > proving that not Z depends on X doing Y > > Think of the halt decider as a UTM that simply simulates its input until > its input halts on its own or the halt decider determines that its input > would never halt on its own thus stops simulating it. > > It cannot be answering the question: Does the input halt on its input? > because both inputs that halt on their own and halt because the halt > decider stops simulating them halt. > > When we remove the pathological self-reference error we correct this > question so that it can discern the halting behavior of its inputs then > the question becomes: > > Would the input program have infinite execution if the halt decider did > not stop simulating it? > But if rather than asking Halts(H_Hat, H_Hat) we run Simulate(H_Hat, H_Hat) (at least where Simulate is allowed to actully BE a simulator and no global halt decider gets in its way, but Halts still works) and that H_Hat still refers to Halts, so it is the same computation, then we see that Halt was wrong. If you can't run that test, then you have made your system untestable so it can have no truth in it. Actually, since we know the value that Halts(H_Hat, H_Hat) is said to return, we can easily run H_Hat(H_Hat) by inspection and see the answer, and see Halts was wrong.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-03-09 10:04 -0800 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <9c1ea790-1c07-4f85-a0e7-bfaefde82c98n@googlegroups.com> |
| In reply to | #28932 |
On Tuesday, 9 March 2021 at 17:35:15 UTC, Kaz Kylheku wrote: > On 2021-03-09, olcott <No...@NoWhere.com> wrote: > > On 3/9/2021 11:17 AM, Kaz Kylheku wrote: > >> On 2021-03-09, olcott <No...@NoWhere.com> wrote: > >>> You can read the updated paper, I just added much more in depth analysis > >>> of exactly why the halting problem was previuosly considered unsolvable > >>> and why this never actually was the case. > >>> > >>> I provide an actual execution trace of fully operational code to prove > >>> my point. > >>> > >>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf > >> > >> Updated? It looks like the same content as two days ago. It still > >> refers to a local decider which you said no longer exists; there is only > >> a global decider. > >> > >> Anyone reading the code can see by inspection that if H_Hat(H_Hat) is > >> called, it must obtain a zero from Halts, and therefore it will halt. > >> > > > > You know that whenever a software function invokes another software > > function in what would otherwise be infinite recursion if the execution > > of the first function was not aborted that the second function would > > never return any value to its caller in every case (aborted or not). > I don't understand this subjunctive "would". > > That is your problem. > > When we say that a function "would" be something else, that is > precisely the same thing as "isn't". > > "Would otherwise be infinite recursion" means "isn't infinite > recursion". > > There is no "would be" in mathematics. Each object is what it is, > and won't be that which it it isn't. > The "would" is cruucial to the system. If H_Hat inverts H, H can never return the correct result. But change the question from "Does H_Hat halt?" to "Would H_Hat run forever unless H (or some other agency) took action against it?" and suddenly H can get the right answer. The halting in H doesn't count.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-09 12:12 -0600 |
| Subject | Re: Refuting the halting problem proofs with fully operational code |
| Message-ID | <6JWdnffAE_DgJ9r9nZ2dnUU7-R3NnZ2d@giganews.com> |
| In reply to | #28940 |
On 3/9/2021 12:04 PM, Malcolm McLean wrote: > On Tuesday, 9 March 2021 at 17:35:15 UTC, Kaz Kylheku wrote: >> On 2021-03-09, olcott <No...@NoWhere.com> wrote: >>> On 3/9/2021 11:17 AM, Kaz Kylheku wrote: >>>> On 2021-03-09, olcott <No...@NoWhere.com> wrote: >>>>> You can read the updated paper, I just added much more in depth analysis >>>>> of exactly why the halting problem was previuosly considered unsolvable >>>>> and why this never actually was the case. >>>>> >>>>> I provide an actual execution trace of fully operational code to prove >>>>> my point. >>>>> >>>>> http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf >>>> >>>> Updated? It looks like the same content as two days ago. It still >>>> refers to a local decider which you said no longer exists; there is only >>>> a global decider. >>>> >>>> Anyone reading the code can see by inspection that if H_Hat(H_Hat) is >>>> called, it must obtain a zero from Halts, and therefore it will halt. >>>> >>> >>> You know that whenever a software function invokes another software >>> function in what would otherwise be infinite recursion if the execution >>> of the first function was not aborted that the second function would >>> never return any value to its caller in every case (aborted or not). >> I don't understand this subjunctive "would". >> >> That is your problem. >> >> When we say that a function "would" be something else, that is >> precisely the same thing as "isn't". >> >> "Would otherwise be infinite recursion" means "isn't infinite >> recursion". >> >> There is no "would be" in mathematics. Each object is what it is, >> and won't be that which it it isn't. >> > The "would" is cruucial to the system. > > If H_Hat inverts H, H can never return the correct result. > But change the question from "Does H_Hat halt?" to "Would H_Hat > run forever unless H (or some other agency) took action against it?" > and suddenly H can get the right answer. The halting in H doesn't count. > So my refutation of the halting problem proofs is correct? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 28 of 37 — ← Prev page 1 … 26 27 [28] 29 30 … 37 Next page →
Back to top | Article view | comp.theory
csiph-web