NP-Completeness | Richard Karp and Lex Fridman

[@fourhourlife8594]

I have a complexity and computability exam in about 2 hours. Let's get it!

[@samirshehadeh4739]

I got one in 2 hours also 😂

[@miguellorenzo3726]

I got one in three weeks! 😂

[@samirshehadeh4739]

Algorithmic complexity and computability II exam in 90 min let's gooooooo

[@samirshehadeh4739]

i failed hard.

[@lacasadeacero]

I have understood the idea is get a problem of complexity 2^n and solve it in n^k by other way. So i focus my time in rewrite a n^k problem in log(n) complexity. Of course if thats true i can solve 3-sat. But is weird the fact that 3-sat requires for me a continous model. Instead of a logical discrete model. So i think intuitively 3-sat is solvable but the model that solve the problem is always different and unique depending of the question and not an universal model. Becouse if the model was the same i could prove p=np

[@lashropa]

Riveting. Absolutely riveting.

[@codycast]

lol. Absolute snooze fest.

[@rinjuxe56]

It's still pending in 2 yrs

[@admarquis]

AND is the product and XOR is the mod2 addition, not OR. It's the Algebra of Boole, the real one. Logic has been canonically solved by Norman J. Wildberger, njwildberger on KZbin. He solved mechanically Propositional Logic. Have a look at his recent videos, his Boole-Mobius transform gives you a truth table instantly, he also solves the SAT problem beautifully. Its a shame nobody saw it before him 😊🙋‍♂️

[@jm.101]

Somethings shouldn’t be in podcast form. Just read about this kind of thing.

[@gonzales420]

to be or not to be