> By formal definitions, all 3 languages are Turing complete and can express programs of the same computational complexity. So is Brainfuck. Turing equivalenc

> By formal definitions, all 3 languages are Turing complete and can express programs of the same computational complexity. So is Brainfuck. Turing equivalence does not imply that languages are equally useful choices for any particular application.