It's a bit of a nitpick, but solving sudoku is not NP complete - there are algorithms that solve Sudoku in O(1) time. It's easy if you consider that there are no variables in the problem.
Now, I'll grant that the *generalization of sudoku-like games to arbitrarily sized boards* is NP-complete, but those are not Sudoku.
Indeed, I thought this was how most quantum mechanics (is that right - a practitioner of mechanics is a "mechanic") interpreted it. I thought "random" and "uncaused" were just shorter and easier to talk/write about than "possibly caused, but by events on such a small scale that they cannot be detected due to that damn Heisenberg uncertainty principle."
Slashdot Mirror
It's a bit of a nitpick, but solving sudoku is not NP complete - there are algorithms that solve Sudoku in O(1) time. It's easy if you consider that there are no variables in the problem. Now, I'll grant that the *generalization of sudoku-like games to arbitrarily sized boards* is NP-complete, but those are not Sudoku.
Indeed, I thought this was how most quantum mechanics (is that right - a practitioner of mechanics is a "mechanic") interpreted it. I thought "random" and "uncaused" were just shorter and easier to talk/write about than "possibly caused, but by events on such a small scale that they cannot be detected due to that damn Heisenberg uncertainty principle."