Reversible computing and cellular automata - A survey

Morita Kenichi

Theoretical Computer Science

Reversible computing is a paradigm where computing models are defined so that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. In this survey/tutorial paper, we discuss how computation can be carried out in a reversible system, how a universal reversible computer can be constructed by reversible logic elements, and how such logic elements are related to reversible physical phenomena. We shall see that, in reversible systems, computation can often be carried out in a very different manner from conventional (i.e., irreversible) computing systems, and even very simple reversible systems or logic elements have computation- or logical-universality. We discuss these problems based on reversible logic elements/circuits, reversible Turing machines, reversible cellular automata, and some other related models of reversible computing.

Reversible logic element

Reversible Turing machine

Reversible cellular automata

Computation-universality

電気工学 [ 540 ]

英語

Elsevier Ltd

Copyright (c) 2008 Elsevier Ltd

[ISSN] 0304-3975

[DOI] 10.1016/j.tcs.2008.01.041

[NCID] AA00862688

[DOI] http://dx.doi.org/10.1016/j.tcs.2008.01.041 ～の異版である