CAN HAS TURING COMPLEET?

LOLCODE has passed a milestone, with two independent implementations (working on an interim spec) have successfully run a Brainf*ck interpreter. As Brainf*ck is a Turing-complete language, an implementation of the language in another language is often taken as a proof of Turing-completeness. Many thanks to Arachnid and Didier for their efforts!