Clik here to view.
Solving an NP-Hard problem with Soap
What’s the minimum length of road needed to connect n cities? This combinatorics problem is NP-Hard (if you can find a polynomial time algorithm to solve it, then P=NP), and is therefore considered...
View ArticleClik here to view.
How Google’s Self Driving Car Works
IEEE Spectrum have an article describing some details of the Google autonomous vehicle project, much of the information is public for the first time. The article is here, but by far the best bit is the...
View ArticleClik here to view.
Patenting the impossible
Jean-loup Gailly (author of gzip!) dissects US Patent 5,533,051 on ‘compression of random data’. The title immediately raises suspicion as it’s impossible to compress truly random data. Anyone with a...
View ArticleClik here to view.
AI Challenge Post Mortem Article
The winner of the AI Challenge 2011 has posted a detailed description of their code. It’s worth a quick read and spells out the algorithms clearly, with example code in Java. Link.
View ArticleClik here to view.
Algorithm Measures Human Pecking Order
The MIT Technology Review has covered a fascinating paper that concludes : “The way people copy each other’s linguistic style reveals their pecking order.” Worth a read. Link. The original paper is...
View ArticleClik here to view.
The Value of Immediate Feedback
You may have heard of Bret Victor from his “Kill Math” project and the beautiful differential equation playground that he has created with his Interactive Exploration of a Dynamical System. It caused...
View ArticleClik here to view.
