Cellular Automata: Proceedings of an Interdisciplinary Workshop, Los Alamos, New Mexico 87545, USA, March 7-11, 1983Doyne Farmer, Tommaso Toffoli, Stephen Wolfram |
Contents
WOLFRAM S Universality and complexity in cellular automata | 1 |
A Applications of ergodic theory and sofic systems to cellular automata | 36 |
S Some applications of information theory to cellular automata | 45 |
Copyright | |
18 other sections not shown
Common terms and phrases
addition allow appear applied approach array attractors automaton behavior blocks cell cellular automata changes complex computation configurations connection considered construction contains continuous corresponding cycle defined depends described determined dimension discrete discussed dynamics effect electron elements energy entropy equations evolution example exists finite forcing four function give given Independent infinite initial inputs instructions iteration lattice length limit lines logical loop machine mapping mathematical mean measure mechanism memory models molecular moving natural neighbors nodes obtained operations particular patterns period physical possible probability problem processing propagation properties random relation represent requires reversible rule sequences shown shows signal similar simple simulation single soliton space spatial specified step structure suggested temporal theory tion transition typically universal variables video feedback