{"slug": "podcasts-about-the-topic-part-ii", "title": "Podcasts about the Topic: Part II", "summary": "An OpenAI model has refuted the Exponential Time Hypothesis by producing an algorithm that solves 3SAT in time scaling roughly like exp(n/√log(n)), according to a GitHub paper linked from Scott Aaronson's blog post. Aaronson, a computer science professor at the University of Texas at Austin, wrote that his students came to his office to report the result and that \"the endless buffet continues\" as researchers digest the finding. The claim, if it holds, would overturn a core assumption of computational complexity theory that no subexponential-time algorithm exists for 3SAT.", "body_md": "## [Podcasts about the Topic: Part II](https://scottaaronson.blog/?p=10239)\n\nThe title Curt put next to my head could’ve been in reference to many, many things! But sorry, he just mean AI.  He and I start with the [Mathacre](https://scottaaronson.blog/?p=10169), of course, but then we get onto the firewall paradox and then Curt starts asking about computational complexity and the Second Law, and then about [Integrated Information Theory](https://scottaaronson.blog/?p=1799).\n\nOK, despite the title of this post, short break from “The Topic.”  Here’s an [absolute masterpiece](https://www.youtube.com/watch?v=kMHCl2PGloQ) of mathematical exposition, from the “Polylog” YouTube channel, which tells the story of the determination of Busy Beaver values through spectacular animations.  I play cameo roles in the video, although I embarrass myself (as the video silently points out) by transposing two digits in the value of BB(5)…!\n\nAnd, coming soon (not on YouTube quite yet): a conversation about the Mathacre with celebrated physics popularizer (and character on *The Big Bang Theory*) [Brian Greene](https://www.briangreene.org/), recorded in-person in NYC during my recent trip to [speak](https://www.scottaaronson.com/talks/arewecooked5.pptx) in the math department at Columbia University!\n\nAnd to preempt the inevitable comments about it: **yes**, my students just came to my office to tell me that an OpenAI model has now [refuted the Exponential Time Hypothesis](https://github.com/openai/math/blob/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf), by giving an algorithm to solve 3SAT in an amount of time that scales roughly like exp(n/√log(n)).  Even as we struggle to digest the previous courses, the endless buffet continues!", "url": "https://wpnews.pro/news/podcasts-about-the-topic-part-ii", "canonical_source": "https://scottaaronson.blog/?p=10239", "published_at": "2026-10-26 22:03:37+00:00", "updated_at": "2026-10-26 22:11:48.562143+00:00", "lang": "en", "topics": ["artificial-intelligence", "ai-research", "large-language-models"], "entities": ["OpenAI", "Scott Aaronson", "Exponential Time Hypothesis", "3SAT", "University of Texas at Austin", "Brian Greene", "Columbia University"], "also_reported_by": [], "alternates": {"html": "https://wpnews.pro/news/podcasts-about-the-topic-part-ii", "markdown": "https://wpnews.pro/news/podcasts-about-the-topic-part-ii.md", "text": "https://wpnews.pro/news/podcasts-about-the-topic-part-ii.txt", "jsonld": "https://wpnews.pro/news/podcasts-about-the-topic-part-ii.jsonld"}}