

A095950


Number of distinct excluded blocks of length n in the evolution language of width 1 (i.e., time series) generated by the elementary cellular automaton of Rule 110, which has the capability of a universal Turing machine.


0



1, 3, 3, 5, 6, 12, 16, 17, 38, 42, 73, 112, 198
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

5,2


REFERENCES

ZhiSong Jiang, HuiMin Xie, Evolution Complexity of the Elementary Cellular Automaton Rule 18, Complex Systems, 13 (2002) 271195
Stephen Wolfram, Computation theory of cellular automata, Commun. Math. Phys. 96 (1984) 1557
Huimin Xie, Grammatical Complexity and OneDimensional Dynamical Systems, World Scientific, Singapore, 1996


LINKS

Table of n, a(n) for n=5..17.


EXAMPLE

For length 5 binary blocks, only one block, 11101, cannot be found in the time series generated by the elementary cellular automaton of Rule 110.


CROSSREFS

Sequence in context: A183561 A300183 A222704 * A089874 A092035 A164914
Adjacent sequences: A095947 A095948 A095949 * A095951 A095952 A095953


KEYWORD

nonn


AUTHOR

Huimin Xie (szhmxie(AT)pub.sz.jsinfo.net), Jul 13 2004


STATUS

approved



