Lecture 8 - Turing Machines P and NP Flashcards
1
Q
Alternative way to think of P
A
class of decision problems solvable by a Turing machine in polynomial time
2
Q
Alternative way to think of NP?
A
a class of decision problems solvable by a non-deterministic Turing machine in polynomial time
-> transitions are changed to allow different transistions rather than a single one
