Yes, time complexity is based on the length of the input to a Turing machine. For example, integer factorization is a hard problem because all known algorithms

Yes, time complexity is based on the length of the input to a Turing machine. For example, integer factorization is a hard problem because all known algorithms are roughly exponential in the number of bits.