All Turing complete programming languages are mathematically the same, they only differ in the way they do IO. You can't write a algorithm in C that cannot be w

All Turing complete programming languages are mathematically the same, they only differ in the way they do IO. You can't write a algorithm in C that cannot be written in Haskell or visa versa. If you had a universal representation language it would be no different than having C. As you say the difference is really how hard it is to solve certain problems plus the way they expose IO.