Phy 206 Final

Front 1

T OR F

One dimensional, two state cellular automata based on nearest neighbor interactions have 8 components to each rule.

Back 1

TRUE

Front 2

T OR F

All cellular automata are reversible if we know the state of every cell in any one generation.

Back 2

FALSE

Front 3

T OR F

Class 4 cellular automata have all the characteristics of living organisms.

Back 3

FALSE

Front 4

How many possible rules are there for the one-dimensional CA?

Back 4

256

Front 5

What does the component 001 mean when used in reference to a one-dimensional CA?

Back 5

WHITE-WHITE-RED

ONE RED, OR ON CELL ON RIGHT GIVES RISE TO A LIVE CENTER CELL IN THE NEXT GENERATION

Front 6

Describe class 2 cellular automata.

Back 6

CLASS 2 CA IS CA WITH AN ORDERED PATTERN WHE STARTING FROM RANDOM INITIAL CONDITIONS. THESE PATTERNS ARE USUALLY LINES, INCLUDING DIAGONALS AND TRIANGELS.

Front 7

In the Game of Life, how many live neighbors must a dead cell have in order to become a live cell?

Back 7

3

Front 8

What are the rules for Ballistic Deposition?

Back 8

1. DROP A CELL INTO ANY COLUMN
2. IT FALLS UNTIL IT HITS THE BOTTOM, LANDS ON TOP OF ANOTHER CELL OR MAKES CONTACT WITH THE SIDE OF A CELL

Front 9

What are the rules for Diffusion Limited Aggregation?

Back 9

1. PLACE A LIVE CELL, VARY FROM THE SEED OR EXISTING AGGREGATE
2. IT DOES A RANDOM WALK UNTIL IT MAKES CONTACT WITH ANY OTHER LIVE CELL
3. IF IT GETS TOO FAR AWAY FROM THE EXISTING AGGREGATE, THEN IT IS KILLED AND THE PROCESS BEGINS WITH A NEW CELL

Front 10

What are the rules for flocking?

Back 10

1. TRY TO MACTH THE VELOCITY OF THE GROUP
2. TRY TO MOVE TOWARD THE CENTER OF THE GROUP
3. TRY TO AVOID COLLISION IN THE GROUP

Front 11

---- ----- models provide a convient technique for exploring signal propogation, causality and self-organization.

Back 11

CELLULAR AUTOMATA

Front 12

A CA model is a collection of cells where the future characteristic of each cell is determined by the ---- characteristic of the cell and its neighbors according to a set of rules.

Back 12

PRESENT

Front 13

When the new or next generation of a cell is determined by the state of the current generation of the cell and the state of its two nearest neighbors, there are --- possibilities.

Back 13

EIGHT

Front 14

Automata classes are defined by the state of the automata when it is started from ---- initial conditions and allowed to evolve for an extended period of time.

Back 14

RANDOM

Front 15

Class 1 cellular automata is defined as those automata whose rules lead to --- states.

Back 15

UNIFORM

AFTER SOME UNSPECIFIED NUMBER OF GENERATIONS, ALL THE CELLS HAVE THE SAME BLACK OR WHITE STATE.

Front 16

Class 2 CA have ---- patterns.

Back 16

PERIODIC

ALL DIAGONAL LINES

Front 17

CA that never settle down to a final organized pattern are class ----. These automata normally will have organized structures form and exist for several generations.

Back 17

THREE

TRIANGELS ARE TYPICALLY FORMED

Front 18

Class 4 CA show a mixture of --- and organized behavior.

Back 18

CHAOTIC

Front 19

In this class, the final state is periodic. the colors often oscilate and form a striped pattern, diagonal lines for example.

Same as dropping a ball on a table that comes back to the same height- period 2

Back 19

CLASS 2

Front 20

This class has a final choatic state and an arrangement of inidividual structures, Appears random but we can preditc where it will end because the rules are set.

Back 20

CLASS 3

Front 21

In this class the final state is a set of structures that appear to mobe against an organized background.

Has random initial conditions, looks chaotic at first but it usually has a uniform background- like triangles.

Back 21

CLASS 4

Front 22

In 2-D or 1-D CA, you cannot go in reverse because you cannot tell where the first ball has been dropped.

Back 22

2-D

Front 23

In ___-D CA, we can always see the state of a previous generation.

Back 23

1

Front 24

In ___-D CA, we lose the ability to record the historical arrangement.

Back 24

2

Front 25

Name the rules of Conway's Game of Life.

Back 25

1. EACH CELL HAS 8 NEAREST NEIGHBORS
2. A LIVE CELL SURVIVES IF IT HAS 2 OR 3 NEAREST NEIGHBORS
3. IT DIES IF IT HAS MORE THAN 3 AND LESS THAN 2
4. A DEAD CELL COMES TO LIFE IF IT HAS EXACTLY THREE LIVE NEIGHBORS

Front 26

RULES:

Start with a 2-D matrix, pick a cell at the top and let the particle drop.

Each partical falls until it hits the bottom or makes contact with another cell.

Back 26

BALLISTIC DEPOSITION

Front 27

RULES:

Start with a single point, it comes in from all directions- not just the top.

Makes contact with a particle and it sticks, if it strays too far it dies and a new cell is formed.

Back 27

DIFFUSION LIMITED AGGREGATION

DLA

Front 28

RULES:

Seek the center

Match the velocity

Collission avoidacne

Back 28

FLOCKING

Front 29

VORTEX CHAOS=

Back 29

FLIPPING VELOCITY MATCHING