The class NP is the class of languages that are accepted by a polynomial non-deterministic Turing machine NDTM. A NDTM have a corresponding deterministic Turing machine. Why is NP decidable but the definition stated accepted?
valid question