184规则

184规则 是种一维二进制细胞自动机规则, 在解决多数问题(majority problem)以及同时描述几个看似完全不同的粒子系统时有着应用： 184规则可以用来简单模拟一条单向车道上的车流，并形成了描述更复杂交通流量模型的细胞自动机模型的基础。 184规则还可以用于模拟颗粒沉积到不规则表面上的过程，每个步骤中都会有表面的局部最小值被颗粒填充。在执行模拟的每个步骤时，颗粒的数量是不断增加的。 一旦放置，粒子就不再移动。 184规则还可以根据弹道湮灭的概念来理解，系统中不同的粒子通过一维介质向左向右移动。当两个移动方向不同的粒子碰撞时，它们彼此湮灭，使得在执行完每个步骤后，粒子数只能保持不变或者减少。 以上描述虽然有着的明显矛盾，但是可以通过设置不同的自动机状态与粒子的相关关系来描述不同的问题。 184规则的自动机状态由一维的单元阵列组成，每个单元包含二进制值（0或1）。其中0可以表示道路可以可用，1可以表示车辆。 在其演化的每个步骤中，184规则自动机同时对所有细胞使用以下规则生成下一个阵列中的每个细胞，以确定每个细胞的新状态： 此规则的；之所以命名为184规则，是因为描述上述状态表的Wolfram代码的最后三行：10111000，由二进制转换为十进制时是数字184。 有好几种不同的方式直观地描述184规则： 30规则（英语：rule 30），90规则（英语：rule 90）以及110规则（英语：rule 110），其他具有不同行为的一维细胞自动机。 E.g. see Fukś (1997). This rule table is already given in a shorthand form in the name "Rule 184", but it can be found explicitly e.g. in Fukś (1997). Alonso-Sanz, Ramon. Number-preserving rules. Discrete Systems with Memory. World Scientific series on nonlinear science, Ser. A 75. World Scientific. 2011: 55–57 [2017-02-02]. ISBN 9789814343633. （原始内容存档于2020-09-20）.  Belitsky, Vladimir; Ferrari, Pablo A. Ballistic annihilation and deterministic surface growth. Journal of Statistical Physics. 1995, 80 (3–4): 517–543. Bibcode:1995JSP....80..517B. doi:10.1007/BF02178546.  Biham, Ofer; Middleton, A. Alan; Levine, Dov. Self-organization and a dynamic transition in traffic-flow models. Physical Review A. 1992, 46 (10): R6124–R6127. Bibcode:1992PhRvA..46.6124B. PMID 9907993. arXiv:cond-mat/9206001 . doi:10.1103/PhysRevA.46.R6124.  Boccara, Nino; Fukś, Henryk. Cellular automaton rules conserving the number of active sites. Journal of Physics A: Math. Gen. 1998, 31 (28): 6007–6018. Bibcode:1998JPhA...31.6007B. arXiv:adap-org/9712003 . doi:10.1088/0305-4470/31/28/014.  Capcarrere, Mathieu S.; Sipper, Moshe; Tomassini, Marco. Two-state, r = 1 cellular automaton that classifies density (PDF). Physical Review Letters. 1996, 77 (24): 4969–4971. Bibcode:1996PhRvL..77.4969C. PMID 10062680. doi:10.1103/PhysRevLett.77.4969.  Chopard, Bastien; Droz, Michel. Cellular Automata Modeling of Physical Systems. Cambridge University Press. 1998. ISBN 0-521-67345-3.  Chowdhury, Debashish; Santen, Ludger; Schadschneider, Andreas. Statistical physics of vehicular traffic and some related systems. Physics Reports. 2000, 329 (4): 199–329. Bibcode:2000PhR...329..199C. arXiv:cond-mat/0007053 . doi:10.1016/S0370-1573(99)00117-9.  Fukś, Henryk. Solution of the density classification problem with two similar cellular automata rules. Physical Review E. 1997, 55 (3): R2081–R2084. Bibcode:1997PhRvE..55.2081F. doi:10.1103/PhysRevE.55.R2081.  Fukś, Henryk; Boccara, Nino. Generalized deterministic traffic rules (PDF). International Journal of Modern Physics C. 1998, 9 (1): 1–12 [2017-02-02]. Bibcode:1998IJMPC...9....1F. doi:10.1142/S0129183198000029. （原始内容存档 (PDF)于2007-09-27）.  Fukui, M.; Ishibashi, Y. Traffic flow in 1D cellular automaton model including cars moving with high speed. Journal of the Physical Society of Japan. 1996, 65 (6): 1868–1870. Bibcode:1996JPSJ...65.1868F. doi:10.1143/JPSJ.65.1868.  Gaylord, Richard J.; Nishidate, Kazume. Traffic Flow. Modeling Nature: Cellular Automata Simulations with Mathematica. Springer-Verlag. 1996: 29–34. ISBN 978-0-387-94620-7.  Krug, J.; Spohn, H. Universality classes for deterministic surface growth. Physical Review A. 1988, 38 (8): 4271–4283. Bibcode:1988PhRvA..38.4271K. PMID 9900880. doi:10.1103/PhysRevA.38.4271.  Land, Mark; Belew, Richard. No perfect two-state cellular automata for density classification exists. Physical Review Letters. 1995, 74 (25): 1548–1550. Bibcode:1995PhRvL..74.5148L. PMID 10058695. doi:10.1103/PhysRevLett.74.5148.  Li, Wentian. Power spectra of regular languages and cellular automata (PDF). Complex Systems. 1987, 1: 107–130 [2017-02-02]. （原始内容 (PDF)存档于2007-10-07）.  Li, Wentian. Phenomenology of nonlocal cellular automata. Journal of Statistical Physics. 1992, 68 (5–6): 829–882. Bibcode:1992JSP....68..829L. doi:10.1007/BF01048877.  Maerivoet, Sven; De Moor, Bart. Cellular automata models of road traffic. Physics Reports. 2005, 419 (1): 1–64. Bibcode:2005PhR...419....1M. arXiv:physics/0509082 . doi:10.1016/j.physrep.2005.08.005.  Moreira, Andres. Universality and decidability of number-conserving cellular automata. Theoretical Computer Science. 2003, 292 (3): 711–721. arXiv:nlin.CG/0306032 . doi:10.1016/S0304-3975(02)00065-8.  Nagel, Kai. Particle hopping models and traffic flow theory. Physical Review E. 1996, 53 (5): 4655–4672. Bibcode:1996PhRvE..53.4655N. arXiv:cond-mat/9509075 . doi:10.1103/PhysRevE.53.4655.  Nagel, Kai; Schreckenberg, Michael. A cellular automaton model for freeway traffic. Journal de Physique I. 1992, 2 (12): 2221–2229. Bibcode:1992JPhy1...2.2221N. doi:10.1051/jp1:1992277.  Pivato, M. Defect particle kinematics in one-dimensional cellular automata. Theoretical Computer Science. 2007, 377 (1–3): 205–228. arXiv:math.DS/0506417 . doi:10.1016/j.tcs.2007.03.014.  Redner, Sidney. 8.5 Ballistic Annihilation. A Guide to First-Passage Processes. Cambridge University Press. 2001: 288 [2017-02-02]. ISBN 9780521652483. （原始内容存档于2020-09-14）.  Sukumar, N. Effect of boundary conditions on cellular automata that classify density. 1998. arXiv:comp-gas/9804001 .  Tadaki, Shin-ichi; Kikuchi, Macato. Jam phases in a two-dimensional cellular automaton model of traffic flow. Physical Review E. 1994, 50 (6): 4564–4570. Bibcode:1994PhRvE..50.4564T. doi:10.1103/PhysRevE.50.4564.  Wang, Bing-Hong; Kwong, Yvonne-Roamy; Hui, Pak-Ming. Statistical mechanical approach to Fukui-Ishibashi traffic flow models. Physical Review E. 1998, 57 (3): 2568–2573. Bibcode:1998PhRvE..57.2568W. doi:10.1103/PhysRevE.57.2568.  Wolfram, Stephen. A New Kind of Science. Wolfram Media. 2002.  维基共享资源上的相关多媒体资源：184规则 Rule 184 in Wolfram's atlas of cellular automata（页面存档备份，存于互联网档案馆）