A. Toom

Algorithmical Unsolvability of the Ergodicity Problem for Binary Cellular Automata A. Toom (2000, issue 4)
Pseudo-Pinning in a Growth Model A. Toom (1998, issue 4)

Algorithmical Unsolvability of the Ergodicity Problem for Binary Cellular Automata
A. Toom (2000, issue 4)

Pseudo-Pinning in a Growth Model
A. Toom (1998, issue 4)

Laboratory of large random systems, Dept. of Mechanics and Mathematics
Moscow State University, Vorobievy Gory, 119952 Moscow Russia
E-mail: editor@math-mprf.org
Please enter our email addresses to the list of allowed addresses of your mail server

The journal was founded in 1995 by prof. Malyshev V. A.
Published by Polymat Publishing Company, Moscow, Russia
ISSN 1024-2953
The journal is published quaterly

Markov Processes And Related Fields

Scientific Journal

Submit article