Pages that link to "Item:Q4024954"
From MaRDI portal
The following pages link to The topological entropy of cellular automata is uncomputable (Q4024954):
Displaying 27 items.
- Observation of nonlinear systems via finite capacity channels: constructive data rate limits (Q290872) (← links)
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues (Q385957) (← links)
- Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines (Q596050) (← links)
- Computability of entropy and information in classical Hamiltonian systems (Q653552) (← links)
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type (Q676028) (← links)
- A characterization of the entropies of multidimensional shifts of finite type (Q974081) (← links)
- Topological and measure-theoretic properties of one-dimensional cellular automata (Q992262) (← links)
- On the topological directional entropy (Q1006008) (← links)
- On the dynamics and recursive properties of multidimensional symbolic systems (Q1016235) (← links)
- Attractors of linear cellular automata (Q1307699) (← links)
- On computing the entropy of cellular automata. (Q1401183) (← links)
- Effect of quantified irreducibility on the computability of subshift entropy (Q1737069) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- Chaotic properties of elementary cellular automata with majority memory (Q2313525) (← links)
- Computing topological entropy in a space of quartic polynomials (Q2473360) (← links)
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107) (← links)
- Decidability and undecidability in cellular automata (Q2869780) (← links)
- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift (Q2907509) (← links)
- Directional Metric Entropy and Lyapunov Exponents for Dynamical Systems Generated by Cellular Automata (Q3460643) (← links)
- Embeddings of dynamical systems into cellular automata (Q3598967) (← links)
- Complexity of Compact Proofreading for Self-assembled Patterns (Q3618694) (← links)
- Sensitive dependence on initial conditions for cellular automata (Q4935796) (← links)
- C0-stability of topological entropy for contactomorphisms (Q5002187) (← links)
- Dynamics and topological entropy of 1D Greenberg–Hastings cellular automata (Q5146584) (← links)
- A complete proof that square ice entropy is (Q6043363) (← links)
- On computing the Lyapunov exponents of reversible cellular automata (Q6095493) (← links)
