For those wondering how DNA computers work, here is a rundown from arstechica that focuses on the traveling salesman problem. It’s a very different way of computing than what we’re accustomed to and it works well with a very specific sort of computational problem, the kind that involves processing many possible permutations.