CellularAutomata

Question 1

What is a Cellular Automata formally defined as?

Answer 1

A tuple CA = (S d N f) where S is possible states d is lattice dimension N is neighborhood function f is state transition function

Question 2

What are the 4 classes of CA dynamic evolution?

Answer 2

1. Homogeneous state 2. Periodic structures 3. Chaotic patterns 4. Complex localized structures/self-organized behaviors

Question 3

What happens in a CA when λ ≈ 0.3?

Answer 3

The interaction feedback is strong but still allows regular self-organized structures, often producing Class 4 behavior (“edge of chaos”)

Question 4

What are the Game of Life rules for cell birth?

Answer 4

A dead cell becomes alive if it has exactly 3 alive neighbors

Question 5

What are the Game of Life rules for cell death?

Answer 5

Cells die from overcrowding (>3 neighbors) or loneliness (<2 neighbors)

Question 6

What distinguishes Rule 250 CA behavior?

Answer 6

It shows periodic behavior and never reaches equilibrium (global states continually evolve)

Question 7

What is Rule 30 CA known for?

Answer 7

Its pseudo-random/chaotic behavior used in random number generators

Question 8

How does perturbation affect asynchronous CA?

Answer 8

Global scale self-organized behaviors emerge when state transitions are perturbed

Question 9

What happens under moderate perturbation dynamics?

Answer 9

Global structures and spatial patterns emerge

Question 10

How is entropy measured in computer science for CA?

Answer 10

By the number of bits needed to represent information using compression rate for visual patterns

Question 11

What are the two key assumptions for distributed AI systems?

Answer 11

1. Asynchronous behavior (components act independently without global time knowledge) 2. Dynamic environment