[jjjjjosh]

Just to add: NP actually stands for "non-deterministic polynomial," meaning that if we had non-deterministic computers (like the NFAs you may remember from Automata Theory that can explore several different possibilities simultaneously) those types of computers could solve problems in NP in polynomial time.

[yuvadam]

Non-deterministic Turing Machines, specifically. NFAs are obviously much weaker.