Toom A. Cellular Automata With Errors: Problems for Students of Probability (95K, LateX) ABSTRACT. The paper treats of uniform interacting random processes with discrete space and time, which may also be called probabilistical cellular automata with memory. Some notions and results about them, particularly about non-ergodicity vs. ergodicity and slow vs. fast convergence, are presented in a form understandable for undergraduates. Special attention is paid to examples and problems of various levels of difficulty.