Lex Fridman Podcast full episode:
Thank you for listening ❤ Check out our sponsors:
See below for guest bio, transcript, links, and to give feedback, submit questions, contact Lex, etc.
*GUEST BIO:*
Ankur Moitra, Steven Brunton and Alex Kontorovich are three mathematicians who can speak to this incredible moment in the history of mathematics, when AI solved some of its hardest problems: Navier-Stokes, the quasi-Riemann hypothesis, the unique games conjecture and hundreds of other problems. Ankur Moitra is a mathematician at MIT (visiting the Institute for Advanced Study in Princeton) working in theoretical computer science, who can speak to the unique games conjecture, complexity theory and the mathematics of how AI learns. Steven Brunton is a mathematician and fluid dynamics expert at UW, who can speak to Navier-Stokes, turbulence and machine learning for fluid dynamics. Alex Kontorovich is a mathematician at Rutgers specializing in number theory, who can speak to the Riemann hypothesis, Lean and machine-checked proofs.
*Transcript:*
*CONTACT LEX:*
*Feedback* – give feedback to Lex:
*AMA* – submit questions, videos or call-in:
*Hiring* – join our team:
*Other* – other ways to get in touch:
*EPISODE LINKS:*
Ankur’s Website:
Alex’s X:
Alex’s Website:
Steven’s X:
Steven’s YouTube:
Steven’s Website:
Lean:
*SPONSORS:*
To support this podcast, check out our sponsors & get discounts:
*Wispr Flow:* AI-powered voice dictation app.
Go to
*Fin:* AI agent for customer service.
Go to
*LMNT:* Zero-sugar electrolyte drink mix.
Go to
*Blitzy:* AI agent for large enterprise codebases.
Go to
*Shopify:* Sell stuff online.
Go to
*NetSuite:* Business management software.
Go to
*Perplexity:* AI-powered answer engine.
Go to
*PODCAST LINKS:*
– Podcast Website:
– Apple Podcasts:
– Spotify:
– RSS:
– Podcast Playlist:
– Clips Channel:
*SOCIAL LINKS:*
– X:
– Instagram:
– TikTok:
– LinkedIn:
– Facebook:
– Patreon:
– Telegram:
– Reddit:
source
Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=ZAzWPE9CItg
Thank you for listening ❤ Check out our sponsors: https://lexfridman.com/sponsors/cv10121-sa
See below for guest bio, transcript, links, and to give feedback, submit questions, contact Lex, etc.
GUEST BIO:
Ankur Moitra, Steven Brunton and Alex Kontorovich are three mathematicians who can speak to this incredible moment in the history of mathematics, when AI solved some of its hardest problems: Navier-Stokes, the quasi-Riemann hypothesis, the unique games conjecture and hundreds of other problems. Ankur Moitra is a mathematician at MIT (visiting the Institute for Advanced Study in Princeton) working in theoretical computer science, who can speak to the unique games conjecture, complexity theory and the mathematics of how AI learns. Steven Brunton is a mathematician and fluid dynamics expert at UW, who can speak to Navier-Stokes, turbulence and machine learning for fluid dynamics. Alex Kontorovich is a mathematician at Rutgers specializing in number theory, who can speak to the Riemann hypothesis, Lean and machine-checked proofs.
Transcript:
https://lexfridman.com/math-ai-crisis-transcript
CONTACT LEX:
Feedback – give feedback to Lex: https://lexfridman.com/survey
AMA – submit questions, videos or call-in: https://lexfridman.com/ama
Hiring – join our team: https://lexfridman.com/hiring
Other – other ways to get in touch: https://lexfridman.com/contact
EPISODE LINKS:
Ankur's Website: https://people.csail.mit.edu/moitra/
Alex's X: https://x.com/AlexKontorovich
Alex's Website: https://sites.math.rutgers.edu/~alexk/
Steven's X: https://x.com/eigensteve
Steven's YouTube: https://youtube.com/@Eigensteve
Steven's Website: https://eigensteve.com
Lean: https://lean-lang.org/
SPONSORS:
To support this podcast, check out our sponsors & get discounts:
Wispr Flow: AI-powered voice dictation app.
Go to https://lexfridman.com/s/wispr_flow-cv10121-sa
Fin: AI agent for customer service.
Go to https://lexfridman.com/s/fin-cv10121-sa
LMNT: Zero-sugar electrolyte drink mix.
Go to https://lexfridman.com/s/lmnt-cv10121-sa
Blitzy: AI agent for large enterprise codebases.
Go to https://lexfridman.com/s/blitzy-cv10121-sa
Shopify: Sell stuff online.
Go to https://lexfridman.com/s/shopify-cv10121-sa
NetSuite: Business management software.
Go to https://lexfridman.com/s/netsuite-cv10121-sa
Perplexity: AI-powered answer engine.
Go to https://lexfridman.com/s/perplexity-cv10121-sa
PODCAST LINKS:
– Podcast Website: https://lexfridman.com/podcast
– Apple Podcasts: https://apple.co/2lwqZIr
– Spotify: https://open.spotify.com/show/2MAi0BvDc6GTFvKFPXnkCL
– RSS: https://lexfridman.com/feed/podcast/
– Podcast Playlist: https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4
– Clips Channel: https://www.youtube.com/lexclips
SOCIAL LINKS:
– X: https://x.com/lexfridman
– Instagram: https://instagram.com/lexfridman
– TikTok: https://tiktok.com/@lexfridman
– LinkedIn: https://linkedin.com/in/lexfridman
– Facebook: https://facebook.com/lexfridman
– Patreon: https://patreon.com/lexfridman
– Telegram: https://t.me/lexfridman
– Reddit: https://reddit.com/r/lexfridman
I guess AI said hold my beer after this episode. If AI is monitoring my texts maybe an algorithm on picking lotto numbers. DM AI gods.
0:55 “ P=NP seems too difficult to make progress on”. Several days after the podcast aired, both OpenIA and Anthropic separately refute the ETH or exponential time hypothesis. Amazing!!!
Wll explained. Real engineering design optimzation is challenging because, optimizing takes a Design-of-Experiments of 'hundred of thousands of combination'. We he try do these prediction, they always fall flat, when we push limits on the design
AI will solve this before 2027
https://youtu.be/2ui2Tr5_WwM?si=Tq1WKb-sh6lyiU9y
It's not.
most who studies the question a bit know the real goal is not to solve P=NP but to prove how hard it is to prove P=/=NP, in this field a victory is proving that proving P=/=NP is harder than what we established before (im not joking), that's how hard the problem is.
Would love to see a follow up with this MIT professor in 6 months. ETH was just proven false. While proving or disproving P=NP is difficult. Perhaps there is another conjecture around NP Hard.
P vs. NP is rather easy.
That elocution is magnificent!
The negative is always drawing for an electron..
So, "NP forces P"
If AI eventually produces a proof of P vs NP, will we have systems capable of independently understanding and verifying every step, or will we simply be trusting a machine whose reasoning we cannot fully follow?
It is the lack of a wide and vast view of the whole field of maths. If it is not enough a Pi, then surely is "Polar", and you always have "cos, sin" etc. Riemann in a different view can be spotted as a huge spiral 3D shape like a galaxy with inner space objects orbiting (like in the spirograph), or if you just peak just one side of the whole picture, you get a building-like shape with protruding squared blocks which in fact are a low res part of the transversal orbits within this huge galaxy, this shape appear in many books by the way (politically interesting wow).
This guy speaks exactly in the cadence of Sean Carrol, it's crazy