Shrinking Blob Computes Traveling Salesman Solutions

Views - MIT Technology Review 2013-03-28


A blob of “intelligent” goo can compute solutions to one of the most famous problems in mathematics and produces a route map as well, say computer scientists.

The traveling salesman problem is one of the more famous challenges in mathematics. This is the problem of finding the shortest route for visiting a number of cities once and then returning to the place of origin.


From feeds:

#edutech » Views - MIT Technology Review


Date tagged:

03/28/2013, 15:36

Date published:

03/25/2013, 00:49