his paper restricts oracle Turing machine to query its oracle in an accepting computation, and obtains result: there exist infinite number of recursive sets A, B, A',B', A", B", A, B, which are not equivalent satisfying properties: P(A,q) =P(A,q+ 1 ), P(B,q ) ≠P(B,q+1)p(a',q)=P(A' ),P(B',q)≠P(B' ),NP(A",q) = NP(A",q + 1),NP(B",q) ≠ (B",q+ 1 ),NP (A,q) =NP(A), NP(B,q)≠NP(B).