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


Groups > comp.theory > #33180 > unrolled thread

Re: Halting problem undecidability and infinite recursion (PDF attached)

Started byMr Flibble <flibble@i42.REMOVETHISBIT.co.uk>
First post2021-05-09 20:01 +0100
Last post2021-06-27 22:19 -0700
Articles 7 on this page of 87 — 12 participants

Back to article view | Back to comp.theory

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 undecidability and infinite recursion (PDF attached) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-09 20:01 +0100
    Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 14:11 -0500
      Re: Halting problem undecidability and infinite recursion (PDF attached) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-09 21:03 +0100
        Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 15:11 -0500
          Re: Halting problem undecidability and infinite recursion (PDF attached) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-09 21:33 +0100
            Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 15:39 -0500
              Re: Halting problem undecidability and infinite recursion (PDF attached) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-05-09 13:43 -0700
    Re: Halting problem undecidability and infinite recursion (PDF attached) Siri Cruise <chine.bleu@yahoo.com> - 2021-05-09 13:45 -0700
      Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 15:54 -0500
        Re: Halting problem undecidability and infinite recursion (PDF attached) Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-09 21:56 +0100
          Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 16:00 -0500
            Re: Halting problem undecidability and infinite recursion (PDF attached) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 17:40 -0400
        Re: Halting problem undecidability and infinite recursion (PDF attached) Siri Cruise <chine.bleu@yahoo.com> - 2021-05-09 14:00 -0700
          Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 16:04 -0500
            Re: Halting problem undecidability and infinite recursion (PDF attached) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 17:42 -0400
            Re: Halting problem undecidability and infinite recursion (PDF attached) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-09 23:32 +0100
              Re: Halting problem undecidability and infinite recursion (PDF attached) olcott <NoOne@NoWhere.com> - 2021-05-09 17:57 -0500
                Re: Halting problem undecidability and infinite recursion (PDF attached) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 19:10 -0400
                  Re: Halting problem undecidability and infinite recursion (PDF attached)( impossibly incorrect ) olcott <NoOne@NoWhere.com> - 2021-05-09 18:38 -0500
                    Re: Halting problem undecidability and infinite recursion (PDF attached)( impossibly incorrect ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 20:07 -0400
                      Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 00:25 +0000
                        Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 19:37 -0500
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 18:51 -0600
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:50 -0500
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 20:33 -0600
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 21:43 -0500
                                  Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 21:06 -0600
                                    Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 22:36 -0500
                                      Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 22:31 -0600
                                        Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 23:41 -0500
                                          Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 08:17 -0400
                                            Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-10 08:32 -0500
                                              Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 19:46 -0400
                                                Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 01:43 +0100
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 22:57 -0400
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 20:51 -0400
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 01:09 +0000
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:24 -0500
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 01:47 +0000
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:53 -0500
                                  Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 23:00 -0400
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( honest dialogue ? ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 23:00 -0400
                      Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 20:30 -0400
                        Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-09 19:42 -0500
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 20:58 -0400
                      Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-09 19:11 -0500
                        Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 18:49 -0600
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:45 -0500
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) André G. Isaak <agisaak@gm.invalid> - 2021-05-09 20:36 -0600
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-09 21:51 -0500
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 23:03 -0400
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 05:41 +0000
                                  Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 08:06 -0500
                                    Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-10 19:47 -0400
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 23:02 -0400
                        Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 02:31 +0100
                          Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-09 20:43 -0500
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Richard Damon <Richard@Damon-Family.org> - 2021-05-09 23:08 -0400
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 05:32 +0000
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 08:05 -0500
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 16:33 +0000
                                  Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 11:49 -0500
                                    Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-10 16:58 +0000
                                      Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 12:09 -0500
                            Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 11:54 +0100
                              Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 08:21 -0500
                                Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 17:00 +0100
                                  Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 11:22 -0500
                                    Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 23:59 +0100
                                      Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) olcott <NoOne@NoWhere.com> - 2021-05-10 18:05 -0500
                                        Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Jeff Barnett <jbb@notatt.com> - 2021-05-10 17:33 -0600
                                        Re: Halting problem undecidability and infinite recursion (PDF attached)( aborted at some point ) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 02:03 +0100
                Re: Halting problem undecidability and infinite recursion (PDF attached) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-10 02:28 +0100
            Re: Halting problem undecidability and infinite recursion (PO=Deluded Dumbo) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-10 04:03 +0100
              Re: Halting problem undecidability and infinite recursion [ necessarily(P) ] olcott <NoOne@NoWhere.com> - 2021-05-09 22:25 -0500
                Re: Halting problem undecidability and infinite recursion [ PO=Deluded Dumbo ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-10 16:18 +0100
                  Re: Halting problem undecidability and infinite recursion [ Necessarily correct ] olcott <NoOne@NoWhere.com> - 2021-05-10 10:25 -0500
                    Re: Halting problem undecidability and infinite recursion [ PO=Deluded Dumbo ] Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-05-10 17:27 +0100
                      Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ] olcott <NoOne@NoWhere.com> - 2021-05-10 11:37 -0500
                        Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 00:16 +0100
                          Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ] olcott <NoOne@NoWhere.com> - 2021-05-10 18:57 -0500
                            Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-11 02:17 +0100
                            Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ] Richard Damon <Richard@Damon-Family.org> - 2021-05-10 22:56 -0400
                    Re: Halting problem undecidability and infinite recursion [ Necessarily correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-10 10:15 -0700
                  Re: Halting problem undecidability and infinite recursion [ Mike says Proof is correct ] olcott <NoOne@NoWhere.com> - 2021-05-10 11:17 -0500
                  Re: Halting problem undecidability and infinite recursion [sound deductive argument = proof ] olcott <NoOne@NoWhere.com> - 2021-06-27 21:35 -0500
                    Re: Halting problem undecidability and infinite recursion [sound deductive argument = proof ] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 22:19 -0700

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


#33311 — Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]

Fromolcott <NoOne@NoWhere.com>
Date2021-05-10 18:57 -0500
SubjectRe: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]
Message-ID<TIWdndx0Qpe7VQT9nZ2dnUU7-YHNnZ2d@giganews.com>
In reply to#33298
On 5/10/2021 6:16 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 5/10/2021 11:27 AM, Mike Terry wrote:
>>> On 10/05/2021 16:25, olcott wrote:
> 
>>>> Ad hominem is a dishonest Jackass move used by people that insist on
>>>> disagreement at the expense of truth.
>>>>
>>> I am stopping at your first major error.  You do not understand what
>>> ad-hominem means.  I did not say your proof was incorrect because
>>> you're incapable of abstract reasoning - I said that what you post
>>> above IS NOT A PROOF OF ANYTHING.  There is literally no proof for me
>>> to review!
>>
>> And yet you already agreed that my current proof is correct:
> 
> You do a lot of lying about people agreeing with you.  It can't just be
> that you get honestly confused about what has been said because you'd
> correct the lie as soon as the person pointed it out.
> 
> What can you possibly hope to gain by this dishonest move?  I suppose it
> just feels good to lie about people.  It can't possibly help bolster
> your case because no one who's been following these threads with even
> half an eye open will know that your conclusions have no support from
> anyone remotely competent.
> 
> Or maybe it just helps deflect the conversion, now that you are stuck in
> a corner with nothing left to argue.  You want false to be the correct
> answer for some halting computations, but it isn't, and you have run out
> of was to try to make it sound less daft.
> 
>> On 11/20/2020 9:30 PM, Mike Terry wrote:
>>> On 21/11/2020 02:45, olcott wrote:
>>>> void H_Hat(u32 P)
>>>> {
>>>>    u32 Aborted = Halts(P, P);
>>>>    if (Aborted)
>>>>      HALT
>>>>    else
>>>>      HERE: goto HERE;
>>>> }
>>>>
>>>>
>>>> int main()
>>>> {
>>>>    u32 P = (u32)H_Hat;
>>>>    Halts(P, P);
>>>>    HALT;
>>>> }
>>>>
>>>> (2) It is known that the above code is infinitely recursive if Halts()
>>>> acts like a UTM and simulates its input returning true if and only if
>>>> its input halts.
> 
> NOTE: Halts acts like a UTM.

Currently Halts <is> an x86 emulator up to the point

When the execution trace of H_Hat()
(1) correctly matches
(2) a correct non-halting behavior pattern

then the decision of non-halting is necessarily correct.

Now that you agree with the above tautology it only takes a little bit 
of software engineering so see that both conditions are correctly met.

I am sure that Mike, Kaz and André all have this much software engineering.

>>> Yes, we have infinite "recursive emulation".
>>>
>>>> (3) On the basis of (1) and (2) It is known that a correct halt decider
>>>> must return false.
> 


-- 
Copyright 2021 Pete Olcott

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

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


#33317 — Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-05-11 02:17 +0100
SubjectRe: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]
Message-ID<87y2cm2hmh.fsf@bsb.me.uk>
In reply to#33311
olcott <NoOne@NoWhere.com> writes:

> On 5/10/2021 6:16 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/10/2021 11:27 AM, Mike Terry wrote:
>>>> On 10/05/2021 16:25, olcott wrote:
>>
>>>>> Ad hominem is a dishonest Jackass move used by people that insist on
>>>>> disagreement at the expense of truth.
>>>>>
>>>> I am stopping at your first major error.  You do not understand what
>>>> ad-hominem means.  I did not say your proof was incorrect because
>>>> you're incapable of abstract reasoning - I said that what you post
>>>> above IS NOT A PROOF OF ANYTHING.  There is literally no proof for me
>>>> to review!
>>>
>>> And yet you already agreed that my current proof is correct:
>>
>> You do a lot of lying about people agreeing with you.  It can't just be
>> that you get honestly confused about what has been said because you'd
>> correct the lie as soon as the person pointed it out.
>>
>> What can you possibly hope to gain by this dishonest move?  I suppose it
>> just feels good to lie about people.  It can't possibly help bolster
>> your case because no one who's been following these threads with even
>> half an eye open will know that your conclusions have no support from
>> anyone remotely competent.
>>
>> Or maybe it just helps deflect the conversion, now that you are stuck in
>> a corner with nothing left to argue.  You want false to be the correct
>> answer for some halting computations, but it isn't, and you have run out
>> of was to try to make it sound less daft.
>>
>>> On 11/20/2020 9:30 PM, Mike Terry wrote:
>>>> On 21/11/2020 02:45, olcott wrote:
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>>    u32 Aborted = Halts(P, P);
>>>>>    if (Aborted)
>>>>>      HALT
>>>>>    else
>>>>>      HERE: goto HERE;
>>>>> }
>>>>>
>>>>>
>>>>> int main()
>>>>> {
>>>>>    u32 P = (u32)H_Hat;
>>>>>    Halts(P, P);
>>>>>    HALT;
>>>>> }
>>>>>
>>>>> (2) It is known that the above code is infinitely recursive if Halts()
>>>>> acts like a UTM and simulates its input returning true if and only if
>>>>> its input halts.
>>
>> NOTE: Halts acts like a UTM.
>
> Currently Halts <is> an x86 emulator up to the point

As you know, Mike was replying to a scenario you had set up in which
Halts is a UTM that returns if and only if its input halts.  The words
are right there.  You were asking for confirmation that if Halts were
not a partial simulator the key call would be a non-halting computation.

It's despicable to turn that helpful agreement into a claim that he
agrees with your silly "proof".

> When the execution trace of H_Hat()
> (1) correctly matches
> (2) a correct non-halting behavior pattern
>
> then the decision of non-halting is necessarily correct.

You need to explain how Halts gets the wrong answer.  I have my own
opinion about what you've got wrong, but it's a fool's errand to debug
software that is being deliberately kept secret.

> Now that you agree with the above tautology it only takes a little bit
> of software engineering so see that both conditions are correctly met.

The fact that Halts gives the wrong answer means that either the match
is not correct, or the pattern is not correct, or there are other bugs
that account for the wrong answer.

> I am sure that Mike, Kaz and André all have this much software
> engineering.

Do you?  It's your code.  You have every single detail at your
fingertips, and you might even understand the garbled specification of
the pattern.  How does the software engineer in you go about tracking
down the error?

-- 
Ben.

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


#33330 — Re: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-05-10 22:56 -0400
SubjectRe: Halting problem undecidability and infinite recursion [ Mike agrees proof is correct ]
Message-ID<znmmI.49298$ft1.41082@fx10.iad>
In reply to#33311
On 5/10/21 7:57 PM, olcott wrote:
> On 5/10/2021 6:16 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 5/10/2021 11:27 AM, Mike Terry wrote:
>>>> On 10/05/2021 16:25, olcott wrote:
>>
>>>>> Ad hominem is a dishonest Jackass move used by people that insist on
>>>>> disagreement at the expense of truth.
>>>>>
>>>> I am stopping at your first major error.  You do not understand what
>>>> ad-hominem means.  I did not say your proof was incorrect because
>>>> you're incapable of abstract reasoning - I said that what you post
>>>> above IS NOT A PROOF OF ANYTHING.  There is literally no proof for me
>>>> to review!
>>>
>>> And yet you already agreed that my current proof is correct:
>>
>> You do a lot of lying about people agreeing with you.  It can't just be
>> that you get honestly confused about what has been said because you'd
>> correct the lie as soon as the person pointed it out.
>>
>> What can you possibly hope to gain by this dishonest move?  I suppose it
>> just feels good to lie about people.  It can't possibly help bolster
>> your case because no one who's been following these threads with even
>> half an eye open will know that your conclusions have no support from
>> anyone remotely competent.
>>
>> Or maybe it just helps deflect the conversion, now that you are stuck in
>> a corner with nothing left to argue.  You want false to be the correct
>> answer for some halting computations, but it isn't, and you have run out
>> of was to try to make it sound less daft.
>>
>>> On 11/20/2020 9:30 PM, Mike Terry wrote:
>>>> On 21/11/2020 02:45, olcott wrote:
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>>    u32 Aborted = Halts(P, P);
>>>>>    if (Aborted)
>>>>>      HALT
>>>>>    else
>>>>>      HERE: goto HERE;
>>>>> }
>>>>>
>>>>>
>>>>> int main()
>>>>> {
>>>>>    u32 P = (u32)H_Hat;
>>>>>    Halts(P, P);
>>>>>    HALT;
>>>>> }
>>>>>
>>>>> (2) It is known that the above code is infinitely recursive if Halts()
>>>>> acts like a UTM and simulates its input returning true if and only if
>>>>> its input halts.
>>
>> NOTE: Halts acts like a UTM.
> 
> Currently Halts <is> an x86 emulator up to the point
> 
> When the execution trace of H_Hat()
> (1) correctly matches
> (2) a correct non-halting behavior pattern
> 
> then the decision of non-halting is necessarily correct.
> 
> Now that you agree with the above tautology it only takes a little bit
> of software engineering so see that both conditions are correctly met.
> 
> I am sure that Mike, Kaz and André all have this much software engineering.

Then it was on the right track up to the point it decided to do what it
assumed it wasn't going to do (stop the simulation) and mess up all its
logic.

It was so close to the right answer of H_Hat(H_Hat) being non-halting
because Halts was going to be non-halting, until it decided to stop the
simulation. In doing that, it broke the logic it was using, thus it got
the wrong answer.

Of course, if it followed the path it was on, then it still would not
have been a correct decider, because it would have failed to decide.


> 
>>>> Yes, we have infinite "recursive emulation".
>>>>
>>>>> (3) On the basis of (1) and (2) It is known that a correct halt
>>>>> decider
>>>>> must return false.
>>
> 
> 

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


#33282 — Re: Halting problem undecidability and infinite recursion [ Necessarily correct ]

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-05-10 10:15 -0700
SubjectRe: Halting problem undecidability and infinite recursion [ Necessarily correct ]
Message-ID<48845771-2555-47f6-9d86-3507bd118598n@googlegroups.com>
In reply to#33264
On Monday, 10 May 2021 at 16:25:23 UTC+1, olcott wrote:
> On 5/10/2021 10:18 AM, Mike Terry wrote: 
> > On 10/05/2021 04:25, olcott wrote: 
> >> On 5/9/2021 10:03 PM, Mike Terry wrote: 
> >>> On 09/05/2021 22:04, olcott wrote: 
> >>>> On 5/9/2021 4:00 PM, Siri Cruise wrote: 
> >>>>> In article <0vednVI61bCe0QX9...@giganews.com>, 
> >>>>> olcott <No...@NoWhere.com> wrote: 
> >>>>> 
> >>>>>> When we base halting on answering questions that currently have no 
> >>>>>> known 
> >>>>>> answers this does not derive the conventional notion of halting 
> >>>>>> undecidability. It is not the case that the correct answer is 
> >>>>>> impossible 
> >>>>>> to provide, we just don't know what that answer is right now. 
> >>>>> 
> >>>>> In other words you can solve whether a specific TM will halt 
> >>>>> after someone else proves whether it will halt. That's a really 
> >>>>> impressive skill. 
> >>>>> 
> >>>> 
> >>>> I have correctly refuted the conventional halting problem proofs. 
> >>> 
> >>> Dude! I'm afraid your mind is pretty much incapable of any/all 
> >>> abstract reasoning, which means you can't properly understand even 
> >>> simple abstract concepts and definitions that underly the theorems 
> >>> you claim to "refute". 
> >> 
> >> **My whole proof is boiled down to as simple as this:** 
> >> When the execution trace of H_Hat() correctly matches a correct 
> >> non-halting behavior pattern then the decision of non-halting is 
> >> impossibly incorrect: AKA modal logic necessarily(P) 
> >> 
> >> When an execution trace matches the following criteria we know that 
> >> the non-halting behavior of infinite recursion or infinitely nested 
> >> simulation has been matched: 
> >> 
> >> If the execution trace of function Y() shows: 
> >> (1) function X() is called twice in sequence from the same machine 
> >> address of Y() 
> >> (2) with the same parameters to X() 
> >> (3) with no conditional branch or indexed jump instructions in Y() 
> >> (4) with no function call returns from X() 
> >> then the function call from Y() to X() is infinitely recursive. 
> > 
> > You cut the lines that said you were intellectually incapable of 
> > producing any kind of proof, because
> Ad hominem is a dishonest Jackass move used by people that insist on 
> disagreement at the expense of truth. 
> 
> From what I recall you are not a clueless wonder that has nothing more 
> than ad hominem. From what I recall you are capable of an accurate 
> technical review. I dare you to provide such an accurate technical 
> review of this:
> **My whole proof is boiled down to as simple as this:** 
> When the execution trace of H_Hat() correctly matches a correct 
> non-halting behavior pattern then the decision of non-halting is
> necessarily correct.
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf 
> 
Ad hominem is an argument that a proposition is wrong because of the identity
of the person making it. It's a logical fallacy. But it's a social necessity - some
people have to be dismissed without a hearing. 

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


#33270 — Re: Halting problem undecidability and infinite recursion [ Mike says Proof is correct ]

Fromolcott <NoOne@NoWhere.com>
Date2021-05-10 11:17 -0500
SubjectRe: Halting problem undecidability and infinite recursion [ Mike says Proof is correct ]
Message-ID<nPednSVUFKMTwQT9nZ2dnUU7-WfNnZ2d@giganews.com>
In reply to#33263
On 5/10/2021 10:18 AM, Mike Terry wrote:
> On 10/05/2021 04:25, olcott wrote:
>> On 5/9/2021 10:03 PM, Mike Terry wrote:
>>> On 09/05/2021 22:04, olcott wrote:
>>>> On 5/9/2021 4:00 PM, Siri Cruise wrote:
>>>>> In article <0vednVI61bCe0QX9nZ2dnUU7-U3NnZ2d@giganews.com>,
>>>>>   olcott <NoOne@NoWhere.com> wrote:
>>>>>
>>>>>> When we base halting on answering questions that currently have no 
>>>>>> known
>>>>>> answers this does not derive the conventional notion of halting
>>>>>> undecidability. It is not the case that the correct answer is 
>>>>>> impossible
>>>>>> to provide, we just don't know what that answer is right now.
>>>>>
>>>>> In other words you can solve whether a specific TM will halt
>>>>> after someone else proves whether it will halt. That's a really
>>>>> impressive skill.
>>>>>
>>>>
>>>> I have correctly refuted the conventional halting problem proofs.
>>>
>>> Dude!  I'm afraid your mind is pretty much incapable of any/all 
>>> abstract reasoning, which means you can't properly understand even 
>>> simple abstract concepts and definitions that underly the theorems 
>>> you claim to "refute".
>>
>> **My whole proof is boiled down to as simple as this:**
>> When the execution trace of H_Hat() correctly matches a correct
>> non-halting behavior pattern then the decision of non-halting is
>> impossibly incorrect: AKA modal logic necessarily(P)
>>
>> When an execution trace matches the following criteria we know that 
>> the non-halting behavior of infinite recursion or infinitely nested 
>> simulation has been matched:
>>
>> If the execution trace of function Y() shows:
>> (1) function X() is called twice in sequence from the same machine 
>> address of Y()
>> (2) with the same parameters to X()
>> (3) with no conditional branch or indexed jump instructions in Y()
>> (4) with no function call returns from X()
>> then the function call from Y() to X() is infinitely recursive.
> 
> You cut the lines that said you were intellectually incapable of 
> producing any kind of proof, because you don't understand what a proof 
> actually is.  The above is not a proof of anything.

And yet you already agreed that my current proof is correct:

http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf

On 11/20/2020 9:30 PM, Mike Terry wrote:
 > On 21/11/2020 02:45, olcott wrote:
 >> void H_Hat(u32 P)
 >> {
 >>   u32 Aborted = Halts(P, P);
 >>   if (Aborted)
 >>     HALT
 >>   else
 >>     HERE: goto HERE;
 >> }
 >>
 >>
 >> int main()
 >> {
 >>   u32 P = (u32)H_Hat;
 >>   Halts(P, P);
 >>   HALT;
 >> }
 >>
 >> (2) It is known that the above code is infinitely recursive if Halts()
 >> acts like a UTM and simulates its input returning true if and only if
 >> its input halts.
 >
 > Yes, we have infinite "recursive emulation".
 >
 >>
 >> (3) On the basis of (1) and (2) It is known that a correct halt decider
 >> must return false.
 >
 > There is no such thing as a "correct halt decider" for all inputs, but
 > input (H_Hat,H_Hat) is non-halting, assuming your Halts() is as
 > described.  This is all baby stuff.  [So the correct halting decision
 > for the input is non-halting].



-- 
Copyright 2021 Pete Olcott

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

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


#35460 — Re: Halting problem undecidability and infinite recursion [sound deductive argument = proof ]

Fromolcott <NoOne@NoWhere.com>
Date2021-06-27 21:35 -0500
SubjectRe: Halting problem undecidability and infinite recursion [sound deductive argument = proof ]
Message-ID<GbidncOdXf4YqET9nZ2dnUU7-eHNnZ2d@giganews.com>
In reply to#33263
On 5/10/2021 10:18 AM, Mike Terry wrote:
> On 10/05/2021 04:25, olcott wrote:
>> **My whole proof is boiled down to as simple as this:**
>> When the execution trace of H_Hat() correctly matches a correct
>> non-halting behavior pattern then the decision of non-halting is
>> impossibly incorrect: AKA modal logic necessarily(P)
>>
>> When an execution trace matches the following criteria we know that 
>> the non-halting behavior of infinite recursion or infinitely nested 
>> simulation has been matched:
>>
>> If the execution trace of function Y() shows:
>> (1) function X() is called twice in sequence from the same machine 
>> address of Y()
>> (2) with the same parameters to X()
>> (3) with no conditional branch or indexed jump instructions in Y()
>> (4) with no function call returns from X()
>> then the function call from Y() to X() is infinitely recursive.
> 
> You cut the lines that said you were intellectually incapable of 
> producing any kind of proof, because you don't understand what a proof 
> actually is.  The above is not a proof of anything.

As I suspected you never provided any rebuttal at all, you merely 
dismissed my sound deductive inference entirely out-of-hand on the basis 
that it is not in the form of a conventional mathematical proof.

Simulating partial halt decider H correctly decides that P(P) never halts

// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
   u32 Input_Halts = H(x, x);
   if (Input_Halts)
     HERE: goto HERE;
}

int main()
{
   u32 Input_Halts = H((u32)P, (u32)P);
   Output("Input_Halts = ", Input_Halts);
}

_P()
[00000b1a](01)  55              push ebp
[00000b1b](02)  8bec            mov ebp,esp
[00000b1d](01)  51              push ecx
[00000b1e](03)  8b4508          mov eax,[ebp+08]
[00000b21](01)  50              push eax       // 2nd Param
[00000b22](03)  8b4d08          mov ecx,[ebp+08]
[00000b25](01)  51              push ecx       // 1st Param
[00000b26](05)  e81ffeffff      call 0000094a  // call H
[00000b2b](03)  83c408          add esp,+08
[00000b2e](03)  8945fc          mov [ebp-04],eax
[00000b31](04)  837dfc00        cmp dword [ebp-04],+00
[00000b35](02)  7402            jz 00000b39
[00000b37](02)  ebfe            jmp 00000b37
[00000b39](02)  8be5            mov esp,ebp
[00000b3b](01)  5d              pop ebp
[00000b3c](01)  c3              ret
Size in bytes:(0035) [00000b3c]

_main()
[00000bda](01)  55              push ebp
[00000bdb](02)  8bec            mov ebp,esp
[00000bdd](01)  51              push ecx
[00000bde](05)  681a0b0000      push 00000b1a  // push address of P
[00000be3](05)  681a0b0000      push 00000b1a  // push address of P
[00000be8](05)  e85dfdffff      call 0000094a  // call H
[00000bed](03)  83c408          add esp,+08
[00000bf0](03)  8945fc          mov [ebp-04],eax
[00000bf3](03)  8b45fc          mov eax,[ebp-04]
[00000bf6](01)  50              push eax
[00000bf7](05)  683b030000      push 0000033b
[00000bfc](05)  e869f7ffff      call 0000036a
[00000c01](03)  83c408          add esp,+08
[00000c04](02)  33c0            xor eax,eax
[00000c06](02)  8be5            mov esp,ebp
[00000c08](01)  5d              pop ebp
[00000c09](01)  c3              ret
Size in bytes:(0048) [00000c09]

Columns
(1) Machine address of instruction
(2) Machine address of top of stack
(3) Value of top of stack after instruction executed
(4) Machine language bytes
(5) Assembly language text
===============================
...[00000bda][00101647][00000000](01)  55              push ebp
...[00000bdb][00101647][00000000](02)  8bec            mov ebp,esp
...[00000bdd][00101643][00000000](01)  51              push ecx
...[00000bde][0010163f][00000b1a](05)  681a0b0000      push 00000b1a // 
push P
...[00000be3][0010163b][00000b1a](05)  681a0b0000      push 00000b1a // 
push P
...[00000be8][00101637][00000bed](05)  e85dfdffff      call 0000094a // 
call H
Begin Local Halt Decider Simulation at Machine Address:b1a
...[00000b1a][002116e7][002116eb](01)  55              push ebp
...[00000b1b][002116e7][002116eb](02)  8bec            mov ebp,esp
...[00000b1d][002116e3][002016b7](01)  51              push ecx
...[00000b1e][002116e3][002016b7](03)  8b4508          mov eax,[ebp+08]
...[00000b21][002116df][00000b1a](01)  50              push eax      // 
push P
...[00000b22][002116df][00000b1a](03)  8b4d08          mov ecx,[ebp+08]
...[00000b25][002116db][00000b1a](01)  51              push ecx      // 
push P
...[00000b26][002116d7][00000b2b](05)  e81ffeffff      call 0000094a // 
call H
...[00000b1a][0025c10f][0025c113](01)  55              push ebp
...[00000b1b][0025c10f][0025c113](02)  8bec            mov ebp,esp
...[00000b1d][0025c10b][0024c0df](01)  51              push ecx
...[00000b1e][0025c10b][0024c0df](03)  8b4508          mov eax,[ebp+08]
...[00000b21][0025c107][00000b1a](01)  50              push eax      // 
push P
...[00000b22][0025c107][00000b1a](03)  8b4d08          mov ecx,[ebp+08]
...[00000b25][0025c103][00000b1a](01)  51              push ecx      // 
push P
...[00000b26][0025c0ff][00000b2b](05)  e81ffeffff      call 0000094a // 
call H
Local Halt Decider: Infinite Recursion Detected Simulation Stopped

In the above 16 instructions of the simulation of P(P) we can see that 
the first 8 instructions of P are repeated. The end of this sequence of 
8 instructions is a call to H(P,P). Because H only examines the behavior 
of its inputs and ignores its own behavior when H(P,P) is called we only 
see the first instruction of P being simulated.

Anyone knowing the x86 language well enough can see that none of these 8 
simulated instructions of P have any escape from their infinitely 
repeating behavior pattern. When H recognizes this infinitely repeating 
pattern it aborts its simulation of P(P) and reports that its input: 
(P,P) would never halt on its input.

...[00000bed][00101643][00000000](03)  83c408          add esp,+08
...[00000bf0][00101643][00000000](03)  8945fc          mov [ebp-04],eax
...[00000bf3][00101643][00000000](03)  8b45fc          mov eax,[ebp-04]
...[00000bf6][0010163f][00000000](01)  50              push eax
...[00000bf7][0010163b][0000033b](05)  683b030000      push 0000033b
---[00000bfc][0010163b][0000033b](05)  e869f7ffff      call 0000036a
Input_Halts = 0
...[00000c01][00101643][00000000](03)  83c408          add esp,+08
...[00000c04][00101643][00000000](02)  33c0            xor eax,eax
...[00000c06][00101647][00000000](02)  8be5            mov esp,ebp
...[00000c08][0010164b][00100000](01)  5d              pop ebp
...[00000c09][0010164f][00000080](01)  c3              ret
Number_of_User_Instructions(33)
Number of Instructions Executed(26452)



> If you're going to submit an article for peer review, the reviewer will 
> expect there to be a proof of any claims you make.  So perhaps you have 
> some kind of proof of the above claims for (1)-(4) somewhere?  (I 
> suggested you should do this 6 months ago, but nothing was forthcoming 
> apart from your "I'm making it an axiom" nonsense.
> 
> Also, if you're claiming to have refuted the Linz/Sipser/similar HP 
> proof, they will expect you to say where exactly the error is in those 
> proofs.  Saying "my computer program shows they're wrong" won't cut it! 
> (But feel free to try that anyway...)
> 
> 
> Regards,
> Mike.
> 


-- 
Copyright 2021 Pete Olcott

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

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


#35469 — Re: Halting problem undecidability and infinite recursion [sound deductive argument = proof ]

FromDaniel Pehoushek <pehoushek1@gmail.com>
Date2021-06-27 22:19 -0700
SubjectRe: Halting problem undecidability and infinite recursion [sound deductive argument = proof ]
Message-ID<a3d46fdc-4e2d-43f8-90d7-f3b09f0b5f56n@googlegroups.com>
In reply to#35460
this is a theory group. get the hell out.

[toc] | [prev] | [standalone]


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

Back to top | Article view | comp.theory


csiph-web