English En
  • Deutsche De
  • English En
  • Français Fr
  • Русский Ru

We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our marketing and analytics partners who may combine it with other information you've provided to them or which they've separately collected from you. You also may to see our Privacy Policy. By clicking the OK button below, you accept our cookies.

Authors:

Because of the Turing completeness theory, everything one Turing-complete language can do can theoretically be done by another Turing-complete language, but at a different cost. You can do everything in assembler, but no one wants to program in assembler anymore.

Yukihiro Matsumoto