Liste des Groupes | Revenir à theory |
Op 29.jun.2024 om 22:03 schreef olcott:The call from DDD to HHH(DDD) when N steps of DDD areOn 6/29/2024 2:44 PM, joes wrote:But a repeating state is not by definition an infinitely repeated state.Am Fri, 28 Jun 2024 14:28:20 -0500 schrieb olcott:>On 6/28/2024 2:18 PM, joes wrote:>Am Fri, 28 Jun 2024 12:53:46 -0500 schrieb olcott:On 6/28/2024 12:41 PM, joes wrote:Thanks for leaving the unanswered questions in place, though I’d
rather have you answer them.
Am Fri, 28 Jun 2024 12:05:18 -0500 schrieb olcott:On 6/28/2024 11:26 AM, joes wrote:Am Fri, 28 Jun 2024 10:25:36 -0500 schrieb olcott:On 6/28/2024 8:14 AM, joes wrote:Am Thu, 27 Jun 2024 12:30:38 -0500 schrieb olcott:Question still not answered.Why doesn’t the first recursive H return?To the caller DDD, which then returns to its own caller H0, which
returns „halting” to main… hold on.
>HHH(DDD)
simulates DDD that calls HHH(DDD) that simulates DDD that calls HHH(DDD)
that proves to the outer directly executed HHH that it must abort and
reject.How does it do that?Over your head. I have explained it too many times
and you just can't get it.
>
Technically it is called detecting a repeating state.
I don't mean "New Jersey, New Jersey".
>
In case of HHH we know it is repeated only twice.
But it is over olcott's head that two is different from infinite.
Les messages affichés proviennent d'usenet.