A Turing machine that has a finite number of tapes,
each tape having a tape head that can move independently. Such machines have the
same computational power as single-tape Turing machines. Consider a multitape
Turing machine T. If for no input word of length n does T scan more than L(n)
cells on any tape then T is said to be an L(n) tape-bounded Turing machine. If
for no input word of length n does T make more than T(n) moves before halting
then T is said to be a T(n) time-bounded Turing machine.