Kids In Vietnam Are Crazy Good At Programming - '11th graders in Vietnam are so good at programming that they could easily pass an interview at Google' (via)
posted by kliuless on Mar 27, 2013 - 63 comments

The collectible card game Magic: The Gathering is Turing complete. [more inside]
posted by jedicus on Sep 11, 2012 - 58 comments

Some (slightly generalized) classic Nintendo games are NP-Hard. [pdf] [more inside]
posted by albrecht on Mar 13, 2012 - 59 comments

Am I wasting my time organizing e-mail? A study of e-mail refinding. (single link academic paper in .pdf.)
posted by escabeche on Jan 16, 2012 - 49 comments

For twenty years, the fastest known algorithm to multiply two n-by-n matrices, due to Coppersmith and Winograd, took a leisurely O(n^2.376) steps. Last year, though, buried deep in his PhD thesis, Andy Stothers discussed an improvement to O(n^2.374) steps. And today, Virginia Vassilevska Williams of Berkeley and Stanford, released a breakthrough paper [pdf] that improves the matrix-multiplication time to a lightning-fast O(n^2.373) steps. [via] [more inside]
posted by albrecht on Nov 29, 2011 - 50 comments

Eleven Equations True Computer Science Geeks Should (at Least Pretend to) Know [more inside]
posted by Deathalicious on Nov 29, 2011 - 141 comments

Stanford has announced new online courses for January 2012. Like the three courses currently running (1,2,3), these courses are free, open to the general public, and have no required textbook (previously). [more inside]
posted by -jf- on Nov 22, 2011 - 28 comments

Stanford's 'Introduction to Artificial Intelligence' course will be offered free to anyone online this fall. The course will be taught by Sebastian Thrun (Stanford) and Peter Norvig (Google, Director of Research), who expect to deal with the historically large course size using tools like Google Moderator. [more inside]
posted by jeffburdges on Aug 6, 2011 - 38 comments

Russel Cox, one of the people behind Google's new programming language Go, has written a three part series on regular expressions. It's a nice mix of computer science theory, programming, and history: Regular Expression Matching Can Be Simple And Fast, Regular Expression Matching: the Virtual Machine Approach, and Regular Expression Matching in the Wild.
posted by chunking express on Mar 17, 2010 - 57 comments