Re:Xkcd: Travelling Salesman Problem
by parker on Friday March 21, 2008 @02:02PM
(#142629)
This proves without a doubt that selling online solves np-hard complexity. And you don't even need a Turing Machine.
[ Parent
| on HN ]
Re:Xkcd: Travelling Salesman Problem
by ivankirigin on Friday March 21, 2008 @04:48PM
(#142776)
The reviews on ebay are turing complete. You might think people are giving over the top reviews with their "A+++++++++", but that's just unary notation.