smussmann

In at least some religions, [part of] the definition of God is that he is the uncaused cause. Thomas Aquinas spends a lot of ink talking about this (there's a more accessible explanation at http://www.peterkreeft.com/topics/first-cause.htm, but I'm pretty sure you can find the originals on the Internet).

I was on a debate team in college, and understanding people talking at 200 to 300 wpm is a critical skill. Wired ran an interesting article on this phenomenon a few years back: http://www.wired.com/2012/01/ff_debateteam/

There's a setting for this! Chrome allows you to deny all notifications requests automatically, without even a prompt coming up.

See https://support.google.com/chrome/answer/3220216 for the method.

For mobile, I've found ddg.gg much shorter to type than duckduckgo.com, and it redirects to the same place, so maybe that's a solution.

I don't have anything for the latency, though.

That article only mentions Pittsburgh once, to say that that's where Duolingo is based.

I searched and couldn't find articles about Duolingo moving out of Pittsburgh, although they did recently move to a bigger office in Pittsburgh: http://www.bizjournals.com/pittsburgh/blog/innovation/2013/0...

I expect the reason Google is doing this is to be able to control the rate at which they allow people onto the infrastructure behind the new service. Going from internal testing to everyone on the Web using a service can be pretty rough.

[Disclosure: I work for Google, but not on anything related to Inbox or Gmail]

Somewhat off-topic, but on https://trello.com/enterprise, you say that you provide "24 x 7 x 365 incidence response" where I think you mean "24 x 7 x 365 incident response".

Yeah, I think I was just confused. An off-by-one error in applying negatives, I think.

Thank you for the article. I found it interesting to think about.

> There are lots of properties by which one can evaluate a hash function, but the most important are preimage resistance (if I give you a hash, can you find an input with that hash value?), second preimage resistance (if I give you a message, can you find another that hashes to the same value?) and collision resistance (can you find two messages with the same hash?). Of those, the third appears to be much harder to meet than the first two, based on historical results against hash functions.

To my (crypto noob) eyes, it seems like second preimage resistance is just a specific case of collision resistance. In both, we're trying to find two messages that have the same hash value, but with collision resistance, we can choose the first one arbitrarily. The last sentence, saying that collision resistance is a higher barrier than second preimage resistance, thus doesn't seem to make much sense to me. What am I missing?