Classical billiards can compute
By: Eva Miranda, Isaac Ramos
We show that two-dimensional billiard systems are Turing complete by encoding their dynamics within the framework of Topological Kleene Field Theory. Billiards serve as idealized models of particle motion with elastic reflections and arise naturally as limits of smooth Hamiltonian systems under steep confining potentials. Our results establish the existence of undecidable trajectories in physically natural billiard-type models, including billiard-type models arising in hard-sphere gases and in collision-chain limits of celestial mechanics.
Similar Papers
How Pinball Wizards Simulate a Turing Machine
Computational Complexity
Makes pinball games incredibly hard to solve.
Universality in computable dynamical systems: Old and new
Dynamical Systems
Makes math problems solvable with moving shapes.
Turing complete Navier-Stokes steady states via cosymplectic geometry
Differential Geometry
Makes math equations compute like computers.