P, NP Problem and Turing Machines
Yes, a non-deterministic Turing machine can be converted into an equivalent deterministic Turing machine, but it is not known that if a polynomial time non-deterministic Turing machine can be converted into an equivalent polynomial time deterministic Turing machine. 

Note "equivalent" only means they accept the same language, it does not mean they run in the same time.