1 karma · joined June 5, 2024
Beautiful W
<span class="kern">
eb
</span>
Type
It would be nice to just see what they look like without all that hackery, since no one is going to do that ever in real life.I think the suggestion was that the time taken to secure their networks shouldn't be counted as "damages", just something that needed to be done regardless.
And that's unfortunate because we're all so plugged in and used to doing great things and solving problems by way of posts, uploads, and comment threads. Just some off-the-cuff thoughts as well.
I did think the drawing bit was cool though.
Well, supporters of net neutrality say there is not a need, and that this is just ISPs being greedy.
My pet theory on why they've have been able to argue their case effectively: internet traffic (or at least some notion of "website popularity") follows a distribution with a long tail, meaning a small number of sites will always be responsible for a large % of traffic; this makes it easy and attractive for ISPs to target a few players for "protection", because it's easy for them to make the fallacious claim "hey, look Netflix is taking up X% of our bandwidth; that's not fair!" when this doesn't have much to do with Netflix per se, and when that scenario is actually much cheaper (because of caching, etc) to handle than a hypothetical one in which the same traffic is distributed more evenly.
http://en.wikipedia.org/wiki/Peterson%27s_algorithm#Progress
are enough to guarantee system-wide progress. Can you elaborate?
Edit: Nevermind. So of course we'd need the critical section and thread-coordination mechanism to be a single atomic operation for this to be a lock-free algorithm. I should RTFA.
I don't know either, but Peterson's Algorithm is a mind-melting and elegant way to achieve mutual exclusion for two threads, using reads and writes (and in reality probably some barriers), generalizable to N threads.
http://en.wikipedia.org/wiki/Peterson%27s_algorithmThis is absolutely true. The rest of the article is random observation that explains very little.
https://mobile.twitter.com/nntaleb/status/456844260328083456
http://hackage.haskell.org/package/monad-par-0.3.4.6/docs/Co...
Others have given lots of good views on the various upsides to using haskell, especially the ways in which the type system can catch bugs for you. But my favorite thing about the type system is it lets you create good abstractions. For example it's possible (and often quite easy) to create a library which cannot be used incorrectly. And because you finally have abstractions which are good (not brittle or leaky) you can build on them to create larger abstractions (by "abstraction" here, think: conceptual unit that is easy to reason about). And that's also one of the challenges with learning haskell: there's more to learn because we can create new abstractions that are worth learning.
I like talking about haskell, but certainly won't presume to tell you you should learn it. But if you want to learn and are put off by what you've seen of it on HN for whatever reason, I can tell you that the community is incredibly generous and full of very kind and smart folks (though some humility and an open mind, as always, will get you far). The community is why I actually have something of a career in software today.
I made a little simulation of the former algorithm here
What is that supposed to mean?
http://www.reddit.com/r/haskell/comments/1sh67u/the_reason_w...
Anyway, you seem pretty [sure](http://www.idlewords.com/2005/04/dabblers_and_blowhards.htm) of your opinion so it's probably not worth further discussion.
Wtf? That's not how taxes work, guy.