Skip to content
hackertubeai

Polylog

What P vs NP is actually about

About this video

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.

Keep your curiosity going.

A few more ideas from the same corner of the archive.

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

But what is a neural network? | Deep learning chapter 1

3Blue1Brown