AI Settles a 25 Year-Old Problem We Left Behind
The answer finally arrived, perhaps because I was one of the last few to ask the question and the first to prompt the machines to solve it 😊The result: you send N bits through an N×N Gaussian wireless channel, and the receiver must recover all of them exactly. It has been known since the 2000s that it is information theoretically possible to do so when the signal-to-noise ratio is at least 2 log N. But the only method known to reach that was an exponential search algorithm.
- ▪The answer finally arrived, perhaps because I was one of the last few to ask the question and the first to prompt the machines to solve it 😊The result: you send N bits through an N×N Gaussian wireless channel, and the receiver must recover
- ▪It has been known since the 2000s that it is information theoretically possible to do so when the signal-to-noise ratio is at least 2 log N.
- ▪But the only method known to reach that was an exponential search algorithm.
Hacker News (AI / LLM) files mainly under ai. We currently carry 4,117 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | X (formerly Twitter) |
| Canonical URL | https://twitter.com/DimitrisPapail/status/2086158118354887060 |
| Publication time | Sat, 08 Aug 2026 22:22:24 +0000 |
| Retrieval time | 2026-08-08T22:30:45.218Z |
| Last seen | 2026-08-08T22:30:45.218Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | q3e7mKo-lwCI · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Dimitris Papailiopoulos@DimitrisPapailAI Settles a 25 Year-old Problem We Left BehindLast week, GPT-5.6 and Claude Fable appear to have settled an open theoretical question in wireless communications that was intensely studied between 2000 till the 2010s and that I briefly worked on as an anxious first-year PhD student. The answer finally arrived, perhaps because I was one of the last few to ask the question and the first to prompt the machines to solve it 😊The result: you send N bits through an N×N Gaussian wireless channel, and the receiver must recover all of them exactly. It has been known since the 2000s that it is information theoretically possible to do so when the signal-to-noise ratio is at least 2 log N.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at X (formerly Twitter).
Discussion
0 commentsMore from X (formerly Twitter)
