³V has to be written carefully in order to have polynomial time-complexity according to our definitions. Namely, V cannot afford to read all of y from its incoming communication tape before checking the condition that |y|≤ q(|x|). Rather, it should compute m = q(|x|) first and then read y symbol by symbol, stopping and rejecting when it first discovers that |y| > m.