Computing with planar toppling domino arrangements

Stevens, W. (2011) Computing with planar toppling domino arrangements. In: Calude, C. S., Kari, J., Petre, I. and Rozenberg, G., eds. (2011) Unconventional Computation, 10th International Conference, UC 2011. Springer, pp. 224-233. Available from:

PDF - Accepted Version

Publisher's URL:


A method for implementing Boolean logic functions using arrangements of toppling dominoes is described. Any desired combinational function can be implemented. A circuit constructed using this method has no timing or order constraints on its inputs and requires no out-of-plane bridges for passing one line of dominoes over another. Since it is built using toppling dominoes, a circuit can be used only once.

Item Type:Book Section
Uncontrolled Keywords:logic circuit, dual-rail logic, one-shot logic, non-electronic logic, domino
ID Code:16080
Deposited By: W. Stevens
Deposited On:01 Dec 2011 13:49
Last Modified:05 Dec 2016 00:27

Request a change to this item

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...