Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)

Authors:
Kenichi Morita
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 18
Cited 0

Notes on the history of reversible computation

IBM Journal of Research and Development
Ininvertible cellular automata: a review

Physica D
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Small universal Turing machines

Theoretical Computer Science - Special issue on universal machines and computations
Universality of a reversible two-counter machine

Theoretical Computer Science - Special issue on universal machines and computations
Self-reproduction in a reversible cellular space

Theoretical Computer Science - Special issue on universal machines and computations
Firing squad synchronization problem in reversible cellular automata

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

Theoretical Computer Science - Special issue on universal machines and computations
Self-reproduction in three-dimensional reversible cellular space

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

Collision-based computing
Reversible Computing

Proceedings of the 7th Colloquium on Automata, Languages and Programming
A Universal Turing Machine with 3 States and 9 Symbols

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Reversible computing and cellular automata—A survey

Theoretical Computer Science
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
Logical reversibility of computation

IBM Journal of Research and Development
A universal reversible turing machine

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Four small universal turing machines

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Classification and universality of reversible logic elements with one-bit memory

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this survey, we deal with the problem how a universal computer can be constructed in a reversible environment. We discuss this problem based on the frameworks of reversible Turing machines, reversible logic circuits, and reversible cellular automata. We can see that in spite of the constraint of reversibility, there are several very simple reversible systems that have universal computing ability.