| Project/Area Number |
16500012
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Hiroshima University |
|---|
Principal Investigator |
MORITA Kenichi Hiroshima University, Graduate School of Engineering, Professor (00093469)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IMAI Katsunobu HIROSHIMA UNIVERSITY, Graduate School of Engineering, Assistant Professor (20253106)
|
|---|
| Project Period (FY) |
2004 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,410,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥210,000)
Fiscal Year 2007: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2006: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2005: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2004: ¥1,100,000 (Direct Cost: ¥1,100,000)
|
|---|
| Keywords | reversible computing / reversible logic element / logical universality / computation-universality / reversible Turing machine / reversible cellular automaton / asynchronous cellular automaton / hyperbolic cellular automaton / 可逆計算機構 / 万能チューリング機械 / 可逆論理 / 論理素子 / 非同期論理回路 / サイクリックタグシステム / 保存性 / Fredkinゲート |
|---|
| Research Abstract |
Physical reversibility is one of the fundamental laws of Nature that governs microscopic behavior of the physical world. Since future computing devices will surely be implemented based on some physical phenomena of nano-scale level, it is an important problem how such property of Nature can be effectively used Reversible computing is a theoretical framework for studying computing models that reflect physical reversibility. From this standpoint, we investigated several reversible computing systems and some other related systems, and obtained the following results in the term 2004-2007.
(1) We studied universality of simple reversible logic elements with one-bit memory (i.e., elements with 2 states), and proved that "all" the 14 elements that have 3 input/output lines and 2 states are logically universal.
(2) We investigated how simple universal reversible Turing machines can be. In particular we designed a 17-state 5-symbol model that can simulate any cyclic tag system.
(3) Simple universal reversible cellular automata are studied. It is shown that there is a 30-state 1-dimensional reversible cellular automaton that has computation-universality.
(4) Relation between reversibility and asynchronism is studied. A simple construction method of a reversible cellular automaton out of asynchronous logic elements is shown.
(5) Hyperbolic cellular automata, which are another model of physical space, is investigated. We showed that there is a 5-state model having computation-universality.
(6) We studied and clarified relations among various models of reversible computing, and systematized the theory of reversible computing.
|
