Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.software-eng > #2472 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-01-05 12:26 -0600 |
| Last post | 2021-01-05 22:43 +0000 |
| Articles | 20 on this page of 113 — 4 participants |
Back to article view | Back to comp.software-eng
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 12:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 13:37 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 21:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 15:42 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:24 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-05 23:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 07:55 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 13:17 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-06 21:48 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-06 16:38 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-07 05:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Deceiver?) olcott <NoOne@NoWhere.com> - 2021-01-07 10:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:41 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 13:45 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 18:11 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-07 17:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:47 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Ben's Dishonesty?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-08 18:00 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 11:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 15:59 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 21:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-08 23:08 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Jeff Barnett <jbb@notatt.com> - 2021-01-08 22:36 -0700
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 05:39 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 12:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 22:28 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-09 16:51 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-09 23:22 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 10:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:15 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-12 12:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 12:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 18:53 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] olcott <NoOne@NoWhere.com> - 2021-01-11 14:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 20:19 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) olcott <NoOne@NoWhere.com> - 2021-01-11 20:46 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](Axiomatic basis) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-11 22:23 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 09:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 10:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](decider defined) olcott <NoOne@NoWhere.com> - 2021-01-12 19:14 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 11:00 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) olcott <NoOne@NoWhere.com> - 2021-01-12 13:40 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](laser focused) olcott <NoOne@NoWhere.com> - 2021-01-12 18:32 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](actual behavior) olcott <NoOne@NoWhere.com> - 2021-01-12 19:44 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](over your head) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:27 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 12:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 19:51 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] [ Complete Proof ](of a single point) olcott <NoOne@NoWhere.com> - 2021-01-12 14:06 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 09:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 10:33 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 13:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 16:31 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 19:36 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-10 02:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-09 23:12 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:34 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-11 12:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-11 19:01 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 10:31 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 17:32 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 12:59 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 20:07 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 14:49 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 16:47 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-12 14:50 -0800
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-12 23:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 00:31 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:05 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-12 21:07 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 15:16 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-13 22:34 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:08 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 09:32 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 10:48 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-16 15:09 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 16:54 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 11:22 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:33 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 19:25 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) olcott <NoOne@NoWhere.com> - 2021-01-14 12:28 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 18:43 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 00:39 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-13 11:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 14:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 15:27 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](the gist of things) olcott <NoOne@NoWhere.com> - 2021-01-13 16:22 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 09:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-14 17:10 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:26 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](PUT) olcott <NoOne@NoWhere.com> - 2021-01-14 11:25 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 20:53 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-12 19:55 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 18:57 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) olcott <NoOne@NoWhere.com> - 2021-01-13 21:21 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-13 22:15 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 09:18 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 10:41 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-14 12:16 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 14:50 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) olcott <NoOne@NoWhere.com> - 2021-01-16 16:04 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-17 04:46 +0000
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser) olcott <NoOne@NoWhere.com> - 2021-01-16 15:23 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons) olcott <NoOne@NoWhere.com> - 2021-01-05 16:03 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-05 16:10 -0600
Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-05 22:43 +0000
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-11 12:43 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <JqadneR7yvjfAWHCnZ2dnUU7-aPNnZ2d@giganews.com> |
| In reply to | #2511 |
On 1/10/2021 11:43 AM, Kaz Kylheku wrote: > On 2021-01-10, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote: >> Richard Damon <Richard@Damon-Family.org> writes: >> >>> On 1/10/21 12:12 AM, olcott wrote: >>>> >>>> >>>> It is only the wrong answer if we are asking the question: >>>> Does the input halt on its input? >>>> >>>> If we are asking the question: >>>> Does the simulation of the input have to be stopped to prevent its >>>> otherwise infinite execution? >>>> >>>> Then it is the right answer. >>>> >>> >>> At which point you need to admit that you aren't working on the >>> classical Hating Problem, which asks the first question, but some other >>> question, and thus your answer isn't applicable to proofs like Linz >>> which ARE based on the first question. >> >> Yes, except that the question "Does the simulation of the input have to >> be stopped to prevent its otherwise infinite execution" is, itself, the >> classical halting problem. > > Right; so it appears, if we treat the language very informally. > The question has an interpretation which is identical to the regular > halting question. > > But when we look at it closely, something is wrong: a TM does not > actually have any "otherwise infinite" execution. Unless the simulator decides to stop simulating H_Hat() (or any other program) when it matches this criteria H_Hat() (or any other progam) executes forever. Infinite Recursion detection AXIOM (a) Within an execution trace (b) The same function is called (c) From the same machine address (d) With the same data // Richard Damon credit (e) A second time (f) Without any control flow instructions inbetween This can be understood to be necessarily true and thus impossibly false. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-11 19:01 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210111105354.355@kylheku.com> |
| In reply to | #2515 |
On 2021-01-11, olcott <NoOne@NoWhere.com> wrote: > Unless the simulator decides to stop simulating H_Hat() (or any other > program) when it matches this criteria H_Hat() (or any other progam) > executes forever. > > Infinite Recursion detection AXIOM > (a) Within an execution trace > (b) The same function is called > (c) From the same machine address > (d) With the same data // Richard Damon credit > (e) A second time > (f) Without any control flow instructions inbetween There are control flow instructions in the loop that Halts wraps around DebugStep. The loop calls DebugStep and then looks at some conditions that determine whether the loop should break out. Those conditions must necessarily translate to control flow instructions. Halts never calls H_Hat directly; it indirectly calls it by initializing a simulator and calling DebugStep in a loop. The execution of that loop is interleaved with the stepping of H_Hat, therefore. Whenever DebugStep is called, an instruction of H_Hat proceeds. Then it returns, and insructions of the Halt function's loop are executing. (These may themselves be stepped by a higher level DebugStep). Anyway, the overall instruction stream has a mixture of control flow coming from the loop, and therefore there must be control flow instructions. Therefore, something is off about that recursion detection "axiom". (Not that it matters, since all that matters ultimately that somehow the contraption *does* manage to prevent infinite recursion, and in so doing creates a H_Hat(H_Hat) variant that terminates, while the answer from the decider, when it is interrogated about that variant, is the incorrect value 0.) -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 10:31 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <Lr-dnRi0FcVuU2DCnZ2dnUU7-YHNnZ2d@giganews.com> |
| In reply to | #2511 |
On 1/12/2021 10:23 AM, Richard Damon wrote: > On 1/12/21 10:53 AM, olcott wrote: >> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>> >>>> On 1/10/21 12:12 AM, olcott wrote: >>>>> >>>>> >>>>> It is only the wrong answer if we are asking the question: >>>>> Does the input halt on its input? >>>>> >>>>> If we are asking the question: >>>>> Does the simulation of the input have to be stopped to prevent its >>>>> otherwise infinite execution? >>>>> >>>>> Then it is the right answer. >>>>> >>>> >>>> At which point you need to admit that you aren't working on the >>>> classical Hating Problem, which asks the first question, but some other >>>> question, and thus your answer isn't applicable to proofs like Linz >>>> which ARE based on the first question. >>> >>> Yes, except that the question "Does the simulation of the input have to >>> be stopped to prevent its otherwise infinite execution" is, itself, the >>> classical halting problem. >> >> This is one of the very rare times that you have ever agreed with me on >> a material fact. >> >> The original halting problem undecidability proof question: >> Does the input halt on its input? >> >> conflates together non-halting inputs with halting inputs >> >> and answers yes when: >> (a) The simulation of the input has to be stopped to prevent its >> otherwise infinite execution. >> >> and also answers yes when: >> (b) The simulation of the input terminates without having to be stopped. >> > > You are very good at twisting words and definition and stating things > awkwardly. > > The Halting problem question is: Would the Machine which the input > represents halt for the input provided. > I have proved that you are wrong on this many times. You keep conflating the halting problem undecidability proofs with the halting problem itself. Ben agrees with me that you are wrong about this On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: >> At which point you need to admit that you aren't working on the >> classical Hating Problem, which asks the first question, but >> some other question, and thus your answer isn't applicable to >> proofs like Linz which ARE based on the first question. > > Yes, except that the question "Does the simulation of the > input have to be stopped to prevent its otherwise infinite > execution" is, itself, the classical halting problem. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-12 17:32 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210112092842.233@kylheku.com> |
| In reply to | #2525 |
On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: > You keep conflating the halting problem undecidability proofs with the > halting problem itself. This is legitimate, since those proofs speak to the halting problem and are unassailably correct beyond all possible hope of refutation. > Ben agrees with me that you are wrong about this > > On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > > Richard Damon <Richard@Damon-Family.org> writes: > >> At which point you need to admit that you aren't working on the > >> classical Hating Problem, which asks the first question, but > >> some other question, and thus your answer isn't applicable to > >> proofs like Linz which ARE based on the first question. > > > > Yes, except that the question "Does the simulation of the > > input have to be stopped to prevent its otherwise infinite > > execution" is, itself, the classical halting problem. Ben is disagreeing with your claim that this question is *different* from the classical halting problem. I agree with you that it is a different question. It contains verbal equivocation whereby two different turing machines are referred to as if they were one. The original question doesn't have that problem. A question with an idiotic equivocation problem cannot be equivalent to a flawless question. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 12:59 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <5Z-dnb1BStYqbGDCnZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #2530 |
On 1/12/2021 11:32 AM, Kaz Kylheku wrote: > On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >> You keep conflating the halting problem undecidability proofs with the >> halting problem itself. > > This is legitimate, since those proofs speak to the halting problem and > are unassailably correct beyond all possible hope of refutation. > >> Ben agrees with me that you are wrong about this >> >> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>>> At which point you need to admit that you aren't working on the >>>> classical Hating Problem, which asks the first question, but >>>> some other question, and thus your answer isn't applicable to >>>> proofs like Linz which ARE based on the first question. >>> >>> Yes, except that the question "Does the simulation of the >>> input have to be stopped to prevent its otherwise infinite >>> execution" is, itself, the classical halting problem. > > Ben is disagreeing with your claim that this question is > *different* from the classical halting problem. > > I agree with you that it is a different question. It contains > verbal equivocation whereby two different turing machines are referred > to as if they were one. > > The original question doesn't have that problem. > > A question with an idiotic equivocation problem cannot be equivalent to > a flawless question. > (a) and (b) define not-halting inputs and halting inputs in the same way that the set of things that are not cows is a different set than the set of things that are cows. (a) The simulation of the input has to be stopped to prevent its otherwise infinite execution. (b) The simulation of the input terminates without having to be stopped. What is it that seems to be any equivocation to you? -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-12 20:07 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <20210112115207.987@kylheku.com> |
| In reply to | #2533 |
["Followup-To:" header set to comp.theory.] On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: > On 1/12/2021 11:32 AM, Kaz Kylheku wrote: >> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> You keep conflating the halting problem undecidability proofs with the >>> halting problem itself. >> >> This is legitimate, since those proofs speak to the halting problem and >> are unassailably correct beyond all possible hope of refutation. >> >>> Ben agrees with me that you are wrong about this >>> >>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>> Richard Damon <Richard@Damon-Family.org> writes: >>>>> At which point you need to admit that you aren't working on the >>>>> classical Hating Problem, which asks the first question, but >>>>> some other question, and thus your answer isn't applicable to >>>>> proofs like Linz which ARE based on the first question. >>>> >>>> Yes, except that the question "Does the simulation of the >>>> input have to be stopped to prevent its otherwise infinite >>>> execution" is, itself, the classical halting problem. >> >> Ben is disagreeing with your claim that this question is >> *different* from the classical halting problem. >> >> I agree with you that it is a different question. It contains >> verbal equivocation whereby two different turing machines are referred >> to as if they were one. >> >> The original question doesn't have that problem. >> >> A question with an idiotic equivocation problem cannot be equivalent to >> a flawless question. >> > > (a) and (b) define not-halting inputs and halting inputs in the same way > that the set of things that are not cows is a different set than the set > of things that are cows. > > (a) The simulation of the input has to be stopped to prevent its > otherwise infinite execution. > > (b) The simulation of the input terminates without having to be stopped. > > What is it that seems to be any equivocation to you? The pronoun "its" in (a) refers to two different Turing Machines, one which terminates (let's call it A) and one which exhibits infinite execution (B). These are necessarily different machines, because no TM both terminates and fails to terminate. What (a) says is 'The simulation of A has to be stopped to prevent the infinite execution of B'. Because A is stopped, it cannot be B, which has infinite execution. Only, you are falsely claming that A = B, and so you can "infinite execution of B" is replaced by the pronoun "its". In he concrete program you have written, there is a H_Hat0(H_Hat0) which does not terminate (because it's run in a free-running simulation mode). There is a H_Hat1(H_Hat1) which terminates. You're saying that these are the same TM, so that "when H_Hat1(H_Hat1) is terminated, the infinite execution of H_Hat0(H_Hat0) is prevented". Of course, this sentence sound completely hokey, right? But we can perpetrate a verbal fallacy of equivocation: replace both H_Hat0(H_Hat0) and H_Hat1(H_Hat1) with just H_Hat(H_Hat): Now we have "when H_Hat(H_Hat) is terminated, the infinite execution of H_Hat(H_Hat) is prevented" which seems to make sense, and we can further insert the pronoun "its". Now we have "when H_Hat(H_Hat) is terminated, its infinite execution is prevented". This is used as the basis for claiming that H_Hat(H_Hat) has the property of "infinite execution" (is non-terminating), and that this was correctly caught by an aborted simulation. It's just a verbal house of cards.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 14:49 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?) |
| Message-ID | <7p-dnYAq2tDwlmPCnZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #2537 |
On 1/12/2021 2:07 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >> On 1/12/2021 11:32 AM, Kaz Kylheku wrote: >>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>>> You keep conflating the halting problem undecidability proofs with the >>>> halting problem itself. >>> >>> This is legitimate, since those proofs speak to the halting problem and >>> are unassailably correct beyond all possible hope of refutation. >>> >>>> Ben agrees with me that you are wrong about this >>>> >>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>>>> Richard Damon <Richard@Damon-Family.org> writes: >>>>>> At which point you need to admit that you aren't working on the >>>>>> classical Hating Problem, which asks the first question, but >>>>>> some other question, and thus your answer isn't applicable to >>>>>> proofs like Linz which ARE based on the first question. >>>>> >>>>> Yes, except that the question "Does the simulation of the >>>>> input have to be stopped to prevent its otherwise infinite >>>>> execution" is, itself, the classical halting problem. >>> >>> Ben is disagreeing with your claim that this question is >>> *different* from the classical halting problem. >>> >>> I agree with you that it is a different question. It contains >>> verbal equivocation whereby two different turing machines are referred >>> to as if they were one. >>> >>> The original question doesn't have that problem. >>> >>> A question with an idiotic equivocation problem cannot be equivalent to >>> a flawless question. >>> >> >> (a) and (b) define not-halting inputs and halting inputs in the same way >> that the set of things that are not cows is a different set than the set >> of things that are cows. >> >> (a) The simulation of the input has to be stopped to prevent its >> otherwise infinite execution. >> >> (b) The simulation of the input terminates without having to be stopped. >> >> What is it that seems to be any equivocation to you? > > The pronoun "its" in (a) refers to two different Turing Machines, one > which terminates (let's call it A) and one which exhibits infinite > execution (B). These are necessarily different machines, because no TM > both terminates and fails to terminate. > > What (a) says is 'The simulation of A has to be stopped to prevent > the infinite execution of B'. > > Because A is stopped, it cannot be B, which has infinite execution. Any input meeting this criteria is input that would have infinite execution if its simulation was not stopped. Infinite Recursion detection AXIOM (self-evident truth) (a) Within an execution trace (b) The same function is called (c) From the same machine address (d) With the same data // Richard Damon credit (e) A second time (f) Without any control flow instructions inbetween The way to prove that this is true is to perform an execution trace on H_Hat() with the halt decider in disabled mode. There will also be a full trace mode that shows the execution trace of all of operating system code too. When you can look at the 100% complete execution trace and see that there are no instructions in this trace that could possibly cause it to stop, then it can be understood to be infinite. It is much much easier to come to a complete understanding of the above Infinite Recursion detection AXIOM than it is to verify that thousands of pages of x86 code specify infinite execution. None-the-less this empirical proof will be available. Even the full execution trace of Halts() correctly deciding H_Hat() is 297 pages long. This was greatly reduced to 297 pages by moving most operating system functions into emulator code. The local halt decider is entirely in emulated code so every single step of its execution can be seen. The global halt decider works best as an x86utm operating system function so that it can easily watch everything. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 16:47 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <Ut6dnZjNYuaLumPCnZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #2538 |
On 1/12/2021 3:28 PM, Kaz Kylheku wrote: > On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> The pronoun "its" in (a) refers to two different Turing Machines, one >>> which terminates (let's call it A) and one which exhibits infinite >>> execution (B). These are necessarily different machines, because no TM >>> both terminates and fails to terminate. >>> >>> What (a) says is 'The simulation of A has to be stopped to prevent >>> the infinite execution of B'. >>> >>> Because A is stopped, it cannot be B, which has infinite execution. >> >> Any input meeting this criteria is input that would have infinite >> execution if its simulation was not stopped. > > "would have" means the same thing as "does not"! > No not at all and your statement seems quite stupid. (a) Its otherwise infinite recursion is stopped. (b) Its infinite recursion is NOT stopped. Your statement is stupid because it ignores the totally obvious (b). -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-01-12 14:50 -0800 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <rtl93s$1o5$1@gioia.aioe.org> |
| In reply to | #2539 |
On 1/12/2021 2:47 PM, olcott wrote: > On 1/12/2021 3:28 PM, Kaz Kylheku wrote: >> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>>> The pronoun "its" in (a) refers to two different Turing Machines, one >>>> which terminates (let's call it A) and one which exhibits infinite >>>> execution (B). These are necessarily different machines, because no TM >>>> both terminates and fails to terminate. >>>> >>>> What (a) says is 'The simulation of A has to be stopped to prevent >>>> the infinite execution of B'. >>>> >>>> Because A is stopped, it cannot be B, which has infinite execution. >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >> >> "would have" means the same thing as "does not"! >> > > No not at all and your statement seems quite stupid. Barf! > > (a) Its otherwise infinite recursion is stopped. > (b) Its infinite recursion is NOT stopped. > > Your statement is stupid because it ignores the totally obvious (b). >
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-12 23:33 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <20210112151638.95@kylheku.com> |
| In reply to | #2539 |
["Followup-To:" header set to comp.theory.] On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: > On 1/12/2021 3:28 PM, Kaz Kylheku wrote: >> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>> On 1/12/2021 2:07 PM, Kaz Kylheku wrote: >>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote: >>>> The pronoun "its" in (a) refers to two different Turing Machines, one >>>> which terminates (let's call it A) and one which exhibits infinite >>>> execution (B). These are necessarily different machines, because no TM >>>> both terminates and fails to terminate. >>>> >>>> What (a) says is 'The simulation of A has to be stopped to prevent >>>> the infinite execution of B'. >>>> >>>> Because A is stopped, it cannot be B, which has infinite execution. >>> >>> Any input meeting this criteria is input that would have infinite >>> execution if its simulation was not stopped. >> >> "would have" means the same thing as "does not"! > > No not at all and your statement seems quite stupid. Yes it does. "I would be a rich, international playboy had I been born into different circumstances" contains exactly the same fact as "I am not a rich, international playboy". A given Turing Machine is what it is, and cannot be anything else. There is no "would/could". For instance, suppose a given Turing Machine has a tape which has 500 symbols on it. Now in informal languuage, we can make informal statements like "if we added one more symbol to it, the TM would have 501 symbols". But that sort of statement doesn't fly in reasoning formally. A TM of 500 symbols and one of 501 symbols are different TMs. If we change the tape, we are creating a different TM. The following certainly reads nicely, and might even be mildly entertaining, but is ultimately bunk: "The number pi could actually be e, if it would only quit being a circumference-to-diameter ratio, and started behaving more like the base of the natural logarithm." > (a) Its otherwise infinite recursion is stopped. If "it" is not infinitely recursive, there is no "otherwise infinite recursion". It doesn't have infinite recursion, and that's it. Formally, if you want to express the idea that recursion can be stopped or not, in a functional framework, it has to be a parameter, say S (S = stop recursion). Then, we no longer have H_Hat(P) and Halts(P, I). We have H_Hat(P, S), and Halts(P, I, S). Then we have two questions: Halts(H_Hat, H_Hat, true) Halts(H_Hat, H_Hat, false) Does H_Hat(H_Hat, true) terminate? And does H_Hat(H_Hat, false) terminate? The first question speaks only about H_Hat(H_Hat, true) and not about H_Hat(H_Hat, false). This is because he parameters are not the same. Remember this: (d) With the same data // Richard Damon credit Parameter S is part of the data. Your simulation mode swich must appear as a parameter everywhere, because it is an input. > Your statement is stupid because it ignores the totally obvious (b). What is totally obvious to the fool is not always so to the wise man. -- TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 18:10 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <8KedncqjetUcp2PCnZ2dnUU7-R_NnZ2d@giganews.com> |
| In reply to | #2541 |
On 1/12/2021 5:33 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote:
>> On 1/12/2021 3:28 PM, Kaz Kylheku wrote:
>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote:
>>>> On 1/12/2021 2:07 PM, Kaz Kylheku wrote:
>>>>> On 2021-01-12, olcott <NoOne@NoWhere.com> wrote:
>>>>> The pronoun "its" in (a) refers to two different Turing Machines, one
>>>>> which terminates (let's call it A) and one which exhibits infinite
>>>>> execution (B). These are necessarily different machines, because no TM
>>>>> both terminates and fails to terminate.
>>>>>
>>>>> What (a) says is 'The simulation of A has to be stopped to prevent
>>>>> the infinite execution of B'.
>>>>>
>>>>> Because A is stopped, it cannot be B, which has infinite execution.
>>>>
>>>> Any input meeting this criteria is input that would have infinite
>>>> execution if its simulation was not stopped.
>>>
>>> "would have" means the same thing as "does not"!
>>
>> No not at all and your statement seems quite stupid.
>
> Yes it does. "I would be a rich, international playboy had I been born
> into different circumstances" contains exactly the same fact as "I am
> not a rich, international playboy".
>
> A given Turing Machine is what it is, and cannot be anything else.
>
> There is no "would/could".
>
The same halt decider can have different behavior on the same input:
Turing Machine description when halt deciding mode {enabled, disabled}
is an additional input.
>>>> Any input meeting this criteria is input that would have infinite
>>>> execution if its simulation was not stopped.
>>>
>>> "would have" means the same thing as "does not"!
>>>> if its simulation was not stopped.
>>>> if its simulation was stopped.
You scewed up get over it, be more careful next time, and move on.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-01-13 00:31 +0000 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <20210112161713.550@kylheku.com> |
| In reply to | #2542 |
On 2021-01-13, olcott <NoOne@NoWhere.com> wrote:
> The same halt decider can have different behavior on the same input:
No, it cannot.
> Turing Machine description when halt deciding mode {enabled, disabled}
> is an additional input.
You're only admitting that now because I just pointed it out first.
In all your actual code seen so far, it still has only two parameters,
showing that you have no idea that this is actually required.
Otherwise you're controlling this extra parameter globally somewhere,
like at the build level, or something.
That is dodgy; it means that Halts is not a proper function of its
input arguments.
Even though you're not varying that parameter in any single run of the
apparatus, you're still making false claims that the result of the
apparatus pertains to the situation in which that parameter has a
different value. I.e. that the "enabled" mode apparatus is making a
decision about something in the "disabled" mode apparatus.
And, no a decider cannot have different behavior on the same inputs,
meaning the same combination of P, I and E (enabled/disabled flag).
Those are its input.
It could have a different combination on the same P, I, if E is
different. But that's not the same input. Input means *all* the input;
the entire tuple of all the function parameters.
> You scewed up get over it, be more careful next time, and move on.
I don't think so. The missing parameter means that you're violating (d)
of your so-called "axiom":
(d) With the same data // Richard Damon credit
Though you're effectively running the simulation with one value of the
parameter, like Halts(H_Hat, H_Hat, enabled = true), the enabled
flag is the same in any one run. But then you're equivocating on it,
claiming that it's actually deciding H_Hat(H_Hat, enabled = false). THe
equivocation rests in hiding that parameter, and then pretending that
there is only one H_Hat that has only two parameters.
--
TXR Programming Language: http://nongnu.org/txr
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 20:05 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <teadnfzisoX7yGPCnZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #2542 |
On 1/12/2021 7:28 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> The same halt decider can have different behavior on the same input:
>> Turing Machine description when halt deciding mode {enabled, disabled}
>> is an additional input.
>
> Well that's a breath of fresh air. You are not even trying to hide the
> trick anymore.
>
> Mike Terry asked you about this months ago and you swore blind you were
> not doing this.
>
Months ago I had not considered the possibility of having such an
option. Months ago my only halt deciding option was global mode.
I may go back to only having global mode because in only global mode it
is impossible to show anything that even superficially looks like any
inconsistency.
If the Halts() function is called from main() with a parameter it
reports back to main(). If main() has any code that would not halt
unless its simulation was stopped Halts() reports this to the command line.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-12 21:07 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <waCdnTZIMeCd-WPCnZ2dnUU7-Q_NnZ2d@giganews.com> |
| In reply to | #2542 |
On 1/12/2021 8:30 PM, Richard Damon wrote:
> On 1/12/21 7:10 PM, olcott wrote:
>>>
>> The same halt decider can have different behavior on the same input:
>> Turing Machine description when halt deciding mode {enabled, disabled}
>> is an additional input.
>>
>
> But the H in the halting problem doesn't have this extra input, so for
> Linz and such it can't really be there, for that purpose you need to
> wrap your decider with that extra input with a wrapper that always sets
> it the same way.
>
Since Linz defines the halt deciding states with the ⊢* [do any damn
thing you] want operator we are free to [do any damn thing we want].
One of the steps of these [do any damn thing we want] could be to read a
configuration parameter from the UTM tape. We could even instruct a
robot to bake a cake and make a bologna sandwich. As long as we end up
at YES or NO we met the Linz spec.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 15:16 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <YKKdnUVaeYSO_mLCnZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #2552 |
On 1/13/2021 2:37 PM, Kaz Kylheku wrote: > On 2021-01-13, olcott <NoOne@NoWhere.com> wrote: >> In Linz terms ... > > "In a nonsensical combination of words and phrases cribbed from the > Linz lexicon, which I don't actually comprehend, ..." > That is very admirable of you to say that you don't understand something. To put it in simpler terms every time that a Turing machine moves from one configuration to another it is comparable to executing a single machine language instruction. This describes a concrete implementation of a Turing Machine and the details of its machine description language: http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 21:39 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Stupid?) |
| Message-ID | <iI2dnW8eAMBGIWLCnZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #2552 |
On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>
>>>>>> The same halt decider can have different behavior on the same input:
>>>>>> Turing Machine description when halt deciding mode {enabled, disabled}
>>>>>> is an additional input.
>>>>>>
>>>>>
>>>>> But the H in the halting problem doesn't have this extra input, so for
>>>>> Linz and such it can't really be there, for that purpose you need to
>>>>> wrap your decider with that extra input with a wrapper that always sets
>>>>> it the same way.
>>>>>
>>>>
>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>> thing you] want operator we are free to [do any damn thing we want].
>>
>> In Linz terms it specifies an arbitrary set of moves from one
>> configuration to another, thus the specified algorithm is simply [do
>> any damn thing you want] (as long as you end up at YES or NO).
>
> Still wrong.
Any configuration is completely determined by the current state of the
control unit, the contents of the tape, and the position of the
read-write head (Linz 1990:236)
The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
moves (Linz 1990:237)
Therefore H begins at a start state (q0) and ends up at one of two final
states (qy) or (qn) and can [do any damn thing inbetween] as long as it
ends up deciding halting on its input.
Neither the TM H of Linz nor the Halts() shown below is required to ever
return any value to H_Hat().
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 | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-13 22:34 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <b5GdndXvLJFIVGLCnZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #2561 |
On 1/13/2021 10:03 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>>>
>>>>>>>> The same halt decider can have different behavior on the same input:
>>>>>>>> Turing Machine description when halt deciding mode {enabled, disabled}
>>>>>>>> is an additional input.
>>>>>>>>
>>>>>>>
>>>>>>> But the H in the halting problem doesn't have this extra input, so for
>>>>>>> Linz and such it can't really be there, for that purpose you need to
>>>>>>> wrap your decider with that extra input with a wrapper that always sets
>>>>>>> it the same way.
>>>>>>>
>>>>>>
>>>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>>>> thing you] want operator we are free to [do any damn thing we want].
>>>>
>>>> In Linz terms it specifies an arbitrary set of moves from one
>>>> configuration to another, thus the specified algorithm is simply [do
>>>> any damn thing you want] (as long as you end up at YES or NO).
>>>
>>> Still wrong.
>
>> Any configuration is completely determined by the current state of the
>> control unit, the contents of the tape, and the position of the
>> read-write head (Linz 1990:236)
>>
>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>> moves (Linz 1990:237)
>>
>> Therefore H begins at a start state (q0) and ends up at one of two
>> final states (qy) or (qn) and can [do any damn thing inbetween] as
>> long as it ends up deciding halting on its input.
>
> It can not, however, do this:
>
> | The same halt decider can have different behavior on the same input:
> | Turing Machine description when halt deciding mode {enabled, disabled}
> | is an additional input.
>
The Linz H would simply be Halts() in global mode.
>> Neither the TM H of Linz nor the Halts() shown below is required to
>> ever return any value to H_Hat().
>
> What you say about H is nonsense. Literal nonsense.
>
> What you say about is Halts is irrefutable since you don't show it. And
Do you understand that disagreeing with a statement that is true by
logic necessity is necessarily incorrect?
The following shows that Halts() has all the criteria required to
correctly decide not halting on H_Hat() by logical necessity.
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);
}
Output_Debug_Trace() [0001112e] size(124) capacity(65536)
[0000087e](01) 55 push ebp
[0000087f](02) 8bec mov ebp,esp
[00000881](01) 51 push ecx
[00000882](05) 684e080000 push 0000084e
[00000887](05) 684e080000 push 0000084e
[0000088c](05) e8ddfdffff call 0000066e ;CALL Halts(H_Hat, H_Hat)
[0000084e](01) 55 push ebp
[0000084f](02) 8bec mov ebp,esp
[00000851](01) 51 push ecx
[00000852](03) 8b4508 mov eax,[ebp+08]
[00000855](01) 50 push eax
[00000856](03) 8b4d08 mov ecx,[ebp+08]
[00000859](01) 51 push ecx
[0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat, H_Hat)
[0000084e](01) 55 push ebp
[0000084f](02) 8bec mov ebp,esp
[00000851](01) 51 push ecx
[00000852](03) 8b4508 mov eax,[ebp+08]
[00000855](01) 50 push eax
[00000856](03) 8b4d08 mov ecx,[ebp+08]
[00000859](01) 51 push ecx
[0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat, H_Hat)
Infinite Recursion detection AXIOM (self-evident truth)
(a) Within an execution trace
(b) The same function is called
(c) From the same machine address
(d) With the same data // Richard Damon credit
(e) A second time
(f) Without any control flow instructions inbetween
The above execution trace meets the criteria of the Infinite Recursion
detection AXIOM, thus providing the basis for Halts() to stop simulating
H_Hat() and decide not-halting.
297 more pages of execution trace is not going to make this easier to
understand. Since the key thing that the halt decider does to decide
halting on H_Hat is implement the above Infinite Recursion detection
AXIOM seeing the source code is not going to provide any new insights.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 09:08 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <Ct2dnYRG_YQZw539nZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #2563 |
On 1/14/2021 6:26 AM, Richard Damon wrote:
> On 1/13/21 11:34 PM, olcott wrote:
>> On 1/13/2021 10:03 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 6:05 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 8:47 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/12/2021 8:30 PM, Richard Damon wrote:
>>>>>>>>> On 1/12/21 7:10 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>> The same halt decider can have different behavior on the same
>>>>>>>>>> input:
>>>>>>>>>> Turing Machine description when halt deciding mode {enabled,
>>>>>>>>>> disabled}
>>>>>>>>>> is an additional input.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> But the H in the halting problem doesn't have this extra input,
>>>>>>>>> so for
>>>>>>>>> Linz and such it can't really be there, for that purpose you
>>>>>>>>> need to
>>>>>>>>> wrap your decider with that extra input with a wrapper that
>>>>>>>>> always sets
>>>>>>>>> it the same way.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Since Linz defines the halt deciding states with the ⊢* [do any damn
>>>>>>>> thing you] want operator we are free to [do any damn thing we want].
>>>>>>
>>>>>> In Linz terms it specifies an arbitrary set of moves from one
>>>>>> configuration to another, thus the specified algorithm is simply [do
>>>>>> any damn thing you want] (as long as you end up at YES or NO).
>>>>>
>>>>> Still wrong.
>>>
>>>> Any configuration is completely determined by the current state of the
>>>> control unit, the contents of the tape, and the position of the
>>>> read-write head (Linz 1990:236)
>>>>
>>>> The symbols ⊢* and ⊢+ have the usual meaning of an arbitrary number of
>>>> moves (Linz 1990:237)
>>>>
>>>> Therefore H begins at a start state (q0) and ends up at one of two
>>>> final states (qy) or (qn) and can [do any damn thing inbetween] as
>>>> long as it ends up deciding halting on its input.
>>>
>>> It can not, however, do this:
>>>
>>> | The same halt decider can have different behavior on the same input:
>>> | Turing Machine description when halt deciding mode {enabled, disabled}
>>> | is an additional input.
>>>
>>
>> The Linz H would simply be Halts() in global mode.
>>
>>>> Neither the TM H of Linz nor the Halts() shown below is required to
>>>> ever return any value to H_Hat().
>>>
>>> What you say about H is nonsense. Literal nonsense.
>>>
>>> What you say about is Halts is irrefutable since you don't show it. And
>>
>> Do you understand that disagreeing with a statement that is true by
>> logic necessity is necessarily incorrect?
>>
>> The following shows that Halts() has all the criteria required to
>> correctly decide not halting on H_Hat() by logical necessity.
>>
>> 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);
>> }
>>
>> Output_Debug_Trace() [0001112e] size(124) capacity(65536)
>> [0000087e](01) 55 push ebp
>> [0000087f](02) 8bec mov ebp,esp
>> [00000881](01) 51 push ecx
>> [00000882](05) 684e080000 push 0000084e
>> [00000887](05) 684e080000 push 0000084e
>> [0000088c](05) e8ddfdffff call 0000066e ;CALL Halts(H_Hat,
>> H_Hat)
>> [0000084e](01) 55 push ebp
>> [0000084f](02) 8bec mov ebp,esp
>> [00000851](01) 51 push ecx
>> [00000852](03) 8b4508 mov eax,[ebp+08]
>> [00000855](01) 50 push eax
>> [00000856](03) 8b4d08 mov ecx,[ebp+08]
>> [00000859](01) 51 push ecx
>> [0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat,
>> H_Hat)
>> [0000084e](01) 55 push ebp
>> [0000084f](02) 8bec mov ebp,esp
>> [00000851](01) 51 push ecx
>> [00000852](03) 8b4508 mov eax,[ebp+08]
>> [00000855](01) 50 push eax
>> [00000856](03) 8b4d08 mov ecx,[ebp+08]
>> [00000859](01) 51 push ecx
>> [0000085a](05) e80ffeffff call 0000066e ;CALL Halts(H_Hat,
>> H_Hat)
>>
>> Infinite Recursion detection AXIOM (self-evident truth)
>> (a) Within an execution trace
>> (b) The same function is called
>> (c) From the same machine address
>> (d) With the same data // Richard Damon credit
>> (e) A second time
>> (f) Without any control flow instructions inbetween
>>
>> The above execution trace meets the criteria of the Infinite Recursion
>> detection AXIOM, thus providing the basis for Halts() to stop simulating
>> H_Hat() and decide not-halting.
>>
>> 297 more pages of execution trace is not going to make this easier to
>> understand. Since the key thing that the halt decider does to decide
>> halting on H_Hat is implement the above Infinite Recursion detection
>> AXIOM seeing the source code is not going to provide any new insights.
>>
>
> Except that (f) is not shown to be satisfied as some of the trace has
> been omitted (the code starting at 0000066E and ending up at 0000084E.
>
> (f) does NOT say only 'user' code, and is FALSE if modified to say that.
>
> Your AXIOM is also not true in the general case, it presumes that
> machine has no interrupts or traps that are able to affect the execution
> of the program, and you 'global' decider system seems to have a trap
> mechanism to let Halts know that it has detected 'infinite recursion',
> that or Halts needs to have a direct conditional in it.
>
> Since your proof is based on a false statement, it is unsound.
>
The mistake that you continue to make over and over and over is that you
keep presuming that the question is: Does the input halt on its input?
I have corrected you on this at least a dozen times and every time you
short circuit to the same mistake.
When we ask the question: Would the input program on its input be
infinitely recursive if this infinite recursion was not stopped?
the code that stops the otherwise infinite recursion is not part of the
code that is under test because this code is never reached (thus not in
the execution trace) until after the the decision on the program under
test has already been made.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 09:32 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <2M2dnQ7QD8No_p39nZ2dnUU7-UnNnZ2d@giganews.com> |
| In reply to | #2564 |
On 1/14/2021 9:21 AM, Richard Damon wrote: > On 1/14/21 10:08 AM, olcott wrote: > >> >> The mistake that you continue to make over and over and over is that you >> keep presuming that the question is: Does the input halt on its input? > > And what YOU seem to keep on making the error on is to assume that you > can change the question and still be working on the same problem. > On 1/10/2021 9:09 AM, Ben Bacarisse wrote: > Yes, except that the question "Does the simulation of the > input have to be stopped to prevent its otherwise infinite > execution" is, itself, the classical halting problem. Although the above question divides inputs into halting and not halting when the original question: Does the input halt on its input? is applied to a halt decider based on the above question it conflates halting inputs with not-halting inputs and calls them both halting. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-01-14 10:48 -0600 |
| Subject | Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](logical necessity) |
| Message-ID | <eP2dnVzJY7p76J39nZ2dnUU7-THNnZ2d@giganews.com> |
| In reply to | #2567 |
On 1/14/2021 10:00 AM, Richard Damon wrote: > On 1/14/21 10:32 AM, olcott wrote: >> On 1/14/2021 9:21 AM, Richard Damon wrote: >>> On 1/14/21 10:08 AM, olcott wrote: >>> >>>> >>>> The mistake that you continue to make over and over and over is that you >>>> keep presuming that the question is: Does the input halt on its input? >>> >>> And what YOU seem to keep on making the error on is to assume that you >>> can change the question and still be working on the same problem. >>> >> >> On 1/10/2021 9:09 AM, Ben Bacarisse wrote: >>> Yes, except that the question "Does the simulation of the >>> input have to be stopped to prevent its otherwise infinite >>> execution" is, itself, the classical halting problem. >> >> Although the above question divides inputs into halting and not halting >> when the original question: >> Does the input halt on its input? >> >> is applied to a halt decider based on the above question it conflates >> halting inputs with not-halting inputs and calls them both halting. >> > > And you still don't understand and cherry pick comments out of context, > showing yourself to be the cheat that you are. > > Ben was commenting that making the decision to REALLY be that otherwise > infinite recursion will occur, you need to solve that actual halting > problem, No he certainly did not mean that. 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. All that I have to do to refute all of the conventional halting problem undecidability proofs is to refute their common basis: Once D has determined this information, it does the opposite. (Sipser 1997:165) // D is Sipser's Ĥ Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: PWS Publishing Company (165-167) http://www.liarparadox.org/sipser_165.pdf -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
Back to top | Article view | comp.software-eng
csiph-web