William Stevens
Computing with planar toppling domino arrangements
Stevens, William
Authors
Contributors
Cristian S Calude
Editor
Jarkko Kari
Editor
Ion Petre
Editor
Grzegorz Rozenberg
Editor
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.
Citation
Stevens, W. (2011). Computing with planar toppling domino arrangements. In C. S. Calude, J. Kari, I. Petre, & G. Rozenberg (Eds.), Unconventional Computation, 10th International Conference, UC 2011 (224-233). Springer
Publication Date | Jan 1, 2011 |
---|---|
Deposit Date | Dec 1, 2011 |
Publicly Available Date | Mar 28, 2024 |
Peer Reviewed | Peer Reviewed |
Pages | 224-233 |
Series Title | Lecture Notes in Computer Science |
Series Number | 6714 |
Book Title | Unconventional Computation, 10th International Conference, UC 2011 |
Keywords | logic circuit, dual-rail logic, one-shot logic, non-electronic logic, domino |
Public URL | https://uwe-repository.worktribe.com/output/971799 |
Publisher URL | http://www.springerlink.com/content/g81x4n6641843211 |
Files
domino.pdf
(137 Kb)
PDF
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search