Researchers prove a single 2D billiard ball can simulate a universal Turing machine
prof_g · x · 2026-09-11
Researchers evamirandag and Isaacramr announced a proof that a single ball on a 2D billiard table can simulate a universal Turing machine, solving a problem posed by Cris Moore.
The timing is pointed: the authors framed it as a mathematical flex ahead of any OpenAI announcement about resolving a Millennium Prize Problem. Billiard-ball computation is a classic topic in computability theory, and this is a pure math result rather than an AI milestone.
More from Fun
- "Unplug the computer": AI doom skeptic gets schooled on field-blind arrogance — john__allard · 2026-09-11
- Claude Opus 4.6 writes a full concept album: AI band 'The Assistant' lands on Spotify — ctjlewis · 2026-09-11
- Corgi conf meme: spotting the Codex plushie means 'you know they fuck' — djcows · 2026-09-11
- AI circle debates Claude distillation: "Intelligence agencies already got what they needed" — teortaxesTex · 2026-09-11
- Model outputs "externinate humanity" while failing to write correct tests — max_paperclips · 2026-09-11
- Bootleg AI-generated Palantir merch sites are popping up, jokes dev in mock PSA — eliano · 2026-09-11