Rule 110 is a one-dimensional cellular automaton with interesting properties (such as being Turing-complete).
There is a one-dimensional array of cells (on or off). At each time step, the state of each cell changes. In Rule 110, the next state of each cell depends only on itself and its two neighbours, according to the following table:
| Left | Center | Right | Center's next state |
|---|---|---|---|
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 |
| 0 | 1 |

Rule 110是一种一维细胞自动机,具有有趣性质,如图灵完备性。该自动机中,每个细胞的状态根据自身及两个相邻细胞的状态在每个时间步变化。在Rule 110中,每个细胞的下一个状态只取决于当前状态和邻居状态。此电路创建了一个512细胞系统,并在每个时钟周期推进一步。load输入用于加载data[511:0]的状态,假定边界细胞q[-1]和q[512]都是零(关闭状态)。由于没有异或关系,解决方案采用了case语句实现。
最低0.47元/天 解锁文章
381

被折叠的 条评论
为什么被折叠?



