𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On time computability of functions in one-way cellular automata

✍ Scribed by Thomas Buchholz; Martin Kutrib

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
280 KB
Volume
35
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On computing the entropy of cellular aut
On computing the entropy of cellular automata
✍ Michele D'amico; Giovanni Manzini; Luciano Margara πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 208 KB

We study the topological entropy of a particular class of dynamical systems: cellular automata. The topological entropy of a dynamical system (X; F) is a measure of the complexity of the dynamics of F over the space X . The problem of computing (or even approximating) the topological entropy of a gi

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