Scott Aaronson discusses his recent podcast appearance, which touched upon the "Mathacre," the firewall paradox, and computational complexity. He also highlights a "Polylog" YouTube video explaining Busy Beaver values and mentions an upcoming conversation with Brian Greene. Aaronson notes that an OpenAI model has reportedly refuted the Exponential Time Hypothesis by finding an algorithm to solve 3-SAT. AI
IMPACT An OpenAI model's reported refutation of the Exponential Time Hypothesis could significantly alter the landscape of computational complexity research.
RANK_REASON Blog post discussing AI topics and a reported model result, not a primary release or significant industry event.
Read on Mastodon — mastodon.social →
- 3-satisfiability problem
- BB(5)
- Brian Greene
- busy beaver
- Columbia University
- computational complexity
- exponential time hypothesis
- firewall paradox
- integrated information theory
- Mathacre
- New York City
- .openai
- Polylog
- second law of thermodynamics
- The Big Bang Theory
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →