Review:
P
l
Some problems are provably decidable in
polynomial time on an ordinary computer
n
We say such problems belong to the set
P
n
Technically, a computer with unlimited memory
n
How do we typically prove a problem
Î
P
?