User blog comment:Kyodaisuu/Mashimo function/@comment-1605058-20140706065714/@comment-1605058-20140707105806

Recursively inaccessible is admissible limit of admissibles.

But if we can compute BB(n) then we can solve halting problem. I used to believe that this is enough to compute CK[n]. It turned out to be incorrect, but it doesn't necessarily rule out possibility to reach CK*2.