Search for computationally universal cellular automata by 1/f noise
Project/Area Number |
20500216
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Sensitivity informatics/Soft computing
|
Research Institution | Kanazawa Institute of Technology |
Principal Investigator |
NINAGAWA Shigeru Kanazawa Institute of Technology, 情報学部, 教授 (50308087)
|
Project Period (FY) |
2008 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2009: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
Keywords | セルオートマトン / 計算万能性 / 1 / fゆらぎ / 遺伝的アルゴリズム / 1/fゆらぎ |
Research Abstract |
We search for two-dimensional three-state nine-neighbor cellular automata with a 1/f power spectrum by means of genetic algorithms under the assumption that there is a relationship between 1/f noise and computational universality in cellular automata. The power spectrum is calculated from the evolution of the state of the cell, starting from a random initial configuration. The fitness is estimated using the power spectrum by considering the spectral similarity to the 1/f spectrum. As a result, we obtained a rule with stationary, periodic, and propagating patterns and observed various interactions between them which suggest the possibility of supporting universal computation, although this remains unproven.
|
Report
(4 results)
Research Products
(14 results)