Main themes

• cellular automata theory
• computability and complexity
• symbolic dynamics
• self-assembly tilings
• bootstrap percolation

Keywords

2d turing machines — abelian cellular automata — amalgamation — arithmetical hierarchy — arithmetical hierarchy of real numbers — asymptotic density — asynchronous reachability — automata networks — block-sequential update schedules — boolean automata networks — boolean networks — bootstrap percolation — bulking — captive cellular automata — cellular automata — cellular automata dynamics — chaos — classical ergodic theory — classification — co-transcriptional folding — combinatorics — combinatory logic — communication complexity — commutativity — complexity — computability — context-sensitive simulations — convergent cellular automata — convergent orbits — cooperation — correlations — coupling — decidability — diffusion — directional dynamics — dynamical systems — expansivity — factoring — freezing automata networks — freezing cellular automata — grouping — higher-dimensional turing machines — interconnection networks — intrinsic simulation — intrinsic simulations — intrinsic universality — lambda-calculus — limit sets — linear cellular automata — majority cellular automata — mds codes — model theory — molecular self-assembly — monotonicity — mso logic — mu-limit sets — nilpotency — normalisation — oritatami systems — polynomial hierarchy — prediction problem — probabilistic cellular automata — probability measures — pspace-completeness — randomization — rescaling — reversibility — rice theorem — self-assembly — self-assembly tiling — sensitivity to initial conditions — simulations — sofic subshifts — space symmetry — stochastic cellular automata — subshifts — symbolic dynamics — tilings — time symmetry — topological dynamics — traces — treewidth — turedos — turing universal — unique ergodicity — universality — update schedules — zero-one law