Are problems in NP decidable in polynomial time by NDTMs, or just recognisable?
The decision problems studied in computational complexity theory are all decidable. One cannot define the worst-case time complexity for Turing machines that may fail to halt.