【24h】

EVENTUALLY NUMBER-CONSERVING CELLULAR AUTOMATA

机译:有效保留数字的自动机

获取原文
获取原文并翻译 | 示例
           

摘要

Although it is undecidable whether a one-dimensional cellular automaton obeys a given conservation law over its limit set, it is however possible to obtain sufficient conditions to be satisfied by a one-dimensional cellular automaton to be eventually number-conserving. We present a preliminary study of two-input one-dimensional cellular automaton rules called eventually number-conserving cellular automaton rules whose limit sets, reached after a number of time steps of the order of the cellular automaton size, consist of states having a constant number of active sites. In particular, we show how to find rules having given limit sets satisfying a conservation rule. Viewed as models of systems of interacting particles, these rules obey a kind of Darwinian principle by either annihilating unnecessary particles or creating necessary ones.
机译:尽管不能确定一维元胞自动机是否在其极限集上遵循给定的守恒定律,但是可以获得一维元胞自动机满足的条件,以最终保全数量。我们目前对二维输入一维元胞自动机规则进行初步研究,该规则称为最终保数元胞自动机规则,其限制集在元胞自动机大小的数量级的多个时间步长后达到,并由状态数保持不变活动站点。特别是,我们展示了如何查找具有给定极限集且满足守恒定律的规则。被视为相互作用粒子系统的模型,这些规则通过消灭不必要的粒子或创建必要的粒子来遵循一种达尔文原理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号