Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Kaveh earned this badge 10 times |
may 9 at 1:44
Why is this example a regular language?
dec 13 at 10:49
Is there a “natural” undecidable language?
nov 20 at 2:10
Turing complete and computational power
may 18 '12 at 17:31
How not to solve P=NP?
may 14 '12 at 15:44
Are there NP problems, not in P and not NP Complete?
apr 22 '12 at 12:06
Sub language is not Turing-recognizable, or could it be?
mar 31 '12 at 23:14
Knapsack problem — NP-complete despite dynamic programming solution?
