A nice reminder that not all Turing-Complete things were created equal. Programming anything using these is a nightmare.
(Except maybe the template / type system examples - I hear that's a lot like programming in Haskell)
(Except maybe the template / type system examples - I hear that's a lot like programming in Haskell)
Surely the point is that this stuff is possible at all. If you really wanted to program something meaningful using BGP hacks, you could build a compiler.