L ECTURE 12: C ELLULAR A UTOMATA 2 / D ISCRETE -T IME D YNAMICAL S - - PowerPoint PPT Presentation

l ecture 12 c ellular a utomata 2 d iscrete t ime d
SMART_READER_LITE
LIVE PREVIEW

L ECTURE 12: C ELLULAR A UTOMATA 2 / D ISCRETE -T IME D YNAMICAL S - - PowerPoint PPT Presentation

15-382 C OLLECTIVE I NTELLIGENCE S18 L ECTURE 12: C ELLULAR A UTOMATA 2 / D ISCRETE -T IME D YNAMICAL S YSTEMS 4 I NSTRUCTOR : G IANNI A. D I C ARO A ZOO OF BEHAVIORS : A NY REGULARITY ? 2 C LASS 1 3 C LASS 2 Rule 2 The direction and


slide-1
SLIDE 1

LECTURE 12: CELLULAR AUTOMATA 2 / DISCRETE-TIME DYNAMICAL SYSTEMS 4

INSTRUCTOR: GIANNI A. DI CARO

15-382 COLLECTIVE INTELLIGENCE – S18

slide-2
SLIDE 2

2

A ZOO OF BEHAVIORS: ANY REGULARITY?

slide-3
SLIDE 3

3

CLASS 1

slide-4
SLIDE 4

4

CLASS 2

Rule 2

The direction and location of the lines depend on the initial conditions, but the structural fact that we will have lines in a certain direction is independent from initial conditions Sierpinski gasket

slide-5
SLIDE 5

5

CLASS 3

Rule 184

slide-6
SLIDE 6

6

CLASS 4

Universal computation!

slide-7
SLIDE 7

7

RULE 110

slide-8
SLIDE 8

8

RULE 110: SPACE-TIME SCALES

slide-9
SLIDE 9

9

DEPENDENCE ON THE INITIAL STATE

Dependence ~ Elaboration of initial conditions

No dependence Trivial elaboration Structure does not depend but lines do  Identification of parameter of structure Strong dependence  Chaotic behaviors Complex elaboration,  Hard to predict

slide-10
SLIDE 10

10

DEPENDENCE ON INITIAL STATE

slide-11
SLIDE 11

11

LYAPOUNOV EXPONENTS

Two Lyapounov exponents: measuring information propagation on initial conditions along the two directions

Both 0 exponents, information doesn’t travel Positive exponents, initial information travels far away Positive exponents, going to zero

slide-12
SLIDE 12

12

UNIVERSAL COMPUTATION

slide-13
SLIDE 13

13

UNIVERSAL COMPUTATION

slide-14
SLIDE 14

14

LOCAL COMMUNICATIONS VS. GLOBAL BEHAVIORS

slide-15
SLIDE 15

15

INVERSE PROBLEM

slide-16
SLIDE 16

16

RULE 184: PARITY PROBLEMS

No single CA can solve the parity problem, but applying a sequence of elementary CAs can do it, for instance the following operator applied to a lattice of length 𝑀: Why could 184 be a good candidate for parity detection problems?

  • K. M. Lee, Hao Xu, and H. F. Chau, Parity problem with a cellular automaton solution, Phys. Rev. E 64,

026702, 2001