Computing with planar toppling domino arrangements

Authors:
William M. Stevens
Affiliations:
Unconventional Computing Group, University of the West of England, Bristol, UK BS16 1QY
Venue:
Natural Computing: an international journal
Year:
2012

Citing 3
Cited 1

Collision-based computing

Collision-based computing
Logic circuits in the plane: minimal crossovers

ACM SIGACT News
Principles of Asynchronous Circuit Design: A Systems Perspective

Principles of Asynchronous Circuit Design: A Systems Perspective

Using transition systems to describe and predict the behaviour of structured excitable media

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for implementing Boolean logic functions using arrangements of toppling dominoes is described. Logic functions are implemented using only lines of dominoes and fork junctions. Using a dual-rail representation for Boolean values, any desired combinational function can be implemented. Circuits constructed using this method have no timing or order constraints on their inputs and require no out-of-plane bridges for passing one line of dominoes over another. Since they are built using toppling dominoes, circuits can be used only once.