"Computers, once vilified and now championed, were constant in one thing: They amplified the virtues and deficits of the system that implemented them." The Tangled History of Soviet Computer Science. [more inside]
Mario AI - "Mario's inner emotive states cause behavior-determining drives. For example, Mario will collect coins if he is hungry. Whereas, when he is curious, he will explore his environment and autonomously gather knowledge about items he does not know about yet."
3 female computer scientists held a Reddit AMA. You can totally guess what happened next.
Researchers at the MIT Computer Science and Artificial Intelligence Laboratory, Microsoft Research, and Adobe Research have presented a technique for reconstructing an audio signal by analyzing minute vibrations of objects depicted in video. For example, the method can be used to extract intelligible speech from video of a bag of potato chips filmed from 15 feet away through soundproof glass. [more inside]
Two of these Java class names from the Spring framework are made up. One of them is real. Can you guess the real one?
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)
Bret Victor: We often think of a programming environment or language in terms of its features -- this one "has code folding", that one "has type inference". This is like thinking about a book in terms of its words -- this book has a "fortuitous", that one has a "munificent". What matters is not individual words, but how the words together convey a message. Likewise, a well-designed programing system is not simply a bag of features. A good system is designed to encourage particular ways of thinking, with all features carefully and cohesively designed around that purpose.
Tiny Transactions on Computer Science ...the premier venue for computer science research of 140 characters or less.
Am I wasting my time organizing e-mail? A study of e-mail refinding. (single link academic paper in .pdf.)
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]
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]
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]
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.
A free computer-programming course on reddit. Click "prev" for more lessons. 113 lessons so far.