Skip to main content

Computing with Planar Toppling Domino Arrangements

  • Conference paper
  • 610 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6714))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gorecki, J., Gorecka, J.N.: Multi-argument logical operations performed with excitable chemical medium. J. Chem. Phys. 124(084101) (2006)

    Google Scholar 

  2. Fredkin, E., Toffoli, T.: Conservative Logic. J. Theo. Phys. 21(3,4), 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Adamatzky, A. (ed.): Collision Based Computing. Springer, London (2002)

    MATH  Google Scholar 

  4. O’Keefe, S.: Implementation of Logical Operations on a Domino Substrate. Int. J. Unconventional Computing 5(2), 115–128 (2009)

    Google Scholar 

  5. Wagon, S., Briggs, W., Becker, S.: The Dynamics of Falling Dominoes. The UMAP Journal 26(1), 35–47 (2005)

    Google Scholar 

  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. Dewdney, A.K.: Logic circuits in the plane. ACM SIGACT News 10(3), 38–48 (1979)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stevens, W.M. (2011). Computing with Planar Toppling Domino Arrangements. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21341-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21340-3

  • Online ISBN: 978-3-642-21341-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics