Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.software-eng > #2472 > unrolled thread

Re: Halting Problem Final Conclusion [2021 update to my 2004 statement]

Started byolcott <NoOne@NoWhere.com>
First post2021-01-05 12:26 -0600
Last post2021-01-05 22:43 +0000
Articles 13 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.


Contents

  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 6 of 6 — ← Prev page 1 2 3 4 5 [6]


#2559 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-13 18:57 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<MvOdneB0KdKICmLCnZ2dnUU7-N_NnZ2d@giganews.com>
In reply to#2548
On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>> <cut>
>>>>>>> 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.
>>>>>
>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>> code that can make this determination in the general case.
>>>>
>>>> If we hypothetically assume that the conventional halting problem
>>>> undecidability proofs have been refuted that would seem to make the
>>>> halting problem an open question again.
>>>
>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>> you not get this after all this time?
>>
>> Theorem X is proven on the basis of Y.
>> Y is proven to be bogus.
>> Thus the proof of Theorem X loses its basis.
> 
> Not in dispute.  If you don't understand what I'm saying, you could ask
> me rather than just say things that are not at issue.

As long as we are on the same page wit the above then I don't understand 
what you could mean. What do you mean?

>>>>> Sometimes
>>>>> you imply that you do, and sometimes you imply that you don't.  We'll
>>>>> never have a definitive claim because flip-flopping (and never posting
>>>>> code that would settle the matter), is how you keep the chat going.
>>>>
>>>> I do not have any definitive claim on any open question.
>>>
>>> There is no open question here.  But I agree you have no definitive
>>> claim.  You love to equivocate and flip-flop between claims.  The way
>>> you walked back the claim from two years ago that you had "actual Turing
>>> machines" what an textbook example of the art.
>>
>> Turing machines or Turing equivalent machines, no consequential
>> difference. I had never heard of Turing machine equivalece in 2018,
>> yet understood the concept.
> 
> I dare you: post what you had in Dec 2018.  Then we can see what you
> meant when you said you had a pair of actual Turing machines, fully
> encoded, exactly and precisely as in Linz.
> 

As I have said many many times I had the complete algorithm showing the 
details of how H() correctly decides not halting for H_Hat() on the 
basis of the infinite recursion of H_Hat() written in almost complete C.

If I said that I wrote a paper on how to cure a kind of cancer and I 
actually only scribbled short hand notes on how to cure this cancer and 
the cure worked, then my original statement is sufficiently accurate. 
The fact that the cure worked would carry enormous weight on the 
assessment of the accuracy of the original statement.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2560 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-13 21:21 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Boolean?)
Message-ID<-rWdndzZVY5VJWLCnZ2dnUU7-UfNnZ2d@giganews.com>
In reply to#2559
On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>> <cut>
>>>>>>>>> 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.
>>>>>>>
>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>> code that can make this determination in the general case.
>>>>>>
>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>> halting problem an open question again.
>>>>>
>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>> you not get this after all this time?
>>>>
>>>> Theorem X is proven on the basis of Y.
>>>> Y is proven to be bogus.
>>>> Thus the proof of Theorem X loses its basis.
>>>
>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>> me rather than just say things that are not at issue.
>>
>> As long as we are on the same page wit the above then I don't
>> understand what you could mean. What do you mean?
> 
> If a theorem has a dozen published proofs, it does not matter if six of
> them are found to be bogus.  The halting theorem has been proved in many
> different ways.  You have never bothered to look at any of them.  Heck,
> you have not even read Linz's "proper" proof.

You already acknowledged that all the proofs have the same essential 
basis, thus refuting this basis would refute the Theorem.

>>>>>>> Sometimes
>>>>>>> you imply that you do, and sometimes you imply that you don't.  We'll
>>>>>>> never have a definitive claim because flip-flopping (and never posting
>>>>>>> code that would settle the matter), is how you keep the chat going.
>>>>>>
>>>>>> I do not have any definitive claim on any open question.
>>>>>
>>>>> There is no open question here.  But I agree you have no definitive
>>>>> claim.  You love to equivocate and flip-flop between claims.  The way
>>>>> you walked back the claim from two years ago that you had "actual Turing
>>>>> machines" what an textbook example of the art.
>>>>
>>>> Turing machines or Turing equivalent machines, no consequential
>>>> difference. I had never heard of Turing machine equivalece in 2018,
>>>> yet understood the concept.
>>>
>>> I dare you: post what you had in Dec 2018.  Then we can see what you
>>> meant when you said you had a pair of actual Turing machines, fully
>>> encoded, exactly and precisely as in Linz.
>>
>> As I have said many many times I had the complete algorithm showing
>> the details of how H() correctly decides not halting for H_Hat() on
>> the basis of the infinite recursion of H_Hat() written in almost
>> complete C.
> 
> I thought so.  You won't post it no matter how many times I ask.  But
> that's fine -- your repeated refusal to post it makes the point as
> clearly as posting it would.
> 
It was hand written on a piece of paper.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2562 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-13 22:15 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<1dOdnVYAmYjKWGLCnZ2dnUU7-YPNnZ2d@giganews.com>
In reply to#2560
On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>> <cut>
>>>>>>>>>>> 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.
>>>>>>>>>
>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>
>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>> halting problem an open question again.
>>>>>>>
>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>> you not get this after all this time?
>>>>>>
>>>>>> Theorem X is proven on the basis of Y.
>>>>>> Y is proven to be bogus.
>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>
>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>> me rather than just say things that are not at issue.
>>>>
>>>> As long as we are on the same page wit the above then I don't
>>>> understand what you could mean. What do you mean?
>>>
>>> If a theorem has a dozen published proofs, it does not matter if six of
>>> them are found to be bogus.  The halting theorem has been proved in many
>>> different ways.  You have never bothered to look at any of them.  Heck,
>>> you have not even read Linz's "proper" proof.
>>
>> You already acknowledged that all the proofs have the same essential
>> basis, thus refuting this basis would refute the Theorem.
> 
> In fact I have stated the contrary.  You still haven't read Linz's actual
> proof (rather than the one he sketches for historical reasons), have
> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
> about Chaitin?  Martin?

https://catonmat.net/busy-beaver

The busy beaver is not analogous to:
(a) The Liar Paradox
(b) Gödel's 1931 Incompleteness Theorem
(c) The Tarski Undefinability Theorem

Thus busy beaver is not relevant to my research on the mathematical 
foundation of truth. Refuting the conventional:

"Do the opposite of whatever the halt decider decides"
    Once D has determined this information, it does the opposite.
    (Sipser 1997:165)
can be leveraged to apply to {a,b,c} above.

> Please also note that anything you do with your pile of x86 code will
> not apply to the standard proofs unless you can show that the H/H_Hat
> relationship has been maintained and you have admitted that you are not
> doing that with the latest ruse.

The only thing that this function does not implement from Linz is 
copying its input and Sipser does it my way:

    Now we construct a new Turing machine D with H as a subroutine.
    (Sipser 1997:165)

void H_Hat(u32 P)
{
   u32 Input_Halts = Halts(P, P);
   if (Input_Halts)
     HERE: goto HERE;
   return;
}

Thus the above function has the key common elements of Linz and Sipser.

http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: 
PWS Publishing Company (165-167)



-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2565 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-14 09:18 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<iYSdnb3CvstB_Z39nZ2dnUU7-YGdnZ2d@giganews.com>
In reply to#2562
On 1/14/2021 7:37 AM, Richard Damon wrote:
> On 1/13/21 11:15 PM, olcott wrote:
>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>
>>> Please also note that anything you do with your pile of x86 code will
>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>> relationship has been maintained and you have admitted that you are not
>>> doing that with the latest ruse.
>>
>> The only thing that this function does not implement from Linz is
>> copying its input and Sipser does it my way:
> 
> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
> is the ONLY way to pass an input to a Turing Machine) the request to
> decide on P given input P, which requires that P be on the input tape
> twice, thus it needs to do the duplication. Sipser is just not explicit
> about doing that, but it IS still fundamentally required to implement it.
>>
>>     Now we construct a new Turing machine D with H as a subroutine.
>>     (Sipser 1997:165)
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> Thus the above function has the key common elements of Linz and Sipser.
>>
>> http://www.liarparadox.org/sipser_165.pdf
>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>> PWS Publishing Company (165-167)
>>
> 
> Note, that by reusing the representation in the manner you have, you
> have broken your Computational Equivalenc between your code and the
> Turing Machines described in the proofs, because you have provided your
> x86 code with information that the Turing Machines did not have, namely
> that the input IS a copy of the machine that is running.
> 

I could easily provide a copy and end up with the same results. The 
problem is that Linz specifies infinitely recursive copies. This process 
can be decided as not halting too, but the proof is more difficult to 
understand. By passing the machine address (or tape location) instead of 
making a copy we get the same

"Do the opposite of whatever the halt decider decides"
    Once D has determined this information, it does the opposite.
    (Sipser 1997:165)
basis used in all the proofs specified in the simplest possible way.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2568 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-14 10:41 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<psydnbSpWMi36Z39nZ2dnUU7-VXNnZ2d@giganews.com>
In reply to#2565
On 1/14/2021 9:47 AM, Richard Damon wrote:
> On 1/14/21 10:18 AM, olcott wrote:
>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>> On 1/13/21 11:15 PM, olcott wrote:
>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>
>>>>> Please also note that anything you do with your pile of x86 code will
>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>> relationship has been maintained and you have admitted that you are not
>>>>> doing that with the latest ruse.
>>>>
>>>> The only thing that this function does not implement from Linz is
>>>> copying its input and Sipser does it my way:
>>>
>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>> decide on P given input P, which requires that P be on the input tape
>>> twice, thus it needs to do the duplication. Sipser is just not explicit
>>> about doing that, but it IS still fundamentally required to implement it.
>>>>
>>>>      Now we construct a new Turing machine D with H as a subroutine.
>>>>      (Sipser 1997:165)
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>     u32 Input_Halts = Halts(P, P);
>>>>     if (Input_Halts)
>>>>       HERE: goto HERE;
>>>>     return;
>>>> }
>>>>
>>>> Thus the above function has the key common elements of Linz and Sipser.
>>>>
>>>> http://www.liarparadox.org/sipser_165.pdf
>>>> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
>>>> PWS Publishing Company (165-167)
>>>>
>>>
>>> Note, that by reusing the representation in the manner you have, you
>>> have broken your Computational Equivalenc between your code and the
>>> Turing Machines described in the proofs, because you have provided your
>>> x86 code with information that the Turing Machines did not have, namely
>>> that the input IS a copy of the machine that is running.
>>>
>>
>> I could easily provide a copy and end up with the same results. The
>> problem is that Linz specifies infinitely recursive copies. This process
>> can be decided as not halting too, but the proof is more difficult to
>> understand. By passing the machine address (or tape location) instead of
>> making a copy we get the same
>>
>> "Do the opposite of whatever the halt decider decides"
>>     Once D has determined this information, it does the opposite.
>>     (Sipser 1997:165)
>> basis used in all the proofs specified in the simplest possible way.
>>
> 
> Linz does NOT specify infinitely recursive copies, as Linz does NOT
> actually specify recursion at all. Linz (and SIPSER) only have
> self-reference. It is only YOUR decision to try to solve by simulation
> that gets you into something like recursion.

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.

When the [any damn thing inbetween] H(q0) and H((qy)) or H((qn)) is H 
simulating its input then the definition of Linz H logically entails 
copying its input in infinite recursion.

Infinitely Recursive input on HP Proofs
https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/dhNDYvhFAAAJ

We are free to choose [any damn thing inbetween] H(q0) and H((qy)) or 
H((qn)) as long as it correctly decides the resulting Ĥ(Ĥ).

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2577 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-14 12:16 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<NNWdnVoF7ZILF539nZ2dnUU7-YnNnZ2d@giganews.com>
In reply to#2568
On 1/14/2021 11:55 AM, Richard Damon wrote:
> On 1/14/21 11:41 AM, olcott wrote:
>> On 1/14/2021 9:47 AM, Richard Damon wrote:
>>> On 1/14/21 10:18 AM, olcott wrote:
>>>> On 1/14/2021 7:37 AM, Richard Damon wrote:
>>>>> On 1/13/21 11:15 PM, olcott wrote:
>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>
>>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>>> relationship has been maintained and you have admitted that you
>>>>>>> are not
>>>>>>> doing that with the latest ruse.
>>>>>>
>>>>>> The only thing that this function does not implement from Linz is
>>>>>> copying its input and Sipser does it my way:
>>>>>
>>>>> FALSE, SIPSER passes to H the values as its input ON THE TAPE (as that
>>>>> is the ONLY way to pass an input to a Turing Machine) the request to
>>>>> decide on P given input P, which requires that P be on the input tape
>>>>> twice, thus it needs to do the duplication. Sipser is just not explicit
>>>>> about doing that, but it IS still fundamentally required to
>>>>> implement it.
>>>>>>
>>>>>>       Now we construct a new Turing machine D with H as a subroutine.
>>>>>>       (Sipser 1997:165)
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>>      u32 Input_Halts = Halts(P, P);
>>>>>>      if (Input_Halts)
>>>>>>        HERE: goto HERE;
>>>>>>      return;
>>>>>> }
>>>>>>
>>>>>> Thus the above function has the key common elements of Linz and
>>>>>> Sipser.
>>>>>>
>>>>>> http://www.liarparadox.org/sipser_165.pdf
>>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>>> Boston:
>>>>>> PWS Publishing Company (165-167)
>>>>>>
>>>>>
>>>>> Note, that by reusing the representation in the manner you have, you
>>>>> have broken your Computational Equivalenc between your code and the
>>>>> Turing Machines described in the proofs, because you have provided your
>>>>> x86 code with information that the Turing Machines did not have, namely
>>>>> that the input IS a copy of the machine that is running.
>>>>>
>>>>
>>>> I could easily provide a copy and end up with the same results. The
>>>> problem is that Linz specifies infinitely recursive copies. This process
>>>> can be decided as not halting too, but the proof is more difficult to
>>>> understand. By passing the machine address (or tape location) instead of
>>>> making a copy we get the same
>>>>
>>>> "Do the opposite of whatever the halt decider decides"
>>>>      Once D has determined this information, it does the opposite.
>>>>      (Sipser 1997:165)
>>>> basis used in all the proofs specified in the simplest possible way.
>>>>
>>>
>>> Linz does NOT specify infinitely recursive copies, as Linz does NOT
>>> actually specify recursion at all. Linz (and SIPSER) only have
>>> self-reference. It is only YOUR decision to try to solve by simulation
>>> that gets you into something like recursion.
>>
>> 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 do anything that the machine is able to do. 


As long as it moves from (q0) to the ((qy)) or ((qn)) that corresponds 
to the halting status of its input it <is> a correct halt decider for 
this input no matter what it does inbetween.

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);
}


This means that Halts() <is> a correct halt decider for the above input 
as long as it returns the correct value to main() even if this is the 
only place that it returns a value.



-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2580 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 14:50 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<kPmdnXQ2e8cuzJ79nZ2dnUU7-I3NnZ2d@giganews.com>
In reply to#2562
On 1/14/2021 9:25 PM, Richard Damon wrote:
> On 1/14/21 9:45 PM, Ben Bacarisse wrote:
>> Kaz Kylheku <563-365-8930@kylheku.com> writes:
>>
>>> On 2021-01-15, Ben Bacarisse <ben.usenet@bsb.me.uk> wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>>>> 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.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>>>
>>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>>>
>>>>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>>>>> you not get this after all this time?
>>>>>>>>>>>
>>>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>>>> Y is proven to be bogus.
>>>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>>>
>>>>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>>>
>>>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>>>> understand what you could mean. What do you mean?
>>>>>>>>
>>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>>>>> you have not even read Linz's "proper" proof.
>>>>>>>
>>>>>>> You already acknowledged that all the proofs have the same essential
>>>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>>>
>>>>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>>>>> proof (rather than the one he sketches for historical reasons), have
>>>>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>>>>> about Chaitin?  Martin?
>>>>>
>>>>> https://catonmat.net/busy-beaver
>>>>>
>>>>> The busy beaver is not analogous to:
>>>>> (a) The Liar Paradox
>>>>> (b) Gödel's 1931 Incompleteness Theorem
>>>>> (c) The Tarski Undefinability Theorem
>>>>>
>>>>> Thus busy beaver is not relevant to my research on the mathematical
>>>>> foundation of truth.
>>>>
>>>> Any time you feel up to actually leaning something, ask the group (or
>>>> me) why the BB theorem is directly relevant to you current "work".
>>>>
>>>>> Refuting the conventional:
>>>>>
>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>     Once D has determined this information, it does the opposite.
>>>>>     (Sipser 1997:165)
>>>>> can be leveraged to apply to {a,b,c} above.
>>>>>
>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>> relationship has been maintained and you have admitted that you are not
>>>>>> doing that with the latest ruse.
>>>>>
>>>>> The only thing that this function does not implement from Linz is
>>>>> copying its input and Sipser does it my way:
>>>>
>>>> You are wrong about Sipser.  If you did is Siper's way you could pull
>>>> the trick you trying to get past us.
>>>>
>>>>>     Now we construct a new Turing machine D with H as a subroutine.
>>>>>     (Sipser 1997:165)
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>>    u32 Input_Halts = Halts(P, P);
>>>>>    if (Input_Halts)
>>>>>      HERE: goto HERE;
>>>>>    return;
>>>>> }
>>>>>
>>>>> Thus the above function has the key common elements of Linz and
>>>>> Sipser.
>>>>
>>>> The problem function is your Halts with its "modes".  The H/H_Hat
>>>> relationship is about one input-determined computation called H and
>>>> another, derived from it, called H_Hat.  You have (at least) two
>>>> computations hidden behind the name Halts.
>>>>
>>>> You swore bind you were not doing anything as obviously wrong as this
>>>> but here we are...
>>>
>>> The mode is is fixed at compile-time though.
>>
>> I don't think that makes any difference.  Different code is different
>> code!
>>
>>> The wrong thing is basically insisting that when the program is
>>> compiled with the #define set to one mode, its result speaks about
>>> not about the behavior of H_Hat in that same program, but H_Hat
>>> in a differnt program that is compiled with the #define in another
>>> mode.
>>
>> Right.  I think he's also made the same claim about a run-time switch
>> but it's all the same trick.
>>
>>> Olcott understands this very well; he knows that it breaks the
>>> self-reference, which is by design: he wants to break that because
>>> it is "pathological".
>>
>> Yes, he has been very clear, provided one is prepared to pick through
>> all the misused terms and garbled sentences.
>>
>> The mystery (for me) is that now he's been forced into making this
>> clear, why is he making such heavy weather of it?  I can write a Halts
>> function with a switch (compile- or run-time) that makes Halts(H_Hat,
>> H_Hat) correct in only a couple of lines.
>>
>> He is either very confused about what he is really doing, or he is
>> being deliberately obtuse.  Very, very obtuse.
>>
>>> He knows that if we ask the right question (does the program compiled
>>> with the given mode #define calculate the halting of that program's own
>>> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>>>
>>> His whole "research program" revolves around insisting that this
>>> question is wrong.
>>
>> If it were that simple he would not spend so much time trying to say
>> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
>> insistent that his code "refutes" the conventional historical proof.
>>
>> He really, really does think that there are no undecidable sets (well,
>> he would if he knew what they were).
>>
>> That's why he won't consider any other undecidable sets.
>> Many of them have nothing that PO could object to as "pathological".
>>
>>> What time is it? Yes or no? Yes: time to stop responding, maybe?
>>
>> Oh, it was that time 10 years ago, but he knows all the right tricks.
>> He'll insult you or, worse, praise you.  It's hard to leave "Kaz
>> understand that I'm, right" on the record forever.  I don't think it's
>> worth trying to explain anything to him.  When I reply, I try to have an
>> imaginary student in mind whose only interest is to have what PO is up
>> to pointed out.
>>
>> All he really wants is to be validated by having knowledgeable people
>> talk to him, so not replying would be severe punishment indeed.  He'd
>> escalate though.  The posts would be copied to more groups in the hope
>> of hooking in new responders and the claims would get more explicitly
>> wrong.  The desire to get engagement trumps all moral considerations.
>> Just consider how successful the big lie of Dec 2018 turned out to be!
>>
> 
> He needs Halts to change at compile time so the requests to prove the
> need in need to abort can't be properly proved. His answer to removing
> the halt decision is to recompile with the switch so it is removed
> EVERYWHERE and thus we do get the claimed infinite recursion because of
> course we have broken the halt decider.
> 


Halts() always simulates it input. When the halt decider is changed so 
that it only reports halting after its input has halted and never aborts 
the execution of any input then the resulting execution trace makes it 
as obvious as a [Boston cream pie in the face] that the following code 
<is> infinitely recursive:

// Halts() always simulates it input
void H_Hat(u32 P)
{
   u32 Input_Halts = Halts(P, P);
   if (Input_Halts)
     HERE: goto HERE;
   return;
}

int main()
{
   H_Hat((u32)H_Hat);
}

Weasel wording may convince gullible fools that this is not the case, 
but then what would one expect from gullible fools?

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2583 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 16:04 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<556dnV9LnbFs_579nZ2dnUU7-c3NnZ2d@giganews.com>
In reply to#2580
On 1/16/2021 3:24 PM, Malcolm McLean wrote:
> On Saturday, 16 January 2021 at 20:51:07 UTC, olcott wrote:
>> On 1/14/2021 9:25 PM, Richard Damon wrote:
>>> On 1/14/21 9:45 PM, Ben Bacarisse wrote:
>>>> Kaz Kylheku <563-36...@kylheku.com> writes:
>>>>
>>>>> On 2021-01-15, Ben Bacarisse <ben.u...@bsb.me.uk> wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>
>>>>>>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>>>>>>> <cut>
>>>>>>>>>>>>>>>>>> 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.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>>>>>>> halting problem an open question again.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> No. Invalidating a proof does not invalidate the theorem. How could
>>>>>>>>>>>>>> you not get this after all this time?
>>>>>>>>>>>>>
>>>>>>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>>>>>>> Y is proven to be bogus.
>>>>>>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>>>>>>
>>>>>>>>>>>> Not in dispute. If you don't understand what I'm saying, you could ask
>>>>>>>>>>>> me rather than just say things that are not at issue.
>>>>>>>>>>>
>>>>>>>>>>> As long as we are on the same page wit the above then I don't
>>>>>>>>>>> understand what you could mean. What do you mean?
>>>>>>>>>>
>>>>>>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>>>>>>> them are found to be bogus. The halting theorem has been proved in many
>>>>>>>>>> different ways. You have never bothered to look at any of them. Heck,
>>>>>>>>>> you have not even read Linz's "proper" proof.
>>>>>>>>>
>>>>>>>>> You already acknowledged that all the proofs have the same essential
>>>>>>>>> basis, thus refuting this basis would refute the Theorem.
>>>>>>>>
>>>>>>>> In fact I have stated the contrary. You still haven't read Linz's actual
>>>>>>>> proof (rather than the one he sketches for historical reasons), have
>>>>>>>> you? Have you looked at Rado's proof of the busy beaver theorem? What
>>>>>>>> about Chaitin? Martin?
>>>>>>>
>>>>>>> https://catonmat.net/busy-beaver
>>>>>>>
>>>>>>> The busy beaver is not analogous to:
>>>>>>> (a) The Liar Paradox
>>>>>>> (b) Gödel's 1931 Incompleteness Theorem
>>>>>>> (c) The Tarski Undefinability Theorem
>>>>>>>
>>>>>>> Thus busy beaver is not relevant to my research on the mathematical
>>>>>>> foundation of truth.
>>>>>>
>>>>>> Any time you feel up to actually leaning something, ask the group (or
>>>>>> me) why the BB theorem is directly relevant to you current "work".
>>>>>>
>>>>>>> Refuting the conventional:
>>>>>>>
>>>>>>> "Do the opposite of whatever the halt decider decides"
>>>>>>> Once D has determined this information, it does the opposite.
>>>>>>> (Sipser 1997:165)
>>>>>>> can be leveraged to apply to {a,b,c} above.
>>>>>>>
>>>>>>>> Please also note that anything you do with your pile of x86 code will
>>>>>>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>>>>>>> relationship has been maintained and you have admitted that you are not
>>>>>>>> doing that with the latest ruse.
>>>>>>>
>>>>>>> The only thing that this function does not implement from Linz is
>>>>>>> copying its input and Sipser does it my way:
>>>>>>
>>>>>> You are wrong about Sipser. If you did is Siper's way you could pull
>>>>>> the trick you trying to get past us.
>>>>>>
>>>>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>>>>> (Sipser 1997:165)
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> return;
>>>>>>> }
>>>>>>>
>>>>>>> Thus the above function has the key common elements of Linz and
>>>>>>> Sipser.
>>>>>>
>>>>>> The problem function is your Halts with its "modes". The H/H_Hat
>>>>>> relationship is about one input-determined computation called H and
>>>>>> another, derived from it, called H_Hat. You have (at least) two
>>>>>> computations hidden behind the name Halts.
>>>>>>
>>>>>> You swore bind you were not doing anything as obviously wrong as this
>>>>>> but here we are...
>>>>>
>>>>> The mode is is fixed at compile-time though.
>>>>
>>>> I don't think that makes any difference. Different code is different
>>>> code!
>>>>
>>>>> The wrong thing is basically insisting that when the program is
>>>>> compiled with the #define set to one mode, its result speaks about
>>>>> not about the behavior of H_Hat in that same program, but H_Hat
>>>>> in a differnt program that is compiled with the #define in another
>>>>> mode.
>>>>
>>>> Right. I think he's also made the same claim about a run-time switch
>>>> but it's all the same trick.
>>>>
>>>>> Olcott understands this very well; he knows that it breaks the
>>>>> self-reference, which is by design: he wants to break that because
>>>>> it is "pathological".
>>>>
>>>> Yes, he has been very clear, provided one is prepared to pick through
>>>> all the misused terms and garbled sentences.
>>>>
>>>> The mystery (for me) is that now he's been forced into making this
>>>> clear, why is he making such heavy weather of it? I can write a Halts
>>>> function with a switch (compile- or run-time) that makes Halts(H_Hat,
>>>> H_Hat) correct in only a couple of lines.
>>>>
>>>> He is either very confused about what he is really doing, or he is
>>>> being deliberately obtuse. Very, very obtuse.
>>>>
>>>>> He knows that if we ask the right question (does the program compiled
>>>>> with the given mode #define calculate the halting of that program's own
>>>>> H_Hat(H_Hat)?) that the answer it is calculating is wrong.
>>>>>
>>>>> His whole "research program" revolves around insisting that this
>>>>> question is wrong.
>>>>
>>>> If it were that simple he would not spend so much time trying to say
>>>> that his Halts/H_Hat are just link Linz's H/H^, nor would he be so
>>>> insistent that his code "refutes" the conventional historical proof.
>>>>
>>>> He really, really does think that there are no undecidable sets (well,
>>>> he would if he knew what they were).
>>>>
>>>> That's why he won't consider any other undecidable sets.
>>>> Many of them have nothing that PO could object to as "pathological".
>>>>
>>>>> What time is it? Yes or no? Yes: time to stop responding, maybe?
>>>>
>>>> Oh, it was that time 10 years ago, but he knows all the right tricks.
>>>> He'll insult you or, worse, praise you. It's hard to leave "Kaz
>>>> understand that I'm, right" on the record forever. I don't think it's
>>>> worth trying to explain anything to him. When I reply, I try to have an
>>>> imaginary student in mind whose only interest is to have what PO is up
>>>> to pointed out.
>>>>
>>>> All he really wants is to be validated by having knowledgeable people
>>>> talk to him, so not replying would be severe punishment indeed. He'd
>>>> escalate though. The posts would be copied to more groups in the hope
>>>> of hooking in new responders and the claims would get more explicitly
>>>> wrong. The desire to get engagement trumps all moral considerations.
>>>> Just consider how successful the big lie of Dec 2018 turned out to be!
>>>>
>>>
>>> He needs Halts to change at compile time so the requests to prove the
>>> need in need to abort can't be properly proved. His answer to removing
>>> the halt decision is to recompile with the switch so it is removed
>>> EVERYWHERE and thus we do get the claimed infinite recursion because of
>>> course we have broken the halt decider.
>>>
>> Halts() always simulates it input. When the halt decider is changed so
>> that it only reports halting after its input has halted and never aborts
>> the execution of any input then the resulting execution trace makes it
>> as obvious as a [Boston cream pie in the face] that the following code
>> <is> infinitely recursive:
>>
>> // Halts() always simulates it input
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> return;
>> }
>> int main()
>> {
>> H_Hat((u32)H_Hat);
>> }
>>
>> Weasel wording may convince gullible fools that this is not the case,
>> but then what would one expect from gullible fools?
>>
> But you've conflated the representation of the machine with
> the machine itself. In Linz's H_Hat, a copy of P is made on each call.

In Siper a copy of the machine <is not> made with each call, the halt 
decider is a called subroutine the same way that I do it.

    Now we construct a new Turing machine D with H as a
    subroutine. (Sipser 1997:165)

thus the Linz example can be merged with the Sipser example to make the 
simplest example that encompasses the key:

"do the opposite of whatever the halt decifer decides"

    Once D has determined this information, it does the
    opposite. (Sipser 1997:165)

http://www.liarparadox.org/sipser_165.pdf
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: 
PWS Publishing Company (165-167)

> So each layer of emulation has physically distinct data to work on,
> and you can't detect recursion by looking for calls to the same address.
> 
> In fact I'm not sure it's even called "recursion" any more.
> 
> However ultimately it doesn't matter. That's not the root reason you don't
> have an H that meet's Linz's specifications. The idea seems to be that
> Halts doesn't return at all in one mode, and returns "non-halting" in another.
> But H has no way of switching modes.

Are you smart enough to understand that when a function is called in 
infinite recursion that it does not return a value to its caller?

Can you also understand that when the same case as above has the 
function call aborted that this function still does not return a value 
to its caller?


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2584 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-17 04:46 +0000
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](gullible fools)
Message-ID<20210116204126.944@kylheku.com>
In reply to#2580
On 2021-01-16, olcott <NoOne@NoWhere.com> wrote:
> Halts() always simulates it input. When the halt decider is changed so 
> that it only reports halting after its input has halted and never aborts 
> the execution of any input then the resulting execution trace makes it 
> as obvious as a [Boston cream pie in the face] that the following code 
><is> infinitely recursive:
>
> // Halts() always simulates it input
> void H_Hat(u32 P)
> {
>    u32 Input_Halts = Halts(P, P);
>    if (Input_Halts)
>      HERE: goto HERE;
>    return;
> }

However, when the halt decidedr is changed so that it does abort,
then that is no longer infinitely recursive.
>
> int main()
> {
>    H_Hat((u32)H_Hat);
> }

And in those cases, you omit his call from your main to avoid
confronting the fact that it terminates.

You've never posted results from a program that has all of the following
features:

1. calls Halts((u32) H_Hat, (u32) H_Hat) and reports the value.
2. calls H_Hat((u32) H_Hat) as above.
3. also reports the value Halts(P, P) returns to H_Hat.

You're not fooling anyone.

> but then what would one expect from gullible fools?

Believing some your less crazy-sounding claims.

-- 
TXR Programming Language: http://nongnu.org/txr

[toc] | [prev] | [next] | [standalone]


#2582 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-16 15:23 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement](Linz/Sipser)
Message-ID<ab2dnQtVOfD_xJ79nZ2dnUU7-efNnZ2d@giganews.com>
In reply to#2562
On 1/14/2021 7:24 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 1/13/2021 9:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 1/13/2021 8:23 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 1/13/2021 5:59 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 1/13/2021 9:35 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> On 1/12/2021 7:20 PM, Ben Bacarisse wrote:
>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>>
>>>>>>>>>>>> On 1/10/2021 9:09 AM, Ben Bacarisse wrote:
>>>>>>>>>>> <cut>
>>>>>>>>>>>>> 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.
>>>>>>>>>>>
>>>>>>>>>>> Not a very useful agreement unless you also agree that you can't have
>>>>>>>>>>> code that can make this determination in the general case.
>>>>>>>>>>
>>>>>>>>>> If we hypothetically assume that the conventional halting problem
>>>>>>>>>> undecidability proofs have been refuted that would seem to make the
>>>>>>>>>> halting problem an open question again.
>>>>>>>>>
>>>>>>>>> No.  Invalidating a proof does not invalidate the theorem.  How could
>>>>>>>>> you not get this after all this time?
>>>>>>>>
>>>>>>>> Theorem X is proven on the basis of Y.
>>>>>>>> Y is proven to be bogus.
>>>>>>>> Thus the proof of Theorem X loses its basis.
>>>>>>>
>>>>>>> Not in dispute.  If you don't understand what I'm saying, you could ask
>>>>>>> me rather than just say things that are not at issue.
>>>>>>
>>>>>> As long as we are on the same page wit the above then I don't
>>>>>> understand what you could mean. What do you mean?
>>>>>
>>>>> If a theorem has a dozen published proofs, it does not matter if six of
>>>>> them are found to be bogus.  The halting theorem has been proved in many
>>>>> different ways.  You have never bothered to look at any of them.  Heck,
>>>>> you have not even read Linz's "proper" proof.
>>>>
>>>> You already acknowledged that all the proofs have the same essential
>>>> basis, thus refuting this basis would refute the Theorem.
>>>
>>> In fact I have stated the contrary.  You still haven't read Linz's actual
>>> proof (rather than the one he sketches for historical reasons), have
>>> you?  Have you looked at Rado's proof of the busy beaver theorem?  What
>>> about Chaitin?  Martin?
>>
>> https://catonmat.net/busy-beaver
>>
>> The busy beaver is not analogous to:
>> (a) The Liar Paradox
>> (b) Gödel's 1931 Incompleteness Theorem
>> (c) The Tarski Undefinability Theorem
>>
>> Thus busy beaver is not relevant to my research on the mathematical
>> foundation of truth.
> 
> Any time you feel up to actually leaning something, ask the group (or
> me) why the BB theorem is directly relevant to you current "work".
> 
>> Refuting the conventional:
>>
>> "Do the opposite of whatever the halt decider decides"
>>     Once D has determined this information, it does the opposite.
>>     (Sipser 1997:165)
>> can be leveraged to apply to {a,b,c} above.
>>
>>> Please also note that anything you do with your pile of x86 code will
>>> not apply to the standard proofs unless you can show that the H/H_Hat
>>> relationship has been maintained and you have admitted that you are not
>>> doing that with the latest ruse.
>>
>> The only thing that this function does not implement from Linz is
>> copying its input and Sipser does it my way:
> 
> You are wrong about Sipser.  If you did is Siper's way you could pull
> the trick you trying to get past us.
> 
>>     Now we construct a new Turing machine D with H as a subroutine.
>>     (Sipser 1997:165)
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> Thus the above function has the key common elements of Linz and
>> Sipser.
> 
> The problem function is your Halts with its "modes".  The H/H_Hat
> relationship is about one input-determined computation called H and
> another, derived from it, called H_Hat.  You have (at least) two
> computations hidden behind the name Halts.
> 

The only reason that I need modes is that in my "C" implementation 
people get fooled into believing that the halt decider is inconsistent 
because the two lines in main() seem to show that it is inconsistent.

With the Turing Machine implementation of this same halt decider there 
is no such thing as local mode so both lines of main() are decided in 
global mode as not halting.

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);
   H_Hat((u32)H_Hat);
}

When the above is implemented as Turing machines it is impossible to 
execute H_Hat() outside of the complete scope of Halts(), thus 
H_Hat((u32)H_Hat); of main cannot even be expressed.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2476 — Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons)

Fromolcott <NoOne@NoWhere.com>
Date2021-01-05 16:03 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement] (brain dead morons)
Message-ID<ms-dnZbD1pm9f2nCnZ2dnUU7-aXNnZ2d@giganews.com>
In reply to#2472
On 1/5/2021 3:17 PM, Kaz Kylheku wrote:
> On 2021-01-05, olcott <NoOne@NoWhere.com> wrote:
>> -- the code speaks for itself.
>> -- the code speaks for itself.
>> -- the code speaks for itself.
>> -- the code speaks for itself.
> 
> Yes; mostly it speaks for the validity of the proof. Halts indicates 0
> because it terminated infinite recursion. In so doing, it prevented the
> recursion from actually existing; and when H_Hat obtains the 0 return
> value from Halts, it will promptly terminate.
> 
> There is no infinite recursion when recursion is detected and stopped.

Brain-dead morons cannot understand things even when fully explained to 
them dozens of times.

The Halting problem is a problem in computer science. The problem is 
looking at a computer program and finding out if the program is going to 
run forever or not. We say that a program "solves the halting problem" 
if it can look at any other program and tell if that other program will 
run forever or not.

https://simple.wikipedia.org/wiki/Halting_problem

On Saturday, November 28, 2020 at 2:00:28 PM UTC-8, olcott wrote:
 > Every computation that would not halt if its simulation
 > were not halted is by logical necessity a non-halting computation.

A wall a separation between the behavior of the program under test (PUT) 
and the behavior of the halt decider must be strictly maintained 
otherwise the halt decision becomes tainted by interference by the halt 
decider.

This requires the halt decider to immediately terminate the execution of 
program under test (PUT) as soon as the halt decider detects its 
otherwise infinite execution.

The revised non-halting criteria still divides inputs into halting and 
non-halting, thus does directly address the actual halting problem.

It measures non-halting in a non-pathological rather than the 
conventional pathological way.

If we used the original pathological self-reference(Olcott 2004) 
criteria: Does the input halt on its input?

(a) Inputs that halt own their own and
(b) Inputs that must be forced to halt
would be conflated together as
(c) inputs that halt on their input,
thus failing to solve the halting problem.

> The halting result in that situation (e.g. local mode) does not
> pertain to the behavior of H_Hat in the actual runaway recursive
> situation (disabled mode).
> 
> Modes change the execution model of the processor, turning programs into
> different programs.
> 
> All you do when confronted with this is start going on about
> pathological self reference and Liar Paradoxes.
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2477

Fromolcott <NoOne@NoWhere.com>
Date2021-01-05 16:10 -0600
Message-ID<euKdnbJFK8ZFfmnCnZ2dnUU7-K3NnZ2d@giganews.com>
In reply to#2472
On 1/5/2021 3:46 PM, Kaz Kylheku wrote:
> On 2021-01-05, olcott <NoOne@NoWhere.com> wrote:
>> When confronted with all the source code and a fully operational system
>> few people are irrational enough to say that they simply do not "believe
>> in" the source code.
> 
> I've not even seen the source code but I believe it. The nested
> emulation thing is fine. (Not sure about the global mode, but
> disabled and local modes, as I understand them, are sound).
> 
> It doesn't support the results that you claim, and you know it.
> 
> You're not able to demonstrate how, in the same program, under with the
> same "decider mode"*, Halts(H_Hat, H_Hat) returns 0, and, accordingly,
> H_Hat(H_Hat) actually fails to halt.

This is simply over your head.

The impossibility of finding a single mistake in the code review of the 
halting decision under the different halting modes proves that I am 
correct. This must await transforming the code into ready-for-prime-time 
quality.

All three modes are fully operational now. I am doing refactoring to 
make the output easiest to understand.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#2479

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-05 22:43 +0000
Message-ID<20210105143333.590@kylheku.com>
In reply to#2477
["Followup-To:" header set to comp.theory.]
On 2021-01-05, olcott <NoOne@NoWhere.com> wrote:
> On 1/5/2021 3:46 PM, Kaz Kylheku wrote:
>> On 2021-01-05, olcott <NoOne@NoWhere.com> wrote:
>>> When confronted with all the source code and a fully operational system
>>> few people are irrational enough to say that they simply do not "believe
>>> in" the source code.
>> 
>> I've not even seen the source code but I believe it. The nested
>> emulation thing is fine. (Not sure about the global mode, but
>> disabled and local modes, as I understand them, are sound).
>> 
>> It doesn't support the results that you claim, and you know it.
>> 
>> You're not able to demonstrate how, in the same program, under with the
>> same "decider mode"*, Halts(H_Hat, H_Hat) returns 0, and, accordingly,
>> H_Hat(H_Hat) actually fails to halt.
>
> This is simply over your head.

How is the fact that you're not able to demonstrate something
over anyone's head?

> The impossibility of finding a single mistake in the code review of the 
> halting decision under the different halting modes proves that I am 
> correct.

The impossibility of you not finding a flaw in your own unpublished code
to your own satisfaction doesn't prove anything to the world.

Your statements about this do not convey anything of substance.

If you are confident that the code is correct, why don't you try the
above run?

All you have to do is run Halts(H_Hat, H_Hat) in some mode where
it returns 0, and then run H_Hat(H_Hat) in exactly the same mode,
and watch it fail to terminate, like that 0 says.

-- 
TXR Programming Language: http://nongnu.org/txr

[toc] | [prev] | [standalone]


Page 6 of 6 — ← Prev page 1 2 3 4 5 [6]

Back to top | Article view | comp.software-eng


csiph-web