A computation-universal two-dimensional 8-state triangular reversible cellular automaton
Theoretical Computer Science - Special issue on universal machines and computations
Self-timed cellular automata and their computational ability
Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Journal of Electronic Testing: Theory and Applications
Defect-tolerance in cellular nanocomputers
New Generation Computing
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Online marking of defective cells by random flies
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Computation of functions on n bits by asynchronous clocking of cellular automata
Natural Computing: an international journal
| Hi-index | 0.00 |
Reversible computation has attracted much attention over the years, not only for its promise for computers with radically reduced power consumption, but also for its importance for Quantum Computing. Though studied extensively in a great variety of synchronous computation models, it is virtually unexplored in an asynchronous framework. Particularly suitable asynchronous models for the study of reversibility are asynchronous cellular automata. Simple yet powerful, they update their cells at random times that are independent of each other. In this paper, we present the embedding of a universal reversible Turing machine (RTM) in a two-dimensional self-timed cellular automaton (STCA), a special type of asynchronous cellular automaton, of which each cell uses four bits to store its state, and a transition on a cell accesses only these four bits and one bit of each of the four neighboring cells. The embedding of a universal RTM on an STCA requires merely four rotation-symmetric transition rules, which are bit-conserving and locally reversible. We show that the model is globally reversible.