HN user

ghratch

15 karma
Posts2
Comments7
View on HN

I hope this doesn't come across as snarky, but this is very apropos for me.

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

How is this better or different than incremental search? Incremental search means it jumps to the first match as soon as you start typing after '/': you don't need to press enter.

Try this combination of options to get functionality similar to emacs's C-s:

:set ignorecase :set smartcase :set incsearch

I find this extremely interesting. I'm a programmer who has had some mental block when it comes to "real math" (whatever that means). I'm very eager to change how I think about math to try to break through the mental barrier. Do you have any books or blogs or anything to recommend that reflect your change in thinking?

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.