my question regards the definition : "A language is in NP if there exists a DETERMINISTIC Turing Machine that verifies the language"
Does that definition correct ? should the verifier be a DETERMINISTIC Turing Machine ?
And if so, my problem is that the Not-Deterministic TM will simulate all options in 2^n time, which is exponential and not polinomial
I will be happy to get some explanations