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 34 of 37 — ← Prev page 1 … 32 33 [34] 35 36 37 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-03 23:08 -0500 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <N2Z%H.42615$V21.8578@fx45.iad> |
| In reply to | #28394 |
On 3/3/21 10:43 PM, olcott wrote:
> On 3/3/2021 9:33 PM, Richard Damon wrote:
>> On 3/3/21 8:01 PM, olcott wrote:
>>>
>>> It is true that H_Hat() would not halt unless Halts() stops simulating
>>> it thus perfectly meeting the above criteria of a non-halting
>>> computation.
>>
>> It is true that if Halts does not return, then H_Hat will be a
>> non-halting computation, but that also means that Halts is not a halting
>> decider, and in fact couldn't have said that H_Hat is non-halting.
>>
>
> We are back to you acting dumber than a box of rocks again.
>
> What I mean by dumber than a box of rocks is that when I explain
> something fifty times and you did not ever notice that I said it once,
> that is dumber than a box of rocks.
>
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
> ...[000008bf][00011208][00000000](01) 55 push ebp
> ...[000008c0][00011208][00000000](02) 8bec mov ebp,esp
> ...[000008c2][00011204][00000000](01) 51 push ecx
> ...[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
> ...[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
> ...[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
> Begin Local Halt Decider Simulation at Machine Address:88f
> ...[0000088f][00031288][0003128c](01) 55 push ebp
> ...[00000890][00031288][0003128c](02) 8bec mov ebp,esp
> ...[00000892][00031284][00021258](01) 51 push ecx
> ...[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
> ...[00000896][00031280][0000088f](01) 50 push eax
> ...[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
> ...[0000089a][0003127c][0000088f](01) 51 push ecx
> ...[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
> ...[0000088f][00042430][00042434](01) 55 push ebp
> ...[00000890][00042430][00042434](02) 8bec mov ebp,esp
> ...[00000892][0004242c][00032400](01) 51 push ecx
> ...[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
> ...[00000896][00042428][0000088f](01) 50 push eax
> ...[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
> ...[0000089a][00042424][0000088f](01) 51 push ecx
> ...[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> ...[000008d2][00011204][00000000](03) 83c408 add esp,+08
> ...[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
> ...[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
> ...[000008db][00011200][00000000](01) 50 push eax
> ...[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
> ...[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
> Input_Would_Halt = 0
> ...[000008e6][00011204][00000000](03) 83c408 add esp,+08
> ...[000008e9][00011204][00000000](02) 33c0 xor eax,eax
> ...[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
> ...[000008ed][0001120c][00010000](01) 5d pop ebp
> ...[000008ee][00011210][00000080](01) c3 ret
> Number_of_User_Instructions(33)
>
So in THIS run, Halts return a value to its caller, but in the other
runs it did this:
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> int main()
> {
> Halts((u32)H_Hat, (u32)H_Hat);
> }
>
> _H_Hat()
> [00000878](01) 55 push ebp
> [00000879](02) 8bec mov ebp,esp
> [0000087b](01) 51 push ecx
> [0000087c](03) 8b4508 mov eax,[ebp+08]
> [0000087f](01) 50 push eax
> [00000880](03) 8b4d08 mov ecx,[ebp+08]
> [00000883](01) 51 push ecx
> [00000884](05) e8effbffff call 00000478
> [00000889](03) 83c408 add esp,+08
> [0000088c](03) 8945fc mov [ebp-04],eax
> [0000088f](04) 837dfc00 cmp dword [ebp-04],+00
> [00000893](02) 7402 jz 00000897
> [00000895](02) ebfe jmp 00000895
> [00000897](02) 8be5 mov esp,ebp
> [00000899](01) 5d pop ebp
> [0000089a](01) c3 ret
>
> _main()
> [000008a8](01) 55 push ebp
> [000008a9](02) 8bec mov ebp,esp
> [000008ab](05) 6878080000 push 00000878
> [000008b0](05) 6878080000 push 00000878
> [000008b5](05) e8befbffff call 00000478
> [000008ba](03) 83c408 add esp,+08
> [000008bd](02) 33c0 xor eax,eax
> [000008bf](01) 5d pop ebp
> [000008c0](01) c3 ret
>
> Columns
> (1) Execution trace sequence number
> (2) Machine address of instruction
> (3) Machine address of top of stack
> (4) Value of top of stack after instruction executed
> (5) Number of bytes of machine code
> (6) Machine language bytes
> (7) Assembly language text
>
> (01)[000008a8][000111b4][00000000](01) 55 push ebp
> (02)[000008a9][000111b4][00000000](02) 8bec mov ebp,esp
> (03)[000008ab][000111b0][00000878](05) 6878080000 push 00000878
> (04)[000008b0][000111ac][00000878](05) 6878080000 push 00000878
> (05)[000008b5][000111a8][000008ba](05) e8befbffff call 00000478
>
> Line (03) pushes second parameter to Simulate() machine address 0x878
> Line (04) pushes first parameter to Simulate() machine address 0x878
> Line (05) Calls Halts(0x878, 0x878);
>
> (06)[00000878][00011198][000111a4](01) 55 push ebp
> (07)[00000879][00011198][000111a4](02) 8bec mov ebp,esp
> (08)[0000087b][00011194][00000000](01) 51 push ecx
> (09)[0000087c][00011194][00000000](03) 8b4508 mov eax,[ebp+08]
> (10)[0000087f][00011190][00000878](01) 50 push eax
> (11)[00000880][00011190][00000878](03) 8b4d08 mov ecx,[ebp+08]
> (12)[00000883][0001118c][00000878](01) 51 push ecx
> (13)[00000884][00011188][00000889](05) e8effbffff call 00000478
>
> Line (10) pushes second parameter to Simulate() machine address 0x878
> Line (12) pushes first parameter to Simulate() machine address 0x878
> Line (13) Calls Halts(0x878, 0x878);
>
> (14)[00000878][00011178][00011184](01) 55 push ebp
> (15)[00000879][00011178][00011184](02) 8bec mov ebp,esp
> (16)[0000087b][00011174][00000878](01) 51 push ecx
> (17)[0000087c][00011174][00000878](03) 8b4508 mov eax,[ebp+08]
> (18)[0000087f][00011170][00000878](01) 50 push eax
> (19)[00000880][00011170][00000878](03) 8b4d08 mov ecx,[ebp+08]
> (20)[00000883][0001116c][00000878](01) 51 push ecx
> (21)[00000884][00011168][00000889](05) e8effbffff call 00000478
>
> Line (18) pushes second parameter to Simulate() machine address 0x878
> Line (20) pushes first parameter to Simulate() machine address 0x878
> Line (21) Calls Halts(0x878, 0x878);
>
>
So the second time Halts did not detect the condition and 'abort' the
simulation and return it answer.
THEREFORE: Halts fails the test to be a proper computation, as a proper
computation will ALWAYS return the same results for the same input.
THUS Halts can NOT be the equivalent of the Halt Decider of the proofs,
as that is a Turing Machines, and Turing Machines are ALWAY proper
computations.
THEREFORE: Your proof is invalid
I note also that the auxilary info is different so this likely indicates
that you are running your program with different settings, which is not
allowed to make the proof if these affect that operation of Halts.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 22:15 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <_8idnRTdJf5ww939nZ2dnUU7-a-dnZ2d@giganews.com> |
| In reply to | #28398 |
On 3/3/2021 10:08 PM, Richard Damon wrote:
> On 3/3/21 10:43 PM, olcott wrote:
>> On 3/3/2021 9:33 PM, Richard Damon wrote:
>>> On 3/3/21 8:01 PM, olcott wrote:
>>>>
>>>> It is true that H_Hat() would not halt unless Halts() stops simulating
>>>> it thus perfectly meeting the above criteria of a non-halting
>>>> computation.
>>>
>>> It is true that if Halts does not return, then H_Hat will be a
>>> non-halting computation, but that also means that Halts is not a halting
>>> decider, and in fact couldn't have said that H_Hat is non-halting.
>>>
>>
>> We are back to you acting dumber than a box of rocks again.
>>
>> What I mean by dumber than a box of rocks is that when I explain
>> something fifty times and you did not ever notice that I said it once,
>> that is dumber than a box of rocks.
>>
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>> ...[000008bf][00011208][00000000](01) 55 push ebp
>> ...[000008c0][00011208][00000000](02) 8bec mov ebp,esp
>> ...[000008c2][00011204][00000000](01) 51 push ecx
>> ...[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
>> ...[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
>> ...[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
>> Begin Local Halt Decider Simulation at Machine Address:88f
>> ...[0000088f][00031288][0003128c](01) 55 push ebp
>> ...[00000890][00031288][0003128c](02) 8bec mov ebp,esp
>> ...[00000892][00031284][00021258](01) 51 push ecx
>> ...[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
>> ...[00000896][00031280][0000088f](01) 50 push eax
>> ...[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>> ...[0000089a][0003127c][0000088f](01) 51 push ecx
>> ...[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
>> ...[0000088f][00042430][00042434](01) 55 push ebp
>> ...[00000890][00042430][00042434](02) 8bec mov ebp,esp
>> ...[00000892][0004242c][00032400](01) 51 push ecx
>> ...[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
>> ...[00000896][00042428][0000088f](01) 50 push eax
>> ...[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>> ...[0000089a][00042424][0000088f](01) 51 push ecx
>> ...[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>> ...[000008d2][00011204][00000000](03) 83c408 add esp,+08
>> ...[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
>> ...[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
>> ...[000008db][00011200][00000000](01) 50 push eax
>> ...[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
>> ...[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
>> Input_Would_Halt = 0
>> ...[000008e6][00011204][00000000](03) 83c408 add esp,+08
>> ...[000008e9][00011204][00000000](02) 33c0 xor eax,eax
>> ...[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
>> ...[000008ed][0001120c][00010000](01) 5d pop ebp
>> ...[000008ee][00011210][00000080](01) c3 ret
>> Number_of_User_Instructions(33)
>>
>
> So in THIS run, Halts return a value to its caller, but in the other
> runs it did this:
>
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> int main()
>> {
>> Halts((u32)H_Hat, (u32)H_Hat);
>> }
>>
>> _H_Hat()
>> [00000878](01) 55 push ebp
>> [00000879](02) 8bec mov ebp,esp
>> [0000087b](01) 51 push ecx
>> [0000087c](03) 8b4508 mov eax,[ebp+08]
>> [0000087f](01) 50 push eax
>> [00000880](03) 8b4d08 mov ecx,[ebp+08]
>> [00000883](01) 51 push ecx
>> [00000884](05) e8effbffff call 00000478
>> [00000889](03) 83c408 add esp,+08
>> [0000088c](03) 8945fc mov [ebp-04],eax
>> [0000088f](04) 837dfc00 cmp dword [ebp-04],+00
>> [00000893](02) 7402 jz 00000897
>> [00000895](02) ebfe jmp 00000895
>> [00000897](02) 8be5 mov esp,ebp
>> [00000899](01) 5d pop ebp
>> [0000089a](01) c3 ret
>>
>> _main()
>> [000008a8](01) 55 push ebp
>> [000008a9](02) 8bec mov ebp,esp
>> [000008ab](05) 6878080000 push 00000878
>> [000008b0](05) 6878080000 push 00000878
>> [000008b5](05) e8befbffff call 00000478
>> [000008ba](03) 83c408 add esp,+08
>> [000008bd](02) 33c0 xor eax,eax
>> [000008bf](01) 5d pop ebp
>> [000008c0](01) c3 ret
>>
>> Columns
>> (1) Execution trace sequence number
>> (2) Machine address of instruction
>> (3) Machine address of top of stack
>> (4) Value of top of stack after instruction executed
>> (5) Number of bytes of machine code
>> (6) Machine language bytes
>> (7) Assembly language text
>>
>> (01)[000008a8][000111b4][00000000](01) 55 push ebp
>> (02)[000008a9][000111b4][00000000](02) 8bec mov ebp,esp
>> (03)[000008ab][000111b0][00000878](05) 6878080000 push 00000878
>> (04)[000008b0][000111ac][00000878](05) 6878080000 push 00000878
>> (05)[000008b5][000111a8][000008ba](05) e8befbffff call 00000478
>>
>> Line (03) pushes second parameter to Simulate() machine address 0x878
>> Line (04) pushes first parameter to Simulate() machine address 0x878
>> Line (05) Calls Halts(0x878, 0x878);
>>
>> (06)[00000878][00011198][000111a4](01) 55 push ebp
>> (07)[00000879][00011198][000111a4](02) 8bec mov ebp,esp
>> (08)[0000087b][00011194][00000000](01) 51 push ecx
>> (09)[0000087c][00011194][00000000](03) 8b4508 mov eax,[ebp+08]
>> (10)[0000087f][00011190][00000878](01) 50 push eax
>> (11)[00000880][00011190][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> (12)[00000883][0001118c][00000878](01) 51 push ecx
>> (13)[00000884][00011188][00000889](05) e8effbffff call 00000478
>>
>> Line (10) pushes second parameter to Simulate() machine address 0x878
>> Line (12) pushes first parameter to Simulate() machine address 0x878
>> Line (13) Calls Halts(0x878, 0x878);
>>
>> (14)[00000878][00011178][00011184](01) 55 push ebp
>> (15)[00000879][00011178][00011184](02) 8bec mov ebp,esp
>> (16)[0000087b][00011174][00000878](01) 51 push ecx
>> (17)[0000087c][00011174][00000878](03) 8b4508 mov eax,[ebp+08]
>> (18)[0000087f][00011170][00000878](01) 50 push eax
>> (19)[00000880][00011170][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> (20)[00000883][0001116c][00000878](01) 51 push ecx
>> (21)[00000884][00011168][00000889](05) e8effbffff call 00000478
>>
>> Line (18) pushes second parameter to Simulate() machine address 0x878
>> Line (20) pushes first parameter to Simulate() machine address 0x878
>> Line (21) Calls Halts(0x878, 0x878);
>>
>>
>
> So the second time Halts did not detect the condition and 'abort' the
> simulation and return it answer.
>
> THEREFORE: Halts fails the test to be a proper computation, as a proper
> computation will ALWAYS return the same results for the same input.
>
> THUS Halts can NOT be the equivalent of the Halt Decider of the proofs,
> as that is a Turing Machines, and Turing Machines are ALWAY proper
> computations.
>
> THEREFORE: Your proof is invalid
>
> I note also that the auxilary info is different so this likely indicates
> that you are running your program with different settings, which is not
> allowed to make the proof if these affect that operation of Halts.
>
The idea of what is shown immediately above is so that people can
understand the updated halt deciding criteria.
This does not work if they can't understand assembly language.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-03 23:30 -0500 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <MnZ%H.60647$zX.24697@fx42.iad> |
| In reply to | #28401 |
On 3/3/21 11:15 PM, olcott wrote:
> On 3/3/2021 10:08 PM, Richard Damon wrote:
>> On 3/3/21 10:43 PM, olcott wrote:
>>> On 3/3/2021 9:33 PM, Richard Damon wrote:
>>>> On 3/3/21 8:01 PM, olcott wrote:
>>>>>
>>>>> It is true that H_Hat() would not halt unless Halts() stops simulating
>>>>> it thus perfectly meeting the above criteria of a non-halting
>>>>> computation.
>>>>
>>>> It is true that if Halts does not return, then H_Hat will be a
>>>> non-halting computation, but that also means that Halts is not a
>>>> halting
>>>> decider, and in fact couldn't have said that H_Hat is non-halting.
>>>>
>>>
>>> We are back to you acting dumber than a box of rocks again.
>>>
>>> What I mean by dumber than a box of rocks is that when I explain
>>> something fifty times and you did not ever notice that I said it once,
>>> that is dumber than a box of rocks.
>>>
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>> ...[000008bf][00011208][00000000](01) 55 push ebp
>>> ...[000008c0][00011208][00000000](02) 8bec mov ebp,esp
>>> ...[000008c2][00011204][00000000](01) 51 push ecx
>>> ...[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
>>> ...[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
>>> ...[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
>>> Begin Local Halt Decider Simulation at Machine Address:88f
>>> ...[0000088f][00031288][0003128c](01) 55 push ebp
>>> ...[00000890][00031288][0003128c](02) 8bec mov ebp,esp
>>> ...[00000892][00031284][00021258](01) 51 push ecx
>>> ...[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
>>> ...[00000896][00031280][0000088f](01) 50 push eax
>>> ...[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[0000089a][0003127c][0000088f](01) 51 push ecx
>>> ...[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
>>> ...[0000088f][00042430][00042434](01) 55 push ebp
>>> ...[00000890][00042430][00042434](02) 8bec mov ebp,esp
>>> ...[00000892][0004242c][00032400](01) 51 push ecx
>>> ...[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
>>> ...[00000896][00042428][0000088f](01) 50 push eax
>>> ...[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[0000089a][00042424][0000088f](01) 51 push ecx
>>> ...[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>> ...[000008d2][00011204][00000000](03) 83c408 add esp,+08
>>> ...[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
>>> ...[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
>>> ...[000008db][00011200][00000000](01) 50 push eax
>>> ...[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
>>> ...[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
>>> Input_Would_Halt = 0
>>> ...[000008e6][00011204][00000000](03) 83c408 add esp,+08
>>> ...[000008e9][00011204][00000000](02) 33c0 xor eax,eax
>>> ...[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
>>> ...[000008ed][0001120c][00010000](01) 5d pop ebp
>>> ...[000008ee][00011210][00000080](01) c3 ret
>>> Number_of_User_Instructions(33)
>>>
>>
>> So in THIS run, Halts return a value to its caller, but in the other
>> runs it did this:
>>
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> int main()
>>> {
>>> Halts((u32)H_Hat, (u32)H_Hat);
>>> }
>>>
>>> _H_Hat()
>>> [00000878](01) 55 push ebp
>>> [00000879](02) 8bec mov ebp,esp
>>> [0000087b](01) 51 push ecx
>>> [0000087c](03) 8b4508 mov eax,[ebp+08]
>>> [0000087f](01) 50 push eax
>>> [00000880](03) 8b4d08 mov ecx,[ebp+08]
>>> [00000883](01) 51 push ecx
>>> [00000884](05) e8effbffff call 00000478
>>> [00000889](03) 83c408 add esp,+08
>>> [0000088c](03) 8945fc mov [ebp-04],eax
>>> [0000088f](04) 837dfc00 cmp dword [ebp-04],+00
>>> [00000893](02) 7402 jz 00000897
>>> [00000895](02) ebfe jmp 00000895
>>> [00000897](02) 8be5 mov esp,ebp
>>> [00000899](01) 5d pop ebp
>>> [0000089a](01) c3 ret
>>>
>>> _main()
>>> [000008a8](01) 55 push ebp
>>> [000008a9](02) 8bec mov ebp,esp
>>> [000008ab](05) 6878080000 push 00000878
>>> [000008b0](05) 6878080000 push 00000878
>>> [000008b5](05) e8befbffff call 00000478
>>> [000008ba](03) 83c408 add esp,+08
>>> [000008bd](02) 33c0 xor eax,eax
>>> [000008bf](01) 5d pop ebp
>>> [000008c0](01) c3 ret
>>>
>>> Columns
>>> (1) Execution trace sequence number
>>> (2) Machine address of instruction
>>> (3) Machine address of top of stack
>>> (4) Value of top of stack after instruction executed
>>> (5) Number of bytes of machine code
>>> (6) Machine language bytes
>>> (7) Assembly language text
>>>
>>> (01)[000008a8][000111b4][00000000](01) 55 push ebp
>>> (02)[000008a9][000111b4][00000000](02) 8bec mov ebp,esp
>>> (03)[000008ab][000111b0][00000878](05) 6878080000 push 00000878
>>> (04)[000008b0][000111ac][00000878](05) 6878080000 push 00000878
>>> (05)[000008b5][000111a8][000008ba](05) e8befbffff call 00000478
>>>
>>> Line (03) pushes second parameter to Simulate() machine address 0x878
>>> Line (04) pushes first parameter to Simulate() machine address 0x878
>>> Line (05) Calls Halts(0x878, 0x878);
>>>
>>> (06)[00000878][00011198][000111a4](01) 55 push ebp
>>> (07)[00000879][00011198][000111a4](02) 8bec mov ebp,esp
>>> (08)[0000087b][00011194][00000000](01) 51 push ecx
>>> (09)[0000087c][00011194][00000000](03) 8b4508 mov eax,[ebp+08]
>>> (10)[0000087f][00011190][00000878](01) 50 push eax
>>> (11)[00000880][00011190][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> (12)[00000883][0001118c][00000878](01) 51 push ecx
>>> (13)[00000884][00011188][00000889](05) e8effbffff call 00000478
>>>
>>> Line (10) pushes second parameter to Simulate() machine address 0x878
>>> Line (12) pushes first parameter to Simulate() machine address 0x878
>>> Line (13) Calls Halts(0x878, 0x878);
>>>
>>> (14)[00000878][00011178][00011184](01) 55 push ebp
>>> (15)[00000879][00011178][00011184](02) 8bec mov ebp,esp
>>> (16)[0000087b][00011174][00000878](01) 51 push ecx
>>> (17)[0000087c][00011174][00000878](03) 8b4508 mov eax,[ebp+08]
>>> (18)[0000087f][00011170][00000878](01) 50 push eax
>>> (19)[00000880][00011170][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> (20)[00000883][0001116c][00000878](01) 51 push ecx
>>> (21)[00000884][00011168][00000889](05) e8effbffff call 00000478
>>>
>>> Line (18) pushes second parameter to Simulate() machine address 0x878
>>> Line (20) pushes first parameter to Simulate() machine address 0x878
>>> Line (21) Calls Halts(0x878, 0x878);
>>>
>>>
>>
>> So the second time Halts did not detect the condition and 'abort' the
>> simulation and return it answer.
>>
>> THEREFORE: Halts fails the test to be a proper computation, as a proper
>> computation will ALWAYS return the same results for the same input.
>>
>> THUS Halts can NOT be the equivalent of the Halt Decider of the proofs,
>> as that is a Turing Machines, and Turing Machines are ALWAY proper
>> computations.
>>
>> THEREFORE: Your proof is invalid
>>
>> I note also that the auxilary info is different so this likely indicates
>> that you are running your program with different settings, which is not
>> allowed to make the proof if these affect that operation of Halts.
>>
>
> The idea of what is shown immediately above is so that people can
> understand the updated halt deciding criteria.
>
> This does not work if they can't understand assembly language.
>
I am not as concerned about the minor formatting changes, but the fact
that the traces show different behaviors says that they are not running
the same computation for Halts.
This might indicate that you are trying the cheat in the proof.
You need to be able to show compatible traces for the run of main being
Halts(H_Hat, H_Hat) and the run of main being H_Hat(H_Hat).
The KEY point will be that since the trace for Halts(H_Hat, H_Hat) will
presumably return an answer to main, it needs to do the same thing to
the top level call from H_Hat.
Note, your 'Global' mode fails to do this, because it breaks total the
Turing Equivalences and makes Halts not a proper computation.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-03 22:35 -0600 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <8d6dnVav3bsL_t39nZ2dnUU7-N-dnZ2d@giganews.com> |
| In reply to | #28404 |
On 3/3/2021 10:30 PM, Richard Damon wrote:
> On 3/3/21 11:15 PM, olcott wrote:
>> On 3/3/2021 10:08 PM, Richard Damon wrote:
>>> On 3/3/21 10:43 PM, olcott wrote:
>>>> On 3/3/2021 9:33 PM, Richard Damon wrote:
>>>>> On 3/3/21 8:01 PM, olcott wrote:
>>>>>>
>>>>>> It is true that H_Hat() would not halt unless Halts() stops simulating
>>>>>> it thus perfectly meeting the above criteria of a non-halting
>>>>>> computation.
>>>>>
>>>>> It is true that if Halts does not return, then H_Hat will be a
>>>>> non-halting computation, but that also means that Halts is not a
>>>>> halting
>>>>> decider, and in fact couldn't have said that H_Hat is non-halting.
>>>>>
>>>>
>>>> We are back to you acting dumber than a box of rocks again.
>>>>
>>>> What I mean by dumber than a box of rocks is that when I explain
>>>> something fifty times and you did not ever notice that I said it once,
>>>> that is dumber than a box of rocks.
>>>>
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>> ...[000008bf][00011208][00000000](01) 55 push ebp
>>>> ...[000008c0][00011208][00000000](02) 8bec mov ebp,esp
>>>> ...[000008c2][00011204][00000000](01) 51 push ecx
>>>> ...[000008c3][00011200][0000088f](05) 688f080000 push 0000088f
>>>> ...[000008c8][000111fc][0000088f](05) 688f080000 push 0000088f
>>>> ...[000008cd][000111f8][000008d2](05) e84dfeffff call 0000071f
>>>> Begin Local Halt Decider Simulation at Machine Address:88f
>>>> ...[0000088f][00031288][0003128c](01) 55 push ebp
>>>> ...[00000890][00031288][0003128c](02) 8bec mov ebp,esp
>>>> ...[00000892][00031284][00021258](01) 51 push ecx
>>>> ...[00000893][00031284][00021258](03) 8b4508 mov eax,[ebp+08]
>>>> ...[00000896][00031280][0000088f](01) 50 push eax
>>>> ...[00000897][00031280][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>> ...[0000089a][0003127c][0000088f](01) 51 push ecx
>>>> ...[0000089b][00031278][000008a0](05) e87ffeffff call 0000071f
>>>> ...[0000088f][00042430][00042434](01) 55 push ebp
>>>> ...[00000890][00042430][00042434](02) 8bec mov ebp,esp
>>>> ...[00000892][0004242c][00032400](01) 51 push ecx
>>>> ...[00000893][0004242c][00032400](03) 8b4508 mov eax,[ebp+08]
>>>> ...[00000896][00042428][0000088f](01) 50 push eax
>>>> ...[00000897][00042428][0000088f](03) 8b4d08 mov ecx,[ebp+08]
>>>> ...[0000089a][00042424][0000088f](01) 51 push ecx
>>>> ...[0000089b][00042420][000008a0](05) e87ffeffff call 0000071f
>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>> ...[000008d2][00011204][00000000](03) 83c408 add esp,+08
>>>> ...[000008d5][00011204][00000000](03) 8945fc mov [ebp-04],eax
>>>> ...[000008d8][00011204][00000000](03) 8b45fc mov eax,[ebp-04]
>>>> ...[000008db][00011200][00000000](01) 50 push eax
>>>> ...[000008dc][000111fc][0000030b](05) 680b030000 push 0000030b
>>>> ...[000008e1][000111f8][000008e6](05) e869faffff call 0000034f
>>>> Input_Would_Halt = 0
>>>> ...[000008e6][00011204][00000000](03) 83c408 add esp,+08
>>>> ...[000008e9][00011204][00000000](02) 33c0 xor eax,eax
>>>> ...[000008eb][00011208][00000000](02) 8be5 mov esp,ebp
>>>> ...[000008ed][0001120c][00010000](01) 5d pop ebp
>>>> ...[000008ee][00011210][00000080](01) c3 ret
>>>> Number_of_User_Instructions(33)
>>>>
>>>
>>> So in THIS run, Halts return a value to its caller, but in the other
>>> runs it did this:
>>>
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> Halts((u32)H_Hat, (u32)H_Hat);
>>>> }
>>>>
>>>> _H_Hat()
>>>> [00000878](01) 55 push ebp
>>>> [00000879](02) 8bec mov ebp,esp
>>>> [0000087b](01) 51 push ecx
>>>> [0000087c](03) 8b4508 mov eax,[ebp+08]
>>>> [0000087f](01) 50 push eax
>>>> [00000880](03) 8b4d08 mov ecx,[ebp+08]
>>>> [00000883](01) 51 push ecx
>>>> [00000884](05) e8effbffff call 00000478
>>>> [00000889](03) 83c408 add esp,+08
>>>> [0000088c](03) 8945fc mov [ebp-04],eax
>>>> [0000088f](04) 837dfc00 cmp dword [ebp-04],+00
>>>> [00000893](02) 7402 jz 00000897
>>>> [00000895](02) ebfe jmp 00000895
>>>> [00000897](02) 8be5 mov esp,ebp
>>>> [00000899](01) 5d pop ebp
>>>> [0000089a](01) c3 ret
>>>>
>>>> _main()
>>>> [000008a8](01) 55 push ebp
>>>> [000008a9](02) 8bec mov ebp,esp
>>>> [000008ab](05) 6878080000 push 00000878
>>>> [000008b0](05) 6878080000 push 00000878
>>>> [000008b5](05) e8befbffff call 00000478
>>>> [000008ba](03) 83c408 add esp,+08
>>>> [000008bd](02) 33c0 xor eax,eax
>>>> [000008bf](01) 5d pop ebp
>>>> [000008c0](01) c3 ret
>>>>
>>>> Columns
>>>> (1) Execution trace sequence number
>>>> (2) Machine address of instruction
>>>> (3) Machine address of top of stack
>>>> (4) Value of top of stack after instruction executed
>>>> (5) Number of bytes of machine code
>>>> (6) Machine language bytes
>>>> (7) Assembly language text
>>>>
>>>> (01)[000008a8][000111b4][00000000](01) 55 push ebp
>>>> (02)[000008a9][000111b4][00000000](02) 8bec mov ebp,esp
>>>> (03)[000008ab][000111b0][00000878](05) 6878080000 push 00000878
>>>> (04)[000008b0][000111ac][00000878](05) 6878080000 push 00000878
>>>> (05)[000008b5][000111a8][000008ba](05) e8befbffff call 00000478
>>>>
>>>> Line (03) pushes second parameter to Simulate() machine address 0x878
>>>> Line (04) pushes first parameter to Simulate() machine address 0x878
>>>> Line (05) Calls Halts(0x878, 0x878);
>>>>
>>>> (06)[00000878][00011198][000111a4](01) 55 push ebp
>>>> (07)[00000879][00011198][000111a4](02) 8bec mov ebp,esp
>>>> (08)[0000087b][00011194][00000000](01) 51 push ecx
>>>> (09)[0000087c][00011194][00000000](03) 8b4508 mov eax,[ebp+08]
>>>> (10)[0000087f][00011190][00000878](01) 50 push eax
>>>> (11)[00000880][00011190][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>>> (12)[00000883][0001118c][00000878](01) 51 push ecx
>>>> (13)[00000884][00011188][00000889](05) e8effbffff call 00000478
>>>>
>>>> Line (10) pushes second parameter to Simulate() machine address 0x878
>>>> Line (12) pushes first parameter to Simulate() machine address 0x878
>>>> Line (13) Calls Halts(0x878, 0x878);
>>>>
>>>> (14)[00000878][00011178][00011184](01) 55 push ebp
>>>> (15)[00000879][00011178][00011184](02) 8bec mov ebp,esp
>>>> (16)[0000087b][00011174][00000878](01) 51 push ecx
>>>> (17)[0000087c][00011174][00000878](03) 8b4508 mov eax,[ebp+08]
>>>> (18)[0000087f][00011170][00000878](01) 50 push eax
>>>> (19)[00000880][00011170][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>>> (20)[00000883][0001116c][00000878](01) 51 push ecx
>>>> (21)[00000884][00011168][00000889](05) e8effbffff call 00000478
>>>>
>>>> Line (18) pushes second parameter to Simulate() machine address 0x878
>>>> Line (20) pushes first parameter to Simulate() machine address 0x878
>>>> Line (21) Calls Halts(0x878, 0x878);
>>>>
>>>>
>>>
>>> So the second time Halts did not detect the condition and 'abort' the
>>> simulation and return it answer.
>>>
>>> THEREFORE: Halts fails the test to be a proper computation, as a proper
>>> computation will ALWAYS return the same results for the same input.
>>>
>>> THUS Halts can NOT be the equivalent of the Halt Decider of the proofs,
>>> as that is a Turing Machines, and Turing Machines are ALWAY proper
>>> computations.
>>>
>>> THEREFORE: Your proof is invalid
>>>
>>> I note also that the auxilary info is different so this likely indicates
>>> that you are running your program with different settings, which is not
>>> allowed to make the proof if these affect that operation of Halts.
>>>
>>
>> The idea of what is shown immediately above is so that people can
>> understand the updated halt deciding criteria.
>>
>> This does not work if they can't understand assembly language.
>>
>
> I am not as concerned about the minor formatting changes, but the fact
> that the traces show different behaviors says that they are not running
> the same computation for Halts.
I disabled the halt deciding code so the halt deciding criteria could be
more easily shown. That particular invocation goes on and on...
The point is to understand the halt deciding criteria.
It looks like you are trying as hard as you possibly can to make sure
that you avoid understanding this.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-03 23:56 -0500 |
| Subject | Re: Detecting infinite recursion (halt deciding criteria) |
| Message-ID | <QLZ%H.12079$S31.4700@fx47.iad> |
| In reply to | #28405 |
On 3/3/21 11:35 PM, olcott wrote: > > I disabled the halt deciding code so the halt deciding criteria could be > more easily shown. That particular invocation goes on and on... > > The point is to understand the halt deciding criteria. > > It looks like you are trying as hard as you possibly can to make sure > that you avoid understanding this. > Then provide the trace which actual shows the operation. That itself would be the proof you need. Remember, we need compatible traces showing Halts returning non-halting to main. The trace within Halts needs to be compatible for all the calls. Since Halt(H_Hat, H_Hat) has been said to return non-halting, the trace for the call the H_Hat should not return. It should be clear that H_Hat is executing per its specification (returning when it get an answer from Halts of non-halting). Just show that and you have your proof, THAT would be self explanatory.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 16:07 -0500 |
| Message-ID | <KOx%H.28397$w%1.15420@fx03.iad> |
| In reply to | #28266 |
On 3/2/21 3:41 PM, olcott wrote:
> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>> olcott <No...@NoWhere.com> wrote:
>>>>
>>>>> Yes. The key brand new insight that I had about this proof is that the
>>>>
>>>> It's easy to express some number theory conjectures as recursive
>>>> procedures that either never halt if the conjecture is true or do
>>>> halt (on a counterexample) if the conjecture is false. If you
>>>> really can solve the halting problem, then solve these and be
>>>> famous for solving all number theory conjectures and
>>>> simultaneously proving number theory is w-inconsistent.
>>>>
>>> My background is computer science not mathematics, I will leave the math
>>> aspects of this as an exercise for the reader on the basis of the
>>> computer science solution that I have provided.
>>>
>> All you really need to know is that, if you could write a halt
>> decider, then
>> many problems considered by mathematicians to be insoluble would
>> suddenly become soluble. That tells you that it's likely that there
>> are issues
>> in writing a halt decider which are at least as hard to resolve as
>> finding
>> solutions to all these previously insoluble maths problems. Otherwise
>> mathematicians really aren't such a smart bunch.
>>
>> That's an informal argument, not a proof.
>>
>
> I have been working on this for thousands and thousands of hours since
> 2004. This is best documented in my thousands and thousands of posts to
> comp.theory.
>
> My solution is so simple that it is very obviously totally correct.
> It is obvious that the standard halting problem proof counter-example
> would infinitely invoke the halt decider.
>
> When the halt decider has been augmented to be able to see this then it
> can correctly decide halting on the conventional HP proof counter-examples.
>
>
> int Halts(u32 P, u32 I)
> {
> ((void(*)(int))P)(I);
> return 1;
> }
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
>
Yes, you have WASTED many hours of work. The fact that you think your
solution is obvious shows that you do not understand the Mathematics of
the problem anywhere near enough.
The simple fact that when you run H_Hat without interference from the
global and halts shows that your answer is wrong.
The fact that you claim you can't do that shows that your equivalences
are broken.
The fact that your Halt decide goes into an infinite recursion is NOT a
fault of the program under test. It just shows that your Halt Decider
fails at doing its Job.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 15:41 -0600 |
| Message-ID | <IP-dnc0yoP2SLKP9nZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #28274 |
On 3/2/2021 3:07 PM, Richard Damon wrote:
> On 3/2/21 3:41 PM, olcott wrote:
>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>
>>>>>> Yes. The key brand new insight that I had about this proof is that the
>>>>>
>>>>> It's easy to express some number theory conjectures as recursive
>>>>> procedures that either never halt if the conjecture is true or do
>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>> really can solve the halting problem, then solve these and be
>>>>> famous for solving all number theory conjectures and
>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>
>>>> My background is computer science not mathematics, I will leave the math
>>>> aspects of this as an exercise for the reader on the basis of the
>>>> computer science solution that I have provided.
>>>>
>>> All you really need to know is that, if you could write a halt
>>> decider, then
>>> many problems considered by mathematicians to be insoluble would
>>> suddenly become soluble. That tells you that it's likely that there
>>> are issues
>>> in writing a halt decider which are at least as hard to resolve as
>>> finding
>>> solutions to all these previously insoluble maths problems. Otherwise
>>> mathematicians really aren't such a smart bunch.
>>>
>>> That's an informal argument, not a proof.
>>>
>>
>> I have been working on this for thousands and thousands of hours since
>> 2004. This is best documented in my thousands and thousands of posts to
>> comp.theory.
>>
>> My solution is so simple that it is very obviously totally correct.
>> It is obvious that the standard halting problem proof counter-example
>> would infinitely invoke the halt decider.
>>
>> When the halt decider has been augmented to be able to see this then it
>> can correctly decide halting on the conventional HP proof counter-examples.
>>
>>
>> int Halts(u32 P, u32 I)
>> {
>> ((void(*)(int))P)(I);
>> return 1;
>> }
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>>
>
> Yes, you have WASTED many hours of work. The fact that you think your
> solution is obvious shows that you do not understand the Mathematics of
> the problem anywhere near enough.
>
> The simple fact that when you run H_Hat without interference from the
> global and halts shows that your answer is wrong.
>
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
H_Hat((u32)H_Hat);
}
...[000008a8][000111a5][00000000](01) 55 push ebp
...[000008a9][000111a5][00000000](02) 8bec mov ebp,esp
...[000008ab][000111a1][00000878](05) 6878080000 push 00000878
...[000008b0][0001119d][000008b5](05) e8c3ffffff call 00000878
...[00000878][00011199][000111a5](01) 55 push ebp
...[00000879][00011199][000111a5](02) 8bec mov ebp,esp
...[0000087b][00011195][00000000](01) 51 push ecx
...[0000087c][00011195][00000000](03) 8b4508 mov eax,[ebp+08]
...[0000087f][00011191][00000878](01) 50 push eax
...[00000880][00011191][00000878](03) 8b4d08 mov ecx,[ebp+08]
...[00000883][0001118d][00000878](01) 51 push ecx
...[00000884][00011189][00000889](05) e80ffcffff call 00000498
...[00000878][00011179][00011185](01) 55 push ebp
...[00000879][00011179][00011185](02) 8bec mov ebp,esp
...[0000087b][00011175][00000878](01) 51 push ecx
...[0000087c][00011175][00000878](03) 8b4508 mov eax,[ebp+08]
...[0000087f][00011171][00000878](01) 50 push eax
...[00000880][00011171][00000878](03) 8b4d08 mov ecx,[ebp+08]
...[00000883][0001116d][00000878](01) 51 push ecx
...[00000884][00011169][00000889](05) e80ffcffff call 00000498
...[00000878][00011159][00011165](01) 55 push ebp
...[00000879][00011159][00011165](02) 8bec mov ebp,esp
...[0000087b][00011155][00000878](01) 51 push ecx
...[0000087c][00011155][00000878](03) 8b4508 mov eax,[ebp+08]
...[0000087f][00011151][00000878](01) 50 push eax
...[00000880][00011151][00000878](03) 8b4d08 mov ecx,[ebp+08]
...[00000883][0001114d][00000878](01) 51 push ecx
...[00000884][00011149][00000889](05) e80ffcffff call 00000498
...[00000878][00011139][00011145](01) 55 push ebp
...[00000879][00011139][00011145](02) 8bec mov ebp,esp
...[0000087b][00011135][00000878](01) 51 push ecx
...[0000087c][00011135][00000878](03) 8b4508 mov eax,[ebp+08]
...[0000087f][00011131][00000878](01) 50 push eax
...[00000880][00011131][00000878](03) 8b4d08 mov ecx,[ebp+08]
...[00000883][0001112d][00000878](01) 51 push ecx
...[00000884][00011129][00000889](05) e80ffcffff call 00000498
Can you see that you are wrong?
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 17:20 -0500 |
| Message-ID | <uSy%H.14295$ZG1.2523@fx01.iad> |
| In reply to | #28278 |
On 3/2/21 4:41 PM, olcott wrote:
> On 3/2/2021 3:07 PM, Richard Damon wrote:
>> On 3/2/21 3:41 PM, olcott wrote:
>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>
>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>> that the
>>>>>>
>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>> really can solve the halting problem, then solve these and be
>>>>>> famous for solving all number theory conjectures and
>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>
>>>>> My background is computer science not mathematics, I will leave the
>>>>> math
>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>> computer science solution that I have provided.
>>>>>
>>>> All you really need to know is that, if you could write a halt
>>>> decider, then
>>>> many problems considered by mathematicians to be insoluble would
>>>> suddenly become soluble. That tells you that it's likely that there
>>>> are issues
>>>> in writing a halt decider which are at least as hard to resolve as
>>>> finding
>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>> mathematicians really aren't such a smart bunch.
>>>>
>>>> That's an informal argument, not a proof.
>>>>
>>>
>>> I have been working on this for thousands and thousands of hours since
>>> 2004. This is best documented in my thousands and thousands of posts to
>>> comp.theory.
>>>
>>> My solution is so simple that it is very obviously totally correct.
>>> It is obvious that the standard halting problem proof counter-example
>>> would infinitely invoke the halt decider.
>>>
>>> When the halt decider has been augmented to be able to see this then it
>>> can correctly decide halting on the conventional HP proof
>>> counter-examples.
>>>
>>>
>>> int Halts(u32 P, u32 I)
>>> {
>>> ((void(*)(int))P)(I);
>>> return 1;
>>> }
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>>
>>
>> Yes, you have WASTED many hours of work. The fact that you think your
>> solution is obvious shows that you do not understand the Mathematics of
>> the problem anywhere near enough.
>>
>> The simple fact that when you run H_Hat without interference from the
>> global and halts shows that your answer is wrong.
>>
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> ...[000008a8][000111a5][00000000](01) 55 push ebp
> ...[000008a9][000111a5][00000000](02) 8bec mov ebp,esp
> ...[000008ab][000111a1][00000878](05) 6878080000 push 00000878
> ...[000008b0][0001119d][000008b5](05) e8c3ffffff call 00000878
>
> ...[00000878][00011199][000111a5](01) 55 push ebp
> ...[00000879][00011199][000111a5](02) 8bec mov ebp,esp
> ...[0000087b][00011195][00000000](01) 51 push ecx
> ...[0000087c][00011195][00000000](03) 8b4508 mov eax,[ebp+08]
> ...[0000087f][00011191][00000878](01) 50 push eax
> ...[00000880][00011191][00000878](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000883][0001118d][00000878](01) 51 push ecx
> ...[00000884][00011189][00000889](05) e80ffcffff call 00000498
>
> ...[00000878][00011179][00011185](01) 55 push ebp
> ...[00000879][00011179][00011185](02) 8bec mov ebp,esp
> ...[0000087b][00011175][00000878](01) 51 push ecx
> ...[0000087c][00011175][00000878](03) 8b4508 mov eax,[ebp+08]
> ...[0000087f][00011171][00000878](01) 50 push eax
> ...[00000880][00011171][00000878](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000883][0001116d][00000878](01) 51 push ecx
> ...[00000884][00011169][00000889](05) e80ffcffff call 00000498
>
> ...[00000878][00011159][00011165](01) 55 push ebp
> ...[00000879][00011159][00011165](02) 8bec mov ebp,esp
> ...[0000087b][00011155][00000878](01) 51 push ecx
> ...[0000087c][00011155][00000878](03) 8b4508 mov eax,[ebp+08]
> ...[0000087f][00011151][00000878](01) 50 push eax
> ...[00000880][00011151][00000878](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000883][0001114d][00000878](01) 51 push ecx
> ...[00000884][00011149][00000889](05) e80ffcffff call 00000498
>
> ...[00000878][00011139][00011145](01) 55 push ebp
> ...[00000879][00011139][00011145](02) 8bec mov ebp,esp
> ...[0000087b][00011135][00000878](01) 51 push ecx
> ...[0000087c][00011135][00000878](03) 8b4508 mov eax,[ebp+08]
> ...[0000087f][00011131][00000878](01) 50 push eax
> ...[00000880][00011131][00000878](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000883][0001112d][00000878](01) 51 push ecx
> ...[00000884][00011129][00000889](05) e80ffcffff call 00000498
>
> Can you see that you are wrong?
>
IF this is what happend (and the loop continues) then Halts is proved to
fail at being a Halting Decider, so Linz is still intact.
Also, since your previous run returned a different result for the
identical call to Halts, it shows that you system is faulty, and Halts
CAN'T be a pure computation, and thus your whole setup is wrong.
See whre YOU are wrong?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 16:29 -0600 |
| Message-ID | <3ICdnQPGzOrVIaP9nZ2dnUU7-NmdnZ2d@giganews.com> |
| In reply to | #28282 |
On 3/2/2021 4:20 PM, Richard Damon wrote:
> On 3/2/21 4:41 PM, olcott wrote:
>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>> On 3/2/21 3:41 PM, olcott wrote:
>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>
>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>> that the
>>>>>>>
>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>> famous for solving all number theory conjectures and
>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>
>>>>>> My background is computer science not mathematics, I will leave the
>>>>>> math
>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>> computer science solution that I have provided.
>>>>>>
>>>>> All you really need to know is that, if you could write a halt
>>>>> decider, then
>>>>> many problems considered by mathematicians to be insoluble would
>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>> are issues
>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>> finding
>>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>>> mathematicians really aren't such a smart bunch.
>>>>>
>>>>> That's an informal argument, not a proof.
>>>>>
>>>>
>>>> I have been working on this for thousands and thousands of hours since
>>>> 2004. This is best documented in my thousands and thousands of posts to
>>>> comp.theory.
>>>>
>>>> My solution is so simple that it is very obviously totally correct.
>>>> It is obvious that the standard halting problem proof counter-example
>>>> would infinitely invoke the halt decider.
>>>>
>>>> When the halt decider has been augmented to be able to see this then it
>>>> can correctly decide halting on the conventional HP proof
>>>> counter-examples.
>>>>
>>>>
>>>> int Halts(u32 P, u32 I)
>>>> {
>>>> ((void(*)(int))P)(I);
>>>> return 1;
>>>> }
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>>
>>>
>>> Yes, you have WASTED many hours of work. The fact that you think your
>>> solution is obvious shows that you do not understand the Mathematics of
>>> the problem anywhere near enough.
>>>
>>> The simple fact that when you run H_Hat without interference from the
>>> global and halts shows that your answer is wrong.
>>>
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>>
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> }
>>
>>
>> ...[000008a8][000111a5][00000000](01) 55 push ebp
>> ...[000008a9][000111a5][00000000](02) 8bec mov ebp,esp
>> ...[000008ab][000111a1][00000878](05) 6878080000 push 00000878
>> ...[000008b0][0001119d][000008b5](05) e8c3ffffff call 00000878
>>
>> ...[00000878][00011199][000111a5](01) 55 push ebp
>> ...[00000879][00011199][000111a5](02) 8bec mov ebp,esp
>> ...[0000087b][00011195][00000000](01) 51 push ecx
>> ...[0000087c][00011195][00000000](03) 8b4508 mov eax,[ebp+08]
>> ...[0000087f][00011191][00000878](01) 50 push eax
>> ...[00000880][00011191][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> ...[00000883][0001118d][00000878](01) 51 push ecx
>> ...[00000884][00011189][00000889](05) e80ffcffff call 00000498
>>
>> ...[00000878][00011179][00011185](01) 55 push ebp
>> ...[00000879][00011179][00011185](02) 8bec mov ebp,esp
>> ...[0000087b][00011175][00000878](01) 51 push ecx
>> ...[0000087c][00011175][00000878](03) 8b4508 mov eax,[ebp+08]
>> ...[0000087f][00011171][00000878](01) 50 push eax
>> ...[00000880][00011171][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> ...[00000883][0001116d][00000878](01) 51 push ecx
>> ...[00000884][00011169][00000889](05) e80ffcffff call 00000498
>>
>> ...[00000878][00011159][00011165](01) 55 push ebp
>> ...[00000879][00011159][00011165](02) 8bec mov ebp,esp
>> ...[0000087b][00011155][00000878](01) 51 push ecx
>> ...[0000087c][00011155][00000878](03) 8b4508 mov eax,[ebp+08]
>> ...[0000087f][00011151][00000878](01) 50 push eax
>> ...[00000880][00011151][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> ...[00000883][0001114d][00000878](01) 51 push ecx
>> ...[00000884][00011149][00000889](05) e80ffcffff call 00000498
>>
>> ...[00000878][00011139][00011145](01) 55 push ebp
>> ...[00000879][00011139][00011145](02) 8bec mov ebp,esp
>> ...[0000087b][00011135][00000878](01) 51 push ecx
>> ...[0000087c][00011135][00000878](03) 8b4508 mov eax,[ebp+08]
>> ...[0000087f][00011131][00000878](01) 50 push eax
>> ...[00000880][00011131][00000878](03) 8b4d08 mov ecx,[ebp+08]
>> ...[00000883][0001112d][00000878](01) 51 push ecx
>> ...[00000884][00011129][00000889](05) e80ffcffff call 00000498
>>
>> Can you see that you are wrong?
>>
>
> IF this is what happend (and the loop continues) then Halts is proved to
> fail at being a Halting Decider, so Linz is still intact.
>
> Also, since your previous run returned a different result for the
> identical call to Halts, it shows that you system is faulty, and Halts
> CAN'T be a pure computation, and thus your whole setup is wrong.
>
> See whre YOU are wrong?
>
The problem is that you are not paying attention to what I am actually
saying:
int Halts(u32 P, u32 I)
{
((void(*)(int))P)(I);
return 1;
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 17:55 -0500 |
| Message-ID | <rnz%H.6$uj1.4@fx22.iad> |
| In reply to | #28284 |
On 3/2/21 5:29 PM, olcott wrote:
> On 3/2/2021 4:20 PM, Richard Damon wrote:
>> On 3/2/21 4:41 PM, olcott wrote:
>>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>>> On 3/2/21 3:41 PM, olcott wrote:
>>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>>
>>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>>> that the
>>>>>>>>
>>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>>> famous for solving all number theory conjectures and
>>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>>
>>>>>>> My background is computer science not mathematics, I will leave the
>>>>>>> math
>>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>>> computer science solution that I have provided.
>>>>>>>
>>>>>> All you really need to know is that, if you could write a halt
>>>>>> decider, then
>>>>>> many problems considered by mathematicians to be insoluble would
>>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>>> are issues
>>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>>> finding
>>>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>>>> mathematicians really aren't such a smart bunch.
>>>>>>
>>>>>> That's an informal argument, not a proof.
>>>>>>
>>>>>
>>>>> I have been working on this for thousands and thousands of hours since
>>>>> 2004. This is best documented in my thousands and thousands of
>>>>> posts to
>>>>> comp.theory.
>>>>>
>>>>> My solution is so simple that it is very obviously totally correct.
>>>>> It is obvious that the standard halting problem proof counter-example
>>>>> would infinitely invoke the halt decider.
>>>>>
>>>>> When the halt decider has been augmented to be able to see this
>>>>> then it
>>>>> can correctly decide halting on the conventional HP proof
>>>>> counter-examples.
>>>>>
>>>>>
>>>>> int Halts(u32 P, u32 I)
>>>>> {
>>>>> ((void(*)(int))P)(I);
>>>>> return 1;
>>>>> }
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> return;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>>>
>>>>
>>>> Yes, you have WASTED many hours of work. The fact that you think your
>>>> solution is obvious shows that you do not understand the Mathematics of
>>>> the problem anywhere near enough.
>>>>
>>>> The simple fact that when you run H_Hat without interference from the
>>>> global and halts shows that your answer is wrong.
>>>>
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>>
>>> int main()
>>> {
>>> H_Hat((u32)H_Hat);
>>> }
>>>
>>>
>>> ...[000008a8][000111a5][00000000](01) 55 push ebp
>>> ...[000008a9][000111a5][00000000](02) 8bec mov ebp,esp
>>> ...[000008ab][000111a1][00000878](05) 6878080000 push 00000878
>>> ...[000008b0][0001119d][000008b5](05) e8c3ffffff call 00000878
>>>
>>> ...[00000878][00011199][000111a5](01) 55 push ebp
>>> ...[00000879][00011199][000111a5](02) 8bec mov ebp,esp
>>> ...[0000087b][00011195][00000000](01) 51 push ecx
>>> ...[0000087c][00011195][00000000](03) 8b4508 mov eax,[ebp+08]
>>> ...[0000087f][00011191][00000878](01) 50 push eax
>>> ...[00000880][00011191][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[00000883][0001118d][00000878](01) 51 push ecx
>>> ...[00000884][00011189][00000889](05) e80ffcffff call 00000498
>>>
>>> ...[00000878][00011179][00011185](01) 55 push ebp
>>> ...[00000879][00011179][00011185](02) 8bec mov ebp,esp
>>> ...[0000087b][00011175][00000878](01) 51 push ecx
>>> ...[0000087c][00011175][00000878](03) 8b4508 mov eax,[ebp+08]
>>> ...[0000087f][00011171][00000878](01) 50 push eax
>>> ...[00000880][00011171][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[00000883][0001116d][00000878](01) 51 push ecx
>>> ...[00000884][00011169][00000889](05) e80ffcffff call 00000498
>>>
>>> ...[00000878][00011159][00011165](01) 55 push ebp
>>> ...[00000879][00011159][00011165](02) 8bec mov ebp,esp
>>> ...[0000087b][00011155][00000878](01) 51 push ecx
>>> ...[0000087c][00011155][00000878](03) 8b4508 mov eax,[ebp+08]
>>> ...[0000087f][00011151][00000878](01) 50 push eax
>>> ...[00000880][00011151][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[00000883][0001114d][00000878](01) 51 push ecx
>>> ...[00000884][00011149][00000889](05) e80ffcffff call 00000498
>>>
>>> ...[00000878][00011139][00011145](01) 55 push ebp
>>> ...[00000879][00011139][00011145](02) 8bec mov ebp,esp
>>> ...[0000087b][00011135][00000878](01) 51 push ecx
>>> ...[0000087c][00011135][00000878](03) 8b4508 mov eax,[ebp+08]
>>> ...[0000087f][00011131][00000878](01) 50 push eax
>>> ...[00000880][00011131][00000878](03) 8b4d08 mov ecx,[ebp+08]
>>> ...[00000883][0001112d][00000878](01) 51 push ecx
>>> ...[00000884][00011129][00000889](05) e80ffcffff call 00000498
>>>
>>> Can you see that you are wrong?
>>>
>>
>> IF this is what happend (and the loop continues) then Halts is proved to
>> fail at being a Halting Decider, so Linz is still intact.
>>
>> Also, since your previous run returned a different result for the
>> identical call to Halts, it shows that you system is faulty, and Halts
>> CAN'T be a pure computation, and thus your whole setup is wrong.
>>
>> See whre YOU are wrong?
>>
>
> The problem is that you are not paying attention to what I am actually
> saying:
>
> int Halts(u32 P, u32 I)
> {
> ((void(*)(int))P)(I);
> return 1;
> }
>
You said, and I was responding to:
>>>>> When the halt decider has been augmented to be able to see this
>>>>> then it
>>>>> can correctly decide halting on the conventional HP proof
>>>>> counter-examples.
So you are not only wrong, but also a cheat.
The problem of reusing the same name for DIFFERENT operations.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 16:24 -0600 |
| Subject | Re: Detecting infinite recursion (exception to the rule) |
| Message-ID | <vLSdnaFaTtG2JqP9nZ2dnUU7-SnNnZ2d@giganews.com> |
| In reply to | #28274 |
On 3/2/2021 3:07 PM, Richard Damon wrote:
> On 3/2/21 3:41 PM, olcott wrote:
>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>
>>>>>> Yes. The key brand new insight that I had about this proof is that the
>>>>>
>>>>> It's easy to express some number theory conjectures as recursive
>>>>> procedures that either never halt if the conjecture is true or do
>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>> really can solve the halting problem, then solve these and be
>>>>> famous for solving all number theory conjectures and
>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>
>>>> My background is computer science not mathematics, I will leave the math
>>>> aspects of this as an exercise for the reader on the basis of the
>>>> computer science solution that I have provided.
>>>>
>>> All you really need to know is that, if you could write a halt
>>> decider, then
>>> many problems considered by mathematicians to be insoluble would
>>> suddenly become soluble. That tells you that it's likely that there
>>> are issues
>>> in writing a halt decider which are at least as hard to resolve as
>>> finding
>>> solutions to all these previously insoluble maths problems. Otherwise
>>> mathematicians really aren't such a smart bunch.
>>>
>>> That's an informal argument, not a proof.
>>>
>>
>> I have been working on this for thousands and thousands of hours since
>> 2004. This is best documented in my thousands and thousands of posts to
>> comp.theory.
>>
>> My solution is so simple that it is very obviously totally correct.
>> It is obvious that the standard halting problem proof counter-example
>> would infinitely invoke the halt decider.
>>
>> When the halt decider has been augmented to be able to see this then it
>> can correctly decide halting on the conventional HP proof counter-examples.
>>
>>
>> int Halts(u32 P, u32 I)
>> {
>> ((void(*)(int))P)(I);
>> return 1;
>> }
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>>
What was that counter-example that you presented that showed there was
an exception to the rule that when there is a sequence of two function
calls to the same function from the same machine address and no
conditional branch instructions inbetween that it might possibly not be
infinite recursion? This exception made me have to start looking at
inputs to function call.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 17:50 -0500 |
| Subject | Re: Detecting infinite recursion (exception to the rule) |
| Message-ID | <4jz%H.41865$TW.36487@fx07.iad> |
| In reply to | #28283 |
On 3/2/21 5:24 PM, olcott wrote:
> On 3/2/2021 3:07 PM, Richard Damon wrote:
>> On 3/2/21 3:41 PM, olcott wrote:
>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>
>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>> that the
>>>>>>
>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>> really can solve the halting problem, then solve these and be
>>>>>> famous for solving all number theory conjectures and
>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>
>>>>> My background is computer science not mathematics, I will leave the
>>>>> math
>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>> computer science solution that I have provided.
>>>>>
>>>> All you really need to know is that, if you could write a halt
>>>> decider, then
>>>> many problems considered by mathematicians to be insoluble would
>>>> suddenly become soluble. That tells you that it's likely that there
>>>> are issues
>>>> in writing a halt decider which are at least as hard to resolve as
>>>> finding
>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>> mathematicians really aren't such a smart bunch.
>>>>
>>>> That's an informal argument, not a proof.
>>>>
>>>
>>> I have been working on this for thousands and thousands of hours since
>>> 2004. This is best documented in my thousands and thousands of posts to
>>> comp.theory.
>>>
>>> My solution is so simple that it is very obviously totally correct.
>>> It is obvious that the standard halting problem proof counter-example
>>> would infinitely invoke the halt decider.
>>>
>>> When the halt decider has been augmented to be able to see this then it
>>> can correctly decide halting on the conventional HP proof
>>> counter-examples.
>>>
>>>
>>> int Halts(u32 P, u32 I)
>>> {
>>> ((void(*)(int))P)(I);
>>> return 1;
>>> }
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> return;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>>
>
> What was that counter-example that you presented that showed there was
> an exception to the rule that when there is a sequence of two function
> calls to the same function from the same machine address and no
> conditional branch instructions inbetween that it might possibly not be
> infinite recursion? This exception made me have to start looking at
> inputs to function call.
>
>
Ultimately the issue is that if you allow the use of any data base
program flow control, even if not what you were calling a 'conditional
jump' you can get the effect of a conditional jump.
Since your simulation routine is in effect, such a program flow
instruction (even if you don't want to call it that, especially inside
you 'OS Code') I was able to defeat your incorrect rule (incorrect as it
doesn't restrict the conditions enough) by entering one program with
different data so it could use that data to create differing program
flow after the call that you were detecting as recursive without
conditional (because there WAS a conditional execution in the loop).
Your modified rule is basicly roughly the detection of a loop by seeing
the program return to a previous state with ALL the state being the same
(which holds even with conditionals in the path). At the simulate call,
assuming that you do block access to global variable, the state that
crosses is limited, so is easier to check.
Note that since it appears that Halts does have some access to global
data, that condition isn't fully satisfied, but it may be you are
preventing that information from leaking out enough for your purposes.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 16:59 -0600 |
| Subject | Re: Detecting infinite recursion (exception to the rule) |
| Message-ID | <WOKdnQ6Y7c-vXqP9nZ2dnUU7-dnNnZ2d@giganews.com> |
| In reply to | #28289 |
On 3/2/2021 4:50 PM, Richard Damon wrote:
> On 3/2/21 5:24 PM, olcott wrote:
>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>> On 3/2/21 3:41 PM, olcott wrote:
>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>
>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>> that the
>>>>>>>
>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>> famous for solving all number theory conjectures and
>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>
>>>>>> My background is computer science not mathematics, I will leave the
>>>>>> math
>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>> computer science solution that I have provided.
>>>>>>
>>>>> All you really need to know is that, if you could write a halt
>>>>> decider, then
>>>>> many problems considered by mathematicians to be insoluble would
>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>> are issues
>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>> finding
>>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>>> mathematicians really aren't such a smart bunch.
>>>>>
>>>>> That's an informal argument, not a proof.
>>>>>
>>>>
>>>> I have been working on this for thousands and thousands of hours since
>>>> 2004. This is best documented in my thousands and thousands of posts to
>>>> comp.theory.
>>>>
>>>> My solution is so simple that it is very obviously totally correct.
>>>> It is obvious that the standard halting problem proof counter-example
>>>> would infinitely invoke the halt decider.
>>>>
>>>> When the halt decider has been augmented to be able to see this then it
>>>> can correctly decide halting on the conventional HP proof
>>>> counter-examples.
>>>>
>>>>
>>>> int Halts(u32 P, u32 I)
>>>> {
>>>> ((void(*)(int))P)(I);
>>>> return 1;
>>>> }
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>>
>>
>> What was that counter-example that you presented that showed there was
>> an exception to the rule that when there is a sequence of two function
>> calls to the same function from the same machine address and no
>> conditional branch instructions inbetween that it might possibly not be
>> infinite recursion? This exception made me have to start looking at
>> inputs to function call.
>>
>>
>
> Ultimately the issue is that if you allow the use of any data base
> program flow control, even if not what you were calling a 'conditional
> jump' you can get the effect of a conditional jump.
>
> Since your simulation routine is in effect, such a program flow
> instruction (even if you don't want to call it that, especially inside
> you 'OS Code') I was able to defeat your incorrect rule (incorrect as it
> doesn't restrict the conditions enough) by entering one program with
> different data so it could use that data to create differing program
> flow after the call that you were detecting as recursive without
> conditional (because there WAS a conditional execution in the loop).
>
> Your modified rule is basicly roughly the detection of a loop by seeing
> the program return to a previous state with ALL the state being the same
> (which holds even with conditionals in the path). At the simulate call,
> assuming that you do block access to global variable, the state that
> crosses is limited, so is easier to check.
>
> Note that since it appears that Halts does have some access to global
> data, that condition isn't fully satisfied, but it may be you are
> preventing that information from leaking out enough for your purposes.
>
That is not the specific concrete example that you previously provided.
Since I remember that this caused me to build the infrastructure to make
sure that I examined inputs to a function your concrete example had
different inputs. Maybe it was something like the second input was a
value used by a switch statement.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 19:20 -0500 |
| Subject | Re: Detecting infinite recursion (exception to the rule) |
| Message-ID | <_CA%H.6265$iY.4108@fx33.iad> |
| In reply to | #28292 |
On 3/2/21 5:59 PM, olcott wrote:
> On 3/2/2021 4:50 PM, Richard Damon wrote:
>> On 3/2/21 5:24 PM, olcott wrote:
>>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>>> On 3/2/21 3:41 PM, olcott wrote:
>>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>>
>>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>>> that the
>>>>>>>>
>>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>>> famous for solving all number theory conjectures and
>>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>>
>>>>>>> My background is computer science not mathematics, I will leave the
>>>>>>> math
>>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>>> computer science solution that I have provided.
>>>>>>>
>>>>>> All you really need to know is that, if you could write a halt
>>>>>> decider, then
>>>>>> many problems considered by mathematicians to be insoluble would
>>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>>> are issues
>>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>>> finding
>>>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>>>> mathematicians really aren't such a smart bunch.
>>>>>>
>>>>>> That's an informal argument, not a proof.
>>>>>>
>>>>>
>>>>> I have been working on this for thousands and thousands of hours since
>>>>> 2004. This is best documented in my thousands and thousands of
>>>>> posts to
>>>>> comp.theory.
>>>>>
>>>>> My solution is so simple that it is very obviously totally correct.
>>>>> It is obvious that the standard halting problem proof counter-example
>>>>> would infinitely invoke the halt decider.
>>>>>
>>>>> When the halt decider has been augmented to be able to see this
>>>>> then it
>>>>> can correctly decide halting on the conventional HP proof
>>>>> counter-examples.
>>>>>
>>>>>
>>>>> int Halts(u32 P, u32 I)
>>>>> {
>>>>> ((void(*)(int))P)(I);
>>>>> return 1;
>>>>> }
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> return;
>>>>> }
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>>>
>>>
>>> What was that counter-example that you presented that showed there was
>>> an exception to the rule that when there is a sequence of two function
>>> calls to the same function from the same machine address and no
>>> conditional branch instructions inbetween that it might possibly not be
>>> infinite recursion? This exception made me have to start looking at
>>> inputs to function call.
>>>
>>>
>>
>> Ultimately the issue is that if you allow the use of any data base
>> program flow control, even if not what you were calling a 'conditional
>> jump' you can get the effect of a conditional jump.
>>
>> Since your simulation routine is in effect, such a program flow
>> instruction (even if you don't want to call it that, especially inside
>> you 'OS Code') I was able to defeat your incorrect rule (incorrect as it
>> doesn't restrict the conditions enough) by entering one program with
>> different data so it could use that data to create differing program
>> flow after the call that you were detecting as recursive without
>> conditional (because there WAS a conditional execution in the loop).
>>
>> Your modified rule is basicly roughly the detection of a loop by seeing
>> the program return to a previous state with ALL the state being the same
>> (which holds even with conditionals in the path). At the simulate call,
>> assuming that you do block access to global variable, the state that
>> crosses is limited, so is easier to check.
>>
>> Note that since it appears that Halts does have some access to global
>> data, that condition isn't fully satisfied, but it may be you are
>> preventing that information from leaking out enough for your purposes.
>>
>
> That is not the specific concrete example that you previously provided.
> Since I remember that this caused me to build the infrastructure to make
> sure that I examined inputs to a function your concrete example had
> different inputs. Maybe it was something like the second input was a
> value used by a switch statement.
>
That is an exact decsription of what I did (A switch would have been a
conditional).
It worked by passing different values of the data parameter that the
function use as the program parameter, thus getting the Halt Decider
function to perform the conditional execution instruction cloaked behind
your false wall of separation.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 18:45 -0600 |
| Subject | Re: Detecting infinite recursion (credit where it is due) |
| Message-ID | <qpudnYflr7K3QaP9nZ2dnUU7-enNnZ2d@giganews.com> |
| In reply to | #28294 |
On 3/2/2021 6:20 PM, Richard Damon wrote:
> On 3/2/21 5:59 PM, olcott wrote:
>> On 3/2/2021 4:50 PM, Richard Damon wrote:
>>> On 3/2/21 5:24 PM, olcott wrote:
>>>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>>>> On 3/2/21 3:41 PM, olcott wrote:
>>>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>>>
>>>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>>>> that the
>>>>>>>>>
>>>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>>>> famous for solving all number theory conjectures and
>>>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>>>
>>>>>>>> My background is computer science not mathematics, I will leave the
>>>>>>>> math
>>>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>>>> computer science solution that I have provided.
>>>>>>>>
>>>>>>> All you really need to know is that, if you could write a halt
>>>>>>> decider, then
>>>>>>> many problems considered by mathematicians to be insoluble would
>>>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>>>> are issues
>>>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>>>> finding
>>>>>>> solutions to all these previously insoluble maths problems. Otherwise
>>>>>>> mathematicians really aren't such a smart bunch.
>>>>>>>
>>>>>>> That's an informal argument, not a proof.
>>>>>>>
>>>>>>
>>>>>> I have been working on this for thousands and thousands of hours since
>>>>>> 2004. This is best documented in my thousands and thousands of
>>>>>> posts to
>>>>>> comp.theory.
>>>>>>
>>>>>> My solution is so simple that it is very obviously totally correct.
>>>>>> It is obvious that the standard halting problem proof counter-example
>>>>>> would infinitely invoke the halt decider.
>>>>>>
>>>>>> When the halt decider has been augmented to be able to see this
>>>>>> then it
>>>>>> can correctly decide halting on the conventional HP proof
>>>>>> counter-examples.
>>>>>>
>>>>>>
>>>>>> int Halts(u32 P, u32 I)
>>>>>> {
>>>>>> ((void(*)(int))P)(I);
>>>>>> return 1;
>>>>>> }
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> return;
>>>>>> }
>>>>>>
>>>>>> int main()
>>>>>> {
>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>> }
>>>>>>
>>>>>>
>>>>
>>>> What was that counter-example that you presented that showed there was
>>>> an exception to the rule that when there is a sequence of two function
>>>> calls to the same function from the same machine address and no
>>>> conditional branch instructions inbetween that it might possibly not be
>>>> infinite recursion? This exception made me have to start looking at
>>>> inputs to function call.
>>>>
>>>>
>>>
>>> Ultimately the issue is that if you allow the use of any data base
>>> program flow control, even if not what you were calling a 'conditional
>>> jump' you can get the effect of a conditional jump.
>>>
>>> Since your simulation routine is in effect, such a program flow
>>> instruction (even if you don't want to call it that, especially inside
>>> you 'OS Code') I was able to defeat your incorrect rule (incorrect as it
>>> doesn't restrict the conditions enough) by entering one program with
>>> different data so it could use that data to create differing program
>>> flow after the call that you were detecting as recursive without
>>> conditional (because there WAS a conditional execution in the loop).
>>>
>>> Your modified rule is basicly roughly the detection of a loop by seeing
>>> the program return to a previous state with ALL the state being the same
>>> (which holds even with conditionals in the path). At the simulate call,
>>> assuming that you do block access to global variable, the state that
>>> crosses is limited, so is easier to check.
>>>
>>> Note that since it appears that Halts does have some access to global
>>> data, that condition isn't fully satisfied, but it may be you are
>>> preventing that information from leaking out enough for your purposes.
>>>
>>
>> That is not the specific concrete example that you previously provided.
>> Since I remember that this caused me to build the infrastructure to make
>> sure that I examined inputs to a function your concrete example had
>> different inputs. Maybe it was something like the second input was a
>> value used by a switch statement.
>>
>
> That is an exact decsription of what I did (A switch would have been a
> conditional).
>
> It worked by passing different values of the data parameter that the
> function use as the program parameter, thus getting the Halt Decider
> function to perform the conditional execution instruction cloaked behind
> your false wall of separation.
>
OK, great. That was an important critique. It caused me to focus on
examining to input to functions as a key element of halt deciding.
Assuming that what Malcolm said also applies to indirect recursion:
On 2/26/2021 2:41 PM, Malcolm McLean wrote:
> If A calls itself with exactly the same data as it was
> originally invoked with, then it must be infinitely recursive,
> even if there are conditional branches. It always takes the
> same branches.
Then detecting infinite recursion is made even simpler.
Noticing that the H_Hat() invocation of Halts() is infinitely recursive
for every halt decider that bases it halt deciding decision on examining
its own simulation of its input overcame the "impossible" aspect of
refuting the halting problem proofs. (Copyright Pete Olcott 2016, 2017).
The feedback that you and Malcolm provided was important to implementing
this halt decider. You corrected a key short-coming with the initial
halt decider design and Malcolm eliminated an unnecessary step.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
return;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-02 20:58 -0500 |
| Subject | Re: Detecting infinite recursion (credit where it is due) |
| Message-ID | <%2C%H.52$2o1.1@fx27.iad> |
| In reply to | #28295 |
On 3/2/21 7:45 PM, olcott wrote:
> On 3/2/2021 6:20 PM, Richard Damon wrote:
>> On 3/2/21 5:59 PM, olcott wrote:
>>> On 3/2/2021 4:50 PM, Richard Damon wrote:
>>>> On 3/2/21 5:24 PM, olcott wrote:
>>>>> On 3/2/2021 3:07 PM, Richard Damon wrote:
>>>>>> On 3/2/21 3:41 PM, olcott wrote:
>>>>>>> On 3/2/2021 2:01 PM, Malcolm McLean wrote:
>>>>>>>> On Tuesday, 2 March 2021 at 19:52:39 UTC, olcott wrote:
>>>>>>>>> On 3/2/2021 1:45 PM, Siri Cruise wrote:
>>>>>>>>>> In article <uLSdnZF1Hv7L6aP9...@giganews.com>,
>>>>>>>>>> olcott <No...@NoWhere.com> wrote:
>>>>>>>>>>
>>>>>>>>>>> Yes. The key brand new insight that I had about this proof is
>>>>>>>>>>> that the
>>>>>>>>>>
>>>>>>>>>> It's easy to express some number theory conjectures as recursive
>>>>>>>>>> procedures that either never halt if the conjecture is true or do
>>>>>>>>>> halt (on a counterexample) if the conjecture is false. If you
>>>>>>>>>> really can solve the halting problem, then solve these and be
>>>>>>>>>> famous for solving all number theory conjectures and
>>>>>>>>>> simultaneously proving number theory is w-inconsistent.
>>>>>>>>>>
>>>>>>>>> My background is computer science not mathematics, I will leave
>>>>>>>>> the
>>>>>>>>> math
>>>>>>>>> aspects of this as an exercise for the reader on the basis of the
>>>>>>>>> computer science solution that I have provided.
>>>>>>>>>
>>>>>>>> All you really need to know is that, if you could write a halt
>>>>>>>> decider, then
>>>>>>>> many problems considered by mathematicians to be insoluble would
>>>>>>>> suddenly become soluble. That tells you that it's likely that there
>>>>>>>> are issues
>>>>>>>> in writing a halt decider which are at least as hard to resolve as
>>>>>>>> finding
>>>>>>>> solutions to all these previously insoluble maths problems.
>>>>>>>> Otherwise
>>>>>>>> mathematicians really aren't such a smart bunch.
>>>>>>>>
>>>>>>>> That's an informal argument, not a proof.
>>>>>>>>
>>>>>>>
>>>>>>> I have been working on this for thousands and thousands of hours
>>>>>>> since
>>>>>>> 2004. This is best documented in my thousands and thousands of
>>>>>>> posts to
>>>>>>> comp.theory.
>>>>>>>
>>>>>>> My solution is so simple that it is very obviously totally correct.
>>>>>>> It is obvious that the standard halting problem proof
>>>>>>> counter-example
>>>>>>> would infinitely invoke the halt decider.
>>>>>>>
>>>>>>> When the halt decider has been augmented to be able to see this
>>>>>>> then it
>>>>>>> can correctly decide halting on the conventional HP proof
>>>>>>> counter-examples.
>>>>>>>
>>>>>>>
>>>>>>> int Halts(u32 P, u32 I)
>>>>>>> {
>>>>>>> ((void(*)(int))P)(I);
>>>>>>> return 1;
>>>>>>> }
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> return;
>>>>>>> }
>>>>>>>
>>>>>>> int main()
>>>>>>> {
>>>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>>>> }
>>>>>>>
>>>>>>>
>>>>>
>>>>> What was that counter-example that you presented that showed there was
>>>>> an exception to the rule that when there is a sequence of two function
>>>>> calls to the same function from the same machine address and no
>>>>> conditional branch instructions inbetween that it might possibly
>>>>> not be
>>>>> infinite recursion? This exception made me have to start looking at
>>>>> inputs to function call.
>>>>>
>>>>>
>>>>
>>>> Ultimately the issue is that if you allow the use of any data base
>>>> program flow control, even if not what you were calling a 'conditional
>>>> jump' you can get the effect of a conditional jump.
>>>>
>>>> Since your simulation routine is in effect, such a program flow
>>>> instruction (even if you don't want to call it that, especially inside
>>>> you 'OS Code') I was able to defeat your incorrect rule (incorrect
>>>> as it
>>>> doesn't restrict the conditions enough) by entering one program with
>>>> different data so it could use that data to create differing program
>>>> flow after the call that you were detecting as recursive without
>>>> conditional (because there WAS a conditional execution in the loop).
>>>>
>>>> Your modified rule is basicly roughly the detection of a loop by seeing
>>>> the program return to a previous state with ALL the state being the
>>>> same
>>>> (which holds even with conditionals in the path). At the simulate call,
>>>> assuming that you do block access to global variable, the state that
>>>> crosses is limited, so is easier to check.
>>>>
>>>> Note that since it appears that Halts does have some access to global
>>>> data, that condition isn't fully satisfied, but it may be you are
>>>> preventing that information from leaking out enough for your purposes.
>>>>
>>>
>>> That is not the specific concrete example that you previously provided.
>>> Since I remember that this caused me to build the infrastructure to make
>>> sure that I examined inputs to a function your concrete example had
>>> different inputs. Maybe it was something like the second input was a
>>> value used by a switch statement.
>>>
>>
>> That is an exact decsription of what I did (A switch would have been a
>> conditional).
>>
>> It worked by passing different values of the data parameter that the
>> function use as the program parameter, thus getting the Halt Decider
>> function to perform the conditional execution instruction cloaked behind
>> your false wall of separation.
>>
>
> OK, great. That was an important critique. It caused me to focus on
> examining to input to functions as a key element of halt deciding.
>
> Assuming that what Malcolm said also applies to indirect recursion:
> On 2/26/2021 2:41 PM, Malcolm McLean wrote:
>> If A calls itself with exactly the same data as it was
>> originally invoked with, then it must be infinitely recursive,
>> even if there are conditional branches. It always takes the
>> same branches.
>
> Then detecting infinite recursion is made even simpler.
>
> Noticing that the H_Hat() invocation of Halts() is infinitely recursive
> for every halt decider that bases it halt deciding decision on examining
> its own simulation of its input overcame the "impossible" aspect of
> refuting the halting problem proofs. (Copyright Pete Olcott 2016, 2017).
>
> The feedback that you and Malcolm provided was important to implementing
> this halt decider. You corrected a key short-coming with the initial
> halt decider design and Malcolm eliminated an unnecessary step.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> return;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
You are still going to run afoul of the fact that your simulator is NOT
a UTM equivalent as it does run the program in a separate memory. Once
you make the code run in a new execution environment, you can't just
match PC values to detect the recursion, as that could well be a
different program.
One key fact is that your Halt Decider can't tell if provided program
matches the current Turing Machine (I will challange you to write a real
Turing Machine that determine if an input tape matches a representation
of itself.
Might even be willing to let you try write it as x86 code with the
restrictions of it being like a Turing Machine and not able to read or
write its own code (and no having a copy of itself on the tape, H
doesn't get a copy known to be of itself on the tape).
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-02 22:57 +0000 |
| Message-ID | <20210302145454.820@kylheku.com> |
| In reply to | #28266 |
On 2021-03-02, olcott <NoOne@NoWhere.com> wrote: > I have been working on this for thousands and thousands of hours since > 2004. This is best documented in my thousands and thousands of posts to > comp.theory. I suspect that if those posts were catenated, the resulting file would compress to mere kilobytes. -- TXR Programming Language: http://nongnu.org/txr Cygna: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | om@iki.fi (Otto J. Makela) |
|---|---|
| Date | 2021-03-03 14:46 +0200 |
| Message-ID | <875z28flqp.fsf@tigger.extechop.net> |
| In reply to | #28266 |
olcott <NoOne@NoWhere.com> wrote: > I have been working on this for thousands and thousands of hours since > 2004. This is best documented in my thousands and thousands of posts > to comp.theory. I'm afraid you have thus failed the halting test. -- /* * * Otto J. Makela <om@iki.fi> * * * * * * * * * */ /* Phone: +358 40 765 5772, ICBM: N 60 10' E 24 55' */ /* Mail: Mechelininkatu 26 B 27, FI-00100 Helsinki */ /* * * Computers Rule 01001111 01001011 * * * * * * */
[toc] | [prev] | [next] | [standalone]
| From | Siri Cruise <chine.bleu@yahoo.com> |
|---|---|
| Date | 2021-03-02 12:04 -0800 |
| Message-ID | <chine.bleu-A0CA42.12040602032021@reader.eternal-september.org> |
| In reply to | #28259 |
In article <POednXbS7IAYCqP9nZ2dnUU78IednZ2d@giganews.com>, olcott <NoOne@NoWhere.com> wrote: > On 3/2/2021 1:45 PM, Siri Cruise wrote: > > In article <uLSdnZF1Hv7L6aP9nZ2dnUU7-e3NnZ2d@giganews.com>, > > olcott <NoOne@NoWhere.com> wrote: > > > >> Yes. The key brand new insight that I had about this proof is that the > > > > It's easy to express some number theory conjectures as recursive > > procedures that either never halt if the conjecture is true or do > > halt (on a counterexample) if the conjecture is false. If you > > really can solve the halting problem, then solve these and be > > famous for solving all number theory conjectures and > > simultaneously proving number theory is w-inconsistent. > > > > My background is computer science not mathematics, I will leave the math > aspects of this as an exercise for the reader on the basis of the > computer science solution that I have provided. I've already provided goldbach's conjecture. Try that. -- :-<> Siri Seal of Disavowal #000-001. Disavowed. Denied. Deleted. @ 'I desire mercy, not sacrifice.' /|\ Discordia: not just a religion but also a parody. This post / \ I am an Andrea Doria sockpuppet. insults Islam. Mohammed
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-02 14:49 -0600 |
| Message-ID | <AomdnR4aouR2OaP9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #28263 |
On 3/2/2021 2:04 PM, Siri Cruise wrote: > In article <POednXbS7IAYCqP9nZ2dnUU78IednZ2d@giganews.com>, > olcott <NoOne@NoWhere.com> wrote: > >> On 3/2/2021 1:45 PM, Siri Cruise wrote: >>> In article <uLSdnZF1Hv7L6aP9nZ2dnUU7-e3NnZ2d@giganews.com>, >>> olcott <NoOne@NoWhere.com> wrote: >>> >>>> Yes. The key brand new insight that I had about this proof is that the >>> >>> It's easy to express some number theory conjectures as recursive >>> procedures that either never halt if the conjecture is true or do >>> halt (on a counterexample) if the conjecture is false. If you >>> really can solve the halting problem, then solve these and be >>> famous for solving all number theory conjectures and >>> simultaneously proving number theory is w-inconsistent. >>> >> >> My background is computer science not mathematics, I will leave the math >> aspects of this as an exercise for the reader on the basis of the >> computer science solution that I have provided. > > I've already provided goldbach's conjecture. Try that. > I am not interested in that. On the other hand The Tarski Undefinability theorem / 1931 Gödel Incompleteness directly pertain to the fundamental nature of analytical truth itself. Progress in AI will remain stymied until we fix those errors. There is no sense in me working on any of that until after my halting problem proof refutation has been accepted because in the case of Tarski/Gödel I cannot simply write little computer program that provides every single detail of the 100% of the entire solution. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 34 of 37 — ← Prev page 1 … 32 33 [34] 35 36 37 Next page →
Back to top | Article view | comp.theory
csiph-web