PNAS paper shows a tiny billiard-ball system is a universal computer — undecidability lives in two dimensions
eigensteve · x · 2026-09-11
A team publishing in PNAS demonstrates that a minimal billiard-ball system can run a universal computer: simple collision dynamics suffice to simulate any Turing machine, meaning undecidability already exists in dimension two. Timed amid the Navier–Stokes buzz, the authors frame it as a landmark for computational irreducibility in physical systems — mechanical systems can encode fully undecidable problems, not just chaos.
More from Research
- SlopCodeBench: Measuring how sloppy LLM-generated code really is — mitsuhiko · 2026-09-11
- Microsoft paper: read-only verification tools lift agent memory pass rate from 39% to 73% — dair_ai · 2026-09-11
- MIT Researcher Lands New Info Theory Result After 200+ Hours of Agent Work, 120 Pages to Review — blaizedsouza · 2026-09-11
- Yale NLP Releases IdeaAMBIG Benchmark Targeting Underspecified Research Ideas for LLMs — yale-nlp · 2026-09-11
- SAM-H uses SAM 2 masks for training-free homography tracking, +18.4pp on PlanarTrack — ducha_aiki · 2026-09-11
- Autoregressive vs Diffusion Training: The Data-Efficiency Math Behind Non-Causal Architectures — mgostIH · 2026-09-11