Is a program just good compression of a lookup table? Mandelbrot thread continues
michael_timbs · x · 2026-10-06
Continuing the computational irreducibility thread, michaeltimbs asks: if you know AB you needn't run anything, but for a program computing AB for all constrained inputs generated by another system, isn't the program (and running it) the most efficient representation of the answer — e.g. the Mandelbrot set?
He pushes further: in theory you could build a lookup table for all input→output pairs as a substitute, so is the program actually doing anything beyond being good compression?
Related event: Mandelbrot Set Sparks Debate on Computational Irreducibility(2 posts)→
More from Research
- Kyutai's 100M PocketTTS trains with Kaiming He's Drifting, WER under 1% — serrjoa · 2026-10-06
- Google's SHIFT Builds Per-Query Multi-Agent Harnesses, Beats 17 Baselines by 7.2 Points — google · 2026-10-06
- Diagnosing LLM Math Reasoning: Discovery Is the Bottleneck, and It's Fixable — TexasAMUniversity · 2026-10-06
- RealtimeWAM: One-Step Asynchronous World Action Model Delivers 25x Speedup with <1% Accuracy Loss — NanyangTechnologicalUniversity · 2026-10-06
- OmniConfess: Training-Free Token-Level Confessions Mitigate Omni-Modal Hallucination — Huiqiang Rong · 2026-10-06
- ADSD Framework Uses Auto-Diagnosis to Cut Numerical Solver Error by 71x — Peter Chen · 2026-10-06