14
个编辑
更改
跳到导航
跳到搜索
第2行：
第2行： − + + − + − − Brian's Brain consists of an infinite two-dimensional grid of cells, but unlike Seeds, each cell may be in one of three states: on, dying, or off. Each cell is considered to have eight neighbors (the [[Moore neighborhood]]), as in Seeds and [[Conway's Game of Life]]. − − Brian's Brain consists of an infinite two-dimensional grid of cells, but unlike Seeds, each cell may be in one of three states: on, dying, or off. Each cell is considered to have eight neighbors (the Moore neighborhood), as in Seeds and Conway's Game of Life. − − 布莱恩的大脑由一个无限的二维细胞网格组成，但与种子不同，每个细胞可能处于三种状态之一: 开、死、关。每个细胞被认为有八个邻居(摩尔社区) ，如在种子和康威的生活游戏。 + + 第24行：
第21行： − +
无编辑摘要
[[Image:Brian's brain.gif|frame|right|一个典型混沌的布莱恩大脑显示了飞行器，耙子和对角线波。其中，活细胞（on cells）是白色的，死细胞(dying cells)是蓝色的。]]
[[Image:Brian's brain.gif|frame|right|一个典型混沌的布莱恩大脑显示了飞行器，耙子和对角线波。其中，活细胞（on cells）是白色的，死细胞(dying cells)是蓝色的。]]
==Introductions==
==介绍==
布莱恩的大脑(Brain's brain)是由加拿大计算机科学家布莱恩·西尔弗曼（Brian Silverman）设计的[http://wiki.swarma.net/index.php/%E5%85%83%E8%83%9E%E8%87%AA%E5%8A%A8%E6%9C%BA 元胞自动机]。
布莱恩的大脑(Brain's brain)是由加拿大计算机科学家布莱恩·西尔弗曼（Brian Silverman）设计的[http://wiki.swarma.net/index.php/%E5%85%83%E8%83%9E%E8%87%AA%E5%8A%A8%E6%9C%BA 元胞自动机]。
其特点在于，规则模拟了大脑神经元之间的信息传递规则。
==Rules==
==规则==
Brain’s Brain在一个无限的二维细胞网格上运行，每个细胞处于3种状态，类比大脑，可以把细胞现象成是神经元，三种状态对应的是：开（刺激）、关（关闭但是准备好刺激）、死（刺激但是没有反应），同时该细胞受周围8个细胞的影响，从而发生演化。
每个时间间隔，如果一个细胞处于关闭状态，但恰好它的两个邻居处于打开状态，则该细胞会打开。所有处于“ 开”状态的细胞都会进入“死”状态，该状态在邻居计数中不算作“ 开”细胞，并阻止细胞在此处生长。处于"死"状态的细胞将进入"关"状态。
In each time step, a cell turns on if it was off but had exactly two neighbors that were on, just like the birth rule for Seeds. All cells that were "on" go into the "dying" state, which is not counted as an "on" cell in the neighbor count, and prevents any cell from being born there. Cells that were in the dying state go into the off state.
In each time step, a cell turns on if it was off but had exactly two neighbors that were on, just like the birth rule for Seeds. All cells that were "on" go into the "dying" state, which is not counted as an "on" cell in the neighbor count, and prevents any cell from being born there. Cells that were in the dying state go into the off state.
==Behavior==
==表现==
Because of the cellular automaton's name, some websites compare the automaton to a brain and each of its cells to a neuron, which can be in three different states: ready (off), firing (on), and refractory (dying).<ref>{{cite web|url=http://www.msevans.com/automata/briansbrain.html|title=Cellular Automata - Brian's Brain|last=Evans|first=M. Steven|date=2002-01-28|accessdate=2009-05-17}}</ref><ref>{{cite web|url=http://psoup.math.wisc.edu/mcell/rullex_gene.html#Brian%27s%20Brain|title=Cellular Automata rules lexicon - Generations|last=Wójtowicz|first=Mirek
Because of the cellular automaton's name, some websites compare the automaton to a brain and each of its cells to a neuron, which can be in three different states: ready (off), firing (on), and refractory (dying).<ref>{{cite web|url=http://www.msevans.com/automata/briansbrain.html|title=Cellular Automata - Brian's Brain|last=Evans|first=M. Steven|date=2002-01-28|accessdate=2009-05-17}}</ref><ref>{{cite web|url=http://psoup.math.wisc.edu/mcell/rullex_gene.html#Brian%27s%20Brain|title=Cellular Automata rules lexicon - Generations|last=Wójtowicz|first=Mirek