This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
■ An (infinite) array of “cells”■ Each cell has a value from a k-ary state (assume binary)■ Each cell has has a position in the array and has r left and r
■ Class 1: Nearly all initial patterns evolve quickly into a stable, homogeneous state (fixed point)
■ Class 2: Nearly all initial patterns evolve quickly into stable or oscillating structures (periodic)
■ Class 3: Nearly all initial patterns evolve in a pseudo-random or chaotic manner (chaotic)
■ Class 4: Nearly all initial patterns evolve into structures that interact in complex and interesting ways. This class is capable of universal computation
■ 2-Dimensional Cellular Automata■ Developed by British mathematician John Conway■ Similar to Schelling’s model■ Each cell has eight neighbors■ Each cell can be “alive” or “dead”■ Instead of moving or staying, cells come alive, die or survive
■ Each cell has eight neighbors■ Each cell can be “alive” or “dead”■ Rules:■ a live cell with fewer than 2 live neighbors dies (loneliness)■ a live cell with 2 or 3 live neighbors survives (stasis)■ a live cell with more than 3 live neighbors dies (over crowding)■ a dead cell with exactly 3 live neighbors come alive (reproduction)