A billiard ball computer as in is an idealized model of a computing machine based on Newtonian dynamics. Instead of using electronic signals like a conventional computer, it relies on the motion of spherical billiard balls in a friction-free environment made of buffers against which the balls bounce perfectly. It was devised to provide context to the Halting problem and similar results in computability. A paradox seems to arise as a consequence of the existence of this ideal machine, since it shows that there exists no algorithm to predict whether the arbitrary billiard-ball system provides an "output" for any given "input". This leads to an unexpected conclusion: the question whether a given (moving) object can reach a given position is undecidable under the rules of the Newtonian dynamics.
The billiard ball model was proposed in 1982 in a seminal paper of Edward Fredkin and Tommaso Toffoli. The work on this and similar models was continued by the MIT Information Mechanics group and has strong relations with the present Amorphous computing group at MIT or the Quantum Mechanical Hamiltonian Model of Paul Beniof. Presently there are a few research lines related to these kind of models in what it is known as unconventional computing.
When the number of objects (such as billiard balls) in a system becomes large, we need new principles like the entropy or temperature relations. And when the multitude of particles are able to react and change (not only in position and momentum) then new behaviours arise. The Amorphous computing paradigm prepares the engineering principles to observe, control, organize, and exploit the coherent and cooperative behaviour of programmable multitudes. It is a new paradigm of architecture on. The Unconventional and Biologically-inspired computing paradigms use asynchronous and decentralized agents and include the model of cellular automats. Recent works related to the billiard ball model are the particle-based model and the reaction and diffusion of chemical species .