ogdan

If f has small K complexity, then f^-1 has small K complexity.

For some background, see https://arxiv.org/pdf/1412.1897.pdf which has some cool visuals of pictures that make neural networks to strange things.

Looks like this group might have solved adversarial examples (or rather, found that they're not a problem in practice after all) for self driving cars!

Yann LeCun seems confident about it: https://mobile.twitter.com/ylecun/status/885384106418294784

You can use Tor to post to HN anonymously.

The specification is a lot smaller than the code, and so it's easier to read and manually verify that it's correct.

Here's a recent research paper discussing the security implications of typo tolerant authentication schemes: http://www.arijuels.com/wp-content/uploads/2016/07/CAAJ16.pd...