Viewing profile — 36erhefg

What I don't get why would you have to explicitly invoke your right to remain silent, if the law says that you have the then.

These are interactive novels/games, similar to time travel books you might have read as a kid, but in an browser format. Here is a link that has a zip file with all the games: http…

What we're missing is a serious change in mentality. Internet Points/Karma and a different UI won't change that. We already have all the technology for such discussions, but no one…

Speaking of voting. I cannot find any terms of service for hacker news when you create an account. Can our information legally sold to advertisers?

Starting this month, Facebook will use them to track your visit to every Web page that displays the buttons--even if you don't click on anything. As far as I know Facebook has been…

archagon is making the hasty generalization combined with a biased sample fallacy.

Skipping the court system in case of disputes in favor of an arbitrage. Let's say a country established a law that prohibits smoking. A company conducting business there (selling c…

Don't call them the standards, if almost nobody is using them.

I mostly agree with you. The web itself is wholly incorrectly designed, or should I say evolved incorrectly. Instead of generic content that gets modified to individual users prefe…

Nice catch. They don't trigger according to the latest rules: 702.25d The phasing event doesn’t actually cause a permanent to change zones or control, even though it’s treated as t…

Fun fact. The deck size isn't limited by the rules in tournaments as long as you don't delay the game by shuffling/handling it. A deck with around a thousand cards would be quite a…

The procedure mentions that you need 43 Rotlung Reanimators. A magic deck can only have at most 4 copies of the same card. :-) How are the copies created? Shouldn't be too hard to …

I think there should be a word for not having this fear, since I think most of us shudder at the sight of those images.

Actually in the theoretical world, the cost is always O(1) because the hash function computation always takes constant time. You are restricting yourself to a machine model with bi…

That is not what we are measuring. We don't care about the cost of the comparison itself, as long as it stays the same for every element for a chosen key size, but the number of co…

How do you even fix that? Do you have to update every compiler so it checks the generate machine code for that problematic sequence and insert some nop's, or is there a way to upda…