The purpose of this paper is to prove the following result: Theorem 1 For any real numbers r1, r2, 1 ≤ r1 2, there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterministic time complexity nr1 The computing devices are non-deterministic multitape Turing machines.