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.
Publisher's URL: http://www.springerlink.com/content/g81x4n66418432...
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.
Repository Staff Only: item control page
Total Document Downloads in Past 12 Months
Total Document DownloadsMore statistics for this item...