Computing with Planar Toppling Domino Arrangements

  • William M. Stevens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6714)


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.


Logic circuit dual-rail logic one-shot logic non-electronic logic domino 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gorecki, J., Gorecka, J.N.: Multi-argument logical operations performed with excitable chemical medium. J. Chem. Phys. 124(084101) (2006)Google Scholar
  2. 2.
    Fredkin, E., Toffoli, T.: Conservative Logic. J. Theo. Phys. 21(3,4), 219–253 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Adamatzky, A. (ed.): Collision Based Computing. Springer, London (2002)zbMATHGoogle Scholar
  4. 4.
    O’Keefe, S.: Implementation of Logical Operations on a Domino Substrate. Int. J. Unconventional Computing 5(2), 115–128 (2009)Google Scholar
  5. 5.
    Wagon, S., Briggs, W., Becker, S.: The Dynamics of Falling Dominoes. The UMAP Journal 26(1), 35–47 (2005)Google Scholar
  6. 6.
    Von Neumann, J.: Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 43–98. Princeton University Press, Princeton (1956)Google Scholar
  7. 7.
    Dewdney, A.K.: Logic circuits in the plane. ACM SIGACT News 10(3), 38–48 (1979)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • William M. Stevens
    • 1
  1. 1.Oxford University Department of PsychiatryWarneford HospitalOxfordUK

Personalised recommendations