Amoeba finds approximate solutions to NP-hard problem in linear time
https://phys.org/news/2018-12-amoeba-approximate-solutions-np-hard-problem.html This is intresting finding that Researchers have demonstrated that an amoeba (a single-celled organism) has unique computing abilities. The researchers found that an amoeba can find reasonable (nearly optimal) solutions to the TSP in an amount of time that grows only linearly as the number of cities increases. Traveling Salesman Problem (TSP) is an →