Reversible computing and cellular automata - A survey
この論文をさがす
説明
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.
収録刊行物
-
- Theoretical Computer Science
-
Theoretical Computer Science 395 (1), 101-131, 2008-04
Elsevier Ltd
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1050296265986862976
-
- NII論文ID
- 120001041387
-
- NII書誌ID
- AA00862688
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- IRDB
- CiNii Articles