A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Evolution in asynchronous cellular automata
ICAL 2003 Proceedings of the eighth international conference on Artificial life
Embedding universal delay-insensitive circuits in asynchronous cellular spaces
Fundamenta Informaticae - Special issue on cellular automata
Towards a Theory of Universal Speed-Independent Modules
IEEE Transactions on Computers
Universal delay-insensitive circuits with bidirectional and buffering lines
IEEE Transactions on Computers
Construction universality in purely asynchronous cellular automata
Journal of Computer and System Sciences
Formal methods for the analysis and synthesis of nanometer-scale cellular arrays
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Small world network model of personal consumption: Demand-side management in an expert system
Expert Systems with Applications: An International Journal
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Computational aspects of asynchronous cellular automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Skew Dependence of Nanophotonic Devices Based on Optical Near-Field Interactions
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Fluctuation-driven computing on number-conserving cellular automata
Information Sciences: an International Journal
Reversible delay-insensitive distributed memory modules
RC'13 Proceedings of the 5th international conference on Reversible Computation
m-Asynchronous cellular automata: from fairness to quasi-fairness
Natural Computing: an international journal
Computing Issues of Asynchronous CA
Fundamenta Informaticae
Hi-index | 0.00 |
Asynchronous cellular automata (ACA) are cellular automata that allow cells to update their states independently at random times. Because of the unpredictability of the order of update, computing on ACA is usually done by simulating a timing mechanism to force all cells into synchronicity after which well-established synchronous methods of computation can be used. In this paper, we present a more effective method of computation based upon a 4-state two-dimensional ACA with von Neumann neighborhood that is based on the construction in the cellular space of delay-insensitive circuits, a special type of asynchronous circuits, whose operations are robust to arbitrary delays in operators or interconnection lines. We show that this novel ACA model can be used to construct a universal Turing machine, which suffices to prove its computational universality.