A computation-universal two-dimensional 8-state triangular reversible cellular automaton

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 181-191

  Imai, Katsunobu ^a   Morita, Kenichi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Cellular automata; Computation universality; Conservative logic; Reversibility

Indexed keywords

EID: 0347367167     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00099-7     Document Type: Article

References (6)

1. E. Berlekamp, J. Conway, R. Guy, Winning Ways for Your Mathematical Plays, vol. 2, Academic Press, New York, 1982.
2. E. Fredkin, T. Toffoli, Conservative logic, Int. J. Theoret. Phys. 21 (3/4) (1982) 219-253.
3. N. Margolus, N Physics-like models of computation, Physica D 10 (1984) 81-95.
4. K. Morita, M. Harao, Computation universality of one-dimensional reversible (injective) cellular automata, Trans. IEICE E 72 (1989) 758-762.
5. K. Morita, S. Ueno, Computation-universal models of two-dimensional 16-state reversible cellular automata, IEICE Trans. Inform. Systems E75-D (1992) 141-147.
6. T. Toffoli, T Computation and construction universality of reversible cellular automata, J. Comput. Systems. Sci. 15 (1977) 213-231.