Two-dimensional billiard systems are Turing complete: halting of any Turing machine is equivalent to a bounded trajectory entering a specified open set.
Statistical mechanics of cellular automata.Rev
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Classical billiards can compute
Two-dimensional billiard systems are Turing complete: halting of any Turing machine is equivalent to a bounded trajectory entering a specified open set.