Reversible computing and cellular automata - A survey
Theoretical Computer Science Volume 395 Issue 1
Page 101-131
published_at 2008-04
アクセス数 : 765 件
ダウンロード数 : 223 件
今月のアクセス数 : 4 件
今月のダウンロード数 : 2 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00025576
| File | |
| Title ( eng ) |
Reversible computing and cellular automata - A survey
|
| Creator | |
| Source Title |
Theoretical Computer Science
|
| Volume | 395 |
| Issue | 1 |
| Start Page | 101 |
| End Page | 131 |
| Abstract |
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.
|
| Keywords |
Reversible logic element
Reversible Turing machine
Reversible cellular automata
Computation-universality
|
| NDC |
Electrical engineering [ 540 ]
|
| Language |
eng
|
| Resource Type | journal article |
| Publisher |
Elsevier Ltd
|
| Date of Issued | 2008-04 |
| Rights |
Copyright (c) 2008 Elsevier Ltd
|
| Publish Type | Author’s Original |
| Access Rights | open access |
| Source Identifier |
[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
isVersionOf
|
