Pickens writes "MIT Computer Scientist Scott Aaronson has an interesting post on how to improve Wikipedia's coverage of theoretical computer science. Aaronson writes what while Wikpedia will never be an ideal venue for academics because "we're used to (1) putting our names on our stuff, (2) editorializing pretty freely, (3) using "original research" as a compliment and not an accusation, and (4) not having our prose rewritten or deleted by people calling themselves Duduyat, Raul654, and Prokonsul Piotrus," he identifies twenty basic research areas and terms in theoretical computer science that are not defined on Wikipedia and invites readers to write some articles about them. Article suggestions include property testing, algorithmic game theory, derandomization, sketching algorithms, propositional proof complexity, arithmetic circuit complexity, discrete harmonic analysis, streaming algorithms, and hardness of approximation. One writer suggests that professors should encourage students to improve the Wikipedia articles about topics they are studying. "This will help them understand the topic and at the same time improve Wikipedia.""