mag487

7 ms·

1.
by mag487 12y ago
That code is doing a lot more than just layout and styling.
2.
by mag487 13y ago
It may be a useful sanity check to simulate the experiment multiple times to see the result: def choose_coin rand < 0.001 ? 1 : 0.5 end def flip_coin(coin) rand < coin ? :heads : :tails end def all_10_heads
3.
by mag487 13y ago
It's hard to imagine that even those could total more than a small fraction of the purported 500 MLOC. The JDK is only a few million lines of code.
4.
by mag487 13y ago
I'm having a really hard time believing that figure.
5.
by mag487 13y ago
Why would having multiple cores make the event loop cycle faster? Maybe I misunderstood and he was using "Moore's law" to refer to exponential increase in processor speed rather than transistor density (which is what I unders
6.
by mag487 13y ago
Yes, but that doesn't give you a great way to deal with attaching and canceling multiple callbacks simultaneously. If you want to perform several independent asynchronous actions after some other operation finishes, you have to collect
7.
by mag487 13y ago
That's a really good point. I hadn't been completely sold on the value of promises over callbacks before, but this seems like a very unambiguous advantage. I can't think of an obvious, clean way to do this with callbacks that
8.
by mag487 13y ago
How's that? JS is single-threaded.
9.
by mag487 13y ago
I haven't really studied algorithmic information theory, but I'd assume that Kolmogorov complexity isn't defined for uncomputable/undefinable numbers. Or maybe it's defined as "infinite," but either way, m
10.
by mag487 13y ago
There's only a countable number of formulas of ZFC. Therefore, there's only a countable number ways of writing out a formula of ZFC that uniquely specifies a real number. Therefore, only countably many real numbers exist that have
11.
by mag487 13y ago
The key phrases there are "almost surely" and "most irrational numbers." There are irrational numbers like pi which can be defined algorithmically, but taken together as a set they have zero Lebesgue measure. (In fact, t
12.
The Classic Buffer Overflow Attack(blog.8thlight.com)
2 points by mag487 14y ago|0 comments
13.
by mag487 14y ago
I wouldn't include their pricing structure as part of their marketing, though it doubtless attracts many users. (So do their algorithms, but those aren't included in their marketing, either.) And insofar as they have a reputation for giving
14.
by mag487 14y ago
It's an awesome motto that's served them extremely well. Google's ability to frame themselves as the "good guys" is the only real marketing advantage they have.
15.
by mag487 14y ago
I don't see how he's being scapegoated. What failure is he being held personally responsible for?
16.
by mag487 14y ago
Not trying to defend the viability of FB ads here, but this analysis seems a little shallow. Falling within a certain demographic may not "make" you click an ad, but the same could be said of performing a search on Google. If circumstance Y
17.
by mag487 14y ago
I agree with the author that getting a ridiculously generous counter offer is a red flag about the company's management, and this alone constitutes a reason to reject the proposal. However, his moral indignation at the thought of being paid