The language learning premise in this post is a bit ridiculous - if I started with the goal of learning a language and ended up worrying about the asymptotic complexity of my automated k-book recommendation algorithm for arbitrary values of k, then I think I should worry about a serious case of procrastination.
But the algorithms are interesting, so I think a better title would have been "why submodular NP hard problems are cool" or something similar.