2

I have always though that NP consists of problems solved in a non polynomial time by a deterministic Turing machine. Recently I discovered that NP classifies all the problems solved by a non deterministic Turing machine in polynomial time.

Do those 2 machines solve the same problems? Meaning, can a deterministic Turing machine solve the problems in NP with non polynomial time, and should I consider them equal?

Thank you in advance for you help!

Ceznex
  • 21
  • 1

1 Answers1

1

A non-deterministic machine is basically able to make a lucky guess at any time. There are situations where this doesn't actually help, so there are problems that take polynomial time with a non-deterministic Turing machine, but take the same time with a deterministic one.

Plus decision problems in NP cannot be solved in polynomial time on a non-deterministic Turing machine in all cases, but only in cases where the answer is "YES". If the answer is "NO", then the non-deterministic machine doesn't help.

gnasher729
  • 32,238
  • 36
  • 56