Please refer to the mystery M function problem on this page.
(defun m (i j k)
Let us look at the exit conditions for this recursive function ’m’. One of the exit conditions is when k equals zero. Now look at the recursive call. The recursive call fetches a value of k by replacing it with a call to ’m’ while decrementing k. As such k will reach 0, when it will return 1.
So it can be seen that the terminating condition of k equals zero returns 1 which is used as a value for k itself.
The evaluation will never terminate!
I am a polyglot software engineer specializing in shipping iOS and 3d scientific visualization applications.