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


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

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

Started byolcott <NoOne@NoWhere.com>
First post2021-01-02 13:12 -0600
Last post2021-01-02 20:04 +0000
Articles 3 — 2 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-02 13:12 -0600
    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] olcott <NoOne@NoWhere.com> - 2021-01-02 13:42 -0600
    Re: Halting Problem Final Conclusion [2021 update to my 2004 statement] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-01-02 20:04 +0000

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

Fromolcott <NoOne@NoWhere.com>
Date2021-01-02 13:12 -0600
SubjectRe: Halting Problem Final Conclusion [2021 update to my 2004 statement]
Message-ID<y-Cdnb8ZSM4JWG3CnZ2dnUU7-bPNnZ2d@giganews.com>
On 1/2/2021 12:54 PM, Richard Damon wrote:
> On 1/2/21 1:12 PM, olcott wrote:
>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>> The Liar Paradox can be shown to be nothing more than
>>> a incorrectly formed statement because of its pathological
>>> self-reference. The Halting Problem can only exist because
>>> of this same sort of pathological self-reference.
>>>
>>> The primary benefit of solving the Halting Problem was to
>>> detect programs that failed to halt, thus were incorrect.
>>> Pathological self-reference can also be viewed as a form
>>> of error. If the Halting Problem is redefined (which does not
>>> refute anyone), then this redefined problem can be easily
>>> solved.
>>>
>>> Now we have three possible correct results:
>>> (a) Halts
>>> (b) Does Not Halt
>>> (c) Pathological Self Reference to Halt
>>>
>>> Compared to my prior claims, this one seem trivial and
>>> obvious. Possibly this claim adds a slight nuance to the
>>> problem that has not been widely discussed before.
>>> If we construe pathological self-reference as another
>>> error condition, then this does remove the impossibility
>>> of creating a useful tool.
>>
>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>> mall Omaha NE.
>>
>> void H_Hat(u32 P)
>> {
>>    u32 Input_Halts = Halts(P, P);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>>    return;
>> }
>>
>> It turns out that inputs having pathological self-reference can be
>> decided to be non-halting. The invocation of a halt decider that is
>> based on simulating the execution of its input can be decided to be
>> infinitely recursive in the above case.
>>
>> Within the x86 based execution trace of the above user code:
>> H_Hat() calls the same function from the same machine address with the
>> same inputs a second time with no other control flow instructions
>> inbetween.
>>
>> The above program meets the criteria of a program with infinite
>> execution: Any program that would not halt unless its simulation was
>> stopped is a program with the property of infinite execution.
>>
>>
> 
> But, if Halts does say it is non-halting it halts. So your logic is flawed.

You are very very persistently as stupid as a jackass.
You are very very persistently as stupid as a jackass.
You are very very persistently as stupid as a jackass.

The original halting problem used the cheap trick of pathological self 
reference modeling the halting criteria after the liar paradox.

This fooled people into believing that it is impossible to define a 
universal halt decider for 80 years.

No one ever bothered to use categorically exhaustive reasoning to see if 
halting deciding criteria could be defined that did not have the cheap 
trick of pathological self-reference.

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.

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.

You can continue to act like a complete jackass and simply ignore what I 
said, or you can carefully examine it looking for a flaw and find that 
there are none.

You can continue to act like a complete jackass and simply ignore what I 
said, or you can carefully examine it looking for a flaw and find that 
there are none.

You can continue to act like a complete jackass and simply ignore what I 
said, or you can carefully examine it looking for a flaw and find that 
there are none.


-- 
Copyright 2021 Pete Olcott

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

[toc] | [next] | [standalone]


#2470

Fromolcott <NoOne@NoWhere.com>
Date2021-01-02 13:42 -0600
Message-ID<Q8OdndZXZ-E5UW3CnZ2dnUU7-YvNnZ2d@giganews.com>
In reply to#2467
On 1/2/2021 1:36 PM, Richard Damon wrote:
> On 1/2/21 2:12 PM, olcott wrote:
>> On 1/2/2021 12:54 PM, Richard Damon wrote:
>>> On 1/2/21 1:12 PM, olcott wrote:
>>>> On 9/5/2004 11:21 AM, Peter Olcott wrote:
>>>>> The Liar Paradox can be shown to be nothing more than
>>>>> a incorrectly formed statement because of its pathological
>>>>> self-reference. The Halting Problem can only exist because
>>>>> of this same sort of pathological self-reference.
>>>>>
>>>>> The primary benefit of solving the Halting Problem was to
>>>>> detect programs that failed to halt, thus were incorrect.
>>>>> Pathological self-reference can also be viewed as a form
>>>>> of error. If the Halting Problem is redefined (which does not
>>>>> refute anyone), then this redefined problem can be easily
>>>>> solved.
>>>>>
>>>>> Now we have three possible correct results:
>>>>> (a) Halts
>>>>> (b) Does Not Halt
>>>>> (c) Pathological Self Reference to Halt
>>>>>
>>>>> Compared to my prior claims, this one seem trivial and
>>>>> obvious. Possibly this claim adds a slight nuance to the
>>>>> problem that has not been widely discussed before.
>>>>> If we construe pathological self-reference as another
>>>>> error condition, then this does remove the impossibility
>>>>> of creating a useful tool.
>>>>
>>>> I first came up with this update 2018-12-13 @ 7:00 PM at the Westroads
>>>> mall Omaha NE.
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>>     u32 Input_Halts = Halts(P, P);
>>>>     if (Input_Halts)
>>>>       HERE: goto HERE;
>>>>     return;
>>>> }
>>>>
>>>> It turns out that inputs having pathological self-reference can be
>>>> decided to be non-halting. The invocation of a halt decider that is
>>>> based on simulating the execution of its input can be decided to be
>>>> infinitely recursive in the above case.
>>>>
>>>> Within the x86 based execution trace of the above user code:
>>>> H_Hat() calls the same function from the same machine address with the
>>>> same inputs a second time with no other control flow instructions
>>>> inbetween.
>>>>
>>>> The above program meets the criteria of a program with infinite
>>>> execution: Any program that would not halt unless its simulation was
>>>> stopped is a program with the property of infinite execution.
>>>>
>>>>
>>>
>>> But, if Halts does say it is non-halting it halts. So your logic is
>>> flawed.
>>
>> You are very very persistently as stupid as a jackass.
>> You are very very persistently as stupid as a jackass.
>> You are very very persistently as stupid as a jackass.
>>
>> The original halting problem used the cheap trick of pathological self
>> reference modeling the halting criteria after the liar paradox.
> 
> The Halting Problem is what the Halting problem is. Turing Machines do
> allow for this sort of self reference. To call it pathological is a
> misstatement. There is no 'pathology' to self reference, in fact it is
> part of what allows us to get into the higher reaches of mathematics.

-You are very very persistently as stupid as a jackass.
-You are very very persistently as stupid as a jackass.
-You are very very persistently as stupid as a jackass.

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

Which of {true, false} is the correct value that Halts() could return to 
H_Hat() (you freaking moron) ?

Which of {true, false} is the correct value that Halts() could return to 
H_Hat() (you freaking moron) ?

Which of {true, false} is the correct value that Halts() could return to 
H_Hat() (you freaking moron) ?

-- 
Copyright 2021 Pete Olcott

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

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


#2471

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-01-02 20:04 +0000
Message-ID<20210102114153.27@kylheku.com>
In reply to#2467
On 2021-01-02, olcott <NoOne@NoWhere.com> wrote:
> The original halting problem used the cheap trick of pathological self 
> reference modeling the halting criteria after the liar paradox.

So you admit that your method doesn't speak to the original halting
problem.

Nobody in academia will take you seriously if you insist on working with
a vandalized formulation which borrows the language and terminology of
the original halting problem, but robs it of its core logical
proposition.

Hatcheting the halting problem down to an irrelevant strawman and then
attacking that strawman successfully is not a noteworthy achievement.

Anyone can change the definition of a hard problem in order to mess
with the validity of its theorems.

If we redefine how exponentiation works, we can change the meaning of
Fermat's Last Theorem so that a fifth grader can solve it, right?

As long as you do that, you will remain a Usenet crank.  If you don't do
that, you will also remain a Usenet crank, because the original halting
problem is unassailable. Therefore, rationally speaking, you should
strive to be remembered as a Usenet crank who at least attacked the
right problem.

[toc] | [prev] | [standalone]


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


csiph-web