μ-recursive (mu-recursive) function in a functional language?

The answer is, as far as I know, precisely what you gave. Iterate over all arguments until you hit one that returns zero. For functions of more than one argument, you diagonalize.

I.e. , (0,0), (1,0), (0,1), (1,1), (2,0), (2,1), (0,2), (1,2), (2,2), etc.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.