That would be nice to add, indeed. I agree it can make things slower when loading a page but I think it is worth it, especially for the Math & Physics subforum, and the developer journals, as well as for articles which contain a lot of math (like the vector tutorials published a couple months ago).
It's really easy to implement, too, all I had to do on my website was paste the loading code into a header file and serve it with every page sent to the user, worked perfectly. There's no server load given everything is rendered by a remote CDN and then sent to the client directly. And as apatriarca says, the fact that only the formula is stored on the server makes this very future-proof.
PS: if this is done, please make [eqn] a MathJax tag (I think there is a way) or at least do a search & replace to convert them to dollar signs, I'd hate to see all the posts using [eqn] lost forever
Edited by Bacterius, 18 July 2013 - 02:26 PM.
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis