Badge

 Enlightened First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.

Kaveh earned this badge 4 times
may 9 at 2:29
Why is this example a regular language?
apr 5 at 13:54
Are there subexponential-time algorithms for NP-complete problems?
feb 12 at 9:02
Why are there more non-computable functions than computable ones?
apr 1 '12 at 16:19
Knapsack problem — NP-complete despite dynamic programming solution?

Others with this badge