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