youtube.com/watch?v=6OPsH8…
What if we could run algorithms backwards? We discuss how we could do this by turning algorithms into circuits and encoding those into satisfiability problems. We then explain how it all connects to P vs NP.
#somepi 0:48 Satisfiability 2:15 Breaking RSA 8:46 General reductions to SAT 12:03 P vs NP Blog post:
vasekrozhon.wordpress.com/202...Code for the animations:
github.com/polylog-cs/np-… clip: 📷 • Will It Blend? - iPhone Richard Hladík: Script editor, animator Gabor Hollbeck: Video recording, video editor Václav Rozhoň: Writer, animator Václav Volhejn: Narrator, animator, script editor Thank you to our beta testers: Matěj, Honza, Filip Animations: manim, a Python library
docs.manim.community/en/stable/Color1 palette: Solarized
ethanschoonover.com/solarized/Music6: Thannoid by Blue Dot Sessions Pictures:
Intel 8008:
righto.com/2016/12/die-phd...
Stephen Cook: https://www.heidelberg-laureate-forum...
Leonid Levin:
cs.bu.edu/fac/Lnd/x
Richard Karp:
icsi.berkeley.edu/icsi/peV...
Mick Jagger, Keith Richards: Wikipedia
Hash function circuit:
academia.edu/download/311H...