User blog comment:Boboris02/MBOT/@comment-1605058-20161220212557/@comment-1605058-20161221212727

I have no words for the uncomputable example, so I will leave it aside.

As for the computable example, I don't see why it should be the case. By explanations in a comment below (more precisely, the one part saying "After you know what the value of that is,you set the k to have the definition for which m would give the biggest finite value for all other aspects of the system workig properly"), it seems that this formula should do something along the lines of: "for any \(k\), look at all the \(m\) which makes the part \(m=k+7\) true, and then output the largest such \(m\)". However, this cannot be right, since then there would be no "biggest finite m" for which it works. I personally don't see at which point the number \(n\) comes into the problem.