Uploaded November 2026 | Updated November 2026, 2 hours ago
David Friedberg explains on the All In Podcast how AI undid the Exponential Time Hypothesis and why this means computers can solve problems across the universe.
The exponential time hypothesis (ETH) is a foundational assumption in computational complexity theory. Proposed in 1999 by Russell Impagliazzo and Ramamohan Paturi (and elaborated with Francis Zane in 2001), it states that the 3-satisfiability (3-SAT) problem cannot be solved in subexponential time.
- - -
Watch the full All In episode:
youtu.be/2v8b062QzTI
Follow David Friedberg at:
x.com/friedberg
Learn more on how frontier labs are challenging Exponential Time Hypothesis:
techcrunch.com/2026/10/27/frontier-ai-labs-say-their-models-refuted-the-exponential-time-hypothesis-what-does-that-mean
David Friedberg explains on the All In Podcast how AI undid the Exponential Time Hypothesis and why this means computers can solve problems across the universe.
The exponential time hypothesis (ETH) is a foundational assumption in computational complexity theory. Proposed in 1999 by Russell Impagliazzo and Ramamohan Paturi (and elaborated with Francis Zane in 2001), it states that the 3-satisfiability (3-SAT) problem cannot be solved in subexponential time.
- - -
Watch the full All In episode:
youtu.be/2v8b062QzTI
Follow David Friedberg at:
x.com/friedberg
Learn more on how frontier labs are challenging Exponential Time Hypothesis:
techcrunch.com/2026/10/27/frontier-ai-labs-say-their-models-refuted-the-exponential-time-hypothesis-what-does-that-mean










