P-NP-problem is the most important issue in computing theory and computational
complexity,Through her study has been defined and studied the ranks of other complexity such
ascoNP, PP, P ..
In this paper we have defined new complexity classes for polynomial time non deterministic
Turing Machine using prime and composite numbers for k-prime numbers.
