News for hackers. Stuff that matters.
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.
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.
Re:Xkcd: Travelling Salesman Problem by bkrausz on Friday March 21, 2008 @07:44PM (#142925)
Syntax error...you have an odd number of pluses :P