Simplifying Brownian Cellular Automata: Two States and an Average of Two Rules Per Cell

F. Peper
{"title":"Simplifying Brownian Cellular Automata: Two States and an Average of Two Rules Per Cell","authors":"F. Peper","doi":"10.1109/ICNC.2012.71","DOIUrl":null,"url":null,"abstract":"Brownian Cellular Automata (BCA) are asynchronous cellular automata in which local configurations are allowed to fluctuate in cell space. Used to drive the operations of BCA, these fluctuations facilitate a drastic reduction in the complexity of cells, with the best BCA models achieved up to now having three states and two transition rules. This paper proposes a further reduction to two states per cell, by employing cells of three different types. These three types require respectively three, two, and zero transition rules per cell. This result may bring physical implementations of BCA one step closer.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"29 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Brownian Cellular Automata (BCA) are asynchronous cellular automata in which local configurations are allowed to fluctuate in cell space. Used to drive the operations of BCA, these fluctuations facilitate a drastic reduction in the complexity of cells, with the best BCA models achieved up to now having three states and two transition rules. This paper proposes a further reduction to two states per cell, by employing cells of three different types. These three types require respectively three, two, and zero transition rules per cell. This result may bring physical implementations of BCA one step closer.
简化布朗元胞自动机:每个细胞的两种状态和两个规则的平均值
布朗元胞自动机(BCA)是一种允许局部配置在单元空间中波动的异步元胞自动机。这些波动用于驱动BCA的运行,从而大大降低了细胞的复杂性,迄今为止实现的最佳BCA模型具有三种状态和两个过渡规则。通过使用三种不同类型的细胞,本文建议进一步减少到每个细胞两种状态。这三种类型每个单元格分别需要三个、两个和零转换规则。这一结果可能使BCA的物理实现更接近一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信