Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #25683 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-11-22 19:24 -0600 |
| Last post | 2020-12-02 02:50 +0000 |
| Articles | 10 on this page of 210 — 9 participants |
Back to article view | Back to comp.theory
It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-22 19:24 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-22 20:56 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-23 03:14 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-22 21:33 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-23 04:03 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-22 22:07 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Misrepresentation of MTs position) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 17:09 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-24 03:39 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 22:55 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 23:22 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 23:23 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 17:07 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 11:37 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 17:42 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 11:53 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 13:39 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](actual facts) olcott <NoOne@NoWhere.com> - 2020-11-23 13:35 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](actual facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 14:58 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](actual facts) olcott <NoOne@NoWhere.com> - 2020-11-23 14:12 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](actual facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 15:54 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 18:47 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-23 13:00 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 16:24 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said) olcott <NoOne@NoWhere.com> - 2020-11-25 11:18 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Mike Terry said)(Here is Proof) olcott <NoOne@NoWhere.com> - 2020-11-23 13:21 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 21:02 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 15:29 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 16:45 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 15:47 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 16:57 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 16:06 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 17:35 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 16:38 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 17:45 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 16:51 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 18:02 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 17:31 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 19:55 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 19:08 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 20:38 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 20:28 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 22:28 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Jeff Barnett <jbb@notatt.com> - 2020-11-23 15:47 -0700
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-23 23:51 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 18:37 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 20:04 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 19:20 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-23 20:49 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 02:53 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 22:18 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 15:41 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 09:51 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 16:19 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 10:32 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 16:48 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 11:18 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 11:34 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 13:20 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 19:30 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 13:41 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 23:37 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 18:03 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 01:40 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 20:10 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-25 03:20 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](first step) olcott <NoOne@NoWhere.com> - 2020-11-24 21:34 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](validation of halting criteria) olcott <NoOne@NoWhere.com> - 2020-11-24 14:44 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](validation of halting criteria) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 02:04 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](validation of halting criteria) olcott <NoOne@NoWhere.com> - 2020-11-24 20:21 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](validation of halting criteria) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 23:10 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](key agreement) olcott <NoOne@NoWhere.com> - 2020-11-24 14:29 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 10:46 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 17:04 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 17:05 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 11:19 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-24 18:08 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 12:27 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 13:42 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 13:31 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2020-11-24 12:31 -0800
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 15:46 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2020-11-24 17:22 -0800
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 19:35 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 23:14 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](mandatory prerequisite) olcott <NoOne@NoWhere.com> - 2020-11-24 14:48 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 16:45 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](infallible) olcott <NoOne@NoWhere.com> - 2020-11-25 11:21 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](infallible) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 21:25 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) olcott <NoOne@NoWhere.com> - 2020-11-25 15:55 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-25 23:31 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) olcott <NoOne@NoWhere.com> - 2020-11-25 17:47 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 00:33 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) olcott <NoOne@NoWhere.com> - 2020-11-25 18:51 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 01:38 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) olcott <NoOne@NoWhere.com> - 2020-11-25 20:14 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](impossibly incorrect) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 04:27 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-25 22:39 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 15:48 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 10:07 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 16:30 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 10:41 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 17:08 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 11:34 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 19:36 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 13:58 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 20:28 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 14:32 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 20:43 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 14:48 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 14:50 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 21:12 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 15:16 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 21:27 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 15:48 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 01:44 +0000
Re: It is known that a correct halt decider must return false (in olcott <NoOne@nospicedham.NoWhere.com> - 2020-11-26 20:55 -0600
Re: It is known that a correct halt decider must return false (in Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 20:12 +0000
Re: It is known that a correct halt decider must return false (in olcott <NoOne@NoWhere.com> - 2020-11-27 14:24 -0600
Re: It is known that a correct halt decider must return false (logical foundation) olcott <NoOne@NoWhere.com> - 2020-11-27 14:29 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Richard Damon <Richard@Damon-Family.org> - 2020-11-26 16:14 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 15:31 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-26 21:57 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 16:05 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 01:10 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 21:04 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Richard Damon <Richard@Damon-Family.org> - 2020-11-26 22:48 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) olcott <NoOne@NoWhere.com> - 2020-11-27 09:23 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 11:28 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) olcott <NoOne@NoWhere.com> - 2020-11-27 10:43 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 12:50 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) olcott <NoOne@NoWhere.com> - 2020-11-27 12:32 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) olcott <NoOne@NoWhere.com> - 2020-11-27 12:36 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 13:48 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) olcott <NoOne@NoWhere.com> - 2020-11-27 13:23 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](line-of-demarcation) Richard Damon <Richard@Damon-Family.org> - 2020-11-27 16:34 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-27 20:28 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) olcott <NoOne@NoWhere.com> - 2020-11-27 14:36 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) olcott <NoOne@NoWhere.com> - 2020-11-27 14:40 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2020-11-27 21:03 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](emulation levels) olcott <NoOne@NoWhere.com> - 2020-11-27 15:12 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) Richard Damon <Richard@Damon-Family.org> - 2020-11-26 17:49 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](x86 as a formal language) olcott <NoOne@NoWhere.com> - 2020-11-26 17:01 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-29 16:33 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-30 00:38 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-29 19:16 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-30 02:38 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-29 21:12 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-30 03:23 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-29 21:53 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Jeff Barnett <jbb@notatt.com> - 2020-11-29 21:31 -0700
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-30 21:28 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](infinite recursion slaps them in the face and they deny it) olcott <NoOne@NoWhere.com> - 2020-11-30 15:31 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Richard Damon <Richard@Damon-Family.org> - 2020-11-30 10:36 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-30 09:55 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Richard Damon <Richard@Damon-Family.org> - 2020-11-30 12:56 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) olcott <NoOne@NoWhere.com> - 2020-11-30 12:10 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](recursive emulation ≡ recursive invocation) Richard Damon <Richard@Damon-Family.org> - 2020-11-30 15:34 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-24 03:53 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-23 23:29 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-24 15:53 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-24 10:27 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-25 00:16 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) olcott <NoOne@NoWhere.com> - 2020-11-24 18:30 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 23:17 -0500
Re: It is known that a correct halt decider must return false (This is the whole thing) olcott <NoOne@NoWhere.com> - 2020-11-24 22:43 -0600
Re: It is known that a correct halt decider must return false (This is the whole thing) Richard Damon <Richard@Damon-Family.org> - 2020-11-24 23:53 -0500
Re: It is known that a correct halt decider must return false (This is the whole thing) olcott <NoOne@NoWhere.com> - 2020-11-24 23:12 -0600
Re: It is known that a correct halt decider must return false (This is the whole thing) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 07:39 -0500
Re: It is known that a correct halt decider must return false (This is the whole thing) olcott <NoOne@NoWhere.com> - 2020-11-25 08:17 -0600
Re: It is known that a correct halt decider must return false (This is the whole thing) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 10:14 -0500
Re: It is known that a correct halt decider must return false (This is the whole thing) olcott <NoOne@NoWhere.com> - 2020-11-25 09:52 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Linz) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-25 22:16 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 16:25 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 18:35 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 17:59 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 19:55 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 19:03 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 21:55 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 21:06 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 22:34 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2020-11-25 15:53 -0800
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 18:09 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 20:09 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2020-11-25 20:40 -0800
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) olcott <NoOne@NoWhere.com> - 2020-11-25 22:58 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-26 02:06 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) olcott <NoOne@NoWhere.com> - 2020-11-25 20:33 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) Richard Damon <Richard@Damon-Family.org> - 2020-11-25 22:00 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) olcott <NoOne@NoWhere.com> - 2020-11-25 21:08 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-27 17:31 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) olcott <NoOne@NoWhere.com> - 2020-11-27 12:28 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Step 1a) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-28 03:02 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-27 21:53 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-28 16:02 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-28 10:14 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-28 08:18 -0800
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-28 10:25 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-30 01:42 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-29 20:26 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-12-01 01:30 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) olcott <NoOne@NoWhere.com> - 2020-11-30 19:43 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-12-02 02:42 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) olcott <NoOne@NoWhere.com> - 2020-12-01 20:56 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) Richard Damon <Richard@Damon-Family.org> - 2020-12-01 22:40 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-12-03 02:16 +0000
Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) olcott <NoOne@NoWhere.com> - 2020-12-02 20:37 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Richard Damon <Richard@Damon-Family.org> - 2020-11-30 21:09 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) olcott <NoOne@NoWhere.com> - 2020-11-30 22:02 -0600
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Richard Damon <Richard@Damon-Family.org> - 2020-12-01 06:51 -0500
Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-12-02 02:50 +0000
Page 11 of 11 — ← Prev page 1 … 9 10 [11]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-30 19:43 -0600 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <w4SdnQxgcdw0AljCnZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #26248 |
On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>> <cut>
>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>> finite computation and false otherwise.
>>>>>>>
>>>>>>> Do you agree?
>>>>
>>>> I never answer yes or no questions with a yes or no answer.
>>>
>>> Let's skip this for the moment because, amazingly (and probably
>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>> to it.
>>>
>>> For reference (moved from higher up) here is your code:
>>>
>>> 08 bool Halts(u32 P, u32 I)
>>> 09 {
>>> 10 bool Halted = false;
>>> 11 bool Aborted = false;
>>> 12 while (!Halted && !Aborted)
>>> 13 {
>>> 14 Halted = DebugStep(P, I);
>>> 15 Aborted = Needs_To_Be_Aborted();
>>> 16 }
>>> 17 return !Aborted;
>>> 18 }
>>>
>>> And here is my reply:
>>>
>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>
>>> <cut>
>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>
>>>> No not at all. Halts is a finite computation.
>>>
>>> As required and not in doubt.
>>>
>>>> The input to Halts is only finite because Halts forced it to be
>>>> finite, otherwise it is infinite.
>>>
>>> The input to Halts is, as you say, finite. You got there at last! So
>>> you do, in fact, agree with both these key facts:
>
> Oh you cut the awkward facts! I am not surprised. Here they are:
>
> (a) Halts(Confound_Halts, Confound_Halts) returns false
> (b) Confound_Halts(Confound_Halts) a finite computation.
>
> You appear to agree to both. The inputs to Halts represent the
> computation Confound_Halts run with input Confound_Halts which is, you
> appear to say right there, a finite computation. (Mind you, it is a
> finite computation whether you agree with that fact or not. I just
> thought we'd moved forward with you agreeing that it is.)
>
> A halt decider (in this context) is a function F such that F(P, I) is
> true iff P(I) is a finite computation and false otherwise so Halts
> clearly fails.
>
> One thing is crystal clear. Whatever you claim Halts is, it is not a
> halt decider in the sense above. If it is a decider at all, it does not
> partition the set of computations -- the pairs (P, I) -- into those that
> are finite and those that are not.
>
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
>
> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
> it would halt. It would halt as soon as Halts returns false, as you say
> it does. It is not a non-halting computation.
>
>> Just like there is no exception to this rule:
>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>
>> Every computation that would not halt if its simulation were not
>> halted is by logical necessity a non-halting computation.
>
> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
> computation must also halt. The antecedent of the "logical necessity"
> is false.
>
The question is not:
Does Confound_Halts(Confound_Halts) halt ?
The question is:
Would Confound_Halts(Confound_Halts) halt if its simulation was never
terminated?
If the answer if "no" then the meets the sufficient condition to
determine that Confound_Halts(Confound_Halts) is a non-halting
computation (AS YOUR OWN WORDS STATE):
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
DO YOU REALLY STILL NOT GET THIS ???
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-12-02 02:42 +0000 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <87pn3tvsgr.fsf@bsb.me.uk> |
| In reply to | #26251 |
olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
> On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>> <cut>
>>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>>> finite computation and false otherwise.
>>>>>>>>
>>>>>>>> Do you agree?
>>>>>
>>>>> I never answer yes or no questions with a yes or no answer.
>>>>
>>>> Let's skip this for the moment because, amazingly (and probably
>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>> to it.
>>>>
>>>> For reference (moved from higher up) here is your code:
>>>>
>>>> 08 bool Halts(u32 P, u32 I)
>>>> 09 {
>>>> 10 bool Halted = false;
>>>> 11 bool Aborted = false;
>>>> 12 while (!Halted && !Aborted)
>>>> 13 {
>>>> 14 Halted = DebugStep(P, I);
>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>> 16 }
>>>> 17 return !Aborted;
>>>> 18 }
>>>>
>>>> And here is my reply:
>>>>
>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>
>>>> <cut>
>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>
>>>>> No not at all. Halts is a finite computation.
>>>>
>>>> As required and not in doubt.
>>>>
>>>>> The input to Halts is only finite because Halts forced it to be
>>>>> finite, otherwise it is infinite.
>>>>
>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>> you do, in fact, agree with both these key facts:
>>
>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>
>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>
>> You appear to agree to both. The inputs to Halts represent the
>> computation Confound_Halts run with input Confound_Halts which is, you
>> appear to say right there, a finite computation. (Mind you, it is a
>> finite computation whether you agree with that fact or not. I just
>> thought we'd moved forward with you agreeing that it is.)
>>
>> A halt decider (in this context) is a function F such that F(P, I) is
>> true iff P(I) is a finite computation and false otherwise so Halts
>> clearly fails.
>>
>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>> halt decider in the sense above. If it is a decider at all, it does not
>> partition the set of computations -- the pairs (P, I) -- into those that
>> are finite and those that are not.
>>
>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>> A computation that would not halt if its simulation were not
>>>> halted is indeed a non-halting computation.
>>
>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>> it would halt. It would halt as soon as Halts returns false, as you say
>> it does. It is not a non-halting computation.
>>
>>> Just like there is no exception to this rule:
>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>
>>> Every computation that would not halt if its simulation were not
>>> halted is by logical necessity a non-halting computation.
>>
>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>> computation must also halt. The antecedent of the "logical necessity"
>> is false.
>>
>
> The question is not:
> Does Confound_Halts(Confound_Halts) halt ?
>
> The question is:
> Would Confound_Halts(Confound_Halts) halt if its simulation was never
> terminated?
>
> If the answer if "no" then the meets the sufficient condition to
> determine that Confound_Halts(Confound_Halts) is a non-halting
> computation (AS YOUR OWN WORDS STATE):
But the answer is, in fact, yes. Confound_Halts(Confound_Halts) halts
and so any simulation of it also halts in the usual course of the
simulation. If not, "its simulation" is not a proper simulation of it.
Neither its direct execution, nor its simulation are in any way anything
but finite.
>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>> A computation that would not halt if its simulation were not
>>>> halted is indeed a non-halting computation.
>
> DO YOU REALLY STILL NOT GET THIS ???
Yes, I get it. You need to find more cunning words than "its
simulation" if you want to trick people into agreeing with your silly
"would Confound_Halts(Confound_Halts) halt if line 15 were commented
out". In the past you have been clear about your not-quite-halting
criteria, but the trouble with being clear is that you are also clearly
wrong and no one else agreed with you.
Elsewhere, you have said:
"Halts(Confound_Halts, Confound_Halts) returns false."
Message-ID: <2aidnV9e3qQaOCDCnZ2dnUU7-c3NnZ2d@giganews.com>
and
"The input to Halts is only finite because..."
Message-ID: <6eSdnYuLBrIuVFzCnZ2dnUU7-cPNnZ2d@giganews.com>
and since false is not the correct return for input that is a finite
computation we do at least agree that your Halts function does not meet
the definition of a halt decider that I posted. Are you brave enough to
go further and accept that no function you could write can meet it?
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-01 20:56 -0600 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <xt-dnbrWHNf5n1rCnZ2dnUU7-c2dnZ2d@giganews.com> |
| In reply to | #26295 |
On 12/1/2020 8:42 PM, Ben Bacarisse wrote:
> olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
>
>> On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>>> <cut>
>>>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>
>>>>>>>>> Do you agree?
>>>>>>
>>>>>> I never answer yes or no questions with a yes or no answer.
>>>>>
>>>>> Let's skip this for the moment because, amazingly (and probably
>>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>>> to it.
>>>>>
>>>>> For reference (moved from higher up) here is your code:
>>>>>
>>>>> 08 bool Halts(u32 P, u32 I)
>>>>> 09 {
>>>>> 10 bool Halted = false;
>>>>> 11 bool Aborted = false;
>>>>> 12 while (!Halted && !Aborted)
>>>>> 13 {
>>>>> 14 Halted = DebugStep(P, I);
>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>> 16 }
>>>>> 17 return !Aborted;
>>>>> 18 }
>>>>>
>>>>> And here is my reply:
>>>>>
>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>
>>>>> <cut>
>>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>>
>>>>>> No not at all. Halts is a finite computation.
>>>>>
>>>>> As required and not in doubt.
>>>>>
>>>>>> The input to Halts is only finite because Halts forced it to be
>>>>>> finite, otherwise it is infinite.
>>>>>
>>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>>> you do, in fact, agree with both these key facts:
>>>
>>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>>
>>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>>
>>> You appear to agree to both. The inputs to Halts represent the
>>> computation Confound_Halts run with input Confound_Halts which is, you
>>> appear to say right there, a finite computation. (Mind you, it is a
>>> finite computation whether you agree with that fact or not. I just
>>> thought we'd moved forward with you agreeing that it is.)
>>>
>>> A halt decider (in this context) is a function F such that F(P, I) is
>>> true iff P(I) is a finite computation and false otherwise so Halts
>>> clearly fails.
>>>
>>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>>> halt decider in the sense above. If it is a decider at all, it does not
>>> partition the set of computations -- the pairs (P, I) -- into those that
>>> are finite and those that are not.
>>>
>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>> A computation that would not halt if its simulation were not
>>>>> halted is indeed a non-halting computation.
>>>
>>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>>> it would halt. It would halt as soon as Halts returns false, as you say
>>> it does. It is not a non-halting computation.
>>>
>>>> Just like there is no exception to this rule:
>>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>>
>>>> Every computation that would not halt if its simulation were not
>>>> halted is by logical necessity a non-halting computation.
>>>
>>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>>> computation must also halt. The antecedent of the "logical necessity"
>>> is false.
>>>
>>
>> The question is not:
>> Does Confound_Halts(Confound_Halts) halt ?
>>
>> The question is:
>> Would Confound_Halts(Confound_Halts) halt if its simulation was never
>> terminated?
>>
>> If the answer if "no" then the meets the sufficient condition to
>> determine that Confound_Halts(Confound_Halts) is a non-halting
>> computation (AS YOUR OWN WORDS STATE):
>
> But the answer is, in fact, yes. Confound_Halts(Confound_Halts) halts
> and so any simulation of it also halts in the usual course of the
> simulation. If not, "its simulation" is not a proper simulation of it.
> Neither its direct execution, nor its simulation are in any way anything
> but finite.
>
>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>> A computation that would not halt if its simulation were not
>>>>> halted is indeed a non-halting computation.
>>
>> DO YOU REALLY STILL NOT GET THIS ???
>
> Yes, I get it. You need to find more cunning words than "its
> simulation" if you want to trick people into agreeing with your silly
> "would Confound_Halts(Confound_Halts) halt if line 15 were commented
> out". In the past you have been clear about your not-quite-halting
> criteria, but the trouble with being clear is that you are also clearly
> wrong and no one else agreed with you.
>
On 11/30/2020 7:40 PM, Ben Bacarisse wrote:> But the computation in
> It halts of its own accord as soon a Halts returns false.
> It halts of its own accord as soon a Halts returns false.
> It halts of its own accord as soon a Halts returns false.
IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
--
Copyright 2020 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 | 2020-12-01 22:40 -0500 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <s0ExH.32551$7D7.19200@fx03.iad> |
| In reply to | #26299 |
On 12/1/20 9:56 PM, olcott wrote:
> On 12/1/2020 8:42 PM, Ben Bacarisse wrote:
>> olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
>>
>>> On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>>>> <cut>
>>>>>>>>>> A halt decider is a function F such that F(P, I) is true iff
>>>>>>>>>> P(I) is a
>>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>>
>>>>>>>>>> Do you agree?
>>>>>>>
>>>>>>> I never answer yes or no questions with a yes or no answer.
>>>>>>
>>>>>> Let's skip this for the moment because, amazingly (and probably
>>>>>> unwisely), you are very clear later on. Since that's crux, let's
>>>>>> skip
>>>>>> to it.
>>>>>>
>>>>>> For reference (moved from higher up) here is your code:
>>>>>>
>>>>>> 08 bool Halts(u32 P, u32 I)
>>>>>> 09 {
>>>>>> 10 bool Halted = false;
>>>>>> 11 bool Aborted = false;
>>>>>> 12 while (!Halted && !Aborted)
>>>>>> 13 {
>>>>>> 14 Halted = DebugStep(P, I);
>>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>>> 16 }
>>>>>> 17 return !Aborted;
>>>>>> 18 }
>>>>>>
>>>>>> And here is my reply:
>>>>>>
>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>
>>>>>> <cut>
>>>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according
>>>>>>>> to you,
>>>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>>>
>>>>>>> No not at all. Halts is a finite computation.
>>>>>>
>>>>>> As required and not in doubt.
>>>>>>
>>>>>>> The input to Halts is only finite because Halts forced it to be
>>>>>>> finite, otherwise it is infinite.
>>>>>>
>>>>>> The input to Halts is, as you say, finite. You got there at
>>>>>> last! So
>>>>>> you do, in fact, agree with both these key facts:
>>>>
>>>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>>>
>>>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>>>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>>>
>>>> You appear to agree to both. The inputs to Halts represent the
>>>> computation Confound_Halts run with input Confound_Halts which is, you
>>>> appear to say right there, a finite computation. (Mind you, it is a
>>>> finite computation whether you agree with that fact or not. I just
>>>> thought we'd moved forward with you agreeing that it is.)
>>>>
>>>> A halt decider (in this context) is a function F such that F(P, I) is
>>>> true iff P(I) is a finite computation and false otherwise so Halts
>>>> clearly fails.
>>>>
>>>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>>>> halt decider in the sense above. If it is a decider at all, it does
>>>> not
>>>> partition the set of computations -- the pairs (P, I) -- into those
>>>> that
>>>> are finite and those that are not.
>>>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> A computation that would not halt if its simulation were not
>>>>>> halted is indeed a non-halting computation.
>>>>
>>>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>>>> it would halt. It would halt as soon as Halts returns false, as you
>>>> say
>>>> it does. It is not a non-halting computation.
>>>>
>>>>> Just like there is no exception to this rule:
>>>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>>>
>>>>> Every computation that would not halt if its simulation were not
>>>>> halted is by logical necessity a non-halting computation.
>>>>
>>>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of
>>>> that
>>>> computation must also halt. The antecedent of the "logical necessity"
>>>> is false.
>>>>
>>>
>>> The question is not:
>>> Does Confound_Halts(Confound_Halts) halt ?
>>>
>>> The question is:
>>> Would Confound_Halts(Confound_Halts) halt if its simulation was never
>>> terminated?
>>>
>>> If the answer if "no" then the meets the sufficient condition to
>>> determine that Confound_Halts(Confound_Halts) is a non-halting
>>> computation (AS YOUR OWN WORDS STATE):
>>
>> But the answer is, in fact, yes. Confound_Halts(Confound_Halts) halts
>> and so any simulation of it also halts in the usual course of the
>> simulation. If not, "its simulation" is not a proper simulation of it.
>> Neither its direct execution, nor its simulation are in any way anything
>> but finite.
>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> A computation that would not halt if its simulation were not
>>>>>> halted is indeed a non-halting computation.
>>>
>>> DO YOU REALLY STILL NOT GET THIS ???
>>
>> Yes, I get it. You need to find more cunning words than "its
>> simulation" if you want to trick people into agreeing with your silly
>> "would Confound_Halts(Confound_Halts) halt if line 15 were commented
>> out". In the past you have been clear about your not-quite-halting
>> criteria, but the trouble with being clear is that you are also clearly
>> wrong and no one else agreed with you.
>>
>
> On 11/30/2020 7:40 PM, Ben Bacarisse wrote:> But the computation in
>> It halts of its own accord as soon a Halts returns false.
>> It halts of its own accord as soon a Halts returns false.
>> It halts of its own accord as soon a Halts returns false.
>
> IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
> IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
> IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
>
>
Wait, are you saying that Halts DOES return false, or does it not halt
on ts own accord because Halts does not return false at all, but the
whole program is aborted. YOu have said both, and those are inconsistent.
If it actually doesn't return but just aborts, then we need to do what
Linz says to do, and take the halting decider, the WHOLE program/OS, and
adjust its terminal states as H_Hat/Confounds_Halts say, and if it
detects a halt response, go into an infinite loop, and if the detects a
non-halting response just halt.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-12-03 02:16 +0000 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <87czzrvdl3.fsf@bsb.me.uk> |
| In reply to | #26299 |
olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
> On 12/1/2020 8:42 PM, Ben Bacarisse wrote:
>> olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
>>
>>> On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>>>> <cut>
>>>>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>>
>>>>>>>>>> Do you agree?
>>>>>>>
>>>>>>> I never answer yes or no questions with a yes or no answer.
>>>>>>
>>>>>> Let's skip this for the moment because, amazingly (and probably
>>>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>>>> to it.
>>>>>>
>>>>>> For reference (moved from higher up) here is your code:
>>>>>>
>>>>>> 08 bool Halts(u32 P, u32 I)
>>>>>> 09 {
>>>>>> 10 bool Halted = false;
>>>>>> 11 bool Aborted = false;
>>>>>> 12 while (!Halted && !Aborted)
>>>>>> 13 {
>>>>>> 14 Halted = DebugStep(P, I);
>>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>>> 16 }
>>>>>> 17 return !Aborted;
>>>>>> 18 }
>>>>>>
>>>>>> And here is my reply:
>>>>>>
>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>
>>>>>> <cut>
>>>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>>>
>>>>>>> No not at all. Halts is a finite computation.
>>>>>>
>>>>>> As required and not in doubt.
>>>>>>
>>>>>>> The input to Halts is only finite because Halts forced it to be
>>>>>>> finite, otherwise it is infinite.
>>>>>>
>>>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>>>> you do, in fact, agree with both these key facts:
>>>>
>>>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>>>
>>>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>>>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>>>
>>>> You appear to agree to both. The inputs to Halts represent the
>>>> computation Confound_Halts run with input Confound_Halts which is, you
>>>> appear to say right there, a finite computation. (Mind you, it is a
>>>> finite computation whether you agree with that fact or not. I just
>>>> thought we'd moved forward with you agreeing that it is.)
>>>>
>>>> A halt decider (in this context) is a function F such that F(P, I) is
>>>> true iff P(I) is a finite computation and false otherwise so Halts
>>>> clearly fails.
>>>>
>>>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>>>> halt decider in the sense above. If it is a decider at all, it does not
>>>> partition the set of computations -- the pairs (P, I) -- into those that
>>>> are finite and those that are not.
>>>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> A computation that would not halt if its simulation were not
>>>>>> halted is indeed a non-halting computation.
>>>>
>>>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>>>> it would halt. It would halt as soon as Halts returns false, as you say
>>>> it does. It is not a non-halting computation.
>>>>
>>>>> Just like there is no exception to this rule:
>>>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>>>
>>>>> Every computation that would not halt if its simulation were not
>>>>> halted is by logical necessity a non-halting computation.
>>>>
>>>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>>>> computation must also halt. The antecedent of the "logical necessity"
>>>> is false.
>>>>
>>>
>>> The question is not:
>>> Does Confound_Halts(Confound_Halts) halt ?
>>>
>>> The question is:
>>> Would Confound_Halts(Confound_Halts) halt if its simulation was never
>>> terminated?
>>>
>>> If the answer if "no" then the meets the sufficient condition to
>>> determine that Confound_Halts(Confound_Halts) is a non-halting
>>> computation (AS YOUR OWN WORDS STATE):
>>
>> But the answer is, in fact, yes. Confound_Halts(Confound_Halts) halts
>> and so any simulation of it also halts in the usual course of the
>> simulation. If not, "its simulation" is not a proper simulation of it.
>> Neither its direct execution, nor its simulation are in any way anything
>> but finite.
>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> A computation that would not halt if its simulation were not
>>>>>> halted is indeed a non-halting computation.
>>>
>>> DO YOU REALLY STILL NOT GET THIS ???
>>
>> Yes, I get it. You need to find more cunning words than "its
>> simulation" if you want to trick people into agreeing with your silly
>> "would Confound_Halts(Confound_Halts) halt if line 15 were commented
>> out". In the past you have been clear about your not-quite-halting
>> criteria, but the trouble with being clear is that you are also clearly
>> wrong and no one else agreed with you.
>>
>
> On 11/30/2020 7:40 PM, Ben Bacarisse wrote:> But the computation in
>> It halts of its own accord as soon a Halts returns false.
>> It halts of its own accord as soon a Halts returns false.
>> It halts of its own accord as soon a Halts returns false.
Please don't suggest that I would childishly repeat myself like you do.
I've asked you before to be careful to quote people accurately.
> IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
You are not communicating effectively. If you have something to say
about what I wrote, take the time to say it coherently and make use of
the quoted context so as to be clear.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-12-02 20:37 -0600 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](Do You Really Still Not Get This?) |
| Message-ID | <5vudnWqSpvLh0lXCnZ2dnUU7-KudnZ2d@giganews.com> |
| In reply to | #26334 |
On 12/2/2020 8:16 PM, Ben Bacarisse wrote:
> olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
>
>> On 12/1/2020 8:42 PM, Ben Bacarisse wrote:
>>> olcott "Ĥ does not copy its input" <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/30/2020 7:30 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>>>>> <cut>
>>>>>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>>>
>>>>>>>>>>> Do you agree?
>>>>>>>>
>>>>>>>> I never answer yes or no questions with a yes or no answer.
>>>>>>>
>>>>>>> Let's skip this for the moment because, amazingly (and probably
>>>>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>>>>> to it.
>>>>>>>
>>>>>>> For reference (moved from higher up) here is your code:
>>>>>>>
>>>>>>> 08 bool Halts(u32 P, u32 I)
>>>>>>> 09 {
>>>>>>> 10 bool Halted = false;
>>>>>>> 11 bool Aborted = false;
>>>>>>> 12 while (!Halted && !Aborted)
>>>>>>> 13 {
>>>>>>> 14 Halted = DebugStep(P, I);
>>>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>>>> 16 }
>>>>>>> 17 return !Aborted;
>>>>>>> 18 }
>>>>>>>
>>>>>>> And here is my reply:
>>>>>>>
>>>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>>>
>>>>>>> <cut>
>>>>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>>>>
>>>>>>>> No not at all. Halts is a finite computation.
>>>>>>>
>>>>>>> As required and not in doubt.
>>>>>>>
>>>>>>>> The input to Halts is only finite because Halts forced it to be
>>>>>>>> finite, otherwise it is infinite.
>>>>>>>
>>>>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>>>>> you do, in fact, agree with both these key facts:
>>>>>
>>>>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>>>>
>>>>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>>>>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>>>>
>>>>> You appear to agree to both. The inputs to Halts represent the
>>>>> computation Confound_Halts run with input Confound_Halts which is, you
>>>>> appear to say right there, a finite computation. (Mind you, it is a
>>>>> finite computation whether you agree with that fact or not. I just
>>>>> thought we'd moved forward with you agreeing that it is.)
>>>>>
>>>>> A halt decider (in this context) is a function F such that F(P, I) is
>>>>> true iff P(I) is a finite computation and false otherwise so Halts
>>>>> clearly fails.
>>>>>
>>>>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>>>>> halt decider in the sense above. If it is a decider at all, it does not
>>>>> partition the set of computations -- the pairs (P, I) -- into those that
>>>>> are finite and those that are not.
>>>>>
>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>> A computation that would not halt if its simulation were not
>>>>>>> halted is indeed a non-halting computation.
>>>>>
>>>>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>>>>> it would halt. It would halt as soon as Halts returns false, as you say
>>>>> it does. It is not a non-halting computation.
>>>>>
>>>>>> Just like there is no exception to this rule:
>>>>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>>>>
>>>>>> Every computation that would not halt if its simulation were not
>>>>>> halted is by logical necessity a non-halting computation.
>>>>>
>>>>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>>>>> computation must also halt. The antecedent of the "logical necessity"
>>>>> is false.
>>>>>
>>>>
>>>> The question is not:
>>>> Does Confound_Halts(Confound_Halts) halt ?
>>>>
>>>> The question is:
>>>> Would Confound_Halts(Confound_Halts) halt if its simulation was never
>>>> terminated?
>>>>
>>>> If the answer if "no" then the meets the sufficient condition to
>>>> determine that Confound_Halts(Confound_Halts) is a non-halting
>>>> computation (AS YOUR OWN WORDS STATE):
>>>
>>> But the answer is, in fact, yes. Confound_Halts(Confound_Halts) halts
>>> and so any simulation of it also halts in the usual course of the
>>> simulation. If not, "its simulation" is not a proper simulation of it.
>>> Neither its direct execution, nor its simulation are in any way anything
>>> but finite.
>>>
>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>> A computation that would not halt if its simulation were not
>>>>>>> halted is indeed a non-halting computation.
>>>>
>>>> DO YOU REALLY STILL NOT GET THIS ???
>>>
>>> Yes, I get it. You need to find more cunning words than "its
>>> simulation" if you want to trick people into agreeing with your silly
>>> "would Confound_Halts(Confound_Halts) halt if line 15 were commented
>>> out". In the past you have been clear about your not-quite-halting
>>> criteria, but the trouble with being clear is that you are also clearly
>>> wrong and no one else agreed with you.
>>>
>>
>> On 11/30/2020 7:40 PM, Ben Bacarisse wrote:> But the computation in
>>> It halts of its own accord as soon a Halts returns false.
>>> It halts of its own accord as soon a Halts returns false.
>>> It halts of its own accord as soon a Halts returns false.
>
> Please don't suggest that I would childishly repeat myself like you do.
> I've asked you before to be careful to quote people accurately.
>
>> IT DOES NOT HALT OF ITS OWN ACCORD AS SOON A HALTS RETURNS FALSE.
>
> You are not communicating effectively. If you have something to say
> about what I wrote, take the time to say it coherently and make use of
> the quoted context so as to be clear.
>
void Confound_Halts(u32 P)
{
if (DebugTrace(P, P))
while (1);
}
int main()
{
DebugTrace((u32)Confound_Halts, (u32)Confound_Halts);
HALT;
}
_Confound_Halts()
[0000055c](01) 55 push ebp
[0000055d](02) 8bec mov ebp,esp
[0000055f](03) 8b4508 mov eax,[ebp+08]
[00000562](01) 50 push eax
[00000563](03) 8b4d08 mov ecx,[ebp+08]
[00000566](01) 51 push ecx
[00000567](05) e8d0fdffff call 0000033c
[0000056c](03) 83c408 add esp,+08
[0000056f](02) 85c0 test eax,eax
[00000571](02) 740b jz 0000057e
[00000573](05) ba01000000 mov edx,00000001
[00000578](02) 85d2 test edx,edx
[0000057a](02) 7402 jz 0000057e
[0000057c](02) ebf5 jmp 00000573
[0000057e](01) 5d pop ebp
[0000057f](01) c3 ret
_main()
[0000058c](01) 55 push ebp
[0000058d](02) 8bec mov ebp,esp
[0000058f](05) 685c050000 push 0000055c
[00000594](05) 685c050000 push 0000055c
[00000599](05) e89efdffff call 0000033c
[0000059e](03) 83c408 add esp,+08
[000005a1](01) f4 hlt
[000005a2](01) 5d pop ebp
[000005a3](01) c3 ret
Output_Debug_Trace() Trace_List.size(18)
[00000566](01) 51 push ecx
[00000563](03) 8b4d08 mov ecx,[ebp+08]
[00000562](01) 50 push eax
[0000055f](03) 8b4508 mov eax,[ebp+08]
[0000055d](02) 8bec mov ebp,esp
[0000055c](01) 55 push ebp
[00000567](05) e8d0fdffff call 0000033c ----CALL [0000033c]
[00000566](01) 51 push ecx
[00000563](03) 8b4d08 mov ecx,[ebp+08]
[00000562](01) 50 push eax
[0000055f](03) 8b4508 mov eax,[ebp+08]
[0000055d](02) 8bec mov ebp,esp
[0000055c](01) 55 push ebp
[00000599](05) e89efdffff call 0000033c ----CALL [0000033c]
[00000594](05) 685c050000 push 0000055c
[0000058f](05) 685c050000 push 0000055c
[0000058d](02) 8bec mov ebp,esp
[00000567](05) e8d0fdffff call 0000033c ----CALL [0000033c]
The PRIOR Instruction Specifies Infinite Recursion: Simulation Stopped:
--
Copyright 2020 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 | 2020-11-30 21:09 -0500 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) |
| Message-ID | <vBhxH.55980$sW6.5316@fx47.iad> |
| In reply to | #26248 |
On 11/30/20 8:30 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>> <cut>
>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>> finite computation and false otherwise.
>>>>>>>
>>>>>>> Do you agree?
>>>>
>>>> I never answer yes or no questions with a yes or no answer.
>>>
>>> Let's skip this for the moment because, amazingly (and probably
>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>> to it.
>>>
>>> For reference (moved from higher up) here is your code:
>>>
>>> 08 bool Halts(u32 P, u32 I)
>>> 09 {
>>> 10 bool Halted = false;
>>> 11 bool Aborted = false;
>>> 12 while (!Halted && !Aborted)
>>> 13 {
>>> 14 Halted = DebugStep(P, I);
>>> 15 Aborted = Needs_To_Be_Aborted();
>>> 16 }
>>> 17 return !Aborted;
>>> 18 }
>>>
>>> And here is my reply:
>>>
>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>
>>> <cut>
>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>
>>>> No not at all. Halts is a finite computation.
>>>
>>> As required and not in doubt.
>>>
>>>> The input to Halts is only finite because Halts forced it to be
>>>> finite, otherwise it is infinite.
>>>
>>> The input to Halts is, as you say, finite. You got there at last! So
>>> you do, in fact, agree with both these key facts:
>
> Oh you cut the awkward facts! I am not surprised. Here they are:
>
> (a) Halts(Confound_Halts, Confound_Halts) returns false
> (b) Confound_Halts(Confound_Halts) a finite computation.
>
> You appear to agree to both. The inputs to Halts represent the
> computation Confound_Halts run with input Confound_Halts which is, you
> appear to say right there, a finite computation. (Mind you, it is a
> finite computation whether you agree with that fact or not. I just
> thought we'd moved forward with you agreeing that it is.)
>
> A halt decider (in this context) is a function F such that F(P, I) is
> true iff P(I) is a finite computation and false otherwise so Halts
> clearly fails.
>
> One thing is crystal clear. Whatever you claim Halts is, it is not a
> halt decider in the sense above. If it is a decider at all, it does not
> partition the set of computations -- the pairs (P, I) -- into those that
> are finite and those that are not.
>
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
>
> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
> it would halt. It would halt as soon as Halts returns false, as you say
> it does. It is not a non-halting computation.
>
>> Just like there is no exception to this rule:
>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>
>> Every computation that would not halt if its simulation were not
>> halted is by logical necessity a non-halting computation.
>
> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
> computation must also halt. The antecedent of the "logical necessity"
> is false.
>
Ben,
Peter's scm here is that the Halts function actually is just a call to
run the input in a new context, and doesn't actually return the
decision, and thus Halts is NOT a Halt Decider. Halts is just a sham.
The actual Halt Decider he has is the whole program, and when it detects
not-halting behavior, he aborts THE WHOLE PROGRAM, not just the
parameter to Halts.
This is his attempt to get around Linz. Basically he lies about what
Halts is to make it SEEM like he has something like the classical halt
detector.
What you need to do is just define a new function, like H, which is the
REAL halt decider built via Compuational Equivalence to his program,
then you can use that H, and it likely messes up his UTM as that mode
likely isn't programmed to handle nested VMs.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-30 22:02 -0600 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) |
| Message-ID | <msidndwueoDSXVjCnZ2dnUU7-SfNnZ2d@giganews.com> |
| In reply to | #26254 |
On 11/30/2020 8:09 PM, Richard Damon wrote:
> On 11/30/20 8:30 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>> <cut>
>>>>>>>> A halt decider is a function F such that F(P, I) is true iff P(I) is a
>>>>>>>> finite computation and false otherwise.
>>>>>>>>
>>>>>>>> Do you agree?
>>>>>
>>>>> I never answer yes or no questions with a yes or no answer.
>>>>
>>>> Let's skip this for the moment because, amazingly (and probably
>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>> to it.
>>>>
>>>> For reference (moved from higher up) here is your code:
>>>>
>>>> 08 bool Halts(u32 P, u32 I)
>>>> 09 {
>>>> 10 bool Halted = false;
>>>> 11 bool Aborted = false;
>>>> 12 while (!Halted && !Aborted)
>>>> 13 {
>>>> 14 Halted = DebugStep(P, I);
>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>> 16 }
>>>> 17 return !Aborted;
>>>> 18 }
>>>>
>>>> And here is my reply:
>>>>
>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>
>>>> <cut>
>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to you,
>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>
>>>>> No not at all. Halts is a finite computation.
>>>>
>>>> As required and not in doubt.
>>>>
>>>>> The input to Halts is only finite because Halts forced it to be
>>>>> finite, otherwise it is infinite.
>>>>
>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>> you do, in fact, agree with both these key facts:
>>
>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>
>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>
>> You appear to agree to both. The inputs to Halts represent the
>> computation Confound_Halts run with input Confound_Halts which is, you
>> appear to say right there, a finite computation. (Mind you, it is a
>> finite computation whether you agree with that fact or not. I just
>> thought we'd moved forward with you agreeing that it is.)
>>
>> A halt decider (in this context) is a function F such that F(P, I) is
>> true iff P(I) is a finite computation and false otherwise so Halts
>> clearly fails.
>>
>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>> halt decider in the sense above. If it is a decider at all, it does not
>> partition the set of computations -- the pairs (P, I) -- into those that
>> are finite and those that are not.
>>
>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>> A computation that would not halt if its simulation were not
>>>> halted is indeed a non-halting computation.
>>
>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>> it would halt. It would halt as soon as Halts returns false, as you say
>> it does. It is not a non-halting computation.
>>
>>> Just like there is no exception to this rule:
>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>
>>> Every computation that would not halt if its simulation were not
>>> halted is by logical necessity a non-halting computation.
>>
>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>> computation must also halt. The antecedent of the "logical necessity"
>> is false.
>>
>
> Ben,
>
> Peter's scm here is that the Halts function actually is just a call to
> run the input in a new context, and doesn't actually return the
> decision, and thus Halts is NOT a Halt Decider.
I think that Ben may understand that an infinitely recursive function
CALL NEVER EVER RETURNS A VALUE TO ITS CALLER, NOT EVEN ONCE IN A
MILLION YEARS.
> Halts is just a sham.
> The actual Halt Decider he has is the whole program, and when it detects
> not-halting behavior, he aborts THE WHOLE PROGRAM, not just the
> parameter to Halts.
>
> This is his attempt to get around Linz. Basically he lies about what
> Halts is to make it SEEM like he has something like the classical halt
> detector.
>
> What you need to do is just define a new function, like H, which is the
> REAL halt decider built via Compuational Equivalence to his program,
> then you can use that H, and it likely messes up his UTM as that mode
> likely isn't programmed to handle nested VMs.
>
--
Copyright 2020 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 | 2020-12-01 06:51 -0500 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) |
| Message-ID | <e7qxH.40140$NL3.6427@fx12.iad> |
| In reply to | #26256 |
On 11/30/20 11:02 PM, olcott wrote:
> On 11/30/2020 8:09 PM, Richard Damon wrote:
>> On 11/30/20 8:30 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>> On 11/27/2020 11:31 AM, Ben Bacarisse wrote:
>>>>> <cut>
>>>>>>>>> A halt decider is a function F such that F(P, I) is true iff
>>>>>>>>> P(I) is a
>>>>>>>>> finite computation and false otherwise.
>>>>>>>>>
>>>>>>>>> Do you agree?
>>>>>>
>>>>>> I never answer yes or no questions with a yes or no answer.
>>>>>
>>>>> Let's skip this for the moment because, amazingly (and probably
>>>>> unwisely), you are very clear later on. Since that's crux, let's skip
>>>>> to it.
>>>>>
>>>>> For reference (moved from higher up) here is your code:
>>>>>
>>>>> 08 bool Halts(u32 P, u32 I)
>>>>> 09 {
>>>>> 10 bool Halted = false;
>>>>> 11 bool Aborted = false;
>>>>> 12 while (!Halted && !Aborted)
>>>>> 13 {
>>>>> 14 Halted = DebugStep(P, I);
>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>> 16 }
>>>>> 17 return !Aborted;
>>>>> 18 }
>>>>>
>>>>> And here is my reply:
>>>>>
>>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
>>>>>
>>>>> <cut>
>>>>>>> Halts(Confound_Halts, Confound_Halts) returns false, according to
>>>>>>> you,
>>>>>>> making Confound_Halts(Confound_Halts) a finite computation.
>>>>>>
>>>>>> No not at all. Halts is a finite computation.
>>>>>
>>>>> As required and not in doubt.
>>>>>
>>>>>> The input to Halts is only finite because Halts forced it to be
>>>>>> finite, otherwise it is infinite.
>>>>>
>>>>> The input to Halts is, as you say, finite. You got there at last! So
>>>>> you do, in fact, agree with both these key facts:
>>>
>>> Oh you cut the awkward facts! I am not surprised. Here they are:
>>>
>>> (a) Halts(Confound_Halts, Confound_Halts) returns false
>>> (b) Confound_Halts(Confound_Halts) a finite computation.
>>>
>>> You appear to agree to both. The inputs to Halts represent the
>>> computation Confound_Halts run with input Confound_Halts which is, you
>>> appear to say right there, a finite computation. (Mind you, it is a
>>> finite computation whether you agree with that fact or not. I just
>>> thought we'd moved forward with you agreeing that it is.)
>>>
>>> A halt decider (in this context) is a function F such that F(P, I) is
>>> true iff P(I) is a finite computation and false otherwise so Halts
>>> clearly fails.
>>>
>>> One thing is crystal clear. Whatever you claim Halts is, it is not a
>>> halt decider in the sense above. If it is a decider at all, it does not
>>> partition the set of computations -- the pairs (P, I) -- into those that
>>> are finite and those that are not.
>>>
>>>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>>>> A computation that would not halt if its simulation were not
>>>>> halted is indeed a non-halting computation.
>>>
>>> Yes, but if Confound_Halts(Confound_Halts) were simulated (accurately)
>>> it would halt. It would halt as soon as Halts returns false, as you say
>>> it does. It is not a non-halting computation.
>>>
>>>> Just like there is no exception to this rule:
>>>> ∀n ∈ ℕ ((n > 5) → (N > 3))
>>>>
>>>> Every computation that would not halt if its simulation were not
>>>> halted is by logical necessity a non-halting computation.
>>>
>>> Confound_Halts(Confound_Halts) does halt. Any proper simulation of that
>>> computation must also halt. The antecedent of the "logical necessity"
>>> is false.
>>>
>>
>> Ben,
>>
>> Peter's scm here is that the Halts function actually is just a call to
>> run the input in a new context, and doesn't actually return the
>> decision, and thus Halts is NOT a Halt Decider.
>
> I think that Ben may understand that an infinitely recursive function
> CALL NEVER EVER RETURNS A VALUE TO ITS CALLER, NOT EVEN ONCE IN A
> MILLION YEARS.
>
The point I was pointing out is that despite its name, Halts is NOT
really the halt decider, but just a function that runs another machine.
The actual Halt Decider is the whole program.
Also, despite some of your implicatins, Halts does NOT return the
answer, it will only return if the machine it was given was halted.
This is why Halts is a very bad name for the function.
>> Halts is just a sham.
>> The actual Halt Decider he has is the whole program, and when it detects
>> not-halting behavior, he aborts THE WHOLE PROGRAM, not just the
>> parameter to Halts.
>>
>> This is his attempt to get around Linz. Basically he lies about what
>> Halts is to make it SEEM like he has something like the classical halt
>> detector.
>>
>> What you need to do is just define a new function, like H, which is the
>> REAL halt decider built via Compuational Equivalence to his program,
>> then you can use that H, and it likely messes up his UTM as that mode
>> likely isn't programmed to handle nested VMs.
>>
>
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-12-02 02:50 +0000 |
| Subject | Re: It is known that a correct halt decider must return false (in this case)[V4](keys to understanding) |
| Message-ID | <87mtywx6oz.fsf@bsb.me.uk> |
| In reply to | #26254 |
Richard Damon <Richard@Damon-Family.org> writes:
<cut>
>>> On 11/29/2020 7:42 PM, Ben Bacarisse wrote:
<cut>
>>>> For reference (moved from higher up) here is your code:
>>>>
>>>> 08 bool Halts(u32 P, u32 I)
>>>> 09 {
>>>> 10 bool Halted = false;
>>>> 11 bool Aborted = false;
>>>> 12 while (!Halted && !Aborted)
>>>> 13 {
>>>> 14 Halted = DebugStep(P, I);
>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>> 16 }
>>>> 17 return !Aborted;
>>>> 18 }
>>>>
>>>> And here is my reply:
>>>>
>>>> void Confound_Halts(u32 P) { if (Halts(P, P)) while (1); }
> Ben,
>
> Peter's scm here is that the Halts function actually is just a call to
> run the input in a new context, and doesn't actually return the
> decision, and thus Halts is NOT a Halt Decider.
That is not the function he posted above. The Halts sketched above
always returns, either because the simulation ends (the input
computation halts after a finite number of steps) or the simulation
"has" to be stopped because it would not otherwise halt.
What's more he explicitly stated that:
"Halts(Confound_Halts, Confound_Halts) returns false."
Message-ID: <2aidnV9e3qQaOCDCnZ2dnUU7-c3NnZ2d@giganews.com>
What's more, he has told me that the input to Halts(Confound_Halts,
Confound_Halts) is a finite computation. He has complex wording to
suggest that this is the right answer because of what would happen with
slightly different computation (with line 15 commented out):
"The input to Halts is only finite because Halts forced it to be
finite, otherwise it is infinite."
Message-ID: <6eSdnYuLBrIuVFzCnZ2dnUU7-cPNnZ2d@giganews.com>
This is the ruse: halting is not exclusive halting computations. Some
non-halting computations also halt because the only halt because the
decider stopped them.
> Halts is just a sham.
> The actual Halt Decider he has is the whole program, and when it detects
> not-halting behavior, he aborts THE WHOLE PROGRAM, not just the
> parameter to Halts.
I try not to get sucked into his world. I don't care if he thinks his
washing machine is a halt decider. I presented my own challenge: there
is no function F such that F(P, I) is true iff P(I) is a finite
computation and false otherwise. If he cares to suggest such a
function, I will provide a confounding example. He did post such a
function, and provided the example. He has even, subsequently, agreed
to both (a) and (b). He just does not think that false is the wrong
return for a finite computation.
He can solve his does-a-similar-program-halt problem ten times over, but
he can't claim to have met my challenge.
> This is his attempt to get around Linz. Basically he lies about what
> Halts is to make it SEEM like he has something like the classical halt
> detector.
I'd like to excuse what appears to be dishonesty as stupidity but that
is surely not reasonable any more. It could, I suppose, be the result
of grandiose religious mania, and when I am not being insulted by him, I
try to tell myself I should not poke a stick into the padded cell.
--
Ben.
[toc] | [prev] | [standalone]
Page 11 of 11 — ← Prev page 1 … 9 10 [11]
Back to top | Article view | comp.theory
csiph-web