Data set for simulating universal reversible elementary square partitioned cellular automata on Golly
アクセス数 : 100 件
ダウンロード数 : 28 件
今月のアクセス数 : 1 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00053792
| File |
Universal_ESPCAs.zip
2.43 MB
種類 :
dataset
|
| Title ( eng ) |
Data set for simulating universal reversible elementary square partitioned cellular automata on Golly
|
| Creator | |
| Abstract |
We show how reversible computers can be built in very simple two-dimensional cellular automata called elementary square partitioned cellular automata (ESPCAs).
Here, we consider three kinds of reversible ESPCAs. In each of these ESPCAs, a rotary element (RE) is constructed utilizing only a few kinds of small patterns and their interactions. Once an RE is implemented, any RTM is embedded in its cellular space easily. Full computing processes of RTMs in these ESPCAs can be viewed on the general purpose CA simulator Golly. |
| Descriptions |
This data set contains rule files and pattern files for simulating ESPCAs on the well-known CA simulator Golly.
How to use this data set is given in "Read_me_first.txt" in the zipped file. Detailed explanations on the ESPCAs are found in "Universal_ESPCAs.pdf". |
| Language |
eng
|
| Resource Type | dataset |
| Publish Type | Author’s Original |
| Access Rights | open access |
| Date |
[Created] 2023-04
|
