Результаты (
английский) 2:
[копия]Скопировано!
Cellular Machines<br>Cellular machines (SA) are characterized by space discreteism and time. Typically, a cell machine consists of a graph where each node is an automatic finite state (FSA) or cell. This graph usually has the appearance of a two-dimensional lattice, whose cells develop according to the global function of renewal applied evenly across all cells. As an argument, this update function takes the current state of the cell and the state of the cells in its neighborhood interaction.<br>that the update function asks for status information. The size and shape of the neighborhood range from annex to app. As CA evolves, the update function will determine how microscopic or local interactions affect each other's overall macroscopic behavior.
переводится, пожалуйста, подождите..