gajomi

24 ms·

181.
by gajomi 14y ago
The author writes >This past week I was faced with a difficult problem. A really difficult problem... I kept going and in another hour or two, I was getting epiphany. I had the solution to my really difficult problem. I am happy that
182.
by gajomi 14y ago
A very interesting discussion, I think, even if its promoting some strange ideas. But I don't think enough was done to explain the success of English as the dominant scientific language, as a basis for comparison. The subtext is that it is
183.
by gajomi 14y ago
A very nice article. >A particular notorious example is the use of “It follows easily that” and equivalent constructs. It means something like this: >One can now check that the next statement is true with a certain amount of essenti
184.
by gajomi 15y ago
Haha, thanks for the warning. I am reminded of another time I ended up abusing the Landau notation in a numerical analysis class ( was it probability?) some years ago. The homework was to get and N^2log(N) algorithm of some kind, but I beca
185.
by gajomi 15y ago
I agree. Native access to legacy linear algebra functionality exposed by Numpy is the #1 reason this project seems exciting to me. I don't really care if the bulk of the code is O(10) slower so long as the numerical bits are O(1000) faster,
186.
by gajomi 15y ago
>Serious question: is there a game-theoretic name for this? From the view of evolutionary game theory he might be called a "neutrally fit cooperator" or "nearly-neutrally fit cooperator". In public goods games cooperators increase the a
187.
by gajomi 15y ago
I feel compelled to point out (as is done here http://michaelnielsen.org/blog/quantum-computing-for-everyon... ) that it is possible that no such explanation exists. My understanding is that most people doing theoretical research in quantu
188.
by gajomi 15y ago
I agree it sounds weird at first. On second thought, whether or not it is so strange depends on one means by "flight computers". For example, for something like logging or pre-flight checks the exact timing would matter that much, and it wo
189.
by gajomi 15y ago
And for a nice overview of how factor graphs, when considered generally, really can capture arbitrary dependencies I would check out "Extending factor graphs so as to unify directed and undirected graphical models" http://uai.sis.pitt.edu/
190.
by gajomi 15y ago
This link seems to be littered already throughout HN comments, but this article really reminded me of it: http://www.willamette.edu/~fruehr/haskell/evolution.html The remark on Dirac delta functions resonated with me, although I feel as i