Long-range correlations in chaotic cellular automata
A survey of numerical experiments is presented on relations between simulated cellular automata, probabilistic finite automata, and computation chains based on generalized Turing machines. Markov chains and computation chains with special grammars are used as approximations, mainly as a tool permitting to diminish computer time compared to that needed in direct simulations. A superficial resemblance to chaotic states of low-dimensional dynamic systems is noted in some graphical displays. The existence of long-range correlations is attributed to local irreversibility, i.e. to the property that more than one non-retraceable transient leads to a particular, apparently stationary state.
- Computation theory of cellular automata
- Computing fractal dimensions for additive cellular automata
- scientific article; zbMATH DE number 3896306 (Why is no real title available?)
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 4072384 (Why is no real title available?)
- scientific article; zbMATH DE number 4088928 (Why is no real title available?)
- scientific article; zbMATH DE number 4090422 (Why is no real title available?)
- scientific article; zbMATH DE number 4092781 (Why is no real title available?)
- Local structure theory for cellular automata
- Statistical mechanics of cellular automata
- A bound on the decay of defect-defect correlation functions in two-dimensional complex order parameter equations
- Information flow in cellular automata
- The one-dimensional exactly 1 cellular automaton: replication, periodicity, and chaos from finite seeds
- The topological skeleton of cellular automaton dynamics
This page was built for publication: Long-range correlations in chaotic cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277681)
