User:Daniela A. Garcia S./Notebook/Modeling 2011 UNAM Genomics-Mexico/2011/06/22

From OpenWetWare
Jump to: navigation, search
Owwnotebook icon.png Project name <html><img src="/images/9/94/Report.png" border="0" /></html> Main project page
<html><img src="/images/c/c3/Resultset_previous.png" border="0" /></html>Previous entry<html>      </html>Next entry<html><img src="/images/5/5c/Resultset_next.png" border="0" /></html>

Cellular Automata Tutorial

Unit 1 Introduction

  • In a Dynamical System the new state depends only in the old state. They are discrete or continuous in time and state.
    • Continuous, described by diferential ecuations
    • Discrete, x t+1 = f(xt)

Cellular automata are discrete and deterministic dynamical systems in time and state. States split in pieces called cells (discrete values). Cells can have neighbors. As time goes by a new cell is produced depending on the old cell and the state of the neighbors.