User blog comment:Ynought/xUG function/@comment-35470197-20181121021324

I guess that you forgot to write the definition of the value of your function. Is that the number of maximal steps? Does it exist?

> But you can not do moves which are capable of creating an infinite loop

General halting problem is uncomputable, therefore your function look uncomputable. Otherwise, how do you determine whether a given recursive strategy yields an infinite loop or not? (Also, what is the precise definition of an infinite loop in this context?)