3 ms·
Very interesting. I don't think slime-molds are fast enough to build a useful NP-oracle, though.
by lucian1900 14y ago
Very interesting. I don't think slime-molds are fast enough to build a useful NP-oracle, though.
- pmiller2 14y agoMST is polynomial, so you can't use it as an NP oracle, anyway.
- hythloday 14y agoAnd the fact that the slime molds didn't create the same layout every time implies they don't provide an optimum answer.
- ganley 14y agoNot necessarily true. There could be multiple, equal-valued optima.
- pmiller2 14y agoExactly. Consider the case of all equal weights. In that case, every spanning tree is a MST. For the extreme cases (labeled complete graph, and a tree) of order n, those numbers are $n^{n-2}$ and 1, respectively, so the answer can be far from unique.