Data set for simulating a reversible elementary square partitioned cellular automaton with the ID number 01caef on Golly

アクセス数 : 301
ダウンロード数 : 47

今月のアクセス数 : 2
今月のダウンロード数 : 0
ファイル情報(添付)
ESPCA_01caef.zip 1.34 MB 種類 : データセット
タイトル ( eng )
Data set for simulating a reversible elementary square partitioned cellular automaton with the ID number 01caef on Golly
作成者
抄録
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.
内容記述
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".
言語
英語
資源タイプ データセット
出版タイプ Author’s Original(十分な品質であるとして、著者から正式な査読に提出される版)
アクセス権 オープンアクセス
日付
[作成日] 2021-12
収録物識別子
[URI] https://ir.lib.hiroshima-u.ac.jp/00051974 ~で参照されている