View
7
Download
0
Category
Preview:
Citation preview
Cellular AutomataDead or Alive?
Martin Sacha
01.12.2011
1 / 15Cellular Automata @ brmlab
N
Introduction and theory
Speech overview
1 Introduction and theory
2 Inanimate algorithms
3 Undead species
4 Conclusion
2 / 15Cellular Automata @ brmlab
N
Introduction and theory
What is CA?
Grid of cells (limited, unlimited, self-closed)
Boolean or a Lukasiewicz logic
Conversion rule (Sleep/Born)
Speed of any object v = max(∆|x|,∆|y |)n c
3 / 15Cellular Automata @ brmlab
N
Introduction and theory
Lukasiewicz logic
Implication: F ⇒ (x , y) = min{1, 1− x + y}
Equivalence: F ⇔ (x , y) = 1− |x − y |
Negation: Fq(x) = 1− x
Weak Conjunction: F ∧ (x , y) = min{x , y}
Weak Disjunction: F ∨ (x , y) = max{x , y}
Strong Conjunction: F ⊗ (x , y) = max{0, x + y − 1}
Strong Disjunction: F ⊕ (x , y) = min{1, x + y}
4 / 15Cellular Automata @ brmlab
N
Introduction and theory
Kinds of CA
Wolfram’s classification scheme
5 / 15Cellular Automata @ brmlab
N
Introduction and theory
Moore-Myhill theorem
Possible states of any CA is mn
m is possible states of one cell;n is count of cellsThe Garden of Eden - parentless pattern
6 / 15Cellular Automata @ brmlab
N
Inanimate algorithms
Gosper’s glider gun
7 / 15Cellular Automata @ brmlab
N
Inanimate algorithms
Puffer train
8 / 15Cellular Automata @ brmlab
N
Undead species
Conway’s Game of Life
9 / 15Cellular Automata @ brmlab
N
Undead species
Rule 90
10 / 15Cellular Automata @ brmlab
N
Undead species
Dawkin’s biomorphs
11 / 15Cellular Automata @ brmlab
N
Undead species
Dawkin’s biomorphs
12 / 15Cellular Automata @ brmlab
N
Undead species
Karl Sims
13 / 15Cellular Automata @ brmlab
N
Undead species
Comparation of real and virtual life
14 / 15Cellular Automata @ brmlab
N
Conclusion
Conclusion
Martin ”sachy”Sachacored.coder (at) gmail.com
15 / 15Cellular Automata @ brmlab
N
Recommended