WEKO3
アイテム
Universal reversible cellular automata in which counter machines are concisely embedded
https://hiroshima.repo.nii.ac.jp/records/2000032
https://hiroshima.repo.nii.ac.jp/records/20000320061c497-c1b6-49a5-a102-e3ec39e57d00
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Item type | デフォルトアイテムタイプ_(フル)(1) | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2011-04-25 | |||||||||
タイトル | ||||||||||
タイトル | Universal reversible cellular automata in which counter machines are concisely embedded | |||||||||
言語 | en | |||||||||
作成者 |
Morita, Kenichi
× Morita, Kenichi
|
|||||||||
アクセス権 | ||||||||||
アクセス権 | open access | |||||||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||
権利情報 | ||||||||||
権利情報 | Copyright (c) 2011 Author | |||||||||
主題 | ||||||||||
主題Scheme | NDC | |||||||||
主題 | 410 | |||||||||
内容記述 | ||||||||||
内容記述 | 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. | |||||||||
言語 | en | |||||||||
日付 | ||||||||||
日付 | 2011-04-25 | |||||||||
日付タイプ | Created | |||||||||
言語 | ||||||||||
言語 | eng | |||||||||
資源タイプ | ||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_ddb1 | |||||||||
資源タイプ | dataset | |||||||||
出版タイプ | ||||||||||
出版タイプ | AO | |||||||||
出版タイプResource | http://purl.org/coar/version/c_b1a7d7d4d402bcce | |||||||||
旧ID | 31367 |