Reversible and conservative elementary triangular partitioned cellular automata
アクセス数 : 822 件
ダウンロード数 : 89 件
今月のアクセス数 : 7 件
今月のダウンロード数 : 1 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00039997
| File | |
| Title ( eng ) |
Reversible and conservative elementary triangular partitioned cellular automata
|
| Creator |
Morita Kenichi
|
| Abstract |
Eight-state isotropic triangular partitioned cellular automata (TPCAs) are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. Among them, we study computational universality of reversible and conservative ETPCAs. There are nine kinds of such ETPCAs. We show six of them are universal, and three are non-universal. Universality is shown by giving a configuration that simulates a Fredkin gate, a universal reversible gate. Computer simulation results are also given as movies and in the attachment files.
|
| Descriptions |
This work was supported by JSPS KAKENHI Grant Number 15K00019
|
| NDC |
Electrical engineering [ 540 ]
|
| Language |
eng
|
| Resource Type | dataset |
| Publish Type | Author’s Original |
| Access Rights | open access |
| Date |
[Created] 2016-05
|
