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

Computational Complexity Volume 22 || Cellular Automata as Models of Parallel Computation

โœ Scribed by Meyers, Robert A.


Book ID
115519606
Publisher
Springer New York
Year
2012
Weight
925 KB
Category
Article
ISBN
1461418003

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Computational Complexity of Finit
โœ 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