"the inability or decreased ability to see color, or perceive color differences, under lighting conditions when color vision is not normally impaired", since now he perceives some black colors as violet.
Or they use the English Wikipedia - I'm from Denmark and I don't know anyone using the danish Wikipedia. Why use it if the same info is already available in another language you understand?
Very simplified stated, it means that the solution to a specific instance of the problem takes at least polynomial time to solve - i.e. there can never be an algorithm that can solve it faster. In NP the time it is Non-polynomial - i.e. it takes such a **** long time that it is not really considered feasible for n>15 or such.
So if you have a specific stack of pancakes, err... I mean bagels... And want to turn all the sides without sugar downwards with the flip method from the article - it takes NP time to figure out how to do it best - also longer than polynomial time.
The cool thing is that NP problems can be converted to other NP problems in polynomial time and thus if just one of them can be solved in P time that all of them cab be solved in P time (P=NP) - we just don't know how yet....
That might be, but the ombudsmen of the two EU countries Sweden and Denmark are following it up (http://macdailynews.com/index.php/weblog/comments /9832/), and they are very interested in what is going on with this in Norway. (Sorry, only have links about the last in danish)
Slashdot Mirror
"the inability or decreased ability to see color, or perceive color differences, under lighting conditions when color vision is not normally impaired", since now he perceives some black colors as violet.
Not quite. Black is not a color.
Or they use the English Wikipedia - I'm from Denmark and I don't know anyone using the danish Wikipedia. Why use it if the same info is already available in another language you understand?
Hmm.. Fairly liberal might be pushing it too far.. 4 of the top ten are from the somewhat socialistic Scandinavia.
Very simplified stated, it means that the solution to a specific instance of the problem takes at least polynomial time to solve - i.e. there can never be an algorithm that can solve it faster. In NP the time it is Non-polynomial - i.e. it takes such a **** long time that it is not really considered feasible for n>15 or such. So if you have a specific stack of pancakes, err... I mean bagels... And want to turn all the sides without sugar downwards with the flip method from the article - it takes NP time to figure out how to do it best - also longer than polynomial time. The cool thing is that NP problems can be converted to other NP problems in polynomial time and thus if just one of them can be solved in P time that all of them cab be solved in P time (P=NP) - we just don't know how yet....
...Btw. does anyone use IronPyhton and F#, or they just look good in PR blurbs?
Yes, though just for the fun of it and not in production code (I would like to but am not allowed)...
ObiWanStevobi and Marvin isn't too far from each other anyway. But, I am happy to see that Slashdot got some intergalactic attention by now.
That might be, but the ombudsmen of the two EU countries Sweden and Denmark are following it up (http://macdailynews.com/index.php/weblog/comments /9832/), and they are very interested in what is going on with this in Norway. (Sorry, only have links about the last in danish)