Billiard-Ball Computer¶

A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8190
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Reversible Computing, Conservative Logic → Computer Science & Software Engineering

Core Idea¶

Billiard-Ball Computer is treated here as the recurring computer science and information systems identity summarized by this source-grounded definition: A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli. and Toffoli billiard ball model of an AND gate. When a single billiard ball arrives at the gate through input 0-in or 1-in, it passes through the device unobstructed and exits via.

How would you explain it like I'm…

The Bumping-Ball Brain

Imagine a pool table with no rubbing at all, where balls roll forever and bounce perfectly off the walls. A Billiard-Ball Computer is a make-believe computer built from that table. A ball rolling in means 'yes' and no ball means 'no'. When two balls bump into each other, they get pushed onto new paths, and where they come out gives the answer.

The Pool-Table Computer

A billiard-ball computer is an imaginary computer made of rolling balls instead of electricity. The table has no friction, so balls never slow down, and they bounce perfectly off bumpers. A ball arriving at a spot means yes, and no ball means no. If two balls arrive together, they collide and head off in new directions, and one of the exits only gets a ball when both came in, just like the logic word AND. Nothing gets lost, so in principle you could run it backwards.

Reversible Collision Computer

The Billiard-Ball Computer is an idealized thought-model of computing proposed by Edward Fredkin and Tommaso Toffoli in 1982. Signals are billiard balls moving on a frictionless surface and reflecting perfectly off fixed buffers, so everything follows Newton's laws with no energy lost. A 1 is a ball on a path at a given time and a 0 is its absence. Logic happens through collisions: in their AND gate, a single ball passes straight through, but two balls arriving together collide, get redirected, collide again, and one of them exits on the AND output. Because the balls are conserved and the motion is reversible, it is an example of conservative, reversible logic, unlike ordinary gates that throw information away.

The Billiard-Ball Computer, proposed by Edward Fredkin and Tommaso Toffoli in 1982, is an idealized reversible mechanical computer based on Newtonian dynamics. Signals are carried by spherical balls moving without friction through an arrangement of fixed buffers off which they bounce elastically; a ball present on a path encodes 1, absence encodes 0. Computation happens through timed collisions. In the AND-gate construction, a lone ball on either input passes through unobstructed to its matching output, but two simultaneous balls collide, redirect each other into a second collision, and one exits on a dedicated AND output. It is a type of conservative logic circuit: the number of balls is conserved and the dynamics are reversible, so no information is erased. It serves as a physical existence argument that computation need not rely on dissipative, irreversible gates.

Scope of Application¶

Simulating circuits with billiard balls. Therefore, suitably configured billiard-ball computers may be used to perform any computational task.
Simulating circuits with billiard balls. This model can be used to simulate Boolean circuits in which the wires of the circuit correspond to paths on which one of the balls may travel, the signal on a.
Simulating circuits with billiard balls. In particular, it is possible to set up the paths of the balls and the buffers around them to form a reversible Toffoli gate, from which any other Boolean logic gate.
Simulating billiard balls in other models of computatio. It is possible to simulate billiard-ball computers on several types of reversible cellular automaton, including block cellular automata and second-order cellular automata.
Simulating billiard balls in other models of computatio. In these simulations, the balls are only allowed to move at a constant speed in an axis-parallel direction, assumptions that in any case were already present in the use of the.

Clarity¶

A clear use of Billiard-Ball Computer names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli.

Manages Complexity¶

Billiard-Ball Computer compresses multiple computer science and information systems details into a stable diagnostic relation. The source shows both the central mechanism—this model can be used to simulate Boolean circuits in which the wires of the circuit correspond to paths on which one of the balls may travel, the signal on a wire is encoded by the presence or absence of a ball on that path, and the gates.

Abstract Reasoning¶

Type the carrier. Identify the computer science and information systems entities to which the claim applies.
State the relation. Use the source-grounded identity: A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli.
Check operation and conditions. When a single billiard ball arrives at the gate through input 0-in or 1-in, it passes through the device unobstructed and exits via 0-out or 1-out. 4.

Knowledge Transfer¶

Within the home domain. Knowledge about Billiard-Ball Computer transfers literally when a new case preserves the same carrier type, relation, and recognition test. Therefore, suitably configured billiard-ball computers may be used to perform any computational task. This model can be used to simulate Boolean circuits in which the wires of the circuit correspond to paths on which one of the balls may travel, the signal.

Relationships to Other Abstractions¶

Current abstraction Billiard-Ball Computer Domain-specific

Parents (1) — more general patterns this builds on

Billiard-Ball Computer is a kind of Abstract Machine Domain-specific

The billiard-ball computer is an idealized abstract machine whose transitions are modeled by reversible mechanical collisions.

Hierarchy paths (2) — routes to 2 parentless roots

Billiard-Ball Computer → Abstract Machine → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Billiard-Ball Computer sits in a sparse region of the domain-specific corpus (81^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Markov Chains & Probabilistic Computation (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08