Author:
Hurd Lyman P.,Kari Jarkko,Culik Karel
Abstract
AbstractThere is no algorithm which will take a description of a celluar automaton and determine whether it has zero topological entropy, or for any fixed ε > 0 compute its topological entropy to a tolerance e. Furthermore a set of aperiodic Wang tiles arising from Penrose's kite and dart tiles is used to demonstrate specific examples of cellular automata with a single periodic point but non-trivial non-wandering sets, which furthermore can be constructed to have arbitrarily high topological entropy.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Reference14 articles.
1. The nilpotency problem of one-dimensional cellular automata;Kari;SIAM J. Comp.
2. The undecidability of the domino problem;Berger;Mem. Amer. Math. Soc.,1966
3. The noncomputability of the channel capacity of context-sensitive languages
4. An Introduction to Ergodic Theory
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献