¹Strictly speaking, this depends on ones input and output conventions. For example, a Turing machine that used the same tape for both input and output might be able to “compute” the identity function by simply halting immediately, but in any case, the length of the output string would be bounded by n + p(n), where n is the length of the input string and p(n) is a polynomial bound on the running time.