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


Groups > comp.lang.c++ > #79002 > unrolled thread

Infinite recursion detection criteria (Please correct me if I am wrong)

Started byolcott <NoOne@NoWhere.com>
First post2021-04-17 09:17 -0500
Last post2021-04-18 13:21 -0500
Articles 9 on this page of 29 — 6 participants

Back to article view | Back to comp.lang.c++


Contents

  Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 09:17 -0500
    Infinite recursion detection criteria (Please correct me if I am wrong)(update) olcott <NoOne@NoWhere.com> - 2021-04-17 19:18 -0500
      Re: Infinite recursion detection criteria (Please correct me if I am wrong)(update) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-18 02:02 +0000
      Re: Infinite recursion detection criteria (Please correct me if I am wrong)(update) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-17 19:05 -0700
        Re: Infinite recursion detection criteria (Please correct me if I am wrong)(update) olcott <NoOne@NoWhere.com> - 2021-04-17 21:12 -0500
          Re: Infinite recursion detection criteria (Please correct me if I am wrong)(update) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-17 19:18 -0700
    Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 19:49 -0500
    Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 07:52 -0700
      Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 12:11 -0500
        Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 11:02 -0700
          Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 13:24 -0500
            Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 11:41 -0700
              Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 13:54 -0500
                Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 12:44 -0700
                  Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 14:53 -0500
                    Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 13:05 -0700
                      Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 15:07 -0500
                        Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 13:16 -0700
                          Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 15:37 -0500
                            Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-18 22:06 -0700
                              Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-19 09:49 -0500
                                Re: Infinite recursion detection criteria (Please correct me if I am wrong) wij <wyniijj@gmail.com> - 2021-04-19 09:12 -0700
                                  Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-19 11:50 -0500
    Re: Infinite recursion detection criteria (Please correct me if I am wrong) Bonita Montero <Bonita.Montero@gmail.com> - 2021-04-18 18:12 +0200
      Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 11:16 -0500
        Re: Infinite recursion detection criteria (Please correct me if I am wrong) Bonita Montero <Bonita.Montero@gmail.com> - 2021-04-18 19:33 +0200
          Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 12:35 -0500
      Re: Infinite recursion detection criteria (Please correct me if I am wrong) Real Troll <real.troll@trolls.com> - 2021-04-18 17:23 +0100
    Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-18 13:21 -0500

Page 2 of 2 — ← Prev page 1 [2]


#79081

Fromolcott <NoOne@NoWhere.com>
Date2021-04-19 09:49 -0500
Message-ID<z_-dnbKoUY7GBeD9nZ2dnUU7-IPNnZ2d@giganews.com>
In reply to#79071
On 4/19/2021 12:06 AM, wij wrote:
>>>> Y() is not at all any sort of simulator, you have this part backwards.
>>>> -- 
>>>> Copyright 2021 Pete Olcott
>>>>
>>>> "Great spirits have always encountered violent opposition from mediocre
>>>> minds." Einstein
>>>
>>> Therefore X() can only solve 'known instances', right?
>>>
>> X() can detect a when it is called in infinite recursion by Y() which is
>> an x86 function generated by a C compiler.
>>
> 
> So, the answer is yes. X() can only solve existing 'known instances' AND
> it also have to be an x86 function generated by a C compiler.

No, X() can solve an infinite set of instances where X() simulates Y() 
and can examine the execution trace of Y() in some machine language.

>> This is sufficient to refute the conventional halting problem
>> undecidability proofs.
>>
> 
> If you think so.
> https://en.wikipedia.org/wiki/Necessity_and_sufficiency
> 
>>
>> void Y(u32 P)
>> {
>>   int Input_Would_Halt = X(P, P);
>>   if (Input_Would_Halt)
>>     HERE: goto HERE;
>> }
>>
>> int main()
>> {
>>   X((u32)Y, (u32)Y);
>> }
>>
>>
> 
> I have been avoid mentioning the secondary issue that such codes are
> very type dependent, suspicious to pass real tests.
> 

I created that x86utm operating system and have been able to prove that 
my halt decider correctly decides the above case for six months now.

-- 
Copyright 2021 Pete Olcott

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

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


#79087

Fromwij <wyniijj@gmail.com>
Date2021-04-19 09:12 -0700
Message-ID<133056bf-a33f-4ec8-808e-cc13eeeac847n@googlegroups.com>
In reply to#79081
On Monday, 19 April 2021 at 22:49:19 UTC+8, olcott wrote:
> On 4/19/2021 12:06 AM, wij wrote: 
> >>>> Y() is not at all any sort of simulator, you have this part backwards. 
> >>>> -- 
> >>>> Copyright 2021 Pete Olcott 
> >>>> 
> >>>> "Great spirits have always encountered violent opposition from mediocre 
> >>>> minds." Einstein 
> >>> 
> >>> Therefore X() can only solve 'known instances', right? 
> >>> 
> >> X() can detect a when it is called in infinite recursion by Y() which is 
> >> an x86 function generated by a C compiler. 
> >> 
> > 
> > So, the answer is yes. X() can only solve existing 'known instances' AND 
> > it also have to be an x86 function generated by a C compiler.
> No, X() can solve an infinite set of instances where X() simulates Y() 
> and can examine the execution trace of Y() in some machine language.
> >> This is sufficient to refute the conventional halting problem 
> >> undecidability proofs. 
> >> 
> > 
> > If you think so. 
> > https://en.wikipedia.org/wiki/Necessity_and_sufficiency 
> > 
> >> 
> >> void Y(u32 P) 
> >> { 
> >> int Input_Would_Halt = X(P, P); 
> >> if (Input_Would_Halt) 
> >> HERE: goto HERE; 
> >> } 
> >> 
> >> int main() 
> >> { 
> >> X((u32)Y, (u32)Y); 
> >> } 
> >> 
> >> 
> > 
> > I have been avoid mentioning the secondary issue that such codes are 
> > very type dependent, suspicious to pass real tests. 
> >
> I created that x86utm operating system and have been able to prove that 
> my halt decider correctly decides the above case for six months now.

If your, or anyone's, claim (no one can legitimately refute, in your logic) can be verified
by physical machines, you do not need people's confirmation, because the claim is
supported by physical machines, no one can refute.
Publish it in some way is enough (like astronomers spot a comet or found some
strange physic phenomena).

> -- 
> Copyright 2021 Pete Olcott 
> 
> "Great spirits have always encountered violent opposition from mediocre 
> minds." Einstein

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


#79088

Fromolcott <NoOne@NoWhere.com>
Date2021-04-19 11:50 -0500
Message-ID<_MGdnWxxkut7KeD9nZ2dnUU7-IWdnZ2d@giganews.com>
In reply to#79087
On 4/19/2021 11:12 AM, wij wrote:
> On Monday, 19 April 2021 at 22:49:19 UTC+8, olcott wrote:
>> On 4/19/2021 12:06 AM, wij wrote:
>>>>>> Y() is not at all any sort of simulator, you have this part backwards.
>>>>>> -- 
>>>>>> Copyright 2021 Pete Olcott
>>>>>>
>>>>>> "Great spirits have always encountered violent opposition from mediocre
>>>>>> minds." Einstein
>>>>>
>>>>> Therefore X() can only solve 'known instances', right?
>>>>>
>>>> X() can detect a when it is called in infinite recursion by Y() which is
>>>> an x86 function generated by a C compiler.
>>>>
>>>
>>> So, the answer is yes. X() can only solve existing 'known instances' AND
>>> it also have to be an x86 function generated by a C compiler.
>> No, X() can solve an infinite set of instances where X() simulates Y()
>> and can examine the execution trace of Y() in some machine language.
>>>> This is sufficient to refute the conventional halting problem
>>>> undecidability proofs.
>>>>
>>>
>>> If you think so.
>>> https://en.wikipedia.org/wiki/Necessity_and_sufficiency
>>>
>>>>
>>>> void Y(u32 P)
>>>> {
>>>> int Input_Would_Halt = X(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> int main()
>>>> {
>>>> X((u32)Y, (u32)Y);
>>>> }
>>>>
>>>>
>>>
>>> I have been avoid mentioning the secondary issue that such codes are
>>> very type dependent, suspicious to pass real tests.
>>>
>> I created that x86utm operating system and have been able to prove that
>> my halt decider correctly decides the above case for six months now.
> 
> If your, or anyone's, claim (no one can legitimately refute, in your logic) can be verified
> by physical machines, you do not need people's confirmation, because the claim is
> supported by physical machines, no one can refute.
> Publish it in some way is enough (like astronomers spot a comet or found some
> strange physic phenomena).

I need to confirm that there are no gaps in my reasoning where an 
execution trace meets the above criteria and is not infinitely recursive.

> 
>> -- 
>> Copyright 2021 Pete Olcott
>>
>> "Great spirits have always encountered violent opposition from mediocre
>> minds." Einstein


-- 
Copyright 2021 Pete Olcott

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

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


#79031

FromBonita Montero <Bonita.Montero@gmail.com>
Date2021-04-18 18:12 +0200
Message-ID<s5hlpf$hn0$1@dont-email.me>
In reply to#79002
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!
STOP POSTING IN comp.lang.c/c++ !!!

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


#79032

Fromolcott <NoOne@NoWhere.com>
Date2021-04-18 11:16 -0500
Message-ID<-7qdnYOv2K_8xuH9nZ2dnUU7-RWdnZ2d@giganews.com>
In reply to#79031
On 4/18/2021 11:12 AM, Bonita Montero wrote:
> STOP POSTING IN comp.lang.c/c++ !!!

Since this <is> relevant to C/C++ you can simply STFU !

-- 
Copyright 2021 Pete Olcott

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

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


#79041

FromBonita Montero <Bonita.Montero@gmail.com>
Date2021-04-18 19:33 +0200
Message-ID<s5hqgh$mjg$1@dont-email.me>
In reply to#79032
> Since this <is> relevant to C/C++ you can simply STFU !

It isn't relvant specifically to C/C++, it is relevant to any
language. So stop posting here.

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


#79042

Fromolcott <NoOne@NoWhere.com>
Date2021-04-18 12:35 -0500
Message-ID<26KdnWSze9JZ8OH9nZ2dnUU7-bWdnZ2d@giganews.com>
In reply to#79041
On 4/18/2021 12:33 PM, Bonita Montero wrote:
>> Since this <is> relevant to C/C++ you can simply STFU !
> 
> It isn't relvant specifically to C/C++, it is relevant to any
> language. So stop posting here.
> 

KNOW !

-- 
Copyright 2021 Pete Olcott

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

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


#79034

FromReal Troll <real.troll@trolls.com>
Date2021-04-18 17:23 +0100
Message-ID<s5hmit$9m$1@gioia.aioe.org>
In reply to#79031
Did you use for loop to print all that crap?


On 18/04/2021 17:12, Bonita Montero wrote:
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!
> STOP POSTING IN comp.lang.c/c++ !!!


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


#79044

Fromolcott <NoOne@NoWhere.com>
Date2021-04-18 13:21 -0500
Message-ID<RsGdncgeEM4B5eH9nZ2dnUU7-YPNnZ2d@giganews.com>
In reply to#79002
On 4/17/2021 7:34 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> If a function X() is called by function Y() twice in sequence from the
>> same machine address of Y() with the same parameters to X() and the
>> execution trace shows no conditional branch instructions in Y() or
>> function call returns in X() then the function call from Y() to X() is
>> infinitely recursive unless X() stops it.
> 
> You mean like this:
> 
>    0x000055555555517d <main+0>:	endbr64
>    0x0000555555555181 <main+4>:	push   %rbp
>    0x0000555555555182 <main+5>:	mov    %rsp,%rbp
>    0x0000555555555185 <main+8>:	callq  0x555555555129 <Y>
>    0x0000555555555129 <Y+0>:	endbr64
>    0x000055555555512d <Y+4>:	push   %rbp
>    0x000055555555512e <Y+5>:	mov    %rsp,%rbp
>    0x0000555555555131 <Y+8>:	mov    0x2f15(%rip),%eax
>    0x0000555555555137 <Y+14>:	lea    0x1(%rax),%edx

It is this line-of-code that has the same effect as simulating a 
conditional branch using a jump table:
>    0x000055555555513a <Y+17>:	mov    %edx,0x2f0c(%rip)
>    0x0000555555555140 <Y+23>:	cltq
>    0x0000555555555142 <Y+25>:	lea    0x0(,%rax,8),%rdx
>    0x000055555555514a <Y+33>:	lea    0x2ecf(%rip),%rax
>    0x0000555555555151 <Y+40>:	mov    (%rdx,%rax,1),%rax
>    0x0000555555555155 <Y+44>:	callq  *%rax
>    0x000055555555515c <X+0>:	endbr64
>    0x0000555555555160 <X+4>:	push   %rbp
>    0x0000555555555161 <X+5>:	mov    %rsp,%rbp
>    0x0000555555555164 <X+8>:	callq  0x555555555129 <Y>

Simply restricting the model to the x86 architecture gets rid of this 
problem. Since my purpose is to prove that there is at least one case 
where a halt decider can correctly decide that it was called in infinite 
recursion discarding an architectural model is a reasonable choice.

This is the revised infinite recursion detection criteria:

If the execution trace of function X() called by 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 unless 
X() stops it.

When X() detects that its simulation of Y() meets the above criteria 
then X() can definitely stop simulating Y() to prevent its own infinite 
execution.


-- 
Copyright 2021 Pete Olcott

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

[toc] | [prev] | [standalone]


Page 2 of 2 — ← Prev page 1 [2]

Back to top | Article view | comp.lang.c++


csiph-web