The Formal Definition of P (P vs NP)

Let’s take a deeper look at the complexity class P, and decision problems.

Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Elaine Chang, Zachary Greenberg, Alex Egan

—

[UndefinedBehavior]

Hi everyone! The movies in the list are:

Blade Runner
Chinatown
Lives of Others, The
Lord of the Rings, The
Oldboy
Once Upon a Time in the West
Shawshank Redemption, the
Whisper of the Heart
Yi Yi
Your Name

I highly recommend them all!

[shubhamshinde]

If this channel gets famous, i just wanna say i was here from the beginning

[TheRulerofEarth]

I just found your videos and you're one of the greatest channels on YouTube.

[orbital]

The quality of these videos deserves a much larger audience! In any case, I have some suggestions for topics in theoretical computer science which might be deserving of videos:

* PCP theorem: any mathematical proof of length n can be transformed into a proof of length O(poly(n)) such that it is possible to probabilistically verify that proof by looking at only 3 bits (with O(log(n)) random bits).
* Chaitin incompleteness theorem: there exists some constant K such that for any number n it is impossible to prove that n has Kolmogorov complexity bigger than K (i.e. n cannot be produced by a Turing machine with size at most K).
* Kleene's recursion theorem and the application to quines: for any Turing complete programming language there exists a program which outputs its own source code.

[AroundWayOther]

Your videos are so well made and done. I really like them. Keep it up! CS theory is awesome

[Aker]

W for including "Your name" movie. Love that movie 😆

[eclipse-xlze]

Lol I was here since 4.9K subscribers and that was like a week ago this channel is growing fast

[algorithmsprogramminginter]

you deserve more subscribers, as do I.

[rashonmyeed]

Thanks very much, this helped me a lot!

[mostakinrabbi]

when will be the next p vs np problem uploaded?

[gwasoulja]

Let's say I do know n equals np we all know what that means if it does and if it does I would keep that new found knowledge to myself right because by doing that I have an advantage over the world so let's be honest do you think hackers have already found the solution to the problem or is it just good guessing

[mahamadousacko]

P=NP si P>0 et N=1;
P!=NP si P et N =0;