| Project/Area Number |
12680353
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | HIROSHIMA UNIVERSIlY |
|---|
Principal Investigator |
MORITA Kenichi Hiroshima University, Graduate School of Engineering, Professor, 大学院・工学研究科, 教授 (00093469)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IMAI Katsunobu Hiroshima University, Graduate School of Engineering, Research Associate, 大学院・工学研究科, 助手 (20253106)
|
|---|
| Project Period (FY) |
2000 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥3,000,000 (Direct Cost: ¥3,000,000)
Fiscal Year 2003: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2002: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2001: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2000: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | reversible computing / reversible cellular automata / reversible logic element / reversible logic circuit / computation-universality / conservation law / hyperbolic cellular automata / uniquely parsable grammar / 可逆計算機構 / 可逆論理 / 論理素子 / 論理万能 / 量子コンピューティング / 論理万能性 / 可逆セル・オートマトン / 生成文法 |
|---|
| Research Abstract |
Recently, much attention has been paid on so-called "Natural computing systems" like quantum computing and DNA computing. Reversible computing is also such a paradigm that has a property analogous to physical reversibility, and is closely related to quantum computing. It is a very important computing model to investigate the possibilities of future computing systems, and now is the time to make foundational and extensive researches on it for the future. From this standpoint, we studied various reversible computing systems and some other related systems, and obtained the following results.
(1)A universal reversible logic element called "rotary element" is proposed, and a novel architecture for reversible computers based on it is shown. Such a computer works in a very different way than a conventional computer, and gives a new insight into reversible computing.
(2)Universal reversible cellular automata having very simple transition functions in which rotary elements can be embedded are given. This shows reversible computing systems can be built based on extremely simple reversible rules.
(3)Cellular automata having number-conserving property is studied, This property is an analogue of conservation law of mass or energy in physics, and has a close relation to reversibility. Simple models of such systems having computation-universality is shown.
(4)It is shown that self-reproduction like living things is possible in reversible and number-conserving cellular automata.
(5) Hyperbolic cellular automata, which are another model of physical space, is studied. It is shown that such systems have computing ability of high efficiency.
(6)Several uniquely parsable grammar systems are studied. These systems can be regarded as kinds of asynchronous reversible systems. Various properties on them, relations to cellular automata, normal forms, and their pattern generating ability are shown.
|
