AI solves 25-year-old open problem in wireless communications: polynomial-time algorithm found
DimitrisPapail · x · 2026-08-09
According to an article, GPT-5.6 and Claude Fable appear to have solved an open theoretical problem in wireless communications that was intensely studied from 2000 to 2010. The problem involves transmitting N bits through an N×N Gaussian channel and recovering them exactly; it was known to be information-theoretically possible but required exponential search, and now a polynomial-time algorithm has been proven.
More from Research
- AI will be superhuman at science regardless, and Europe can't opt out — teortaxesTex · 2026-10-16
- SERO augments long-horizon agentic RL with executable oracle continuations — Shanghai-AI-Laboratory · 2026-10-16
- Tsinghua and Amap propose OmniVerifier-C1, a graded verifier beating binary judges — Bowei Liu · 2026-10-16
- Alibaba open-sources MAI-Gym, an all-in-one GUI agent eval and RL training platform — Tongyi-MAI · 2026-10-16
- Peking University's SimForcing distills simulation motion priors into robot world models — PekingUniversity · 2026-10-16
- CoWorld Reasoner uses an evolving video world model as a visual reasoning engine — ModalityDance · 2026-10-16