====== CAN HAS TURING COMPLEET? ======

LOLCODE has passed a milestone, with two independent implementations (working on an interim spec) have [[http://forum.lolcode.com/viewtopic.php?id=51|successfully run]] a [[http://en.wikipedia.org/wiki/Brainf*ck|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 [[http://www.lolcode.com/implementations/lolcode.net|Arachnid]] and [[http://www.lolcode.com/implementations/lmao|Didier]] for their efforts!