Data set for simulating a reversible elementary square partitioned cellular automaton with the ID number 01caef on Golly
アクセス数 : 295 件
ダウンロード数 : 46 件
今月のアクセス数 : 5 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00051576
| File |
ESPCA_01caef.zip
1.34 MB
種類 :
dataset
|
| Title ( eng ) |
Data set for simulating a reversible elementary square partitioned cellular automaton with the ID number 01caef on Golly
|
| Creator | |
| Abstract |
An elementary square partitioned cellular automaton (ESPCA) with the hexadecimal ID number "01caef" is an abstract model of a reversible and conservative physical world. Despite its simplicity of the local transition function, the ESPCA shows fascinating behavior. In particular, there exists a useful space-moving pattern called a glider in it. Colliding a glider with another pattern called a blinker, interesting phenomena appear. We observe that, using only these two patterns and three kinds of phenomena as basic operations, any reversible Turing machines (RTMs) can be constructed. Examples of whole computing processes of RTMs can be seen on a general purpose CA simulator Golly using the files given here.
|
| Descriptions |
This data set contains rule files and pattern files for simulating ESPCA 01caef on the well-known CA simulator Golly. How to use this data set is given in "Readme_First.pdf" in this zipped file. Descriptions on ESPCA 01caef are found in "readme_ESPCA_01caef.pdf".
|
| Language |
eng
|
| Resource Type | dataset |
| Publish Type | Author’s Original |
| Access Rights | open access |
| Date |
[Created] 2021-12
|
| Source Identifier |
[URI] https://ir.lib.hiroshima-u.ac.jp/00051974
isReferencedBy
|
