StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Why P=NP does not imply that halting of Turing machine solvable in polynomial time?
Author | Votes | Δ |
---|---|---|
HugoRune | 3 | 0.00 |
Last visited: Sep 14, 2014, 5:07:29 AM