Universal reversible cellular automata in which counter machines are concisely embedded
アクセス数 : 738 件
ダウンロード数 : 93 件
今月のアクセス数 : 4 件
今月のダウンロード数 : 1 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00031367
| File | |
| Title ( eng ) |
Universal reversible cellular automata in which counter machines are concisely embedded
|
| Creator | |
| Abstract |
A reversible cellular automaton (RCA) is regarded as a mathematical model for spatiotemporal phenomena having physical reversibility. In spite of the strong constraint of reversibility, even very simple RCAs have universal computing ability. Here, we show two models of RCAs P_3 and P_4 in which any reversible counter machine (RCM) can be embedded in a finite configuration concisely. Since an RCM with two counters is known to be computation-universal, universality of these RCAs are also concluded. We show how computing is performed in these RCAs using examples of movies attached in this slide file.
|
| NDC |
Mathematics [ 410 ]
|
| Language |
eng
|
| Resource Type | dataset |
| Rights |
Copyright (c) 2011 Author
|
| Publish Type | Author’s Original |
| Access Rights | open access |
| Date |
[Created] 2011-04-25
|
