๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cellular automata as models of complexity

โœ Scribed by Wolfram, Stephen

Book ID
109736776
Publisher
Nature Publishing Group
Year
1984
Tongue
English
Weight
821 KB
Volume
311
Category
Article
ISSN
0028-0836

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
โœ K. Sutner ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N