3 ms·
Turing-completeness of programming languages is pretty irrelevant: different languages make some kinds of things easier or harder, support some idioms and disco
by _delirium 17y ago
Turing-completeness of programming languages is pretty irrelevant: different languages make some kinds of things easier or harder, support some idioms and discourage others, tend towards certain kinds of programming, etc. That's why programming in Haskell, Ruby, C, and asm are not all identical in practice, even though in theory any program written in one could be written in any other. And yes, they do support different kinds of computational creativity.
- Godhelpworld 17y agoYeah i know they are different but when one has created a bridge between two languages, disallowing it for some non nonsensical reasons of "computational creativity" seems utterly stupid to me!
- Godhelpworld 17y agoWhat if i wrote a haskell to C++ converter and Microsoft (Wait Apple already did that) banned it because it only wants you to use OO programmin!! Also we know that Haskell/Lisp/Scheme are more suited toward certain applications! Still do you agree that Haskell or Scheme is "bad" for IPAd just because it has a touch interface???