Given a total recursive function, can you always compute its fixed-point?
The proof of the recursion theorem is constructive: it gives you an algorithm to compute $n$ from $f$. See for example these notes of Rebecca Weber.