A Single Ball on a Billiard Table Can Theoretically Perform Any Computation
Mathematicians have shown that a single ball bouncing on a two-dimensional billiard table can theoretically perform any computation, a finding that strips computing power down to its most basic geometric essence. The research, published in the Proceedings of the National Academy of Sciences, demonstrates that the simple motion of one particle can simulate a universal Turing machine, the theoretical foundation of all modern computing.
Eva Miranda of the Polytechnic University of Catalonia in Spain and Isaac Ramos of ETH Zürich in Switzerland designed a mathematical billiard where the shape of the walls encodes the program, and the ball's trajectory carries out the algorithm. Their work is the culmination of years of effort to find the minimal physical system capable of universal computation.
“What is the minimal geometric mechanism that allows a physical system to do universal computation, and how can we detect it?” Miranda asks. “The billiard is the most demanding test of that process of simplification. A single particle. The whole program is inscribed in the geometry of the boundary.”
How a billiard table can act as a computer
A Turing machine, devised by British mathematician Alan Turing in 1936, is a mathematical model rather than a physical device. It consists of an imaginary tape divided into cells, a head that reads and writes symbols, and a set of instructions. Each step is simple: read, write, move, repeat. A universal Turing machine can simulate any other Turing machine, meaning it can perform any computation expressible as an algorithm.
In Miranda and Ramos's system, the ball's position encodes information, and the carefully designed boundary determines what happens next. As the ball travels, its trajectory advances the computation step by step, just as a Turing machine works through its instructions.
Previous models linking billiards to computation required multiple balls, three-dimensional structures, or moving walls. Miranda and Ramos stripped away all of that complexity, leaving only one particle moving in two dimensions between fixed walls.
“A billiard table that computes doesn't look like a computer. It looks like a badly drawn labyrinth, full of corners and arcs that seem like whims,” Miranda says. “The program is the shape of the walls. The algorithm is, literally, the trajectory.”
What are the limits of a billiard computer?
While the billiard can theoretically compute anything, it also inherits the fundamental limits of all computing systems, including the famous halting problem. Turing proved that no single algorithm can reliably determine whether every possible program will eventually finish or run forever.
The researchers designed their billiard so that a computation reaching its halting state corresponds to the ball hitting a wall at a 90-degree angle, sending it back along its path. If a computation never halts, the trajectory never repeats. An algorithm that could determine whether the trajectory would eventually repeat would solve the halting problem, which is impossible.
“Chaos imposes a barrier of precision; undecidability imposes a logical barrier,” Miranda explains. “Even if we know the equations and the initial data exactly, there may be no algorithm that decides whether a trajectory will ever enter a given region.”
She adds that individual cases often yield answers, but a universal method that settles every case cannot exist.
Why billiards matter beyond theory
Nobody will be replacing silicon chips with billiard balls. The construction is an idealized mathematical one, relying on information encoded at increasingly fine scales that could not be reproduced with unlimited precision in a physical table.
Yet these theoretical structures have practical value for physicists. The simple motion of a particle bouncing between boundaries can stand in for more complicated systems, from colliding particles in a gas to systems governed by steep confining forces.
“We could say they're a kind of skeleton of classical mechanics,” Miranda says.
That skeleton can even emerge in celestial mechanics, particularly in mathematical descriptions of close encounters between gravitational bodies, including variants of the notoriously difficult three-body problem. The work does not prove that the three-body problem itself is undecidable, but it raises the question of whether similar computational limits could appear in realistic gravitational systems.
“How many planets does it take for gravity to compute?” Miranda asks. “How many does it take for undecidability to appear? Maybe three, maybe five, maybe many more. It's a completely open question.”
Frequently asked questions
Can a real billiard table actually compute?
No physical billiard table can perform computations in practice. The mathematical model relies on perfect precision and information encoded at infinitely fine scales, which cannot be achieved with real materials. The result is a theoretical demonstration about the limits and nature of computation.
What is a universal Turing machine?
A universal Turing machine is a mathematical model that can simulate any other Turing machine. Since any algorithm can be expressed as a Turing machine, a universal one can, in principle, perform any computation that can be described algorithmically.
Why does the halting problem matter?
The halting problem, proven undecidable by Alan Turing, states that no algorithm can determine for every possible program whether it will finish or run forever. This result sets a fundamental logical limit on what computers can decide, regardless of their power or design.