How E. coli solved the traveling salesman problem

The article explores an unusual biological approach to solving the classic traveling salesman problem, one of the most complex combinatorial challenges in mathematics. The author describes an experiment where researchers attempted to use living E. coli bacteria to find an optimal route among a vast number of possibilities. The traveling salesman problem requires finding the shortest path to visit a set number of locations, and as the number of addresses increases, the number of combinations grows exponentially, reaching quadrillions. Using biological systems for computation represents an intriguing intersection of biotechnology and computer science. The material details the logic of the experiment, its theoretical appeal, and the reasons why this method encountered significant limitations and ultimately failed to become a practical alternative to traditional algorithms. The article offers an in-depth look at unconventional approaches to solving computational problems.