Cellular Automata

Доклад, 09 Июня 2013, автор: пользователь скрыл имя

Описание работы


Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and as more specific representations of non-linear dynamics in a variety of scientific fields. Firstly, CA are (typically) spatially and temporally discrete: they are composed of a finite or denumerable set of homogeneous, simple units, the atoms or cells. At each time unit, the cells instantiate one of a finite set of states.

Работа содержит 1 файл

Cellular automato.docx

— 1.11 Мб (Открыть, Скачать)

Открыть текст работы Cellular Automata

Связанные документы