Complexity theorist: AI can't escape eternal lower bounds like the O(n log n) sorting limit
mboehme_ · x · 2026-10-25
Theoretical computer scientist mboehme argues that complexity lower bounds — e.g., no algorithm sorts numbers faster than O(n log n) in the worst case — apply forever regardless of technology, people, or policy, and that's what he considers fundamental research. He adds that even with a 'magic box' that can generate proofs, insight must precede application: you first need a relevant conjecture before the box can prove (or fail to prove) it. A sober take on where math and theoretical research stand in the AI era.
Related event: Researchers debate ephemeral vs eternal research questions in the AI era(11 posts)→
More from AGI Musings
- Leslie Lamport's "Claude, make no mistakes" hailed as predicting LLMs 30 years early — akbirthko · 2026-10-25
- A 3-year AI pause could buy 1000 years of safety work — or just 41, critics model — gleech · 2026-10-25
- Cambridge lecturer's decade-long poll: demand for 'Uber for personal security' near zero, now shifting — SamuelAlbanie · 2026-10-25
- Fully automation-first: Shulman's view says explosive growth only comes after humans leave the loop — abhiadesai · 2026-10-25
- "AI is an iron man suit, not a replacement": taste and 1000s of iterations make great games — TAbrodi · 2026-10-25
- Jack Dorsey says "there is no moat" in latest AI-skepticism jab — msg · 2026-10-25