ghratch
I'm currently taking 6.856 at MIT, Randomized Algorithms, and one of the core lessons from the class is that random guessing is frequently a superior strategy. You can have Las Vegas algorithms which find a correct solution and probably execute quickly, or Monte Carlo algorithms which execute quickly and probably find a correct solution. The users are employing a Las Vegas strategy here.
So, perhaps he just didn't take the right classes at MIT :-).
For a neat example, check out finding a min-cut of a graph in a randomized fashion: http://en.wikipedia.org/wiki/Karger%27s_algorithm
Try this combination of options to get functionality similar to emacs's C-s:
:set ignorecase :set smartcase :set incsearch
The Architecture of High-Performance Parallel I/O [pdf]
The summations as for loops is what got my attention, as I am guilty of that. Also the idea of math as more manipulable than programming is intriguing.
It works without modifying the program (e.g. no recompilation step necessary) or the debugger (like gdb).