All Turing-complete programming languages (i.e. the encoding used for the Turing machine's instructions) can be compiled into a "universal" language, and the le

All Turing-complete programming languages (i.e. the encoding used for the Turing machine's instructions) can be compiled into a "universal" language, and the length of the compiler is a constant. So the choice of language affects only a constant factor, and can be hand-waved away when speaking of asymptotic complexity.