Single billiard ball theoretically performs any computation
Researchers show a ball on a specially encoded table can function as a universal Turing machine.
What to know
- A single ball on a spatially encoded billiard table can theoretically function as a universal Turing machine capable of performing any computation.
- The practical implications are severe: emulating AI would require millions of balls on frictionless surfaces running for decades to replicate milliseconds of computation.
- The finding illustrates how computational universality can emerge from physical systems, though with prohibitive real-world constraints.
The finding is intellectually interesting but practically useless given the computational overhead required.
-
“So if you want to emulate an ai you would need millions of balls on spatially encoded frictionless two dimensional surfaces clattering for decades to emulate milliseconds.”
laprice · Mastodon ↗
ScienceAlert Science journalism outlet
How it unfolded 1 development · click the chart to see its coverage articlesposts
-
1
ScienceAlert publishes billiard ball computation finding
ScienceAlert publishes an article describing theoretical research showing that a single ball on a billiard table can theoretically perform any computation.
“A Single Ball on a spatially encoded billiard table is able to serve as a universal turing machine.”
— laprice, Mastodon commenter · source -
first by ScienceAlert, 2d ago
-
L
A Single Ball on a spatially encoded billiard table is able to serve as a universal turing machine. So if you want to emulate an ai you would need millions of balls on spatially encoded frictionless two dimensional surfaces clattering for decades to emulate milliseconds. The Pachinko machine. https://www. sciencealert.com/a-single-ball…
-