question: A language solved in quadratic time implies the use of what type of Turing machine?
sentence: For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of single-tape Turing machines.