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

Authors:
Katsunobu Imai;Kenichi Morita
Affiliations:
Hiroshima Univ., Higashi-Hiroshima, Japan;Hiroshima Univ., Higashi-Hiroshima, Japan
Venue:
Theoretical Computer Science - Special issue on universal machines and computations
Year:
2000

Citing 0
Cited 8

Universal computing in reversible and number-conserving two-dimensional cellular spaces

Collision-based computing
Reversible Computation in Asynchronous Cellular Automata

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Reversible computing and cellular automata—A survey

Theoretical Computer Science
Surprising Areas in the Quest for Small Universal Devices

Electronic Notes in Theoretical Computer Science (ENTCS)
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Majority adder implementation by competing patterns in life-like rule B2/S2345

UC'10 Proceedings of the 9th international conference on Unconventional computation
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract