5 ms·
A nice reminder that not all Turing-Complete things were created equal. Programming anything using these is a nightmare. (Except maybe the template / type syst
by Gormisdomai 9y ago
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)
- trentmb 9y agohttps://en.wikipedia.org/wiki/Turing_tarpit?wprov=sfla1 https://en.wikipedia.org/wiki/Turing_tarpit?wprov=sfla1
- MaxBarraclough 9y agoIf you treat these things as source languages, sure. 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.
- lmm 9y agoC++ templates are like programming in Haskell without a type system - all of the pain, none of the gain.
- crdoconnor 9y agoI consider this a reflection of https://en.wikipedia.org/wiki/Rule_of_least_power https://en.wikipedia.org/wiki/Rule_of_least_power
- joejev 9y agoWith enough wrapping, the templates can be okay to write. For example https://github.com/llllllllll/wired https://github.com/llllllllll/wired looks like a shitty lisp.
- BLanen 9y agoI want a Powerpoint LLVM compilation target.