NTM can answer NP problems in polytime.

• Say language L is in NP.

• Let V be a polytime verifier for L.

• Define Nondeterministic Turing Machine N as follows

• N: On input w of length n:

  • Nondeterministically choose a string c of polynomial length
  • Run V on < w, c >
  • If V accepts, ACCEPT
  • Else, REJECT

Previous slide

Next slide

Back to first slide

View graphic version