P=NP?

This lecture is an informal introduction to the P=NP question in computer science: are nondeterministic polynomial time problems (NP) the same as polynomial time problems (P)? We describe what these terms mean, give a brief history, and examine some of the arguments for and against this question.
The obfuscated C contest mentioned in the video can be found here: www.ioccc.org/
The book mentioned is "Computers and intractability A guide to the theory of NP-completeness" by Michael R. Garey and David S. Johnson, which is recommended for further reading.
Correction: Kyla should be Kayal (in the Agrawal-Kayal-Saxena primality test).