ConMotto writes "After an estimated 16 man-hour assembly effort, these are some of the first high-quality user photographs of the Thing-o-Matic 3D printer and completed component assemblies, released December, 2010 by MakerBot. The Thing-o-Matic is a commercial-supported open source 3D printer (similar to the RepRap), allowing hardware hackers to print their own 3D objects out of Lego-like plastic."
eldavojohn writes "Recent research on bumble bees has proven that the tiny bee is better than computers at the traveling salesman problem. As bees visit flowers to collect nectar and pollen they discover other flowers en route in the wrong order. But they still manage to quickly learn and fly the optimally shortest path between flowers. Such a problem is NP-Hard and keeps our best machines thinking for days searching for a solution but researchers are quite interested how such a tiny insect can figure it out on the fly — especially given how important this problem is to networks and transportation. A testament to the power of even the smallest batch of neurons or simply evidence our algorithms need work?"
There is one thing which really surprise me: Page 44 (so 47 of the pdf http://www.win.tue.nl/~gwoegi/P-versus-NP/Deolalikar.pdf) he gives a “succ” relations, but he stated before that he does not want any order. And he certainly can obtain an order with the succ relation and the least fixed point. And it is well known that you can compose LFP to obtain only one LFP, hence if it’s proof works, it should also works over structures with an order ! I do not state that it means that the proof is false, but if this works, it also implyes what look like to be a really strange corollary into finite model theory, because it would use a kind of locality which does not take care about the orders relation. (At least that is what I understand of it but it may also be because this small part is really close to what was my current research)
History will remember:
The pivotal P != NP conjecture was finally proved in 2010 by Vinay Deolalikar in a proof provided both in 10pt and 12pt font size.