|Nice Answer||Answer score of 10 or more. This badge can be awarded multiple times.|
Aaron Sterling earned this badge 22 times
apr 16 at 8:24Automata Theory / Formal Language Thesis Topic
dec 25 at 4:41Ternary (and beyond) computation and quantum computing?
jan 15 '12 at 4:08Which algorithms are used most often in practice?
jan 13 '12 at 9:23Forbidden minors for bounded treewidth graphs
aug 21 '11 at 21:58List of TCS conferences and workshops
aug 14 '11 at 7:23Explain P = NP problem to 10 year old
jun 1 '11 at 6:33What videos should everybody watch?
may 15 '11 at 5:32Truly random number generator: Turing computable?
mar 16 '11 at 17:35Many-one reductions vs. Turing reductions to define NPC
dec 5 '10 at 23:34Hardness jumps in computational complexity?
nov 14 '10 at 8:47Advice on good research practices
nov 11 '10 at 17:49Why have we not been able to develop a unified complexity theory of distributed computing?
nov 8 '10 at 6:40DNA-algorithms and NP-completeness
oct 31 '10 at 1:36Writing universal recursive function
oct 29 '10 at 9:38Applications of TCS to classical mathematics?
oct 21 '10 at 16:35What videos should everybody watch?
oct 21 '10 at 14:14What videos should everybody watch?
oct 6 '10 at 16:14Surprising Results in Complexity (Not on the Complexity Blog List)
oct 2 '10 at 3:05What papers should everyone read?
aug 19 '10 at 20:24About recursion
aug 19 '10 at 16:29Major unsolved problems in theoretical computer science?
aug 18 '10 at 11:24Correspondence between complexity classes and logic