Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Yuval Filmus earned this badge 12 times |
mar 29 at 12:02
Why is $n \log \log n$ not tightly bounded by $n$?
feb 20 at 5:32
Why does a recurrence of $T(n - 1) + T(n - 2)$ yield something in $\Omega(2^{\frac{n}{2}})$?
feb 2 at 6:15
Practical importance of Turing machines?
jan 7 at 13:17
Roman Number is ambiguous language?
jan 1 at 2:23
Does P != NP imply that | NP | > | P |?
dec 12 at 12:55
Can there be a perfect chess algorithm?
sep 23 at 19:37
Is busy beaver the fastest growing function known to man?
sep 10 at 5:48
Value of constants in Big Theta notation
apr 26 '12 at 9:24
“Dense” regular expressions generate $\Sigma^*$?
