𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of dynamical systems: The case of cellular automata

✍ Scribed by P. Di Lena; L. Margara


Book ID
113641756
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
314 KB
Volume
206
Category
Article
ISSN
0890-5401

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

On the Computational Complexity of P Aut
✍ ErzsΓ©bet Csuhaj-VarjΓΊ; Oscar H. Ibarra; GyΓΆrgy Vaszil πŸ“‚ Article πŸ“… 2006 πŸ› Springer Netherlands 🌐 English βš– 296 KB