Construct a (multitape) Turing machine that inserts a portion of blank symbols into the tape. In configuration formalism it means that the machine transforms a configuration . . . [u#wq0#v] . . .to the configuration . . . [u#wq1# . . . #v] . . . . Here the symbol is the blank symbol of the TM, q0,q1 are states of the TM, the symbols #, [, ] are delimiters, the word w does not contain the delimiters, and the number of blanks inserted equals the length of the word w. Using this TM and a universal TM describe a TM that performs a parallel computation on all possible inputs, i.e. during the Nth stage the TM performs N steps of computation on the input 1, N 1 steps of computation on the input 2, and so on.