There are a lot of unsolved problems in complexity theory, but there are a few things we do know. We look at the Time Hierarchy Theorem, and also why the proof techniques don't transfer to P vs NP.

Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Zachary Greenberg, Elaine Chang, Brandon Chen
Music: Gravity Sound (   / @gravitysound  )

Twitter:   / ubehavior  

—

References:
P vs NP Playlist:    • P vs NP  
Exptime: https://en.wikipedia.org/wiki/EXPTIME
Time Hierarchy Theorem: https://en.wikipedia.org/wiki/Time_hi...
Baker-Gill-Solovay: https://www.quora.com/What-is-an-intu...
Oracles: https://en.wikipedia.org/wiki/Oracle_...
Relativization: https://ocw.mit.edu/courses/mathemati...
The Role of Relativization in Complexity Theory: http://people.cs.uchicago.edu/~fortno...

Lectures:
Time Hierarchy Theorem:    • Undergrad Complexity at CMU - Lecture...  
Why is P vs. NP Difficult?:    • Undergrad Complexity at CMU - Lecture...