0

Can a non deterministic turing machine solve a non deterministic algorithm in polynomial time with good guessing. And if yes why or how? Also if not why not?

Vedad
  • 223
  • 4
  • 15
  • It depends on the algorithm, it can *by definition* be done for the class of algorithms that run in polynomial time on a non-deterministic Turing machine. That's not interesting at all, just a tautology. – harold Jun 21 '17 at 18:04
  • Let say the Algorithm can decide if a set of 1-Clausal is unattainable in time O(n^3*log(n)). Does that mean that the Algorithm can be solved in Polynomial time with a non deterministic turing machine. I mena it work in Polynomial time then it also should bepossible for a non det turing machine, but i need to know why it is so? In my example it is a Unification algorithm. – Vedad Jun 21 '17 at 18:16
  • 4
    I'm voting to close this question as off-topic because it's a theoretical Computer Science question. – Bernhard Barker Jun 21 '17 at 18:18

0 Answers0