News for hackers. Stuff that matters.
Re:Surprisingly Turing-Complete by duaneb on Friday October 02, 2015 @01:05PM (#10319762)
> Namely the impossibility to solve Halting problem.

Also the possibility to compute anything possible computing with a turing machine. The fact that you can embed this logic into a style description language accidentally is a meme worth propagating, in my opinion.

There are no comments on this comment yet.