方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机元胞自动机× | 元胞自动机× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1940s–1980s | 1940s–1950s (formalized); 1970 (Conway's Game of Life); 2002 (Wolfram's systematic classification) |
| 提出者≠ | von Neumann, J. / Ulam, S. (deterministic CA); probabilistic extension formalized by various authors including Wolfram, S. and Chopard, B. | John von Neumann and Stanislaw Ulam (1940s–1950s); popularized by John Conway (1970) and Stephen Wolfram (1980s–2002) |
| 类型≠ | Grid-based stochastic simulation | Grid-based computational simulation model |
| 开创性文献≠ | Wolfram, S. (2002). A New Kind of Science. Wolfram Media, Champaign, IL. ISBN: 9781579550080 | Wolfram, S. (2002). A New Kind of Science. Wolfram Media. ISBN: 978-1579550080 |
| 别名 | SCA, Probabilistic Cellular Automata, PCA, Stochastic CA | CA, Hücresel Otomat (Cellular Automata), lattice model, grid-based simulation |
| 相关 | 5 | 5 |
| 摘要≠ | Stochastic Cellular Automata (SCA) extend classical cellular automata by replacing deterministic transition rules with probabilistic ones, allowing each cell on a grid to change state according to a probability distribution conditioned on its neighborhood. This makes SCA a powerful tool for simulating real-world spatial processes where randomness, noise, and uncertainty govern local interactions — from epidemic spread and forest fires to traffic flow and material diffusion. | Cellular automata (CA) is a grid-based computational simulation model, first formalized by John von Neumann and Stanislaw Ulam in the 1940s–1950s and brought to wide attention by John Conway's Game of Life (1970) and Stephen Wolfram's systematic classification (2002), in which a lattice of cells — each holding a finite discrete state — evolves in discrete time steps according to local neighborhood interaction rules, causing complex global patterns to emerge from simple local specifications. |
| ScholarGate数据集 ↗ |
|
|