Avi Wigderson is the only person in history to have won both a Turing Award (computer science) and Abel Prize (math). I interviewed him all about his field. We discussed:
• His intuition on a proof of P vs NP
• Why we use SAT solvers for most NP problems
• Zero knowledge proofs and their impact
• Quantum computation and implications
• Math and computer science's relationship
Where to watch:
• YouTube: https://t.co/zViqAulFCo
• Spotify: https://t.co/iat08Xob17
• Apple Podcasts: https://t.co/jOYDGtGVnt
• Transcript: https://t.co/k4zS7yOhnw
Thank you to this episode's sponsors for supporting my work:
• WorkOS: makes your app Enterprise Ready with easy to use APIs to add SSO, SCIM, RBAC, and more in just a few lines of code, check them out at https://t.co/y8noBzFEem
Timestamps:
00:00 - Intro
01:08 - P vs NP
14:51 - What if you relaxed correctness
25:38 - Why NP complete problems are equivalent
30:33 - Space vs time complexity
43:06 - Why people use SAT solvers
45:53 - Randomness is a resource
55:48 - Randomness depends on computational power
01:21:20 - Zero knowledge proofs and their significance
01:38:30 - Quantum computation and why it matters
01:56:24 - Math vs computer science
02:08:16 - Major breakthroughs and his experience
02:12:31 - Advice for his younger self
02:14:48 - Outro
the future of machine learning is changing as we invent new ML algorithms that use LLMs as subroutines. See my talk "Theory and Modern Machine Learning" from Tuesday, at @SimonsInstitute at @UCBerkeley https://t.co/RkyGv42wXf