What will the P=NP proof look like? | Cal Newport and Lex Fridman

preview_player
Показать описание
Please support this podcast by checking out our sponsors:

GUEST BIO:
Cal Newport is a computer scientist who also writes about productivity.

PODCAST INFO:

SOCIAL:
Рекомендации по теме
Комментарии
Автор

Who says there has to be a proof of P=/=NP :) Gödel has shown us that sufficiently expressive theories contain true statements which are unprovable from inside of the system.

rydvalj
Автор

If SAT can be solved in polynomial time, NP would equal NP. If a Gröbner basis of <a specific polynomial depending on the specific SAT problem, x1^2+1, …, xn^2+1> because then the specific Boolean polynomial will have a zero in F2 iff the polynomial has a zero and this is facilitated by Gröbner bases. You check whether the constant polynomial f(x)=1 is in the ideal generated by what’s between <…> by “dividing” 1 by G (a Gröbner basis) to see if the polynomial has a zero which means the original SAT problem is satisfiable. However, Gröbner bases even in F2, the smallest field, are omega of 2^[number of variables]. So just checking every possibility would be just as cheap in the worst case scenario.

briantenneson
Автор

@Lex Clips im curious how the photo in the thumbnail relates to P=NP

michaelb
Автор

It is harder to claim the Millenium Prize for P=NP than to solve it! Prove you can solve any one problem, then that noone can stop it from continually solving back-to-back, thus P=NP. I have done, using magnets.

ChrisContin
Автор

I do not think i even have got the definition right but if it means that a problem whose solution can be identified quickly can also be solved quickly is wrong for sure, imagine you have a rock and you have to put it on the other side of the world, you can quickly know that the fastest path will be one using airplanes and trains, but it will take much longer than that to actually do it

Kaurenjalalifarahani
Автор

how can I do my phone they have camera

adelinaquijano
Автор

The proof of P=NP will be an algorithm that solves VCOV, Clique and 3SAT in polynomial time

ytpah
Автор

Donald Knuth is confident that P == NP.

aurinator
Автор

Maybe the proof is super simple But no one finds the proof, because everyone is looking for a difficult proof. .

reinerczerwinski
Автор

Our universe is to the power of 12 according to Kryon Not to the power of 10 that all theories are based on

lorimangold
Автор

Was this video about proving anything is possible?

MovieCritic
Автор

I swear when lex talks it sounds like his brain is full of sludge that action potentials are absolutely slogging through to get to the next neuron

gabethrg
Автор

Can the new discovery using microwaves to produce quantom time crystals improve developments in quantum computers? 😎👌

jamesrapp
Автор

PNP algorithmically, vs, modulo primes? #thecakeisalie

maxmatthews